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 : FindKeyPredicate.hxx
23 // Author : Eric Fayolle (EDF)
25 // Modified by : $LastChangedBy$
26 // Date : $LastChangedDate: 2007-01-08 19:01:14 +0100 (lun, 08 jan 2007) $
29 #ifndef __FIND_KEY_PREDICATE__
30 #define __FIND_KEY_PREDICATE__
34 #include "DisplayPair.hxx"
36 template < typename T >
37 struct FindKeyPredicate : public std::unary_function < T, bool >
40 FindKeyPredicate(const T& value):_value(value){}
41 inline bool operator()(const T &v1, const T& v2) const {
42 std::cout << "FindKeyPredicate Generic -> :" << &(v1.first) << std::endl;
43 return ( v1 == _value );
47 // Pour les MAPs avec une clef sous forme de pair
48 // template <typename T1, typename T2, typename T3>
49 // struct FindKeyPredicate< std::pair<const std::pair<T1,T2>, T3 > > :
50 // public std::binary_function < std::pair<const std::pair<T1,T2>, T3 >,
51 // std::pair<const std::pair<T1,T2>, T3 >, bool >
53 // std::pair<T1,T2> _value;
54 // FindKeyPredicate(const std::pair<T1,T2> & value):_value(value){
55 // std::cout << "1-Initializing with value " << _value << std::endl;
57 // bool operator()( const std::pair<const std::pair<T1,T2>, T3 > & v1,
58 // const std::pair<const std::pair<T1,T2>, T3 > v2) const {
59 // std::cout << "1-> :" << v1 << "," << v2 << " " << std::endl;
60 // return (v1.first <= _value ) && (_value < v2.first) ;
64 template <typename T1, typename T2>
65 struct FindKeyPredicate< std::pair<T1,T2> > : public std::unary_function < std::pair<T1,T2>, bool >
68 FindKeyPredicate(const T1 & value):_value(value){
69 std::cout << "FindKeyPredicate 2-Initializing with value " << _value << std::endl;
72 inline bool operator()( const std::pair<T1,T2> & v1) const {
73 std::cout << "FindKeyPredicate 2-> :" << v1.first << std::endl;
74 return v1.first == _value ;