SALOME documentation central

src/DSC/DSC_User/Datastream/AdjacentPredicate.hxx

00001 //  Copyright (C) 2007-2008  CEA/DEN, EDF R&D, OPEN CASCADE
00002 //
00003 //  Copyright (C) 2003-2007  OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
00004 //  CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
00005 //
00006 //  This library is free software; you can redistribute it and/or
00007 //  modify it under the terms of the GNU Lesser General Public
00008 //  License as published by the Free Software Foundation; either
00009 //  version 2.1 of the License.
00010 //
00011 //  This library is distributed in the hope that it will be useful,
00012 //  but WITHOUT ANY WARRANTY; without even the implied warranty of
00013 //  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00014 //  Lesser General Public License for more details.
00015 //
00016 //  You should have received a copy of the GNU Lesser General Public
00017 //  License along with this library; if not, write to the Free Software
00018 //  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
00019 //
00020 //  See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
00021 //
00022 //  File   : AdjacentPredicate.hxx
00023 //  Author : Eric Fayolle (EDF)
00024 //  Module : KERNEL
00025 // Modified by : $LastChangedBy$
00026 // Date        : $LastChangedDate: 2007-01-08 19:01:14 +0100 (lun, 08 jan 2007) $
00027 // Id          : $Id$
00028 //
00029 #ifndef __ADJACENT_PREDICATE__
00030 #define __ADJACENT_PREDICATE__
00031 
00032 #include <functional>
00033 #include <utility>
00034 #include "DisplayPair.hxx"
00035 
00036 template < typename T >
00037 struct AdjacentPredicate : public std::binary_function < T, T, bool > 
00038 {
00039   T _value;
00040   AdjacentPredicate(const T& value):_value(value){}
00041   bool operator()(const T &v1, const T& v2) const {
00042     return (v1 <= _value ) && (_value < v2) ;
00043   }
00044 };
00045 
00046 // Pour les MAPs avec une clef sous forme de pair
00047 template <typename T1, typename T2, typename T3>
00048 struct AdjacentPredicate<  std::pair<const std::pair<T1,T2>, T3 > > : 
00049   public std::binary_function < std::pair<const std::pair<T1,T2>, T3 >,
00050                     std::pair<const std::pair<T1,T2>, T3 >, bool > 
00051 {
00052   std::pair<T1,T2> _value;
00053   AdjacentPredicate(const std::pair<T1,T2> & value):_value(value){
00054     std::cout << "1-Initializing with value " << _value << std::endl;
00055   }
00056   bool operator()( const std::pair<const std::pair<T1,T2>, T3 > & v1,  
00057              const std::pair<const std::pair<T1,T2>, T3 > v2) const {
00058     std::cout << "1-> :" << v1 << "," << v2 << " " << std::endl;
00059     return (v1.first <= _value ) && (_value < v2.first) ;
00060   }
00061 };
00062 
00063 template <typename T1, typename T2>
00064 struct AdjacentPredicate<  std::pair<T1,T2> > : public std::binary_function < std::pair<T1,T2>, std::pair<T1,T2>, bool > 
00065 {
00066   T1 _value;
00067   AdjacentPredicate(const T1 & value):_value(value){
00068     std::cout << "2-Initializing with value " << _value << std::endl;
00069   }
00070   bool operator()( const std::pair<T1,T2> & v1,  const std::pair<T1,T2>& v2) const {
00071     std::cout << "2-> :" << &(v1.first) << "," << &(v2.first) << " " << std::endl;
00072     return (v1.first <= _value ) && (_value < v2.first) ;
00073   }
00074 };
00075 
00076 #endif