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
|
// Copyright (C) 2006-2014 David Sugar, Tycho Softworks.
// Copyright (C) 2015-2020 Cherokees of Idaho.
//
// This file is part of GNU uCommon C++.
//
// GNU uCommon C++ is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published
// by the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// GNU uCommon C++ is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with GNU uCommon C++. If not, see <http://www.gnu.org/licenses/>.
#ifndef DEBUG
#define DEBUG
#endif
#include <ucommon/ucommon.h>
#include <stdio.h>
using namespace ucommon;
typedef linked_value<int,OrderedObject> ints;
static OrderedIndex list;
class member : public DLinkedObject
{
public:
inline member(unsigned v) : DLinkedObject() {value = v;}
unsigned value;
};
extern "C" int main()
{
linked_pointer<ints> ptr;
unsigned count = 0;
// Since value templates pass by reference, we must have referencable
// objects or variables. This avoids passing values by duplicating
// objects onto the stack frame, though it causes problems for built-in
// types...
int xv = 3, xn = 5;
ints v1(&list, xv);
ints v2(&list);
v2 = xn;
ptr = &list;
while(ptr) {
switch(++count)
{
case 1:
assert(ptr->value == 3);
break;
case 2:
assert(ptr->value == 5);
}
++ptr;
}
assert(count == 2);
member ov1 = 1, ov2 = 2, ov3 = 3;
assert(ov2.value == 2);
return 0;
}
|
