#include <UnorderedPairs.hpp>
|
void | addPair (const T *left, const T *right) |
| Adds a pair to this container. More...
|
|
void | removePair (const T *left, const T *right) |
| Removes a pair from this container. More...
|
|
void | removeAllPairs () |
| Removes all the pairs from this container. More...
|
|
bool | contains (const T *left, const T *right) const |
| Returns true if this container contains the pair. More...
|
|
|
std::unordered_map< const T *, std::unordered_set< const T * > > | mList |
| The actual container to store pairs. More...
|
|
◆ addPair()
Adds a pair to this container.
◆ contains()
Returns true if this container contains the pair.
◆ removeAllPairs()
Removes all the pairs from this container.
◆ removePair()
Removes a pair from this container.
◆ mList
The actual container to store pairs.
Each pair is stored so that the key of the std::unordered_map always has a value less than every element in the std::unordered_set that is associated with it.