HomeSort by relevance Sort by last modified time
    Searched refs:kMult (Results 1 - 3 of 3) sorted by null

  /external/chromium/sdch/open-vcdiff/src/
rolling_hash.h 33 // convert (val * kMult) into ((val << 8) + val).
34 static const uint32_t kMult = 257;
37 // kBase <= 2^32/kMult to avoid overflow. Also, kBase must be a power of two
71 return ModBase((partial_hash * kMult) + next_byte);
78 // (ptr[0] * kMult) + ptr[1] is not large enough to exceed kBase, thus
81 return (static_cast<unsigned char>(ptr[0]) * kMult)
159 // (- b * pow(kMult, window_size - 1)) % kBase
197 // pow(kMult, (window_size - 1)) % kBase,
202 RollingHashUtil::ModBase(multiplier * RollingHashUtil::kMult);
206 // (- (removed_byte * pow(kMult, (window_size - 1)))) % kBas
    [all...]
  /external/chromium_org/sdch/open-vcdiff/src/
rolling_hash.h 34 // convert (val * kMult) into ((val << 8) + val).
35 static const uint32_t kMult = 257;
38 // kBase <= 2^32/kMult to avoid overflow. Also, kBase must be a power of two
72 return ModBase((partial_hash * kMult) + next_byte);
79 // (ptr[0] * kMult) + ptr[1] is not large enough to exceed kBase, thus
82 return (static_cast<unsigned char>(ptr[0]) * kMult)
158 // (- b * pow(kMult, window_size - 1)) % kBase
193 // pow(kMult, (window_size - 1)) % kBase,
198 RollingHashUtil::ModBase(multiplier * RollingHashUtil::kMult);
202 // (- (removed_byte * pow(kMult, (window_size - 1)))) % kBas
    [all...]
  /external/open-vcdiff/src/
rolling_hash.h 34 // convert (val * kMult) into ((val << 8) + val).
35 static const uint32_t kMult = 257;
38 // kBase <= 2^32/kMult to avoid overflow. Also, kBase must be a power of two
72 return ModBase((partial_hash * kMult) + next_byte);
79 // (ptr[0] * kMult) + ptr[1] is not large enough to exceed kBase, thus
82 return (static_cast<unsigned char>(ptr[0]) * kMult)
158 // (- b * pow(kMult, window_size - 1)) % kBase
193 // pow(kMult, (window_size - 1)) % kBase,
198 RollingHashUtil::ModBase(multiplier * RollingHashUtil::kMult);
202 // (- (removed_byte * pow(kMult, (window_size - 1)))) % kBas
    [all...]

Completed in 839 milliseconds