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

Public Member Functions

GraphEdgeBitSet __and__ (self, ConstGraphEdgeBitSet b)
 __init__ (self, *args, **kwargs)
typing.Iterator[GraphEdgeId] __iter__ (self)
GraphEdgeBitSet __or__ (self, ConstGraphEdgeBitSet b)
str __repr__ (self)
GraphEdgeBitSet __sub__ (self, ConstGraphEdgeBitSet b)
GraphEdgeBitSet __xor__ (self, ConstGraphEdgeBitSet b)
GraphEdgeId backId (self)
GraphEdgeId endId (self)
GraphEdgeId find_first (self)
GraphEdgeId find_first_not_set (self)
GraphEdgeId find_last (self)
GraphEdgeId find_last_not_set (self)
GraphEdgeId find_next (self, ConstGraphEdgeId pos)
GraphEdgeId find_next_not_set (self, ConstGraphEdgeId pos)
GraphEdgeBitSet getMapping (self, ConstVector_GraphEdgeId_GraphEdgeId map)
GraphEdgeBitSet getMapping (self, ConstBMap_GraphEdgeId_GraphEdgeId map)
GraphEdgeBitSet getMapping (self, Const_phmap_flat_hash_map_Id_GraphEdgeTag_Id_GraphEdgeTag_phmap_Hash_Id_GraphEdgeTag_phmap_EqualTo_Id_GraphEdgeTag_Allocator_std_pair_Id_GraphEdgeTag_const_Id_GraphEdgeTag map)
GraphEdgeBitSet getMapping (self, ConstVector_GraphEdgeId_GraphEdgeId map, int resSize)
GraphEdgeBitSet getMapping (self, Const_phmap_flat_hash_map_Id_GraphEdgeTag_Id_GraphEdgeTag_phmap_Hash_Id_GraphEdgeTag_phmap_EqualTo_Id_GraphEdgeTag_Allocator_std_pair_Id_GraphEdgeTag_const_Id_GraphEdgeTag map, int resSize)
bool intersects (self, ConstGraphEdgeBitSet a)
bool is_subset_of (self, ConstGraphEdgeBitSet a)
GraphEdgeId nthSetBit (self, int n)
bool test (self, ConstGraphEdgeId 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

GraphEdgeId 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::GraphEdgeBitSet
Aliases:  Graph.EdgeBitSet

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.ConstGraphEdgeBitSet.__init__ ( self,
* args,
** kwargs )
__init__(*args, **kwargs)
Overloaded function.

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

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

creates bitset of given size filled with given value

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

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

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

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

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

Implicit copy constructor.

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

Member Function Documentation

◆ __and__()

GraphEdgeBitSet mrmeshpy.ConstGraphEdgeBitSet.__and__ ( self,
ConstGraphEdgeBitSet b )

◆ __iter__()

typing.Iterator[GraphEdgeId] mrmeshpy.ConstGraphEdgeBitSet.__iter__ ( self)

◆ __or__()

GraphEdgeBitSet mrmeshpy.ConstGraphEdgeBitSet.__or__ ( self,
ConstGraphEdgeBitSet b )

◆ __repr__()

str mrmeshpy.ConstGraphEdgeBitSet.__repr__ ( self)

◆ __sub__()

GraphEdgeBitSet mrmeshpy.ConstGraphEdgeBitSet.__sub__ ( self,
ConstGraphEdgeBitSet b )

◆ __xor__()

GraphEdgeBitSet mrmeshpy.ConstGraphEdgeBitSet.__xor__ ( self,
ConstGraphEdgeBitSet b )

◆ backId()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.backId ( self)
returns the identifier of the back() element

Reimplemented from mrmeshpy.ConstBitSet.

◆ beginId()

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

Reimplemented from mrmeshpy.ConstBitSet.

◆ endId()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.endId ( self)

Reimplemented from mrmeshpy.ConstBitSet.

◆ find_first()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.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()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.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()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.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()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.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()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.find_next ( self,
ConstGraphEdgeId 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()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.find_next_not_set ( self,
ConstGraphEdgeId 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]

GraphEdgeBitSet mrmeshpy.ConstGraphEdgeBitSet.getMapping ( self,
ConstBMap_GraphEdgeId_GraphEdgeId map )

◆ getMapping() [4/5]

GraphEdgeBitSet mrmeshpy.ConstGraphEdgeBitSet.getMapping ( self,
ConstVector_GraphEdgeId_GraphEdgeId map )

◆ getMapping() [5/5]

GraphEdgeBitSet mrmeshpy.ConstGraphEdgeBitSet.getMapping ( self,
ConstVector_GraphEdgeId_GraphEdgeId map,
int resSize )

◆ intersects()

bool mrmeshpy.ConstGraphEdgeBitSet.intersects ( self,
ConstGraphEdgeBitSet 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.ConstGraphEdgeBitSet.is_subset_of ( self,
ConstGraphEdgeBitSet 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()

GraphEdgeId mrmeshpy.ConstGraphEdgeBitSet.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.ConstGraphEdgeBitSet.test ( self,
ConstGraphEdgeId 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: