SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
Container that stores expensive to construct objects and allows the fast lookup with respect to two independent keys within the objects. More...
#include <Bimap.h>
Data Structures | |
struct | FirstCompare |
Comparator that performs a heterogeneous lookup on the first key. More... | |
struct | SecondCompare |
Comparator that performs a heterogeneous lookup on the second key. More... | |
Public Types | |
typedef std::forward_list< Class > | Data |
typedef Data::iterator | Iterator |
typedef Data::const_iterator | ConstIterator |
Public Member Functions | |
Iterator | begin () noexcept |
ConstIterator | begin () const noexcept |
Iterator | end () noexcept |
ConstIterator | end () const noexcept |
Class & | firstAt (const FirstKeyType &firstKey) |
Class & | secondAt (const SecondKeyType &secondKey) |
Iterator | firstFind (const FirstKeyType &firstKey) |
Iterator | secondFind (const SecondKeyType &secondKey) |
template<typename... Args> | |
Iterator | emplace (Args &&... args) |
Private Attributes | |
Data | mData |
std::set< Iterator, FirstCompare > | mFirstMap |
std::set< Iterator, SecondCompare > | mSecondMap |
Container that stores expensive to construct objects and allows the fast lookup with respect to two independent keys within the objects.
typedef Data::const_iterator smtrat::Bimap< Class, FirstKeyType, FirstKeyName, SecondKeyType, SecondKeyName >::ConstIterator |
typedef std::forward_list<Class> smtrat::Bimap< Class, FirstKeyType, FirstKeyName, SecondKeyType, SecondKeyName >::Data |
typedef Data::iterator smtrat::Bimap< Class, FirstKeyType, FirstKeyName, SecondKeyType, SecondKeyName >::Iterator |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
|
inline |
|
inline |
|
inline |
|
private |
|
private |
|
private |