Home
last modified time | relevance | path

Searched refs:lengths (Results 1 - 25 of 199) sorted by relevance

12345678

/third_party/toybox/toys/posix/
H A Dwc.c34 static void show_lengths(unsigned long *lengths, char *name) in show_lengths() argument
50 printf(" %*ld"+first, space, lengths[i]); in show_lengths()
53 TT.totals[i] += lengths[i]; in show_lengths()
62 unsigned long word = 0, lengths[] = {0,0,0,0}; in do_wc() local
70 lengths[2] = st.st_size; in do_wc()
84 if (toybuf[pos]=='\n') lengths[0]++; in do_wc()
85 lengths[2]++; in do_wc()
94 lengths[3]++; in do_wc()
101 if (!word) lengths[1]++; in do_wc()
111 show_lengths(lengths, nam in do_wc()
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DLengthsParser.java46 NavigableSet<Integer> lengths = new TreeSet<>(); in parseLengths()
54 lengths.isEmpty() || lo > lengths.last(), in parseLengths()
57 lengths.addAll(ContiguousSet.closed(lo, hi)); in parseLengths()
61 lengths.isEmpty() || length > lengths.last(), in parseLengths()
64 lengths.add(length); in parseLengths()
67 return ImmutableSortedSet.copyOf(lengths); in parseLengths()
/third_party/libphonenumber/cpp/src/phonenumbers/
H A Dshortnumberinfo.cc93 const RepeatedField<int>& lengths = desc.possible_length(); in MatchesPossibleNumberAndNationalNumber() local
95 std::find(lengths.begin(), lengths.end(), number.length()) == in MatchesPossibleNumberAndNationalNumber()
96 lengths.end()) { in MatchesPossibleNumberAndNationalNumber()
127 const RepeatedField<int>& lengths = in IsPossibleShortNumberForRegion() local
129 return (std::find(lengths.begin(), lengths.end(), short_number.length()) != in IsPossibleShortNumberForRegion()
130 lengths.end()); in IsPossibleShortNumberForRegion()
144 const RepeatedField<int>& lengths = in IsPossibleShortNumber() local
146 if (std::find(lengths in IsPossibleShortNumber()
205 const RepeatedField<int>& lengths = GetExpectedCostForRegion() local
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/breakiter/
H A DDictionaryBreakEngine.java25 //list of word candidate lengths, in increasing length order
26 private int lengths[]; field in DictionaryBreakEngine.PossibleWord
35 lengths = new int[POSSIBLE_WORD_LIST_MAX]; in PossibleWord()
45 prefix = dict.matches(fIter, rangeEnd - start, lengths, count, lengths.length); in candidates()
52 fIter.setIndex(start + lengths[count[0]-1]); in candidates()
61 fIter.setIndex(offset + lengths[mark]); in acceptMarked()
62 return lengths[mark]; in acceptMarked()
69 fIter.setIndex(offset + lengths[--current]); in backUp()
H A DDictionaryMatcher.java24 * @param lengths An array that is filled with the lengths of words that matched.
25 * @param count Filled with the number of elements output in lengths.
26 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
30 public abstract int matches(CharacterIterator text, int maxLength, int[] lengths, in matches() argument
33 public int matches(CharacterIterator text, int maxLength, int[] lengths, in matches() argument
35 return matches(text, maxLength, lengths, count, limit, null); in matches()
H A DCjkBreakEngine.java170 int lengths[] = new int[numCodePts]; in divideUpDictionaryRange()
187 fDictionary.matches(text, maxSearchLength, lengths, count_, maxSearchLength, values); in divideUpDictionaryRange()
196 if ((count == 0 || lengths[0] != 1) && current32(text) != DONE32 && !fHangulWordSet.contains(current32(text))) { in divideUpDictionaryRange()
198 lengths[count] = 1; in divideUpDictionaryRange()
204 if (newSnlp < bestSnlp[lengths[j] + i]) { in divideUpDictionaryRange()
205 bestSnlp[lengths[j] + i] = newSnlp; in divideUpDictionaryRange()
206 prev[lengths[j] + i] = i; in divideUpDictionaryRange()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DDictionaryBreakEngine.java25 //list of word candidate lengths, in increasing length order
26 private int lengths[]; field in DictionaryBreakEngine.PossibleWord
35 lengths = new int[POSSIBLE_WORD_LIST_MAX]; in PossibleWord()
45 prefix = dict.matches(fIter, rangeEnd - start, lengths, count, lengths.length); in candidates()
52 fIter.setIndex(start + lengths[count[0]-1]); in candidates()
61 fIter.setIndex(offset + lengths[mark]); in acceptMarked()
62 return lengths[mark]; in acceptMarked()
69 fIter.setIndex(offset + lengths[--current]); in backUp()
H A DDictionaryMatcher.java25 * @param lengths An array that is filled with the lengths of words that matched.
26 * @param count Filled with the number of elements output in lengths.
27 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
31 public abstract int matches(CharacterIterator text, int maxLength, int[] lengths, in matches() argument
34 public int matches(CharacterIterator text, int maxLength, int[] lengths, in matches() argument
36 return matches(text, maxLength, lengths, count, limit, null); in matches()
H A DCjkBreakEngine.java146 int lengths[] = new int[numCodePts]; in divideUpDictionaryRange()
163 fDictionary.matches(text, maxSearchLength, lengths, count_, maxSearchLength, values); in divideUpDictionaryRange()
172 if ((count == 0 || lengths[0] != 1) && current32(text) != DONE32 && !fHangulWordSet.contains(current32(text))) { in divideUpDictionaryRange()
174 lengths[count] = 1; in divideUpDictionaryRange()
180 if (newSnlp < bestSnlp[lengths[j] + i]) { in divideUpDictionaryRange()
181 bestSnlp[lengths[j] + i] = newSnlp; in divideUpDictionaryRange()
182 prev[lengths[j] + i] = i; in divideUpDictionaryRange()
/third_party/zlib/contrib/puff/
H A Dpuff.c52 * 1.3 20 Mar 2002 - Go back to lengths for puff() parameters [Gailly]
94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
213 * a negative value if there is an error. If all of the lengths are zero, i.e.
220 * a simple integer ordering of codes of the same lengths. Hence below the
309 * Given the list of code lengths length[0..n-1] representing a canonical
320 * codes past the end of the incomplete lengths.
351 (h->count[length[symbol]])++; /* assumes lengths are within bounds */ in construct()
355 /* check for an over-subscribed or incomplete set of lengths */ in construct()
393 * - Literals, lengths, and the end-of-block code are combined into a single
397 * - There are 256 possible lengths (
546 short lengths[FIXLCODES]; fixed() local
670 short lengths[MAXCODES]; /* descriptor code lengths */ dynamic() local
[all...]
/third_party/ffmpeg/libavutil/tests/
H A Dsha512.c34 static const int lengths[4] = { 224, 256, 384, 512 }; in main() local
41 if (j < 2) printf("Testing SHA-512/%d\n", lengths[j]); in main()
42 else printf("Testing SHA-%d\n", lengths[j]); in main()
44 av_sha512_init(ctx, lengths[j]); in main()
54 for (i = 0; i < lengths[j] >> 3; i++) in main()
H A Dripemd.c32 static const int lengths[4] = { 128, 160, 256, 320 }; in main() local
39 printf("Testing RIPEMD-%d\n", lengths[j]); in main()
41 av_ripemd_init(ctx, lengths[j]); in main()
50 for (i = 0; i < lengths[j] >> 3; i++) in main()
H A Dsha.c29 static const int lengths[3] = { 160, 224, 256 }; in main() local
36 printf("Testing SHA-%d\n", lengths[j]); in main()
38 av_sha_init(ctx, lengths[j]); in main()
47 for (i = 0; i < lengths[j] >> 3; i++) in main()
/third_party/glslang/glslang/MachineIndependent/
H A DScan.h59 lengths(L), currentSource(0), currentChar(0), stringBias(b), finale(f), singleLogical(single), in TInputScanner()
110 while(charToRead >= lengths[sourceToRead]) { in peek()
150 } while (currentSource > 0 && lengths[currentSource] == 0); in unget()
151 if (lengths[currentSource] == 0) { in unget()
155 currentChar = lengths[currentSource] - 1; in unget()
232 if (currentChar >= lengths[currentSource]) { in advance()
239 while (currentSource < numSources && lengths[currentSource] == 0) { in advance()
253 const size_t *lengths; // length of each string member in glslang::TInputScanner
/third_party/typescript/tests/baselines/reference/
H A DgenericArray1.js14 var lengths = ["a", "b", "c"].map(x => x.length); variable
29 var lengths = ["a", "b", "c"].map(function (x) { return x.length; }); variable
33 declare var lengths: number[];
H A DgenericFunctions2.js5 var lengths = map(myItems, x => x.length); variable
11 var lengths = map(myItems, function (x) { return x.length; }); variable
17 declare var lengths: number[];
/third_party/libphonenumber/tools/java/common/src/com/google/i18n/phonenumbers/
H A DBuildMetadataFromXml.java401 * Checks if the possible lengths provided as a sorted set are equal to the possible lengths
428 * with no national number data and [-1] for the possible lengths. Note that the parent
449 // mean that the generalDesc possible lengths apply. in processPhoneNumberDescElement()
460 // New way of handling possible number lengths. We don't do this for the general in processPhoneNumberDescElement()
464 TreeSet<Integer> lengths = new TreeSet<Integer>(); in processPhoneNumberDescElement()
466 populatePossibleLengthSets(element, lengths, localOnlyLengths); in processPhoneNumberDescElement()
467 setPossibleLengths(lengths, localOnlyLengths, parentDesc.build(), numberDesc); in processPhoneNumberDescElement()
489 // Calculate the possible lengths for the general description. This will be based on the in setRelevantDescPatterns()
490 // possible lengths o in setRelevantDescPatterns()
594 populatePossibleLengthSets(Element data, TreeSet<Integer> lengths, TreeSet<Integer> localOnlyLengths) populatePossibleLengthSets() argument
689 setPossibleLengths(TreeSet<Integer> lengths, TreeSet<Integer> localOnlyLengths, PhoneNumberDesc parentDesc, PhoneNumberDesc.Builder desc) setPossibleLengths() argument
[all...]
/third_party/icu/icu4c/source/common/
H A Ddictionarydata.cpp46 int32_t *lengths, int32_t *cpLengths, int32_t *values, in matches()
63 if (lengths != NULL) { in matches()
64 lengths[wordCount] = lengthMatched; in matches()
114 int32_t *lengths, int32_t *cpLengths, int32_t *values, in matches()
130 if (lengths != NULL) { in matches()
131 lengths[wordCount] = lengthMatched; in matches()
45 matches(UText *text, int32_t maxLength, int32_t limit, int32_t *lengths, int32_t *cpLengths, int32_t *values, int32_t *prefix) const matches() argument
113 matches(UText *text, int32_t maxLength, int32_t limit, int32_t *lengths, int32_t *cpLengths, int32_t *values, int32_t *prefix) const matches() argument
/third_party/node/deps/icu-small/source/common/
H A Ddictionarydata.cpp46 int32_t *lengths, int32_t *cpLengths, int32_t *values, in matches()
63 if (lengths != nullptr) { in matches()
64 lengths[wordCount] = lengthMatched; in matches()
114 int32_t *lengths, int32_t *cpLengths, int32_t *values, in matches()
130 if (lengths != nullptr) { in matches()
131 lengths[wordCount] = lengthMatched; in matches()
45 matches(UText *text, int32_t maxLength, int32_t limit, int32_t *lengths, int32_t *cpLengths, int32_t *values, int32_t *prefix) const matches() argument
113 matches(UText *text, int32_t maxLength, int32_t limit, int32_t *lengths, int32_t *cpLengths, int32_t *values, int32_t *prefix) const matches() argument
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
H A DRangeKey.java45 * multiple possible lengths for a single range prefix. Range keys are particularly useful as
60 * Creates a range key representing ranges with a prefix of some set of lengths. The prefix must
61 * not be longer than the possible lengths and cannot end with an "any" edge (i.e. "x").
63 public static RangeKey create(RangeSpecification prefix, Set<Integer> lengths) { in create() argument
66 ImmutableSortedSet<Integer> sorted = ImmutableSortedSet.copyOf(lengths); in create()
68 "lengths cannot be shorter than the prefix: %s - %s", prefix, lengths); in create()
82 // strategy isn't perfect, and partially overlapping ranges with different lengths can still in decompose()
153 // Conditionally emits a key for the current path prefix and possible lengths if we've found
154 // the "end" of an "any" path (e.g. we have possible lengths an
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Ddictionarydata.cpp46 int32_t *lengths, int32_t *cpLengths, int32_t *values, in matches()
63 if (lengths != NULL) { in matches()
64 lengths[wordCount] = lengthMatched; in matches()
114 int32_t *lengths, int32_t *cpLengths, int32_t *values, in matches()
130 if (lengths != NULL) { in matches()
131 lengths[wordCount] = lengthMatched; in matches()
45 matches(UText *text, int32_t maxLength, int32_t limit, int32_t *lengths, int32_t *cpLengths, int32_t *values, int32_t *prefix) const matches() argument
113 matches(UText *text, int32_t maxLength, int32_t limit, int32_t *lengths, int32_t *cpLengths, int32_t *values, int32_t *prefix) const matches() argument
/third_party/toybox/toys/other/
H A Dvmstat.c81 "sy\0id\0wa", lengths[] = {2,2,7,7,6,7,5,5,5,5,5,5,2,2,2,2}; in vmstat_main() local
102 for (i=0; i<sizeof(lengths); i++) { in vmstat_main()
103 printf(" %*s"+!i, lengths[i], header); in vmstat_main()
134 for (i=0; i<sizeof(lengths); i++) { in vmstat_main()
147 expected += lengths[i] + !!i; in vmstat_main()
/third_party/icu/icu4c/source/test/perf/dicttrieperf/
H A Ddicttrieperf.cpp218 // Prime the prefix lengths so that we don't keep prefixLength at 0 until in prefixBinarySearch()
351 int32_t *lengths, int &count, int limit ) { in ucharsTrieMatches()
367 // lengths[count++]=(int32_t)utext_getNativeIndex(text); in ucharsTrieMatches()
368 lengths[count++]=numChars; // CompactTrieDictionary just counts chars too. in ucharsTrieMatches()
444 int32_t lengths[20]; in call() local
455 lengths, count, UPRV_LENGTHOF(lengths)); in call()
456 if(count==0 || lengths[count-1]!=lines[i].len) { in call()
550 int32_t *lengths, int &count, int limit ) { in bytesTrieMatches()
561 // lengths[coun in bytesTrieMatches()
349 ucharsTrieMatches(UCharsTrie &trie, UText *text, int32_t textLimit, int32_t *lengths, int &count, int limit ) ucharsTrieMatches() argument
548 bytesTrieMatches(BytesTrie &trie, UText *text, int32_t textLimit, int32_t *lengths, int &count, int limit ) bytesTrieMatches() argument
593 int32_t lengths[20]; call() local
[all...]
/third_party/ffmpeg/libavcodec/tests/
H A Dmjpegenc_huffman.c33 // Validate the computed lengths satisfy the JPEG restrictions and is optimal.
37 HuffTable lengths[256]; in check_lengths() local
48 ff_mjpegenc_huffman_compute_bits(val_counts, lengths, nprobs, L); in check_lengths()
55 if (lengths[k].code == i) break; in check_lengths()
58 length = lengths[k].length; in check_lengths()
127 // Expected code lengths for each symbol in main()
135 // Actual code lengths in main()
159 // Check skewed distribution over 256 without saturated lengths in main()
162 // Check skewed distribution over 256 with saturated lengths in main()
/third_party/icu/tools/unicode/c/genprops/
H A Dnamespropsbuilder.cpp75 * These lengths are sequentially for each tokenized string, not for the de-tokenized result.
77 * 32 lengths.
273 addLine(UChar32 code, const char *names[], int16_t lengths[], int16_t count);
306 int16_t lengths[4]={ 0, 0, 0, 0 }; in setProps() local
311 lengths[0]=(int16_t)uprv_strlen(props.name); in setProps()
312 parseName(names[0], lengths[0]); in setProps()
328 lengths[3]=(int16_t)(limit-corr); in setProps()
331 lengths[3]=(int16_t)uprv_strlen(corr); in setProps()
333 parseName(names[3], lengths[3]); in setProps()
337 addLine(props.start, names, lengths, LENGTHO in setProps()
981 addLine(UChar32 code, const char *names[], int16_t lengths[], int16_t count) addLine() argument
[all...]

Completed in 14 milliseconds

12345678