Inheritance diagram for mrmeshpy.EdgeBitSet:Public Member Functions | |
| EdgeBitSet | __and__ (self, EdgeBitSet b) |
| bool | __getitem__ (self, EdgeId pos) |
| EdgeBitSet | __iand__ (self, EdgeBitSet b) |
| None | __init__ (self) |
| None | __init__ (self, int numBits, bool fillValue) |
| None | __init__ (self, BitSet src) |
| None | __init__ (self, BitSet src) |
| None | __init__ (self, EdgeBitSet arg0) |
| EdgeBitSet | __ior__ (self, EdgeBitSet b) |
| EdgeBitSet | __isub__ (self, EdgeBitSet b) |
| typing.Iterator[EdgeId] | __iter__ (self) |
| EdgeBitSet | __ixor__ (self, EdgeBitSet b) |
| EdgeBitSet | __or__ (self, EdgeBitSet b) |
| str | __repr__ (self) |
| EdgeBitSet | __sub__ (self, EdgeBitSet b) |
| EdgeBitSet | __xor__ (self, EdgeBitSet b) |
| None | autoResizeSet (self, EdgeId pos, int len, bool val=True) |
| None | autoResizeSet (self, EdgeId pos, bool val=True) |
| bool | autoResizeTestSet (self, EdgeId pos, bool val=True) |
| EdgeId | backId (self) |
| EdgeId | endId (self) |
| EdgeId | find_first (self) |
| EdgeId | find_last (self) |
| EdgeId | find_next (self, EdgeId pos) |
| EdgeBitSet | flip (self, EdgeId n, int len) |
| EdgeBitSet | flip (self, EdgeId n) |
| EdgeBitSet | flip (self) |
| EdgeBitSet | getMapping (self, EdgeMap map) |
| EdgeBitSet | getMapping (self, EdgeBMap map) |
| EdgeBitSet | getMapping (self, phmap_flat_hash_map_Id_EdgeTag_Id_EdgeTag map) |
| EdgeBitSet | getMapping (self, EdgeMap map, int resSize) |
| EdgeBitSet | getMapping (self, phmap_flat_hash_map_Id_EdgeTag_Id_EdgeTag map, int resSize) |
| bool | intersects (self, EdgeBitSet a) |
| bool | is_subset_of (self, EdgeBitSet a) |
| EdgeId | nthSetBit (self, int n) |
| EdgeBitSet | reset (self, EdgeId n, int len) |
| EdgeBitSet | reset (self, EdgeId n) |
| EdgeBitSet | reset (self) |
| EdgeBitSet | set (self, EdgeId n, int len, bool val) |
| EdgeBitSet | set (self, EdgeId n, bool val) |
| EdgeBitSet | set (self, EdgeId n) |
| EdgeBitSet | set (self) |
| EdgeBitSet | subtract (self, EdgeBitSet b, int bShiftInBlocks) |
| bool | test (self, EdgeId n) |
| bool | test_set (self, EdgeId n, bool val=True) |
Public Member Functions inherited from mrmeshpy.BitSet | |
| bool | __eq__ (self, BitSet b) |
| None | clear (self) |
| int | count (self) |
| int | heapBytes (self) |
| None | pop_back (self) |
| None | push_back (self, bool bit) |
| None | resize (self, int num_bits, bool value=False) |
| None | resizeWithReserve (self, int newSize) |
| int | size (self) |
Static Public Member Functions | |
| None | __init__ (*args, **kwargs) |
| EdgeId | beginId () |
| EdgeBitSet | operator (*args, **kwargs) |
| EdgeBitSet | operator (*args, **kwargs) |
Generated from: MR::EdgeBitSet Vector<bool, I> like container (random-access, I - index type, bool - value type) with all bits after size() considered off during testing
|
static |
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.EdgeBitSet.__init__ | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.EdgeBitSet.__init__ | ( | self, | |
| int | numBits, | ||
| bool | fillValue ) |
creates bitset of given size filled with given value
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.EdgeBitSet.__init__ | ( | self, | |
| BitSet | src ) |
copies all bits from another BitSet (or a descending class, e.g. TypedBitSet<U>)
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.EdgeBitSet.__init__ | ( | self, | |
| BitSet | src ) |
moves all bits from another BitSet (or a descending class, e.g. TypedBitSet<U>)
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.EdgeBitSet.__init__ | ( | self, | |
| EdgeBitSet | arg0 ) |
Implicit copy constructor.
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.__and__ | ( | self, | |
| EdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| bool mrmeshpy.EdgeBitSet.__getitem__ | ( | self, | |
| EdgeId | pos ) |
| EdgeBitSet mrmeshpy.EdgeBitSet.__iand__ | ( | self, | |
| EdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.__ior__ | ( | self, | |
| EdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.__isub__ | ( | self, | |
| EdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| typing.Iterator[EdgeId] mrmeshpy.EdgeBitSet.__iter__ | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.__ixor__ | ( | self, | |
| EdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.__or__ | ( | self, | |
| EdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| str mrmeshpy.EdgeBitSet.__repr__ | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.__sub__ | ( | self, | |
| EdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.__xor__ | ( | self, | |
| EdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.EdgeBitSet.autoResizeSet | ( | self, | |
| EdgeId | pos, | ||
| bool | len = True ) |
sets elements [pos, pos+len) to given value, adjusting the size of the set to include new elements
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.EdgeBitSet.autoResizeSet | ( | self, | |
| EdgeId | pos, | ||
| int | len, | ||
| bool | val = True ) |
sets elements [pos, pos+len) to given value, adjusting the size of the set to include new elements
Reimplemented from mrmeshpy.BitSet.
| bool mrmeshpy.EdgeBitSet.autoResizeTestSet | ( | self, | |
| EdgeId | pos, | ||
| bool | val = True ) |
same as \\ref autoResizeSet and returns previous value of pos-bit
Reimplemented from mrmeshpy.BitSet.
| EdgeId mrmeshpy.EdgeBitSet.backId | ( | self | ) |
returns the identifier of the back() element
Reimplemented from mrmeshpy.BitSet.
|
static |
[beginId(), endId()) is the range of all bits in the set
Reimplemented from mrmeshpy.BitSet.
| EdgeId mrmeshpy.EdgeBitSet.endId | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeId mrmeshpy.EdgeBitSet.find_first | ( | self | ) |
| EdgeId mrmeshpy.EdgeBitSet.find_last | ( | self | ) |
return the highest index i such as bit i is set, or npos if *this has no on bits.
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.flip | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.flip | ( | self, | |
| EdgeId | n ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.flip | ( | self, | |
| EdgeId | n, | ||
| int | len ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.getMapping | ( | self, | |
| EdgeBMap | map ) |
| EdgeBitSet mrmeshpy.EdgeBitSet.getMapping | ( | self, | |
| EdgeMap | map ) |
| EdgeBitSet mrmeshpy.EdgeBitSet.getMapping | ( | self, | |
| EdgeMap | map, | ||
| int | resSize ) |
| EdgeBitSet mrmeshpy.EdgeBitSet.getMapping | ( | self, | |
| phmap_flat_hash_map_Id_EdgeTag_Id_EdgeTag | map ) |
| EdgeBitSet mrmeshpy.EdgeBitSet.getMapping | ( | self, | |
| phmap_flat_hash_map_Id_EdgeTag_Id_EdgeTag | map, | ||
| int | resSize ) |
| bool mrmeshpy.EdgeBitSet.intersects | ( | self, | |
| EdgeBitSet | a ) |
returns true if, there is a bit which is set in this bitset, such that the corresponding bit in bitset a is also set. Otherwise this function returns false.
| bool mrmeshpy.EdgeBitSet.is_subset_of | ( | self, | |
| EdgeBitSet | a ) |
returns true if, for every bit that is set in this bitset, the corresponding bit in bitset a is also set. Otherwise this function returns false.
Reimplemented from mrmeshpy.BitSet.
| EdgeId mrmeshpy.EdgeBitSet.nthSetBit | ( | self, | |
| int | n ) |
returns the location of nth set bit (where the first bit corresponds to n=0) or IndexType(npos) if there are less bit set
Reimplemented from mrmeshpy.BitSet.
|
static |
Reimplemented from mrmeshpy.BitSet.
|
static |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.reset | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.reset | ( | self, | |
| EdgeId | n ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.reset | ( | self, | |
| EdgeId | n, | ||
| int | len ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.set | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.set | ( | self, | |
| EdgeId | n ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.set | ( | self, | |
| EdgeId | n, | ||
| bool | val ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.set | ( | self, | |
| EdgeId | n, | ||
| int | len, | ||
| bool | val ) |
Reimplemented from mrmeshpy.BitSet.
| EdgeBitSet mrmeshpy.EdgeBitSet.subtract | ( | self, | |
| EdgeBitSet | b, | ||
| int | bShiftInBlocks ) |
subtracts b from this, considering that bits in b are shifted right on bShiftInBlocks*bits_per_block
Reimplemented from mrmeshpy.BitSet.
| bool mrmeshpy.EdgeBitSet.test | ( | self, | |
| EdgeId | n ) |
all bits after size() we silently consider as not-set
Reimplemented from mrmeshpy.BitSet.
| bool mrmeshpy.EdgeBitSet.test_set | ( | self, | |
| EdgeId | n, | ||
| bool | val = True ) |
Reimplemented from mrmeshpy.BitSet.