![]() |
Open CASCADE Technology Reference Manual 8.0.0
|
#include <NCollection_IndexedDataMap.hxx>

Data Structures | |
| class | Iterator |
| Implementation of the Iterator interface. More... | |
Public Types | |
| typedef TheKeyType | key_type |
| STL-compliant typedef for key type. | |
| typedef TheItemType | value_type |
| STL-compliant typedef for value type. | |
| typedef Hasher | hasher |
| typedef NCollection_StlIterator< std::forward_iterator_tag, Iterator, TheItemType, false > | iterator |
| Shorthand for a regular iterator type. | |
| typedef NCollection_StlIterator< std::forward_iterator_tag, Iterator, TheItemType, true > | const_iterator |
| Shorthand for a constant iterator type. | |
| using | KeyValueRef = NCollection_ItemsView::KeyValueRef<TheKeyType, TheItemType, false> |
| Key-value pair reference for structured binding support. Enables: for (auto [key, value] : map.Items()) | |
| using | ConstKeyValueRef = NCollection_ItemsView::KeyValueRef<TheKeyType, TheItemType, true> |
| Const key-value pair reference for structured binding support. | |
| using | KeyValueIndexRef = NCollection_ItemsView::KeyValueIndexRef<TheKeyType, TheItemType, false> |
| Key-value-index tuple reference for structured binding support. Enables: for (auto [key, value, index] : map.IndexedItems()) | |
| using | ConstKeyValueIndexRef |
| Const key-value-index tuple reference for structured binding support. | |
| using | ItemsView |
| View class for key-value pair iteration (mutable). | |
| using | ConstItemsView |
| View class for key-value pair iteration (const). | |
| using | IndexedItemsView |
| View class for key-value-index tuple iteration (mutable). | |
| using | ConstIndexedItemsView |
| View class for key-value-index tuple iteration (const). | |
Public Member Functions | |
| iterator | begin () const noexcept |
| Returns an iterator pointing to the first element in the map. | |
| iterator | end () const noexcept |
| Returns an iterator referring to the past-the-end element in the map. | |
| const_iterator | cbegin () const noexcept |
| Returns a const iterator pointing to the first element in the map. | |
| const_iterator | cend () const noexcept |
| Returns a const iterator referring to the past-the-end element in the map. | |
| ItemsView | Items () |
| Returns a view for key-value pair iteration. Usage: for (auto [aKey, aValue] : aMap.Items()) | |
| ConstItemsView | Items () const |
| Returns a const view for key-value pair iteration. Usage: for (const auto& [aKey, aValue] : aMap.Items()) | |
| IndexedItemsView | IndexedItems () |
| Returns a view for key-value-index tuple iteration. Usage: for (auto [aKey, aValue, anIndex] : aMap.IndexedItems()) | |
| ConstIndexedItemsView | IndexedItems () const |
| Returns a const view for key-value-index tuple iteration. Usage: for (const auto& [aKey, aValue, anIndex] : aMap.IndexedItems()) | |
| NCollection_IndexedDataMap () | |
| Empty constructor. | |
| NCollection_IndexedDataMap (const size_t theNbBuckets, const occ::handle< NCollection_BaseAllocator > &theAllocator=nullptr) | |
| Constructor. | |
| NCollection_IndexedDataMap (const int theNbBuckets, const occ::handle< NCollection_BaseAllocator > &theAllocator=nullptr) | |
| Constructor (legacy int-taking). | |
| NCollection_IndexedDataMap (const Hasher &theHasher, const size_t theNbBuckets=1, const occ::handle< NCollection_BaseAllocator > &theAllocator=nullptr) | |
| Constructor with custom hasher (copy). | |
| NCollection_IndexedDataMap (const Hasher &theHasher, const int theNbBuckets, const occ::handle< NCollection_BaseAllocator > &theAllocator=nullptr) | |
| Constructor with custom hasher (copy, legacy int-taking). | |
| NCollection_IndexedDataMap (Hasher &&theHasher, const size_t theNbBuckets=1, const occ::handle< NCollection_BaseAllocator > &theAllocator=nullptr) | |
| Constructor with custom hasher (move). | |
| NCollection_IndexedDataMap (Hasher &&theHasher, const int theNbBuckets, const occ::handle< NCollection_BaseAllocator > &theAllocator=nullptr) | |
| Constructor with custom hasher (move, legacy int-taking). | |
| NCollection_IndexedDataMap (const NCollection_IndexedDataMap &theOther) | |
| Copy constructor. | |
| NCollection_IndexedDataMap (NCollection_IndexedDataMap &&theOther) noexcept | |
| Move constructor. | |
| void | Exchange (NCollection_IndexedDataMap &theOther) noexcept |
| Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well! | |
| const Hasher & | GetHasher () const noexcept |
| Returns const reference to the hasher. | |
| NCollection_IndexedDataMap & | Assign (const NCollection_IndexedDataMap &theOther) |
| Assignment. This method does not change the internal allocator. | |
| NCollection_IndexedDataMap & | operator= (const NCollection_IndexedDataMap &theOther) |
| Assignment operator. | |
| NCollection_IndexedDataMap & | operator= (NCollection_IndexedDataMap &&theOther) noexcept |
| Move operator. | |
| void | ReSize (const size_t N) |
| ReSize. | |
| void | ReSize (const int N) |
| int | Add (const TheKeyType &theKey1, const TheItemType &theItem) |
| Returns the Index of already bound Key or appends new Key with specified Item value. | |
| int | Add (TheKeyType &&theKey1, const TheItemType &theItem) |
| Returns the Index of already bound Key or appends new Key with specified Item value. | |
| int | Add (const TheKeyType &theKey1, TheItemType &&theItem) |
| Returns the Index of already bound Key or appends new Key with specified Item value. | |
| int | Add (TheKeyType &&theKey1, TheItemType &&theItem) |
| Returns the Index of already bound Key or appends new Key with specified Item value. | |
| TheItemType & | TryBound (const TheKeyType &theKey1, const TheItemType &theItem) |
| TryBound binds Item to Key only if Key is not yet bound. | |
| TheItemType & | TryBound (TheKeyType &&theKey1, const TheItemType &theItem) |
| TryBound binds Item to Key only if Key is not yet bound. | |
| TheItemType & | TryBound (const TheKeyType &theKey1, TheItemType &&theItem) |
| TryBound binds Item to Key only if Key is not yet bound. | |
| TheItemType & | TryBound (TheKeyType &&theKey1, TheItemType &&theItem) |
| TryBound binds Item to Key only if Key is not yet bound. | |
| bool | TryBind (const TheKeyType &theKey1, const TheItemType &theItem) |
| TryBind binds Item to Key only if Key is not yet bound. | |
| bool | TryBind (TheKeyType &&theKey1, const TheItemType &theItem) |
| TryBind binds Item to Key only if Key is not yet bound. | |
| bool | TryBind (const TheKeyType &theKey1, TheItemType &&theItem) |
| TryBind binds Item to Key only if Key is not yet bound. | |
| bool | TryBind (TheKeyType &&theKey1, TheItemType &&theItem) |
| TryBind binds Item to Key only if Key is not yet bound. | |
| bool | Bind (const TheKeyType &theKey1, const TheItemType &theItem) |
| Bind binds Item to Key in map; overwrites value if Key already exists. | |
| bool | Bind (TheKeyType &&theKey1, const TheItemType &theItem) |
| Bind binds Item to Key in map; overwrites value if Key already exists. | |
| bool | Bind (const TheKeyType &theKey1, TheItemType &&theItem) |
| Bind binds Item to Key in map; overwrites value if Key already exists. | |
| bool | Bind (TheKeyType &&theKey1, TheItemType &&theItem) |
| Bind binds Item to Key in map; overwrites value if Key already exists. | |
| TheItemType * | Bound (const TheKeyType &theKey1, const TheItemType &theItem) |
| Bound binds Item to Key in map; overwrites value if Key already exists. | |
| TheItemType * | Bound (TheKeyType &&theKey1, const TheItemType &theItem) |
| Bound binds Item to Key in map; overwrites value if Key already exists. | |
| TheItemType * | Bound (const TheKeyType &theKey1, TheItemType &&theItem) |
| Bound binds Item to Key in map; overwrites value if Key already exists. | |
| TheItemType * | Bound (TheKeyType &&theKey1, TheItemType &&theItem) |
| Bound binds Item to Key in map; overwrites value if Key already exists. | |
| template<typename K , typename... Args> | |
| int | Emplace (K &&theKey1, Args &&... theArgs) |
| Emplace constructs value in-place; if key exists, overwrites value. | |
| template<typename K , typename... Args> | |
| TheItemType & | Emplaced (K &&theKey1, Args &&... theArgs) |
| Emplaced constructs value in-place; if key exists, destroys and reconstructs value. | |
| template<typename K , typename... Args> | |
| int | TryEmplace (K &&theKey1, Args &&... theArgs) |
| TryEmplace constructs value in-place only if key not already bound. | |
| template<typename K , typename... Args> | |
| TheItemType & | TryEmplaced (K &&theKey1, Args &&... theArgs) |
| TryEmplaced constructs value in-place only if key not already bound. | |
| bool | Contains (const TheKeyType &theKey1) const |
| Contains. | |
| std::optional< std::pair< std::reference_wrapper< const TheKeyType >, std::reference_wrapper< const TheItemType > > > | Contained (const TheKeyType &theKey1) const |
| Contained returns optional pair of const references to key and value. Returns std::nullopt if the key is not found. | |
| std::optional< std::pair< std::reference_wrapper< const TheKeyType >, std::reference_wrapper< TheItemType > > > | Contained (const TheKeyType &theKey1) |
| Contained returns optional pair of const key reference and mutable value reference. Returns std::nullopt if the key is not found. | |
| void | Substitute (const size_t theIndex, const TheKeyType &theKey1, const TheItemType &theItem) |
| Substitute. | |
| void | Substitute (const int theIndex, const TheKeyType &theKey1, const TheItemType &theItem) |
| void | Swap (const size_t theIndex1, const size_t theIndex2) |
| Swaps two elements with the given indices. | |
| void | Swap (const int theIndex1, const int theIndex2) |
| void | RemoveLast () |
| RemoveLast. | |
| void | RemoveFromIndex (const size_t theIndex) |
| Remove the key of the given index. Caution! The index of the last key can be changed. | |
| void | RemoveFromIndex (const int theIndex) |
| void | RemoveKey (const TheKeyType &theKey1) |
| Remove the given key. Caution! The index of the last key can be changed. | |
| const TheKeyType & | FindKey (const size_t theIndex) const |
| FindKey. | |
| const TheKeyType & | FindKey (const int theIndex) const |
| const TheItemType & | FindFromIndex (const size_t theIndex) const |
| FindFromIndex. | |
| const TheItemType & | FindFromIndex (const int theIndex) const |
| const TheItemType & | operator() (const size_t theIndex) const |
| operator () | |
| const TheItemType & | operator() (const int theIndex) const |
| TheItemType & | ChangeFromIndex (const size_t theIndex) |
| ChangeFromIndex. | |
| TheItemType & | ChangeFromIndex (const int theIndex) |
| TheItemType & | operator() (const size_t theIndex) |
| operator () | |
| TheItemType & | operator() (const int theIndex) |
| int | FindIndex (const TheKeyType &theKey1) const |
| FindIndex. | |
| const TheItemType & | FindFromKey (const TheKeyType &theKey1) const |
| FindFromKey. | |
| TheItemType & | ChangeFromKey (const TheKeyType &theKey1) |
| ChangeFromKey. | |
| const TheItemType * | Seek (const TheKeyType &theKey1) const |
| Seek returns pointer to Item by Key. Returns NULL if Key was not found. | |
| TheItemType * | ChangeSeek (const TheKeyType &theKey1) |
| ChangeSeek returns modifiable pointer to Item by Key. Returns NULL if Key was not found. | |
| bool | FindFromKey (const TheKeyType &theKey1, TheItemType &theValue) const |
| Find value for key with copying. | |
| void | Clear (const bool doReleaseMemory=false) |
| Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused. | |
| void | Clear (const occ::handle< NCollection_BaseAllocator > &theAllocator) |
| Clear data and reset allocator. | |
| ~NCollection_IndexedDataMap () override | |
| Destructor. | |
Public Member Functions inherited from NCollection_BaseMap | |
| size_t | NbBuckets () const noexcept |
| NbBuckets. | |
| int | Extent () const noexcept |
| Extent (number of elements, legacy int-returning API). | |
| int | Length () const noexcept |
| Length - number of elements (legacy int-returning API, synonym of Extent()). | |
| size_t | Size () const noexcept |
| Size - number of elements. | |
| bool | IsEmpty () const noexcept |
| IsEmpty. | |
| const occ::handle< NCollection_BaseAllocator > & | Allocator () const noexcept |
| Returns attached allocator. | |
Protected Member Functions | |
| bool | lookup (const TheKeyType &theKey, IndexedDataMapNode *&theNode, size_t &theHash) const |
| Lookup for particular key in map. | |
| bool | lookup (const TheKeyType &theKey, IndexedDataMapNode *&theNode) const |
| Lookup for particular key in map. | |
| bool | IsEqual (const TheKeyType &theKey1, const TheKeyType &theKey2) const |
| size_t | HashCode (const TheKeyType &theKey, const size_t theUpperBound) const |
| template<typename K , typename V > | |
| int | addImpl (K &&theKey1, V &&theItem) |
| Implementation helper for Add (returns index). | |
| template<typename K , bool IsTry, bool ReturnRef, typename... Args> | |
| auto | emplaceImpl (K &&theKey1, std::bool_constant< IsTry >, std::bool_constant< ReturnRef >, Args &&... theArgs) -> std::conditional_t< ReturnRef, TheItemType &, int > |
| Implementation helper for Emplace/TryEmplace operations. | |
| template<typename K , typename V , bool IsTry, bool ReturnRef> | |
| auto | bindImpl (K &&theKey1, V &&theItem, std::bool_constant< IsTry >, std::bool_constant< ReturnRef >) -> std::conditional_t< ReturnRef, TheItemType &, bool > |
| Implementation helper for Bind/TryBind/Bound/TryBound operations. | |
Protected Member Functions inherited from NCollection_BaseMap | |
| NCollection_BaseMap (const size_t theNbBuckets, const bool single, const occ::handle< NCollection_BaseAllocator > &theAllocator) | |
| Constructor. | |
| NCollection_BaseMap (NCollection_BaseMap &&theOther) noexcept | |
| Move Constructor. | |
| virtual | ~NCollection_BaseMap ()=default |
| Destructor. | |
| bool | BeginResize (const size_t theExtent, size_t &theNewBuckets, NCollection_ListNode **&data1, NCollection_ListNode **&data2) const |
| BeginResize. | |
| void | EndResize (const size_t theExtent, const size_t theNewBuckets, NCollection_ListNode **data1, NCollection_ListNode **data2) noexcept |
| EndResize. | |
| bool | Resizable () const noexcept |
| Resizable. | |
| size_t | Increment () noexcept |
| Increment. | |
| size_t | Decrement () noexcept |
| Decrement. | |
| void | Destroy (NCollection_DelMapNode fDel, bool doReleaseMemory=true) |
| Destroy. | |
| size_t | NextPrimeForMap (const size_t N) const noexcept |
| NextPrimeForMap. | |
| void | exchangeMapsData (NCollection_BaseMap &theOther) noexcept |
| Exchange content of two maps without data copying. | |
| NCollection_BaseMap & | operator= (NCollection_BaseMap &&) noexcept=delete |
| Move operator. | |
| NCollection_BaseMap (const NCollection_BaseMap &)=delete | |
| Copy Constructor. | |
| NCollection_BaseMap & | operator= (const NCollection_BaseMap &)=delete |
| Assign operator. | |
Protected Attributes | |
| Hasher | myHasher |
Protected Attributes inherited from NCollection_BaseMap | |
| occ::handle< NCollection_BaseAllocator > | myAllocator |
| NCollection_ListNode ** | myData1 |
| NCollection_ListNode ** | myData2 |
Additional Inherited Members | |
Static Protected Member Functions inherited from NCollection_BaseMap | |
| static size_t | NbBucketsFromInt (const int theNbBuckets) |
| Converts legacy int bucket count to size_t with validation. | |
Purpose: An indexed map is used to store keys and to bind an index to them. Each new key stored in the map gets an index. Index are incremented as keys are stored in the map. A key can be found by the index and an index by the key. No key but the last can be removed so the indices are in the range 1.. Extent. An Item is stored with each key.
This class is similar to IndexedMap from NCollection with the Item as a new feature. Note the important difference on the operator (). In the IndexedMap this operator returns the Key. In the IndexedDataMap this operator returns the Item.
See the class Map from NCollection for a discussion about the number of buckets.
| typedef NCollection_StlIterator<std::forward_iterator_tag, Iterator, TheItemType, true> NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::const_iterator |
Shorthand for a constant iterator type.
| using NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::ConstIndexedItemsView |
View class for key-value-index tuple iteration (const).
| using NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::ConstItemsView |
View class for key-value pair iteration (const).
| using NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::ConstKeyValueIndexRef |
Const key-value-index tuple reference for structured binding support.
| using NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::ConstKeyValueRef = NCollection_ItemsView::KeyValueRef<TheKeyType, TheItemType, true> |
Const key-value pair reference for structured binding support.
| typedef Hasher NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::hasher |
| using NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::IndexedItemsView |
View class for key-value-index tuple iteration (mutable).
| using NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::ItemsView |
View class for key-value pair iteration (mutable).
| typedef NCollection_StlIterator<std::forward_iterator_tag, Iterator, TheItemType, false> NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::iterator |
Shorthand for a regular iterator type.
| typedef TheKeyType NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::key_type |
STL-compliant typedef for key type.
| using NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::KeyValueIndexRef = NCollection_ItemsView::KeyValueIndexRef<TheKeyType, TheItemType, false> |
Key-value-index tuple reference for structured binding support. Enables: for (auto [key, value, index] : map.IndexedItems())
| using NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::KeyValueRef = NCollection_ItemsView::KeyValueRef<TheKeyType, TheItemType, false> |
Key-value pair reference for structured binding support. Enables: for (auto [key, value] : map.Items())
| typedef TheItemType NCollection_IndexedDataMap< TheKeyType, TheItemType, Hasher >::value_type |
STL-compliant typedef for value type.
|
inline |
Empty constructor.
|
inlineexplicit |
Constructor.
|
inlineexplicit |
Constructor (legacy int-taking).
|
inlineexplicit |
Constructor with custom hasher (copy).
| theHasher | custom hasher instance |
| theNbBuckets | initial number of buckets |
| theAllocator | custom memory allocator |
|
inlineexplicit |
Constructor with custom hasher (copy, legacy int-taking).
|
inlineexplicit |
Constructor with custom hasher (move).
| theHasher | custom hasher instance (moved) |
| theNbBuckets | initial number of buckets |
| theAllocator | custom memory allocator |
|
inlineexplicit |
Constructor with custom hasher (move, legacy int-taking).
|
inline |
Copy constructor.
|
inlinenoexcept |
Move constructor.
|
inlineoverride |
Destructor.
|
inline |
Returns the Index of already bound Key or appends new Key with specified Item value.
| theKey1 | Key to search (and to bind, if it was not bound already) |
| theItem | Item value to set for newly bound Key; ignored if Key was already bound |
|
inline |
Returns the Index of already bound Key or appends new Key with specified Item value.
| theKey1 | Key to search (and to bind, if it was not bound already) |
| theItem | Item value to set for newly bound Key; ignored if Key was already bound |
|
inline |
Returns the Index of already bound Key or appends new Key with specified Item value.
| theKey1 | Key to search (and to bind, if it was not bound already) |
| theItem | Item value to set for newly bound Key; ignored if Key was already bound |
|
inline |
Returns the Index of already bound Key or appends new Key with specified Item value.
| theKey1 | Key to search (and to bind, if it was not bound already) |
| theItem | Item value to set for newly bound Key; ignored if Key was already bound |
|
inlineprotected |
Implementation helper for Add (returns index).
| K | forwarding reference type for key |
| V | forwarding reference type for value |
| theKey1 | key to add |
| theItem | item to bind |
|
inline |
Assignment. This method does not change the internal allocator.
|
inlinenoexcept |
Returns an iterator pointing to the first element in the map.
|
inline |
Bind binds Item to Key in map; overwrites value if Key already exists.
| theKey1 | key to add/update |
| theItem | new item; overrides value previously bound to the key |
|
inline |
Bind binds Item to Key in map; overwrites value if Key already exists.
|
inline |
Bind binds Item to Key in map; overwrites value if Key already exists.
|
inline |
Bind binds Item to Key in map; overwrites value if Key already exists.
|
inlineprotected |
Implementation helper for Bind/TryBind/Bound/TryBound operations.
| K | forwarding reference type for key |
| V | forwarding reference type for value |
| IsTry | if true, does not modify existing; if false, overwrites |
| ReturnRef | if true, returns reference; if false, returns bool |
|
inline |
Bound binds Item to Key in map; overwrites value if Key already exists.
| theKey1 | key to add/update |
| theItem | new item; overrides value previously bound to the key |
|
inline |
Bound binds Item to Key in map; overwrites value if Key already exists.
|
inline |
Bound binds Item to Key in map; overwrites value if Key already exists.
|
inline |
Bound binds Item to Key in map; overwrites value if Key already exists.
|
inlinenoexcept |
Returns a const iterator pointing to the first element in the map.
|
inlinenoexcept |
Returns a const iterator referring to the past-the-end element in the map.
|
inline |
|
inline |
ChangeFromIndex.
|
inline |
ChangeFromKey.
|
inline |
ChangeSeek returns modifiable pointer to Item by Key. Returns NULL if Key was not found.
|
inline |
Clear data. If doReleaseMemory is false then the table of buckets is not released and will be reused.
|
inline |
Clear data and reset allocator.
|
inline |
Contained returns optional pair of const key reference and mutable value reference. Returns std::nullopt if the key is not found.
|
inline |
Contained returns optional pair of const references to key and value. Returns std::nullopt if the key is not found.
|
inline |
Contains.
|
inline |
Emplace constructs value in-place; if key exists, overwrites value.
| theKey1 | key to add/update |
| theArgs | arguments forwarded to value constructor |
|
inline |
Emplaced constructs value in-place; if key exists, destroys and reconstructs value.
| theKey1 | key to add/update |
| theArgs | arguments forwarded to value constructor |
|
inlineprotected |
Implementation helper for Emplace/TryEmplace operations.
| K | forwarding reference type for key |
| IsTry | if true, does not modify existing; if false, overwrites |
| ReturnRef | if true, returns reference; if false, returns int (index) |
| theKey1 | key to add/update |
| theArgs | arguments forwarded to value constructor |
|
inlinenoexcept |
Returns an iterator referring to the past-the-end element in the map.
|
inlinenoexcept |
Exchange the content of two maps without re-allocations. Notice that allocators will be swapped as well!
|
inline |
|
inline |
FindFromIndex.
|
inline |
FindFromKey.
|
inline |
Find value for key with copying.
|
inline |
FindIndex.
|
inline |
|
inline |
FindKey.
|
inlinenoexcept |
Returns const reference to the hasher.
|
inlineprotected |
|
inline |
Returns a view for key-value-index tuple iteration. Usage: for (auto [aKey, aValue, anIndex] : aMap.IndexedItems())
|
inline |
Returns a const view for key-value-index tuple iteration. Usage: for (const auto& [aKey, aValue, anIndex] : aMap.IndexedItems())
|
inlineprotected |
|
inline |
Returns a view for key-value pair iteration. Usage: for (auto [aKey, aValue] : aMap.Items())
|
inline |
Returns a const view for key-value pair iteration. Usage: for (const auto& [aKey, aValue] : aMap.Items())
|
inlineprotected |
Lookup for particular key in map.
| [in] | theKey | key to compute hash |
| [out] | theNode | the detected node with equal key. Can be null. |
|
inlineprotected |
Lookup for particular key in map.
| [in] | theKey | key to compute hash |
| [out] | theNode | the detected node with equal key. Can be null. |
| [out] | theHash | computed bounded hash code for current key. |
|
inline |
|
inline |
|
inline |
operator ()
|
inline |
operator ()
|
inline |
Assignment operator.
|
inlinenoexcept |
Move operator.
|
inline |
|
inline |
Remove the key of the given index. Caution! The index of the last key can be changed.
|
inline |
Remove the given key. Caution! The index of the last key can be changed.
|
inline |
RemoveLast.
|
inline |
|
inline |
ReSize.
|
inline |
Seek returns pointer to Item by Key. Returns NULL if Key was not found.
|
inline |
|
inline |
Substitute.
|
inline |
|
inline |
Swaps two elements with the given indices.
|
inline |
TryBind binds Item to Key only if Key is not yet bound.
| theKey1 | key to add |
| theItem | item to bind if Key is not yet bound |
|
inline |
TryBind binds Item to Key only if Key is not yet bound.
|
inline |
TryBind binds Item to Key only if Key is not yet bound.
|
inline |
TryBind binds Item to Key only if Key is not yet bound.
|
inline |
TryBound binds Item to Key only if Key is not yet bound.
| theKey1 | key to add |
| theItem | item to bind if Key is not yet bound |
|
inline |
TryBound binds Item to Key only if Key is not yet bound.
|
inline |
TryBound binds Item to Key only if Key is not yet bound.
|
inline |
TryBound binds Item to Key only if Key is not yet bound.
|
inline |
TryEmplace constructs value in-place only if key not already bound.
| theKey1 | key to add |
| theArgs | arguments forwarded to value constructor |
|
inline |
TryEmplaced constructs value in-place only if key not already bound.
| theKey1 | key to add |
| theArgs | arguments forwarded to value constructor |
|
protected |