mrmeshpy.VertBitSet Class Reference

Inheritance diagram for mrmeshpy.VertBitSet:

Public Member Functions
VertBitSet	__and__ (self, VertBitSet b)
bool	__eq__ (self, VertBitSet b)
VertBitSet	__iand__ (self, VertBitSet b)
None	__init__ (self)
None	__init__ (self, int numBits, bool fillValue=False)
None	__init__ (self, BitSet src)
None	__init__ (self, BitSet src)
None	__init__ (self, VertBitSet arg0)
VertBitSet	__ior__ (self, VertBitSet b)
VertBitSet	__isub__ (self, VertBitSet b)
typing.Iterator[VertId]	__iter__ (self)
VertBitSet	__ixor__ (self, VertBitSet b)
VertBitSet	__or__ (self, VertBitSet b)
str	__repr__ (self)
VertBitSet	__sub__ (self, VertBitSet b)
VertBitSet	__xor__ (self, VertBitSet b)
None	autoResizeSet (self, VertId pos, int len, bool val=True)
None	autoResizeSet (self, VertId pos, bool val=True)
bool	autoResizeTestSet (self, VertId pos, bool val=True)
VertId	backId (self)
VertId	endId (self)
VertId	find_first (self)
VertId	find_last (self)
VertId	find_next (self, VertId pos)
VertBitSet	flip (self, VertId n, int len)
VertBitSet	flip (self, VertId n)
VertBitSet	flip (self)
VertBitSet	getMapping (self, VertMap map)
VertBitSet	getMapping (self, VertBMap map)
VertBitSet	getMapping (self, phmap_flat_hash_map_Id_VertTag_Id_VertTag map)
VertBitSet	getMapping (self, VertMap map, int resSize)
VertBitSet	getMapping (self, phmap_flat_hash_map_Id_VertTag_Id_VertTag map, int resSize)
bool	intersects (self, VertBitSet a)
bool	is_subset_of (self, VertBitSet a)
VertId	nthSetBit (self, int n)
VertBitSet	reset (self, VertId n, int len)
VertBitSet	reset (self, VertId n)
VertBitSet	reset (self)
VertBitSet	set (self, VertId n, int len, bool val)
VertBitSet	set (self, VertId n, bool val)
VertBitSet	set (self, VertId n)
VertBitSet	set (self)
VertBitSet	subtract (self, VertBitSet b, int bShiftInBlocks)
bool	test (self, VertId n)
bool	test_set (self, VertId n, bool val=True)
Public Member Functions inherited from mrmeshpy.BitSet
typing.Any	__rlshift__ (self, typing.Any bs)
typing.Any	__rrshift__ (self, typing.Any bs)
bool	all (self)
bool	any (self)
std_vector_unsigned_long	bits (self)
int	capacity (self)
None	clear (self)
int	count (self)
bool	empty (self)
int	heapBytes (self)
bool	none (self)
int	num_blocks (self)
None	pop_back (self)
None	push_back (self, bool val)
None	reserve (self, int numBits)
None	resize (self, int numBits, bool fillValue=False)
None	resizeWithReserve (self, int newSize)
None	reverse (self)
None	shrink_to_fit (self)
int	size (self)
bool	uncheckedTest (self, int n)
bool	uncheckedTestSet (self, int n, bool val=True)

Static Public Member Functions
None	__init__ (*args, **kwargs)
VertId	beginId ()
VertBitSet	operator (*args, **kwargs)
VertBitSet	operator (*args, **kwargs)
Static Public Member Functions inherited from mrmeshpy.BitSet
BitSet	fromBlocks (std_vector_unsigned_long blocks)

Additional Inherited Members
Static Public Attributes inherited from mrmeshpy.BitSet
typing	bits_per_block = 64
typing	npos = 18446744073709551615

Detailed Description

Generated from:  MR::VertBitSet
Aliases:  Vector_VertBitSet_ObjId.reference, ColorMapAggregator_VertTag_ElementBitSet, Vector_VertBitSet_ObjId.value_type, Vector_VertBitSet_ObjId.const_reference

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__() [1/6]

None mrmeshpy.VertBitSet.__init__ ( * args, ** kwargs )

static

Reimplemented from mrmeshpy.BitSet.

__init__() [2/6]

None mrmeshpy.VertBitSet.__init__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__init__() [3/6]

None mrmeshpy.VertBitSet.__init__	(		self,
		int	numBits,
		bool	fillValue = False )

creates bitset of given size filled with given value

Reimplemented from mrmeshpy.BitSet.

__init__() [4/6]

None mrmeshpy.VertBitSet.__init__	(		self,
		BitSet	src )

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

Reimplemented from mrmeshpy.BitSet.

__init__() [5/6]

None mrmeshpy.VertBitSet.__init__	(		self,
		BitSet	src )

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

Reimplemented from mrmeshpy.BitSet.

__init__() [6/6]

None mrmeshpy.VertBitSet.__init__	(		self,
		VertBitSet	arg0 )

Implicit copy constructor.

Reimplemented from mrmeshpy.BitSet.

