---

MapLikeContainer Class Template Reference

A simple, quick replacement for std::map. More...

#include <MapLikeContainer.h>

Collaboration diagram for MapLikeContainer:

[legend]List of all members.

Public Types
typedef value_type*	iterator
typedef const value_type*	const_iterator
enum	{ MAP_EMPTY = -1 }
Public Methods
	MapLikeContainer ()
void	clear ()
void	erase (int position)
iterator	begin ()
const_iterator	begin () const
iterator	upper_bound (int position)
iterator	end ()
const_iterator	end () const
T&	operator[] (int position)
unsigned	size () const
iterator	find (int position)

---

Detailed Description

template<typename T, int max_size> template class MapLikeContainer

A simple, quick replacement for std::map.

Designed for easy viewing of data during debugging. Implemented using an array. It would be nice to convert this to a hash - however hashes are hard to iterate over.

This shouldn't be used in the final release - use a hash map instead

The iterator needs to be fixed up so that it skips elements that are not used.

---

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

• /home/pcburns/c/penguinsound/include/PenguinSound/MapLikeContainer.h

---