Divide Framework 0.1
A free and open-source 3D Framework under heavy development
Loading...
Searching...
No Matches
HashMap.h File Reference
#include "Platform/Headers/PlatformDataTypes.h"
#include <EASTL/unordered_map.h>
#include <EASTL/intrusive_hash_map.h>

Go to the source code of this file.

Classes

struct  Divide::hasher< T, bool >
 
struct  Divide::hasher< T, true >
 
struct  Divide::EnumHash< T >
 
struct  Divide::NoHash< T >
 
struct  eastl::hash< std::string >
 

Namespaces

namespace  Divide
 Handle console commands that start with a forward slash.
 
namespace  eastl
 

Macros

#define DVD_HASH_MAP_H_
 

Typedefs

template<typename Key >
using Divide::HashType = EnumHash< Key >
 
template<typename K , typename V , typename HashFun = Divide::HashType<K>, typename Predicate = eastl::equal_to<K>>
using Divide::hashMapDefaultAlloc = hashAlg::unordered_map< K, V, HashFun, Predicate >
 
template<typename K , typename V , typename HashFun = Divide::HashType<K>, typename Predicate = eastl::equal_to<K>>
using Divide::hashMap = hashAlg::unordered_map< K, V, HashFun, Predicate >
 
template<typename K , typename V , typename HashFun = Divide::HashType<K>, typename Predicate = eastl::equal_to<K>>
using Divide::hashPairReturn = hashAlg::pair< typename hashMap< K, V, HashFun, Predicate >::iterator, bool >
 
template<typename K , typename V >
using Divide::hashMapIntrusive = hashAlg::intrusive_hash_map< K, V, 37 >
 

Functions

template<typename K , typename V , typename ... Args, typename HashFun = Divide::HashType<K>, typename Predicate = equal_to<K>>
Divide::hashPairReturn< K, V, HashFun > eastl::emplace (Divide::hashMap< K, V, HashFun, Predicate > &map, K key, Args &&... args)
 
template<typename K , typename V , typename ... Args, typename HashFun = Divide::HashType<K>, typename Predicate = equal_to<K>>
Divide::hashPairReturn< K, V, HashFun > eastl::emplace (Divide::hashMap< K, V, HashFun, Predicate > &map, Args &&... args)
 
template<typename K , typename V , typename HashFun = Divide::HashType<K>, typename Predicate = equal_to<K>>
Divide::hashPairReturn< K, V, HashFun > eastl::insert (Divide::hashMap< K, V, HashFun, Predicate > &map, const pair< K, V > &valuePair)
 
template<typename K , typename V , typename HashFun = Divide::HashType<K>, typename Predicate = equal_to<K>>
Divide::hashPairReturn< K, V, HashFun > eastl::insert (Divide::hashMap< K, V, HashFun, Predicate > &map, K key, const V &value)
 
template<typename K , typename V , typename HashFun = Divide::HashType<K>, typename Predicate = equal_to<K>>
Divide::hashPairReturn< K, V, HashFun > eastl::insert (Divide::hashMap< K, V, HashFun, Predicate > &map, K key, V &&value)
 

Macro Definition Documentation

◆ DVD_HASH_MAP_H_

#define DVD_HASH_MAP_H_

Definition at line 34 of file HashMap.h.