Home
last modified time | relevance | path

Searched refs:lengths (Results 1 – 25 of 465) sorted by relevance

12345678910>>...19

/third_party/toybox/toys/posix/
Dwc.c34 static void show_lengths(unsigned long *lengths, char *name)
50 printf(" %*ld"+first, space, lengths[i]);
53 TT.totals[i] += lengths[i];
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, name); in do_wc()
/third_party/gstreamer/gstplugins_bad/sys/dvb/
Dcamutils.c210 GList *lengths = NULL; in cam_build_ca_pmt() local
220 lengths = g_list_append (lengths, GINT_TO_POINTER (len)); in cam_build_ca_pmt()
231 lengths = g_list_append (lengths, GINT_TO_POINTER (len)); in cam_build_ca_pmt()
256 len = GPOINTER_TO_INT (lengths->data); in cam_build_ca_pmt()
257 lengths = g_list_delete_link (lengths, lengths); in cam_build_ca_pmt()
273 len = GPOINTER_TO_INT (lengths->data); in cam_build_ca_pmt()
274 lengths = g_list_delete_link (lengths, lengths); in cam_build_ca_pmt()
/third_party/zlib/contrib/puff/
Dpuff.c546 short lengths[FIXLCODES]; in fixed() local
556 lengths[symbol] = 8; in fixed()
558 lengths[symbol] = 9; in fixed()
560 lengths[symbol] = 7; in fixed()
562 lengths[symbol] = 8; in fixed()
563 construct(&lencode, lengths, FIXLCODES); in fixed()
567 lengths[symbol] = 5; in fixed()
568 construct(&distcode, lengths, MAXDCODES); in fixed()
670 short lengths[MAXCODES]; /* descriptor code lengths */ in dynamic() local
692 lengths[order[index]] = bits(s, 3); in dynamic()
[all …]
/third_party/libphonenumber/cpp/src/phonenumbers/
Dshortnumberinfo.cc84 const RepeatedField<int>& lengths = desc.possible_length(); in MatchesPossibleNumberAndNationalNumber() local
86 std::find(lengths.begin(), lengths.end(), number.length()) == in MatchesPossibleNumberAndNationalNumber()
87 lengths.end()) { in MatchesPossibleNumberAndNationalNumber()
118 const RepeatedField<int>& lengths = in IsPossibleShortNumberForRegion() local
120 return (std::find(lengths.begin(), lengths.end(), short_number.length()) != in IsPossibleShortNumberForRegion()
121 lengths.end()); in IsPossibleShortNumberForRegion()
135 const RepeatedField<int>& lengths = in IsPossibleShortNumber() local
137 if (std::find(lengths.begin(), lengths.end(), short_number.length()) != in IsPossibleShortNumber()
138 lengths.end()) { in IsPossibleShortNumber()
196 const RepeatedField<int>& lengths = in GetExpectedCostForRegion() local
[all …]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
DDictionaryBreakEngine.java26 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()
DCjkBreakEngine.java146 int lengths[] = new int[numCodePts]; in divideUpDictionaryRange() local
163 fDictionary.matches(text, maxSearchLength, lengths, count_, maxSearchLength, values); in divideUpDictionaryRange()
172 …if ((count == 0 || lengths[0] != 1) && current32(text) != DONE32 && !fHangulWordSet.contains(curre… 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()
DDictionaryMatcher.java31 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()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/breakiter/
DDictionaryBreakEngine.java26 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()
DDictionaryMatcher.java30 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()
/third_party/ffmpeg/libavutil/tests/
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()
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()
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()
/third_party/glslang/glslang/MachineIndependent/
DScan.h59 … lengths(L), currentSource(0), currentChar(0), stringBias(b), finale(f), singleLogical(single), in numSources()
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 variable
/third_party/libphonenumber/tools/java/common/src/com/google/i18n/phonenumbers/
DBuildMetadataFromXml.java464 TreeSet<Integer> lengths = new TreeSet<Integer>(); in processPhoneNumberDescElement() local
466 populatePossibleLengthSets(element, lengths, localOnlyLengths); in processPhoneNumberDescElement()
467 setPossibleLengths(lengths, localOnlyLengths, parentDesc.build(), numberDesc); in processPhoneNumberDescElement()
540 String[] lengths = possibleLengthString.split(","); in parsePossibleLengthStringToSet() local
542 for (int i = 0; i < lengths.length; i++) { in parsePossibleLengthStringToSet()
543 String lengthSubstring = lengths[i]; in parsePossibleLengthStringToSet()
594 private static void populatePossibleLengthSets(Element data, TreeSet<Integer> lengths, in populatePossibleLengthSets() argument
623 lengths.addAll(thisElementLengths); in populatePossibleLengthSets()
633 TreeSet<Integer> lengths = new TreeSet<Integer>(); in setPossibleLengthsGeneralDesc() local
642 populatePossibleLengthSets(generalDescNode, lengths, localOnlyLengths); in setPossibleLengthsGeneralDesc()
[all …]
/third_party/node/deps/npm/node_modules/wrap-ansi/
Dindex.js110 const lengths = wordLengths(string); constant
134 if (options.hard && lengths[index] > columns) {
136 const breaksStartingThisLine = 1 + Math.floor((lengths[index] - remainingColumns - 1) / columns);
137 const breaksStartingNextLine = Math.floor((lengths[index] - 1) / columns);
146 if (rowLength + lengths[index] > columns && rowLength > 0 && lengths[index] > 0) {
155 if (rowLength + lengths[index] > columns && options.wordWrap === false) {
/third_party/node/deps/npm/node_modules/wrap-ansi-cjs/
Dindex.js112 const lengths = wordLengths(string); constant
136 if (options.hard && lengths[index] > columns) {
138 const breaksStartingThisLine = 1 + Math.floor((lengths[index] - remainingColumns - 1) / columns);
139 const breaksStartingNextLine = Math.floor((lengths[index] - 1) / columns);
148 if (rowLength + lengths[index] > columns && rowLength > 0 && lengths[index] > 0) {
157 if (rowLength + lengths[index] > columns && options.wordWrap === false) {
/third_party/mbedtls/tests/suites/
Dtest_suite_nist_kw.data27 NIST KW lengths #1 KW plaintext OK (2 to 2^54 - 1 semiblocks)
30 NIST KW lengths #2 KWP plaintext OK (1 to 2^32 - 1 octets)
33 NIST KW lengths #3 KW ciphertext OK (3 to 2^54 semiblocks)
36 NIST KW lengths #4 KWP ciphertext OK (2 to 2^29 semiblocks)
39 NIST KW lengths #5 KW plaintext too short (2 to 2^54 - 1 semiblocks)
42 NIST KW lengths #6 KWP plaintext too short (1 to 2^32 - 1 octets)
45 NIST KW lengths #8 KW ciphertext too short (3 to 2^54 semiblocks)
48 NIST KW lengths #9 KWP ciphertext too short (2 to 2^29 semiblocks)
51 NIST KW lengths #10 KW plaintext not a multiple of semiblocks.
54 NIST KW lengths #11 KW ciphertext not a multiple of semiblocks.
[all …]
/third_party/typescript/tests/baselines/reference/
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[];
DgenericFunctions2.js5 var lengths = map(myItems, x => x.length); variable
11 var lengths = map(myItems, function (x) { return x.length; });
17 declare var lengths: number[];
/third_party/toybox/toys/other/
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/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/table/
DRangeKey.java63 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() local
206 ImmutableSortedSet.Builder<Integer> lengths = ImmutableSortedSet.naturalOrder(); in buildLengths() local
209 lengths.add(length); in buildLengths()
213 return lengths.build(); in buildLengths()
/third_party/icu/icu4c/source/test/perf/dicttrieperf/
Ddicttrieperf.cpp351 int32_t *lengths, int &count, int limit ) { in ucharsTrieMatches() argument
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() argument
562 lengths[count++]=numChars; // CompactTrieDictionary just counts chars too. in bytesTrieMatches()
593 int32_t lengths[20]; in call() local
604 lengths, count, UPRV_LENGTHOF(lengths)); in call()
605 if(count==0 || lengths[count-1]!=lines[i].len) { in call()
/third_party/ffmpeg/libavcodec/tests/
Dmjpegenc_huffman.c37 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()
/third_party/icu/tools/unicode/c/genprops/
Dnamespropsbuilder.cpp273 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, LENGTHOF(names)); in setProps()
981 addLine(UChar32 code, const char *names[], int16_t lengths[], int16_t count) { in addLine() argument
992 while(count>0 && lengths[count-1]==0) { in addLine()
[all …]
/third_party/skia/third_party/externals/icu/source/common/
Ddictionarydata.cpp46 int32_t *lengths, int32_t *cpLengths, int32_t *values, in matches() argument
63 if (lengths != NULL) { in matches()
64 lengths[wordCount] = lengthMatched; in matches()
114 int32_t *lengths, int32_t *cpLengths, int32_t *values, in matches() argument
130 if (lengths != NULL) { in matches()
131 lengths[wordCount] = lengthMatched; in matches()

12345678910>>...19