Unigine::BiMap Class

Header:

#include <UnigineBiMap.h>

Methods:

Name	Description View: Sort by:
BiMap
operator =
swap
clear
getMemoryUsage
insert
append
emplace
appendFast
emplaceFast
contains
replace
replaceData
operator []
get
getKey
findData
containsData
remove
erase
removeData
take
takeData
value
valueRef
key
keyRef
values
getValues
getPairs
operator ==
operator !=

BiMap Class

Members

BiMap ( ) #

BiMap ( std::initializer_list<Pair<Key,Type>> list ) #

Arguments

std::initializer_list<Pair<Key,Type>> list

BiMap ( const BiMap& o ) #

Arguments

const BiMap& o

BiMap ( BiMap&& o ) #

Arguments

BiMap&& o

BiMap<Key, Type, Allocator> & operator= ( const BiMap& o ) #

Arguments

const BiMap& o

BiMap<Key, Type, Allocator> & operator= ( BiMap&& o ) #

Arguments

BiMap&& o

void swap ( BiMap& o ) #

Arguments

BiMap& o

void clear ( ) #

size_t getMemoryUsage ( ) const#

Iterator insert ( const Key& key, const Type& value ) #

Arguments

const Key& key
const Type& value

Iterator insert ( Key&& key, const Type& value ) #

Arguments

Key&& key
const Type& value

Iterator insert ( const Key& key, Type&& value ) #

Arguments

const Key& key
Type&& value

Iterator insert ( Key&& key, Type&& value ) #

Arguments

Key&& key
Type&& value

void insert ( const BiMap& m ) #

Arguments

const BiMap& m

void insert ( BiMap&& m ) #

Arguments

BiMap&& m

Iterator append ( const Key& key, const Type& value ) #

Arguments

const Key& key
const Type& value

Iterator append ( Key&& key, const Type& value ) #

Arguments

Key&& key
const Type& value

Iterator append ( const Key& key, Type&& value ) #

Arguments

const Key& key
Type&& value

Iterator append ( Key&& key, Type&& value ) #

Arguments

Key&& key
Type&& value

void append ( const BiMap& m ) #

Arguments

const BiMap& m

void append ( BiMap&& m ) #

Arguments

BiMap&& m

const Type & emplace ( const Key& key, Args&& args ) #

Arguments

const Key& key
Args&& args

const Type & emplace ( Key&& key, Args&& args ) #

Arguments

Key&& key
Args&& args

Iterator appendFast ( const Key& key, const Type& value ) #

Arguments

const Key& key
const Type& value

Iterator appendFast ( Key&& key, const Type& value ) #

Arguments

Key&& key
const Type& value

Iterator appendFast ( const Key& key, Type&& value ) #

Arguments

const Key& key
Type&& value

Iterator appendFast ( Key&& key, Type&& value ) #

Arguments

Key&& key
Type&& value

void appendFast ( const BiMap& m ) #

Arguments

const BiMap& m

void appendFast ( BiMap&& m ) #

Arguments

BiMap&& m

const Type & emplaceFast ( const Key& key, Args&& args ) #

Arguments

const Key& key
Args&& args

const Type & emplaceFast ( Key&& key, Args&& args ) #

Arguments

Key&& key
Args&& args

bool contains ( const T& key ) const#

Arguments

const T& key

template<typename TypeKey> contains ( const TypeKey& key, const Type& value ) const#

Arguments

const TypeKey& key
const Type& value

template<typename TypeKey,typename TypeValue> replace ( TypeKey&& key, TypeValue&& value ) #

Arguments

TypeKey&& key
TypeValue&& value

template<typename TypeValue,typename TypeKey> replaceData ( TypeKey&& key, TypeValue&& value ) #

Arguments

TypeKey&& key
TypeValue&& value

const Type & operator[] ( const Key& key ) const#

Arguments

const Key& key

const Type & get ( const Key& key ) const#

Arguments

const Key& key

const Key & getKey ( const Type& value ) const#

Arguments

const Type& value

Iterator findData ( const T& v ) #

Arguments

const T& v

ConstIterator findData ( const T& v ) const#

Arguments

const T& v

bool containsData ( const T& v ) const#

Arguments

const T& v

bool remove ( const Key& key ) #

Arguments

const Key& key

bool remove ( const Iterator& it ) #

Arguments

const Iterator& it

bool remove ( const ConstIterator& it ) #

Arguments

const ConstIterator& it

bool erase ( const Key& key ) #

Arguments

const Key& key

Iterator erase ( const Iterator& it ) #

Arguments

const Iterator& it

ConstIterator erase ( const ConstIterator& it ) #

Arguments

const ConstIterator& it

bool removeData ( const Type& value ) #

Arguments

const Type& value

Type take ( const Key& key ) #

Arguments

const Key& key

bool take ( const Key& key, Type& ret ) #

Arguments

const Key& key
Type& ret

Key takeData ( const Type& value ) #

Arguments

const Type& value

bool takeData ( const Type& value, Key& ret ) #

Arguments

const Type& value
Key& ret

Type value ( const Key& key ) const#

Arguments

const Key& key

Type value ( const Key& key, const Type& def ) const#

Arguments

const Key& key
const Type& def

const Type & valueRef ( const Key& key, const Type& def ) const#

Arguments

const Key& key
const Type& def

Key key ( const Type& value ) const#

Arguments

const Type& value

Key key ( const Type& value, const Key& def ) const#

Arguments

const Type& value
const Key& def

const Key & keyRef ( const Type& value, const Key& def ) const#

Arguments

const Type& value
const Key& def

int values ( ) const#

void getValues ( Vector<Type>& values ) const#

Arguments

Vector<Type>& values

void getPairs ( Vector<Pair<Key,Type >>& pairs ) const#

Arguments

Vector<Pair<Key,Type >>& pairs

bool operator== ( const BiMap& o ) const#

Arguments

const BiMap& o

bool operator!= ( const BiMap& o ) const#

Arguments

const BiMap& o

Last update: 13.12.2021

Помогите сделать статью лучше

Была ли эта статья полезной?

Сообщить о проблеме в этой статье

(или выберите слово/фразу и нажмите Ctrl+Enter