mrmeshpy.GraphVertBitSet Class Reference

Inheritance diagram for mrmeshpy.GraphVertBitSet:

Public Member Functions
GraphVertBitSet	__and__ (self, GraphVertBitSet b)
GraphVertBitSet	__iand__ (self, GraphVertBitSet 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, GraphVertBitSet arg0)
GraphVertBitSet	__ior__ (self, GraphVertBitSet b)
GraphVertBitSet	__isub__ (self, GraphVertBitSet b)
typing.Iterator[GraphVertId]	__iter__ (self)
GraphVertBitSet	__ixor__ (self, GraphVertBitSet b)
GraphVertBitSet	__or__ (self, GraphVertBitSet b)
str	__repr__ (self)
GraphVertBitSet	__sub__ (self, GraphVertBitSet b)
GraphVertBitSet	__xor__ (self, GraphVertBitSet b)
None	autoResizeSet (self, GraphVertId pos, int len, bool val=True)
None	autoResizeSet (self, GraphVertId pos, bool val=True)
bool	autoResizeTestSet (self, GraphVertId pos, bool val=True)
GraphVertId	backId (self)
GraphVertId	endId (self)
GraphVertId	find_first (self)
GraphVertId	find_last (self)
GraphVertId	find_next (self, GraphVertId pos)
GraphVertBitSet	flip (self, GraphVertId n, int len)
GraphVertBitSet	flip (self, GraphVertId n)
GraphVertBitSet	flip (self)
GraphVertBitSet	getMapping (self, Vector_GraphVertId_GraphVertId map)
GraphVertBitSet	getMapping (self, BMap_GraphVertId_GraphVertId map)
GraphVertBitSet	getMapping (self, phmap_flat_hash_map_Id_GraphVertTag_Id_GraphVertTag map)
GraphVertBitSet	getMapping (self, Vector_GraphVertId_GraphVertId map, int resSize)
GraphVertBitSet	getMapping (self, phmap_flat_hash_map_Id_GraphVertTag_Id_GraphVertTag map, int resSize)
bool	intersects (self, GraphVertBitSet a)
bool	is_subset_of (self, GraphVertBitSet a)
GraphVertId	nthSetBit (self, int n)
GraphVertBitSet	reset (self, GraphVertId n, int len)
GraphVertBitSet	reset (self, GraphVertId n)
GraphVertBitSet	reset (self)
GraphVertBitSet	set (self, GraphVertId n, int len, bool val)
GraphVertBitSet	set (self, GraphVertId n, bool val)
GraphVertBitSet	set (self, GraphVertId n)
GraphVertBitSet	set (self)
GraphVertBitSet	subtract (self, GraphVertBitSet b, int bShiftInBlocks)
bool	test (self, GraphVertId n)
bool	test_set (self, GraphVertId n, bool val=True)
Public Member Functions inherited from mrmeshpy.BitSet
bool	__eq__ (self, BitSet b)
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)
GraphVertId	beginId ()
GraphVertBitSet	operator (*args, **kwargs)
GraphVertBitSet	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::GraphVertBitSet
Aliases:  Graph.VertBitSet

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.GraphVertBitSet.__init__ ( * args, ** kwargs )

static

Reimplemented from mrmeshpy.BitSet.

__init__() [2/6]

None mrmeshpy.GraphVertBitSet.__init__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__init__() [3/6]

None mrmeshpy.GraphVertBitSet.__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.GraphVertBitSet.__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.GraphVertBitSet.__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.GraphVertBitSet.__init__	(		self,
		GraphVertBitSet	arg0 )

Implicit copy constructor.

Reimplemented from mrmeshpy.BitSet.

Member Function Documentation

__and__()

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

Reimplemented from mrmeshpy.BitSet.

__iand__()

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

Reimplemented from mrmeshpy.BitSet.

__ior__()

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

Reimplemented from mrmeshpy.BitSet.

__isub__()

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

Reimplemented from mrmeshpy.BitSet.

__iter__()

typing.Iterator[GraphVertId] mrmeshpy.GraphVertBitSet.__iter__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__ixor__()

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

Reimplemented from mrmeshpy.BitSet.

