HomeSort by relevance Sort by last modified time
    Searched full:_hash (Results 1 - 25 of 131) sorted by null

1 2 3 4 5 6

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/
unordered_set.h 39 class _Hash = hash<_Value>,
46 _Hash, __detail::_Mod_range_hashing,
53 _Hash, __detail::_Mod_range_hashing,
88 class _Hash = hash<_Value>,
95 _Hash, __detail::_Mod_range_hashing,
102 _Hash, __detail::_Mod_range_hashing,
137 template<class _Value, class _Hash, class _Pred, class _Alloc,
140 swap(__unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __x,
141 __unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __y)
144 template<class _Value, class _Hash, class _Pred, class _Alloc
    [all...]
hashtable.h 69 // _Hash: the ranged hash function (Tavori and Dreizin). A binary function
72 // [0, N). Default: hash(k, N) = h2(h1(k), N). If _Hash is anything other
103 typename _H1, typename _H2, typename _Hash,
112 _Equal, _H1, _H2, _Hash,
118 _H1, _H2, _Hash, __cache_hash_code>,
122 _Equal, _H1, _H2, _Hash,
196 const _H1&, const _H2&, const _Hash&,
203 const _H1&, const _H2&, const _Hash&,
420 typename _H1, typename _H2, typename _Hash, typename _RehashPolicy,
423 _H1, _H2, _Hash, _RehashPolicy
    [all...]
