AbstractLinAlgPack: C++ Interfaces For Vectors, Matrices And Related Linear Algebra Objects  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
AbstractLinAlgPack_compare_element_indexes.hpp
1 // @HEADER
2 // ***********************************************************************
3 //
4 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
5 // Copyright (2003) Sandia Corporation
6 //
7 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8 // license for use of this work by or on behalf of the U.S. Government.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
38 //
39 // ***********************************************************************
40 // @HEADER
41 
42 #ifndef COMPARE_ELEMENT_INDEXES_H
43 #define COMPARE_ELEMENT_INDEXES_H
44 
45 #include <functional>
46 
47 #include "AbstractLinAlgPack_Types.hpp"
48 
49 namespace AbstractLinAlgPack {
50 
57 
59 template<class T_Element>
61  : public std::unary_function< T_Element, typename T_Element::index_type >
62 {
63  bool operator()(const T_Element& ele1, const T_Element& ele2) {
64  return ele1.index() < ele2.index();
65  }
66  bool operator()(typename T_Element::index_type i, const T_Element& ele2) {
67  return i < ele2.index();
68  }
69  bool operator()(const T_Element& ele1, typename T_Element::index_type i) {
70  return ele1.index() < i;
71  }
72 };
73 
75 template<class T_Element>
77  : public std::unary_function< T_Element, typename T_Element::index_type >
78 {
79  compare_element_indexes_equal_to( typename T_Element::index_type i )
80  : i_(i)
81  {}
82  bool operator()(const T_Element& ele) {
83  return ele.index() == i_;
84  }
85 private:
86  typename T_Element::index_type i_;
87  // Not defined and not to be called
89 };
90 
92 
93 } // end namespace AbstractLinAlgPack
94 
95 #endif // COMPARE_ELEMENT_INDEXES_H