foreach.h

/****************************************************************************
* VCGLib                                                            o o     *
* Visual and Computer Graphics Library                            o     o   *
*                                                                _   O  _   *
* Copyright(C) 2004-2017                                           \/)\/    *
* Visual Computing Lab                                            /\/|      *
* ISTI - Italian National Research Council                           |      *
*                                                                    \      *
* All rights reserved.                                                      *
*                                                                           *
* This program is free software; you can redistribute it and/or modify      *
* it under the terms of the GNU General Public License as published by      *
* the Free Software Foundation; either version 2 of the License, or         *
* (at your option) any later version.                                       *
*                                                                           *
* This program is distributed in the hope that it will be useful,           *
* but WITHOUT ANY WARRANTY; without even the implied warranty of            *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the             *
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt)          *
* for more details.                                                         *
*                                                                           *
****************************************************************************/
 
#ifndef VCG__FOREACH_H
#define VCG__FOREACH_H
 
#include <vcg/simplex/face/pos.h>
 
namespace vcg {
namespace tri {
template <class MeshType, typename Callable>
inline void ForEachFacePos(const MeshType &m, Callable action)
{
  typedef typename face::Pos<typename MeshType::FaceType> PosType;
 
    for(auto fi=m.face.begin();fi!=m.face.end();++fi)
        if(!(*fi).IsD())
        {
            for(int i=0;i<3;++i)
            {
                PosType pi(&*fi,i);
                action(pi);
            }
        }
}
 
template <class MeshType, typename Callable>
inline void ForEachFacePos(MeshType &m, Callable action)
{
  typedef typename face::Pos<typename MeshType::FaceType> PosType;
  
    for(auto fi=m.face.begin();fi!=m.face.end();++fi)
        if(!(*fi).IsD())
        {
            for(int i=0;i<3;++i)
            {
                PosType pi(&*fi,i);
                action(pi);
            }
        }
}
 
template <class MeshType, typename Callable>
inline void ForEachFace(const MeshType &m, Callable action)
{
  if(m.fn == (int) m.face.size())
  {
    for(auto fi=m.face.begin();fi!=m.face.end();++fi) {
      action(*fi);
    }       
  }
  else
  {
    for(auto fi=m.face.begin();fi!=m.face.end();++fi)
      if(!(*fi).IsD())
      {
        action(*fi);
      }    
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachFace(MeshType &m, Callable action)
{
  if(m.fn == (int) m.face.size())
  {
    for(auto fi=m.face.begin();fi!=m.face.end();++fi) {
      action(*fi);
    }       
  }
  else
  {
    for(auto fi=m.face.begin();fi!=m.face.end();++fi)
      if(!(*fi).IsD())
      {
        action(*fi);
      }    
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachVertex(const MeshType &m, Callable action)
{
  if(m.vn == (int) m.vert.size())
  {
    for(auto vi=m.vert.begin();vi!=m.vert.end();++vi) {
      action(*vi);
    }
  }
  else
  {
    for(auto vi=m.vert.begin();vi!=m.vert.end();++vi)
      if(!(*vi).IsD())
      {
        action(*vi);
      }
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachVertex(MeshType &m, Callable action)
{
  if(m.vn == (int) m.vert.size())
  {
    for(auto vi=m.vert.begin();vi!=m.vert.end();++vi) {
      action(*vi);
    }       
  }
  else
  {
    for(auto vi=m.vert.begin();vi!=m.vert.end();++vi)
      if(!(*vi).IsD())
      {
        action(*vi);
      }    
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachHEdge(const MeshType &m, Callable action)
{
  if(m.hn == (int) m.hedge.size())
  {
    for(auto hei=m.hedge.begin();hei!=m.hedge.end();++hei) {
      action(*hei);
    }
  }
  else
  {
    for(auto hei=m.hedge.begin();hei!=m.hedge.end();++hei)
      if(!(*hei).IsD())
      {
        action(*hei);
      }
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachHEdge(MeshType &m, Callable action)
{
  if(m.hn == (int) m.hedge.size())
  {
    for(auto hei=m.hedge.begin();hei!=m.hedge.end();++hei) {
      action(*hei);
    }
  }
  else
  {
    for(auto hei=m.hedge.begin();hei!=m.hedge.end();++hei)
      if(!(*hei).IsD())
      {
        action(*hei);
      }
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachEdge(const MeshType &m, Callable action)
{
  if(m.en == (int) m.edge.size())
  {
    for(auto ei=m.edge.begin();ei!=m.edge.end();++ei) {
      action(*ei);
    }
  }
  else
  {
    for(auto ei=m.edge.begin();ei!=m.edge.end();++ei)
      if(!(*ei).IsD())
      {
        action(*ei);
      }
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachEdge(MeshType &m, Callable action)
{
  if(m.en == (int) m.edge.size())
  {
    for(auto ei=m.edge.begin();ei!=m.edge.end();++ei) {
      action(*ei);
    }
  }
  else
  {
    for(auto ei=m.edge.begin();ei!=m.edge.end();++ei)
      if(!(*ei).IsD())
      {
        action(*ei);
      }
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachTetra(const MeshType &m, Callable action)
{
  if(m.tn == (int) m.tetra.size())
  {
    for(auto ti = m.tetra.begin(); ti != m.tetra.end(); ++ti) {
      action(*ti);
    }
  }
  else
  {
    for(auto ti = m.tetra.begin(); ti != m.tetra.end(); ++ti)
      if(!(*ti).IsD())
      {
        action(*ti);
      }
  }
}
 
template <class MeshType, typename Callable>
inline void ForEachTetra(MeshType &m, Callable action)
{
  if(m.tn == (int) m.tetra.size())
  {
    for(auto ti = m.tetra.begin(); ti != m.tetra.end(); ++ti) {
      action(*ti);
    }
  }
  else
  {
    for(auto ti = m.tetra.begin(); ti != m.tetra.end(); ++ti)
      if(!(*ti).IsD())
      {
        action(*ti);
      }    
  }
}
 // end doxygen group trimesh
} // end namespace tri
} // end namespace vcg
 
#endif // VCG__FOREACH_H