blob: 596fa8847ad8de0306d7fee6bf146309674ef47f (
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
|
// 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 the GNU C++ Library. This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version. This library is distributed in the hope
that it will be useful, but WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the GNU Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifdef __GNUG__
#pragma implementation
#endif
#include "<T>.XPSet.h"
int <T>XPSet::OK()
{
int v = p.OK();
v &= count == p.length();
if (!v) error("invariant failure");
return v;
}
Pix <T>XPSet::seek(<T&> item)
{
for (int i = p.low(); i < p.fence(); p.next(i))
if (<T>EQ(p[i],item)) return p.index_to_Pix(i);
return 0;
}
Pix <T>XPSet::add(<T&> item)
{
Pix i = seek(item);
if (i == 0)
{
++count;
i = p.index_to_Pix(p.add_high(item));
}
return i;
}
void <T>XPSet::del(<T&> item)
{
for (int i = p.low(); i < p.fence(); p.next(i))
{
if (<T>EQ(p[i], item))
{
--count;
p[i] = p.low_element();
p.del_low();
return;
}
}
}
|
