INTERP_KERNEL.IteratorOnComposedEdge Class Reference

#include <InterpKernelGeo2DAbstractEdge.hxx>

Public Member Functions
	IteratorOnComposedEdge ()
	IteratorOnComposedEdge (ComposedEdge *compEdges)
bool	isValid () const
void	operator= (const IteratorOnComposedEdge &other)
void	first ()
void	next ()
void	last ()
void	nextLoop ()
void	previousLoop ()
bool	finished () const
bool	goToNextInOn (bool direction, int &i, int nbMax)
ElementaryEdge *	current ()
void	assignMySelfToAllElems (ComposedEdge *elems)
void	insertElemEdges (ComposedEdge *elems, bool changeMySelf)
Private Attributes
std::list< ElementaryEdge * > ::iterator	_deep_it
std::list< ElementaryEdge * > *	_list_handle
Friends
class	ComposedEdge
class	ElementaryEdge
class	QuadraticPolygon

---

Detailed Description

Asumption is done with this iterator that we iterate on a container containing more than one edge.

---

Constructor & Destructor Documentation

IteratorOnComposedEdge::IteratorOnComposedEdge

(

)

IteratorOnComposedEdge::IteratorOnComposedEdge

(

ComposedEdge *

compEdges

)

References INTERP_KERNEL.IteratorOnComposedEdge.first().

---

Member Function Documentation

bool INTERP_KERNEL.IteratorOnComposedEdge.isValid

(

)

const

void IteratorOnComposedEdge::operator=

(

const IteratorOnComposedEdge &

other

)

References INTERP_KERNEL.IteratorOnComposedEdge._deep_it, and INTERP_KERNEL.IteratorOnComposedEdge._list_handle.

void INTERP_KERNEL.IteratorOnComposedEdge.first

(

)

void INTERP_KERNEL.IteratorOnComposedEdge.next

(

)

void IteratorOnComposedEdge::last

(

)

References INTERP_KERNEL.IteratorOnComposedEdge._deep_it, and INTERP_KERNEL.IteratorOnComposedEdge._list_handle.

void IteratorOnComposedEdge::nextLoop

(

)

References INTERP_KERNEL.IteratorOnComposedEdge._deep_it, INTERP_KERNEL.IteratorOnComposedEdge._list_handle, and INTERP_KERNEL.IteratorOnComposedEdge.first().

void IteratorOnComposedEdge::previousLoop

(

)

References INTERP_KERNEL.IteratorOnComposedEdge._deep_it, INTERP_KERNEL.IteratorOnComposedEdge._list_handle, and INTERP_KERNEL.IteratorOnComposedEdge.last().

bool INTERP_KERNEL.IteratorOnComposedEdge.finished

(

)

const

bool IteratorOnComposedEdge::goToNextInOn	(	bool	direction,
		int &	i,
		int	nbMax
	)

References INTERP_KERNEL.IteratorOnComposedEdge.current(), INTERP_KERNEL.FULL_OUT_1, INTERP_KERNEL.ElementaryEdge.getLoc(), INTERP_KERNEL.IteratorOnComposedEdge.nextLoop(), and INTERP_KERNEL.IteratorOnComposedEdge.previousLoop().

ElementaryEdge* INTERP_KERNEL.IteratorOnComposedEdge.current

(

)

void IteratorOnComposedEdge::assignMySelfToAllElems

(

ComposedEdge *

elems

)

References INTERP_KERNEL.ComposedEdge.getListBehind().

void IteratorOnComposedEdge::insertElemEdges	(	ComposedEdge *	elems,
		bool	changeMySelf
	)

References INTERP_KERNEL.IteratorOnComposedEdge._deep_it, INTERP_KERNEL.IteratorOnComposedEdge._list_handle, and INTERP_KERNEL.ComposedEdge.getListBehind().

---

Friends And Related Function Documentation

friend class ComposedEdge [friend]

friend class ElementaryEdge [friend]

friend class QuadraticPolygon [friend]

---

Field Documentation

std::list<ElementaryEdge *>::iterator INTERP_KERNEL.IteratorOnComposedEdge._deep_it [private]

std::list<ElementaryEdge *>* INTERP_KERNEL.IteratorOnComposedEdge._list_handle [private]