Return true if the specified lhs and rhs objects have the same value, and false otherwise. Two HashTable objects have the same value if they have the same number of elements, and for every subset of elements in lhs having keys that compare equal (according to that hash table's comparator), a corresponding subset of elements exists in rhs, having the same number of elements, where, for some permutation of the lhs subset, every element in that subset compares equal (using operator==) to the corresponding element in the rhs subset. The behavior is undefined unless both the hasher and comparator of lhs and rhs return the same value for every valid input. Note that this method requires that the ValueType of the parameterized KEY_CONFIG be "equality‐comparable" (see {Requirements on KEY_CONFIG}).
Synopsis
Declared in <bslstl_hashtable.h>
template<
class KEY_CONFIG,
class HASHER,
class COMPARATOR,
class ALLOCATOR>
bool
operator==(
HashTable<KEY_CONFIG, HASHER, COMPARATOR, ALLOCATOR> const& lhs,
HashTable<KEY_CONFIG, HASHER, COMPARATOR, ALLOCATOR> const& rhs);
Created with MrDocs