-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathset.h
72 lines (62 loc) · 1.67 KB
/
set.h
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
// -*- C++ -*-
//
// Set class interface and implementation.
//
// Copyright 1992-2021 Deven T. Corzine <deven@ties.org>
//
// SPDX-License-Identifier: MIT
//
// Check if previously included.
#ifndef _SET_H
#define _SET_H 1
template <class Type> class SetIter;
template <class Type>
class Set {
friend class SetIter<Type>;
private:
List<Type> l;
public:
int Count () { return l.Count(); }
void Reset () { l.Reset(); }
boolean In (Type *ptr);
void Add (Type *ptr);
void Remove(Type *ptr);
Type *First ();
};
template <class Type>
boolean Set<Type>::In(Type *ptr) {
ListIter<Type> i(l);
while (i++) if (i == ptr) return true;
return false;
}
template <class Type>
void Set<Type>::Add(Type *ptr) {
if (!In(ptr)) l.AddTail(ptr);
}
template <class Type>
void Set<Type>::Remove(Type *ptr) {
l.Remove(ptr);
}
template <class Type>
Type *Set<Type>::First() {
return l.First();
}
template <class Type>
class SetIter {
private:
ListIter<Type> iter;
public:
SetIter() { }
SetIter(Set<Type> &s): iter(s.l) { }
SetIter(Set<Type> *s): iter(s->l) { }
SetIter &operator =(Set<Type> &s) { iter = s.l; return *this; }
SetIter &operator =(Set<Type> *s) { iter = s->l; return *this; }
Type *operator ->() { return iter; }
operator Type *() { return iter; }
Type *operator --() { return --iter; }
Type *operator ++() { return ++iter; }
Type *operator --(int) { return iter--; }
Type *operator ++(int) { return iter++; }
void Remove() { iter.Remove(); }
};
#endif // set.h