Minisat::CMap< T > Class Template Reference

#include <SolverTypes.h>

Collaboration diagram for Minisat::CMap< T >:

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 388 of file SolverTypes.h.

Member Typedef Documentation

template<class T >

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

private

Definition at line 393 of file SolverTypes.h.

Member Function Documentation

template<class T >

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

inline

Definition at line 414 of file SolverTypes.h.

{ return map.bucket(i); }

Here is the call graph for this function:

template<class T >

int Minisat::CMap< T >::bucket_count ( ) const

inline

Definition at line 413 of file SolverTypes.h.

{ return map.bucket_count(); }

Here is the call graph for this function:

template<class T >

void Minisat::CMap< T >::clear ( )

inline

Definition at line 398 of file SolverTypes.h.

{ map.clear(); }

Here is the call graph for this function:

template<class T >

void Minisat::CMap< T >::debug ( )

inline

Definition at line 420 of file SolverTypes.h.

                {
        printf(" --- size = %d, bucket_count = %d\n", size(), map.bucket_count()); }

Here is the call graph for this function:

template<class T >

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

inline

Definition at line 404 of file SolverTypes.h.

{ map.insert(cr, t); } // NOTE: for compatibility

Here is the call graph for this function:

template<class T >

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

inline

Definition at line 406 of file SolverTypes.h.

{ return map.peek(cr, t); }

Here is the call graph for this function:

template<class T >

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

inline

Definition at line 403 of file SolverTypes.h.

{ map.insert(cr, t); }

Here is the call graph for this function:

template<class T >

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

inline

Definition at line 417 of file SolverTypes.h.

{ map.moveTo(other.map); }

Here is the call graph for this function:

template<class T >

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

inline

Definition at line 409 of file SolverTypes.h.

{ return map[cr]; }

template<class T >

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

inline

Definition at line 410 of file SolverTypes.h.

{ return map[cr]; }

template<class T >

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

inline

Definition at line 405 of file SolverTypes.h.

{ map.remove(cr); }

Here is the call graph for this function:

template<class T >

int Minisat::CMap< T >::size ( void  ) const

inline

Definition at line 399 of file SolverTypes.h.

{ return map.elems(); }

Here is the call graph for this function:

Here is the caller graph for this function:

Field Documentation

template<class T >

HashTable Minisat::CMap< T >::map

private

Definition at line 394 of file SolverTypes.h.

---

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

• SolverTypes.h