File: copy.pass.cpp

package info (click to toggle)
libpmemobj-cpp 1.12-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 8,388 kB
  • sloc: cpp: 136,076; sh: 1,022; perl: 381; ansic: 163; makefile: 13
file content (156 lines) | stat: -rw-r--r-- 4,335 bytes parent folder | download
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
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// Copyright 2020, Intel Corporation
//
// Modified to test pmem::obj containers
//

// <map>

// class map

// map(const map& m);

#include "map_wrapper.hpp"
#include "unittest.hpp"

#include <libpmemobj++/make_persistent.hpp>
#include <libpmemobj++/persistent_ptr.hpp>
#include <libpmemobj++/pool.hpp>
#include <libpmemobj++/transaction.hpp>

namespace nvobj = pmem::obj;
namespace nvobjex = pmem::obj::experimental;

using CM = container_t<int, double>;

struct root {
	nvobj::persistent_ptr<CM> s;
};

int
run(pmem::obj::pool<root> &pop)
{
#ifdef XXX // XXX: Implement test_compare and test_allocator classes
	{
		typedef std::pair<const int, double> V;
		V ar[] = {
			V(1, 1), V(1, 1.5), V(1, 2),   V(2, 1), V(2, 1.5),
			V(2, 2), V(3, 1),   V(3, 1.5), V(3, 2),
		};
		typedef test_compare<std::less<int>> C;
		typedef test_allocator<V> A;
		std::map<int, double, C, A> mo(
			ar, ar + sizeof(ar) / sizeof(ar[0]), C(5), A(7));
		std::map<int, double, C, A> m = mo;
		UT_ASSERT(m.get_allocator() == A(7));
		UT_ASSERT(m.key_comp() == C(5));
		UT_ASSERT(m.size() == 3);
		UT_ASSERT(distance(m.begin(), m.end()) == 3);
		UT_ASSERT(*m.begin() == V(1, 1));
		UT_ASSERT(*next(m.begin()) == V(2, 1));
		UT_ASSERT(*next(m.begin(), 2) == V(3, 1));

		UT_ASSERT(mo.get_allocator() == A(7));
		UT_ASSERT(mo.key_comp() == C(5));
		UT_ASSERT(mo.size() == 3);
		UT_ASSERT(distance(mo.begin(), mo.end()) == 3);
		UT_ASSERT(*mo.begin() == V(1, 1));
		UT_ASSERT(*next(mo.begin()) == V(2, 1));
		UT_ASSERT(*next(mo.begin(), 2) == V(3, 1));
	}
#endif
#ifdef XXX // XXX: Implement min_allocator and other_allocator class
	{
		typedef std::pair<const int, double> V;
		V ar[] = {
			V(1, 1), V(1, 1.5), V(1, 2),   V(2, 1), V(2, 1.5),
			V(2, 2), V(3, 1),   V(3, 1.5), V(3, 2),
		};
		typedef test_compare<std::less<int>> C;
		typedef other_allocator<V> A;
		std::map<int, double, C, A> mo(
			ar, ar + sizeof(ar) / sizeof(ar[0]), C(5), A(7));
		std::map<int, double, C, A> m = mo;
		UT_ASSERT(m.get_allocator() == A(-2));
		UT_ASSERT(m.key_comp() == C(5));
		UT_ASSERT(m.size() == 3);
		UT_ASSERT(distance(m.begin(), m.end()) == 3);
		UT_ASSERT(*m.begin() == V(1, 1));
		UT_ASSERT(*next(m.begin()) == V(2, 1));
		UT_ASSERT(*next(m.begin(), 2) == V(3, 1));

		UT_ASSERT(mo.get_allocator() == A(7));
		UT_ASSERT(mo.key_comp() == C(5));
		UT_ASSERT(mo.size() == 3);
		UT_ASSERT(distance(mo.begin(), mo.end()) == 3);
		UT_ASSERT(*mo.begin() == V(1, 1));
		UT_ASSERT(*next(mo.begin()) == V(2, 1));
		UT_ASSERT(*next(mo.begin(), 2) == V(3, 1));
	}
	{
		typedef std::pair<const int, double> V;
		V ar[] = {
			V(1, 1), V(1, 1.5), V(1, 2),   V(2, 1), V(2, 1.5),
			V(2, 2), V(3, 1),   V(3, 1.5), V(3, 2),
		};
		typedef test_compare<std::less<int>> C;
		typedef min_allocator<V> A;
		std::map<int, double, C, A> mo(
			ar, ar + sizeof(ar) / sizeof(ar[0]), C(5), A());
		std::map<int, double, C, A> m = mo;
		UT_ASSERT(m.get_allocator() == A());
		UT_ASSERT(m.key_comp() == C(5));
		UT_ASSERT(m.size() == 3);
		UT_ASSERT(distance(m.begin(), m.end()) == 3);
		UT_ASSERT(*m.begin() == V(1, 1));
		UT_ASSERT(*next(m.begin()) == V(2, 1));
		UT_ASSERT(*next(m.begin(), 2) == V(3, 1));

		UT_ASSERT(mo.get_allocator() == A());
		UT_ASSERT(mo.key_comp() == C(5));
		UT_ASSERT(mo.size() == 3);
		UT_ASSERT(distance(mo.begin(), mo.end()) == 3);
		UT_ASSERT(*mo.begin() == V(1, 1));
		UT_ASSERT(*next(mo.begin()) == V(2, 1));
		UT_ASSERT(*next(mo.begin(), 2) == V(3, 1));
	}
#endif

	return 0;
}

static void
test(int argc, char *argv[])
{
	if (argc != 2)
		UT_FATAL("usage: %s file-name", argv[0]);

	const char *path = argv[1];

	pmem::obj::pool<root> pop;
	try {
		pop = pmem::obj::pool<root>::create(
			path, "copy.pass", PMEMOBJ_MIN_POOL, S_IWUSR | S_IRUSR);
	} catch (...) {
		UT_FATAL("!pmemobj_create: %s", path);
	}
	try {
		run(pop);
		pop.close();
	} catch (std::exception &e) {
		UT_FATALexc(e);
	}
}

int
main(int argc, char *argv[])
{
	return run_test([&] { test(argc, argv); });
}