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
238
239
240
241
242
243
244
245
246
247
248
|
// This may look like C code, but it is really -*- C++ -*-
/*
Copyright (C) 1988 Free Software Foundation
written by Doug Lea (dl@rocky.oswego.edu)
based on code by Marc Shapiro (shapiro@sor.inria.fr)
This file is part of GNU CC.
GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY. No author or distributor
accepts responsibility to anyone for the consequences of using it
or for whether it serves any particular purpose or works at all,
unless he says so in writing. Refer to the GNU CC General Public
License for full details.
Everyone is granted permission to copy, modify and redistribute
GNU CC, but only under the conditions described in the
GNU CC General Public License. A copy of this license is
supposed to have been given to you along with GNU CC so you
can know your rights and responsibilities. It should be in a
file named COPYING. Among other things, the copyright notice
and this notice must be preserved on all copies.
*/
#ifndef _<T>XPlex_h
#ifdef __GNUG__
#pragma once
#pragma interface
#endif
#define _<T>XPlex_h 1
#include "<T>.Plex.h"
class <T>XPlex: public <T>Plex
{
<T>IChunk* ch; // cached chunk
void make_initial_chunks(int up = 1);
void cache(int idx) const;
void cache(const <T>* p) const;
<T>* dopred(const <T>* p) const;
<T>* dosucc(const <T>* p) const;
void set_cache(const <T>IChunk* t) const; // logically,
// not physically const
public:
<T>XPlex(); // set low = 0;
// fence = 0;
// csize = default
<T>XPlex(int ch_size); // low = 0;
// fence = 0;
// csize = ch_size
<T>XPlex(int lo, // low = lo;
int ch_size); // fence=lo
// csize = ch_size
<T>XPlex(int lo, // low = lo
int hi, // fence = hi+1
const <T&> initval,// fill with initval,
int ch_size = 0); // csize= ch_size
// or fence-lo if 0
<T>XPlex(const <T>XPlex&);
void operator= (const <T>XPlex&);
// virtuals
<T>& high_element ();
<T>& low_element ();
const <T>& high_element () const;
const <T>& low_element () const;
Pix first() const;
Pix last() const;
void prev(Pix& ptr) const;
void next(Pix& ptr) const;
int owns(Pix p) const;
<T>& operator () (Pix p);
const <T>& operator () (Pix p) const;
int low() const;
int high() const;
int valid(int idx) const;
void prev(int& idx) const;
void next(int& x) const;
<T>& operator [] (int index);
const <T>& operator [] (int index) const;
int Pix_to_index(Pix p) const;
Pix index_to_Pix(int idx) const;
int can_add_high() const;
int can_add_low() const;
int full() const;
int add_high(const <T&> elem);
int del_high ();
int add_low (const <T&> elem);
int del_low ();
void fill(const <T&> x);
void fill(const <T&> x, int from, int to);
void clear();
void reverse();
void append(const <T>XPlex& a);
void prepend(const <T>XPlex& a);
int OK () const;
};
#if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES)
inline void <T>XPlex::prev(int& idx) const
{
--idx;
}
inline void <T>XPlex::next(int& idx) const
{
++idx;
}
inline int <T>XPlex::full () const
{
return 0;
}
inline int <T>XPlex::can_add_high() const
{
return 1;
}
inline int <T>XPlex::can_add_low() const
{
return 1;
}
inline int <T>XPlex::valid (int idx) const
{
return idx >= lo && idx < fnc;
}
inline int <T>XPlex::low() const
{
return lo;
}
inline int <T>XPlex::high() const
{
return fnc - 1;
}
inline <T>& <T>XPlex:: operator [] (int idx)
{
if (!ch->actual_index(idx)) cache(idx);
return *(ch->pointer_to(idx));
}
inline const <T>& <T>XPlex:: operator [] (int idx) const
{
if (!ch->actual_index(idx)) cache(idx);
return *((const <T>*)(ch->pointer_to(idx)));
}
inline <T>& <T>XPlex::low_element ()
{
if (empty()) index_error();
return *(hd->pointer_to(lo));
}
inline const <T>& <T>XPlex::low_element () const
{
if (empty()) index_error();
return *((const <T>*)(hd->pointer_to(lo)));
}
inline <T>& <T>XPlex::high_element ()
{
if (empty()) index_error();
return *(tl()->pointer_to(fnc - 1));
}
inline const <T>& <T>XPlex::high_element () const
{
if (empty()) index_error();
return *((const <T>*)(tl()->pointer_to(fnc - 1)));
}
inline int <T>XPlex::Pix_to_index(Pix px) const
{
<T>* p = (<T>*)px;
if (!ch->actual_pointer(p)) cache(p);
return ch->index_of(p);
}
inline Pix <T>XPlex::index_to_Pix(int idx) const
{
if (!ch->actual_index(idx)) cache(idx);
return (Pix)(ch->pointer_to(idx));
}
inline Pix <T>XPlex::first() const
{
return Pix(hd-><T>IChunk::first_pointer());
}
inline Pix <T>XPlex::last() const
{
return Pix(tl()-><T>IChunk::last_pointer());
}
inline void <T>XPlex::prev(Pix& p) const
{
Pix q = Pix(ch-><T>IChunk::pred((<T>*) p));
p = (q == 0)? Pix(dopred((const <T>*) p)) : q;
}
inline void <T>XPlex::next(Pix& p) const
{
Pix q = Pix(ch-><T>IChunk::succ((<T>*) p));
p = (q == 0)? Pix(dosucc((const <T>*)p)) : q;
}
inline <T>& <T>XPlex:: operator () (Pix p)
{
return *((<T>*)p);
}
inline const <T>& <T>XPlex:: operator () (Pix p) const
{
return *((const <T>*)p);
}
inline void <T>XPlex::set_cache(const <T>IChunk* t) const
{
((<T>XPlex*)(this))->ch = (<T>IChunk*)t;
}
#endif
#endif
|
