mrmeshpy.ObjBitSet Class Reference

Inheritance diagram for mrmeshpy.ObjBitSet:

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

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

static

Reimplemented from mrmeshpy.BitSet.

__init__() [2/6]

None mrmeshpy.ObjBitSet.__init__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__init__() [3/6]

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

Implicit copy constructor.

Reimplemented from mrmeshpy.BitSet.

Member Function Documentation

__and__()

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

Reimplemented from mrmeshpy.BitSet.

__iand__()

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

Reimplemented from mrmeshpy.BitSet.

__ior__()

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

Reimplemented from mrmeshpy.BitSet.

__isub__()

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

Reimplemented from mrmeshpy.BitSet.

__iter__()

typing.Iterator[ObjId] mrmeshpy.ObjBitSet.__iter__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__ixor__()

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

Reimplemented from mrmeshpy.BitSet.

__or__()

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

Reimplemented from mrmeshpy.BitSet.

__repr__()

str mrmeshpy.ObjBitSet.__repr__

(

self

)

Reimplemented from mrmeshpy.BitSet.

__sub__()

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

Reimplemented from mrmeshpy.BitSet.

__xor__()

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

Reimplemented from mrmeshpy.BitSet.

autoResizeSet() [1/2]

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

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

Reimplemented from mrmeshpy.BitSet.

backId()

ObjId mrmeshpy.ObjBitSet.backId

(

self

)

returns the identifier of the back() element

Reimplemented from mrmeshpy.BitSet.

beginId()

ObjId mrmeshpy.ObjBitSet.beginId ( )

static

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

Reimplemented from mrmeshpy.BitSet.

endId()

ObjId mrmeshpy.ObjBitSet.endId

(

self

)

Reimplemented from mrmeshpy.BitSet.

find_first()

ObjId mrmeshpy.ObjBitSet.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()

ObjId mrmeshpy.ObjBitSet.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()

ObjId mrmeshpy.ObjBitSet.find_next	(		self,
		ObjId	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]

ObjBitSet mrmeshpy.ObjBitSet.flip

(

self

)

Reimplemented from mrmeshpy.BitSet.

flip() [2/3]

ObjBitSet mrmeshpy.ObjBitSet.flip	(		self,
		ObjId	n )

Reimplemented from mrmeshpy.BitSet.

flip() [3/3]

ObjBitSet mrmeshpy.ObjBitSet.flip	(		self,
		ObjId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

getMapping() [1/5]

ObjBitSet mrmeshpy.ObjBitSet.getMapping	(		self,
		BMap_ObjId_ObjId	map )

getMapping() [2/5]

ObjBitSet mrmeshpy.ObjBitSet.getMapping	(		self,
		ObjMap	map )

getMapping() [3/5]

ObjBitSet mrmeshpy.ObjBitSet.getMapping	(		self,
		ObjMap	map,
		int	resSize )

getMapping() [4/5]

ObjBitSet mrmeshpy.ObjBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_ObjTag_Id_ObjTag	map )

getMapping() [5/5]

ObjBitSet mrmeshpy.ObjBitSet.getMapping	(		self,
		phmap_flat_hash_map_Id_ObjTag_Id_ObjTag	map,
		int	resSize )

intersects()

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

ObjId mrmeshpy.ObjBitSet.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]

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

static

Reimplemented from mrmeshpy.BitSet.

operator() [2/2]

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

static

Reimplemented from mrmeshpy.BitSet.

reset() [1/3]

ObjBitSet mrmeshpy.ObjBitSet.reset

(

self

)

Reimplemented from mrmeshpy.BitSet.

reset() [2/3]

ObjBitSet mrmeshpy.ObjBitSet.reset	(		self,
		ObjId	n )

Reimplemented from mrmeshpy.BitSet.

reset() [3/3]

ObjBitSet mrmeshpy.ObjBitSet.reset	(		self,
		ObjId	n,
		int	len )

Reimplemented from mrmeshpy.BitSet.

set() [1/4]

ObjBitSet mrmeshpy.ObjBitSet.set

(

self

)

Reimplemented from mrmeshpy.BitSet.

set() [2/4]

ObjBitSet mrmeshpy.ObjBitSet.set	(		self,
		ObjId	n )

Reimplemented from mrmeshpy.BitSet.

set() [3/4]

ObjBitSet mrmeshpy.ObjBitSet.set	(		self,
		ObjId	n,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

set() [4/4]

ObjBitSet mrmeshpy.ObjBitSet.set	(		self,
		ObjId	n,
		int	len,
		bool	val )

Reimplemented from mrmeshpy.BitSet.

subtract()

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

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

Reimplemented from mrmeshpy.BitSet.

test_set()

bool mrmeshpy.ObjBitSet.test_set	(		self,
		ObjId	n,
		bool	val = True )

Reimplemented from mrmeshpy.BitSet.

---

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

• mrmeshpy.pyi