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
|
##############################################################################
# The Faq-O-Matic is Copyright 1997 by Jon Howell, all rights reserved. #
# #
# This program is free software; you can redistribute it and/or #
# modify it under the terms of the GNU General Public License #
# as published by the Free Software Foundation; either version 2 #
# of the License, or (at your option) any later version. #
# #
# This program 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 General Public License for more details. #
# #
# You should have received a copy of the GNU General Public License #
# along with this program; if not, write to the Free Software #
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.#
# #
# Jon Howell can be contacted at: #
# 6211 Sudikoff Lab, Dartmouth College #
# Hanover, NH 03755-3510 #
# jonh@cs.dartmouth.edu #
# #
# An electronic copy of the GPL is available at: #
# http://www.gnu.org/copyleft/gpl.html #
# #
##############################################################################
use strict;
###
### A FAQ::OMatic::Set keeps track of a nonrepeating list of strings,
### such as authors of a part. It can keep the strings in order of insertion,
### if desired.
###
package FAQ::OMatic::Set;
use FAQ::OMatic;
sub new {
my ($class) = shift;
my $keepOrdered = shift() || 0;
my $set = {};
bless $set;
$set->{'Hash'} = {};
$set->{'keepOrdered'} = $keepOrdered;
if ($keepOrdered) {
$set->{'List'} = [];
}
return $set;
}
# insert members of list into this set
sub insert {
my $self = shift;
while (scalar(@_) > 0) {
my $arg = shift;
# TODO debug block, delete
if (not defined $arg) {
my @cl = caller();
die "caller was: <b>".join("/", @cl)."</b>";
}
if (not exists $self->{'Hash'}->{$arg}) { # arg not in set yet
$self->{'Hash'}->{$arg} = 1;
if ($self->{'keepOrdered'}) {
push @{$self->{'List'}}, $arg;
}
}
}
}
sub remove {
my $self = shift;
while (scalar(@_) > 0) {
my $arg = shift;
if ($self->{'Hash'}->{$arg}) {
delete $self->{'Hash'}->{$arg};
if ($self->{'keepOrdered'}) {
my @newList = grep {$_ ne $arg} @{$self->{'List'}};
$self->{'List'} = \@newList;
}
}
}
}
sub getList {
my $self = shift;
if ($self->{'keepOrdered'}) {
return @{$self->{'List'}};
} else {
return sort keys %{$self->{'Hash'}};
}
}
# return "deep copy" of myself
sub clone {
my $self = shift;
my $newself = new FAQ::OMatic::Set($self->{'keepOrdered'});
$newself->{'Hash'} = { %{$self->{'Hash'}} };
if ($self->{'keepOrdered'}) {
$newself->{'List'} = [ @{$self->{'List'}} ];
}
return $newself;
}
sub subtract {
my $self = shift;
my $subtrahend = shift; # (set whose items we remove)
my $difference = $self->clone;
$difference->remove($subtrahend->getList());
return $difference;
}
1;
|
