Searched defs:HashSet (Results 1 - 4 of 4) sorted by relevance
/external/ceres-solver/internal/ceres/ |
H A D | collections_port.h | 31 // Portable HashMap and HashSet, and a specialized overload for hashing pairs. 64 struct HashSet : set<K> {}; struct in namespace:ceres::internal 78 struct HashSet : std::tr1::unordered_set<K> {};
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | HashSet.h | 31 template<typename Value, typename HashFunctions, typename Traits> class HashSet; 33 void deleteAllValues(const HashSet<Value, HashFunctions, Traits>&); 36 typename TraitsArg = HashTraits<ValueArg> > class HashSet { class in namespace:WTF 54 void swap(HashSet&); 93 friend void deleteAllValues<>(const HashSet&); 113 inline void HashSet<T, U, V>::swap(HashSet& other) 119 inline int HashSet<T, U, V>::size() const 125 inline int HashSet<T, U, V>::capacity() const 131 inline bool HashSet< 234 deleteAllValues(const HashSet<T, U, V>& collection) argument [all...] |
/external/chromium_org/third_party/smhasher/src/ |
H A D | Types.h | 53 struct HashSet : public std::set<hashtype> struct in inherits:std::set 156 typedef HashSet<hashtype> hashset;
|
/external/openfst/src/include/fst/ |
H A D | bi-table.h | 122 struct HashSet : public unordered_set<K, H, E> { struct in namespace:fst 123 HashSet(size_t n = 0, const H &h = H(), const E &e = E()) function in struct:fst::HashSet 239 typedef HashSet<I, HashFunc, HashEqual, HS> KeyHashSet; 448 typedef HashSet<I, HashFunc, HashEqual, HS> KeyHashSet;
|
Completed in 292 milliseconds