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
|
// Copyright (C) 2010 David Sugar, Tycho Softworks.
//
// 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_NAMESPACE;
static unsigned reused = 0;
class myobject : public ReusableObject
{
public:
unsigned count;
myobject()
{count = ++reused;};
};
static mempager pool;
static paged_reuse<myobject> myobjects(&pool, 100);
static queueof<myobject> mycache(&pool, 10);
extern "C" int main()
{
unsigned i;
myobject *x;
for(i = 0; i < 10; ++i) {
x = myobjects.create();
mycache.post(x);
}
assert(x->count == 10);
for(i = 0; i < 3; ++i) {
x = mycache.lifo();
assert(x != NULL);
}
assert(x->count == 8);
init<myobject>(x);
assert(x->count == 11);
for(i = 0; i < 3; ++i) {
x = mycache.lifo();
assert(x != NULL);
myobjects.release(x);
}
x = init<myobject>(NULL);
assert(x == NULL);
assert(reused == 11);
return 0;
}
|
