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
|
//
// Copyright (c) 2023 Klemens Morgenstern (klemens.morgenstern@gmx.net)
//
// 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)
//
#include <boost/cobalt/detail/monotonic_resource.hpp>
#include <boost/test/unit_test.hpp>
BOOST_AUTO_TEST_SUITE(monotonic_resource);
BOOST_AUTO_TEST_CASE(basic)
{
char buf[1024];
boost::cobalt::detail::monotonic_resource res{buf, sizeof(buf)};
{
std::vector<int, boost::cobalt::detail::monotonic_allocator<int>> vec{};
for (int i = 0u; i < 4000; i++)
vec.push_back(i);
}
{
std::vector<int, boost::cobalt::detail::monotonic_allocator<int>> vec{&res};
for (int i = 0u; i < 4000; i++)
vec.push_back(i);
}
}
BOOST_AUTO_TEST_CASE(too_small)
{
char buf[1];
boost::cobalt::detail::monotonic_resource res{buf, sizeof(buf)};
{
std::vector<int, boost::cobalt::detail::monotonic_allocator<int>> vec{};
for (int i = 0u; i < 4000; i++)
vec.push_back(i);
}
{
std::vector<int, boost::cobalt::detail::monotonic_allocator<int>> vec{&res};
for (int i = 0u; i < 4000; i++)
vec.push_back(i);
}
}
BOOST_AUTO_TEST_CASE(no_buf)
{
boost::cobalt::detail::monotonic_resource res;
{
std::vector<int, boost::cobalt::detail::monotonic_allocator<int>> vec{};
for (int i = 0u; i < 4000; i++)
vec.push_back(i);
}
{
std::vector<int, boost::cobalt::detail::monotonic_allocator<int>> vec{&res};
for (int i = 0u; i < 4000; i++)
vec.push_back(i);
}
}
BOOST_AUTO_TEST_SUITE_END();
|
