/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
* Copyright (C) 2009-2011, IGG Team, LSIIT, University of Strasbourg           *
*                                                                              *
* This library is free software; you can redistribute it and/or modify it      *
* under the terms of the GNU Lesser General Public License as published by the *
* Free Software Foundation; either version 2.1 of the License, or (at your     *
* option) any later version.                                                   *
*                                                                              *
* This library 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 Lesser General Public License  *
* for more details.                                                            *
*                                                                              *
* You should have received a copy of the GNU Lesser General Public License     *
* along with this library; if not, write to the Free Software Foundation,      *
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301 USA.           *
*                                                                              *
* Web site: http://cgogn.u-strasbg.fr/                                         *
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

namespace CGoGN
{

/// INLINE FUNCTIONS

inline void Map2::init()
{
	m_phi2 = addRelation("phi2") ;
}

inline Map2::Map2() : Map1()
{
	init() ;
}

inline std::string Map2::mapTypeName()
{
	return "Map2" ;
}

inline unsigned int Map2::dimension()
{
	return 2 ;
}

inline void Map2::clear(bool removeAttrib)
{
	Map1::clear(removeAttrib) ;
	if (removeAttrib)
		init() ;
}

inline void Map2::update_topo_shortcuts()
{
	Map1::update_topo_shortcuts();
	m_phi2 = getRelation("phi2");
}

/*! @name Basic Topological Operators
 * Access and Modification
 *************************************************************************/

inline Dart Map2::newDart()
{
	Dart d = Map1::newDart() ;
	(*m_phi2)[dartIndex(d)] = d ;
	if(m_isMultiRes)
	{
		pushLevel() ;
		for(unsigned int i = m_mrCurrentLevel + 1;  i < m_mrDarts.size(); ++i)
		{
			setCurrentLevel(i) ;
			(*m_phi2)[dartIndex(d)] = d ;
		}
		popLevel() ;
	}
	return d ;
}

inline Dart Map2::phi2(Dart d)
{
	return (*m_phi2)[dartIndex(d)] ;
}

template <int N>
inline Dart Map2::phi(Dart d)
{
	assert( (N > 0) || !"negative parameters not allowed in template multi-phi");
	if (N < 10)
	{
		switch(N)
		{
			case 1 : return phi1(d) ;
			case 2 : return phi2(d) ;
			default : assert(!"Wrong multi-phi relation value") ; return d ;
		}
	}
	switch(N%10)
	{
		case 1 : return phi1(phi<N/10>(d)) ;
		case 2 : return phi2(phi<N/10>(d)) ;
		default : assert(!"Wrong multi-phi relation value") ; return d ;
	}
}

inline Dart Map2::alpha0(Dart d)
{
	return phi2(d) ;
}

inline Dart Map2::alpha1(Dart d)
{
	return phi2(phi_1(d)) ;
}

inline Dart Map2::alpha_1(Dart d)
{
	return phi1(phi2(d)) ;
}

inline Dart Map2::phi2_1(Dart d)
{
	return phi2(phi_1(d)) ;
}

inline Dart Map2::phi12(Dart d)
{
	return phi1(phi2(d)) ;
}

inline void Map2::phi2sew(Dart d, Dart e)
{
	unsigned int d_index = dartIndex(d);
	unsigned int e_index = dartIndex(e);
	assert((*m_phi2)[d_index] == d) ;
	assert((*m_phi2)[e_index] == e) ;
	(*m_phi2)[d_index] = e ;
	(*m_phi2)[e_index] = d ;
}

inline void Map2::phi2unsew(Dart d)
{
	unsigned int d_index = dartIndex(d);
	Dart e = (*m_phi2)[d_index] ;
	(*m_phi2)[d_index] = d ;
	(*m_phi2)[dartIndex(e)] = e ;
}

/*! @name Topological Queries
 *  Return or set various topological information
 *************************************************************************/

inline bool Map2::sameVertex(Dart d, Dart e)
{
	return sameOrientedVertex(d, e) ;
}

inline bool Map2::sameEdge(Dart d, Dart e)
{
	return d == e || phi2(d) == e ;
}

inline bool Map2::isBoundaryEdge(Dart d)
{
	return isBoundaryMarked(d) || isBoundaryMarked(phi2(d));
}

inline bool Map2::sameOrientedFace(Dart d, Dart e)
{
	return Map1::sameCycle(d, e) ;
}

inline bool Map2::sameFace(Dart d, Dart e)
{
	return sameOrientedFace(d, e) ;
}

inline unsigned int Map2::faceDegree(Dart d)
{
	return Map1::cycleDegree(d) ;
}

inline bool Map2::sameVolume(Dart d, Dart e)
{
	return sameOrientedVolume(d, e) ;
}

/*! @name Cell Functors
 *  Apply functors to all darts of a cell
 *************************************************************************/

inline bool Map2::foreach_dart_of_face(Dart d, FunctorType& f, unsigned int thread)
{
	return Map1::foreach_dart_of_cc(d, f, thread);
}


inline bool Map2::foreach_dart_of_vertex1(Dart d, FunctorType& f, unsigned int thread)
{
	return Map1::foreach_dart_of_vertex(d,f,thread);
}

inline bool Map2::foreach_dart_of_edge1(Dart d, FunctorType& f, unsigned int thread)
{
	return Map1::foreach_dart_of_edge(d,f,thread);
}

} // namespace CGoGN