| /external/stlport/stlport/stl/ |
| _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_equal(), allocator_type()
245 typedef typename _Ht::hasher hasher; typedef in class:hash_multiset
[all...] |
| _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& __hf
256 typedef typename _Ht::hasher hasher; typedef in class:hash_multimap
[all...] |
| _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(),
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& __hf = hasher()
225 typedef typename _Ht::hasher hasher; typedef in class:unordered_multimap
[all...] |
| _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(),
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& __hf = hasher()
201 typedef typename _Ht::hasher hasher; typedef in class:unordered_multiset
[all...] |
| _hashtable.h | 235 typedef _HF hasher; typedef in class:hashtable
246 hasher hash_funct() const { return _M_hash; }
274 hasher _M_hash;
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _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_equal(), allocator_type()
245 typedef typename _Ht::hasher hasher; typedef in class:hash_multiset
[all...] |
| _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& __hf
256 typedef typename _Ht::hasher hasher; typedef in class:hash_multimap
[all...] |
| _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(),
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& __hf = hasher()
225 typedef typename _Ht::hasher hasher; typedef in class:unordered_multimap
[all...] |
| _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(),
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& __hf = hasher()
201 typedef typename _Ht::hasher hasher; typedef in class:unordered_multiset
[all...] |
| _hashtable.h | 235 typedef _HF hasher; typedef in class:hashtable
246 hasher hash_funct() const { return _M_hash; }
274 hasher _M_hash;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| unordered_map | 59 typedef typename _Base::hasher hasher;
65 const hasher& __hf = hasher(),
76 const hasher& __hf = hasher(),
115 typedef typename _Base::hasher hasher;
121 const hasher& __hf = hasher(),
[all...] |
| unordered_set | 59 typedef typename _Base::hasher hasher;
65 const hasher& __hf = hasher(),
76 const hasher& __hf = hasher(),
113 typedef typename _Base::hasher hasher;
119 const hasher& __hf = hasher(),
[all...] |
| hashtable_policy.h | 738 typedef _H1 hasher; typedef in struct:std::__detail::_Hash_code_base
740 hasher
805 typedef _H1 hasher; typedef in struct:std::__detail::_Hash_code_base
807 hasher
|
| /external/chromium/sdch/open-vcdiff/src/ |
| 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]));
|
| 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,
|
| rolling_hash.h | 25 // Rabin-Karp hasher module -- this is a faster version with different
107 // Initialize hasher to maintain a window of the specified size. You need an
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
| hash_map | 95 typedef typename _Ht::hasher hasher;
110 hasher
123 : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
127 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
129 hash_map(size_type __n, const hasher& __hf)
132 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
138 : _M_ht(100, hasher(), key_equal(), allocator_type())
143 : _M_ht(__n, hasher(), key_equal(), allocator_type())
148 const hasher& __hf
[all...] |
| hash_set | 97 typedef typename _Ht::hasher hasher;
112 hasher
125 : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
129 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
131 hash_set(size_type __n, const hasher& __hf)
134 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
140 : _M_ht(100, hasher(), key_equal(), allocator_type())
145 : _M_ht(__n, hasher(), key_equal(), allocator_type())
150 const hasher& __hf
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| hash_map | 95 typedef typename _Ht::hasher hasher;
110 hasher
123 : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
127 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
129 hash_map(size_type __n, const hasher& __hf)
132 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
138 : _M_ht(100, hasher(), key_equal(), allocator_type())
143 : _M_ht(__n, hasher(), key_equal(), allocator_type())
148 const hasher& __hf
[all...] |
| hash_set | 97 typedef typename _Ht::hasher hasher;
112 hasher
125 : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
129 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
131 hash_set(size_type __n, const hasher& __hf)
134 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
140 : _M_ht(100, hasher(), key_equal(), allocator_type())
145 : _M_ht(__n, hasher(), key_equal(), allocator_type())
150 const hasher& __hf
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/debug/ |
| unordered_map | 62 typedef typename _Base::hasher hasher;
76 const hasher& __hf = hasher(),
84 const hasher& __hf = hasher(),
101 const hasher& __hf = hasher(),
348 typedef typename _Base::hasher hasher;
[all...] |
| unordered_set | 62 typedef typename _Base::hasher hasher;
76 const hasher& __hf = hasher(),
84 const hasher& __hf = hasher(),
101 const hasher& __hf = hasher(),
344 typedef typename _Base::hasher hasher;
[all...] |
| /external/bison/lib/ |
| hash.c | 67 block for this function. In a word, HASHER randomizes a user entry
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 i
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _hashtable.h | 105 typedef _HF hasher; typedef in class:hashtable
120 hasher hash_funct() const { return _M_non_dbg_impl.hash_funct(); }
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 105 typedef _HF hasher; typedef in class:hashtable
120 hasher hash_funct() const { return _M_non_dbg_impl.hash_funct(); }
|
