iterates over indexes of free vetices in a PatchData. More...

#include <MsqFreeVertexIndexIterator.hpp>

Collaboration diagram for MsqFreeVertexIndexIterator:

Public Member Functions
	MsqFreeVertexIndexIterator (PatchData *pd, MsqError &err)

void	reset ()
	Resets the iterator. More...

bool	next ()
	Increments the iterator. returns false if there is no more free vertex. More...

size_t	value ()
	Returns an index corresponding to a free vertex. More...

	MsqFreeVertexIndexIterator (PatchData *pd, MsqError &err)

void	reset ()
	Resets the iterator. More...

bool	next ()
	Increments the iterator. returns false if there is no more free vertex. More...

size_t	value ()
	Returns an index corresponding to a free vertex. More...

Private Attributes
PatchData *	iterOriginator

size_t	iterCurrentIndex

MsqVertex *	iterVertexArray

bool	initialState

Detailed Description

iterates over indexes of free vetices in a PatchData.

A free vertex is defined as not having the MSQ_SOFT_FIXED and MSQ_HARD_FIXED flags activated.

Use the iterator as follow: MsqFreeVertexIndexIterator ind(&patch_data,err); ind.reset(); while (ind.next()) { cout << ind.value(); } .

Definition at line 66 of file includeLinks/MsqFreeVertexIndexIterator.hpp.

Constructor & Destructor Documentation

MsqFreeVertexIndexIterator	(	PatchData *	pd,
		MsqError &	err
	)

inline

Definition at line 68 of file includeLinks/MsqFreeVertexIndexIterator.hpp.

References PatchData::get_vertex_array(), and MsqFreeVertexIndexIterator::iterVertexArray.

                                                              :
       iterOriginator(pd), iterCurrentIndex(0), initialState(true)
     { iterVertexArray = pd->get_vertex_array(err); }

Here is the call graph for this function:

MsqFreeVertexIndexIterator	(	PatchData *	pd,
		MsqError &	err
	)

inline

Definition at line 68 of file src/Mesh/MsqFreeVertexIndexIterator.hpp.

References PatchData::get_vertex_array(), and MsqFreeVertexIndexIterator::iterVertexArray.

                                                              :
       iterOriginator(pd), iterCurrentIndex(0), initialState(true)
     { iterVertexArray = pd->get_vertex_array(err); }

Here is the call graph for this function:

Member Function Documentation

bool next ( )

inline

Increments the iterator. returns false if there is no more free vertex.

Definition at line 87 of file includeLinks/MsqFreeVertexIndexIterator.hpp.

References MsqFreeVertexIndexIterator::initialState, MsqVertex::is_flag_set(), MsqFreeVertexIndexIterator::iterCurrentIndex, MsqFreeVertexIndexIterator::iterOriginator, MsqFreeVertexIndexIterator::iterVertexArray, MsqVertex::MSQ_HARD_FIXED, MsqVertex::MSQ_SOFT_FIXED, and PatchData::num_vertices().

Referenced by PatchData::get_max_vertex_movement_squared(), PatchData::move_free_vertices_constrained(), SmartLaplacianSmoother::optimize_vertex_positions(), Randomize::optimize_vertex_positions(), LaplacianSmoother::optimize_vertex_positions(), ConjugateGradient::optimize_vertex_positions(), SteepestDescent::optimize_vertex_positions(), FeasibleNewton::optimize_vertex_positions(), NonSmoothSteepestDescent::optimize_vertex_positions(), and PatchData::set_free_vertices_constrained().

   {
     bool fixed=true;
     while ( fixed ) 
       {
         if ( initialState==true )  initialState=false;
         else  ++iterCurrentIndex;
         
         if ( iterCurrentIndex == iterOriginator->num_vertices() ) {
           return false; 
         }
         fixed = iterVertexArray[iterCurrentIndex].is_flag_set(MsqVertex::MSQ_SOFT_FIXED) ||
         iterVertexArray[iterCurrentIndex].is_flag_set(MsqVertex::MSQ_HARD_FIXED) ;
           //fixed = !(iterVertexArray[iterCurrentIndex].is_free_vertex());
       }
     return true;
   }