mapMono.hpp 4.7 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
* Copyright (C) 2009-2012, 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.unistra.fr/                                           *
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

namespace CGoGN
{

/****************************************
 *          DARTS MANAGEMENT            *
 ****************************************/

Pierre Kraemer's avatar
Pierre Kraemer committed
32
inline Dart MapMono::newDart()
33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72
{
	Dart d = GenericMap::newDart() ;

	for (unsigned int i = 0; i < m_permutation.size(); ++i)
		(*m_permutation[i])[d.index] = d ;
	for (unsigned int i = 0; i < m_permutation_inv.size(); ++i)
		(*m_permutation_inv[i])[d.index] = d ;
	for (unsigned int i = 0; i < m_involution.size(); ++i)
		(*m_involution[i])[d.index] = d ;

	return d ;
}

inline void MapMono::deleteDart(Dart d)
{
	deleteDartLine(d.index) ;
}

/****************************************
 *        RELATIONS MANAGEMENT          *
 ****************************************/

inline void MapMono::addInvolution()
{
	std::stringstream sstm;
	sstm << "involution_" << m_involution.size();
	m_involution.push_back(addRelation(sstm.str()));
}

inline void MapMono::addPermutation()
{
	std::stringstream sstm;
	sstm << "permutation_" << m_permutation.size();
	m_permutation.push_back(addRelation(sstm.str()));
	std::stringstream sstm2;
	sstm2 << "permutation_inv_" << m_permutation_inv.size();
	m_permutation_inv.push_back(addRelation(sstm2.str()));
}

template <int I>
Pierre Kraemer's avatar
Pierre Kraemer committed
73
inline Dart MapMono::getInvolution(Dart d) const
74 75 76 77 78
{
	return (*m_involution[I])[d.index];
}

template <int I>
Pierre Kraemer's avatar
Pierre Kraemer committed
79
inline Dart MapMono::getPermutation(Dart d) const
80 81 82 83 84
{
	return (*m_permutation[I])[d.index];
}

template <int I>
Pierre Kraemer's avatar
Pierre Kraemer committed
85
inline Dart MapMono::getPermutationInv(Dart d) const
86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114
{
	return (*m_permutation_inv[I])[d.index];
}

template <int I>
inline void MapMono::permutationSew(Dart d, Dart e)
{
	Dart f = (*m_permutation[I])[d.index] ;
	Dart g = (*m_permutation[I])[e.index] ;
	(*m_permutation[I])[d.index] = g ;
	(*m_permutation[I])[e.index] = f ;
	(*m_permutation_inv[I])[g.index] = d ;
	(*m_permutation_inv[I])[f.index] = e ;
}

template <int I>
inline void MapMono::permutationUnsew(Dart d)
{
	Dart e = (*m_permutation[I])[d.index] ;
	Dart f = (*m_permutation[I])[e.index] ;
	(*m_permutation[I])[d.index] = f ;
	(*m_permutation[I])[e.index] = e ;
	(*m_permutation_inv[I])[f.index] = d ;
	(*m_permutation_inv[I])[e.index] = e ;
}

template <int I>
inline void MapMono::involutionSew(Dart d, Dart e)
{
Pierre Kraemer's avatar
Pierre Kraemer committed
115 116
	assert((*m_involution[I])[d.index] == d) ;
	assert((*m_involution[I])[e.index] == e) ;
117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132
	(*m_involution[I])[d.index] = e ;
	(*m_involution[I])[e.index] = d ;
}

template <int I>
inline void MapMono::involutionUnsew(Dart d)
{
	Dart e = (*m_involution[I])[d.index] ;
	(*m_involution[I])[d.index] = d ;
	(*m_involution[I])[e.index] = e ;
}

/****************************************
 *           DARTS TRAVERSALS           *
 ****************************************/

Pierre Kraemer's avatar
Pierre Kraemer committed
133
inline Dart MapMono::begin() const
134 135 136 137
{
	return Dart::create(m_attribs[DART].begin()) ;
}

Pierre Kraemer's avatar
Pierre Kraemer committed
138
inline Dart MapMono::end() const
139 140 141 142
{
	return Dart::create(m_attribs[DART].end()) ;
}

Pierre Kraemer's avatar
Pierre Kraemer committed
143
inline void MapMono::next(Dart& d) const
144 145 146 147 148
{
	m_attribs[DART].next(d.index) ;
}

} // namespace CGoGN