amino::LockFreeDictionary< K, V > Class Template Reference

#include <lockfree_dictionary.h>

List of all members.

Public Member Functions
	LockFreeDictionary ()
	~LockFreeDictionary ()
bool	empty ()
int	size ()
bool	insert (const K &key, const V &value)
bool	findKey (const K &key, V &value)
bool	deleteKey (const K &key, V &value)
bool	findValue (const V &value, K &key)
bool	deleteValue (const V &value, K &key)
void	dumpQueue ()

template<typename K, typename V>
class amino::LockFreeDictionary< K, V >

---

Constructor & Destructor Documentation

template<typename K, typename V>

amino::LockFreeDictionary< K, V >::LockFreeDictionary

(

)

[inline]

template<typename K, typename V>

amino::LockFreeDictionary< K, V >::~LockFreeDictionary

(

)

[inline]

---

Member Function Documentation

template<typename K, typename V>

bool amino::LockFreeDictionary< K, V >::empty

(

)

[inline]

template<typename K, typename V>

int amino::LockFreeDictionary< K, V >::size

(

)

[inline]

template<typename K, typename V>

bool amino::LockFreeDictionary< K, V >::insert	(	const K &	key,
		const V &	value
	)			[inline]

traverse rapidly from an allocated node last and returns the node which key field is the highest key that is lower than the searched key at the current level.

template<typename K, typename V>

bool amino::LockFreeDictionary< K, V >::findKey	(	const K &	key,
		V &	value
	)			[inline]

template<typename K, typename V>

bool amino::LockFreeDictionary< K, V >::deleteKey	(	const K &	key,
		V &	value
	)			[inline]

template<typename K, typename V>

bool amino::LockFreeDictionary< K, V >::findValue	(	const V &	value,
		K &	key
	)			[inline]

template<typename K, typename V>

bool amino::LockFreeDictionary< K, V >::deleteValue	(	const V &	value,
		K &	key
	)			[inline]

template<typename K, typename V>

void amino::LockFreeDictionary< K, V >::dumpQueue

(

)

[inline]

---

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

• include/amino/lockfree_dictionary.h