stores a mapping from keys K to values V in one of two forms: 1) as dense map (vector) preferable when there are few missing keys in a range [0, endKey) 2) as hash map preferable when valid keys are a small subset of the range Generated from class MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>. This is the non-const half of the class.
More...
|
| unsafe | MapOrHashMap_MRUndirectedEdgeId_MREdgeId () |
| | Constructs an empty (default-constructed) instance.
|
| |
| unsafe | MapOrHashMap_MRUndirectedEdgeId_MREdgeId (MR.Std._ByValue_Variant_MRWholeEdgeMap_PhmapFlatHashMapMRUndirectedEdgeIdMREdgeId var) |
| | Constructs MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId> elementwise.
|
| |
| unsafe | MapOrHashMap_MRUndirectedEdgeId_MREdgeId (MR._ByValue_MapOrHashMap_MRUndirectedEdgeId_MREdgeId _other) |
| | Generated from constructor MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::MapOrHashMap.
|
| |
| | MapOrHashMap_MRUndirectedEdgeId_MREdgeId (Const_MapOrHashMap_MRUndirectedEdgeId_MREdgeId _other) |
| | Generated from constructor MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::MapOrHashMap.
|
| |
| | MapOrHashMap_MRUndirectedEdgeId_MREdgeId (MapOrHashMap_MRUndirectedEdgeId_MREdgeId _other) |
| | Generated from constructor MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::MapOrHashMap.
|
| |
| unsafe MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId | assign (MR._ByValue_MapOrHashMap_MRUndirectedEdgeId_MREdgeId _other) |
| | Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::operator=.
|
| |
| unsafe void | setMap (MR.Misc._Moved< MR.WholeEdgeMap > m) |
| | Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::setMap.
|
| |
| unsafe void | setHashMap (MR.Misc._Moved< MR.Phmap.FlatHashMap_MRUndirectedEdgeId_MREdgeId > m) |
| | Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::setHashMap.
|
| |
| unsafe void | resizeReserve (ulong denseTotalSize, ulong hashAdditionalCapacity) |
| | if this stores dense map then resizes it to denseTotalSize; if this stores hash map then sets its capacity to size()+hashAdditionalCapacity Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::resizeReserve.
|
| |
| unsafe void | pushBack (MR.UndirectedEdgeId key, MR.EdgeId val) |
| | appends one element in the map, in case of dense map, key must be equal to vector.endId() Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::pushBack.
|
| |
| unsafe new MR.? WholeEdgeMap | getMap () |
| | Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::getMap.
|
| |
| unsafe new MR.Phmap.? FlatHashMap_MRUndirectedEdgeId_MREdgeId | getHashMap () |
| | Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::getHashMap.
|
| |
| unsafe void | clear () |
| | Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::clear.
|
| |
|
| new unsafe MR.Std.Variant_MRWholeEdgeMap_PhmapFlatHashMapMRUndirectedEdgeIdMREdgeId | var [get, protected set] |
| |
stores a mapping from keys K to values V in one of two forms: 1) as dense map (vector) preferable when there are few missing keys in a range [0, endKey) 2) as hash map preferable when valid keys are a small subset of the range Generated from class MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>. This is the non-const half of the class.
◆ MapOrHashMap_MRUndirectedEdgeId_MREdgeId() [1/5]
| unsafe MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.MapOrHashMap_MRUndirectedEdgeId_MREdgeId |
( |
| ) |
|
|
inline |
Constructs an empty (default-constructed) instance.
◆ MapOrHashMap_MRUndirectedEdgeId_MREdgeId() [2/5]
| unsafe MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.MapOrHashMap_MRUndirectedEdgeId_MREdgeId |
( |
MR.Std._ByValue_Variant_MRWholeEdgeMap_PhmapFlatHashMapMRUndirectedEdgeIdMREdgeId | var | ) |
|
|
inline |
◆ MapOrHashMap_MRUndirectedEdgeId_MREdgeId() [3/5]
| unsafe MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.MapOrHashMap_MRUndirectedEdgeId_MREdgeId |
( |
MR._ByValue_MapOrHashMap_MRUndirectedEdgeId_MREdgeId | _other | ) |
|
|
inline |
◆ MapOrHashMap_MRUndirectedEdgeId_MREdgeId() [4/5]
| MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.MapOrHashMap_MRUndirectedEdgeId_MREdgeId |
( |
Const_MapOrHashMap_MRUndirectedEdgeId_MREdgeId | _other | ) |
|
|
inline |
◆ MapOrHashMap_MRUndirectedEdgeId_MREdgeId() [5/5]
◆ assign()
◆ clear()
| unsafe void MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.clear |
( |
| ) |
|
|
inline |
◆ getHashMap()
| unsafe new MR.Phmap.? FlatHashMap_MRUndirectedEdgeId_MREdgeId MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.getHashMap |
( |
| ) |
|
|
inline |
◆ getMap()
| unsafe new MR.? WholeEdgeMap MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.getMap |
( |
| ) |
|
|
inline |
◆ pushBack()
appends one element in the map, in case of dense map, key must be equal to vector.endId() Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::pushBack.
◆ resizeReserve()
| unsafe void MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.resizeReserve |
( |
ulong | denseTotalSize, |
|
|
ulong | hashAdditionalCapacity ) |
|
inline |
if this stores dense map then resizes it to denseTotalSize; if this stores hash map then sets its capacity to size()+hashAdditionalCapacity Generated from method MR.MapOrHashMap<MR.UndirectedEdgeId, MR.EdgeId>::resizeReserve.
◆ setHashMap()
| unsafe void MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.setHashMap |
( |
MR.Misc._Moved< MR.Phmap.FlatHashMap_MRUndirectedEdgeId_MREdgeId > | m | ) |
|
|
inline |
◆ setMap()
| unsafe void MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.setMap |
( |
MR.Misc._Moved< MR.WholeEdgeMap > | m | ) |
|
|
inline |
◆ var
| new unsafe MR.Std.Variant_MRWholeEdgeMap_PhmapFlatHashMapMRUndirectedEdgeIdMREdgeId MR.MapOrHashMap_MRUndirectedEdgeId_MREdgeId.var |
|
getprotected set |
The documentation for this class was generated from the following file: