File: 13_subsets.t

package info (click to toggle)
libalgorithm-combinatorics-perl 0.27-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster, sid, stretch
  • size: 216 kB
  • ctags: 36
  • sloc: perl: 399; makefile: 2
file content (76 lines) | stat: -rw-r--r-- 1,349 bytes parent folder | download | duplicates (3)
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
use strict;
use warnings;

use FindBin qw($Bin);
use lib $Bin;

use Test::More qw(no_plan);

use Algorithm::Combinatorics qw(subsets);
use Tester;

my $tester = Tester->__new(\&subsets);

my (@result, @expected);

# ---------------------------------------------------------------------

eval { subsets() };
ok($@, '');

eval { subsets(1) };
ok($@, '');

# ---------------------------------------------------------------------

@expected = ([]);
$tester->__test(\@expected, []);

@expected = ([1, 2], [2], [1], []);
$tester->__test(\@expected, [1, 2]);

# ---------------------------------------------------------------------

@expected = (
    ["foo", "bar", "baz"],
    ["bar", "baz"], 
    ["foo", "baz"],
    ["baz"],
    ["foo", "bar"],
    ["bar"],
    ["foo"],
    [],
);
$tester->__test(\@expected, ["foo", "bar", "baz"]);

# ---------------------------------------------------------------------

@expected = (
    [1, 2, 3, 4],
    [2, 3, 4],
    [1, 3, 4],
    [3, 4],
    [1, 2, 4],
    [2, 4],
    [1, 4],
    [4],
    [1, 2, 3],
    [2, 3],
    [1, 3],
    [3],
    [1, 2],
    [2],
    [1],
    []
);
$tester->__test(\@expected, [1..4]);

# ----------------------------------------------------------------------

my $nsubsets = 0;
my $iter = subsets([1..16]);
while (my $c = $iter->next) {
    ++$nsubsets;
}
is($nsubsets, 65536, "");