Minisat::Internal::Map< K, D, H, E > Class Template Reference

#include <ogdf/lib/minisat/mtl/Map.h>

Classes
struct	Pair

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

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

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

Detailed Description

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

Definition at line 56 of file Map.h.

Constructor & Destructor Documentation

Map() [1/3]

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

Minisat::Internal::Map< K, D, H, E >::Map ( Map< K, D, H, E > &  other )

inlineprivate

Definition at line 70 of file Map.h.

Map() [2/3]

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

Minisat::Internal::Map< K, D, H, E >::Map ( )

inline

Definition at line 104 of file Map.h.

Map() [3/3]

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

Minisat::Internal::Map< K, D, H, E >::Map ( const H &  h, const E &  e  )

inline

Definition at line 105 of file Map.h.

~Map()

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

Minisat::Internal::Map< K, D, H, E >::~Map ( )

inline

Definition at line 106 of file Map.h.

Member Function Documentation

_insert()

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

void Minisat::Internal::Map< K, D, H, E >::_insert ( const K &  k, const D &  d  )

inlineprivate

Definition at line 75 of file Map.h.

bucket()

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

const vec< Pair > & Minisat::Internal::Map< K, D, H, E >::bucket ( int  i ) const

inline

Definition at line 189 of file Map.h.

bucket_count()

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

int Minisat::Internal::Map< K, D, H, E >::bucket_count ( ) const

inline

Definition at line 174 of file Map.h.

checkCap()

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

bool Minisat::Internal::Map< K, D, H, E >::checkCap ( int  new_size ) const

inlineprivate

Definition at line 72 of file Map.h.

clear()

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

void Minisat::Internal::Map< K, D, H, E >::clear ( )

inline

Definition at line 167 of file Map.h.

elems()

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

int Minisat::Internal::Map< K, D, H, E >::elems ( ) const

inline

Definition at line 173 of file Map.h.

has()

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

bool Minisat::Internal::Map< K, D, H, E >::has ( const K &  k ) const

inline

Definition at line 146 of file Map.h.

index()

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

int32_t Minisat::Internal::Map< K, D, H, E >::index ( const K &  k ) const

inlineprivate

Definition at line 74 of file Map.h.

insert()

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

void Minisat::Internal::Map< K, D, H, E >::insert ( const K &  k, const D &  d  )

inline

Definition at line 135 of file Map.h.

moveTo()

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

void Minisat::Internal::Map< K, D, H, E >::moveTo ( Map< K, D, H, E > &  other )

inline

Definition at line 177 of file Map.h.

operator=()

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

Map< K, D, H, E > & Minisat::Internal::Map< K, D, H, E >::operator= ( Map< K, D, H, E > &  other )

inlineprivate

Definition at line 69 of file Map.h.

operator[]() [1/2]

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

D & Minisat::Internal::Map< K, D, H, E >::operator[] ( const K &  k )

inline

Definition at line 122 of file Map.h.

operator[]() [2/2]

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

const D & Minisat::Internal::Map< K, D, H, E >::operator[] ( const K &  k ) const

inline

Definition at line 109 of file Map.h.

peek()

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

bool Minisat::Internal::Map< K, D, H, E >::peek ( const K &  k, D &  d  ) const

inline

Definition at line 136 of file Map.h.

rehash()

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

void Minisat::Internal::Map< K, D, H, E >::rehash ( )

inlineprivate

Definition at line 79 of file Map.h.

remove()

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

void Minisat::Internal::Map< K, D, H, E >::remove ( const K &  k )

inline

Definition at line 156 of file Map.h.

Member Data Documentation

cap

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

int Minisat::Internal::Map< K, D, H, E >::cap

private

Definition at line 65 of file Map.h.

equals

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

E Minisat::Internal::Map< K, D, H, E >::equals

private

Definition at line 62 of file Map.h.

hash

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

H Minisat::Internal::Map< K, D, H, E >::hash

private

Definition at line 61 of file Map.h.

size

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

int Minisat::Internal::Map< K, D, H, E >::size

private

Definition at line 66 of file Map.h.

table

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

vec<Pair>* Minisat::Internal::Map< K, D, H, E >::table

private

Definition at line 64 of file Map.h.

---

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

• include/ogdf/lib/minisat/mtl/Map.h