/usr/share/perl5/Catmandu/Iterable.pm is in libcatmandu-perl 1.0700-1.
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 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 | package Catmandu::Iterable;
use Catmandu::Sane;
our $VERSION = '1.07';
use Catmandu::Util qw(:is :check);
use Time::HiRes qw(gettimeofday tv_interval);
use Hash::Util::FieldHash qw(fieldhash);
use Role::Tiny;
use namespace::clean;
# delay loading these because of circular dependency
require Catmandu::Iterator;
require Catmandu::ArrayIterator;
requires 'generator';
{
# can't use Moo attribute because of circular dependency
fieldhash my %_generators;
sub next {
my ($self) = @_;
($_generators{$self} ||= $self->generator)->();
}
sub rewind {
my ($self) = @_;
$_generators{$self} = $self->generator;
}
}
sub to_array {
my ($self) = @_;
my $next = $self->generator;
my @a;
my $data;
while (defined($data = $next->())) {
push @a, $data;
}
\@a;
}
sub count {
my ($self) = @_;
my $next = $self->generator;
my $n = 0;
while ($next->()) {
$n++;
}
$n;
}
sub slice {
my ($self, $start, $total) = @_;
$start //= 0;
Catmandu::Iterator->new(
sub {
sub {
if (defined $total) {
$total || return;
}
state $next = $self->generator;
state $data;
while (defined($data = $next->())) {
if ($start > 0) {
$start--;
next;
}
if (defined $total) {
$total--;
}
return $data;
}
return;
}
}
);
}
sub each {
my ($self, $sub) = @_;
my $next = $self->generator;
my $n = 0;
my $data;
while (defined($data = $next->())) {
$sub->($data);
$n++;
}
$n;
}
sub each_until {
my ($self, $sub) = @_;
my $next = $self->generator;
my $n = 0;
my $data;
while (defined($data = $next->())) {
$sub->($data) || last;
$n++;
}
$n;
}
sub tap {
my ($self, $sub) = @_;
Catmandu::Iterator->new(
sub {
sub {
state $next = $self->generator;
state $data;
if (defined($data = $next->())) {
$sub->($data);
return $data;
}
return;
}
}
);
}
sub any {
my ($self, $sub) = @_;
my $next = $self->generator;
my $data;
while (defined($data = $next->())) {
$sub->($data) && return 1;
}
return 0;
}
sub many {
my ($self, $sub) = @_;
my $next = $self->generator;
my $n = 0;
my $data;
while (defined($data = $next->())) {
$sub->($data) && ++$n > 1 && return 1;
}
return 0;
}
sub all {
my ($self, $sub) = @_;
my $next = $self->generator;
my $data;
while (defined($data = $next->())) {
$sub->($data) || return 0;
}
return 1;
}
sub map {
my ($self, $sub) = @_;
Catmandu::Iterator->new(
sub {
sub {
state $next = $self->generator;
$sub->($next->() // return);
}
}
);
}
sub reduce {
my $self = shift;
my $memo_set = @_ > 1;
my $sub = pop;
my $memo = shift;
my $next = $self->generator;
my $data;
while (defined($data = $next->())) {
if ($memo_set) {
$memo = $sub->($memo, $data);
}
else {
$memo = $data;
$memo_set = 1;
}
}
$memo;
}
sub first {
$_[0]->generator->();
}
sub rest {
$_[0]->slice(1);
}
sub take {
$_[0]->slice(0, $_[1]);
}
{
my $to_sub = sub {
my ($arg1, $arg2) = @_;
if (is_string($arg1)) {
if (is_regex_ref($arg2)) {
return sub {
is_hash_ref($_[0]) || return 0;
my $val = $_[0]->{$arg1};
is_value($val) && $val =~ $arg2;
};
}
if (is_array_ref($arg2)) {
return sub {
is_hash_ref($_[0]) || return 0;
is_value(my $val = $_[0]->{$arg1}) || return 0;
for my $v (@$arg2) {
return 1 if $val eq $v;
}
0;
};
}
return sub {
is_hash_ref($_[0]) || return 0;
my $val = $_[0]->{$arg1};
is_value($val) && $val eq $arg2;
};
}
if (is_regex_ref($arg1)) {
return sub {
my $val = $_[0];
is_value($val) && $val =~ $arg1;
};
}
$arg1;
};
sub detect {
my $self = shift;
my $sub = $to_sub->(@_);
my $next = $self->generator;
my $data;
while (defined($data = $next->())) {
$sub->($data) && return $data;
}
return;
}
sub select {
my $self = shift;
my $sub = $to_sub->(@_);
Catmandu::Iterator->new(
sub {
sub {
state $next = $self->generator;
state $data;
while (defined($data = $next->())) {
$sub->($data) && return $data;
}
return;
}
}
);
}
sub grep {goto &select}
sub reject {
my $self = shift;
my $sub = $to_sub->(@_);
Catmandu::Iterator->new(
sub {
sub {
state $next = $self->generator;
state $data;
while (defined($data = $next->())) {
$sub->($data) || return $data;
}
return;
}
}
);
}
};
sub sorted {
my ($self, $cmp) = @_;
if (!defined $cmp) {
Catmandu::ArrayIterator->new([sort @{$self->to_array}]);
}
elsif (ref $cmp) {
Catmandu::ArrayIterator->new(
[sort {$cmp->($a, $b)} @{$self->to_array}]);
}
else {
# TODO: use Schwartzian transform for more complex key
Catmandu::ArrayIterator->new(
[sort {$a->{$cmp} cmp $b->{$cmp}} @{$self->to_array}]);
}
}
sub pluck {
my ($self, $key) = @_;
$self->map(
sub {
$_[0]->{$key};
}
);
}
sub invoke {
my ($self, $method, @args) = @_;
$self->map(
sub {
$_[0]->$method(@args);
}
);
}
sub contains {goto &includes}
sub includes {
my ($self, $data) = @_;
$self->any(
sub {
is_same($data, $_[0]);
}
);
}
sub group {
my ($self, $size) = @_;
Catmandu::Iterator->new(
sub {
sub {
state $next = $self->generator;
my $group = [];
for (my $i = 0; $i < $size; $i++) {
push @$group, $next->() // last;
}
unless (@$group) {
return;
}
Catmandu::ArrayIterator->new($group);
}
}
);
}
sub interleave {
my @iterators = @_;
Catmandu::Iterator->new(
sub {
sub {
state @generators;
state $n = @iterators;
state $i = 0;
while ($n) {
$i = 0 if $i == $n;
my $next = $generators[$i] ||= $iterators[$i]->generator;
if (defined(my $data = $next->())) {
$i++;
return $data;
}
else {
splice @generators, $i, 1;
$n--;
}
}
return;
}
}
);
}
sub max {
my ($self, $sub) = @_;
$self->reduce(
undef,
sub {
my ($memo, $data) = @_;
my $val = defined $sub ? $sub->($data) : $data;
return $val > $memo ? $val : $memo
if is_number($memo) && is_number($val);
return $memo if is_number($memo);
return $val if is_number($val);
return;
}
);
}
sub min {
my ($self, $sub) = @_;
$_[0]->reduce(
undef,
sub {
my ($memo, $data) = @_;
my $val = defined $sub ? $sub->($data) : $data;
return $val < $memo ? $val : $memo
if is_number($memo) && is_number($val);
return $memo if is_number($memo);
return $val if is_number($val);
return;
}
);
}
sub benchmark {
my ($self) = @_;
$self->tap(
sub {
state $n = 0;
state $t = [gettimeofday];
if (++$n % 100 == 0) {
printf STDERR "added %9d (%d/sec)\n", $n,
$n / tv_interval($t);
}
}
);
}
sub format {
my ($self, %opts) = @_;
$opts{header} //= 1;
$opts{col_sep} //= " | ";
my @cols = $opts{cols} ? @{$opts{cols}} : ();
my @col_lengths = map length, @cols;
my $rows = $self->map(
sub {
my $data = $_[0];
my $row = [];
for (my $i = 0; $i < @cols; $i++) {
my $col = $data->{$cols[$i]} // "";
my $len = length $col;
$col_lengths[$i] = $len if $len > $col_lengths[$i];
push @$row, $col;
}
$row;
}
)->to_array;
my @indices = 0 .. @cols - 1;
my $pattern
= join($opts{col_sep}, map {"%-$col_lengths[$_]s"} @indices) . "\n";
if ($opts{header}) {
printf $pattern, @cols;
my $sep = $opts{col_sep};
$sep =~ s/[^|]/-/g;
print join($sep, map {'-' x $col_lengths[$_]} @indices) . "\n";
}
for my $row (@$rows) {
printf $pattern, @$row;
}
}
sub stop_if {
my ($self, $sub) = @_;
Catmandu::Iterator->new(
sub {
sub {
state $next = $self->generator;
my $data = $next->() // return;
$sub->($data) && return;
$data;
}
}
);
}
sub run {
my ($self) = @_;
my $next = $self->generator;
my $run = 0;
while (defined($next->())) {
$run ||= 1;
}
$run;
}
1;
__END__
=pod
=head1 NAME
Catmandu::Iterable - Base class for all iterable Catmandu classes
=head1 SYNOPSIS
# Create an example Iterable using the Catmandu::Importer::Mock class
my $it = Catmandu::Importer::Mock->new(size => 10);
my $array_ref = $it->to_array;
my $num = $it->count;
# Loop functions
$it->each(sub { print shift->{n} });
my $item = $it->first;
$it->rest
->each(sub { print shift->{n} });
$it->slice(3,2)
->each(sub { print shift->{n} });
$it->take(5)
->each(sub { print shift->{n} });
$it->group(5)
->each(sub { printf "group of %d items\n" , shift->count});
$it->tap(\&logme)->tap(\&printme)->tap(\&mailme)
->each(sub { print shift->{n} });
my $titles = $it->pluck('title')->to_array;
# Select and loop
my $item = $it->detect(sub { shift->{n} > 5 });
$it->select(sub { shift->{n} > 5})
->each(sub { print shift->{n} });
$it->reject(sub { shift->{n} > 5})
->each(sub { print shift->{n} });
# Boolean
if ($it->any(sub { shift->{n} > 5}) {
.. at least one n > 5 ..
}
if ($it->many(sub { shift->{n} > 5}) {
.. at least two n > 5 ..
}
if ($it->all(sub { shift->{n} > 5}) {
.. all n > 5 ..
}
# Modify and summary
my $it2 = $it->map(sub { shift->{n} * 2 });
my $sum = $it2->reduce(0,sub {
my ($prev,$this) = @_;
$prev + $this;
});
my $it3 = $it->group(2)->invoke('to_array');
# Calculate maximum of 'n' field
my $max = $it->max(sub {
shift->{n};
});
# Calculate minimum of 'n' field
my $in = $it->min(sub {
shift->{n};
});
=head1 DESCRIPTION
The Catmandu::Iterable class provides many list methods to Iterators such as Importers and
Exporters. Most of the methods are lazy if the underlying datastream supports it. Beware of
idempotence: many iterators contain state information and calls will give different results on
a second invocation.
=head1 METHODS
=head2 to_array
Return all the items in the Iterator as an ARRAY ref.
=head2 count
Return the count of all the items in the Iterator.
=head3 LOOPING
=head2 each(\&callback)
For each item in the Iterator execute the callback function with the item as first argument. Returns
the number of items in the Iterator.
=head2 first
Return the first item from the Iterator.
=head2 rest
Returns an Iterator containing everything except the first item.
=head2 slice(INDEX,LENGTH)
Returns an Iterator starting at the item at INDEX returning at most LENGTH results.
=head2 take(NUM)
Returns an Iterator with the first NUM results.
=head2 group(NUM)
Splitting the Iterator into NUM parts and returning an Iterator for each part.
=head2 interleave(@iterators)
Returns an Iterator which returns the first item of each iterator then the
second of each and so on.
=head2 contains($data)
Alias for C<includes>.
=head2 includes($data)
return true if any item in the collection is deeply equal to C<$data>.
=head2 tap(\&callback)
Returns a copy of the Iterator and executing callback on each item. This method works
like the Unix L<tee> command. Use this command to peek into an iterable while it is
processing results. E.g. you are writing code to process an iterable and wrote
something like:
$it->each(sub {
# Very complicated routine
...
});
Now you would like to benchmark this piece of code (how fast are we processing).
This can be done by tapping into the iterator and calling a 'benchmark' subroutine
in your program that for instance counts the number of items divided by the
execution time.
$it->tap(\&benchmark)->each(sub {
# Very complicated routine
...
});
sub benchmark {
my $item = shift;
$start ||= time;
$count++;
printf "%d recs/sec\n" , $count/(time - $start + 1) if $count % 100 == 0;
}
Note that the C<benchmark> method already implements this common case.
=head2 detect(\&callback)
Returns the first item for which callback returns a true value.
=head2 detect(qr/..../)
If the iterator contains STRING values, then return the first item which matches the
regex.
=head2 detect($key => $val)
If the iterator contains HASH values, then return the first item where the value of
C<$key> is equal to val.
=head2 detect($key => qr/..../)
If the iterator contains HASH values, then return the first item where the value of
C<$key> matches the regex.
=head2 detect($key => [$val, ...])
If the iterator contains HASH values, then return the first item where the value of
C<$key> is equal to any of the vals given.
=head2 pluck($key)
Return an Iterator that only contains the values of the given C<$key>.
=head2 select(\&callback)
Returns an Iterator for each item for which callback returns a true value.
=head2 select(qr/..../)
If the iterator contains STRING values, then return each item which matches the regex.
=head2 select($key => $val)
If the iterator contains HASH values, then return each item where the value of
C<$key> is equal to val.
=head2 select($key => qr/..../)
If the iterator contains HASH values, then return each item where the value of C<$key>
matches the regex.
=head2 select($key => [$val, ...])
If the iterator contains HASH values, then return each item where the value of
C<$key> is equal to any of the vals given.
=head2 grep( ... )
Alias for C<select( ... )>.
=head2 reject(\&callback)
Returns an Iterator for each item for which callback returns a false value.
=head2 reject(qr/..../)
If the iterator contains STRING values, then reject every item except those
matching the regex.
=head2 reject($key => qr/..../)
If the iterator contains HASH values, then reject every item for where the value of $key
DOESN'T match the regex.
=head2 reject($key => $val)
If the iterator contains HASH values, then return each item where the value of
$key is NOT equal to val.
=head2 reject($key => [$val, ...])
If the iterator contains HASH values, then return each item where the value of
$key is NOT equal to any of the vals given.
=head2 sorted
Returns an Iterator with items sorted lexically. Note that sorting requires
memory because all items are buffered in a L<Catmandu::ArrayIterator>.
=head2 sorted(\&callback)
Returns an Iterator with items sorted by a callback. The callback is expected to
returns an integer less than, equal to, or greater than C<0>. The following code
snippets result in the equal arrays:
$iterator->sorted(\&callback)->to_array
[ sort \&callback @{ $iterator->to_array } ]
=head2 sorted($key)
Returns an Iterator with items lexically sorted by a key. This is equivalent to
sorting with the following callback:
$iterator->sorted(sub { $_[0]->{$key} cmp $_[1]->{$key} })
=head3 EXTERNAL ITERATOR
L<Catmandu::Iterable> behaves like an internal iterator. C<next> and C<rewind>
allow you to use it like an external iterator.
=head2 next
Each call to C<next> will return the next item until the iterator is exhausted,
then it will keep returning C<undef>.
while (my $data = $it->next) {
# do stuff
}
$it->next; # returns undef
=head2 rewind
Rewind the external iterator to the first item.
$it->next; # => {n => 1}
$it->next; # => {n => 2}
$it->next; # => {n => 3}
$it->rewind
$it->next; # => {n => 1}
Note the the iterator must support this behavior. Many importers are not
rewindable.
=head3 BOOLEAN FUNCTIONS
=head2 any(\&callback)
Returns true if at least one item generates a true value when executing callback.
=head2 many(\&callback)
Alias for C<many>.
=head2 many(\&callback)
Returns true if at least two items generate a true value when executing callback.
=head2 all(\&callback)
Returns true if all the items generate a true value when executing callback.
=head3 MAP & REDUCE
=head2 map(\&callback)
Returns a new Iterator containing for each item the result of the callback.
=head2 reduce([START],\&callback)
Alias for C<reduce>.
=head2 reduce([START],\&callback)
For each item in the Iterator execute &callback($prev,$item) where $prev is the
option START value or the result of the previous call to callback. Returns the
final result of the callback function.
=head2 invoke(NAME)
Returns an interator were the method NAME is called on every object in the iterable.
This is a shortcut for $it->map(sub { $_[0]->NAME }).
=head2 max()
Returns the maximum of an iterator containing only numbers.
=head2 max(\&callback)
Returns the maximum of the numbers returned by executing callback.
=head2 min()
Returns the minimum of an iterator containing only numbers.
=head2 min(\&callback)
Returns the minimum of the numbers returned by executing callback.
=head2 benchmark()
Prints the number of records processed per second to STDERR.
=head2 format(cols => ['key', ...], col_sep => ' | ', header => 1|0)
Print the iterator data formatted as a spreadsheet like table. Note that this
method will load the whole dataset in memory to calculate column widths. See
also L<Catmandu::Exporter::Table> for a more elaborated method of printing
iterators in tabular form.
=head2 stop_if(\&callback)
Returns a new iterator thats stops processing if the callback returns false.
# stop after encountering 3 frobnitzes
my $frobnitzes = 0;
$iterator->stop_if(sub {
my $rec = shift;
$frobnitzes++ if $rec->{title} =~ /frobnitz/;
$frobnitzes > 3;
})->each(sub {
my $rec = shift;
...
});
=head2 run
Simply invokes the iterator and returns 1 if any records were processed, 0 otherwise.
$it = $it->tap(sub {
# do something
});
$it = $it->tap(sub {
# do another thing
});
$it->run
print 'not empty' if $it->run;
=head1 SEE ALSO
L<Catmandu::Iterator>.
=cut
|