MeshLib Python Docs
Loading...
Searching...
No Matches
Inheritance diagram for mrmeshpy.ConstBitSet:

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

Detailed Description

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

Constructor & Destructor Documentation

◆ __init__()

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

Member Function Documentation

◆ __and__()

BitSet mrmeshpy.ConstBitSet.__and__ ( self,
ConstBitSet b )

◆ __eq__()

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)

◆ __iter__()

typing.Iterator[int] mrmeshpy.ConstBitSet.__iter__ ( self)

◆ __ne__()

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)

◆ __or__()

BitSet mrmeshpy.ConstBitSet.__or__ ( self,
ConstBitSet b )

◆ __repr__()

str mrmeshpy.ConstBitSet.__repr__ ( self)

◆ __rlshift__()

typing.Any mrmeshpy.ConstBitSet.__rlshift__ ( self,
typing.Any bs )

◆ __sub__()

BitSet mrmeshpy.ConstBitSet.__sub__ ( self,
ConstBitSet b )

◆ __xor__()

BitSet mrmeshpy.ConstBitSet.__xor__ ( self,
ConstBitSet b )

◆ all()

bool mrmeshpy.ConstBitSet.all ( self)
returns true if all bits in this container are set

◆ any()

bool mrmeshpy.ConstBitSet.any ( self)
returns true if at least one bits in this container is set

◆ backId()

◆ beginId()

◆ bits()

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

◆ capacity()

int mrmeshpy.ConstBitSet.capacity ( self)

◆ count()

int mrmeshpy.ConstBitSet.count ( self)
computes the number of set bits in the whole set

◆ countBitsAndBlocks()

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

◆ empty()

bool mrmeshpy.ConstBitSet.empty ( self)

◆ endId()

◆ find_first()

◆ find_first_not_set()

◆ find_last()

◆ find_last_not_set()

◆ find_next()

◆ find_next_not_set()

◆ fromBlocks()

BitSet mrmeshpy.ConstBitSet.fromBlocks ( std_vector_unsigned_long_Allocator_unsigned_long blocks)
static
creates bitset from the given blocks of bits

◆ heapBytes()

int mrmeshpy.ConstBitSet.heapBytes ( self)
returns the amount of memory this object occupies on heap

◆ intersects()

◆ is_subset_of()

◆ none()

bool mrmeshpy.ConstBitSet.none ( self)
returns true if all bits in this container are reset

◆ nthSetBit()

◆ num_blocks()

int mrmeshpy.ConstBitSet.num_blocks ( self)

◆ size()

int mrmeshpy.ConstBitSet.size ( self)

◆ test()

◆ uncheckedTest()

bool mrmeshpy.ConstBitSet.uncheckedTest ( self,
int n )

Member Data Documentation

◆ bits_per_block

typing mrmeshpy.ConstBitSet.bits_per_block = 64
static

◆ Blocks

mrmeshpy.ConstBitSet.Blocks = std_vector_unsigned_long_Allocator_unsigned_long
static

◆ ConstBlocks

mrmeshpy.ConstBitSet.ConstBlocks = Const_std_vector_unsigned_long_Allocator_unsigned_long
static

◆ npos

typing mrmeshpy.ConstBitSet.npos = 18446744073709551615
static

The documentation for this class was generated from the following file: