Classes | |
| class | ConstCounts |
| class | Counts |
Public Member Functions | |
| 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) |
| int | backId (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 | endId (self) |
| int | find_first (self) |
| int | find_first_not_set (self) |
| int | find_last (self) |
| int | find_last_not_set (self) |
| int | find_next (self, int n) |
| int | find_next_not_set (self, int n) |
| int | heapBytes (self) |
| bool | intersects (self, ConstBitSet a) |
| bool | is_subset_of (self, ConstBitSet a) |
| bool | none (self) |
| int | nthSetBit (self, int n) |
| int | num_blocks (self) |
| int | size (self) |
| bool | test (self, int n) |
| bool | uncheckedTest (self, int n) |
Static Public Member Functions | |
| int | beginId () |
| BitSet | fromBlocks (std_vector_unsigned_long_Allocator_unsigned_long blocks) |
Static Public Attributes | |
| typing | bits_per_block = 64 |
| typing | npos = 18446744073709551615 |
| Blocks = std_vector_unsigned_long_Allocator_unsigned_long | |
| ConstBlocks = Const_std_vector_unsigned_long_Allocator_unsigned_long | |
Generated from: MR::BitSet Aliases: TypedBitSet_FaceId_base, TypedBitSet_GraphEdgeId_base, TypedBitSet_GraphVertId_base, TypedBitSet_Id_EdgeTag_base, TypedBitSet_Id_ICPElemtTag.base, TypedBitSet_Id_SurfaceDistanceStartTag.base, TypedBitSet_Id_VoxelTag_base, TypedBitSet_NodeId_base, TypedBitSet_ObjId_base, TypedBitSet_PixelId_base, TypedBitSet_RegionId_base, TypedBitSet_TextureId_base, TypedBitSet_UndirectedEdgeId_base, TypedBitSet_VertId_base std::vector<bool> like container (random-access, size_t - index type, bool - value type) with all bits after size() considered off during testing
| mrmeshpy.ConstBitSet.__init__ | ( | self, | |
| * | args, | ||
| ** | kwargs ) |
__init__(*args, **kwargs) Overloaded function. 1. __init__(self: meshlib.mrmeshpy.ConstBitSet) -> None creates empty bitset 2. __init__(self: meshlib.mrmeshpy.ConstBitSet, numBits: int, fillValue: bool = False) -> None creates bitset of given size filled with given value 3. __init__(self: meshlib.mrmeshpy.ConstBitSet, arg0: meshlib.mrmeshpy.ConstBitSet) -> None Implicit copy constructor. 4. __init__(self: meshlib.mrmeshpy.ConstBitSet, : meshlib.mrmeshpy.ConstBitSet) -> None
| BitSet mrmeshpy.ConstBitSet.__and__ | ( | self, | |
| ConstBitSet | b ) |
| bool mrmeshpy.ConstBitSet.__eq__ | ( | self, | |
| ConstBitSet | b ) |
compare that two bit sets have the same set bits (they can be equal even if sizes are distinct but last bits are off)
| typing.Iterator[int] mrmeshpy.ConstBitSet.__iter__ | ( | self | ) |
| bool mrmeshpy.ConstBitSet.__ne__ | ( | self, | |
| ConstBitSet | b ) |
compare that two bit sets have the same set bits (they can be equal even if sizes are distinct but last bits are off)
| BitSet mrmeshpy.ConstBitSet.__or__ | ( | self, | |
| ConstBitSet | b ) |
| str mrmeshpy.ConstBitSet.__repr__ | ( | self | ) |
| typing.Any mrmeshpy.ConstBitSet.__rlshift__ | ( | self, | |
| typing.Any | bs ) |
| BitSet mrmeshpy.ConstBitSet.__sub__ | ( | self, | |
| ConstBitSet | b ) |
| BitSet mrmeshpy.ConstBitSet.__xor__ | ( | self, | |
| ConstBitSet | b ) |
| bool mrmeshpy.ConstBitSet.all | ( | self | ) |
returns true if all bits in this container are set
| bool mrmeshpy.ConstBitSet.any | ( | self | ) |
returns true if at least one bits in this container is set
| int mrmeshpy.ConstBitSet.backId | ( | self | ) |
returns the identifier of the back() element
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
|
static |
[beginId(), endId()) is the range of all bits in the set
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| Const_std_vector_unsigned_long_Allocator_unsigned_long mrmeshpy.ConstBitSet.bits | ( | self | ) |
read-only access to all bits stored as a vector of uint64 blocks
| int mrmeshpy.ConstBitSet.capacity | ( | self | ) |
| int mrmeshpy.ConstBitSet.count | ( | self | ) |
computes the number of set bits in the whole set
| BitSet.Counts mrmeshpy.ConstBitSet.countBitsAndBlocks | ( | self, | |
| int | maxBits = '~MR::BitSet::size_type{}' ) |
computes the numbers of set bits and of non-empty blocks, stopping as soon as the set bits exceed maxBits; both numbers are then partial, which makes a size test of a large set cheap
| bool mrmeshpy.ConstBitSet.empty | ( | self | ) |
| int mrmeshpy.ConstBitSet.endId | ( | self | ) |
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| int mrmeshpy.ConstBitSet.find_first | ( | self | ) |
return the smallest index i such that bit i is set, or npos if *this has no on bits.
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| int mrmeshpy.ConstBitSet.find_first_not_set | ( | self | ) |
return the smallest index i such that bit i is NOT set, or npos if *this has no off bits.
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| int mrmeshpy.ConstBitSet.find_last | ( | self | ) |
return the highest index i such that bit i is set, or npos if *this has no on bits.
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| int mrmeshpy.ConstBitSet.find_last_not_set | ( | self | ) |
return the highest index i such that bit i is NOT set, or npos if *this has no off bits.
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| int mrmeshpy.ConstBitSet.find_next | ( | self, | |
| int | n ) |
return the smallest index i>n such that bit i is set, or npos if *this has no on bits.
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| int mrmeshpy.ConstBitSet.find_next_not_set | ( | self, | |
| int | n ) |
return the smallest index i>n such that bit i is NOT set, or npos if *this has no off bits.
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
|
static |
creates bitset from the given blocks of bits
| int mrmeshpy.ConstBitSet.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
| bool mrmeshpy.ConstBitSet.intersects | ( | self, | |
| ConstBitSet | 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.
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| bool mrmeshpy.ConstBitSet.is_subset_of | ( | self, | |
| ConstBitSet | 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 in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| bool mrmeshpy.ConstBitSet.none | ( | self | ) |
returns true if all bits in this container are reset
| int mrmeshpy.ConstBitSet.nthSetBit | ( | self, | |
| int | n ) |
returns the location of nth set bit (where the first bit corresponds to n=0) or npos if there are less bit set
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| int mrmeshpy.ConstBitSet.num_blocks | ( | self | ) |
| int mrmeshpy.ConstBitSet.size | ( | self | ) |
| bool mrmeshpy.ConstBitSet.test | ( | self, | |
| int | n ) |
all bits after size() we silently consider as not-set
Reimplemented in mrmeshpy.AABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstAABBTreePoints.ConstNodeBitSet, mrmeshpy.ConstEdgeBitSet, mrmeshpy.ConstFaceBitSet, mrmeshpy.ConstGraphEdgeBitSet, mrmeshpy.ConstGraphVertBitSet, mrmeshpy.ConstNodeBitSet, mrmeshpy.ConstObjBitSet, mrmeshpy.ConstPixelBitSet, mrmeshpy.ConstRegionBitSet, mrmeshpy.ConstTextureBitSet, mrmeshpy.ConstTypedBitSet_Id_ICPElemtTag, mrmeshpy.ConstTypedBitSet_Id_SurfaceDistanceStartTag, mrmeshpy.ConstUndirectedEdgeBitSet, mrmeshpy.ConstVertBitSet, and mrmeshpy.ConstVoxelBitSet.
| bool mrmeshpy.ConstBitSet.uncheckedTest | ( | self, | |
| int | n ) |
|
static |
|
static |
|
static |
|
static |