ABC: A System for Sequential Synthesis and Verification
 
Loading...
Searching...
No Matches
Public Member Functions | List of all members
Minisat::CMap< T > Class Template Reference

#include <SolverTypes.h>

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 ()
 

Detailed Description

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

Definition at line 319 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 345 of file SolverTypes.h.

345{ return map.bucket(i); }

◆ bucket_count()

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

Definition at line 344 of file SolverTypes.h.

344{ return map.bucket_count(); }

◆ clear()

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

Definition at line 329 of file SolverTypes.h.

329{ map.clear(); }

◆ debug()

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

Definition at line 351 of file SolverTypes.h.

351 {
352 printf(" --- size = %d, bucket_count = %d\n", size(), map.bucket_count()); }
Minisat::CMap::size
int size() const
Definition SolverTypes.h:330
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 335 of file SolverTypes.h.

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

◆ has()

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

Definition at line 337 of file SolverTypes.h.

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

◆ insert()

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

Definition at line 334 of file SolverTypes.h.

334{ map.insert(cr, t); }

◆ moveTo()

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

Definition at line 348 of file SolverTypes.h.

348{ map.moveTo(other.map); }

◆ operator[]() [1/2]

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

Definition at line 341 of file SolverTypes.h.

341{ return map[cr]; }

◆ operator[]() [2/2]

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

Definition at line 340 of file SolverTypes.h.

340{ return map[cr]; }

◆ remove()

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

Definition at line 336 of file SolverTypes.h.

336{ map.remove(cr); }

◆ size()

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

Definition at line 330 of file SolverTypes.h.

330{ return map.elems(); }
Here is the caller graph for this function:
The documentation for this class was generated from the following file: