blob: f1914021404d9e5cdedc13410a7dbd6adeef322c (
plain)
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
|
// This may look like C code, but it is really -*- C++ -*-
/*
a little test of Obstacks
Thu Feb 18 11:16:28 1988 Doug Lea (dl at rocky.oswego.edu)
*/
#include <assert.h>
#define tassert(ex) {if ((ex)) cerr << #ex << "\n"; \
else _assert(#ex, __FILE__,__LINE__); }
#include <stream.h>
#include <Obstack.h>
#include <stddef.h>
#include <ctype.h>
int
main()
{
char* s[10000];
int n = 0;
int got_one = 0;
Obstack os;
char c;
s[n++] = (char *)os.copy("\nunique words:");
assert(os.OK());
assert(os.contains(s[0]));
cout << "enter anything at all, end with an EOF(^D)\n";
while (cin.good() && n < 10000)
{
if (cin.get(c) && isalnum(c))
{
got_one = 1;
os.grow(c);
}
else if (got_one)
{
char* current = (char *)os.finish(0);
for (int i = 0; i < n; ++i) // stupid, but this is only a test.
{
if (strcmp(s[i], current) == 0)
{
os.free(current);
current = 0;
break;
}
}
if (current != 0)
s[n++] = current;
got_one = 0;
}
}
assert(os.OK());
cout << s[0] << "\n";
for (int i = n - 1; i > 0; -- i)
{
assert(os.contains(s[i]));
cout << s[i] << "\n";
os.free(s[i]);
}
assert(os.OK());
assert(os.contains(s[0]));
cout << "\n\nObstack vars:\n";
cout << "alignment_mask = " << os.alignment_mask() << "\n";
cout << "chunk_size = " << os.chunk_size() << "\n";
cout << "size = " << os.size() << "\n";
cout << "room + chunk overhead = " << os.room() + 2*sizeof (char*) << "\n";
cout << "\nend of test\n";
return 0;
}
|