__or__()

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

Reimplemented from mrmeshpy.BitSet.

__repr__()

str mrmeshpy.GraphVertBitSet.__repr__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__sub__()

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

Reimplemented from mrmeshpy.BitSet.

__xor__()

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

Reimplemented from mrmeshpy.BitSet.

autoResizeSet() [1/2]

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

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

Reimplemented from mrmeshpy.BitSet.

backId()

GraphVertId mrmeshpy.GraphVertBitSet.backId

(

self

)

returns the identifier of the back() element

Reimplemented from mrmeshpy.BitSet.

beginId()

GraphVertId mrmeshpy.GraphVertBitSet.beginId ( )

static

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

Reimplemented from mrmeshpy.BitSet.

endId()

GraphVertId mrmeshpy.GraphVertBitSet.endId

(

self

)

Reimplemented from mrmeshpy.BitSet.

find_first()

GraphVertId mrmeshpy.GraphVertBitSet.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()

GraphVertId mrmeshpy.GraphVertBitSet.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()

GraphVertId mrmeshpy.GraphVertBitSet.find_next	(		self,
		GraphVertId	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]

GraphVertBitSet mrmeshpy.GraphVertBitSet.flip

(

self

)

Reimplemented from mrmeshpy.BitSet.

flip() [2/3]

GraphVertBitSet mrmeshpy.GraphVertBitSet.flip	(		self,
		GraphVertId	n )

Reimplemented from mrmeshpy.BitSet.

flip() [3/3]

GraphVertBitSet mrmeshpy.GraphVertBitSet.flip	(		self,
		GraphVertId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

getMapping() [1/5]

GraphVertBitSet mrmeshpy.GraphVertBitSet.getMapping	(		self,
		BMap_GraphVertId_GraphVertId	map )

getMapping() [2/5]

GraphVertBitSet mrmeshpy.GraphVertBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_GraphVertTag_Id_GraphVertTag	map )

getMapping() [3/5]

GraphVertBitSet mrmeshpy.GraphVertBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_GraphVertTag_Id_GraphVertTag	map,
		int	resSize )

getMapping() [4/5]

GraphVertBitSet mrmeshpy.GraphVertBitSet.getMapping	(		self,
		Vector_GraphVertId_GraphVertId	map )

getMapping() [5/5]

GraphVertBitSet mrmeshpy.GraphVertBitSet.getMapping	(		self,
		Vector_GraphVertId_GraphVertId	map,
		int	resSize )

intersects()

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

GraphVertId mrmeshpy.GraphVertBitSet.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]

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

static

Reimplemented from mrmeshpy.BitSet.

operator() [2/2]

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

static

Reimplemented from mrmeshpy.BitSet.

reset() [1/3]

GraphVertBitSet mrmeshpy.GraphVertBitSet.reset

(

self

)

Reimplemented from mrmeshpy.BitSet.

reset() [2/3]

GraphVertBitSet mrmeshpy.GraphVertBitSet.reset	(		self,
		GraphVertId	n )

Reimplemented from mrmeshpy.BitSet.

reset() [3/3]

GraphVertBitSet mrmeshpy.GraphVertBitSet.reset	(		self,
		GraphVertId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

set() [1/4]

GraphVertBitSet mrmeshpy.GraphVertBitSet.set

(

self

)

Reimplemented from mrmeshpy.BitSet.

set() [2/4]

GraphVertBitSet mrmeshpy.GraphVertBitSet.set	(		self,
		GraphVertId	n )

Reimplemented from mrmeshpy.BitSet.

set() [3/4]

GraphVertBitSet mrmeshpy.GraphVertBitSet.set	(		self,
		GraphVertId	n,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

set() [4/4]

GraphVertBitSet mrmeshpy.GraphVertBitSet.set	(		self,
		GraphVertId	n,
		int	len,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

subtract()

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

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

Reimplemented from mrmeshpy.BitSet.

test_set()

bool mrmeshpy.GraphVertBitSet.test_set	(		self,
		GraphVertId	n,
		bool	val = True )

Reimplemented from mrmeshpy.BitSet.

---

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

• mrmeshpy.pyi