1 // Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // File : AdjacentFunctor.hxx
23 // Author : Eric Fayolle (EDF)
25 // Modified by : $LastChangedBy$
26 // Date : $LastChangedDate: 2007-01-24 16:30:34 +0100 (mer, 24 jan 2007) $
29 #ifndef _ADJACENT_FUNCTOR_HXX_
30 #define _ADJACENT_FUNCTOR_HXX_
32 #include "ConstTraits.hxx"
34 #include "DisplayPair.hxx"
37 // Suppose que le container est trié
38 template < typename T > struct AdjacentFunctor {
40 typedef typename ConstTrait<T>::NonConstType TNoConst;
45 bool _minFound,_maxFound,_equal;
47 AdjacentFunctor(const T& value):_minValue(value),_maxValue(value),
48 _minFound(false),_maxFound(false),
51 // Suppose que les valeurs passées en paramètres sont triées par ordre croissant
52 bool operator()(const T &v1) {
54 std::cout << "AdjacentFunctor: " << _minValue << _maxValue << std::endl;
55 std::cout << "AdjacentFunctor: " << _min << _max << std::endl;
57 if ( v1 <= _minValue && v1 >= _maxValue)
61 std::cout << "AdjacentFunctor: _equal : " << v1 << std::endl;
67 _min=v1;_minFound=true;
69 std::cout << "AdjacentFunctor: _minFound : " <<_min << std::endl;
72 else if ( v1 > _maxValue )
74 _max=v1;_maxFound=true;
76 std::cout << "AdjacentFunctor: _maxFound : " <<_max << std::endl;
82 if ( v1 < _minValue) {
83 std::cout << "EE1: _min : " << _min << std::endl;
84 _min=v1;_minFound=true;
85 std::cout << "AdjacentFunctor: _minFound : " <<_min << ", _minValue " << _minValue << std::endl;
86 } else if ( v1 > _maxValue ) {
87 _max=v1;_maxFound=true;
88 std::cout << "AdjacentFunctor: _maxFound : " <<_max << ", _maxValue " << _maxValue << std::endl;
91 std::cout << "AdjacentFunctor: _equal : " << v1<< ", _minValue " << _minValue << ", _maxValue " << _maxValue << std::endl;
96 //std::cout << "AdjacentFunctor: _minFound : " <<_min << ", _maxFound " << _max << std::endl;
97 return ( _minFound && _maxFound );
100 void setMaxValue(const T & value) {_maxValue = value;}
101 bool isEqual() const { return _equal;}
102 bool isBounded() const { return _minFound && _maxFound;}
103 bool getBounds(TNoConst & min, TNoConst & max) const {
105 std::cout << "_minFound : " <<_minFound << ", _maxFound " << _maxFound << std::endl;
107 if (_minFound && _maxFound ) { min=_min; max=_max; return true; }
110 void reset() { _minFound = false; _maxFound = false; _equal = false; };