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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
|
// { dg-do assemble }
// { dg-options "" }
// GROUPS passed old-abort
const bool FALSE = 0;
const bool TRUE = 1;
class ListDProto {
protected:
class link;
public:
ListDProto();
ListDProto(const ListDProto&);
virtual ~ListDProto();
void operator=(const ListDProto&);
unsigned length() const;
bool empty() const;
void clear();
void remove_head();
void remove_tail();
class Vix {
public:
Vix();
friend int operator==(void *v, const Vix& x)
{ return v == x.item; }
friend int operator==(const Vix& x, void *v)
{ return v == x.item; }
friend int operator!=(void *v, const Vix& x)
{ return v != x.item; }
friend int operator!=(const Vix& x, void *v)
{ return v != x.item; }
friend int operator==(const Vix& x1, const Vix& x2)
{ return x1.owner == x2.owner && x1.item == x2.item; }
friend int operator!=(const Vix& x1, const Vix& x2)
{ return x1.owner != x2.owner || x1.item != x2.item; }
bool first;
bool last;
protected:
friend class ListDProto;
Vix(const ListDProto *o, link *i);
const ListDProto *owner;
private:
link *item;
};
enum Action { NORMAL, REMOVE_CURRENT };
Vix first() const;
void first(Vix& x) const;
void next(Vix& x) const;
void next(Vix& x, Action a = NORMAL);
Vix last() const;
void last(Vix& x) const;
void prev(Vix& x) const;
void prev(Vix& x, Action a = NORMAL);
protected:
struct link {
link *next;
link *prev;
link(link *n = 0, link *p = 0);
virtual ~link();
private:
link(const link&);
void operator=(const link&);
};
unsigned count;
link *list_head;
link *list_tail;
virtual link *copy_item(link *old_item) const = 0;
void prepend(link *item);
void append(link *item);
void prepend(const ListDProto& proto);
void append(const ListDProto& proto);
void remove(link *item);
link *ref(const Vix&) const;
};
template<class T>
class ListD: public ListDProto {
public:
void prepend(const T& item);
void append(const T& item);
const T& head() const;
T& head();
void head(T& fill) const;
void remove_head()
{ ListDProto::remove_head(); }
void remove_head(T& fill);
const T& tail() const;
T& tail();
void tail(T& fill) const;
void remove_tail()
{ ListDProto::remove_tail(); }
void remove_tail(T& fill);
class Vix: public ListDProto::Vix {
public:
Vix(): ListDProto::Vix()
{ }
protected:
friend class ListD<T>;
Vix(const ListDProto::Vix& x): ListDProto::Vix(x)
{ }
};
Vix first() const
{ return ListDProto::first(); };
void first(Vix& x) const
{ ListDProto::first(x); };
void next(Vix& x, ListDProto::Action a = NORMAL) const
{ ListDProto::next(x, a); }// { dg-error "" } .*// ERROR - .*
Vix last() const
{ return ListDProto::last(); }
void last(Vix& x) const
{ return ListDProto::last(x); }
void prev(Vix& x, ListDProto::Action a = NORMAL) const
{ return ListDProto::prev(x, a); }
protected:
struct link_item: public ListDProto::link {
T item;
link_item(const T& i): link(0, 0), item(i)
{ }
private:
link_item(const link_item&);
void operator=(const link_item&);
};
public:
T& operator()(const Vix& x)
{ link_item *li = (link_item *) ref(x);
return li->item; }
const T& operator()(const Vix& x) const
{ link_item *li = (link_item *) ref(x);
return li->item; }
private:
ListDProto::link *copy_item(ListDProto::link *old_item) const;
};
template<class T>
class SetLD: private ListD<T> {
public:
SetLD();
SetLD(const ListD<T>&);
void add(const T& item);
void add(const ListD<T>& other);
void add(const SetLD<T>& other);
void remove(const T& item);
bool contains(const T& item) const;
ListD<T>::length;
ListD<T>::empty;
ListD<T>::clear;
typedef typename ListD<T>::Vix Vix;
ListD<T>::first;
ListD<T>::next;
ListD<T>::operator();
using ListD<T>::NORMAL;
using ListD<T>::REMOVE_CURRENT;
};
extern "C" {
extern void __eprintf (const char *, const char *, unsigned, const char *);
}
extern "C" {
extern void __eprintf (const char *, const char *, unsigned, const char *);
}
template<class T>
void
ListD<T>::prepend(const T& item)
{
link *newl = new link_item(item);
ListDProto::prepend(newl);
}
template<class T>
void
ListD<T>::append(const T& item)
{
link *newl = new link_item(item);
ListDProto::append(newl);
}
template<class T>
const T&
ListD<T>::head() const
{
((void) (( 0 != list_head ) ? 0 : (__eprintf ("%s:%u: failed assertion `%s'\n", "/home/wbaker/work/include/templates/ListD.body.h" , 50 , "0 != list_head" ), 0) )) ;
link_item *h = (link_item *) list_head;
return h->item;
}
template<class T>
T&
ListD<T>::head()
{
((void) (( 0 != list_head ) ? 0 : (__eprintf ("%s:%u: failed assertion `%s'\n", "/home/wbaker/work/include/templates/ListD.body.h" , 59 , "0 != list_head" ), 0) )) ;
link_item *h = (link_item *) list_head;
return h->item;
}
template<class T>
void
ListD<T>::head(T& fill) const
{
((void) (( 0 != list_head ) ? 0 : (__eprintf ("%s:%u: failed assertion `%s'\n", "/home/wbaker/work/include/templates/ListD.body.h" , 68 , "0 != list_head" ), 0) )) ;
link_item *h = (link_item *) list_head;
fill = h->item;
}
template<class T>
void
ListD<T>::remove_head(T& fill)
{
head(fill);
remove_head();
}
template<class T>
const T&
ListD<T>::tail() const
{
((void) (( 0 != list_tail ) ? 0 : (__eprintf ("%s:%u: failed assertion `%s'\n", "/home/wbaker/work/include/templates/ListD.body.h" , 85 , "0 != list_tail" ), 0) )) ;
link_item *h = (link_item *) list_tail;
return h->item;
}
template<class T>
T&
ListD<T>::tail()
{
((void) (( 0 != list_tail ) ? 0 : (__eprintf ("%s:%u: failed assertion `%s'\n", "/home/wbaker/work/include/templates/ListD.body.h" , 94 , "0 != list_tail" ), 0) )) ;
link_item *h = (link_item *) list_tail;
return h->item;
}
template<class T>
void
ListD<T>::tail(T& fill) const
{
((void) (( 0 != list_tail ) ? 0 : (__eprintf ("%s:%u: failed assertion `%s'\n", "/home/wbaker/work/include/templates/ListD.body.h" , 103 , "0 != list_tail" ), 0) )) ;
link_item *h = (link_item *) list_tail;
fill = h->item;
}
template<class T>
void
ListD<T>::remove_tail(T& fill)
{
((void) (( 0 != list_tail ) ? 0 : (__eprintf ("%s:%u: failed assertion `%s'\n", "/home/wbaker/work/include/templates/ListD.body.h" , 112 , "0 != list_tail" ), 0) )) ;
link_item *h = (link_item *) list_tail;
fill = h->item;
}
template<class T>
ListDProto::link *
ListD<T>::copy_item(ListDProto::link *old) const
{
link_item *old_item = (link_item *) old;
link_item *new_item = new link_item(old_item->item);
return new_item;
}
template<class T>
SetLD<T>::SetLD():
ListD<T>()
{ }
template<class T>
SetLD<T>::SetLD(const ListD<T>& other):
ListD<T>(other)
{ }
template<class T>
void
SetLD<T>::add(const T& item)
{
if ( ! contains(item) )
append(item);
}
template<class T>
void
SetLD<T>::add(const ListD<T>& other)
{
typename ListD<T>::Vix x;
for (first(x); 0 != x; next(x))
add(other(x));
}
template<class T>
void
SetLD<T>::add(const SetLD<T>& other)
{
const ListD<T>& lother = other;
add(lother);
}
template<class T>
void
SetLD<T>::remove(const T& item)
{
typename ListD<T>::Action a = this->NORMAL;
Vix x;
for (first(x); 0 != x && this->REMOVE_CURRENT != a; next(x, a))
a = operator()(x) == item ? this->REMOVE_CURRENT: this->NORMAL; // { dg-error "" } .*
// { dg-message "candidate" "candidate note" { target *-*-* } 280 }
}
template<class T>
bool
SetLD<T>::contains(const T& item) const
{
Vix x;
for (first(x); 0 != x; next(x)) {
if (operator()(x) == item)// { dg-error "" } .*
// { dg-message "candidate" "candidate note" { target *-*-* } 289 }
return TRUE;
}
return FALSE;
}
template<class T>
int
operator==(const SetLD<T>& a, const SetLD<T>& b) // { dg-message "note" }
{
if (a.length() != b.length())
return FALSE;
typename SetLD<T>::Vix x;
for (a.first(x); 0 != x; a.next(x)) {
if ( ! b.contains(a(x)) )
return FALSE;
}
for (b.first(x); 0 != x; b.next(x)) {
if ( ! a.contains(b(x)) )
return FALSE;
}
return TRUE;
}
template<class T>
int
operator!=(const SetLD<T>& a, const SetLD<T>& b)
{ return ! (a == b); }
template<class T>
int
operator<=(const SetLD<T>& a, const SetLD<T>& b)
{
if (a.length() > b.length())
return FALSE;
typename SetLD<T>::Vix x;
for (x=a.first(); 0 != x; a.next(x)) {
if ( ! b.contains(a(x)) )
return FALSE;
}
return TRUE;
}
template<class T>
int
operator<(const SetLD<T>& a, const SetLD<T>& b)
{
if (a.length() >= b.length())
return FALSE;
return a <= b;
}
template<class T>
int
operator>(const SetLD<T>& a, const SetLD<T>& b)
{ return ! (a <= b); }
template<class T>
int
operator>=(const SetLD<T>& a, const SetLD<T>& b)
{ return ! (a < b); }
class String { };
class IcaseString: public String { };
template <> class SetLD< IcaseString >: public SetLD< String > { public: SetLD (): SetLD< String >() { }; SetLD (const ::ListD< IcaseString >& other): SetLD< String >() { ::ListD< IcaseString >::Vix x; for (other.first(x); 0 != x; other.next(x)) add(other(x)); }; SetLD (const SetLD & other): SetLD< String >(other) { }; const IcaseString & operator()(const Vix& x) const { return ( IcaseString &) SetLD< String >::operator()(x); } }; typedef SetLD< String > SetLD_String_IcaseString_old_tmp99; typedef SetLD< IcaseString > SetLD_String_IcaseString_new_tmp99;
inline int operator== (const SetLD_String_IcaseString_new_tmp99& a, const SetLD_String_IcaseString_new_tmp99& b) // { dg-message "operator==|no known conversion" }
{
const SetLD_String_IcaseString_old_tmp99& oa = a;
const SetLD_String_IcaseString_old_tmp99& ob = b;
return operator== (oa, ob); }
inline int operator!= (const SetLD_String_IcaseString_new_tmp99& a, const SetLD_String_IcaseString_new_tmp99& b)
{
const SetLD_String_IcaseString_old_tmp99& oa = a;
const SetLD_String_IcaseString_old_tmp99& ob = b;
return operator!= (oa, ob); }
inline int operator< (const SetLD_String_IcaseString_new_tmp99& a, const SetLD_String_IcaseString_new_tmp99& b)
{
const SetLD_String_IcaseString_old_tmp99& oa = a;
const SetLD_String_IcaseString_old_tmp99& ob = b;
return operator< (oa, ob); }
inline int operator<= (const SetLD_String_IcaseString_new_tmp99& a, const SetLD_String_IcaseString_new_tmp99& b)
{
const SetLD_String_IcaseString_old_tmp99& oa = a;
const SetLD_String_IcaseString_old_tmp99& ob = b;
return operator<= (oa, ob); }
inline int operator> (const SetLD_String_IcaseString_new_tmp99& a, const SetLD_String_IcaseString_new_tmp99& b)
{
const SetLD_String_IcaseString_old_tmp99& oa = a;
const SetLD_String_IcaseString_old_tmp99& ob = b;
return operator> (oa, ob); }
inline int operator>= (const SetLD_String_IcaseString_new_tmp99& a, const SetLD_String_IcaseString_new_tmp99& b)
{
const SetLD_String_IcaseString_old_tmp99& oa = a;
const SetLD_String_IcaseString_old_tmp99& ob = b;
return operator>= (oa, ob); }
typedef SetLD<IcaseString> SLDiS;
static void
nop(int i)
{
SetLD<IcaseString> x, y;
nop(x == y);
nop(x != y);
nop(x < y);
nop(x <= y);
nop(x > y);
nop(x >= y);
}
template class SetLD<String>;
|
