KDevelop::PersistentSetMap< Key, Data, Handler, Hasher > Class Template Reference

This class allows easily implement a very efficient persistent map from a key, to a set of data items. More...

#include <persistentsetmap.h>

List of all members.

Public Member Functions
	PersistentSetMap (QString name)
void	addItem (const Key &key, const Data &data)
void	items (const Key &key, uint &countTarget, const Data *&datasTarget) const
void	removeItem (const Key &key, const Data &data)

---

Detailed Description

template<class Key, class Data, class Handler, class Hasher = HashHasher<Key>>
class KDevelop::PersistentSetMap< Key, Data, Handler, Hasher >

This class allows easily implement a very efficient persistent map from a key, to a set of data items.

Parameters:

	Key	The key class, from which a set of Data items is mapped. It must be safely memory-copyable((no virtual functions etc),
	Data	The data class, of which a set will be stored. The data must be safely memory-copyable(no virtual functions etc), and it must be compatbiel with EmbeddedFreeTree
	Handler	Must be a handler that allows storing additional information into invalid items,

See also:

util/embeddedfreetree.h

Parameters:

Hasher

A hasher that extracts a hash-value from the key.

Definition at line 133 of file persistentsetmap.h.

---

Member Function Documentation

template<class Key , class Data , class Handler , class Hasher >

void KDevelop::PersistentSetMap< Key, Data, Handler, Hasher >::items	(	const Key &	key,
		uint &	countTarget,
		const Data *&	datasTarget
	)			const [inline]

The returned list may contain "invalid" items, those have to be filtered out by the user.

Definition at line 233 of file persistentsetmap.h.

---

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

• persistentsetmap.h