boost_container 0.1.0

Boost C++ library boost_container packaged using Zanbil
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

//////////////////////////////////////////////////////////////////////////////
//
// \(C\) Copyright Benedek Thaler 2015-2016
// \(C\) Copyright Ion Gaztanaga 2019-2020. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// See http://erenon.hu/double_ended for documentation.
//
//////////////////////////////////////////////////////////////////////////////

#ifndef BOOST_CONTAINER_TEST_TEST_UTIL_HPP
#define BOOST_CONTAINER_TEST_TEST_UTIL_HPP

#include "test_elem.hpp"
#include <boost/container/detail/algorithm.hpp> //algo_equal(), algo_lexicographical_compare

// get_range

template <typename DeVector>
void get_range(int fbeg, int fend, int bbeg, int bend, DeVector &c)
{
   c.clear();

   for (int i = fend; i > fbeg ;)
   {
      c.emplace_front(--i);
   }

   for (int i = bbeg; i < bend; ++i)
   {
      c.emplace_back(i);
   }
}

template <typename Container>
void get_range(int count, Container &c)
{
   c.clear();
   c.reserve(static_cast<std::size_t>(count));

   for (int i = 1; i <= count; ++i)
   {
      c.emplace_back(i);
   }
}

template <typename Container>
void get_range(Container &c)
{
   get_range<Container>(1, 13, 13, 25, c);
}

template <typename C1>
void test_equal_range(const C1& a)
{
   BOOST_TEST(a.empty());
}

template <typename Iterator>
void print_range(std::ostream& out, Iterator b, Iterator e)
{
   out << '[';
   bool first = true;

   for (; b != e; ++b)
   {
      if (first) { first = false; }
      else { out << ','; }
      out << *b;
   }
   out << ']';
}

template <typename Range>
void print_range(std::ostream& out, const Range& range)
{
   print_range(out, range.begin(), range.end());
}

template <typename Array, std::size_t N>
void print_range(std::ostream& out, Array (&range)[N])
{
   print_range(out, range, range + N);
}

template <typename C1, typename C2, unsigned N>
void test_equal_range(const C1& a, const C2 (&b)[N])
{
   bool equals = ::boost::container::algo_equal(a.begin(), a.end(), b, b+N);

   BOOST_TEST(equals);

   if (!equals)
   {
      print_range(std::cerr, a);
      std::cerr << "\n";
      print_range(std::cerr, b);
      std::cerr << "\n";
   }
}


template <typename C1, typename C2>
void test_equal_range(const C1& a, const C2&b)
{
   bool equals = boost::container::algo_equal
      (a.begin(), a.end(), b.begin(), b.end());

   BOOST_TEST(equals);

   if (!equals)
   {
      print_range(std::cerr, a);
      std::cerr << "\n";
      print_range(std::cerr, b);
      std::cerr << "\n";
   }
}

#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)

// support initializer_list
template <typename C>
void test_equal_range(const C& a, std::initializer_list<unsigned> il)
{
  typedef typename C::value_type T;
  boost::container::vector<T> b;

  for (auto&& elem : il)
  {
    b.emplace_back((int)elem);
  }

  test_equal_range(a, b);
}

#endif   //#if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)

#endif //BOOST_CONTAINER_TEST_TEST_UTIL_HPP