| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | BOCSU.java | 239 int modulo = number % factor; in getNegDivMod() local
241 if (modulo < 0) { in getNegDivMod()
243 modulo += factor; in getNegDivMod()
245 return (result << 32) | modulo; in getNegDivMod()
293 int modulo = (int)division; in writeDiff() local
297 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
300 buffer[offset + 2] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
303 modulo = (int)division; in writeDiff()
305 buffer[offset + 1] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
310 buffer[offset + 3] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
[all …]
|
| /external/fio/lib/ |
| D | num2str.c | 17 unsigned int modulo, decimals; in num2str() local
37 modulo = -1U; in num2str()
43 modulo = num % thousand[!!pow2]; in num2str()
45 carry = modulo >= thousand[!!pow2] / 2; in num2str()
49 if (modulo == -1U) { in num2str()
68 sprintf(tmp, "%u", modulo); in num2str()
72 modulo = (modulo + 9) / 10; in num2str()
75 sprintf(buf, "%llu.%u%s%s", (unsigned long long) num, modulo, in num2str()
|
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| D | t058rewriteAST70.g | 4 modulo
5 : 'modulo' ID ('(' parms+ ')')? -> ^('modulo' ID ^(PARMS parms+)?)
|
| /external/valgrind/none/tests/ppc64/ |
| D | data-cache-instructions.stdout.exp | 2 Passed dcbzl test at un-aligned (1 modulo block_size) address within the test block.
3 Passed dcbzl test at un-aligned ((block_size - 1) modulo block_size) address within the test block.
|
| /external/valgrind/none/tests/ppc32/ |
| D | data-cache-instructions.stdout.exp | 2 Passed dcbzl test at un-aligned (1 modulo block_size) address within the test block.
3 Passed dcbzl test at un-aligned ((block_size - 1) modulo block_size) address within the test block.
|
| /external/chromium-trace/trace-viewer/third_party/Paste/paste/exceptions/ |
| D | serial_number_generator.py | 72 modulo = base ** length
75 number = (number * 256 + six.byte2int([c])) % modulo
|
| /external/v8/src/ |
| D | codegen.cc | 31 double modulo(double x, double y) { in modulo() function
38 double modulo(double x, double y) {
50 double modulo(double x, double y) {
|
| D | codegen.h | 104 double modulo(double x, double y);
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| D | antlr3collections.c | 155 table->modulo = sizeHint; in antlr3HashTableNew()
208 for (bucket = 0; bucket < table->modulo; bucket++) in antlr3HashFree()
283 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashRemoveI()
344 bucket = table->buckets + (hash % table->modulo); in antlr3HashRemove()
452 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashGetI()
496 bucket = table->buckets + (hash % table->modulo); in antlr3HashGet()
532 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashPutI()
607 bucket = table->buckets + (hash % table->modulo); in antlr3HashPut()
733 if (en->bucket >= en->table->modulo) in antlr3EnumNext()
791 while (en->bucket < en->table->modulo) in antlr3EnumNextEntry()
|
| /external/lldb/examples/python/ |
| D | sbvalue.py | 196 def __ipow__(self, other, modulo): argument
197 result = self.__pow__(self, other, modulo)
|
| /external/v8/test/webkit/ |
| D | mod-by-zero-expected.txt | 24 This tests that modulo with zero does not crash but returns NaN.
|
| /external/skia/tools/lua/ |
| D | lua_pictures.cpp | 33 DEFINE_string(modulo, "", "[--modulo <remainder> <divisor>]: only run tests for which "
|
| /external/llvm/docs/ |
| D | R600Usage.rst | 19 Below some of the currently supported features (modulo bugs). These
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| D | antlr3collections.h | 111 ANTLR3_UINT32 modulo; member
|
| /external/zlib/src/doc/ |
| D | rfc1950.txt | 327 are done modulo 65521. s1 is initialized to 1, s2 to zero. The
484 The modulo on unsigned long accumulators can be delayed for 5552
485 bytes, so the modulo operation time is negligible. If the bytes
525 % modulo operator: a % b is the remainder of a divided by b.
|
| /external/iputils/doc/ |
| D | clockdiff.sgml | 76 <command/clockdiff/ shows difference in time modulo 24 days.
|
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| D | jsilver.sablecc | 499 | {modulo} [left]:factor percent [right]:value // x.y % a.b
500 {->New expression.modulo(left.expression, right.expression)}
700 | {modulo} [left]:expression [right]:expression // x % y
|
| /external/srtp/doc/ |
| D | draft-irtf-cfrg-icm-00.txt | 217 Implementation of the `add one modulo 2^m' operation is simple. For
223 The implementation of general purpose addition modulo 2^m is
|
| /external/libopus/ |
| D | README | 136 modulo 2^N to be within range of the type,
|
| /external/boringssl/linux-arm/crypto/modes/ |
| D | ghashv8-armx.S | 111 @ as loop is modulo-scheduled
|
| /external/llvm/lib/Support/ |
| D | APInt.cpp | 1374 APInt APInt::multiplicativeInverse(const APInt& modulo) const { in multiplicativeInverse()
1375 assert(ult(modulo) && "This APInt must be smaller than the modulo"); in multiplicativeInverse()
1385 APInt r[2] = { modulo, *this }; in multiplicativeInverse()
1410 return t[i].isNegative() ? t[i] + modulo : t[i]; in multiplicativeInverse()
|
| /external/chromium-trace/trace-viewer/third_party/WebOb/docs/ |
| D | jsonrpc-example.txt | 614 Fault: Method error calling http://localhost:8080: integer division or modulo by zero
620 ZeroDivisionError: integer division or modulo by zero
|
| /external/v8/src/compiler/ |
| D | machine-operator-reducer.cc | 387 return ReplaceFloat64(modulo(m.left().Value(), m.right().Value())); in Reduce()
|
| /external/strace/ |
| D | strace.spec | 353 - new upstream version, fixes all known bugs modulo ia64 and s390 issues
|
| /external/lldb/scripts/Python/ |
| D | python-extensions.swig | 962 def __ipow__(self, other, modulo):
963 result = self.__pow__(self, other, modulo)
|