SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Data Structures | Public Member Functions | Private Member Functions | Private Attributes
Minisat::Map< K, D, H, E > Class Template Reference

#include <Map.h>

Inheritance diagram for Minisat::Map< K, D, H, E >:
Inheritance graph
[legend]
Collaboration diagram for Minisat::Map< K, D, H, E >:
Collaboration graph
[legend]

Data Structures

struct  Pair
 

Public Member Functions

 Map ()
 
 Map (const H &h, const E &e)
 
 ~Map ()
 
const D & operator[] (const K &k) const
 
D & operator[] (const K &k)
 
void insert (const K &k, const D &d)
 
bool peek (const K &k, D &d) const
 
bool has (const K &k) const
 
void remove (const K &k)
 
void clear ()
 
int elems () const
 
int bucket_count () const
 
void moveTo (Map &other)
 
const vec< Pair > & bucket (int i) const
 

Private Member Functions

Map< K, D, H, E > & operator= (Map< K, D, H, E > &)
 
 Map (Map< K, D, H, E > &)
 
bool checkCap (int new_size) const
 
int32_t index (const K &k) const
 
void _insert (const K &k, const D &d)
 
void rehash ()
 

Private Attributes

H hash
 
E equals
 
vec< Pair > * table
 
int cap
 
int size
 

Detailed Description

template<class K, class D, class H = Hash<K>, class E = Equal<K>>
class Minisat::Map< K, D, H, E >

Definition at line 57 of file Map.h.

Constructor & Destructor Documentation

◆ Map() [1/3]

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
Minisat::Map< K, D, H, E >::Map ( Map< K, D, H, E > &  )
inlineprivate

Definition at line 71 of file Map.h.

◆ Map() [2/3]

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
Minisat::Map< K, D, H, E >::Map ( )
inline

Definition at line 103 of file Map.h.

◆ Map() [3/3]

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
Minisat::Map< K, D, H, E >::Map ( const H &  h,
const E &  e 
)
inline

Definition at line 104 of file Map.h.

◆ ~Map()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
Minisat::Map< K, D, H, E >::~Map ( )
inline

Definition at line 105 of file Map.h.

Member Function Documentation

◆ _insert()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
void Minisat::Map< K, D, H, E >::_insert ( const K &  k,
const D &  d 
)
inlineprivate

Definition at line 76 of file Map.h.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ bucket()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
const vec<Pair>& Minisat::Map< K, D, H, E >::bucket ( int  i) const
inline

Definition at line 188 of file Map.h.

Here is the caller graph for this function:

◆ bucket_count()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
int Minisat::Map< K, D, H, E >::bucket_count ( ) const
inline

Definition at line 173 of file Map.h.

Here is the caller graph for this function:

◆ checkCap()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
bool Minisat::Map< K, D, H, E >::checkCap ( int  new_size) const
inlineprivate

Definition at line 73 of file Map.h.

Here is the caller graph for this function:

◆ clear()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
void Minisat::Map< K, D, H, E >::clear ( )
inline

Definition at line 166 of file Map.h.

Here is the caller graph for this function:

◆ elems()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
int Minisat::Map< K, D, H, E >::elems ( ) const
inline

Definition at line 172 of file Map.h.

Here is the caller graph for this function:

◆ has()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
bool Minisat::Map< K, D, H, E >::has ( const K &  k) const
inline

Definition at line 145 of file Map.h.

Here is the call graph for this function:

◆ index()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
int32_t Minisat::Map< K, D, H, E >::index ( const K &  k) const
inlineprivate

Definition at line 75 of file Map.h.

Here is the caller graph for this function:

◆ insert()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
void Minisat::Map< K, D, H, E >::insert ( const K &  k,
const D &  d 
)
inline

Definition at line 134 of file Map.h.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ moveTo()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
void Minisat::Map< K, D, H, E >::moveTo ( Map< K, D, H, E > &  other)
inline

Definition at line 176 of file Map.h.

Here is the caller graph for this function:

◆ operator=()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
Map<K,D,H,E>& Minisat::Map< K, D, H, E >::operator= ( Map< K, D, H, E > &  )
inlineprivate

Definition at line 70 of file Map.h.

◆ operator[]() [1/2]

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
D& Minisat::Map< K, D, H, E >::operator[] ( const K &  k)
inline

Definition at line 121 of file Map.h.

Here is the call graph for this function:

◆ operator[]() [2/2]

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
const D& Minisat::Map< K, D, H, E >::operator[] ( const K &  k) const
inline

Definition at line 108 of file Map.h.

Here is the call graph for this function:

◆ peek()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
bool Minisat::Map< K, D, H, E >::peek ( const K &  k,
D &  d 
) const
inline

Definition at line 135 of file Map.h.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ rehash()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
void Minisat::Map< K, D, H, E >::rehash ( )
inlineprivate

Definition at line 80 of file Map.h.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ remove()

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
void Minisat::Map< K, D, H, E >::remove ( const K &  k)
inline

Definition at line 155 of file Map.h.

Here is the call graph for this function:
Here is the caller graph for this function:

Field Documentation

◆ cap

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
int Minisat::Map< K, D, H, E >::cap
private

Definition at line 66 of file Map.h.

◆ equals

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
E Minisat::Map< K, D, H, E >::equals
private

Definition at line 63 of file Map.h.

◆ hash

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
H Minisat::Map< K, D, H, E >::hash
private

Definition at line 62 of file Map.h.

◆ size

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
int Minisat::Map< K, D, H, E >::size
private

Definition at line 67 of file Map.h.

◆ table

template<class K , class D , class H = Hash<K>, class E = Equal<K>>
vec<Pair>* Minisat::Map< K, D, H, E >::table
private

Definition at line 65 of file Map.h.

The documentation for this class was generated from the following file: