Home
last modified time | relevance | path

Searched refs:startLen (Results 1 – 7 of 7) sorted by relevance

/external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/
DLZMAEncoderNormal.java290 int startLen = calcLongRepPrices(pos, posState, in getNextSymbol() local
294 anyMatchPrice, startLen); in getNextSymbol()
429 int startLen = MATCH_LEN_MIN;
451 startLen = len + 1;
486 return startLen;
493 int anyMatchPrice, int startLen) {
504 if (matches.len[matches.count - 1] < startLen)
514 while (startLen > matches.len[match])
517 for (int len = startLen; ; ++len) {
/external/icu/android_icu4j/src/main/java/android/icu/impl/
DStringRange.java272 int startLen = builder.length(); in add() local
280 builder.setLength(startLen); in add()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DStringRange.java268 int startLen = builder.length(); in add() local
276 builder.setLength(startLen); in add()
/external/lzma/Java/SevenZip/Compression/LZMA/
DEncoder.java879 int startLen = 2; // speed optimization in GetOptimum() local
905 startLen = lenTest + 1; in GetOptimum()
958 if (newLen >= startLen) in GetOptimum()
965 while (startLen > _matchDistances[offs]) in GetOptimum()
968 for (int lenTest = startLen; ; lenTest++) in GetOptimum()
/external/lzma/CS/7zip/Compress/LZMA/
DLzmaEncoder.cs879 UInt32 startLen = 2; // speed optimization in GetOptimum()
905 startLen = lenTest + 1; in GetOptimum()
958 if (newLen >= startLen) in GetOptimum()
965 while (startLen > _matchDistances[offs]) in GetOptimum()
968 for (UInt32 lenTest = startLen; ; lenTest++) in GetOptimum()
/external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lzma/
DEncoder.java778 int startLen = 2; // speed optimization in GetOptimum() local
798 if (repIndex == 0) startLen = lenTest + 1; in GetOptimum()
850 if (newLen >= startLen) { in GetOptimum()
856 while (startLen > _matchDistances[offs]) in GetOptimum()
859 for (int lenTest = startLen;; lenTest++) { in GetOptimum()
/external/lzma/C/
DLzmaEnc.c1139 UInt32 numAvailFull, newLen, numPairs, posPrev, state, posState, startLen; in GetOptimum() local
1320 startLen = 2; /* speed optimization */ in GetOptimum()
1352 startLen = lenTest + 1; in GetOptimum()
1410 if (newLen >= startLen) in GetOptimum()
1419 while (startLen > matches[offs]) in GetOptimum()
1423 for (lenTest = /*2*/ startLen; ; lenTest++) in GetOptimum()