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
|
// -*- C++ -*-
// Ptable-related definitions, see libgroff/ptable.cc.
#include <assert.h>
#include <string.h>
#ifdef TRADITIONAL_CPP
#define name2(a,b) a/**/b
#else /* not TRADITIONAL_CPP */
#define name2(a,b) name2x(a,b)
#define name2x(a,b) a ## b
#endif /* not TRADITIONAL_CPP */
#define PTABLE(T) name2(T,_ptable)
#define PASSOC(T) name2(T,_passoc)
#define PTABLE_ITERATOR(T) name2(T,_ptable_iterator)
extern unsigned next_ptable_size(unsigned);
extern unsigned long hash_string(const char *);
#define declare_ptable(T) \
\
struct PASSOC(T) { \
char *key; \
T *val; \
PASSOC(T)(); \
}; \
\
struct PTABLE(T); \
\
class PTABLE_ITERATOR(T) { \
PTABLE(T) *p; \
unsigned i; \
public: \
PTABLE_ITERATOR(T)(PTABLE(T) *); \
int next(const char **, T **); \
}; \
\
class PTABLE(T) { \
PASSOC(T) *v; \
unsigned size; \
unsigned used; \
enum { FULL_NUM = 2, FULL_DEN = 3, INITIAL_SIZE = 17 }; \
public: \
PTABLE(T)(); \
~PTABLE(T)(); \
void define(const char *, T *); \
T *lookup(const char *); \
friend class PTABLE_ITERATOR(T); \
};
#define implement_ptable(T) \
\
PASSOC(T)::PASSOC(T)() \
: key(0), val(0) \
{ \
} \
\
PTABLE(T)::PTABLE(T)() \
{ \
v = new PASSOC(T)[size = INITIAL_SIZE]; \
used = 0; \
} \
\
PTABLE(T)::~PTABLE(T)() \
{ \
for (unsigned i = 0; i < size; i++) { \
a_delete v[i].key; \
delete v[i].val; \
} \
a_delete v; \
} \
\
void PTABLE(T)::define(const char *key, T *val) \
{ \
assert(key != 0); \
unsigned long h = hash_string(key); \
unsigned n; \
for (n = unsigned(h % size); \
v[n].key != 0; \
n = (n == 0 ? size - 1 : n - 1)) \
if (strcmp(v[n].key, key) == 0) { \
delete v[n].val; \
v[n].val = val; \
return; \
} \
if (val == 0) \
return; \
if (used*FULL_DEN >= size*FULL_NUM) { \
PASSOC(T) *oldv = v; \
unsigned old_size = size; \
size = next_ptable_size(size); \
v = new PASSOC(T)[size]; \
for (unsigned i = 0; i < old_size; i++) \
if (oldv[i].key != 0) { \
if (oldv[i].val == 0) \
a_delete oldv[i].key; \
else { \
unsigned j; \
for (j = unsigned(hash_string(oldv[i].key) % size); \
v[j].key != 0; \
j = (j == 0 ? size - 1 : j - 1)) \
; \
v[j].key = oldv[i].key; \
v[j].val = oldv[i].val; \
} \
} \
for (n = unsigned(h % size); \
v[n].key != 0; \
n = (n == 0 ? size - 1 : n - 1)) \
; \
a_delete oldv; \
} \
char *temp = new char[strlen(key)+1]; \
strcpy(temp, key); \
v[n].key = temp; \
v[n].val = val; \
used++; \
} \
\
T *PTABLE(T)::lookup(const char *key) \
{ \
assert(key != 0); \
for (unsigned n = unsigned(hash_string(key) % size); \
v[n].key != 0; \
n = (n == 0 ? size - 1 : n - 1)) \
if (strcmp(v[n].key, key) == 0) \
return v[n].val; \
return 0; \
} \
\
PTABLE_ITERATOR(T)::PTABLE_ITERATOR(T)(PTABLE(T) *t) \
: p(t), i(0) \
{ \
} \
\
int PTABLE_ITERATOR(T)::next(const char **keyp, T **valp) \
{ \
unsigned size = p->size; \
PASSOC(T) *v = p->v; \
for (; i < size; i++) \
if (v[i].key != 0) { \
*keyp = v[i].key; \
*valp = v[i].val; \
i++; \
return 1; \
} \
return 0; \
}
|
