Home
last modified time | relevance | path

Searched refs:minLength (Results 1 - 25 of 58) sorted by relevance

123

/third_party/node/deps/npm/node_modules/gauge/lib/
H A Dtemplate-item.js24 this.minLength = null
43 if (isPercent(this.minLength)) {
44 this.minLength = Math.round(this.overallOutputLength * percent(this.minLength))
60 this.minLength == null
83 if (this.minLength == null) {
86 return this.minLength + this.padLeft + this.padRight
H A Drender-template.js47 item.minLength = null
112 item.minLength = null
177 if (!item.minLength) {
181 finishSizing(item, item.minLength)
187 throw new error.Internal('Resize loop iterated too many times while determining minLength')
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/model/
H A DFormatSpec.java132 int minLength = national.minLength(); in of()
135 national, carrier, intl, local, minLength, maxLength, nationalPrefixOptional, comment); in of()
150 local.minLength(), in localFormat()
172 public abstract int minLength(); in minLength() method in FormatSpec
194 return RangeTree.from(IntStream.rangeClosed(minLength(), maxLength()) in getLengthBasedBounds()
204 out.append(", minLength=").append(minLength()); in toString()
262 checkArgument(local.minLength() < national.minLength(), in parseLocalSpec()
428 public int minLength() { minLength() method in FormatSpec.FormatTemplate
586 public abstract int minLength(); minLength() method in FormatSpec.FormatGroup
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DPrefixTree.java87 public static PrefixTree minimal(RangeTree include, RangeTree exclude, int minLength) { in minimal() argument
89 checkArgument(minLength >= 0, "invalid minimum prefix length: %s", minLength); in minimal()
105 minimal = emit(root, RangeSpecification.empty(), RangeTree.empty(), minLength); in minimal()
108 root, RangeSpecification.empty(), exclude.getInitial(), RangeTree.empty(), minLength); in minimal()
301 DfaNode node, RangeSpecification path, DfaNode exclude, RangeTree minimal, int minLength) { in recursivelyMinimize()
322 recursivelyMinimize(target, path.extendByMask(m), ex.getTarget(), minimal, minLength); in recursivelyMinimize()
329 minimal = emit(target, path.extendByMask(mask), minimal, minLength); in recursivelyMinimize()
340 DfaNode node, RangeSpecification path, RangeTree minimal, int minLength) { in emit()
341 if (path.length() >= minLength || nod in emit()
300 recursivelyMinimize( DfaNode node, RangeSpecification path, DfaNode exclude, RangeTree minimal, int minLength) recursivelyMinimize() argument
339 emit( DfaNode node, RangeSpecification path, RangeTree minimal, int minLength) emit() argument
[all...]
/third_party/icu/icu4c/source/test/perf/normperf/
H A Dsimplenormperf.cpp27 static UnicodeString getMixed(int32_t minLength) { in getMixed() argument
28 return extend(UnicodeString(latin1).append(japanese).append(arabic), minLength); in getMixed()
30 static UnicodeString getLatin1(int32_t minLength) { return extend(latin1, minLength); } in getLatin1() argument
31 static UnicodeString getLowercaseLatin1(int32_t minLength) { return extend(lowercaseLatin1, minLength); } in getLowercaseLatin1() argument
32 static UnicodeString getASCII(int32_t minLength) { return extend(ascii, minLength); } in getASCII() argument
33 static UnicodeString getJapanese(int32_t minLength) { return extend(japanese, minLength); } in getJapanese() argument
55 extend(const UnicodeString &s, int32_t minLength) extend() argument
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dcollationweights.cpp392 CollationWeights::allocWeightsInShortRanges(int32_t n, int32_t minLength) { in allocWeightsInShortRanges() argument
393 // See if the first few minLength and minLength+1 ranges have enough weights. in allocWeightsInShortRanges()
394 for(int32_t i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
396 // Use the first few minLength and minLength+1 ranges. in allocWeightsInShortRanges()
397 if(ranges[i].length > minLength) { in allocWeightsInShortRanges()
398 // Reduce the number of weights from the last minLength+1 range in allocWeightsInShortRanges()
399 // which might sort before some minLength ranges, in allocWeightsInShortRanges()
400 // so that we use all weights in the minLength range in allocWeightsInShortRanges()
423 allocWeightsInMinLengthRanges(int32_t n, int32_t minLength) allocWeightsInMinLengthRanges() argument
512 int32_t minLength=ranges[0].length; allocWeights() local
[all...]
H A Dsortkey.cpp195 int32_t minLength = getLength(); in compareTo() local
197 if (minLength < targetLength) { in compareTo()
199 } else if (minLength == targetLength) { in compareTo()
202 minLength = targetLength; in compareTo()
206 if (minLength > 0) { in compareTo()
207 int diff = uprv_memcmp(src, tgt, minLength); in compareTo()
H A Dcollationweights.h99 UBool allocWeightsInShortRanges(int32_t n, int32_t minLength);
100 UBool allocWeightsInMinLengthRanges(int32_t n, int32_t minLength);
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationweights.cpp392 CollationWeights::allocWeightsInShortRanges(int32_t n, int32_t minLength) { in allocWeightsInShortRanges() argument
393 // See if the first few minLength and minLength+1 ranges have enough weights. in allocWeightsInShortRanges()
394 for(int32_t i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
396 // Use the first few minLength and minLength+1 ranges. in allocWeightsInShortRanges()
397 if(ranges[i].length > minLength) { in allocWeightsInShortRanges()
398 // Reduce the number of weights from the last minLength+1 range in allocWeightsInShortRanges()
399 // which might sort before some minLength ranges, in allocWeightsInShortRanges()
400 // so that we use all weights in the minLength range in allocWeightsInShortRanges()
423 allocWeightsInMinLengthRanges(int32_t n, int32_t minLength) allocWeightsInMinLengthRanges() argument
512 int32_t minLength=ranges[0].length; allocWeights() local
[all...]
H A Dsortkey.cpp195 int32_t minLength = getLength(); in compareTo() local
197 if (minLength < targetLength) { in compareTo()
199 } else if (minLength == targetLength) { in compareTo()
202 minLength = targetLength; in compareTo()
206 if (minLength > 0) { in compareTo()
207 int diff = uprv_memcmp(src, tgt, minLength); in compareTo()
H A Dcollationweights.h99 UBool allocWeightsInShortRanges(int32_t n, int32_t minLength);
100 UBool allocWeightsInMinLengthRanges(int32_t n, int32_t minLength);
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationweights.cpp392 CollationWeights::allocWeightsInShortRanges(int32_t n, int32_t minLength) { in allocWeightsInShortRanges() argument
393 // See if the first few minLength and minLength+1 ranges have enough weights. in allocWeightsInShortRanges()
394 for(int32_t i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
396 // Use the first few minLength and minLength+1 ranges. in allocWeightsInShortRanges()
397 if(ranges[i].length > minLength) { in allocWeightsInShortRanges()
398 // Reduce the number of weights from the last minLength+1 range in allocWeightsInShortRanges()
399 // which might sort before some minLength ranges, in allocWeightsInShortRanges()
400 // so that we use all weights in the minLength range in allocWeightsInShortRanges()
423 allocWeightsInMinLengthRanges(int32_t n, int32_t minLength) allocWeightsInMinLengthRanges() argument
512 int32_t minLength=ranges[0].length; allocWeights() local
[all...]
H A Dsortkey.cpp195 int32_t minLength = getLength(); in compareTo() local
197 if (minLength < targetLength) { in compareTo()
199 } else if (minLength == targetLength) { in compareTo()
202 minLength = targetLength; in compareTo()
206 if (minLength > 0) { in compareTo()
207 int diff = uprv_memcmp(src, tgt, minLength); in compareTo()
H A Dcollationweights.h99 UBool allocWeightsInShortRanges(int32_t n, int32_t minLength);
100 UBool allocWeightsInMinLengthRanges(int32_t n, int32_t minLength);
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationWeights.java99 int minLength=ranges[0].length; in allocWeights()
101 if(allocWeightsInShortRanges(n, minLength)) { break; } in allocWeights()
103 if(minLength == 4) { in allocWeights()
109 if(allocWeightsInMinLengthRanges(n, minLength)) { break; } in allocWeights()
111 /* no good match, lengthen all minLength ranges and iterate */ in allocWeights()
112 // printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1); in allocWeights()
113 for (int i = 0; i < rangeCount && ranges[i].length == minLength; ++i) { in allocWeights()
459 private boolean allocWeightsInShortRanges(int n, int minLength) { in allocWeightsInShortRanges() argument
460 // See if the first few minLength an in allocWeightsInShortRanges()
484 allocWeightsInMinLengthRanges(int n, int minLength) allocWeightsInMinLengthRanges() argument
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
H A DCollationWeights.java101 int minLength=ranges[0].length; in allocWeights()
103 if(allocWeightsInShortRanges(n, minLength)) { break; } in allocWeights()
105 if(minLength == 4) { in allocWeights()
111 if(allocWeightsInMinLengthRanges(n, minLength)) { break; } in allocWeights()
113 /* no good match, lengthen all minLength ranges and iterate */ in allocWeights()
114 // printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1); in allocWeights()
115 for (int i = 0; i < rangeCount && ranges[i].length == minLength; ++i) { in allocWeights()
461 private boolean allocWeightsInShortRanges(int n, int minLength) { in allocWeightsInShortRanges() argument
462 // See if the first few minLength an in allocWeightsInShortRanges()
486 allocWeightsInMinLengthRanges(int n, int minLength) allocWeightsInMinLengthRanges() argument
[all...]
/third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/tools/fontinfo/
H A DDataDisplayTable.java298 * @param minLength
302 private static String padString(String s, Align alignment, int minLength) { in padString() argument
304 return padRight(s, minLength); in padString()
306 return padLeft(s, minLength); in padString()
318 * @param minLength
322 private static String padLeft(String s, int minLength) { in padLeft() argument
323 return String.format("%1$" + minLength + "s", s); in padLeft()
332 * @param minLength
336 private static String padRight(String s, int minLength) { in padRight() argument
337 return String.format("%1$-" + minLength in padRight()
[all...]
/third_party/icu/icu4c/source/common/
H A Ducnv_ext.cpp953 extSetUseMapping(UConverterUnicodeSet which, int32_t minLength, uint32_t value) { in extSetUseMapping() argument
974 return UCNV_EXT_FROM_U_GET_LENGTH(value)>=minLength; in extSetUseMapping()
982 int32_t minLength, in ucnv_extGetUnicodeSetString()
1000 if(extSetUseMapping(which, minLength, value)) { in ucnv_extGetUnicodeSetString()
1019 sharedData, cx, sa, which, minLength, in ucnv_extGetUnicodeSetString()
1023 } else if(extSetUseMapping(which, minLength, value)) { in ucnv_extGetUnicodeSetString()
1040 int32_t st1, stage1Length, st2, st3, minLength; in ucnv_extGetUnicodeSet() local
1061 minLength=3; in ucnv_extGetUnicodeSet()
1066 minLength=2; in ucnv_extGetUnicodeSet()
1068 minLength in ucnv_extGetUnicodeSet()
978 ucnv_extGetUnicodeSetString(const UConverterSharedData *sharedData, const int32_t *cx, const USetAdder *sa, UConverterUnicodeSet which, int32_t minLength, UChar32 firstCP, UChar s[UCNV_EXT_MAX_UCHARS], int32_t length, int32_t sectionIndex, UErrorCode *pErrorCode) ucnv_extGetUnicodeSetString() argument
[all...]
H A Duinvchar.cpp462 int32_t minLength; in uprv_compareInvAscii() local
477 minLength= outLength<localLength ? outLength : localLength; in uprv_compareInvAscii()
479 while(minLength>0) { in uprv_compareInvAscii()
496 --minLength; in uprv_compareInvAscii()
508 int32_t minLength; in uprv_compareInvEbcdic() local
523 minLength= outLength<localLength ? outLength : localLength; in uprv_compareInvEbcdic()
525 while(minLength>0) { in uprv_compareInvEbcdic()
544 --minLength; in uprv_compareInvEbcdic()
/third_party/node/deps/icu-small/source/common/
H A Ducnv_ext.cpp953 extSetUseMapping(UConverterUnicodeSet which, int32_t minLength, uint32_t value) { in extSetUseMapping() argument
974 return UCNV_EXT_FROM_U_GET_LENGTH(value)>=minLength; in extSetUseMapping()
982 int32_t minLength, in ucnv_extGetUnicodeSetString()
1000 if(extSetUseMapping(which, minLength, value)) { in ucnv_extGetUnicodeSetString()
1019 sharedData, cx, sa, which, minLength, in ucnv_extGetUnicodeSetString()
1023 } else if(extSetUseMapping(which, minLength, value)) { in ucnv_extGetUnicodeSetString()
1040 int32_t st1, stage1Length, st2, st3, minLength; in ucnv_extGetUnicodeSet() local
1061 minLength=3; in ucnv_extGetUnicodeSet()
1066 minLength=2; in ucnv_extGetUnicodeSet()
1068 minLength in ucnv_extGetUnicodeSet()
978 ucnv_extGetUnicodeSetString(const UConverterSharedData *sharedData, const int32_t *cx, const USetAdder *sa, UConverterUnicodeSet which, int32_t minLength, UChar32 firstCP, char16_t s[UCNV_EXT_MAX_UCHARS], int32_t length, int32_t sectionIndex, UErrorCode *pErrorCode) ucnv_extGetUnicodeSetString() argument
[all...]
H A Duinvchar.cpp462 int32_t minLength; in uprv_compareInvAscii() local
477 minLength= outLength<localLength ? outLength : localLength; in uprv_compareInvAscii()
479 while(minLength>0) { in uprv_compareInvAscii()
496 --minLength; in uprv_compareInvAscii()
508 int32_t minLength; in uprv_compareInvEbcdic() local
523 minLength= outLength<localLength ? outLength : localLength; in uprv_compareInvEbcdic()
525 while(minLength>0) { in uprv_compareInvEbcdic()
544 --minLength; in uprv_compareInvEbcdic()
/third_party/skia/third_party/externals/icu/source/common/
H A Ducnv_ext.cpp953 extSetUseMapping(UConverterUnicodeSet which, int32_t minLength, uint32_t value) { in extSetUseMapping() argument
974 return UCNV_EXT_FROM_U_GET_LENGTH(value)>=minLength; in extSetUseMapping()
982 int32_t minLength, in ucnv_extGetUnicodeSetString()
1000 if(extSetUseMapping(which, minLength, value)) { in ucnv_extGetUnicodeSetString()
1019 sharedData, cx, sa, which, minLength, in ucnv_extGetUnicodeSetString()
1023 } else if(extSetUseMapping(which, minLength, value)) { in ucnv_extGetUnicodeSetString()
1040 int32_t st1, stage1Length, st2, st3, minLength; in ucnv_extGetUnicodeSet() local
1061 minLength=3; in ucnv_extGetUnicodeSet()
1066 minLength=2; in ucnv_extGetUnicodeSet()
1068 minLength in ucnv_extGetUnicodeSet()
978 ucnv_extGetUnicodeSetString(const UConverterSharedData *sharedData, const int32_t *cx, const USetAdder *sa, UConverterUnicodeSet which, int32_t minLength, UChar32 firstCP, UChar s[UCNV_EXT_MAX_UCHARS], int32_t length, int32_t sectionIndex, UErrorCode *pErrorCode) ucnv_extGetUnicodeSetString() argument
[all...]
H A Duinvchar.cpp462 int32_t minLength; in uprv_compareInvAscii() local
477 minLength= outLength<localLength ? outLength : localLength; in uprv_compareInvAscii()
479 while(minLength>0) { in uprv_compareInvAscii()
496 --minLength; in uprv_compareInvAscii()
508 int32_t minLength; in uprv_compareInvEbcdic() local
523 minLength= outLength<localLength ? outLength : localLength; in uprv_compareInvEbcdic()
525 while(minLength>0) { in uprv_compareInvEbcdic()
544 --minLength; in uprv_compareInvEbcdic()
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DRopeByteStringTest.java66 // minLength should match the Fibonacci sequence in testMinLength()
71 assertEquals(a, RopeByteString.minLength(i)); in testMinLength()
76 assertEquals(Integer.MAX_VALUE, RopeByteString.minLength(i)); in testMinLength()
77 assertEquals(Integer.MAX_VALUE, RopeByteString.minLength(i + 1)); in testMinLength()
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DRopeByteString.java214 if (newLength >= minLength(newDepth)) { in concatenate()
262 static int minLength(int depth) { in minLength() method in RopeByteString
347 return totalLength >= minLength(treeDepth); in isBalanced()
675 int binEnd = minLength(depthBin + 1); in insert()
684 int binStart = minLength(depthBin); in insert()
699 binEnd = minLength(depthBin + 1); in insert()

Completed in 26 milliseconds

123