mrmeshpy.GraphEdgeBitSet Class Reference

Inheritance diagram for mrmeshpy.GraphEdgeBitSet:

Public Member Functions
GraphEdgeBitSet	__and__ (self, GraphEdgeBitSet b)
GraphEdgeBitSet	__iand__ (self, GraphEdgeBitSet 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, GraphEdgeBitSet arg0)
GraphEdgeBitSet	__ior__ (self, GraphEdgeBitSet b)
GraphEdgeBitSet	__isub__ (self, GraphEdgeBitSet b)
typing.Iterator[GraphEdgeId]	__iter__ (self)
GraphEdgeBitSet	__ixor__ (self, GraphEdgeBitSet b)
GraphEdgeBitSet	__or__ (self, GraphEdgeBitSet b)
str	__repr__ (self)
GraphEdgeBitSet	__sub__ (self, GraphEdgeBitSet b)
GraphEdgeBitSet	__xor__ (self, GraphEdgeBitSet b)
None	autoResizeSet (self, GraphEdgeId pos, int len, bool val=True)
None	autoResizeSet (self, GraphEdgeId pos, bool val=True)
bool	autoResizeTestSet (self, GraphEdgeId pos, bool val=True)
GraphEdgeId	backId (self)
GraphEdgeId	endId (self)
GraphEdgeId	find_first (self)
GraphEdgeId	find_last (self)
GraphEdgeId	find_next (self, GraphEdgeId pos)
GraphEdgeBitSet	flip (self, GraphEdgeId n, int len)
GraphEdgeBitSet	flip (self, GraphEdgeId n)
GraphEdgeBitSet	flip (self)
GraphEdgeBitSet	getMapping (self, Vector_GraphEdgeId_GraphEdgeId map)
GraphEdgeBitSet	getMapping (self, BMap_GraphEdgeId_GraphEdgeId map)
GraphEdgeBitSet	getMapping (self, phmap_flat_hash_map_Id_GraphEdgeTag_Id_GraphEdgeTag map)
GraphEdgeBitSet	getMapping (self, Vector_GraphEdgeId_GraphEdgeId map, int resSize)
GraphEdgeBitSet	getMapping (self, phmap_flat_hash_map_Id_GraphEdgeTag_Id_GraphEdgeTag map, int resSize)
bool	intersects (self, GraphEdgeBitSet a)
bool	is_subset_of (self, GraphEdgeBitSet a)
GraphEdgeId	nthSetBit (self, int n)
GraphEdgeBitSet	reset (self, GraphEdgeId n, int len)
GraphEdgeBitSet	reset (self, GraphEdgeId n)
GraphEdgeBitSet	reset (self)
GraphEdgeBitSet	set (self, GraphEdgeId n, int len, bool val)
GraphEdgeBitSet	set (self, GraphEdgeId n, bool val)
GraphEdgeBitSet	set (self, GraphEdgeId n)
GraphEdgeBitSet	set (self)
GraphEdgeBitSet	subtract (self, GraphEdgeBitSet b, int bShiftInBlocks)
bool	test (self, GraphEdgeId n)
bool	test_set (self, GraphEdgeId 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)
GraphEdgeId	beginId ()
GraphEdgeBitSet	operator (*args, **kwargs)
GraphEdgeBitSet	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::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__() [1/6]

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

static

Reimplemented from mrmeshpy.BitSet.

__init__() [2/6]

None mrmeshpy.GraphEdgeBitSet.__init__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__init__() [3/6]

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

Implicit copy constructor.

Reimplemented from mrmeshpy.BitSet.

Member Function Documentation

__and__()

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

Reimplemented from mrmeshpy.BitSet.

__iand__()

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

Reimplemented from mrmeshpy.BitSet.

__ior__()

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

Reimplemented from mrmeshpy.BitSet.

__isub__()

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

Reimplemented from mrmeshpy.BitSet.

__iter__()

typing.Iterator[GraphEdgeId] mrmeshpy.GraphEdgeBitSet.__iter__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__ixor__()

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

Reimplemented from mrmeshpy.BitSet.

__or__()

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

Reimplemented from mrmeshpy.BitSet.

__repr__()

str mrmeshpy.GraphEdgeBitSet.__repr__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__sub__()

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

Reimplemented from mrmeshpy.BitSet.

__xor__()

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

Reimplemented from mrmeshpy.BitSet.

autoResizeSet() [1/2]

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

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

Reimplemented from mrmeshpy.BitSet.

backId()

GraphEdgeId mrmeshpy.GraphEdgeBitSet.backId

(

self

)

returns the identifier of the back() element

Reimplemented from mrmeshpy.BitSet.

beginId()

GraphEdgeId mrmeshpy.GraphEdgeBitSet.beginId ( )

static

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

Reimplemented from mrmeshpy.BitSet.

endId()

GraphEdgeId mrmeshpy.GraphEdgeBitSet.endId

(

self

)

Reimplemented from mrmeshpy.BitSet.

find_first()

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

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

GraphEdgeId mrmeshpy.GraphEdgeBitSet.find_next	(		self,
		GraphEdgeId	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]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.flip

(

self

)

Reimplemented from mrmeshpy.BitSet.

flip() [2/3]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.flip	(		self,
		GraphEdgeId	n )

Reimplemented from mrmeshpy.BitSet.

flip() [3/3]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.flip	(		self,
		GraphEdgeId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

getMapping() [1/5]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.getMapping	(		self,
		BMap_GraphEdgeId_GraphEdgeId	map )

getMapping() [2/5]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_GraphEdgeTag_Id_GraphEdgeTag	map )

getMapping() [3/5]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_GraphEdgeTag_Id_GraphEdgeTag	map,
		int	resSize )

getMapping() [4/5]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.getMapping	(		self,
		Vector_GraphEdgeId_GraphEdgeId	map )

getMapping() [5/5]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.getMapping	(		self,
		Vector_GraphEdgeId_GraphEdgeId	map,
		int	resSize )

intersects()

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

GraphEdgeId mrmeshpy.GraphEdgeBitSet.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]

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

static

Reimplemented from mrmeshpy.BitSet.

operator() [2/2]

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

static

Reimplemented from mrmeshpy.BitSet.

reset() [1/3]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.reset

(

self

)

Reimplemented from mrmeshpy.BitSet.

reset() [2/3]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.reset	(		self,
		GraphEdgeId	n )

Reimplemented from mrmeshpy.BitSet.

reset() [3/3]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.reset	(		self,
		GraphEdgeId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

set() [1/4]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.set

(

self

)

Reimplemented from mrmeshpy.BitSet.

set() [2/4]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.set	(		self,
		GraphEdgeId	n )

Reimplemented from mrmeshpy.BitSet.

set() [3/4]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.set	(		self,
		GraphEdgeId	n,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

set() [4/4]

GraphEdgeBitSet mrmeshpy.GraphEdgeBitSet.set	(		self,
		GraphEdgeId	n,
		int	len,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

subtract()

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

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

Reimplemented from mrmeshpy.BitSet.

test_set()

bool mrmeshpy.GraphEdgeBitSet.test_set	(		self,
		GraphEdgeId	n,
		bool	val = True )

Reimplemented from mrmeshpy.BitSet.

---

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

• mrmeshpy.pyi