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

Public Member Functions

NodeBitSet __and__ (self, NodeBitSet b)
 
NodeBitSet __iand__ (self, NodeBitSet b)
 
None __init__ (self, BitSet src)
 
None __init__ (self, BitSet src)
 
None __init__ (self)
 
None __init__ (self, NodeBitSet arg0)
 
NodeBitSet __ior__ (self, NodeBitSet b)
 
NodeBitSet __isub__ (self, NodeBitSet b)
 
typing.Iterator[NodeId__iter__ (self)
 
NodeBitSet __ixor__ (self, NodeBitSet b)
 
NodeBitSet __or__ (self, NodeBitSet b)
 
str __repr__ (self)
 
NodeBitSet __sub__ (self, NodeBitSet b)
 
NodeBitSet __xor__ (self, NodeBitSet b)
 
None autoResizeSet (self, NodeId pos, int len, bool val=True)
 
None autoResizeSet (self, NodeId pos, bool val=True)
 
bool autoResizeTestSet (self, NodeId pos, bool val=True)
 
NodeId backId (self)
 
NodeId endId (self)
 
NodeId find_first (self)
 
NodeId find_last (self)
 
NodeId find_next (self, NodeId pos)
 
NodeBitSet flip (self, NodeId n, int len)
 
NodeBitSet flip (self, NodeId n)
 
NodeBitSet flip (self)
 
NodeBitSet getMapping (self, Vector_NodeId_NodeId map)
 
NodeBitSet getMapping (self, BMap_NodeId_NodeId map)
 
NodeBitSet getMapping (self, phmap_flat_hash_map_Id_NodeTag_Id_NodeTag map)
 
NodeBitSet getMapping (self, Vector_NodeId_NodeId map, int resSize)
 
NodeBitSet getMapping (self, phmap_flat_hash_map_Id_NodeTag_Id_NodeTag map, int resSize)
 
bool intersects (self, NodeBitSet a)
 
bool is_proper_subset_of (self, NodeBitSet a)
 
bool is_subset_of (self, NodeBitSet a)
 
NodeId nthSetBit (self, int n)
 
bool operator (self, NodeId pos)
 
NodeBitSet reset (self, NodeId n, int len)
 
NodeBitSet reset (self, NodeId n)
 
NodeBitSet reset (self)
 
NodeBitSet set (self, NodeId n, int len, bool val)
 
NodeBitSet set (self, NodeId n, bool val=True)
 
NodeBitSet set (self)
 
NodeBitSet subtract (self, NodeBitSet b, int bShiftInBlocks)
 
bool test (self, NodeId n)
 
bool test_set (self, NodeId 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

NodeId beginId ()
 

Static Protected Member Functions

 _pybind11_conduit_v1_ (*args, **kwargs)
 

Detailed Description

Generated from:  MR::NodeBitSet
Aliases:  AABBTreePoints.NodeBitSet

container of bits representing specific indices (faces, verts or edges)

Constructor & Destructor Documentation

◆ __init__() [1/4]

None mrmeshpy.NodeBitSet.__init__ ( self,
BitSet src )
copies all bits from another BitSet (or a descending class, e.g. TaggedBitSet<U>)

Reimplemented from mrmeshpy.BitSet.

◆ __init__() [2/4]

None mrmeshpy.NodeBitSet.__init__ ( self,
BitSet src )
moves all bits from another BitSet (or a descending class, e.g. TaggedBitSet<U>)

Reimplemented from mrmeshpy.BitSet.

◆ __init__() [3/4]

None mrmeshpy.NodeBitSet.__init__ ( self)
Implicit default constructor.

Reimplemented from mrmeshpy.BitSet.

◆ __init__() [4/4]

None mrmeshpy.NodeBitSet.__init__ ( self,
NodeBitSet arg0 )
Implicit copy constructor.

Reimplemented from mrmeshpy.BitSet.

Member Function Documentation

◆ __and__()

NodeBitSet mrmeshpy.NodeBitSet.__and__ ( self,
NodeBitSet b )

Reimplemented from mrmeshpy.BitSet.

◆ __iand__()

NodeBitSet mrmeshpy.NodeBitSet.__iand__ ( self,
NodeBitSet b )

Reimplemented from mrmeshpy.BitSet.

◆ __ior__()

NodeBitSet mrmeshpy.NodeBitSet.__ior__ ( self,
NodeBitSet b )

Reimplemented from mrmeshpy.BitSet.

◆ __isub__()

NodeBitSet mrmeshpy.NodeBitSet.__isub__ ( self,
NodeBitSet b )

Reimplemented from mrmeshpy.BitSet.

◆ __iter__()

typing.Iterator[NodeId] mrmeshpy.NodeBitSet.__iter__ ( self)

Reimplemented from mrmeshpy.BitSet.

◆ __ixor__()

NodeBitSet mrmeshpy.NodeBitSet.__ixor__ ( self,
NodeBitSet b )

Reimplemented from mrmeshpy.BitSet.

◆ __or__()

NodeBitSet mrmeshpy.NodeBitSet.__or__ ( self,
NodeBitSet b )

Reimplemented from mrmeshpy.BitSet.

◆ __repr__()

str mrmeshpy.NodeBitSet.__repr__ ( self)

Reimplemented from mrmeshpy.BitSet.

◆ __sub__()

NodeBitSet mrmeshpy.NodeBitSet.__sub__ ( self,
NodeBitSet b )

Reimplemented from mrmeshpy.BitSet.

◆ __xor__()

NodeBitSet mrmeshpy.NodeBitSet.__xor__ ( self,
NodeBitSet b )

Reimplemented from mrmeshpy.BitSet.

◆ _pybind11_conduit_v1_()

mrmeshpy.NodeBitSet._pybind11_conduit_v1_ ( * args,
** kwargs )
staticprotected

Reimplemented from mrmeshpy.BitSet.

◆ autoResizeSet() [1/2]

None mrmeshpy.NodeBitSet.autoResizeSet ( self,
NodeId 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.

◆ autoResizeSet() [2/2]

None mrmeshpy.NodeBitSet.autoResizeSet ( self,
NodeId 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.

◆ autoResizeTestSet()

bool mrmeshpy.NodeBitSet.autoResizeTestSet ( self,
NodeId pos,
bool val = True )
same as \\ref autoResizeSet and returns previous value of pos-bit

Reimplemented from mrmeshpy.BitSet.

◆ backId()

NodeId mrmeshpy.NodeBitSet.backId ( self)
returns the identifier of the back() element

Reimplemented from mrmeshpy.BitSet.

◆ beginId()

NodeId mrmeshpy.NodeBitSet.beginId ( )
static
[beginId(), endId()) is the range of all bits in the set

Reimplemented from mrmeshpy.BitSet.

◆ endId()

NodeId mrmeshpy.NodeBitSet.endId ( self)

Reimplemented from mrmeshpy.BitSet.

◆ find_first()

NodeId mrmeshpy.NodeBitSet.find_first ( self)

◆ find_last()

NodeId mrmeshpy.NodeBitSet.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.

◆ find_next()

NodeId mrmeshpy.NodeBitSet.find_next ( self,
NodeId pos )

◆ flip() [1/3]

NodeBitSet mrmeshpy.NodeBitSet.flip ( self)

Reimplemented from mrmeshpy.BitSet.

◆ flip() [2/3]

NodeBitSet mrmeshpy.NodeBitSet.flip ( self,
NodeId n )

Reimplemented from mrmeshpy.BitSet.

◆ flip() [3/3]

NodeBitSet mrmeshpy.NodeBitSet.flip ( self,
NodeId n,
int len )

Reimplemented from mrmeshpy.BitSet.

◆ getMapping() [1/5]

NodeBitSet mrmeshpy.NodeBitSet.getMapping ( self,
BMap_NodeId_NodeId map )

◆ getMapping() [2/5]

NodeBitSet mrmeshpy.NodeBitSet.getMapping ( self,
phmap_flat_hash_map_Id_NodeTag_Id_NodeTag map )

◆ getMapping() [3/5]

NodeBitSet mrmeshpy.NodeBitSet.getMapping ( self,
phmap_flat_hash_map_Id_NodeTag_Id_NodeTag map,
int resSize )

◆ getMapping() [4/5]

NodeBitSet mrmeshpy.NodeBitSet.getMapping ( self,
Vector_NodeId_NodeId map )

◆ getMapping() [5/5]

NodeBitSet mrmeshpy.NodeBitSet.getMapping ( self,
Vector_NodeId_NodeId map,
int resSize )

◆ intersects()

bool mrmeshpy.NodeBitSet.intersects ( self,
NodeBitSet 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.

◆ is_proper_subset_of()

bool mrmeshpy.NodeBitSet.is_proper_subset_of ( self,
NodeBitSet a )
returns true if, for every bit that is set in this bitset, the corresponding bit in bitset a is also set and if this->count() < a.count(). Otherwise this function returns false.

◆ is_subset_of()

bool mrmeshpy.NodeBitSet.is_subset_of ( self,
NodeBitSet 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.

◆ nthSetBit()

NodeId mrmeshpy.NodeBitSet.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.

◆ operator()

bool mrmeshpy.NodeBitSet.operator ( self,
NodeId pos )

◆ reset() [1/3]

NodeBitSet mrmeshpy.NodeBitSet.reset ( self)

Reimplemented from mrmeshpy.BitSet.

◆ reset() [2/3]

NodeBitSet mrmeshpy.NodeBitSet.reset ( self,
NodeId n )

Reimplemented from mrmeshpy.BitSet.

◆ reset() [3/3]

NodeBitSet mrmeshpy.NodeBitSet.reset ( self,
NodeId n,
int len )

Reimplemented from mrmeshpy.BitSet.

◆ set() [1/3]

NodeBitSet mrmeshpy.NodeBitSet.set ( self)

Reimplemented from mrmeshpy.BitSet.

◆ set() [2/3]

NodeBitSet mrmeshpy.NodeBitSet.set ( self,
NodeId n,
bool val = True )

Reimplemented from mrmeshpy.BitSet.

◆ set() [3/3]

NodeBitSet mrmeshpy.NodeBitSet.set ( self,
NodeId n,
int len,
bool val )

Reimplemented from mrmeshpy.BitSet.

◆ subtract()

NodeBitSet mrmeshpy.NodeBitSet.subtract ( self,
NodeBitSet b,
int bShiftInBlocks )
subtracts b from this, considering that bits in b are shifted right on bShiftInBlocks*bits_per_block

Reimplemented from mrmeshpy.BitSet.

◆ test()

bool mrmeshpy.NodeBitSet.test ( self,
NodeId n )
all bits after size() we silently consider as not-set

Reimplemented from mrmeshpy.BitSet.

◆ test_set()

bool mrmeshpy.NodeBitSet.test_set ( self,
NodeId n,
bool val = True )

Reimplemented from mrmeshpy.BitSet.


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