| /third_party/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 …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/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 …]
|
| /third_party/libwebsockets/lib/core/ |
| D | lws_map.c | 111 size_t modulo = info->modulo; in lws_map_create() local
118 if (!modulo) in lws_map_create()
119 modulo = 8; in lws_map_create()
121 size = sizeof(*map) + (modulo * sizeof(lws_map_hashtable_t)); in lws_map_create()
131 map->info.modulo = modulo; in lws_map_create()
140 while (modulo--) in lws_map_create()
141 ht[modulo].map_owner = map; in lws_map_create()
168 while (map->info.modulo--) { in lws_map_destroy()
209 hti = h % map->info.modulo; in lws_map_item_create()
234 ht[h % map->info.modulo].ho.head) { in lws_map_item_lookup()
|
| /third_party/skia/third_party/externals/tint/src/transform/ |
| D | zero_init_workgroup_memory.cc | 55 uint32_t modulo = 1; member
63 return modulo == i.modulo && division == i.division; in operator ==()
71 return utils::Hash(i.modulo, i.division); in operator ()()
314 auto modulo = num_values * arr->Count(); in BuildZeroingStatements() local
316 auto a = get_expr(modulo); in BuildZeroingStatements()
318 array_indices.add(ArrayIndex{modulo, division}); in BuildZeroingStatements()
320 utils::GetOrCreate(array_index_names, ArrayIndex{modulo, division}, in BuildZeroingStatements()
349 (num_iterations > index.modulo) in DeclareArrayIndices()
351 ast::BinaryOp::kModulo, iteration(), b.Expr(index.modulo)) in DeclareArrayIndices()
|
| /third_party/python/Modules/_decimal/libmpdec/literature/ |
| D | bignum.txt | 40 c1 = fnt_convolute(u, v, P1) # convolute modulo prime1
41 c2 = fnt_convolute(u, v, P2) # convolute modulo prime2
42 c3 = fnt_convolute(u, v, P3) # convolute modulo prime3
79 transforms modulo three different primes to get the
|
| /third_party/openssl/doc/man3/ |
| D | BN_mod_exp_mont.pod | 28 BN_mod_exp_mont() computes I<a> to the I<p>-th power modulo I<m> (C<rr=a^p % m>)
33 BN_mod_exp_mont_consttime() computes I<a> to the I<p>-th power modulo I<m>
41 the I<p1>-th power modulo I<m1> (C<rr1=a1^p1 % m1>) and I<a2> to the I<p2>-th
42 power modulo I<m2> (C<rr2=a2^p2 % m2>) using Montgomery multiplication. For some
|
| D | BN_mod_inverse.pod | 5 BN_mod_inverse - compute inverse modulo n
16 BN_mod_inverse() computes the inverse of B<a> modulo B<n>
|
| D | BN_add.pod | 73 BN_nnmod() reduces I<a> modulo I<m> and places the nonnegative
76 BN_mod_add() adds I<a> to I<b> modulo I<m> and places the nonnegative
79 BN_mod_sub() subtracts I<b> from I<a> modulo I<m> and places the
89 BN_mod_sqr() takes the square of I<a> modulo B<m> and places the
102 BN_mod_exp() computes I<a> to the I<p>-th power modulo I<m> (C<r=a^p %
|
| /third_party/skia/third_party/externals/swiftshader/src/Pipeline/ |
| D | ComputeProgram.cpp | 256 auto modulo = groupIndex; in run() local
257 auto groupOffsetZ = modulo / (groupCountX * groupCountY); in run()
258 modulo -= groupOffsetZ * (groupCountX * groupCountY); in run()
259 auto groupOffsetY = modulo / groupCountX; in run()
260 modulo -= groupOffsetY * groupCountX; in run()
261 auto groupOffsetX = modulo; in run()
|
| /third_party/node/lib/internal/ |
| D | webidl.js | 66 function modulo(x, y) { function
151 x = modulo(x, pow2(bitLength));
|
| /third_party/jerryscript/jerry-core/ecma/builtin-objects/ |
| D | ecma-builtin-helpers-date.c | 75 ecma_number_t modulo = fmod (time, ECMA_DATE_MS_PER_DAY); in ecma_date_time_within_day() local
76 if (modulo < 0) in ecma_date_time_within_day()
78 modulo += ECMA_DATE_MS_PER_DAY; in ecma_date_time_within_day()
81 return modulo; in ecma_date_time_within_day()
|
| /third_party/openGLES/extensions/INTEL/ |
| D | INTEL_shader_integer_functions2.txt | 116 Returns |x - y| clamped to the range of the return type (instead of modulo
128 Returns x + y clamped to the range of the type of x (instead of modulo
139 Returns (x+y) >> 1. The intermediate sum does not modulo overflow.
149 Returns (x+y+1) >> 1. The intermediate sum does not modulo overflow.
159 Returns x - y clamped to the range of the type of x (instead of modulo
|
| /third_party/libphonenumber/metadata/src/main/proto/ |
| D | types.proto | 21 // Enum names must match the element names in the XML metadata modulo casing.
61 // Enum names must match the element names in the XML metadata modulo casing.
|
| /third_party/mesa3d/src/compiler/nir/ |
| D | nir_lower_idiv.c | 124 emit_udiv(nir_builder *bld, nir_ssa_def *numer, nir_ssa_def *denom, bool modulo) in emit_udiv() argument
141 if (!modulo) { in emit_udiv()
150 if (modulo) { in emit_udiv()
|
| /third_party/ffmpeg/libavfilter/ |
| D | af_headphone.c | 154 const uint32_t modulo = (uint32_t)buffer_length - 1; in headphone_convolute() local
181 read = (wr - (ir_len - 1)) & modulo; in headphone_convolute()
200 wr = (wr + 1) & modulo; in headphone_convolute()
223 const uint32_t modulo = (uint32_t)buffer_length - 1; in headphone_fast_convolute() local
241 wr = (wr + 1) & modulo; in headphone_fast_convolute()
289 int write_pos = (wr + j) & modulo; in headphone_fast_convolute()
|
| /third_party/typescript/tests/baselines/reference/ |
| D | unicodeExtendedEscapesInTemplates11_ES6.types | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| D | unicodeExtendedEscapesInStrings11_ES6.types | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| D | unicodeExtendedEscapesInTemplates11_ES5.types | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| D | unicodeExtendedEscapesInStrings11_ES5.types | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| D | unicodeExtendedEscapesInStrings11_ES5.symbols | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| D | unicodeExtendedEscapesInTemplates11_ES6.symbols | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| D | unicodeExtendedEscapesInTemplates11_ES5.symbols | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| D | unicodeExtendedEscapesInStrings11_ES6.symbols | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| D | unicodeExtendedEscapesInRegularExpressions11_ES6.types | 3 // 2. Let cu2 be ((cp – 65536) modulo 1024) + 0xDC00.
|
| /third_party/python/Lib/ |
| D | _pydecimal.py | 1966 def _power_modulo(self, other, modulo, context=None): argument
1972 modulo = _convert_other(modulo)
1973 if modulo is NotImplemented:
1974 return modulo
1983 modulo_is_nan = modulo._isnan()
1993 modulo)
1998 return modulo._fix_nan(context)
2003 modulo._isinteger()):
2011 if not modulo:
2017 if modulo.adjusted() >= context.prec:
[all …]
|