-// Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
+// Copyright (C) 2007-2014 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
+// 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 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.
+// 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
+// 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
+// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
+
// File : FindKeyPredicate.hxx
// Author : Eric Fayolle (EDF)
// Module : KERNEL
// 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<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 {
+// 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) ;
// }