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
|
// 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>.SLBag.h"
int <T>SLBag::OK()
{
int v = p.OK();
v &= count == p.length();
if (!v) error("invariant failure");
return v;
}
Pix <T>SLBag::seek(<T&> item, Pix i)
{
if (i == 0) i = first(); else next(i);
for (; i != 0 && (!(<T>EQ(p(i), item))); p.next(i));
return i;
}
int <T>SLBag::nof(<T&> item)
{
int n = 0;
for (Pix p = first(); p; next(p)) if (<T>EQ((*this)(p), item)) ++n;
return n;
}
void <T>SLBag::del(<T&> item)
{
Pix i = p.first();
if (i == 0)
return;
else if (<T>EQ(p(i), item))
{
--count;
p.del_front();
}
else
{
Pix trail = i;
p.next(i);
while (i != 0)
{
if (<T>EQ(p(i), item))
{
--count;
p.del_after(trail);
return;
}
trail = i;
p.next(i);
}
}
}
void <T>SLBag::remove(<T&> item)
{
Pix i = p.first();
while (i != 0 && <T>EQ(p(i), item))
{
--count;
p.del_front();
i = p.first();
}
if (i != 0)
{
Pix trail = i;
p.next(i);
while (i != 0)
{
if (<T>EQ(p(i), item))
{
--count;
p.del_after(trail);
i = trail;
p.next(i);
}
else
{
trail = i;
p.next(i);
}
}
}
}
|
