mrmeshpy.WholeEdgeMap Class Reference

Public Member Functions
bool	__eq__ (self, WholeEdgeMap b)
Id_EdgeTag	__getitem__ (self, UndirectedEdgeId i)
Id_EdgeTag	__getitem__ (self, UndirectedEdgeId i)
None	__init__ (self)
None	__init__ (self, int size)
None	__init__ (self, int size, Id_EdgeTag val)
None	__init__ (self, std_vector_Id_EdgeTag vec)
None	__init__ (self, WholeEdgeMap arg0)
typing.Iterator[Id_EdgeTag]	__iter__ (self)
bool	__ne__ (self, WholeEdgeMap b)
None	__setitem__ (self, UndirectedEdgeId arg0, Id_EdgeTag arg1)
Id_EdgeTag	autoResizeAt (self, UndirectedEdgeId i)
None	autoResizeSet (self, UndirectedEdgeId pos, int len, Id_EdgeTag val)
None	autoResizeSet (self, UndirectedEdgeId i, Id_EdgeTag val)
Id_EdgeTag	back (self)
Id_EdgeTag	back (self)
UndirectedEdgeId	backId (self)
UndirectedEdgeId	beginId (self)
int	capacity (self)
None	clear (self)
Id_EdgeTag	data (self)
Id_EdgeTag	data (self)
Id_EdgeTag	emplace_back (self)
bool	empty (self)
UndirectedEdgeId	endId (self)
Id_EdgeTag	front (self)
Id_EdgeTag	front (self)
int	heapBytes (self)
None	pop_back (self)
None	push_back (self, Id_EdgeTag t)
None	push_back (self, Id_EdgeTag t)
None	reserve (self, int capacity)
None	resize (self, int newSize)
None	resize (self, int newSize, Id_EdgeTag t)
None	resizeNoInit (self, int targetSize)
None	resizeWithReserve (self, int newSize)
None	resizeWithReserve (self, int newSize, Id_EdgeTag value)
int	size (self)
None	swap (self, WholeEdgeMap b)
std_vector_Id_EdgeTag	vec_ (self)
None	vec_ (self, std_vector_Id_EdgeTag arg1)

Detailed Description

Generated from:  MR::WholeEdgeMap


 \\brief std::vector<T>-like container that requires specific indexing type,
 \\tparam T type of stored elements
 \\tparam I type of index (shall be convertible to size_t)
 \\ingroup BasicGroup

Constructor & Destructor Documentation

__init__() [1/5]

None mrmeshpy.WholeEdgeMap.__init__

(

self

)

__init__() [2/5]

None mrmeshpy.WholeEdgeMap.__init__	(		self,
		int	size )

__init__() [3/5]

None mrmeshpy.WholeEdgeMap.__init__	(		self,
		int	size,
		Id_EdgeTag	val )

__init__() [4/5]

None mrmeshpy.WholeEdgeMap.__init__	(		self,
		std_vector_Id_EdgeTag	vec )

__init__() [5/5]

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

Implicit copy constructor.

Member Function Documentation

__eq__()

bool mrmeshpy.WholeEdgeMap.__eq__	(		self,
		WholeEdgeMap	b )

__getitem__() [1/2]

Id_EdgeTag mrmeshpy.WholeEdgeMap.__getitem__	(		self,
		UndirectedEdgeId	i )

__getitem__() [2/2]

Id_EdgeTag mrmeshpy.WholeEdgeMap.__getitem__	(		self,
		UndirectedEdgeId	i )

__iter__()

typing.Iterator[Id_EdgeTag] mrmeshpy.WholeEdgeMap.__iter__

(

self

)

__ne__()

bool mrmeshpy.WholeEdgeMap.__ne__	(		self,
		WholeEdgeMap	b )

__setitem__()

None mrmeshpy.WholeEdgeMap.__setitem__	(		self,
		UndirectedEdgeId	arg0,
		Id_EdgeTag	arg1 )

autoResizeAt()

Id_EdgeTag mrmeshpy.WholeEdgeMap.autoResizeAt	(		self,
		UndirectedEdgeId	i )

