Container class representing a vector of objects with keys. More...

#include <linkedmap.h>

Public Types
using	Ptr = T *

using	Vec = std::vector< Ptr >

using	iterator = typename Vec::iterator

using	const_iterator = typename Vec::const_iterator

using	reverse_iterator = typename Vec::reverse_iterator

using	const_reverse_iterator = typename Vec::const_reverse_iterator

Public Member Functions
const T *	find (const std::string &key) const
	find an object given the key. More...

const T *	find (const QCString &key) const
	find an object given the key. More...

const T *	find (const char *key) const
	find an object given the key. More...

T *	find (const char *key)
	non-const wrapper for find() const

T *	find (const QCString &key)

T *	find (const std::string &key)
	non-const wrapper for find() const

bool	add (const char k, T obj)
	Adds an object reference to the ordered vector if it was not added already. More...

bool	add (const QCString &k, T *obj)

bool	prepend (const char k, T obj)
	Prepends an object reference to the ordered vector if it was not added already. More...

bool	prepend (const QCString &key, T *obj)

bool	del (const QCString &key)
	Removes an object from the container and deletes it. More...

Ptr &	operator[] (size_t pos)

const Ptr &	operator[] (size_t pos) const

iterator	begin ()

iterator	end ()

const_iterator	begin () const

const_iterator	end () const

reverse_iterator	rbegin ()

reverse_iterator	rend ()

const_reverse_iterator	rbegin () const

const_reverse_iterator	rend () const

bool	empty () const

size_t	size () const

void	clear ()

Detailed Description

template<class T, class Hash = std::hash<std::string>, class KeyEqual = std::equal_to<std::string>, class Map = std::unordered_map<std::string,T*,Hash,KeyEqual >>
class LinkedRefMap< T, Hash, KeyEqual, Map >

Container class representing a vector of objects with keys.

Objects can be efficiently be looked up given the key. Objects are not owned by the container, the container will only hold references. When adding objects the order of addition is kept, and used while iterating.