Map.hpp File Reference

#include "Pair.hpp"
#include "CeresEngine/Foundation/Allocator.hpp"
#include "CeresEngine/Foundation/Hash.hpp"
#include <map>
#include <unordered_map>

Go to the source code of this file.

Namespaces
namespace	CeresEngine

Typedefs
template<typename Key , typename T , typename Compare = std::less<>, typename RawAllocator = DefaultAllocator>
using	CeresEngine::Map = std::map< Key, T, Compare, ScopedAllocatorAdaptor< StdAllocator< Pair< const Key, T >, RawAllocator > > >
	Map is a sorted associative container that contains key-value pairs with unique keys.
template<typename Key , typename T , typename Compare = std::less<>>
using	CeresEngine::TemporaryMap = Map< Key, T, Compare, TemporaryAllocator >
	A special Map that uses a fast temporary allocator.
template<typename Key , typename T , typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<>, typename RawAllocator = DefaultAllocator>
using	CeresEngine::HashMap = std::unordered_map< Key, T, Hash, KeyEqual, ScopedAllocatorAdaptor< StdAllocator< Pair< const Key, T >, RawAllocator > > >
	HashMap is an associative container that contains key-value pairs with unique keys.
template<typename Key , typename T , typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<>>
using	CeresEngine::TemporaryHashMap = HashMap< Key, T, Hash, KeyEqual, TemporaryAllocator >
	A special HashMap that uses a fast temporary allocator.