mrmeshpy.AABBTreePoints.NodeBitSet Class Reference

Inheritance diagram for mrmeshpy.AABBTreePoints.NodeBitSet:

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

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

static

Reimplemented from mrmeshpy.BitSet.

__init__() [2/6]

None mrmeshpy.AABBTreePoints.NodeBitSet.__init__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__init__() [3/6]

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

Implicit copy constructor.

Reimplemented from mrmeshpy.BitSet.

Member Function Documentation

__and__()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.__and__	(		self,
		NodeBitSet	b )

Reimplemented from mrmeshpy.BitSet.

__iand__()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.__iand__	(		self,
		NodeBitSet	b )

Reimplemented from mrmeshpy.BitSet.

__ior__()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.__ior__	(		self,
		NodeBitSet	b )

Reimplemented from mrmeshpy.BitSet.

__isub__()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.__isub__	(		self,
		NodeBitSet	b )

Reimplemented from mrmeshpy.BitSet.

__iter__()

typing.Iterator[NodeId] mrmeshpy.AABBTreePoints.NodeBitSet.__iter__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__ixor__()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.__ixor__	(		self,
		NodeBitSet	b )

Reimplemented from mrmeshpy.BitSet.

__or__()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.__or__	(		self,
		NodeBitSet	b )

Reimplemented from mrmeshpy.BitSet.

__repr__()

str mrmeshpy.AABBTreePoints.NodeBitSet.__repr__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__sub__()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.__sub__	(		self,
		NodeBitSet	b )

Reimplemented from mrmeshpy.BitSet.

__xor__()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.__xor__	(		self,
		NodeBitSet	b )

Reimplemented from mrmeshpy.BitSet.

autoResizeSet() [1/2]

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

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

Reimplemented from mrmeshpy.BitSet.

backId()

NodeId mrmeshpy.AABBTreePoints.NodeBitSet.backId

(

self

)

returns the identifier of the back() element

Reimplemented from mrmeshpy.BitSet.

beginId()

NodeId mrmeshpy.AABBTreePoints.NodeBitSet.beginId ( )

static

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

Reimplemented from mrmeshpy.BitSet.

endId()

NodeId mrmeshpy.AABBTreePoints.NodeBitSet.endId

(

self

)

Reimplemented from mrmeshpy.BitSet.

find_first()

NodeId mrmeshpy.AABBTreePoints.NodeBitSet.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()

NodeId mrmeshpy.AABBTreePoints.NodeBitSet.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()

NodeId mrmeshpy.AABBTreePoints.NodeBitSet.find_next	(		self,
		NodeId	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]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.flip

(

self

)

Reimplemented from mrmeshpy.BitSet.

flip() [2/3]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.flip	(		self,
		NodeId	n )

Reimplemented from mrmeshpy.BitSet.

flip() [3/3]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.flip	(		self,
		NodeId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

getMapping() [1/5]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.getMapping	(		self,
		BMap_NodeId_NodeId	map )

getMapping() [2/5]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_NodeTag_Id_NodeTag	map )

getMapping() [3/5]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_NodeTag_Id_NodeTag	map,
		int	resSize )

getMapping() [4/5]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.getMapping	(		self,
		Vector_NodeId_NodeId	map )

getMapping() [5/5]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.getMapping	(		self,
		Vector_NodeId_NodeId	map,
		int	resSize )

intersects()

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

NodeId mrmeshpy.AABBTreePoints.NodeBitSet.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]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.operator ( * args, ** kwargs )

static

Reimplemented from mrmeshpy.BitSet.

operator() [2/2]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.operator ( * args, ** kwargs )

static

Reimplemented from mrmeshpy.BitSet.

reset() [1/3]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.reset

(

self

)

Reimplemented from mrmeshpy.BitSet.

reset() [2/3]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.reset	(		self,
		NodeId	n )

Reimplemented from mrmeshpy.BitSet.

reset() [3/3]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.reset	(		self,
		NodeId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

set() [1/4]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.set

(

self

)

Reimplemented from mrmeshpy.BitSet.

set() [2/4]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.set	(		self,
		NodeId	n )

Reimplemented from mrmeshpy.BitSet.

set() [3/4]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.set	(		self,
		NodeId	n,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

set() [4/4]

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.set	(		self,
		NodeId	n,
		int	len,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

subtract()

NodeBitSet mrmeshpy.AABBTreePoints.NodeBitSet.subtract	(		self,
		NodeBitSet	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.AABBTreePoints.NodeBitSet.test	(		self,
		NodeId	n )

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

Reimplemented from mrmeshpy.BitSet.

test_set()

bool mrmeshpy.AABBTreePoints.NodeBitSet.test_set	(		self,
		NodeId	n,
		bool	val = True )

Reimplemented from mrmeshpy.BitSet.

---

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

• mrmeshpy.pyi