SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Data Structures | Public Member Functions | Private Types | Private Attributes
Minisat::CMap< T > Class Template Reference

#include <SolverTypes.h>

Collaboration diagram for Minisat::CMap< T >:
Collaboration graph
[legend]

Data Structures

struct  CRefHash
 

Public Member Functions

void clear ()
 
int size () const
 
void insert (CRef cr, const T &t)
 
void growTo (CRef cr, const T &t)
 
void remove (CRef cr)
 
bool has (CRef cr, T &t)
 
const T & operator[] (CRef cr) const
 
T & operator[] (CRef cr)
 
int bucket_count () const
 
const vec< typename HashTable::Pair > & bucket (int i) const
 
void moveTo (CMap &other)
 
void debug ()
 

Private Types

typedef Map< CRef, T, CRefHash > HashTable
 

Private Attributes

HashTable map
 

Detailed Description

template<class T>
class Minisat::CMap< T >

Definition at line 372 of file SolverTypes.h.

Member Typedef Documentation

◆ HashTable

template<class T >
typedef Map<CRef, T, CRefHash> Minisat::CMap< T >::HashTable
private

Definition at line 377 of file SolverTypes.h.

Member Function Documentation

◆ bucket()

template<class T >
const vec<typename HashTable::Pair>& Minisat::CMap< T >::bucket ( int  i) const
inline

Definition at line 398 of file SolverTypes.h.

Here is the call graph for this function:

◆ bucket_count()

template<class T >
int Minisat::CMap< T >::bucket_count ( ) const
inline

Definition at line 397 of file SolverTypes.h.

Here is the call graph for this function:

◆ clear()

template<class T >
void Minisat::CMap< T >::clear ( )
inline

Definition at line 382 of file SolverTypes.h.

Here is the call graph for this function:

◆ debug()

template<class T >
void Minisat::CMap< T >::debug ( )
inline

Definition at line 404 of file SolverTypes.h.

Here is the call graph for this function:

◆ growTo()

template<class T >
void Minisat::CMap< T >::growTo ( CRef  cr,
const T &  t 
)
inline

Definition at line 388 of file SolverTypes.h.

Here is the call graph for this function:

◆ has()

template<class T >
bool Minisat::CMap< T >::has ( CRef  cr,
T &  t 
)
inline

Definition at line 390 of file SolverTypes.h.

Here is the call graph for this function:

◆ insert()

template<class T >
void Minisat::CMap< T >::insert ( CRef  cr,
const T &  t 
)
inline

Definition at line 387 of file SolverTypes.h.

Here is the call graph for this function:

◆ moveTo()

template<class T >
void Minisat::CMap< T >::moveTo ( CMap< T > &  other)
inline

Definition at line 401 of file SolverTypes.h.

Here is the call graph for this function:

◆ operator[]() [1/2]

template<class T >
T& Minisat::CMap< T >::operator[] ( CRef  cr)
inline

Definition at line 394 of file SolverTypes.h.

◆ operator[]() [2/2]

template<class T >
const T& Minisat::CMap< T >::operator[] ( CRef  cr) const
inline

Definition at line 393 of file SolverTypes.h.

◆ remove()

template<class T >
void Minisat::CMap< T >::remove ( CRef  cr)
inline

Definition at line 389 of file SolverTypes.h.

Here is the call graph for this function:

◆ size()

template<class T >
int Minisat::CMap< T >::size ( ) const
inline

Definition at line 383 of file SolverTypes.h.

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

Field Documentation

◆ map

template<class T >
HashTable Minisat::CMap< T >::map
private

Definition at line 378 of file SolverTypes.h.

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