Member Function Documentation

__and__()

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

Reimplemented from mrmeshpy.BitSet.

__eq__()

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

__iand__()

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

Reimplemented from mrmeshpy.BitSet.

__ior__()

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

Reimplemented from mrmeshpy.BitSet.

__isub__()

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

Reimplemented from mrmeshpy.BitSet.

__iter__()

typing.Iterator[VertId] mrmeshpy.VertBitSet.__iter__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__ixor__()

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

Reimplemented from mrmeshpy.BitSet.

__or__()

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

Reimplemented from mrmeshpy.BitSet.

__repr__()

str mrmeshpy.VertBitSet.__repr__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__sub__()

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

Reimplemented from mrmeshpy.BitSet.

__xor__()

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

Reimplemented from mrmeshpy.BitSet.

autoResizeSet() [1/2]

None mrmeshpy.VertBitSet.autoResizeSet	(		self,
		VertId	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.VertBitSet.autoResizeSet	(		self,
		VertId	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.VertBitSet.autoResizeTestSet	(		self,
		VertId	pos,
		bool	val = True )

same as \\ref autoResizeSet and returns previous value of pos-bit

Reimplemented from mrmeshpy.BitSet.

backId()

VertId mrmeshpy.VertBitSet.backId

(

self

)

returns the identifier of the back() element

Reimplemented from mrmeshpy.BitSet.

beginId()

VertId mrmeshpy.VertBitSet.beginId ( )

static

[beginId(), endId()) is the range of all bits in the set

Reimplemented from mrmeshpy.BitSet.

endId()

VertId mrmeshpy.VertBitSet.endId

(

self

)

Reimplemented from mrmeshpy.BitSet.

find_first()

VertId mrmeshpy.VertBitSet.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.BitSet.

find_last()

VertId mrmeshpy.VertBitSet.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.BitSet.

find_next()

VertId mrmeshpy.VertBitSet.find_next	(		self,
		VertId	n )

return the smallest index i>n such that bit i is set, or npos if *this has no on bits.

Reimplemented from mrmeshpy.BitSet.

flip() [1/3]

VertBitSet mrmeshpy.VertBitSet.flip

(

self

)

Reimplemented from mrmeshpy.BitSet.

flip() [2/3]

VertBitSet mrmeshpy.VertBitSet.flip	(		self,
		VertId	n )

Reimplemented from mrmeshpy.BitSet.

flip() [3/3]

VertBitSet mrmeshpy.VertBitSet.flip	(		self,
		VertId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

getMapping() [1/5]

VertBitSet mrmeshpy.VertBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_VertTag_Id_VertTag	map )

getMapping() [2/5]

VertBitSet mrmeshpy.VertBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_VertTag_Id_VertTag	map,
		int	resSize )

getMapping() [3/5]

VertBitSet mrmeshpy.VertBitSet.getMapping	(		self,
		VertBMap	map )

getMapping() [4/5]

VertBitSet mrmeshpy.VertBitSet.getMapping	(		self,
		VertMap	map )

getMapping() [5/5]

VertBitSet mrmeshpy.VertBitSet.getMapping	(		self,
		VertMap	map,
		int	resSize )

intersects()

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

is_subset_of()

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

nthSetBit()

VertId mrmeshpy.VertBitSet.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() [1/2]

VertBitSet mrmeshpy.VertBitSet.operator ( * args, ** kwargs )

static

Reimplemented from mrmeshpy.BitSet.

operator() [2/2]

VertBitSet mrmeshpy.VertBitSet.operator ( * args, ** kwargs )

static

Reimplemented from mrmeshpy.BitSet.

reset() [1/3]

VertBitSet mrmeshpy.VertBitSet.reset

(

self

)

Reimplemented from mrmeshpy.BitSet.

reset() [2/3]

VertBitSet mrmeshpy.VertBitSet.reset	(		self,
		VertId	n )

Reimplemented from mrmeshpy.BitSet.

reset() [3/3]

VertBitSet mrmeshpy.VertBitSet.reset	(		self,
		VertId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

set() [1/4]

VertBitSet mrmeshpy.VertBitSet.set

(

self

)

Reimplemented from mrmeshpy.BitSet.

set() [2/4]

VertBitSet mrmeshpy.VertBitSet.set	(		self,
		VertId	n )

Reimplemented from mrmeshpy.BitSet.

set() [3/4]

VertBitSet mrmeshpy.VertBitSet.set	(		self,
		VertId	n,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

set() [4/4]

VertBitSet mrmeshpy.VertBitSet.set	(		self,
		VertId	n,
		int	len,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

subtract()

VertBitSet mrmeshpy.VertBitSet.subtract	(		self,
		VertBitSet	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.VertBitSet.test	(		self,
		VertId	n )

all bits after size() we silently consider as not-set

Reimplemented from mrmeshpy.BitSet.

test_set()

bool mrmeshpy.VertBitSet.test_set	(		self,
		VertId	n,
		bool	val = True )

Reimplemented from mrmeshpy.BitSet.

---

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

• mrmeshpy.pyi