/ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
init_size_hash_equal_allocator.pass.cpp | 17 // const hasher& hf, const key_equal& eql, const allocator_type& a);
|
range_size_hash.pass.cpp | 18 // const hasher& hf);
|
size_hash.pass.cpp | 16 // unordered_multiset(size_type n, const hasher& hf);
|
size_hash_equal.pass.cpp | 16 // unordered_multiset(size_type n, const hasher& hf, const key_equal& eql);
|
size_hash_equal_allocator.pass.cpp | 16 // unordered_multiset(size_type n, const hasher& hf, const key_equal& eql, const allocator_type& a);
|
range_size_hash_equal.pass.cpp | 18 // const hasher& hf, const key_equal& eql);
|
range_size_hash_equal_allocator.pass.cpp | 18 // const hasher& hf, const key_equal& eql,
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.set/unord.set.cnstr/ |
init_size_hash.pass.cpp | 17 // const hasher& hf);
|
init_size_hash_equal.pass.cpp | 17 // const hasher& hf, const key_equal& eql);
|
init_size_hash_equal_allocator.pass.cpp | 17 // const hasher& hf, const key_equal& eql, const allocator_type& a);
|
range_size_hash.pass.cpp | 18 // const hasher& hf);
|
size_hash.pass.cpp | 16 // unordered_set(size_type n, const hasher& hf);
|
size_hash_equal.pass.cpp | 16 // unordered_set(size_type n, const hasher& hf, const key_equal& eql);
|
size_hash_equal_allocator.pass.cpp | 16 // unordered_set(size_type n, const hasher& hf, const key_equal& eql, const allocator_type& a);
|
range_size_hash_equal.pass.cpp | 18 // const hasher& hf, const key_equal& eql);
|
range_size_hash_equal_allocator.pass.cpp | 18 // const hasher& hf, const key_equal& eql,
|
/ndk/sources/cxx-stl/llvm-libc++/include/ |
__hash_table | 483 typedef _Hash hasher; 528 __compressed_pair<size_type, hasher> __p2_; 539 hasher& hash_function() _NOEXCEPT {return __p2_.second();} 541 const hasher& hash_function() const _NOEXCEPT {return __p2_.second();} 570 is_nothrow_default_constructible<hasher>::value && 572 __hash_table(const hasher& __hf, const key_equal& __eql); 573 __hash_table(const hasher& __hf, const key_equal& __eql, 584 is_nothrow_move_constructible<hasher>::value && 596 is_nothrow_move_assignable<hasher>::value && 704 __is_nothrow_swappable<hasher>::value & [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.map/unord.map.cnstr/ |
init_size_hash.pass.cpp | 16 // unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf);
|
init_size_hash_equal.pass.cpp | 17 // const hasher& hf, const key_equal& eql);
|
init_size_hash_equal_allocator.pass.cpp | 17 // const hasher& hf, const key_equal& eql, const allocator_type& a);
|
range_size_hash.pass.cpp | 18 // const hasher& hf);
|
range_size_hash_equal.pass.cpp | 18 // const hasher& hf, const key_equal& eql);
|
range_size_hash_equal_allocator.pass.cpp | 18 // const hasher& hf, const key_equal& eql,
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
init_size_hash.pass.cpp | 16 // unordered_multimap(initializer_list<value_type> il, size_type n, const hasher& hf);
|
/external/guava/guava-tests/test/com/google/common/hash/ |
AbstractStreamingHasherTest.java | 131 Hasher controlSink = control.newHasher(1024); 133 Iterable<Hasher> sinksAndControl = Iterables.concat(
|