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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
|
/*
flext - C++ layer for Max/MSP and pd (pure data) externals
Copyright (c) 2001-2005 Thomas Grill (gr@grrrr.org)
For information on usage and redistribution, and for a DISCLAIMER OF ALL
WARRANTIES, see the file, "license.txt," in this distribution.
*/
/*! \file flmap.h
\brief special map class (faster and less memory-consuming than std::map)
*/
#ifndef __FLMAP_H
#define __FLMAP_H
#include "flprefix.h"
/*! \defgroup FLEXT_SUPPORT Flext support classes
@{
*/
class FLEXT_SHARE TableAnyMap
{
protected:
virtual TableAnyMap *_newmap(TableAnyMap *parent) = 0;
virtual void _delmap(TableAnyMap *map) = 0;
struct Data {
void operator()(size_t k,void *v) { key = k,value = v; }
void operator =(void *v) { value = v; }
size_t key;
void *value;
};
TableAnyMap(TableAnyMap *p,Data *dt)
: data(dt)
, parent(p),left(0),right(0)
, n(0)
{}
virtual ~TableAnyMap();
#if 0 // set 1 for asserting the map structure (very cpu-intensive!)
void check(int tsize) { if(n) _check(tsize); }
#else
void check(int tsize) {}
#endif
void *insert(int tsize,size_t k,void *t)
{
void *r;
if(n)
r = _set(tsize,k,t);
else {
data[n++](k,t);
r = 0;
}
check(tsize);
return r;
}
void *find(int tsize,size_t k) const { return n?_find(tsize,k):0; }
void *remove(int tsize,size_t k)
{
void *r = n?_remove(tsize,k):0;
check(tsize);
return r;
}
virtual void clear();
class FLEXT_SHARE iterator
{
public:
iterator(): map(0) {}
iterator(const TableAnyMap &m): map(&m),ix(0) { leftmost(); }
iterator(iterator &it): map(it.map),ix(it.ix) {}
iterator &operator =(const iterator &it) { map = it.map,ix = it.ix; return *this; }
operator bool() const { return map && ix < map->n; }
// no checking here!
void *data() const { return map->data[ix].value; }
size_t key() const { return map->data[ix].key; }
iterator &operator ++() { forward(); return *this; }
protected:
void leftmost()
{
// search smallest branch (go left as far as possible)
const TableAnyMap *nmap;
while((nmap = map->left) != 0) map = nmap;
}
void forward();
// pointers to map and index within
const TableAnyMap *map;
int ix;
};
private:
void _init(size_t k,void *t) { data[0](k,t); n = 1; }
void *_toleft(int tsize,size_t k,void *t)
{
if(left)
return left->_set(tsize,k,t);
else {
(left = _newmap(this))->_init(k,t);
return 0;
}
}
void *_toright(int tsize,size_t k,void *t)
{
if(right)
return right->_set(tsize,k,t);
else {
(right = _newmap(this))->_init(k,t);
return 0;
}
}
void *_toleft(int tsize,Data &v) { return _toleft(tsize,v.key,v.value); }
void *_toright(int tsize,Data &v) { return _toright(tsize,v.key,v.value); }
void *_set(int tsize,size_t k,void *t);
void *_find(int tsize,size_t k) const;
void *_remove(int tsize,size_t k);
#ifdef FLEXT_DEBUG
void _check(int tsize);
#endif
Data *const data;
TableAnyMap *parent,*left,*right;
int n;
//! return index of data item with key <= k
//! \note index can point past the last item!
unsigned int _tryix(size_t k) const
{
unsigned int ix = 0,b = n;
while(ix != b) {
const unsigned int c = (ix+b)>>1;
const size_t dk = data[c].key;
if(k == dk)
return c;
else if(k < dk)
b = c;
else if(ix < c)
ix = c;
else
return b;
}
return ix;
}
void _eraseempty(TableAnyMap *&b)
{
if(!b->n) {
// remove empty branch
_delmap(b); b = 0;
}
}
void _getsmall(Data &dt);
void _getbig(Data &dt);
};
template <typename K,typename T,int N = 8>
class TablePtrMap
: TableAnyMap
{
public:
TablePtrMap(): TableAnyMap(0,slots),count(0) {}
virtual ~TablePtrMap() { clear(); }
virtual void clear() { TableAnyMap::clear(); count = 0; }
inline int size() const { return count; }
inline T insert(K k,T t)
{
void *d = TableAnyMap::insert(N,*(size_t *)&k,(void *)t);
if(!d) ++count;
return (T)d;
}
inline T find(K k) const { return (T)TableAnyMap::find(N,*(size_t *)&k); }
inline T remove(K k)
{
void *d = TableAnyMap::remove(N,*(size_t *)&k);
if(d) --count;
return (T)d;
}
class iterator
: TableAnyMap::iterator
{
public:
iterator() {}
iterator(const TablePtrMap &m): TableAnyMap::iterator(m) {}
iterator(iterator &it): TableAnyMap::iterator(it) {}
inline iterator &operator =(const iterator &it) { TableAnyMap::operator =(it); return *this; }
inline operator bool() const {return TableAnyMap::iterator::operator bool(); }
inline T data() const { return (T)TableAnyMap::iterator::data(); }
inline K key() const { return (K)TableAnyMap::iterator::key(); }
inline iterator &operator ++() { TableAnyMap::iterator::operator ++(); return *this; }
};
protected:
TablePtrMap(TableAnyMap *p): TableAnyMap(p,slots),count(0) {}
virtual TableAnyMap *_newmap(TableAnyMap *parent) { return new TablePtrMap(parent); }
virtual void _delmap(TableAnyMap *map) { delete (TablePtrMap *)map; }
int count;
Data slots[N];
};
//! @} // FLEXT_SUPPORT
#endif
|
