Lines Matching refs:BlockHash
36 // entry in the BlockHash corresponding to each kBlockSize bytes
46 class BlockHash {
58 // for a new BlockHash. However, it also doubles the minimum
101 // of the BlockHash for which the match was found.
114 // A BlockHash is created using a buffer of source data. The hash table
123 BlockHash(const char* source_data, size_t source_size, int starting_offset);
125 ~BlockHash();
128 // This method must be called after constructing a BlockHash object,
137 // classes that inherit from BlockHash are expected to call AddBlock()
142 // In the context of the open-vcdiff encoder, BlockHash is used for two
145 // a dictionary BlockHash and a target BlockHash are as follows:
148 // for a target BlockHash is computed in the following manner:
152 // in order to produce the correct offset value for a target BlockHash.
153 // 2. For a dictionary BlockHash, the entire data set is hashed at once
155 // For a target BlockHash, because the previously encoded target data
160 // The following two factory functions can be used to create BlockHash
163 // NULL is returned; otherwise a valid BlockHash object is returned.
164 // Since a dictionary BlockHash is not expected to be modified after
168 static const BlockHash* CreateDictionaryHash(const char* dictionary_data,
170 static BlockHash* CreateTargetHash(const char* target_data,
178 // BlockHash will only store hash entries for the evenly-aligned blocks.
240 // when calling FindBestMatch() on a different BlockHash object
244 // open_vcdiff::BlockHash::Match best_match;
246 // RollingHash<BlockHash::kBlockSize>::Hash(target_candidate_start);
310 // BlockHash::FindBestMatch over the number of matches (up to a maximum
501 BlockHash(const BlockHash&); // NOLINT
502 void operator=(const BlockHash&);
