HomeSort by relevance Sort by last modified time
    Searched refs:remainder (Results 101 - 125 of 450) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/proguard/src/proguard/evaluation/value/
IntegerValue.java 121 * Returns the remainder of this IntegerValue divided by the given
124 public abstract IntegerValue remainder(IntegerValue other) method in class:IntegerValue
128 * Returns the remainder of the given IntegerValue divided by this
312 * Returns the remainder of this IntegerValue divided by the given
315 public IntegerValue remainder(UnknownIntegerValue other) method in class:IntegerValue
317 return remainder((IntegerValue)other);
321 * Returns the remainder of the given UnknownIntegerValue divided by this
556 * Returns the remainder of this IntegerValue divided by the given
559 public IntegerValue remainder(SpecificIntegerValue other) method in class:IntegerValue
561 return remainder((IntegerValue)other)
803 public IntegerValue remainder(ParticularIntegerValue other) method in class:IntegerValue
    [all...]
UnknownIntegerValue.java 109 public IntegerValue remainder(IntegerValue other) method in class:UnknownIntegerValue
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
BigIntegerDivideTest.java 28 * Methods: divide, remainder, mod, and divideAndRemainder
399 * Remainder of division by zero
409 aNumber.remainder(bNumber);
416 * Remainder of division of equal numbers
426 BigInteger result = aNumber.remainder(bNumber);
436 * Remainder of division of two positive numbers
446 BigInteger result = aNumber.remainder(bNumber);
456 * Remainder of division of two negative numbers
466 BigInteger result = aNumber.remainder(bNumber);
476 * Remainder of division of two numbers of different signs
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/html/shadow/
DateTimeEditElement.cpp 138 || !stepRange().minimum().remainder(static_cast<int>(msPerSecond)).isZero()
139 || !stepRange().step().remainder(static_cast<int>(msPerSecond)).isZero();
360 Decimal hourPartOfMinimum = (stepRange().minimum().abs().remainder(decimalMsPerDay) / static_cast<int>(msPerHour)).floor();
361 return hourPartOfMinimum == m_dateValue.hour() && stepRange().step().remainder(decimalMsPerDay).isZero();
370 return stepRange().minimum().abs().remainder(decimalMsPerSecond) == m_dateValue.millisecond() && stepRange().step().remainder(decimalMsPerSecond).isZero();
379 Decimal minutePartOfMinimum = (stepRange().minimum().abs().remainder(decimalMsPerHour) / static_cast<int>(msPerMinute)).floor();
380 return minutePartOfMinimum == m_dateValue.minute() && stepRange().step().remainder(decimalMsPerHour).isZero();
389 Decimal secondPartOfMinimum = (stepRange().minimum().abs().remainder(decimalMsPerMinute) / static_cast<int>(msPerSecond)).floor();
390 return secondPartOfMinimum == m_dateValue.second() && stepRange().step().remainder(decimalMsPerMinute).isZero()
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
DFAState.java 295 * (if s[i]-t is nil, don't add). The remainder is t-s[i], which is
297 * remainder must then be compared against the i+1..n elements in s
299 * and smaller remainder. Stop when you run out of s elements or
300 * remainder goes to nil. If remainder is non nil when you run out of
301 * s elements, then add remainder to the end.
318 IntSet remainder = t; // remainder starts out as whole set to add local
358 remainder = t.subtract(s_i);
359 if ( remainder.isNil() )
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/
DebugTreeGrammar.g3 68 | ^('%' a=expr b=expr) { $value = $a.value.remainder($b.value); }
ProfileTreeGrammar.g3 68 | ^('%' a=expr b=expr) { $value = $a.value.remainder($b.value); }
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
RSACoreEngine.java 166 // we have the extra factors, use the Chinese Remainder Theorem - the author
181 mP = (input.remainder(p)).modPow(dP, p);
184 mQ = (input.remainder(q)).modPow(dQ, q);
  /external/chromium_org/third_party/WebKit/Source/core/html/
BaseDateAndTimeInputType.cpp 130 if (step.remainder(msecPerMinute).isZero())
132 if (step.remainder(msecPerSecond).isZero())
  /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/
WidthCache.h 64 bool remainder = length & 1; local
75 if (remainder) {
  /external/chromium_org/third_party/icu/source/i18n/
gregoimp.h 54 * the modulus remainder. Unlike the built-in division, this is
57 * -1 with <code>remainder</code> => 3. NOTE: If numerator is
61 * @param remainder output parameter to receive the
62 * remainder. Unlike <code>numerator % denominator</code>, this
68 int32_t& remainder);
71 * For a positive divisor, return the quotient and remainder
72 * such that dividend = quotient*divisor + remainder and
73 * 0 <= remainder < divisor.
81 double& remainder);
  /external/guava/guava/src/com/google/common/primitives/
