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

Public Member Functions

VertBitSet __and__ (self, ConstVertBitSet b)
bool __eq__ (self, ConstVertBitSet b)
 __init__ (self, *args, **kwargs)
typing.Iterator[VertId] __iter__ (self)
bool __ne__ (self, ConstVertBitSet b)
VertBitSet __or__ (self, ConstVertBitSet b)
str __repr__ (self)
VertBitSet __sub__ (self, ConstVertBitSet b)
VertBitSet __xor__ (self, ConstVertBitSet b)
VertId backId (self)
VertId endId (self)
VertId find_first (self)
VertId find_first_not_set (self)
VertId find_last (self)
VertId find_last_not_set (self)
VertId find_next (self, ConstVertId pos)
VertId find_next_not_set (self, ConstVertId pos)
VertBitSet getMapping (self, ConstVertMap map)
VertBitSet getMapping (self, ConstVertBMap map)
VertBitSet getMapping (self, Const_phmap_flat_hash_map_Id_VertTag_Id_VertTag_phmap_Hash_Id_VertTag_phmap_EqualTo_Id_VertTag_Allocator_std_pair_Id_VertTag_const_Id_VertTag map)
VertBitSet getMapping (self, ConstVertMap map, int resSize)
VertBitSet getMapping (self, Const_phmap_flat_hash_map_Id_VertTag_Id_VertTag_phmap_Hash_Id_VertTag_phmap_EqualTo_Id_VertTag_Allocator_std_pair_Id_VertTag_const_Id_VertTag map, int resSize)
bool intersects (self, ConstVertBitSet a)
bool is_subset_of (self, ConstVertBitSet a)
VertId nthSetBit (self, int n)
bool test (self, ConstVertId n)
Public Member Functions inherited from mrmeshpy.ConstBitSet
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)
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 heapBytes (self)
bool none (self)
int num_blocks (self)
int size (self)
bool uncheckedTest (self, int n)

Static Public Member Functions

VertId beginId ()
Static Public Member Functions inherited from mrmeshpy.ConstBitSet
BitSet fromBlocks (std_vector_unsigned_long_Allocator_unsigned_long blocks)

Additional Inherited Members

Static Public Attributes inherited from mrmeshpy.ConstBitSet
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::VertBitSet
Aliases:  ColorMapAggregator_VertTag_ElementBitSet, Vector_VertBitSet_ObjId.const_pointer, Vector_VertBitSet_ObjId.const_reference, Vector_VertBitSet_ObjId.pointer, Vector_VertBitSet_ObjId.reference, Vector_VertBitSet_ObjId.value_type

Vector<bool, I> like container (random-access, I - index type, bool - value type)
with all bits after size() considered off during testing

Constructor & Destructor Documentation

◆ __init__()

mrmeshpy.ConstVertBitSet.__init__ ( self,
* args,
** kwargs )
__init__(*args, **kwargs)
Overloaded function.

1. __init__(self: meshlib.mrmeshpy.ConstVertBitSet) -> None

2. __init__(self: meshlib.mrmeshpy.ConstVertBitSet, numBits: int, fillValue: bool = False) -> None

creates bitset of given size filled with given value

3. __init__(self: meshlib.mrmeshpy.ConstVertBitSet, src: meshlib.mrmeshpy.ConstBitSet) -> None

copies all bits from another BitSet (or a descending class, e.g. `TypedBitSet<U>`)

4. __init__(self: meshlib.mrmeshpy.ConstVertBitSet, src: meshlib.mrmeshpy.BitSet) -> None

moves all bits from another BitSet (or a descending class, e.g. `TypedBitSet<U>`)

5. __init__(self: meshlib.mrmeshpy.ConstVertBitSet, arg0: meshlib.mrmeshpy.ConstVertBitSet) -> None

Implicit copy constructor.

6. __init__(self: meshlib.mrmeshpy.ConstVertBitSet, : meshlib.mrmeshpy.ConstVertBitSet) -> None

Member Function Documentation

◆ __and__()

VertBitSet mrmeshpy.ConstVertBitSet.__and__ ( self,
ConstVertBitSet b )

◆ __eq__()

bool mrmeshpy.ConstVertBitSet.__eq__ ( self,
ConstVertBitSet b )

◆ __iter__()

typing.Iterator[VertId] mrmeshpy.ConstVertBitSet.__iter__ ( self)

◆ __ne__()

bool mrmeshpy.ConstVertBitSet.__ne__ ( self,
ConstVertBitSet b )

◆ __or__()

VertBitSet mrmeshpy.ConstVertBitSet.__or__ ( self,
ConstVertBitSet b )

◆ __repr__()

str mrmeshpy.ConstVertBitSet.__repr__ ( self)

◆ __sub__()

VertBitSet mrmeshpy.ConstVertBitSet.__sub__ ( self,
ConstVertBitSet b )

◆ __xor__()

VertBitSet mrmeshpy.ConstVertBitSet.__xor__ ( self,
ConstVertBitSet b )

◆ backId()

VertId mrmeshpy.ConstVertBitSet.backId ( self)
returns the identifier of the back() element

Reimplemented from mrmeshpy.ConstBitSet.

◆ beginId()

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

Reimplemented from mrmeshpy.ConstBitSet.

◆ endId()

VertId mrmeshpy.ConstVertBitSet.endId ( self)

Reimplemented from mrmeshpy.ConstBitSet.

◆ find_first()

VertId mrmeshpy.ConstVertBitSet.find_first ( self)
return the smallest index i such that bit i is set, or npos if *this has no on bits.

Reimplemented from mrmeshpy.ConstBitSet.

◆ find_first_not_set()

VertId mrmeshpy.ConstVertBitSet.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 from mrmeshpy.ConstBitSet.

◆ find_last()

VertId mrmeshpy.ConstVertBitSet.find_last ( self)
return the highest index i such that bit i is set, or npos if *this has no on bits.

Reimplemented from mrmeshpy.ConstBitSet.

◆ find_last_not_set()

VertId mrmeshpy.ConstVertBitSet.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 from mrmeshpy.ConstBitSet.

◆ find_next()

VertId mrmeshpy.ConstVertBitSet.find_next ( self,
ConstVertId n )
return the smallest index i>n such that bit i is set, or npos if *this has no on bits.

Reimplemented from mrmeshpy.ConstBitSet.

◆ find_next_not_set()

VertId mrmeshpy.ConstVertBitSet.find_next_not_set ( self,
ConstVertId n )
return the smallest index i>n such that bit i is NOT set, or npos if *this has no off bits.

Reimplemented from mrmeshpy.ConstBitSet.

◆ getMapping() [1/5]

◆ getMapping() [2/5]

◆ getMapping() [3/5]

VertBitSet mrmeshpy.ConstVertBitSet.getMapping ( self,
ConstVertBMap map )

◆ getMapping() [4/5]

VertBitSet mrmeshpy.ConstVertBitSet.getMapping ( self,
ConstVertMap map )

◆ getMapping() [5/5]

VertBitSet mrmeshpy.ConstVertBitSet.getMapping ( self,
ConstVertMap map,
int resSize )

◆ intersects()

bool mrmeshpy.ConstVertBitSet.intersects ( self,
ConstVertBitSet 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 from mrmeshpy.ConstBitSet.

◆ is_subset_of()

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

◆ nthSetBit()

VertId mrmeshpy.ConstVertBitSet.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.ConstBitSet.

◆ test()

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

Reimplemented from mrmeshpy.ConstBitSet.


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