line |
stmt |
bran |
cond |
sub |
pod |
time |
code |
1
|
|
|
|
|
|
|
package List::Util::Superpositions; |
2
|
|
|
|
|
|
|
|
3
|
12
|
|
|
12
|
|
118061
|
use warnings; |
|
12
|
|
|
|
|
29
|
|
|
12
|
|
|
|
|
411
|
|
4
|
12
|
|
|
12
|
|
259
|
use strict; |
|
12
|
|
|
|
|
22
|
|
|
12
|
|
|
|
|
493
|
|
5
|
|
|
|
|
|
|
|
6
|
12
|
|
|
12
|
|
62
|
use List::Util qw(first max maxstr min minstr reduce shuffle sum); |
|
12
|
|
|
|
|
25
|
|
|
12
|
|
|
|
|
2187
|
|
7
|
12
|
|
|
12
|
|
14998
|
use Quantum::Superpositions qw(any all); |
|
12
|
|
|
|
|
478894
|
|
|
12
|
|
|
|
|
89
|
|
8
|
|
|
|
|
|
|
|
9
|
12
|
|
|
12
|
|
1346
|
use base qw( List::Util Quantum::Superpositions ); |
|
12
|
|
|
|
|
25
|
|
|
12
|
|
|
|
|
1623
|
|
10
|
12
|
|
|
12
|
|
68
|
use vars qw( @EXPORT @EXPORT_OK ); |
|
12
|
|
|
|
|
316
|
|
|
12
|
|
|
|
|
745
|
|
11
|
|
|
|
|
|
|
|
12
|
12
|
|
|
12
|
|
12407
|
use Exporter::Lite; |
|
12
|
|
|
|
|
10125
|
|
|
12
|
|
|
|
|
84
|
|
13
|
|
|
|
|
|
|
@EXPORT = qw(); |
14
|
|
|
|
|
|
|
@EXPORT_OK = qw(any all first max maxstr min minstr reduce shuffle sum); |
15
|
|
|
|
|
|
|
|
16
|
|
|
|
|
|
|
=head1 NAME |
17
|
|
|
|
|
|
|
|
18
|
|
|
|
|
|
|
List::Util::Superpositions - Provides 'any' and 'all' for lists |
19
|
|
|
|
|
|
|
|
20
|
|
|
|
|
|
|
=head1 Version |
21
|
|
|
|
|
|
|
|
22
|
|
|
|
|
|
|
Version 1.2 |
23
|
|
|
|
|
|
|
|
24
|
|
|
|
|
|
|
=cut |
25
|
|
|
|
|
|
|
|
26
|
|
|
|
|
|
|
our $VERSION = '1.2'; |
27
|
|
|
|
|
|
|
|
28
|
|
|
|
|
|
|
=head1 Synopsis |
29
|
|
|
|
|
|
|
|
30
|
|
|
|
|
|
|
This module extends the methods provided by List::Util to offer the |
31
|
|
|
|
|
|
|
C and C operators from L as part |
32
|
|
|
|
|
|
|
of the List::Util feature set. |
33
|
|
|
|
|
|
|
|
34
|
|
|
|
|
|
|
use List::Util::Superpositions; |
35
|
|
|
|
|
|
|
|
36
|
|
|
|
|
|
|
my $foo = List::Util::Superpositions->new(); |
37
|
|
|
|
|
|
|
... |
38
|
|
|
|
|
|
|
|
39
|
|
|
|
|
|
|
=head1 Exports & Inheritances |
40
|
|
|
|
|
|
|
|
41
|
|
|
|
|
|
|
=head2 Quantum::Superpositions |
42
|
|
|
|
|
|
|
|
43
|
|
|
|
|
|
|
=over 4 |
44
|
|
|
|
|
|
|
|
45
|
|
|
|
|
|
|
=item * any |
46
|
|
|
|
|
|
|
|
47
|
|
|
|
|
|
|
=item * all |
48
|
|
|
|
|
|
|
|
49
|
|
|
|
|
|
|
=back |
50
|
|
|
|
|
|
|
|
51
|
|
|
|
|
|
|
=head2 List::Util |
52
|
|
|
|
|
|
|
|
53
|
|
|
|
|
|
|
=over 4 |
54
|
|
|
|
|
|
|
|
55
|
|
|
|
|
|
|
=item * first |
56
|
|
|
|
|
|
|
|
57
|
|
|
|
|
|
|
=item * max |
58
|
|
|
|
|
|
|
|
59
|
|
|
|
|
|
|
=item * maxstr |
60
|
|
|
|
|
|
|
|
61
|
|
|
|
|
|
|
=item * min |
62
|
|
|
|
|
|
|
|
63
|
|
|
|
|
|
|
=item * minstr |
64
|
|
|
|
|
|
|
|
65
|
|
|
|
|
|
|
=item * reduce |
66
|
|
|
|
|
|
|
|
67
|
|
|
|
|
|
|
=item * shuffle |
68
|
|
|
|
|
|
|
|
69
|
|
|
|
|
|
|
=item * sum |
70
|
|
|
|
|
|
|
|
71
|
|
|
|
|
|
|
=back |
72
|
|
|
|
|
|
|
|
73
|
|
|
|
|
|
|
=head1 Author |
74
|
|
|
|
|
|
|
|
75
|
|
|
|
|
|
|
Richard Soderberg, C<< >> |
76
|
|
|
|
|
|
|
|
77
|
|
|
|
|
|
|
=head1 Story |
78
|
|
|
|
|
|
|
|
79
|
|
|
|
|
|
|
It seemed handy to link L into L, after |
80
|
|
|
|
|
|
|
a discussion in IRC triggered the thought. I'm reasonably sure I didn't |
81
|
|
|
|
|
|
|
cover all the possible List::Util exports, and there's got to be a more |
82
|
|
|
|
|
|
|
generic way to do it -- perhaps using @EXPORT_OK. |
83
|
|
|
|
|
|
|
|
84
|
|
|
|
|
|
|
=head1 Bugs |
85
|
|
|
|
|
|
|
|
86
|
|
|
|
|
|
|
Please report any bugs or feature requests to |
87
|
|
|
|
|
|
|
C, or through the web interface at |
88
|
|
|
|
|
|
|
L. I will be notified, and then you'll automatically |
89
|
|
|
|
|
|
|
be notified of progress on your bug as I make changes. |
90
|
|
|
|
|
|
|
|
91
|
|
|
|
|
|
|
=head1 Copyright & License |
92
|
|
|
|
|
|
|
|
93
|
|
|
|
|
|
|
Copyright 2004, 2008 Richard Soderberg, All Rights Reserved. |
94
|
|
|
|
|
|
|
|
95
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify it |
96
|
|
|
|
|
|
|
under the same terms as Perl itself. |
97
|
|
|
|
|
|
|
|
98
|
|
|
|
|
|
|
=cut |
99
|
|
|
|
|
|
|
|
100
|
|
|
|
|
|
|
1; # End of List::Util::Superpositions |