libstdc++-v3/testsuite/25_algorithms/binary_search/2.cc

   1 // Copyright (C) 2001 Free Software Foundation, Inc.
   2 //
   3 // This file is part of the GNU ISO C++ Library.  This library is free
   4 // software; you can redistribute it and/or modify it under the
   5 // terms of the GNU General Public License as published by the
   6 // Free Software Foundation; either version 2, or (at your option)
   7 // any later version.
   8
   9 // This library is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU General Public License for more details.
  13
  14 // You should have received a copy of the GNU General Public License along
  15 // with this library; see the file COPYING.  If not, write to the Free
  16 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  17 // USA.
  18
  19 // 25.3.3 [lib.alg.binary.search] Binary search algorithms.
  20
  21 #include <algorithm>
  22 #include <testsuite_hooks.h>
  23
  24 bool test __attribute__((unused)) = true;
  25
  26 const int A[] = {1, 2, 3, 3, 3, 5, 8};
  27 const int C[] = {8, 5, 3, 3, 3, 2, 1};
  28 const int N = sizeof(A) / sizeof(int);
  29
  30 // A comparison, equalivalent to std::greater<int> without the
  31 // dependency on <functional>.
  32 struct gt
  33 {
  34     bool
  35     operator()(const int& x, const int& y) const
  36     { return x > y; }
  37 };
  38
  39 // Each test performs general-case, bookend, not-found condition,
  40 // and predicate functional checks.
  41
  42 // 25.3.3.1 lower_bound, with and without comparison predicate
  43 void
  44 test01()
  45 {
  46     using std::lower_bound;
  47
  48     const int first = A[0];
  49     const int last = A[N - 1];
  50
  51     const int* p = lower_bound(A, A + N, 3);
  52     VERIFY(p == A + 2);
  53
  54     const int* q = lower_bound(A, A + N, first);
  55     VERIFY(q == A + 0);
  56
  57     const int* r = lower_bound(A, A + N, last);
  58     VERIFY(r == A + N - 1);
  59
  60     const int* s = lower_bound(A, A + N, 4);
  61     VERIFY(s == A + 5);
  62
  63     const int* t = lower_bound(C, C + N, 3, gt());
  64     VERIFY(t == C + 2);
  65
  66     const int* u = lower_bound(C, C + N, first, gt());
  67     VERIFY(u == C + N - 1);
  68
  69     const int* v = lower_bound(C, C + N, last, gt());
  70     VERIFY(v == C + 0);
  71
  72     const int* w = lower_bound(C, C + N, 4, gt());
  73     VERIFY(w == C + 2);
  74 }
  75
  76 // 25.3.3.2 upper_bound, with and without comparison predicate
  77 void
  78 test02()
  79 {
  80     using std::upper_bound;
  81
  82     const int first = A[0];
  83     const int last = A[N - 1];
  84
  85     const int* p = upper_bound(A, A + N, 3);
  86     VERIFY(p == A + 5);
  87
  88     const int* q = upper_bound(A, A + N, first);
  89     VERIFY(q == A + 1);
  90
  91     const int* r = upper_bound(A, A + N, last);
  92     VERIFY(r == A + N);
  93
  94     const int* s = upper_bound(A, A + N, 4);
  95     VERIFY(s == A + 5);
  96
  97     const int* t = upper_bound(C, C + N, 3, gt());
  98     VERIFY(t == C + 5);
  99
 100     const int* u = upper_bound(C, C + N, first, gt());
 101     VERIFY(u == C + N);
 102
 103     const int* v = upper_bound(C, C + N, last, gt());
 104     VERIFY(v == C + 1);
 105
 106     const int* w = upper_bound(C, C + N, 4, gt());
 107     VERIFY(w == C + 2);
 108 }
 109
 110 // 25.3.3.3 equal_range, with and without comparison predicate
 111 void
 112 test03()
 113 {
 114     using std::equal_range;
 115     typedef std::pair<const int*, const int*> Ipair;
 116
 117     const int first = A[0];
 118     const int last = A[N - 1];
 119
 120     Ipair p = equal_range(A, A + N, 3);
 121     VERIFY(p.first == A + 2);
 122     VERIFY(p.second == A + 5);
 123
 124     Ipair q = equal_range(A, A + N, first);
 125     VERIFY(q.first == A + 0);
 126     VERIFY(q.second == A + 1);
 127
 128     Ipair r = equal_range(A, A + N, last);
 129     VERIFY(r.first == A + N - 1);
 130     VERIFY(r.second == A + N);
 131
 132     Ipair s = equal_range(A, A + N, 4);
 133     VERIFY(s.first == A + 5);
 134     VERIFY(s.second == A + 5);
 135
 136     Ipair t = equal_range(C, C + N, 3, gt());
 137     VERIFY(t.first == C + 2);
 138     VERIFY(t.second == C + 5);
 139
 140     Ipair u = equal_range(C, C + N, first, gt());
 141     VERIFY(u.first == C + N - 1);
 142     VERIFY(u.second == C + N);
 143
 144     Ipair v = equal_range(C, C + N, last, gt());
 145     VERIFY(v.first == C + 0);
 146     VERIFY(v.second == C + 1);
 147
 148     Ipair w = equal_range(C, C + N, 4, gt());
 149     VERIFY(w.first == C + 2);
 150     VERIFY(w.second == C + 2);
 151 }
 152
 153 // 25.3.3.4 binary_search, with and without comparison predicate
 154 void
 155 test04()
 156 {
 157     using std::binary_search;
 158
 159     const int first = A[0];
 160     const int last = A[N - 1];
 161
 162     VERIFY(binary_search(A, A + N, 5));
 163     VERIFY(binary_search(A, A + N, first));
 164     VERIFY(binary_search(A, A + N, last));
 165     VERIFY(!binary_search(A, A + N, 4));
 166
 167     VERIFY(binary_search(C, C + N, 5, gt()));
 168     VERIFY(binary_search(C, C + N, first, gt()));
 169     VERIFY(binary_search(C, C + N, last, gt()));
 170     VERIFY(!binary_search(C, C + N, 4, gt()));
 171 }
 172
 173 int
 174 main()
 175 {
 176   test01();
 177   test02();
 178   test03();
 179   test04();
 180
 181   return 0;
 182 }