Quick Links: |
Provide an open-addressed unordered set container. More...
Go to the source code of this file.
Classes | |
struct | bdlc::FlatHashSet_EntryUtil< ENTRY > |
class | bdlc::FlatHashSet< KEY, HASH, EQUAL > |
Namespaces | |
namespace | bdlc |
Functions | |
template<class KEY , class HASH , class EQUAL > | |
bool | bdlc::operator== (const FlatHashSet< KEY, HASH, EQUAL > &a, const FlatHashSet< KEY, HASH, EQUAL > &b) |
template<class KEY , class HASH , class EQUAL > | |
bool | bdlc::operator!= (const FlatHashSet< KEY, HASH, EQUAL > &a, const FlatHashSet< KEY, HASH, EQUAL > &b) |
template<class KEY , class HASH , class EQUAL > | |
void | bdlc::swap (FlatHashSet< KEY, HASH, EQUAL > &a, FlatHashSet< KEY, HASH, EQUAL > &b) |
template<class KEY , class HASH , class EQUAL > | |
bsl::ostream & | bdlc::operator<< (bsl::ostream &stream, const FlatHashSet< KEY, HASH, EQUAL > &set) |