Home
last modified time | relevance | path

Searched refs:hashHead (Results 1 – 3 of 3) sorted by relevance

/external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/lz77support/
DLZ77Compressor.java426 int hashHead = insertString(currentPosition); in compress() local
427 if (hashHead != NO_MATCH && hashHead - currentPosition <= params.getMaxOffset()) { in compress()
429 matchLength = longestMatch(hashHead); in compress()
468 int hashHead = head[insertHash]; in insertString() local
469 prev[pos & wMask] = hashHead; in insertString()
471 return hashHead; in insertString()
481 int hashHead = insertString(currentPosition); in longestMatchForNextPosition() local
483 int matchLength = longestMatch(hashHead); in longestMatchForNextPosition()
/external/brotli/research/
Dsieve.cc146 std::vector<TextIdx> hashHead(1 << hashLen); in sieve_generate() local
165 TextIdx slot = hashHead[hash]; in sieve_generate()
187 map.push_back({hashHead[hash], i, 1, piece}); in sieve_generate()
188 hashHead[hash] = hashSlot; in sieve_generate()
Ddurchschlag.cc284 std::vector<TextIdx> hashHead(1 << hashLen); in durchschlag_prepare() local
305 TextIdx slot = hashHead[bucket]; in durchschlag_prepare()
323 map.push_back({hashHead[bucket], i}); in durchschlag_prepare()
324 hashHead[bucket] = hashSlot; in durchschlag_prepare()