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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
// file : tests/small-list/driver.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2018 Code Synthesis Ltd
// license : MIT; see accompanying LICENSE file
#include <cassert>
#ifndef __cpp_lib_modules
#include <string>
#include <iostream>
#endif
// Other includes.
#ifdef __cpp_modules
#ifdef __cpp_lib_modules
import std.core;
import std.io;
#endif
import butl.small_list;
#else
#include <libbutl/small-list.mxx>
#endif
using namespace std;
using namespace butl;
// Return true if the data is stored entirely inside l.
//
template <typename T, size_t N>
inline bool
small (const small_list<T, N>& l)
{
// In VC it is always "large" (see note in small_list) so we omit this
// test.
//
#ifndef _MSC_VER
for (const T& x: l)
{
const void* p (&x);
if (p < &l || p >= (&l + 1))
return false;
}
#endif
return true;
}
template <typename T, size_t N>
inline bool
large (const small_list<T, N>& l)
{
#ifndef _MSC_VER
return !small (l);
#else
return true;
#endif
}
int
main ()
{
using list = small_list<string, 1>;
{
list l;
l.push_back ("abc");
assert (l.front () == "abc" && small (l));
l.push_back ("ABC");
assert (l.front () == "abc" && l.back () == "ABC" && large (l));
l.pop_back ();
assert (l.front () == "abc" && small (l));
l.push_back ("ABC");
l.pop_front ();
assert (l.front () == "ABC" && large (l));
l.push_back ("abc");
l.pop_front ();
assert (l.front () == "abc" && small (l));
l.clear ();
l.push_back ("abc");
assert (l.front () == "abc" && small (l));
}
// Copy constructor.
//
{
list s1 ({"abc"}), s2 (s1);
assert (s1 == s2 && small (s2));
list l1 ({"abc", "ABC"}), l2 (l1);
assert (l1 == l2 && large (l2));
}
// Move constructor.
//
{
struct mstring: string // Move-only string.
{
mstring () = default;
explicit mstring (const char* s): string (s) {}
mstring (mstring&&) = default;
mstring& operator= (mstring&&) = default;
mstring (const mstring&) = delete;
mstring& operator= (const mstring&) = delete;
};
using list = small_list<mstring, 1>;
{
list s1;
s1.emplace_back ("abc");
list s2 (move (s1));
assert (s2.front () == "abc" && small (s2));
}
{
list l1;
l1.emplace_back ("abc");
l1.emplace_back ("ABC");
list l2 (move (l1));
assert (l2.front () == "abc" && l2.back () == "ABC" && large (l2));
}
}
// Other constructors.
//
{
const char* sa[] = {"abc"};
const char* la[] = {"abc", "ABC"};
list s (sa, sa + 1);
assert (s.front () == "abc" && small (s));
list l (la, la + 2);
assert (l.front () == "abc" && l.back () == "ABC" && large (l));
}
{
list s (1, "abc");
assert (s.front () == "abc" && small (s));
list l (3, "abc");
assert (l.front () == "abc" && l.back () == "abc" && large (l));
}
{
list s (1);
assert (s.front () == "" && small (s));
list l (3);
assert (l.front () == "" && l.back () == "" && large (l));
}
}
|
