|
| GraphEdgeBitSet | __and__ (self, ConstGraphEdgeBitSet b) |
| | __init__ (self, *args, **kwargs) |
| typing.Iterator[GraphEdgeId] | __iter__ (self) |
| GraphEdgeBitSet | __or__ (self, ConstGraphEdgeBitSet b) |
| str | __repr__ (self) |
| GraphEdgeBitSet | __sub__ (self, ConstGraphEdgeBitSet b) |
| GraphEdgeBitSet | __xor__ (self, ConstGraphEdgeBitSet b) |
| GraphEdgeId | backId (self) |
| GraphEdgeId | endId (self) |
| GraphEdgeId | find_first (self) |
| GraphEdgeId | find_first_not_set (self) |
| GraphEdgeId | find_last (self) |
| GraphEdgeId | find_last_not_set (self) |
| GraphEdgeId | find_next (self, ConstGraphEdgeId pos) |
| GraphEdgeId | find_next_not_set (self, ConstGraphEdgeId pos) |
| GraphEdgeBitSet | getMapping (self, ConstVector_GraphEdgeId_GraphEdgeId map) |
| GraphEdgeBitSet | getMapping (self, ConstBMap_GraphEdgeId_GraphEdgeId map) |
| GraphEdgeBitSet | getMapping (self, Const_phmap_flat_hash_map_Id_GraphEdgeTag_Id_GraphEdgeTag_phmap_Hash_Id_GraphEdgeTag_phmap_EqualTo_Id_GraphEdgeTag_Allocator_std_pair_Id_GraphEdgeTag_const_Id_GraphEdgeTag map) |
| GraphEdgeBitSet | getMapping (self, ConstVector_GraphEdgeId_GraphEdgeId map, int resSize) |
| GraphEdgeBitSet | getMapping (self, Const_phmap_flat_hash_map_Id_GraphEdgeTag_Id_GraphEdgeTag_phmap_Hash_Id_GraphEdgeTag_phmap_EqualTo_Id_GraphEdgeTag_Allocator_std_pair_Id_GraphEdgeTag_const_Id_GraphEdgeTag map, int resSize) |
| bool | intersects (self, ConstGraphEdgeBitSet a) |
| bool | is_subset_of (self, ConstGraphEdgeBitSet a) |
| GraphEdgeId | nthSetBit (self, int n) |
| bool | test (self, ConstGraphEdgeId n) |
| BitSet | __and__ (self, ConstBitSet b) |
| bool | __eq__ (self, ConstBitSet b) |
| | __init__ (self, *args, **kwargs) |
| typing.Iterator[int] | __iter__ (self) |
| bool | __ne__ (self, ConstBitSet b) |
| BitSet | __or__ (self, ConstBitSet b) |
| str | __repr__ (self) |
| typing.Any | __rlshift__ (self, typing.Any bs) |
| BitSet | __sub__ (self, ConstBitSet b) |
| BitSet | __xor__ (self, ConstBitSet b) |
| bool | all (self) |
| bool | any (self) |
| Const_std_vector_unsigned_long_Allocator_unsigned_long | bits (self) |
| int | capacity (self) |
| int | count (self) |
| BitSet.Counts | countBitsAndBlocks (self, int maxBits='~MR::BitSet::size_type{}') |
| bool | empty (self) |
| int | heapBytes (self) |
| bool | none (self) |
| int | num_blocks (self) |
| int | size (self) |
| bool | uncheckedTest (self, int n) |
Generated from: MR::GraphEdgeBitSet
Aliases: Graph.EdgeBitSet
Vector<bool, I> like container (random-access, I - index type, bool - value type)
with all bits after size() considered off during testing
| mrmeshpy.ConstGraphEdgeBitSet.__init__ |
( |
| self, |
|
|
* | args, |
|
|
** | kwargs ) |
__init__(*args, **kwargs)
Overloaded function.
1. __init__(self: meshlib.mrmeshpy.ConstGraphEdgeBitSet) -> None
2. __init__(self: meshlib.mrmeshpy.ConstGraphEdgeBitSet, numBits: int, fillValue: bool = False) -> None
creates bitset of given size filled with given value
3. __init__(self: meshlib.mrmeshpy.ConstGraphEdgeBitSet, src: meshlib.mrmeshpy.ConstBitSet) -> None
copies all bits from another BitSet (or a descending class, e.g. `TypedBitSet<U>`)
4. __init__(self: meshlib.mrmeshpy.ConstGraphEdgeBitSet, src: meshlib.mrmeshpy.BitSet) -> None
moves all bits from another BitSet (or a descending class, e.g. `TypedBitSet<U>`)
5. __init__(self: meshlib.mrmeshpy.ConstGraphEdgeBitSet, arg0: meshlib.mrmeshpy.ConstGraphEdgeBitSet) -> None
Implicit copy constructor.
6. __init__(self: meshlib.mrmeshpy.ConstGraphEdgeBitSet, : meshlib.mrmeshpy.ConstGraphEdgeBitSet) -> None