| /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;
|
| /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(); }
|
| /external/v8/src/ |
| objects.cc | [all...] |
| /external/icu4c/common/ |
| uhash.h | 260 * @return the previous key hasher; non-NULL
|
| /external/icu4c/i18n/ |
| ucol_tok.cpp | [all...] |
| /external/srec/config/en.us/dictionary/ |
| large.ok | [all...] |
| /external/stlport/etc/ |
| ChangeLog-5.1 | 758 * stlport/stl/_hash_fun.h: use primary types for hasher, not
[all...] |
