Home
last modified time | relevance | path

Searched refs:minLen (Results 1 - 23 of 23) sorted by relevance

/third_party/lzma/CS/7zip/Common/
H A DCommandLineParser.cs27 int minLen, int maxLen, string postCharSet) in SwitchForm()
32 MinLen = minLen; in SwitchForm()
36 public SwitchForm(string idString, SwitchType type, bool multi, int minLen): in SwitchForm() argument
37 this(idString, type, multi, minLen, 0, "") in SwitchForm()
145 int minLen = switchForm.MinLen; in ParseString()
146 if (tailSize < minLen) in ParseString()
153 String stringSwitch = srcString.Substring(pos, minLen); in ParseString()
154 pos += minLen; in ParseString()
155 for (int i = minLen; i < switchForm.MaxLen && pos < len; i++, pos++) in ParseString()
26 SwitchForm(string idString, SwitchType type, bool multi, int minLen, int maxLen, string postCharSet) SwitchForm() argument
/third_party/toybox/toys/other/
H A Dbzcat.c66 char minLen, maxLen; member
229 int minLen, maxLen, pp; in read_block_header() local
251 minLen = maxLen = length[0]; in read_block_header()
254 else if(length[ii] < minLen) minLen = length[ii]; in read_block_header()
273 hufGroup->minLen = minLen; in read_block_header()
276 // Note that minLen can't be smaller than 1, so we adjust the base in read_block_header()
284 for (ii = minLen; ii <= maxLen; ii++) { in read_block_header()
298 for (ii = minLen; i in read_block_header()
[all...]
/third_party/lzma/CPP/Common/
H A DMyString.h342 /* GetBuf(minLen): provides the buffer that can store
343 at least (minLen) characters and additional null terminator.
345 char *GetBuf(unsigned minLen) in GetBuf() argument
347 if (minLen > _limit) in GetBuf()
348 ReAlloc2(minLen); in GetBuf()
351 char *GetBuf_SetEnd(unsigned minLen) in GetBuf_SetEnd() argument
353 if (minLen > _limit) in GetBuf_SetEnd()
354 ReAlloc2(minLen); in GetBuf_SetEnd()
356 chars[minLen] = 0; in GetBuf_SetEnd()
357 _len = minLen; in GetBuf_SetEnd()
637 GetBuf(unsigned minLen) GetBuf() argument
643 GetBuf_SetEnd(unsigned minLen) GetBuf_SetEnd() argument
887 GetBuf(unsigned minLen) GetBuf() argument
[all...]
/third_party/icu/icu4c/source/test/perf/usetperf/
H A Dbitset.cpp54 void BitSet::ensureCapacity(uint32_t minLen) { in ensureCapacity() argument
56 while (newLen < minLen) newLen <<= 1; // grow exponentially in ensureCapacity()
H A Dbitset.h25 void ensureCapacity(uint32_t minLen);
/third_party/node/deps/npm/node_modules/diff/lib/patch/
H A Dcreate.js23 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
H A Dmerge.js33 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
/third_party/lzma/C/
H A DLzFind.c1105 #define GET_MATCHES_HEADER2(minLen, ret_op) \
1107 lenLimit = (unsigned)p->lenLimit; { if (lenLimit < minLen) { MatchFinder_MovePos(p); ret_op; }} \
1110 #define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return distances)
1111 #define SKIP_HEADER(minLen) do { GET_MATCHES_HEADER2(minLen, continue)
1563 #define HC_SKIP_HEADER(minLen) \
1564 do { if (p->lenLimit < minLen) { MatchFinder_MovePos(p); num--; continue; } { \
/third_party/node/deps/npm/node_modules/postcss-selector-parser/dist/selectors/
H A Dcontainer.js11 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/util/
H A DUnicodeMap.java773 int minLen = Math.min(last.length(), s.length()); in findCommonPrefix()
774 for (int i = 0; i < minLen; ++i) { in findCommonPrefix()
777 return minLen; in findCommonPrefix()
/third_party/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/
H A DUnicodeMap.java770 int minLen = Math.min(last.length(), s.length()); in findCommonPrefix()
771 for (int i = 0; i < minLen; ++i) { in findCommonPrefix()
774 return minLen; in findCommonPrefix()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/format/
H A DDateTimeGeneratorTest.java271 private String getRandomString(String[] randomList, int minLen, int maxLen) { in getRandomString() argument
273 int len = random.nextInt(maxLen + 1 - minLen) + minLen; in getRandomString()
274 for (int i = minLen; i < len; ++ i) { in getRandomString()
/third_party/icu/icu4c/source/i18n/
H A Ddtptngen.cpp146 // patternChar, field, type, minLen, weight
2339 int32_t repeatCount = row->minLen; in set()
2364 skeletonResult.original.populate(UDATPG_SECOND_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen); in set()
2365 skeletonResult.baseOriginal.populate(UDATPG_SECOND_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen); in set()
2384 skeletonResult.original.populate(UDATPG_DAYPERIOD_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen); in set()
2385 skeletonResult.baseOriginal.populate(UDATPG_DAYPERIOD_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen); in set()
2559 if (dtTypes[i+1].minLen <= len) { in getCanonicalIndex()
H A Ddtptngen_impl.h117 int16_t minLen; member
/third_party/node/deps/icu-small/source/i18n/
H A Ddtptngen.cpp149 // patternChar, field, type, minLen, weight
2331 int32_t repeatCount = row->minLen; in set()
2356 skeletonResult.original.populate(UDATPG_SECOND_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen); in set()
2357 skeletonResult.baseOriginal.populate(UDATPG_SECOND_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen); in set()
2376 skeletonResult.original.populate(UDATPG_DAYPERIOD_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen); in set()
2377 skeletonResult.baseOriginal.populate(UDATPG_DAYPERIOD_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen); in set()
2551 if (dtTypes[i+1].minLen <= len) { in getCanonicalIndex()
H A Ddtptngen_impl.h117 int16_t minLen; member
/third_party/skia/third_party/externals/icu/source/i18n/
H A Ddtptngen.cpp146 // patternChar, field, type, minLen, weight
2252 int32_t repeatCount = row->minLen;
2277 skeletonResult.original.populate(UDATPG_SECOND_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen);
2278 skeletonResult.baseOriginal.populate(UDATPG_SECOND_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen);
2297 skeletonResult.original.populate(UDATPG_DAYPERIOD_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen);
2298 skeletonResult.baseOriginal.populate(UDATPG_DAYPERIOD_FIELD, dtTypes[i].patternChar, dtTypes[i].minLen);
2472 if (dtTypes[i+1].minLen <= len) {
H A Ddtptngen_impl.h117 int16_t minLen; member
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/
H A DDateTimeGeneratorTest.java268 private String getRandomString(String[] randomList, int minLen, int maxLen) { in getRandomString() argument
270 int len = random.nextInt(maxLen + 1 - minLen) + minLen; in getRandomString()
271 for (int i = minLen; i < len; ++ i) { in getRandomString()
/third_party/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/
H A DDemo.java802 int minLen = reverse.length(); in addSentenceToTable()
803 if (minLen > sentence.length()) minLen = sentence.length(); in addSentenceToTable()
805 for (i = 0; i < minLen; ++i) { in addSentenceToTable()
/third_party/node/deps/v8/src/debug/
H A Dliveedit.cc78 int minLen = std::min(len1_, len2_); in FillTable() local
79 while (prefixLen_ < minLen && input_->Equals(prefixLen_, prefixLen_)) { in FillTable()
/third_party/node/deps/npm/node_modules/diff/lib/
H A Dindex.es6.js524 function _unsupportedIterableToArray(o, minLen) {
526 if (typeof o === "string") return _arrayLikeToArray(o, minLen);
530 if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
/third_party/lz4/lib/
H A Dlz4hc.c1310 int minLen, int nbSearches, in LZ4HC_FindLongerMatch()
1319 int matchLength = LZ4HC_InsertAndGetWiderMatch(ctx, ip, ip, iHighLimit, minLen, &matchPtr, &ip, nbSearches, 1 /*patternAnalysis*/, 1 /*chainSwap*/, dict, favorDecSpeed); in LZ4HC_FindLongerMatch()
1320 if (matchLength <= minLen) return match; in LZ4HC_FindLongerMatch()
1308 LZ4HC_FindLongerMatch(LZ4HC_CCtx_internal* const ctx, const BYTE* ip, const BYTE* const iHighLimit, int minLen, int nbSearches, const dictCtx_directive dict, const HCfavor_e favorDecSpeed) LZ4HC_FindLongerMatch() argument

Completed in 38 milliseconds