/*
Multiply a FDBigInt by an int and add another int.
Result is computed in place.
Hope it fits!
769280
public void multaddMe(int iv, int addend)
	{
		long v = iv;
		long p;

		// unroll 0th iteration, doing addition.
		p = v * ((long) data[0] & 0xffffffffL) + ((long) addend & 0xffffffffL);
		data[0] = (int) p;
		p >>>= 32;
		for (int i = 1; i < nWords; i++)
		{
			p += v * ((long) data[i] & 0xffffffffL);
			data[i] = (int) p;
			p >>>= 32;
		}
		if (p != 0L)
		{
			data[nWords] = (int) p; // will fail noisily if illegal!
			nWords++;
		}
	}
1275773
function multiply(out, a, b) {
  out[0] = a[0] * b[0];
  out[1] = a[1] * b[1];
  out[2] = a[2] * b[2];
  return out;
}
1227879
function multiplyInteger(x, k) {
      var temp,
        carry = 0,
        i = x.length;

      for (x = x.slice(); i--;) {
        temp = x[i] * k + carry;
        x[i] = temp % BASE | 0;
        carry = temp / BASE | 0;
      }

      if (carry) x.unshift(carry);

      return x;
    }
1371119
function copyInt_(x,n) {
    var i,c;
    for (c=n,i=0;i<x.length;i++) {
      x[i]=c & mask;
      c>>=bpe;
    }
  }
276066
public static int addExact(int a, int b) {
        long result = (long) a + b;
        checkNoOverflow(result == (int) result);
        return (int) result;
    }
666282
public void add(int i, int value)
  {
    expand(_size + 1);

    System.arraycopy(_data, i, _data, i + 1, _size - i);
    _data[i] = value;
    _size++;
  }
742169
public void add(int anInt) {
        if (tc.isEntryEnabled())
            SibTr.entry(tc, "add");

        if (tc.isDebugEnabled())
            SibTr.debug(tc, "Params: int", anInt);

        // Have we filled up the current array?
        if (currentCursor == arraySize) {
            // Stash it in the Vector
            allArrays.add(current);

            // Create a new one
            current = new int[arraySize];

            // Set the cursor at the beginning
            currentCursor = 0;
        }

        // Now add the element at the correct position
        current[currentCursor] = anInt;

        // Move the cursor along
        currentCursor++;

        // Increment the size
        elements++;

        if (tc.isEntryEnabled())
            SibTr.exit(tc, "add");
    }
901911
static BigInteger pow5mult(BigInteger b, int k)
    {
        return b.multiply(BigInteger.valueOf(5).pow(k));
    }
316244
public void multiplyValue(int idx, double val) {
        values[idx] = s.times(values[idx], val); 
    }
1368221
private void increment( TldFernFeature f , boolean positive ) {
		if( positive ) {
			f.incrementP();
			if( f.numP > maxP )
				maxP = f.numP;
		} else {
			f.incrementN();
			if( f.numN > maxN )
				maxN = f.numN;
		}
	}
577882
@Inline(value="$1.add($2)")
	@Pure
	public static BigInteger operator_plus(BigInteger a, BigInteger b) {
		return a.add(b);
	}
1019049
def add_int(self,oid,value,label=None):
		""""""
		self.add_oid_entry(oid,'INTEGER',value,label=label)
447412
public static IntPoint Multiply(IntPoint point1, IntPoint point2) {
        IntPoint result = new IntPoint(point1);
        result.Multiply(point2);
        return result;
    }
122249
public int multiply(int x , int y ) {
		if( x==0 || y == 0)
			return 0;
		return exp[ log[x] + log[y]];
	}
255687
public FDBigInt mult(int iv)
	{
		long v = iv;
		int r[];
		long p;

		// guess adequate size of r.
		r = new int[(v * ((long) data[nWords - 1] & 0xffffffffL) > 0xfffffffL) ? nWords + 1 : nWords];
		p = 0L;
		for (int i = 0; i < nWords; i++)
		{
			p += v * ((long) data[i] & 0xffffffffL);
			r[i] = (int) p;
			p >>>= 32;
		}
		if (p == 0L)
		{
			return new FDBigInt(r, nWords);
		}
		else
		{
			r[nWords] = (int) p;
			return new FDBigInt(r, nWords + 1);
		}
	}
756707
function add(out, a, b) {
  out[0] = a[0] + b[0];
  out[1] = a[1] + b[1];
  out[2] = a[2] + b[2];
  return out;
}
580145
public static function int_add($x, $y)
    {
        if ($y == 0) {
            return $x;
        } else {
            return self::int_add($x ^ $y, ($x & $y) << 1);
        }
    }