UnsignedInteger.java 143 * Returns the remainder of dividing this by {@code val}.
145 public UnsignedInteger remainder(UnsignedInteger val) { method in class:UnsignedInteger
147 return asUnsigned(UnsignedInts.remainder(value, val.value));
UnsignedLong.java 140 * Returns the remainder of dividing this by {@code val}.
142 public UnsignedLong remainder(UnsignedLong val) { method in class:UnsignedLong
144 return asUnsigned(UnsignedLongs.remainder(value, val.value));
  /external/guava/guava-tests/test/com/google/common/primitives/
UnsignedIntsTest.java 78 assertEquals((int) (a % b), UnsignedInts.remainder((int) a, (int) b));
96 - (divisor * UnsignedInts.divide(dividend, divisor) + UnsignedInts.remainder(dividend,
UnsignedIntegerTest.java 175 aUnsigned.bigIntegerValue().remainder(bUnsigned.bigIntegerValue()).intValue();
176 UnsignedInteger unsignedRem = aUnsigned.remainder(bUnsigned);
186 UnsignedInteger.asUnsigned(a).remainder(UnsignedInteger.ZERO);
UnsignedLongTest.java 187 .remainder(bUnsigned.bigIntegerValue())
189 UnsignedLong unsignedRem = aUnsigned.remainder(bUnsigned);
199 UnsignedLong.asUnsigned(a).remainder(UnsignedLong.ZERO);
  /external/icu4c/i18n/
gregoimp.h 54 * the modulus remainder. Unlike the built-in division, this is
57 * -1 with <code>remainder</code> => 3. NOTE: If numerator is
61 * @param remainder output parameter to receive the
62 * remainder. Unlike <code>numerator % denominator</code>, this
68 int32_t& remainder);
71 * For a positive divisor, return the quotient and remainder
72 * such that dividend = quotient*divisor + remainder and
73 * 0 <= remainder < divisor.
81 double& remainder);
  /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
fixed-dtoa.cc 241 // (-exponent). Inside the function the non-converted remainder of fractionals
338 // The quotient delivers the first digits, and the remainder fits into a 64
346 uint64_t remainder; local
348 // Then need q (quotient) and r (remainder) as follows:
360 remainder = (dividend % divisor) << divisor_power;
364 remainder = (dividend % divisor) << exponent;
367 FillDigits64FixedLength(remainder, divisor_power, buffer, length);
  /external/chromium_org/v8/src/
fixed-dtoa.cc 240 // (-exponent). Inside the function the non-converted remainder of fractionals
337 // The quotient delivers the first digits, and the remainder fits into a 64
345 uint64_t remainder; local
347 // Then need q (quotient) and r (remainder) as follows:
359 remainder = (dividend % divisor) << divisor_power;
363 remainder = (dividend % divisor) << exponent;
366 FillDigits64FixedLength(remainder, divisor_power, buffer, length);
  /external/v8/src/
fixed-dtoa.cc 240 // (-exponent). Inside the function the non-converted remainder of fractionals
337 // The quotient delivers the first digits, and the remainder fits into a 64
345 uint64_t remainder; local
347 // Then need q (quotient) and r (remainder) as follows:
359 remainder = (dividend % divisor) << divisor_power;
363 remainder = (dividend % divisor) << exponent;
366 FillDigits64FixedLength(remainder, divisor_power, buffer, length);
  /libcore/luni/src/main/java/java/math/
BigInt.java 300 static void division(BigInt dividend, BigInt divisor, BigInt quotient, BigInt remainder) {
308 if (remainder != null) {
309 remainder.makeValid();
310 rem = remainder.bignum;
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
ScriptFormatterWorker.js 59 var remainder = totalLength % chunkSize;
60 var partialLength = totalLength - remainder;
61 return (partialLength / chunkSize) + (remainder ? 1 : 0);
  /external/chromium_org/third_party/libjingle/source/talk/base/
ifaddrs-android.cc 125 char remainder = 0xff; local
126 remainder <<= (8 - prefixlen % 8);
127 *prefix = remainder;
  /external/chromium_org/third_party/mesa/src/src/mesa/main/
image.c 156 GLint bytes_per_pixel, bytes_per_row, remainder, bytes_per_image; local
165 remainder = bytes_per_row % alignment;
166 if (remainder > 0)
167 bytes_per_row += (alignment - remainder);
281 GLint bytesPerRow, remainder; local
306 remainder = bytesPerRow % packing->Alignment;
307 if (remainder > 0) {
308 bytesPerRow += (packing->Alignment - remainder);
329 GLint bytesPerRow, bytesPerImage, remainder; local
354 remainder = bytesPerRow % packing->Alignment
    [all...]
  /external/guava/guava-tests/test/com/google/common/hash/
AbstractStreamingHasherTest.java 206 int remainder = a % b;
207 return remainder == 0 ? a : a + b - remainder;

Completed in 478 milliseconds

1 2 3 45 6 7 8 91011>>