Public Member Functions | |
None | __init__ (self) |
None | __init__ (self, std_variant_Vector_Id_EdgeTag_Id_UndirectedEdgeTag_phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag var) |
None | clear (self) |
phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag | getHashMap (self) |
phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag | getHashMap (self) |
WholeEdgeMap | getMap (self) |
WholeEdgeMap | getMap (self) |
None | pushBack (self, UndirectedEdgeId key, Id_EdgeTag val) |
None | resizeReserve (self, int denseTotalSize, int hashAdditionalCapacity) |
None | setHashMap (self, phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag m) |
None | setMap (self, WholeEdgeMap m) |
std_variant_Vector_Id_EdgeTag_Id_UndirectedEdgeTag_phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag | var (self) |
None | var (self, std_variant_Vector_Id_EdgeTag_Id_UndirectedEdgeTag_phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag arg1) |
Static Public Member Functions | |
None | __init__ (*args, **kwargs) |
MapOrHashMap_UndirectedEdgeId_Id_EdgeTag | createHashMap (int capacity=0) |
MapOrHashMap_UndirectedEdgeId_Id_EdgeTag | createMap (int size=0) |
MapOrHashMap_UndirectedEdgeId_Id_EdgeTag | operator (*args, **kwargs) |
MapOrHashMap_UndirectedEdgeId_Id_EdgeTag | operator (*args, **kwargs) |
Static Public Attributes | |
Dense = WholeEdgeMap | |
Hash = phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag | |
Static Protected Attributes | |
typing | _offsetof_var = 0 |
Generated from: MR::MapOrHashMap<MR::UndirectedEdgeId, MR::Id<MR::EdgeTag>> Aliases: WholeEdgeMapOrHashMap 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
|
static |
None mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.__init__ | ( | self | ) |
None mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.__init__ | ( | self, | |
std_variant_Vector_Id_EdgeTag_Id_UndirectedEdgeTag_phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag | var ) |
Implicit aggregate constructor.
None mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.clear | ( | self | ) |
|
static |
|
static |
phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.getHashMap | ( | self | ) |
phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.getHashMap | ( | self | ) |
WholeEdgeMap mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.getMap | ( | self | ) |
WholeEdgeMap mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.getMap | ( | self | ) |
|
static |
|
static |
None mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.pushBack | ( | self, | |
UndirectedEdgeId | key, | ||
Id_EdgeTag | val ) |
appends one element in the map, in case of dense map, key must be equal to vector.endId()
None mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.resizeReserve | ( | self, | |
int | denseTotalSize, | ||
int | hashAdditionalCapacity ) |
if this stores dense map then resizes it to denseTotalSize; if this stores hash map then sets its capacity to size()+hashAdditionalCapacity
None mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.setHashMap | ( | self, | |
phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag | m ) |
None mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.setMap | ( | self, | |
WholeEdgeMap | m ) |
std_variant_Vector_Id_EdgeTag_Id_UndirectedEdgeTag_phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.var | ( | self | ) |
default construction will select dense map
None mrmeshpy.MapOrHashMap_UndirectedEdgeId_Id_EdgeTag.var | ( | self, | |
std_variant_Vector_Id_EdgeTag_Id_UndirectedEdgeTag_phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_EdgeTag | arg1 ) |
|
staticprotected |
|
static |
|
static |