Divide Framework 0.1
A free and open-source 3D Framework under heavy development
Loading...
Searching...
No Matches
eastl Namespace Reference

Classes

struct  hash< Divide::PoolHandle >
 
struct  hash< Divide::vec2< Divide::F32 > >
 
struct  hash< std::string >
 

Functions

template<typename K , typename V , typename ... Args, typename HashFun = Divide::HashType<K>, typename Predicate = equal_to<K>>
Divide::hashPairReturn< K, V, HashFun > 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 > 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 > 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 > 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 > insert (Divide::hashMap< K, V, HashFun, Predicate > &map, K key, V &&value)
 
bool operator== (const allocator &, const allocator &)
 
bool operator!= (const allocator &, const allocator &)
 

Function Documentation

◆ emplace() [1/2]

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 
)

Definition at line 127 of file HashMap.h.

◆ emplace() [2/2]

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,
key,
Args &&...  args 
)

Definition at line 121 of file HashMap.h.

◆ insert() [1/3]

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 
)

Definition at line 133 of file HashMap.h.

◆ insert() [2/3]

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,
key,
const V &  value 
)

Definition at line 139 of file HashMap.h.

◆ insert() [3/3]

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,
key,
V &&  value 
)

Definition at line 145 of file HashMap.h.

◆ operator!=()

bool eastl::operator!= ( const allocator &  ,
const allocator &   
)
inline

Definition at line 124 of file TemplateAllocator.h.

◆ operator==()

bool eastl::operator== ( const allocator &  ,
const allocator &   
)
inline

Definition at line 118 of file TemplateAllocator.h.