Home
last modified time | relevance | path

Searched refs:step (Results 101 - 125 of 957) sorted by relevance

12345678910>>...39

/third_party/icu/icu4c/source/i18n/
H A Dcollationrootelements.cpp91 int32_t step; in getPrimaryBefore() local
96 step = (int32_t)q & PRIMARY_STEP_MASK; in getPrimaryBefore()
97 if(step == 0) { in getPrimaryBefore()
108 step = (int32_t)nextElement & PRIMARY_STEP_MASK; in getPrimaryBefore()
112 return Collation::decTwoBytePrimaryByOneStep(p, isCompressible, step); in getPrimaryBefore()
114 return Collation::decThreeBytePrimaryByOneStep(p, isCompressible, step); in getPrimaryBefore()
176 int32_t step; in getPrimaryAfter() local
177 if((q & SEC_TER_DELTA_FLAG) == 0 && (step = (int32_t)q & PRIMARY_STEP_MASK) != 0) { in getPrimaryAfter()
180 return Collation::incTwoBytePrimaryByOffset(p, isCompressible, step); in getPrimaryAfter()
182 return Collation::incThreeBytePrimaryByOffset(p, isCompressible, step); in getPrimaryAfter()
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationrootelements.cpp91 int32_t step; in getPrimaryBefore() local
96 step = (int32_t)q & PRIMARY_STEP_MASK; in getPrimaryBefore()
97 if(step == 0) { in getPrimaryBefore()
108 step = (int32_t)nextElement & PRIMARY_STEP_MASK; in getPrimaryBefore()
112 return Collation::decTwoBytePrimaryByOneStep(p, isCompressible, step); in getPrimaryBefore()
114 return Collation::decThreeBytePrimaryByOneStep(p, isCompressible, step); in getPrimaryBefore()
176 int32_t step; in getPrimaryAfter() local
177 if((q & SEC_TER_DELTA_FLAG) == 0 && (step = (int32_t)q & PRIMARY_STEP_MASK) != 0) { in getPrimaryAfter()
180 return Collation::incTwoBytePrimaryByOffset(p, isCompressible, step); in getPrimaryAfter()
182 return Collation::incThreeBytePrimaryByOffset(p, isCompressible, step); in getPrimaryAfter()
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationrootelements.cpp91 int32_t step; in getPrimaryBefore() local
96 step = (int32_t)q & PRIMARY_STEP_MASK; in getPrimaryBefore()
97 if(step == 0) { in getPrimaryBefore()
108 step = (int32_t)nextElement & PRIMARY_STEP_MASK; in getPrimaryBefore()
112 return Collation::decTwoBytePrimaryByOneStep(p, isCompressible, step); in getPrimaryBefore()
114 return Collation::decThreeBytePrimaryByOneStep(p, isCompressible, step); in getPrimaryBefore()
176 int32_t step; in getPrimaryAfter() local
177 if((q & SEC_TER_DELTA_FLAG) == 0 && (step = (int32_t)q & PRIMARY_STEP_MASK) != 0) { in getPrimaryAfter()
180 return Collation::incTwoBytePrimaryByOffset(p, isCompressible, step); in getPrimaryAfter()
182 return Collation::incThreeBytePrimaryByOffset(p, isCompressible, step); in getPrimaryAfter()
[all...]
/third_party/FatFs/documents/res/
H A Dapp5.c10 DWORD clst, clsz, step; in test_contiguous_file() local
28 step = (fsz >= clsz) ? clsz : (DWORD)fsz; in test_contiguous_file()
29 fr = f_lseek(fp, f_tell(fp) + step); /* Advances file pointer a cluster */ in test_contiguous_file()
32 clst = fp->clust; fsz -= step; /* Get current cluster for next test */ in test_contiguous_file()
/third_party/typescript/tests/baselines/reference/
H A DasyncIIFE.js16 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
17 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
18 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
19 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A Dawait_unaryExpression_es6.js22 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
23 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
24 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
25 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A Dawait_unaryExpression_es6_1.js26 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
27 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
28 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
29 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A Dawait_unaryExpression_es6_2.js18 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
19 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
20 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
21 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DcastOfAwait.js15 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
16 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
17 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
18 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DnoImplicitReturnsInAsync1.js13 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
14 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
15 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
16 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DimportCallExpressionNestedCJS.js19 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
20 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
21 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
22 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DreachabilityChecks7.js36 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
37 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
38 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
39 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DsuperMethodCall.js21 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
22 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
23 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
24 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DasyncImportedPromise_es6.js24 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
25 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
26 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
27 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A Dawait_unaryExpression_es6_3.js24 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
25 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
26 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
27 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DcircularInferredTypeOfVariable.js26 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
27 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
28 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
29 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DdefaultExportInAwaitExpression02.js25 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
26 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
27 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
28 step((generator = generator.apply(thisArg, _arguments || [])).next());
H A DnoImplicitReturnsInAsync2.js42 function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
43 function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
44 function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } function
45 step((generator = generator.apply(thisArg, _arguments || [])).next());
/third_party/node/deps/v8/tools/release/
H A Dcommon_includes.py192 def InjectStep(self, step):
193 self.step=step
235 self.step.GitPull()
238 self.step.Git("fetch")
241 return self.step.Git("tag").strip().splitlines()
247 self.step.GitRemotes())
272 if self.step.Git("show-ref refs/remotes/origin/%s" % name).strip():
278 if self.step.Git("show-ref refs/remotes/branch-heads/%s" % name).strip():
290 self.step
[all...]
/third_party/ffmpeg/libavcodec/
H A Dsonic.c264 int step = 256, pos = 0, dominant = 0, any = 0; in intlist_write() local
310 int steplet = step >> 8; in intlist_write()
324 step += step / ADAPT_LEVEL; in intlist_write()
334 write_uint_max(pb, interloper, (step >> 8) - 1); in intlist_write()
337 step -= step / ADAPT_LEVEL; in intlist_write()
340 if (step < 256) in intlist_write()
342 step = 65536 / step; in intlist_write()
361 int n_zeros = 0, step = 256, dominant = 0; intlist_read() local
519 int step = (i+1)*channels, k, j; modified_levinson_durbin() local
[all...]
/third_party/icu/icu4j/main/tests/charset/src/com/ibm/icu/dev/test/charset/
H A DTestConversion.java313 { "1", "step=1" }, { "3", "step=3" }, { "7", "step=7" } }; in FromUnicodeCase()
314 int i, step; in FromUnicodeCase()
319 step = Integer.parseInt(steps[i][0]); in FromUnicodeCase()
321 logln("Testing step:[" + step + "]"); in FromUnicodeCase()
323 resultLength = stepFromUnicode(cc, encoder, step); in FromUnicodeCase()
368 private int stepFromUnicode(ConversionCase cc, CharsetEncoder encoder, int step) { in stepFromUnicode() argument
369 if (step < in stepFromUnicode()
670 stepToUnicode(ConversionCase cc, CharsetDecoder decoder, int step) stepToUnicode() argument
[all...]
/third_party/python/Objects/
H A Dbytearrayobject.c390 Py_ssize_t start, stop, step, slicelength, i; in bytearray_subscript() local
392 if (PySlice_Unpack(index, &start, &stop, &step) < 0) { in bytearray_subscript()
396 &start, &stop, step); in bytearray_subscript()
400 else if (step == 1) { in bytearray_subscript()
415 cur += step, i++) { in bytearray_subscript()
595 Py_ssize_t start, stop, step, slicelen, needed; in bytearray_ass_subscript() local
627 step = 1; in bytearray_ass_subscript()
637 if (PySlice_Unpack(index, &start, &stop, &step) < 0) { in bytearray_ass_subscript()
641 &stop, step); in bytearray_ass_subscript()
676 if ((step < in bytearray_ass_subscript()
[all...]
/third_party/node/deps/brotli/c/dec/
H A Dhuffman.c78 /* Stores code in table[0], table[step], table[2*step], ..., table[end] */
79 /* Assumes that end is an integer multiple of step */
81 int step, int end, in ReplicateValue()
84 end -= step; in ReplicateValue()
111 int step; /* step size to replicate values in current table */ in BrotliBuildCodeLengthsHuffmanTable() local
157 step = 2; in BrotliBuildCodeLengthsHuffmanTable()
161 ReplicateValue(&table[BrotliReverseBits(key)], step, table_size, code); in BrotliBuildCodeLengthsHuffmanTable()
164 step << in BrotliBuildCodeLengthsHuffmanTable()
80 ReplicateValue(HuffmanCode* table, int step, int end, HuffmanCode code) ReplicateValue() argument
181 int step; /* step size to replicate values in current table */ BrotliBuildHuffmanTable() local
[all...]
/third_party/skia/third_party/externals/brotli/c/dec/
H A Dhuffman.c78 /* Stores code in table[0], table[step], table[2*step], ..., table[end] */
79 /* Assumes that end is an integer multiple of step */
81 int step, int end, in ReplicateValue()
84 end -= step; in ReplicateValue()
111 int step; /* step size to replicate values in current table */ in BrotliBuildCodeLengthsHuffmanTable() local
157 step = 2; in BrotliBuildCodeLengthsHuffmanTable()
161 ReplicateValue(&table[BrotliReverseBits(key)], step, table_size, code); in BrotliBuildCodeLengthsHuffmanTable()
164 step << in BrotliBuildCodeLengthsHuffmanTable()
80 ReplicateValue(HuffmanCode* table, int step, int end, HuffmanCode code) ReplicateValue() argument
181 int step; /* step size to replicate values in current table */ BrotliBuildHuffmanTable() local
[all...]
/third_party/skia/samplecode/
H A DSampleStringArt.cpp30 SkScalar step = angle; variable
37 SkPoint rp = SkPoint::Make(length*SkScalarCos(step) + center.fX,
38 length*SkScalarSin(step) + center.fY);
41 step += angle;

Completed in 10 milliseconds

12345678910>>...39