1 //////////////////////////////////////////////////////////////////////////////
2 //
3 // (C) Copyright Ion Gaztanaga 2014-2014.
4 //
5 // Distributed under the Boost Software License, Version 1.0.
6 // (See accompanying file LICENSE_1_0.txt or copy at
7 // http://www.boost.org/LICENSE_1_0.txt)
8 //
9 // See http://www.boost.org/libs/intrusive for documentation.
10 //
11 //////////////////////////////////////////////////////////////////////////////
12
13 #ifndef BOOST_INTRUSIVE_DETAIL_ALGORITHM_HPP
14 #define BOOST_INTRUSIVE_DETAIL_ALGORITHM_HPP
15
16 #ifndef BOOST_CONFIG_HPP
17 # include <boost/config.hpp>
18 #endif
19
20 #if defined(BOOST_HAS_PRAGMA_ONCE)
21 # pragma once
22 #endif
23
24 namespace boost {
25 namespace intrusive {
26
27 struct algo_pred_equal
28 {
29 template<class T>
operator ()boost::intrusive::algo_pred_equal30 bool operator()(const T &x, const T &y) const
31 { return x == y; }
32 };
33
34 struct algo_pred_less
35 {
36 template<class T>
operator ()boost::intrusive::algo_pred_less37 bool operator()(const T &x, const T &y) const
38 { return x < y; }
39 };
40
41 template<class InputIt1, class InputIt2, class BinaryPredicate>
algo_equal(InputIt1 first1,InputIt1 last1,InputIt2 first2,BinaryPredicate p)42 bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p)
43 {
44 for (; first1 != last1; ++first1, ++first2) {
45 if (!p(*first1, *first2)) {
46 return false;
47 }
48 }
49 return true;
50 }
51
52 template<class InputIt1, class InputIt2>
algo_equal(InputIt1 first1,InputIt1 last1,InputIt2 first2)53 bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2)
54 { return (algo_equal)(first1, last1, first2, algo_pred_equal()); }
55
56 template<class InputIt1, class InputIt2, class BinaryPredicate>
algo_equal(InputIt1 first1,InputIt1 last1,InputIt2 first2,InputIt2 last2,BinaryPredicate pred)57 bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, BinaryPredicate pred)
58 {
59 for (; first1 != last1 && first2 != last2; ++first1, ++first2)
60 if (!pred(*first1, *first2))
61 return false;
62 return first1 == last1 && first2 == last2;
63 }
64
65 template<class InputIt1, class InputIt2>
algo_equal(InputIt1 first1,InputIt1 last1,InputIt2 first2,InputIt2 last2)66 bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2)
67 { return (algo_equal)(first1, last1, first2, last2, algo_pred_equal()); }
68
69 template <class InputIterator1, class InputIterator2, class BinaryPredicate>
algo_lexicographical_compare(InputIterator1 first1,InputIterator1 last1,InputIterator2 first2,InputIterator2 last2,BinaryPredicate pred)70 bool algo_lexicographical_compare (InputIterator1 first1, InputIterator1 last1,
71 InputIterator2 first2, InputIterator2 last2,
72 BinaryPredicate pred)
73 {
74 while (first1 != last1){
75 if (first2 == last2 || *first2 < *first1) return false;
76 else if (pred(*first1, *first2)) return true;
77 ++first1; ++first2;
78 }
79 return (first2 != last2);
80 }
81
82 template <class InputIterator1, class InputIterator2>
algo_lexicographical_compare(InputIterator1 first1,InputIterator1 last1,InputIterator2 first2,InputIterator2 last2)83 bool algo_lexicographical_compare (InputIterator1 first1, InputIterator1 last1,
84 InputIterator2 first2, InputIterator2 last2)
85 { return (algo_lexicographical_compare)(first1, last1, first2, last2, algo_pred_less()); }
86
87 } //namespace intrusive {
88 } //namespace boost {
89
90 #endif //#ifndef BOOST_INTRUSIVE_DETAIL_ALGORITHM_HPP
91