Inheritance diagram for mrmeshpy.UndirectedEdgeBitSet:Static Public Member Functions | |
| None | __init__ (*args, **kwargs) |
| UndirectedEdgeId | beginId () |
| UndirectedEdgeBitSet | operator (*args, **kwargs) |
| UndirectedEdgeBitSet | operator (*args, **kwargs) |
Generated from: MR::UndirectedEdgeBitSet Aliases: ColorMapAggregator_UndirectedEdgeTag_ElementBitSet, AABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.LeafBitSet, AABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box3f.LeafBitSet 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.UndirectedEdgeBitSet.__init__ | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.UndirectedEdgeBitSet.__init__ | ( | self, | |
| int | numBits, | ||
| bool | fillValue ) |
creates bitset of given size filled with given value
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.UndirectedEdgeBitSet.__init__ | ( | self, | |
| BitSet | src ) |
copies all bits from another BitSet (or a descending class, e.g. TypedBitSet<U>)
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.UndirectedEdgeBitSet.__init__ | ( | self, | |
| BitSet | src ) |
moves all bits from another BitSet (or a descending class, e.g. TypedBitSet<U>)
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.UndirectedEdgeBitSet.__init__ | ( | self, | |
| UndirectedEdgeBitSet | arg0 ) |
Implicit copy constructor.
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.__and__ | ( | self, | |
| UndirectedEdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| bool mrmeshpy.UndirectedEdgeBitSet.__getitem__ | ( | self, | |
| UndirectedEdgeId | pos ) |
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.__iand__ | ( | self, | |
| UndirectedEdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.__ior__ | ( | self, | |
| UndirectedEdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.__isub__ | ( | self, | |
| UndirectedEdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| typing.Iterator[UndirectedEdgeId] mrmeshpy.UndirectedEdgeBitSet.__iter__ | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.__ixor__ | ( | self, | |
| UndirectedEdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.__or__ | ( | self, | |
| UndirectedEdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| str mrmeshpy.UndirectedEdgeBitSet.__repr__ | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.__sub__ | ( | self, | |
| UndirectedEdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.__xor__ | ( | self, | |
| UndirectedEdgeBitSet | b ) |
Reimplemented from mrmeshpy.BitSet.
| None mrmeshpy.UndirectedEdgeBitSet.autoResizeSet | ( | self, | |
| UndirectedEdgeId | 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.UndirectedEdgeBitSet.autoResizeSet | ( | self, | |
| UndirectedEdgeId | 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.UndirectedEdgeBitSet.autoResizeTestSet | ( | self, | |
| UndirectedEdgeId | pos, | ||
| bool | val = True ) |
same as \\ref autoResizeSet and returns previous value of pos-bit
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeId mrmeshpy.UndirectedEdgeBitSet.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.
| UndirectedEdgeId mrmeshpy.UndirectedEdgeBitSet.endId | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeId mrmeshpy.UndirectedEdgeBitSet.find_first | ( | self | ) |
| UndirectedEdgeId mrmeshpy.UndirectedEdgeBitSet.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.
| UndirectedEdgeId mrmeshpy.UndirectedEdgeBitSet.find_next | ( | self, | |
| UndirectedEdgeId | pos ) |
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.flip | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.flip | ( | self, | |
| UndirectedEdgeId | n ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.flip | ( | self, | |
| UndirectedEdgeId | n, | ||
| int | len ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.getMapping | ( | self, | |
| phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_UndirectedEdgeTag | map ) |
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.getMapping | ( | self, | |
| phmap_flat_hash_map_Id_UndirectedEdgeTag_Id_UndirectedEdgeTag | map, | ||
| int | resSize ) |
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.getMapping | ( | self, | |
| UndirectedEdgeBMap | map ) |
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.getMapping | ( | self, | |
| UndirectedEdgeMap | map ) |
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.getMapping | ( | self, | |
| UndirectedEdgeMap | map, | ||
| int | resSize ) |
| bool mrmeshpy.UndirectedEdgeBitSet.intersects | ( | self, | |
| UndirectedEdgeBitSet | 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.UndirectedEdgeBitSet.is_subset_of | ( | self, | |
| UndirectedEdgeBitSet | 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.
| UndirectedEdgeId mrmeshpy.UndirectedEdgeBitSet.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.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.reset | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.reset | ( | self, | |
| UndirectedEdgeId | n ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.reset | ( | self, | |
| UndirectedEdgeId | n, | ||
| int | len ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.set | ( | self | ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.set | ( | self, | |
| UndirectedEdgeId | n ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.set | ( | self, | |
| UndirectedEdgeId | n, | ||
| bool | val ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.set | ( | self, | |
| UndirectedEdgeId | n, | ||
| int | len, | ||
| bool | val ) |
Reimplemented from mrmeshpy.BitSet.
| UndirectedEdgeBitSet mrmeshpy.UndirectedEdgeBitSet.subtract | ( | self, | |
| UndirectedEdgeBitSet | 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.UndirectedEdgeBitSet.test | ( | self, | |
| UndirectedEdgeId | n ) |
all bits after size() we silently consider as not-set
Reimplemented from mrmeshpy.BitSet.
| bool mrmeshpy.UndirectedEdgeBitSet.test_set | ( | self, | |
| UndirectedEdgeId | n, | ||
| bool | val = True ) |
Reimplemented from mrmeshpy.BitSet.