Home
last modified time | relevance | path

Searched refs:minLen (Results 1 – 24 of 24) sorted by relevance

/external/lzma/CS/7zip/Common/
DCommandLineParser.cs27 int minLen, int maxLen, string postCharSet) in SwitchForm() argument
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()
/external/lzma/CPP/Common/
DMyString.h250 char *GetBuf(unsigned minLen) in GetBuf() argument
252 if (minLen > _limit) in GetBuf()
253 ReAlloc2(minLen); in GetBuf()
256 char *GetBuf_SetEnd(unsigned minLen) in GetBuf_SetEnd() argument
258 if (minLen > _limit) in GetBuf_SetEnd()
259 ReAlloc2(minLen); in GetBuf_SetEnd()
261 chars[minLen] = 0; in GetBuf_SetEnd()
262 _len = minLen; in GetBuf_SetEnd()
485 wchar_t *GetBuf(unsigned minLen) in GetBuf() argument
487 if (minLen > _limit) in GetBuf()
[all …]
/external/bzip2/
Dhuffman.c154 Int32 minLen, in BZ2_hbAssignCodes() argument
161 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
174 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
181 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
193 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
198 for (i = minLen + 1; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
Dcompress.c242 Int32 nSelectors, alphaSize, minLen, maxLen, selCtr; in sendMTFValues() local
482 minLen = 32; in sendMTFValues()
486 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in sendMTFValues()
489 AssertH ( !(minLen < 1), 3005 ); in sendMTFValues()
491 minLen, maxLen, alphaSize ); in sendMTFValues()
Ddecompress.c110 Int32 minLen, maxLen; in BZ2_decompress() local
333 minLen = 32; in BZ2_decompress()
337 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
344 minLen, maxLen, alphaSize in BZ2_decompress()
346 s->minLens[t] = minLen; in BZ2_decompress()
/external/toybox/toys/other/
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()
284 for (ii = minLen; ii <= maxLen; ii++) { in read_block_header()
298 for (ii = minLen; ii < maxLen; ii++) { in read_block_header()
306 base[minLen] = 0; in read_block_header()
359 ii = hufGroup->minLen; in read_huffman_data()
/external/icu/icu4c/source/test/perf/usetperf/
Dbitset.cpp54 void BitSet::ensureCapacity(uint32_t minLen) { in ensureCapacity() argument
56 while (newLen < minLen) newLen <<= 1; // grow exponentially in ensureCapacity()
Dbitset.h25 void ensureCapacity(uint32_t minLen);
/external/lzma/C/
DLzFind.c502 #define GET_MATCHES_HEADER2(minLen, ret_op) \ argument
504 lenLimit = p->lenLimit; { if (lenLimit < minLen) { MatchFinder_MovePos(p); ret_op; }} \
507 #define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return 0) argument
508 #define SKIP_HEADER(minLen) GET_MATCHES_HEADER2(minLen, continue) argument
/external/valgrind/memcheck/tests/
Dvarinfo6.c1513 Int32 minLen, maxLen; in BZ2_decompress() local
1737 minLen = 32; in BZ2_decompress()
1741 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1748 minLen, maxLen, alphaSize in BZ2_decompress()
1750 s->minLens[t] = minLen; in BZ2_decompress()
3362 Int32 minLen, in BZ2_hbAssignCodes() argument
3369 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3382 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3389 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3401 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
Dorigin5-bz2.c1475 Int32 minLen, maxLen; in BZ2_decompress() local
1698 minLen = 32; in BZ2_decompress()
1702 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1709 minLen, maxLen, alphaSize in BZ2_decompress()
1711 s->minLens[t] = minLen; in BZ2_decompress()
3324 Int32 minLen, in BZ2_hbAssignCodes() argument
3331 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3344 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3351 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3363 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
/external/valgrind/perf/
Dbz2.c1473 Int32 minLen, maxLen; in BZ2_decompress() local
1696 minLen = 32; in BZ2_decompress()
1700 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1707 minLen, maxLen, alphaSize in BZ2_decompress()
1709 s->minLens[t] = minLen; in BZ2_decompress()
3322 Int32 minLen, in BZ2_hbAssignCodes() argument
3329 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3342 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3349 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3361 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
Dtest_input_for_tinycc.c1432 Int32 minLen, maxLen; in BZ2_decompress() local
1655 minLen = 32; in BZ2_decompress()
1659 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1666 minLen, maxLen, alphaSize in BZ2_decompress()
1668 s->minLens[t] = minLen; in BZ2_decompress()
2817 Int32 minLen, in BZ2_hbAssignCodes() argument
2824 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
2837 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
2844 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
2856 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
/external/valgrind/exp-sgcheck/tests/
Dhackedbz2.c1484 Int32 minLen, maxLen; in BZ2_decompress() local
1707 minLen = 32; in BZ2_decompress()
1711 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1718 minLen, maxLen, alphaSize in BZ2_decompress()
1720 s->minLens[t] = minLen; in BZ2_decompress()
3333 Int32 minLen, in BZ2_hbAssignCodes() argument
3340 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3353 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3360 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3372 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/format/
DDateTimeGeneratorTest.java194 private String getRandomString(String[] randomList, int minLen, int maxLen) { in getRandomString() argument
196 int len = random.nextInt(maxLen + 1 - minLen) + minLen; in getRandomString()
197 for (int i = minLen; i < len; ++ i) { in getRandomString()
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/
DDateTimeGeneratorTest.java193 private String getRandomString(String[] randomList, int minLen, int maxLen) { in getRandomString() argument
195 int len = random.nextInt(maxLen + 1 - minLen) + minLen; in getRandomString()
196 for (int i = minLen; i < len; ++ i) { in getRandomString()
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/
DUnicodeMap.java768 int minLen = Math.min(last.length(), s.length());
769 for (int i = 0; i < minLen; ++i) {
772 return minLen;
/external/icu/android_icu4j/src/main/tests/android/icu/dev/util/
DUnicodeMap.java769 int minLen = Math.min(last.length(), s.length());
770 for (int i = 0; i < minLen; ++i) {
773 return minLen;
/external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/
DDemo.java802 int minLen = reverse.length(); in addSentenceToTable() local
803 if (minLen > sentence.length()) minLen = sentence.length(); in addSentenceToTable()
805 for (i = 0; i < minLen; ++i) { in addSentenceToTable()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
DLongArray.java709 int minLen = otherUsedLen + words; in addShiftedByWords() local
710 if (minLen > m_ints.length) in addShiftedByWords()
712 m_ints = resizedInts(minLen); in addShiftedByWords()
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/
DArrays.java279 int minLen = Math.min(a.length, b.length); in compareUnsigned() local
280 for (int i = 0; i < minLen; ++i) in compareUnsigned()
/external/icu/icu4c/source/i18n/
Ddtptngen_impl.h113 int16_t minLen; member
Ddtptngen.cpp1864 int32_t repeatCount = row->minLen; // #7930 removes cap at 3 in set()
2032 if (dtTypes[i+1].minLen <= len) { in getCanonicalIndex()
/external/skia/src/core/
DSkColorSpace_ICC.cpp665 const size_t minLen = translate ? 48 : 36; in load_matrix() local
666 if (len < minLen) { in load_matrix()