/usr/share/devscripts/Devscripts/Set.pm is in devscripts 2.15.3+deb8u1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 128 129 130 131 132 133 | # Copyright Bill Allombert <ballombe@debian.org> 2001.
# Modifications copyright 2002 Julian Gilbey <jdg@debian.org>
# 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, see <https://www.gnu.org/licenses/>.
package Devscripts::Set;
use strict;
BEGIN{
use Exporter ();
use vars qw(@EXPORT @ISA %EXPORT_TAGS);
@EXPORT=qw(SetMinus SetInter SetUnion);
@ISA=qw(Exporter);
%EXPORT_TAGS=();
}
# Several routines to work with arrays whose elements are unique
# (here called sets)
=head1 NAME
Devscripts::Set - Functions for handling sets.
=head1 SYNOPSIS
use Devscripts::Set;
@set=ListToSet(@list);
@setdiff=SetMinus(\@set1,\@set2);
@setinter=SetInter(\@set1,\@set2);
@setunion=SetUnion(\@set1,\@set2);
=head1 DESCRIPTION
ListToSet: Make a set (array with duplicates removed) from a list of
items given by an array.
SetMinus, SetInter, SetUnion: Compute the set theoretic difference,
intersection, union of two sets given as arrays.
=cut
# Transforms a list to a set, removing duplicates
# input: list
# output: set
sub ListToSet (@)
{
my %items;
grep $items{$_}++, @_;
return keys %items;
}
# Compute the set-theoretic difference of two sets.
# input: ref to Set 1, ref to Set 2
# output: set
sub SetMinus ($$)
{
my ($set1,$set2)=@_;
my %items;
grep $items{$_}++, @$set1;
grep $items{$_}--, @$set2;
return grep $items{$_}>0, keys %items;
}
# Compute the set-theoretic intersection of two sets.
# input: ref to Set 1, ref to Set 2
# output: set
sub SetInter ($$)
{
my ($set1,$set2)=@_;
my %items;
grep $items{$_}++, @$set1;
grep $items{$_}++, @$set2;
return grep $items{$_}==2, keys %items;
}
#Compute the set-theoretic union of two sets.
#input: ref to Set 1, ref to Set 2
#output: set
sub SetUnion ($$)
{
my ($set1,$set2)=@_;
my %items;
grep $items{$_}++, @$set1;
grep $items{$_}++, @$set2;
return grep $items{$_}>0, keys %items;
}
1;
=head1 AUTHOR
Bill Allombert <ballombe@debian.org>
=head1 COPYING
Copyright 2001 Bill Allombert <ballombe@debian.org>
Modifications Copyright 2002 Julian Gilbey <jdg@debian.org>
dpkg-depcheck is free software, covered by the GNU General Public License, and
you are welcome to change it and/or distribute copies of it under
certain conditions. There is absolutely no warranty for dpkg-depcheck.
=cut
|