Minisat::IntMap< K, V, MkIndex > Class Template Reference

#include <IntMap.h>

Collaboration diagram for Minisat::IntMap< K, V, MkIndex >:

Public Member Functions
	IntMap (MkIndex _index=MkIndex())
bool	has (K k) const
const V &	operator[] (K k) const
V &	operator[] (K k)
const V *	begin () const
const V *	end () const
V *	begin ()
V *	end ()
void	reserve (K key, V pad)
void	reserve (K key)
void	insert (K key, V val, V pad)
void	insert (K key, V val)
void	clear (bool dispose=false)
void	moveTo (IntMap &to)
void	copyTo (IntMap &to) const

Private Attributes
vec< V >	map
MkIndex	index

Detailed Description

template<class K, class V, class MkIndex = MkIndexDefault<K>>
class Minisat::IntMap< K, V, MkIndex >

Definition at line 31 of file IntMap.h.

Constructor & Destructor Documentation

template<class K, class V, class MkIndex = MkIndexDefault<K>>

Minisat::IntMap< K, V, MkIndex >::IntMap ( MkIndex  _index = MkIndex() )

inlineexplicit

Definition at line 35 of file IntMap.h.

: index(_index){}

Member Function Documentation

template<class K, class V, class MkIndex = MkIndexDefault<K>>

const V* Minisat::IntMap< K, V, MkIndex >::begin ( ) const

inline

Definition at line 42 of file IntMap.h.

{ return &map[0]; }

template<class K, class V, class MkIndex = MkIndexDefault<K>>

V* Minisat::IntMap< K, V, MkIndex >::begin ( )

inline

Definition at line 44 of file IntMap.h.

{ return &map[0]; }

template<class K, class V, class MkIndex = MkIndexDefault<K>>

void Minisat::IntMap< K, V, MkIndex >::clear ( bool  dispose = false )

inline

Definition at line 52 of file IntMap.h.

{ map.clear(dispose); }

Here is the caller graph for this function:

template<class K, class V, class MkIndex = MkIndexDefault<K>>

void Minisat::IntMap< K, V, MkIndex >::copyTo ( IntMap< K, V, MkIndex > &  to ) const

inline

Definition at line 54 of file IntMap.h.

{ map.copyTo(to.map); to.index = index; }

template<class K, class V, class MkIndex = MkIndexDefault<K>>

const V* Minisat::IntMap< K, V, MkIndex >::end ( ) const

inline

Definition at line 43 of file IntMap.h.

{ return &map[map.size()]; }

template<class K, class V, class MkIndex = MkIndexDefault<K>>

V* Minisat::IntMap< K, V, MkIndex >::end ( )

inline

Definition at line 45 of file IntMap.h.

{ return &map[map.size()]; }

template<class K, class V, class MkIndex = MkIndexDefault<K>>

bool Minisat::IntMap< K, V, MkIndex >::has ( K  k ) const

inline

Definition at line 37 of file IntMap.h.

{ return index(k) < map.size(); }

Here is the caller graph for this function:

template<class K, class V, class MkIndex = MkIndexDefault<K>>

void Minisat::IntMap< K, V, MkIndex >::insert ( K  key, V  val, V  pad  )

inline

Definition at line 49 of file IntMap.h.

{ reserve(key, pad); operator[](key) = val; }

Here is the caller graph for this function:

template<class K, class V, class MkIndex = MkIndexDefault<K>>

void Minisat::IntMap< K, V, MkIndex >::insert ( K  key, V  val  )

inline

Definition at line 50 of file IntMap.h.

{ reserve(key); operator[](key) = val; }

template<class K, class V, class MkIndex = MkIndexDefault<K>>

void Minisat::IntMap< K, V, MkIndex >::moveTo ( IntMap< K, V, MkIndex > &  to )

inline

Definition at line 53 of file IntMap.h.

{ map.moveTo(to.map); to.index = index; }

template<class K, class V, class MkIndex = MkIndexDefault<K>>

const V& Minisat::IntMap< K, V, MkIndex >::operator[] ( K  k ) const

inline

Definition at line 39 of file IntMap.h.

{ assert(has(k)); return map[index(k)]; }

Here is the caller graph for this function:

template<class K, class V, class MkIndex = MkIndexDefault<K>>

V& Minisat::IntMap< K, V, MkIndex >::operator[] ( K  k )

inline

Definition at line 40 of file IntMap.h.

{ assert(has(k)); return map[index(k)]; }

template<class K, class V, class MkIndex = MkIndexDefault<K>>

void Minisat::IntMap< K, V, MkIndex >::reserve ( K  key, V  pad  )

inline

Definition at line 47 of file IntMap.h.

{ map.growTo(index(key)+1, pad); }

Here is the caller graph for this function:

template<class K, class V, class MkIndex = MkIndexDefault<K>>

void Minisat::IntMap< K, V, MkIndex >::reserve ( K  key )

inline

Definition at line 48 of file IntMap.h.

{ map.growTo(index(key)+1); }

Field Documentation

template<class K, class V, class MkIndex = MkIndexDefault<K>>

MkIndex Minisat::IntMap< K, V, MkIndex >::index

private

Definition at line 33 of file IntMap.h.

template<class K, class V, class MkIndex = MkIndexDefault<K>>

vec<V> Minisat::IntMap< K, V, MkIndex >::map

private

Definition at line 32 of file IntMap.h.

---

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

• IntMap.h