sprint::unordered_map< _Key, _Tp > Class Template Reference

#include <unordered_map.h>

Inherits std::vector< T >.

List of all members.

Public Types
typedef _Key	key_type
typedef _Tp	mapped_type
typedef std::pair< _Key, _Tp >	value_type
typedef std::vector< value_type >	parent
typedef parent::iterator	iterator
typedef parent::const_iterator	const_iterator
Public Member Functions
iterator	force_insert (const key_type &__x, const mapped_type &type)
iterator	find (const key_type &__x)
	find element __x
const_iterator	find (const key_type &__x) const
	find element __x
mapped_type &	operator[] (const key_type &__x)
	random access to any element of the list
void	insert (const value_type &__x)

---

Detailed Description

template<typename _Key, typename _Tp>
class sprint::unordered_map< _Key, _Tp >

An unsorted map (reduce memory fragmentation), costant time insertion and O(N) time to find element

---

Member Function Documentation

template<typename _Key, typename _Tp>

void sprint::unordered_map< _Key, _Tp >::insert

(

const value_type &

__x

)

insert a pair in the unordered_map without check it use it with care

---

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

• sprint/container/unordered_map.h