/usr/include/salome/FindKeyPredicate.hxx is in salome-kernel-dev 6.5.0-7ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 32 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 73 74 75 76 77 78 79 | // Copyright (C) 2007-2012 CEA/DEN, EDF R&D, OPEN CASCADE
//
// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
//
// 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.
//
// 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
// File : FindKeyPredicate.hxx
// Author : Eric Fayolle (EDF)
// Module : KERNEL
// Modified by : $LastChangedBy$
// Date : $LastChangedDate: 2007-01-08 19:01:14 +0100 (lun, 08 jan 2007) $
// Id : $Id: FindKeyPredicate.hxx,v 1.3.2.1.10.2.12.1 2012-04-12 14:05:06 vsr Exp $
//
#ifndef __FIND_KEY_PREDICATE__
#define __FIND_KEY_PREDICATE__
#include <functional>
#include <utility>
#include "DisplayPair.hxx"
template < typename T >
struct FindKeyPredicate : public std::unary_function < T, bool >
{
T _value;
FindKeyPredicate(const T& value):_value(value){}
inline bool operator()(const T &v1, const T& v2) const {
std::cout << "FindKeyPredicate Generic -> :" << &(v1.first) << std::endl;
return ( v1 == _value );
}
};
// Pour les MAPs avec une clef sous forme de pair
// template <typename T1, typename T2, typename T3>
// struct FindKeyPredicate< std::pair<const std::pair<T1,T2>, T3 > > :
// public std::binary_function < std::pair<const std::pair<T1,T2>, T3 >,
// std::pair<const std::pair<T1,T2>, T3 >, bool >
// {
// std::pair<T1,T2> _value;
// FindKeyPredicate(const std::pair<T1,T2> & value):_value(value){
// std::cout << "1-Initializing with value " << _value << std::endl;
// }
// bool operator()( const std::pair<const std::pair<T1,T2>, T3 > & v1,
// const std::pair<const std::pair<T1,T2>, T3 > v2) const {
// std::cout << "1-> :" << v1 << "," << v2 << " " << std::endl;
// return (v1.first <= _value ) && (_value < v2.first) ;
// }
// };
template <typename T1, typename T2>
struct FindKeyPredicate< std::pair<T1,T2> > : public std::unary_function < std::pair<T1,T2>, bool >
{
T1 _value;
FindKeyPredicate(const T1 & value):_value(value){
std::cout << "FindKeyPredicate 2-Initializing with value " << _value << std::endl;
}
inline bool operator()( const std::pair<T1,T2> & v1) const {
std::cout << "FindKeyPredicate 2-> :" << v1.first << std::endl;
return v1.first == _value ;
}
};
#endif
|