| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| D | BOCSU.java | 242 int modulo = number % factor; in getNegDivMod() local
244 if (modulo < 0) { in getNegDivMod()
246 modulo += factor; in getNegDivMod()
248 return (result << 32) | modulo; in getNegDivMod()
296 int modulo = (int)division; in writeDiff() local
300 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
303 buffer[offset + 2] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
306 modulo = (int)division; in writeDiff()
308 buffer[offset + 1] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
313 buffer[offset + 3] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
[all …]
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | BOCSU.java | 241 int modulo = number % factor; in getNegDivMod() local
243 if (modulo < 0) { in getNegDivMod()
245 modulo += factor; in getNegDivMod()
247 return (result << 32) | modulo; in getNegDivMod()
295 int modulo = (int)division; in writeDiff() local
299 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
302 buffer[offset + 2] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
305 modulo = (int)division; in writeDiff()
307 buffer[offset + 1] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
312 buffer[offset + 3] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
[all …]
|
| /external/fio/lib/ |
| D | num2str.c | 26 unsigned int modulo; in num2str() local
68 modulo = -1U; in num2str()
74 modulo = num % thousand[!!pow2]; in num2str()
76 carry = modulo >= thousand[!!pow2] / 2; in num2str()
83 if (modulo == -1U) { in num2str()
107 assert(modulo < thousand[!!pow2]); in num2str()
109 sprintf(tmp, fmt, (double)modulo / (double)thousand[!!pow2]); 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/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/python/cpython2/Lib/ |
| D | decimal.py | 1851 def _power_modulo(self, other, modulo, context=None): argument
1858 modulo = _convert_other(modulo, raiseit=True)
1867 modulo_is_nan = modulo._isnan()
1877 modulo)
1882 return modulo._fix_nan(context)
1887 modulo._isinteger()):
1895 if not modulo:
1901 if modulo.adjusted() >= context.prec:
1923 modulo = abs(int(modulo))
1928 base = (base.int % modulo * pow(10, base.exp, modulo)) % modulo
[all …]
|
| /external/v8/src/ |
| D | codegen.h | 101 V8_EXPORT_PRIVATE double modulo(double x, double y);
|
| D | codegen.cc | 27 double modulo(double x, double y) { in modulo() function
39 double modulo(double x, double y) {
|
| D | conversions.cc | 487 double remainder = modulo(integer, radix); in DoubleToRadixCString()
|
| /external/skia/tools/lua/ |
| D | lua_pictures.cpp | 34 static DEFINE_string(modulo, "", "[--modulo <remainder> <divisor>]: only run tests for which "
|
| /external/autotest/client/deps/glbench/src/ |
| D | yuv2rgb_2.glslf | 35 * of the original image is 2 modulo 4.
|
| /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/wycheproof/doc/ |
| D | dh.md | 7 if the multiplicative group modulo p contains small subgroups. In particular an
10 private key modulo the order of the small subgroup. Several countermeasures
|
| /external/eigen/doc/ |
| D | CustomizingEigen_NullaryExpr.dox | 75 …ow or column index arrays can also be expressions to perform offsetting, modulo, striding, reverse…
|
| /external/iputils/doc/ |
| D | clockdiff.sgml | 76 <command/clockdiff/ shows difference in time modulo 24 days.
|
| /external/llvm/docs/ |
| D | AMDGPUUsage.rst | 42 Below some of the currently supported features (modulo bugs). These
|
| /external/python/cpython2/Doc/library/ |
| D | decimal.rst | 1373 .. method:: power(x, y[, modulo])
1375 Return ``x`` to the power of ``y``, reduced modulo ``modulo`` if given.
1383 With three arguments, compute ``(x**y) % modulo``. For the three argument
1389 - ``modulo`` must be nonzero and have at most 'precision' digits
1391 The value resulting from ``Context.power(x, y, modulo)`` is
1393 % modulo`` with unbounded precision, but is computed more
1395 the exponents of ``x``, ``y`` and ``modulo``. The result is
1514 Can occur with division, modulo division, or when raising a number to a negative
|
| /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/libopus/ |
| D | README | 136 modulo 2^N to be within range of the type,
|
| /external/boringssl/ios-arm/crypto/chacha/ |
| D | chacha-armv4.S | 82 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
204 str r8, [sp,#4*(16+8)] @ modulo-scheduled store
850 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
1088 str r8, [sp,#4*(16+8)] @ modulo-scheduled store
1297 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
|
| /external/boringssl/linux-arm/crypto/chacha/ |
| D | chacha-armv4.S | 81 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
203 str r8, [sp,#4*(16+8)] @ modulo-scheduled store
847 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
1085 str r8, [sp,#4*(16+8)] @ modulo-scheduled store
1294 ldr r12,[sp,#4*(12)] @ modulo-scheduled load
|
| /external/python/cpython2/Doc/reference/ |
| D | expressions.rst | 957 .. index:: single: modulo
959 The ``%`` (modulo) operator yields the remainder from the division of the first
963 (since ``3.14`` equals ``4*0.7 + 0.34``.) The modulo operator always yields a
968 The integer division and modulo operators are connected by the following
969 identity: ``x == (x/y)*y + (x%y)``. Integer division and modulo are also
975 In addition to performing the modulo operation on numbers, the ``%`` operator is
981 The floor division operator, the modulo operator, and the :func:`divmod`
|