unordered_map.h 39 class _Hash = hash<_Key>,
46 _Hash, __detail::_Mod_range_hashing,
53 _Hash, __detail::_Mod_range_hashing,
88 class _Hash = hash<_Key>,
96 _Hash, __detail::_Mod_range_hashing,
104 _Hash, __detail::_Mod_range_hashing,
139 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
142 swap(__unordered_map<_Key, _Tp, _Hash, _Pred,
144 __unordered_map<_Key, _Tp, _Hash, _Pred,
148 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/
unordered_set.h 39 class _Hash = hash<_Value>,
46 _Hash, __detail::_Mod_range_hashing,
53 _Hash, __detail::_Mod_range_hashing,
88 class _Hash = hash<_Value>,
95 _Hash, __detail::_Mod_range_hashing,
102 _Hash, __detail::_Mod_range_hashing,
137 template<class _Value, class _Hash, class _Pred, class _Alloc,
140 swap(__unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __x,
141 __unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __y)
144 template<class _Value, class _Hash, class _Pred, class _Alloc
    [all...]
hashtable.h 69 // _Hash: the ranged hash function (Tavori and Dreizin). A binary function
72 // [0, N). Default: hash(k, N) = h2(h1(k), N). If _Hash is anything other
103 typename _H1, typename _H2, typename _Hash,
112 _Equal, _H1, _H2, _Hash,
118 _H1, _H2, _Hash, __cache_hash_code>,
122 _Equal, _H1, _H2, _Hash,
196 const _H1&, const _H2&, const _Hash&,
203 const _H1&, const _H2&, const _Hash&,
420 typename _H1, typename _H2, typename _Hash, typename _RehashPolicy,
423 _H1, _H2, _Hash, _RehashPolicy
    [all...]
unordered_map.h 39 class _Hash = hash<_Key>,
46 _Hash, __detail::_Mod_range_hashing,
53 _Hash, __detail::_Mod_range_hashing,
88 class _Hash = hash<_Key>,
96 _Hash, __detail::_Mod_range_hashing,
104 _Hash, __detail::_Mod_range_hashing,
139 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
142 swap(__unordered_map<_Key, _Tp, _Hash, _Pred,
144 __unordered_map<_Key, _Tp, _Hash, _Pred,
148 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/
unordered_set.h 39 class _Hash = hash<_Value>,
46 _Hash, __detail::_Mod_range_hashing,
53 _Hash, __detail::_Mod_range_hashing,
88 class _Hash = hash<_Value>,
95 _Hash, __detail::_Mod_range_hashing,
102 _Hash, __detail::_Mod_range_hashing,
137 template<class _Value, class _Hash, class _Pred, class _Alloc,
140 swap(__unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __x,
141 __unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __y)
144 template<class _Value, class _Hash, class _Pred, class _Alloc
    [all...]
hashtable.h 69 // _Hash: the ranged hash function (Tavori and Dreizin). A binary function
72 // [0, N). Default: hash(k, N) = h2(h1(k), N). If _Hash is anything other
103 typename _H1, typename _H2, typename _Hash,
112 _Equal, _H1, _H2, _Hash,
118 _H1, _H2, _Hash, __cache_hash_code>,
122 _Equal, _H1, _H2, _Hash,
196 const _H1&, const _H2&, const _Hash&,
203 const _H1&, const _H2&, const _Hash&,
420 typename _H1, typename _H2, typename _Hash, typename _RehashPolicy,
423 _H1, _H2, _Hash, _RehashPolicy
    [all...]
unordered_map.h 39 class _Hash = hash<_Key>,
46 _Hash, __detail::_Mod_range_hashing,
53 _Hash, __detail::_Mod_range_hashing,
88 class _Hash = hash<_Key>,
96 _Hash, __detail::_Mod_range_hashing,
104 _Hash, __detail::_Mod_range_hashing,
139 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
142 swap(__unordered_map<_Key, _Tp, _Hash, _Pred,
144 __unordered_map<_Key, _Tp, _Hash, _Pred,
148 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc
    [all...]
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/
unordered_set.h 39 class _Hash = hash<_Value>,
46 _Hash, __detail::_Mod_range_hashing,
53 _Hash, __detail::_Mod_range_hashing,
88 class _Hash = hash<_Value>,
95 _Hash, __detail::_Mod_range_hashing,
102 _Hash, __detail::_Mod_range_hashing,
137 template<class _Value, class _Hash, class _Pred, class _Alloc,
140 swap(__unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __x,
141 __unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __y)
144 template<class _Value, class _Hash, class _Pred, class _Alloc
    [all...]
hashtable.h 69 // _Hash: the ranged hash function (Tavori and Dreizin). A binary function
72 // [0, N). Default: hash(k, N) = h2(h1(k), N). If _Hash is anything other
103 typename _H1, typename _H2, typename _Hash,
112 _Equal, _H1, _H2, _Hash,
118 _H1, _H2, _Hash, __cache_hash_code>,
122 _Equal, _H1, _H2, _Hash,
196 const _H1&, const _H2&, const _Hash&,
203 const _H1&, const _H2&, const _Hash&,
420 typename _H1, typename _H2, typename _Hash, typename _RehashPolicy,
423 _H1, _H2, _Hash, _RehashPolicy
    [all...]
unordered_map.h 39 class _Hash = hash<_Key>,
46 _Hash, __detail::_Mod_range_hashing,
53 _Hash, __detail::_Mod_range_hashing,
88 class _Hash = hash<_Key>,
96 _Hash, __detail::_Mod_range_hashing,
104 _Hash, __detail::_Mod_range_hashing,
139 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
142 swap(__unordered_map<_Key, _Tp, _Hash, _Pred,
144 __unordered_map<_Key, _Tp, _Hash, _Pred,
148 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc
    [all...]
  /external/libcxx/include/
__hash_table 84 template <class _Tp, class _Hash, class _Equal, class _Alloc> class __hash_table;
88 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
759 template <class _Tp, class _Hash, class _Equal, class _Alloc>
764 typedef _Hash hasher;
    [all...]
unordered_map 381 template <class _Key, class _Cp, class _Hash,
382 bool = is_empty<_Hash>::value && !__libcpp_is_final<_Hash>::value
385 : private _Hash
390 _NOEXCEPT_(is_nothrow_default_constructible<_Hash>::value)
391 : _Hash() {}
393 __unordered_map_hasher(const _Hash& __h)
394 _NOEXCEPT_(is_nothrow_copy_constructible<_Hash>::value)
395 : _Hash(__h) {}
397 const _Hash& hash_function() const _NOEXCEPT {return *this;
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
__hash_table 87 template <class _Tp, class _Hash, class _Equal, class _Alloc> class __hash_table;
91 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
762 template <class _Tp, class _Hash, class _Equal, class _Alloc>
767 typedef _Hash hasher;
    [all...]
unordered_map 360 template <class _Key, class _Cp, class _Hash, bool = is_empty<_Hash>::value
362 && !__is_final(_Hash)
366 : private _Hash
371 _NOEXCEPT_(is_nothrow_default_constructible<_Hash>::value)
372 : _Hash() {}
374 __unordered_map_hasher(const _Hash& __h)
375 _NOEXCEPT_(is_nothrow_copy_constructible<_Hash>::value)
376 : _Hash(__h) {}
378 const _Hash& hash_function() const _NOEXCEPT {return *this;
    [all...]
  /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/
__hash_table 87 template <class _Tp, class _Hash, class _Equal, class _Alloc> class __hash_table;
91 template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
762 template <class _Tp, class _Hash, class _Equal, class _Alloc>
767 typedef _Hash hasher;
    [all...]
unordered_map 360 template <class _Key, class _Cp, class _Hash, bool = is_empty<_Hash>::value
362 && !__is_final(_Hash)
366 : private _Hash
371 _NOEXCEPT_(is_nothrow_default_constructible<_Hash>::value)
372 : _Hash() {}
374 __unordered_map_hasher(const _Hash& __h)
375 _NOEXCEPT_(is_nothrow_copy_constructible<_Hash>::value)
376 : _Hash(__h) {}
378 const _Hash& hash_function() const _NOEXCEPT {return *this;
    [all...]
  /external/libcxx/include/ext/
hash_map 225 template <class _Tp, class _Hash,
226 bool = is_empty<_Hash>::value && !__libcpp_is_final<_Hash>::value
229 : private _Hash
232 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher() : _Hash() {}
233 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
234 _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return *this;}
237 {return static_cast<const _Hash&>(*this)(__x.first);}
240 {return static_cast<const _Hash&>(*this)(__x);
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ext/
hash_map 222 template <class _Tp, class _Hash, bool = is_empty<_Hash>::value
224 && !__is_final(_Hash)
228 : private _Hash
231 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher() : _Hash() {}
232 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
233 _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return *this;}
236 {return static_cast<const _Hash&>(*this)(__x.first);}
239 {return static_cast<const _Hash&>(*this)(__x);
    [all...]
  /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ext/
hash_map 222 template <class _Tp, class _Hash, bool = is_empty<_Hash>::value
224 && !__is_final(_Hash)
228 : private _Hash
231 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher() : _Hash() {}
232 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
233 _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return *this;}
236 {return static_cast<const _Hash&>(*this)(__x.first);}
239 {return static_cast<const _Hash&>(*this)(__x);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/profile/
unordered_set 39 #define _GLIBCXX_BASE unordered_set<_Key, _Hash, _Pred, _Alloc>
48 typename _Hash = std::hash<_Key>,
53 public _Unordered_profile<unordered_set<_Key, _Hash, _Pred, _Alloc>,
230 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc>
232 swap(unordered_set<_Key, _Hash, _Pred, _Alloc>& __x,
233 unordered_set<_Key, _Hash, _Pred, _Alloc>& __y)
236 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc>
238 operator==(const unordered_set<_Key, _Hash, _Pred, _Alloc>& __x,
239 const unordered_set<_Key, _Hash, _Pred, _Alloc>& __y)
242 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/
unordered_set 39 #define _GLIBCXX_BASE unordered_set<_Key, _Hash, _Pred, _Alloc>
48 typename _Hash = std::hash<_Key>,
53 public _Unordered_profile<unordered_set<_Key, _Hash, _Pred, _Alloc>,
230 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc>
232 swap(unordered_set<_Key, _Hash, _Pred, _Alloc>& __x,
233 unordered_set<_Key, _Hash, _Pred, _Alloc>& __y)
236 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc>
238 operator==(const unordered_set<_Key, _Hash, _Pred, _Alloc>& __x,
239 const unordered_set<_Key, _Hash, _Pred, _Alloc>& __y)
242 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/
unordered_set 39 #define _GLIBCXX_BASE unordered_set<_Key, _Hash, _Pred, _Alloc>
48 typename _Hash = std::hash<_Key>,
53 public _Unordered_profile<unordered_set<_Key, _Hash, _Pred, _Alloc>,
230 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc>
232 swap(unordered_set<_Key, _Hash, _Pred, _Alloc>& __x,
233 unordered_set<_Key, _Hash, _Pred, _Alloc>& __y)
236 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc>
238 operator==(const unordered_set<_Key, _Hash, _Pred, _Alloc>& __x,
239 const unordered_set<_Key, _Hash, _Pred, _Alloc>& __y)
242 template<typename _Key, typename _Hash, typename _Pred, typename _Alloc
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
hashtable_policy.h 40 typename _H1, typename _H2, typename _Hash,
57 typename _H1, typename _H2, typename _Hash, typename _Traits>
83 template <typename _Key, typename _Hash>
85 noexcept(declval<const _Hash&>()(declval<const _Key&>()))>
421 typename _H1, typename _H2, typename _Hash,
428 typename _H1, typename _H2, typename _Hash,
431 _H1, _H2, _Hash, _RehashPolicy, _Traits, false>
438 typename _H1, typename _H2, typename _Hash,
441 _H1, _H2, _Hash, _RehashPolicy, _Traits, true>
446 _Equal, _H1, _H2, _Hash,
    [all...]

Completed in 537 milliseconds

1 2 3 4 5 6