MeshLib Python Docs
Loading...
Searching...
No Matches
mrmeshpy.BitSet Class Reference
+ Inheritance diagram for mrmeshpy.BitSet:

Public Member Functions

BitSet __and__ (self, BitSet b)
 
bool __eq__ (self, BitSet b)
 
BitSet __iand__ (self, BitSet b)
 
None __init__ (self, int numBits, bool fillValue)
 
None __init__ (self)
 
None __init__ (self, BitSet arg0)
 
BitSet __ior__ (self, BitSet b)
 
BitSet __isub__ (self, BitSet b)
 
typing.Iterator[int] __iter__ (self)
 
BitSet __ixor__ (self, BitSet b)
 
BitSet __or__ (self, BitSet b)
 
str __repr__ (self)
 
BitSet __sub__ (self, BitSet b)
 
BitSet __xor__ (self, BitSet b)
 
None autoResizeSet (self, int pos, int len, bool val=True)
 
None autoResizeSet (self, int pos, bool val=True)
 
bool autoResizeTestSet (self, int pos, bool val=True)
 
int backId (self)
 
None clear (self)
 
int count (self)
 
int endId (self)
 
int find_last (self)
 
BitSet flip (self, int n, int len)
 
BitSet flip (self, int n)
 
BitSet flip (self)
 
int heapBytes (self)
 
int nthSetBit (self, int n)
 
None pop_back (self)
 
None push_back (self, bool bit)
 
BitSet reset (self, int n, int len)
 
BitSet reset (self, int n)
 
BitSet reset (self)
 
None resize (self, int num_bits, bool value=False)
 
None resizeWithReserve (self, int newSize)
 
BitSet set (self, int n, int len, bool val)
 
BitSet set (self, int n, bool val=True)
 
BitSet set (self)
 
int size (self)
 
BitSet subtract (self, BitSet b, int bShiftInBlocks)
 
bool test (self, int n)
 
bool test_set (self, int n, bool val=True)
 

Static Public Member Functions

int beginId ()
 

Static Protected Member Functions

 _pybind11_conduit_v1_ (*args, **kwargs)
 

Detailed Description

Generated from:  MR::BitSet

container of bits

Constructor & Destructor Documentation

◆ __init__() [1/3]

None mrmeshpy.BitSet.__init__ ( self,
int numBits,
bool fillValue )

◆ __init__() [2/3]

◆ __init__() [3/3]

Member Function Documentation

◆ __and__()

◆ __eq__()

bool mrmeshpy.BitSet.__eq__ ( self,
BitSet 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)

Reimplemented in mrmeshpy.FaceBitSet, and mrmeshpy.VertBitSet.

◆ __iand__()

◆ __ior__()

◆ __isub__()

◆ __iter__()

◆ __ixor__()

◆ __or__()

◆ __repr__()

◆ __sub__()

◆ __xor__()

◆ _pybind11_conduit_v1_()

◆ autoResizeSet() [1/2]

◆ autoResizeSet() [2/2]

◆ autoResizeTestSet()

◆ backId()

◆ beginId()

◆ clear()

None mrmeshpy.BitSet.clear ( self)

◆ count()

int mrmeshpy.BitSet.count ( self)

◆ endId()

◆ find_last()

◆ flip() [1/3]

◆ flip() [2/3]

◆ flip() [3/3]

◆ heapBytes()

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

◆ nthSetBit()

◆ pop_back()

None mrmeshpy.BitSet.pop_back ( self)

◆ push_back()

None mrmeshpy.BitSet.push_back ( self,
bool bit )

◆ reset() [1/3]

◆ reset() [2/3]

◆ reset() [3/3]

◆ resize()

None mrmeshpy.BitSet.resize ( self,
int num_bits,
bool value = False )

◆ resizeWithReserve()

None mrmeshpy.BitSet.resizeWithReserve ( self,
int newSize )
doubles reserved memory until resize(newSize) can be done without reallocation

◆ set() [1/3]

◆ set() [2/3]

◆ set() [3/3]

◆ size()

int mrmeshpy.BitSet.size ( self)

◆ subtract()

◆ test()

◆ test_set()


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