this accessor automatically adjusts the size of the vector

autoResizeSet() [1/2]

None mrmeshpy.WholeEdgeMap.autoResizeSet	(		self,
		UndirectedEdgeId	i,
		Id_EdgeTag	val )

autoResizeSet() [2/2]

None mrmeshpy.WholeEdgeMap.autoResizeSet	(		self,
		UndirectedEdgeId	pos,
		int	len,
		Id_EdgeTag	val )

sets elements [pos, pos+len) to given value, adjusting the size of the vector to include new elements

back() [1/2]

Id_EdgeTag mrmeshpy.WholeEdgeMap.back

(

self

)

back() [2/2]

Id_EdgeTag mrmeshpy.WholeEdgeMap.back

(

self

)

backId()

UndirectedEdgeId mrmeshpy.WholeEdgeMap.backId

(

self

)

returns the identifier of the back() element

beginId()

UndirectedEdgeId mrmeshpy.WholeEdgeMap.beginId

(

self

)

returns the identifier of the first element

capacity()

int mrmeshpy.WholeEdgeMap.capacity

(

self

)

clear()

None mrmeshpy.WholeEdgeMap.clear

(

self

)

data() [1/2]

Id_EdgeTag mrmeshpy.WholeEdgeMap.data

(

self

)

data() [2/2]

Id_EdgeTag mrmeshpy.WholeEdgeMap.data

(

self

)

emplace_back()

Id_EdgeTag mrmeshpy.WholeEdgeMap.emplace_back

(

self

)

empty()

bool mrmeshpy.WholeEdgeMap.empty

(

self

)

endId()

UndirectedEdgeId mrmeshpy.WholeEdgeMap.endId

(

self

)

returns backId() + 1

front() [1/2]

Id_EdgeTag mrmeshpy.WholeEdgeMap.front

(

self

)

front() [2/2]

Id_EdgeTag mrmeshpy.WholeEdgeMap.front

(

self

)

heapBytes()

int mrmeshpy.WholeEdgeMap.heapBytes

(

self

)

returns the amount of memory this object occupies on heap

pop_back()

None mrmeshpy.WholeEdgeMap.pop_back

(

self

)

push_back() [1/2]

None mrmeshpy.WholeEdgeMap.push_back	(		self,
		Id_EdgeTag	t )

push_back() [2/2]

None mrmeshpy.WholeEdgeMap.push_back	(		self,
		Id_EdgeTag	t )

reserve()

None mrmeshpy.WholeEdgeMap.reserve	(		self,
		int	capacity )

resize() [1/2]

None mrmeshpy.WholeEdgeMap.resize	(		self,
		int	newSize )

resize() [2/2]

None mrmeshpy.WholeEdgeMap.resize	(		self,
		int	newSize,
		Id_EdgeTag	t )

resizeNoInit()

None mrmeshpy.WholeEdgeMap.resizeNoInit	(		self,
		int	targetSize )

resizes the vector skipping initialization of its elements (more precisely initializing them using ( noInit ) constructor )

resizeWithReserve() [1/2]

None mrmeshpy.WholeEdgeMap.resizeWithReserve	(		self,
		int	newSize )

doubles reserved memory until resize(newSize) can be done without reallocation

resizeWithReserve() [2/2]

None mrmeshpy.WholeEdgeMap.resizeWithReserve	(		self,
		int	newSize,
		Id_EdgeTag	value )

doubles reserved memory until resize(newSize) can be done without reallocation

size()

int mrmeshpy.WholeEdgeMap.size

(

self

)

swap()

None mrmeshpy.WholeEdgeMap.swap	(		self,
		WholeEdgeMap	b )

vec_() [1/2]

std_vector_Id_EdgeTag mrmeshpy.WholeEdgeMap.vec_

(

self

)

the user can directly manipulate the vector, anyway she cannot break anything

vec_() [2/2]

None mrmeshpy.WholeEdgeMap.vec_	(		self,
		std_vector_Id_EdgeTag	arg1 )

---

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

• mrmeshpy.pyi