| /external/webkit/Source/JavaScriptCore/wtf/ |
| H A D | StringHasher.h | 93 StringHasher hasher; local
98 hasher.addCharacters(Converter(data[0]), Converter(data[1]));
103 hasher.addCharacter(Converter(*data));
105 return hasher.hash();
110 StringHasher hasher; local
118 hasher.addCharacter(b0);
122 hasher.addCharacters(b0, b1);
125 return hasher.hash();
|
| /external/chromium/sdch/open-vcdiff/src/ |
| H A D | vcdiffengine.cc | 170 RollingHash<BlockHash::kBlockSize> hasher; local
191 uint32_t hash_value = hasher.Hash(candidate_pos);
209 hash_value = hasher.Hash(candidate_pos);
226 hash_value = hasher.UpdateHash(hash_value,
|
| H A D | rolling_hash_test.cc | 106 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]));
|
| /external/bison/lib/ |
| H A D | hash.c | 71 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
253 = table->bucket + table->hasher (entry, table->n_buckets);
301 = table->bucket + table->hasher (entry, table->n_buckets);
518 tuning is wanted over the default behavior of the hasher. If TUNING is
541 Hash_hasher hasher, Hash_comparato
540 hash_initialize(size_t candidate, const Hash_tuning *tuning, Hash_hasher hasher, Hash_comparator comparator, Hash_data_freer data_freer) argument
[all...] |
| /external/stlport/stlport/stl/ |
| H A D | _hash_map.h | 65 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 | _hash_set.h | 59 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 | _unordered_map.h | 57 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.h | 51 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...] |
| H A D | _hashtable.h | 235 typedef _HF hasher; typedef in class:hashtable
246 hasher hash_funct() const { return _M_hash; }
274 hasher _M_hash;
|
| /external/stlport/stlport/stl/debug/ |
| H A D | _hashtable.h | 105 typedef _HF hasher; typedef in class:hashtable
120 hasher hash_funct() const { return _M_non_dbg_impl.hash_funct(); }
|
| /external/webkit/Source/WebCore/dom/ |
| H A D | StyledElement.cpp | 406 StringHasher hasher; local
410 hasher.addCharacters(data[0], data[1]);
412 hasher.addCharacters(data[2], data[3]);
415 hasher.addCharacters(data[0], data[1]);
417 hasher.addCharacters(data[2], data[3]);
419 return hasher.hash();
|