Version: 7.8.0
FindKeyPredicate.hxx
Go to the documentation of this file.
1 // Copyright (C) 2007-2016 CEA/DEN, EDF R&D, OPEN CASCADE
2 //
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
5 //
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, or (at your option) any later version.
10 //
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.
15 //
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
19 //
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
21 //
22 
23 // File : FindKeyPredicate.hxx
24 // Author : Eric Fayolle (EDF)
25 // Module : KERNEL
26 // Modified by : $LastChangedBy$
27 // Date : $LastChangedDate: 2007-01-08 19:01:14 +0100 (lun, 08 jan 2007) $
28 // Id : $Id$
29 //
30 #ifndef __FIND_KEY_PREDICATE__
31 #define __FIND_KEY_PREDICATE__
32 
33 #include <functional>
34 #include <utility>
35 #include "DisplayPair.hxx"
36 
37 template < typename T >
38 struct FindKeyPredicate : public std::unary_function < T, bool >
39 {
40  T _value;
41  FindKeyPredicate(const T& value):_value(value){}
42  inline bool operator()(const T &v1, const T& v2) const {
43  std::cout << "FindKeyPredicate Generic -> :" << &(v1.first) << std::endl;
44  return ( v1 == _value );
45  }
46 };
47 
48 // Pour les MAPs avec une clef sous forme de pair
49 // template <typename T1, typename T2, typename T3>
50 // struct FindKeyPredicate< std::pair<const std::pair<T1,T2>, T3 > > :
51 // public std::binary_function < std::pair<const std::pair<T1,T2>, T3 >,
52 // std::pair<const std::pair<T1,T2>, T3 >, bool >
53 // {
54 // std::pair<T1,T2> _value;
55 // FindKeyPredicate(const std::pair<T1,T2> & value):_value(value){
56 // std::cout << "1-Initializing with value " << _value << std::endl;
57 // }
58 // bool operator()( const std::pair<const std::pair<T1,T2>, T3 > & v1,
59 // const std::pair<const std::pair<T1,T2>, T3 > v2) const {
60 // std::cout << "1-> :" << v1 << "," << v2 << " " << std::endl;
61 // return (v1.first <= _value ) && (_value < v2.first) ;
62 // }
63 // };
64 
65 template <typename T1, typename T2>
66 struct FindKeyPredicate< std::pair<T1,T2> > : public std::unary_function < std::pair<T1,T2>, bool >
67 {
68  T1 _value;
69  FindKeyPredicate(const T1 & value):_value(value){
70  std::cout << "FindKeyPredicate 2-Initializing with value " << _value << std::endl;
71  }
72 
73  inline bool operator()( const std::pair<T1,T2> & v1) const {
74  std::cout << "FindKeyPredicate 2-> :" << v1.first << std::endl;
75  return v1.first == _value ;
76  }
77 };
78 
79 #endif