blob: b2c08cea002cc079bb58458519d4c0fe57ed8934 (
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
81
82
83
84
85
86
87
88
|
// 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)
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>Set_h
#ifdef __GNUG__
#pragma once
#pragma interface
#endif
#define _<T>Set_h 1
#include <Pix.h>
#include "<T>.defs.h"
class <T>Set
{
protected:
int count;
public:
virtual ~<T>Set();
int length(); // current number of items
int empty();
virtual Pix add(<T&> item) = 0; // add item; return Pix
virtual void del(<T&> item) = 0; // delete item
virtual int contains(<T&> item); // is item in set?
virtual void clear(); // delete all items
virtual Pix first() = 0; // Pix of first item or 0
virtual void next(Pix& i) = 0; // advance to next or 0
virtual <T>& operator () (Pix i) = 0; // access item at i
virtual int owns(Pix i); // is i a valid Pix ?
virtual Pix seek(<T&> item); // Pix of item
void operator |= (<T>Set& b); // add all items in b
void operator -= (<T>Set& b); // delete items also in b
void operator &= (<T>Set& b); // delete items not in b
int operator == (<T>Set& b);
int operator != (<T>Set& b);
int operator <= (<T>Set& b);
void error(const char* msg);
virtual int OK() = 0; // rep invariant
};
#if defined(__OPTIMIZE__) || defined(USE_LIBGXX_INLINES)
inline <T>Set::~<T>Set() {}
inline int <T>Set::length()
{
return count;
}
inline int <T>Set::empty()
{
return count == 0;
}
#endif
#endif
|
