Searched refs:hasher (Results 1 - 25 of 102) sorted by relevance

12345

/external/chromium_org/third_party/WebKit/Source/wtf/
H A DStringHasherTest.cpp57 StringHasher hasher; local
59 // The initial state of the hasher.
60 EXPECT_EQ(emptyStringHash, hasher.hash());
61 EXPECT_EQ(emptyStringHash & 0xFFFFFF, hasher.hashWithTop8BitsMasked());
66 StringHasher hasher; local
69 hasher = StringHasher();
70 hasher.addCharacter(0);
71 EXPECT_EQ(singleNullCharacterHash, hasher.hash());
72 EXPECT_EQ(singleNullCharacterHash & 0xFFFFFF, hasher.hashWithTop8BitsMasked());
75 hasher
113 StringHasher hasher; local
252 StringHasher hasher; local
[all...]
H A DStringHasher.h51 // The hasher hashes two characters at a time, and thus an "aligned" hasher is one
161 StringHasher hasher; local
162 hasher.addCharactersAssumingAligned<T, Converter>(data, length);
163 return hasher.hashWithTop8BitsMasked();
173 StringHasher hasher; local
174 hasher.addCharactersAssumingAligned<T, Converter>(data, length);
175 return hasher.hash();
/external/guava/guava/src/com/google/common/hash/
H A DAbstractCompositeHashFunction.java37 for (Hasher hasher : hashers) {
38 hasher.putByte(b);
44 for (Hasher hasher : hashers) {
45 hasher.putBytes(bytes);
51 for (Hasher hasher : hashers) {
52 hasher.putBytes(bytes, off, len);
58 for (Hasher hasher : hashers) {
59 hasher.putShort(s);
65 for (Hasher hasher : hashers) {
66 hasher
[all...]
/external/guava/guava-tests/test/com/google/common/hash/
H A DMurmur3Hash32Test.java33 Hasher hasher = murmur3_32(seed).newHasher();
34 Funnels.byteArrayFunnel().funnel(input, hasher);
35 return hasher.hash().asBytes();
H A DHashFunctionsTest.java31 HashFunction hasher = Hashing.goodFastHash(i);
32 assertTrue(hasher.bits() >= i);
33 assertInvariants(hasher);
H A DMurmur3Hash128Test.java62 Hasher hasher = murmur3_128(seed).newHasher();
63 Funnels.byteArrayFunnel().funnel(input, hasher);
64 return hasher.hash().asBytes();
/external/chromium_org/third_party/WebKit/Source/platform/fonts/
H A DFontFaceCreationParams.h101 StringHasher hasher; local
106 hasher.addCharacters(reinterpret_cast<const LChar*>(m_filename.data()), m_filename.length());
107 hasher.addCharacters(reinterpret_cast<const LChar*>(&m_ttcIndex), sizeof(m_ttcIndex));
108 hasher.addCharacters(reinterpret_cast<const LChar*>(&m_fontconfigInterfaceId), sizeof(m_fontconfigInterfaceId));
109 return hasher.hash();
H A DWidthCache.h71 StringHasher hasher; local
80 hasher.addCharactersAssumingAligned(characters[i], characters[i + 1]);
86 hasher.addCharacter(characters[i]);
89 m_hash = hasher.hash();
/external/chromium_org/third_party/brotli/src/brotli/enc/
H A Dbackward_references.cc33 Hasher* hasher,
50 hasher->set_average_cost(average_cost);
68 hasher->set_insert_length(insert_length);
69 bool match_found = hasher->FindLongestMatch(
81 hasher->Store(ringbuffer + i, i + i_diff);
102 hasher->Store(ringbuffer + i, i + i_diff);
103 match_found = hasher->FindLongestMatch(
157 hasher->set_last_distance(best_dist);
160 // Copy all copied literals to the hasher, except the last one.
165 hasher
27 CreateBackwardReferences(size_t num_bytes, size_t position, const uint8_t* ringbuffer, const float* literal_cost, size_t ringbuffer_mask, const size_t max_backward_limit, Hasher* hasher, std::vector<Command>* commands) argument
[all...]
/external/stlport/stlport/stl/
H A D_hash_set.h59 typedef typename _Ht::hasher hasher; typedef in class:hash_set
74 hasher hash_funct() const { return _M_ht.hash_funct(); }
84 : _M_ht(0, hasher(), key_equal(), allocator_type()) {}
86 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
87 hash_set(size_type __n, const hasher& __hf)
90 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
93 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql)
95 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
108 : _M_ht(0, hasher(), key_equa
245 typedef typename _Ht::hasher hasher; typedef in class:hash_multiset
[all...]
H A D_hash_map.h65 typedef typename _Ht::hasher hasher; typedef in class:hash_map
80 hasher hash_funct() const { return _M_ht.hash_funct(); }
88 hash_map() : _M_ht(0, hasher(), key_equal(), allocator_type()) {}
90 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
91 hash_map(size_type __n, const hasher& __hf)
93 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
106 : _M_ht(0, hasher(), key_equal(), allocator_type())
110 : _M_ht(__n, hasher(), key_equal(), allocator_type())
114 const hasher
256 typedef typename _Ht::hasher hasher; typedef in class:hash_multimap
[all...]
H A D_unordered_map.h57 typedef typename _Ht::hasher hasher; typedef in class:unordered_map
74 hasher hash_function() const { return _M_ht.hash_funct(); }
83 explicit unordered_map(size_type __n = 0, const hasher& __hf = hasher(), argument
96 size_type __n = 0, const hasher& __hf = hasher(),
103 size_type __n = 0, const hasher& __hf = hasher(),
110 size_type __n = 0, const hasher
95 unordered_map(_InputIterator __f, _InputIterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
102 unordered_map(const value_type* __f, const value_type* __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
109 unordered_map(const_iterator __f, const_iterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
225 typedef typename _Ht::hasher hasher; typedef in class:unordered_multimap
251 unordered_multimap(size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
263 unordered_multimap(_InputIterator __f, _InputIterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
270 unordered_multimap(const value_type* __f, const value_type* __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
277 unordered_multimap(const_iterator __f, const_iterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
[all...]
H A D_unordered_set.h51 typedef typename _Ht::hasher hasher; typedef in class:unordered_set
68 hasher hash_function() const { return _M_ht.hash_funct(); }
77 explicit unordered_set(size_type __n = 0, const hasher& __hf = hasher(), argument
90 size_type __n = 0, const hasher& __hf = hasher(),
97 size_type __n = 0, const hasher& __hf = hasher(),
104 size_type __n = 0, const hasher
89 unordered_set(_InputIterator __f, _InputIterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
96 unordered_set(const value_type* __f, const value_type* __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
103 unordered_set(const_iterator __f, const_iterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
201 typedef typename _Ht::hasher hasher; typedef in class:unordered_multiset
227 unordered_multiset(size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
239 unordered_multiset(_InputIterator __f, _InputIterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
246 unordered_multiset(const value_type* __f, const value_type* __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
253 unordered_multiset(const_iterator __f, const_iterator __l, size_type __n = 0, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
[all...]
/external/chromium_org/sdch/open-vcdiff/src/
H A Drolling_hash_test.cc106 RollingHash<kBlockSize> hasher; local
110 result_array[i] = hasher.Hash(&buffer[i]);
117 RollingHash<kBlockSize> hasher; local
120 uint32_t running_hash = hasher.Hash(buffer);
122 running_hash = hasher.UpdateHash(running_hash,
139 RollingHash<kBlockSize> hasher; local
144 uint32_t running_hash = hasher.Hash(buffer_);
147 running_hash = hasher.UpdateHash(running_hash,
152 EXPECT_EQ(running_hash, hasher.Hash(&buffer_[i + 1 - kBlockSize]));
H A Dvcdiffengine.cc167 RollingHash<BlockHash::kBlockSize> hasher; local
188 uint32_t hash_value = hasher.Hash(candidate_pos);
206 hash_value = hasher.Hash(candidate_pos);
223 hash_value = hasher.UpdateHash(hash_value,
/external/chromium_org/third_party/WebKit/Source/build/scripts/
H A Dmake_names.py32 import hasher namespace
61 'hash': hasher.hash,
H A Dmake_element_type_helpers.py9 import hasher namespace
45 'hash': hasher.hash,
H A Dmake_qualified_names.py32 import hasher namespace
57 'hash': hasher.hash,
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/jsdoc-validator/
H A Dbuild_jsdoc_validator_jar.py40 def traverse(hasher, path):
45 hasher.update('d ' + quoted_name + '\n')
47 traverse(hasher, os.path.join(path, entry))
49 hasher.update('r ' + quoted_name + ' ')
50 hasher.update(str(info.st_size) + ' ')
53 hasher.update(f_hash + '\n')
/external/chromium_org/chrome/tools/profile_reset/
H A Djtl_compiler.cc98 const jtl::Hasher& hasher,
119 target->WriteHash(hasher.GetHash(value));
129 target->WriteHash(hasher.GetHash(value));
208 jtl::Hasher hasher(hash_seed);
240 operation_name, arguments, ends_sentence, hasher, &bytecode_writer);
94 TranscodeInstruction( const std::string& name, const base::ListValue& arguments, bool ends_sentence, const jtl::Hasher& hasher, ByteCodeWriter* target) const argument
/external/libcxx/test/containers/unord/unord.map/
H A Dtypes.pass.cpp20 // typedef Hash hasher;
42 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
59 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
/external/libcxx/test/containers/unord/unord.multimap/
H A Dtypes.pass.cpp20 // typedef Hash hasher;
42 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
59 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
/external/libcxx/test/containers/unord/unord.multiset/
H A Dtypes.pass.cpp20 // typedef Hash hasher;
41 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
57 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
/external/libcxx/test/containers/unord/unord.set/
H A Dtypes.pass.cpp20 // typedef Hash hasher;
41 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
57 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), "");
/external/bison/lib/
H A Dhash.c71 Hash_hasher hasher; member in struct:hash_table
90 function, or just "hasher" for short) into a number (or "slot") between 0
95 A good "hasher" function will distribute entries rather evenly in buckets.
98 done in constant time by the "hasher", and the later finding of a precise
101 yielding shorter chains, *given* the "hasher" function behaves properly.
106 best bet is to make sure you are using a good "hasher" function (beware
247 If TABLE->hasher misbehaves, abort. */
251 size_t n = table->hasher (key, table->n_buckets);
484 /* If the user passes a NULL hasher, we hash the raw pointer. */
569 tuning is wanted over the default behavior of the hasher
594 hash_initialize(size_t candidate, const Hash_tuning *tuning, Hash_hasher hasher, Hash_comparator comparator, Hash_data_freer data_freer) argument
[all...]

Completed in 713 milliseconds

12345