Created
April 1, 2013 16:28
-
-
Save hoehrmann/5285994 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package Acme::IEnumerable::List; | |
use Modern::Perl; | |
use base qw/Acme::IEnumerable/; | |
sub _create { | |
bless { | |
_list => $_[0], | |
_new => $_[1], | |
}, __PACKAGE__; | |
} | |
sub from_list { | |
my $class = shift; | |
my @list = @_; | |
return _create \@list, sub { | |
return sub { | |
state $index = 0; | |
return unless $index <= $#list; | |
return \($list[$index++]); | |
}; | |
}; | |
} | |
sub find { ... } | |
sub find_index { ... } | |
sub find_last { ... } | |
sub find_last_idex { ... } | |
sub exists { ... } | |
sub find_all { ... } | |
sub binary_search { ... } | |
sub index_of { ... } | |
sub last_index_of { ... } | |
1; | |
package Acme::IEnumerable::Ordered; | |
use Modern::Perl; | |
use base qw/Acme::IEnumerable/; | |
sub _create { | |
bless { | |
_key => $_[0], | |
_sgn => $_[1], | |
_par => $_[2], | |
_new => $_[3], | |
}, __PACKAGE__; | |
} | |
sub then_by_descending { | |
_then_by(@_[0..1], -1); | |
} | |
sub then_by { | |
_then_by(@_[0..1], 1); | |
} | |
sub _then_by { | |
my ($self, $key_extractor, $sign) = @_; | |
return _create $key_extractor, $sign, $self, sub { | |
my $top = $self; | |
my @ext = $key_extractor; | |
my @sgn = $sign; | |
for (my $c = $self; $c->isa(__PACKAGE__); $c = $c->{_par}) { | |
$top = $c; | |
unshift @ext, $c->{_key}; | |
unshift @sgn, $c->{_sgn}; | |
} | |
my @list = $top->to_list; | |
# This is not written with efficiency in mind. | |
my @ordered = sort { | |
my $cmp = 0; | |
for (my $ix = 0; $ix < @ext; ++$ix) { | |
my $ext = $ext[$ix]; | |
my $k1 = do { local $_ = $a; $ext->($_) }; | |
my $k2 = do { local $_ = $b; $ext->($_) }; | |
$cmp = $sgn[$ix] * ($k1 <=> $k2); | |
last if $cmp; | |
}; | |
return $cmp; | |
} @list; | |
return Acme::IEnumerable->from_list(@ordered)->new; | |
}; | |
} | |
package Acme::IEnumerable::Grouping; | |
use Modern::Perl; | |
use base qw/Acme::IEnumerable/; | |
sub from_list { | |
my $class = shift; | |
my $key = shift; | |
my $self = Acme::IEnumerable->from_list(@_); | |
$self->{key} = $key; | |
bless $self, __PACKAGE__; | |
} | |
sub key { $_[0]->{key} } | |
1; | |
package Acme::IEnumerable; | |
use Modern::Perl; | |
use Carp; | |
do { | |
no warnings 'once'; | |
*from_list = \&Acme::IEnumerable::List::from_list; | |
*to_array = \&Acme::IEnumerable::to_list; | |
*order_by = \&Acme::IEnumerable::Ordered::then_by; | |
*order_by_descending = | |
\&Acme::IEnumerable::Ordered::then_by_descending; | |
}; | |
sub _create { | |
bless { | |
_new => $_[0], | |
}, __PACKAGE__; | |
} | |
sub new { $_[0]->{_new}->() } | |
sub range { | |
my ($class, $from) = @_; | |
return _create sub { | |
return sub { | |
state $counter = $from // 0; | |
return \($counter++); | |
}; | |
}; | |
} | |
sub take { | |
my ($self, $count) = @_; | |
return _create sub { | |
return sub { | |
state $left = $count; | |
return unless $left; | |
$left--; | |
state $base = $self->new(); | |
my $item = $base->(); | |
return unless ref $item; | |
return $item; | |
}; | |
}; | |
} | |
sub take_while { | |
my ($self, $predicate) = @_; | |
return _create sub { | |
return sub { | |
state $base = $self->new(); | |
my $item = $base->(); | |
return unless ref $item; | |
local $_ = $$item; | |
return unless $predicate->($_); | |
}; | |
}; | |
} | |
sub group_by { | |
my ($self, $key_extractor) = @_; | |
return _create sub { | |
my $base = $self->new; | |
my %temp; | |
while (1) { | |
my $item = $base->(); | |
last unless ref $item; | |
local $_ = $$item; | |
my $key = $key_extractor->($_); | |
push @{ $temp{$key} }, $_; | |
} | |
my @temp = map { | |
Acme::IEnumerable::Grouping->from_list($_, @{$temp{$_}}) | |
} keys %temp; | |
return Acme::IEnumerable->from_list(@temp)->new; | |
}; | |
} | |
sub stack_by { | |
my ($self, $key_extractor) = @_; | |
return _create sub { | |
my $base = $self->new; | |
my @list; | |
while (1) { | |
my $item = $base->(); | |
last unless ref $item; | |
local $_ = $$item; | |
my $key = $key_extractor->($_); | |
if (not @list or $key ne $list[-1]->{key}) { | |
push @list, { | |
key => $key, | |
}; | |
} | |
push @{ $list[-1]->{value} }, $_; | |
} | |
my @temp = map { | |
Acme::IEnumerable::Grouping->from_list($_->{key}, @{ $_->{value} }) | |
} @list; | |
return Acme::IEnumerable->from_list(@temp)->new; | |
}; | |
} | |
sub skip { | |
my ($self, $count) = @_; | |
return _create sub { | |
return sub { | |
state $base = $self->new(); | |
state $left = $count; | |
while ($left) { | |
my $item = $base->(); | |
return unless ref $item; | |
$left--; | |
} | |
return $base->(); | |
}; | |
}; | |
} | |
sub skip_while { | |
my ($self, $predicate) = @_; | |
return _create sub { | |
return sub { | |
state $base = $self->new(); | |
state $skip = 1; | |
while ($skip) { | |
my $item = $base->(); | |
return unless ref $item; | |
local $_ = $$item; | |
$skip &= !! $predicate->($_); | |
return $item unless $skip; | |
} | |
return $base->(); | |
}; | |
} | |
} | |
sub element_at { | |
my ($self, $index) = @_; | |
croak "Index out of range for element_at" if $index < 0; | |
my $base = $self->new(); | |
while (1) { | |
my $item = $base->(); | |
croak "Index out of range for element_at" unless ref $item; | |
return $$item unless $index--; | |
} | |
Carp::confess("Impossible"); | |
} | |
sub first { | |
$_[0]->element_at(0); | |
} | |
sub first_or_default { | |
my ($self, $default) = @_; | |
my $base = $self->new(); | |
my $item = $base->(); | |
return $default unless ref $item; | |
return $$item; | |
} | |
sub last_or_default { | |
my ($self, $default) = @_; | |
my $base = $self->new(); | |
my $item = $base->(); | |
return $default unless ref $item; | |
while (1) { | |
my $next = $base->(); | |
return $$item unless ref $next; | |
$item = $next; | |
} | |
} | |
sub count { | |
my ($self, $predicate) = @_; | |
$predicate //= sub { 1 }; | |
my $base = $self->new(); | |
while (1) { | |
state $counter = 0; | |
my $item = $base->(); | |
return $counter unless ref $item; | |
local $_ = $$item; | |
$counter += !! $predicate->($_); | |
} | |
Carp::confess("Impossible"); | |
} | |
sub select { | |
my ($self, $projection) = @_; | |
return _create sub { | |
return sub { | |
state $base = $self->new(); | |
my $item = $base->(); | |
return unless ref $item; | |
local $_ = $$item; | |
return \($projection->($_)); | |
}; | |
}; | |
} | |
sub where { | |
my ($self, $predicate) = @_; | |
return _create sub { | |
return sub { | |
state $base = $self->new(); | |
while (1) { | |
my $item = $base->(); | |
return unless ref $item; | |
local $_ = $$item; | |
next unless $predicate->($_); | |
return $item; | |
} | |
}; | |
}; | |
} | |
sub aggregate { | |
my $self = shift; | |
my $base = $self->new(); | |
my ($func, $seed); | |
if (@_ == 1) { | |
$func = shift; | |
my $item = $base->(); | |
croak unless ref $item; | |
$seed = $$item; | |
} elsif (@_ == 2) { | |
$seed = shift; | |
$func = shift; | |
} else { | |
... | |
} | |
while (1) { | |
my $item = $base->(); | |
return $seed unless ref $item; | |
$seed = $func->($seed, $$item); | |
} | |
Carp::confess("Impossible"); | |
} | |
sub min { | |
my ($self) = @_; | |
return $self->aggregate(sub { | |
$_[0] < $_[1] ? $_[0] : $_[1] | |
}); | |
} | |
sub max { | |
my ($self) = @_; | |
return $self->aggregate(sub { | |
$_[0] > $_[1] ? $_[0] : $_[1] | |
}); | |
} | |
sub all { | |
my ($self, $predicate) = @_; | |
my $base = $self->new(); | |
while (1) { | |
my $item = $base->(); | |
return 1 unless ref $item; | |
local $_ = $$item; | |
return 0 unless $predicate->($_); | |
} | |
Carp::confess("Impossible"); | |
} | |
sub any { | |
my ($self, $predicate) = @_; | |
$predicate //= sub { 1 }; | |
my $base = $self->new(); | |
while (1) { | |
my $item = $base->(); | |
return 0 unless ref $item; | |
local $_ = $$item; | |
return 1 if $predicate->($_); | |
} | |
Carp::confess("Impossible"); | |
} | |
sub reverse { | |
my $self = shift; | |
Acme::IEnumerable->from_list(reverse $self->to_list); | |
} | |
sub sum { | |
my $self = shift; | |
return $self->aggregate(0, sub { $_[0] + $_[1] }); | |
} | |
sub to_list { | |
my $self = shift; | |
my @result; | |
my $enum = $self->new(); | |
for (my $item = $enum->(); ref $item; $item = $enum->()) { | |
push @result, $$item; | |
} | |
@result; | |
} | |
sub select_many { ... } | |
sub avg { ... } | |
sub contains { ... } | |
sub last { ... } | |
sub zip { ... } | |
sub sequence_equal { ... } | |
sub distinct { ... } | |
sub union { ... } | |
sub except { ... } | |
sub intersect { ... } | |
1; | |
package main; | |
use Modern::Perl; | |
use YAML::XS; | |
use Data::Dumper; | |
my $v1 = Acme::IEnumerable->range(1); | |
my $v2 = $v1; | |
my $i1 = $v1->new(); | |
my $i2 = $v2->new(); | |
say ${ $i1->() }; | |
say ${ $i1->() }; | |
say ${ $i1->() }; | |
say ""; | |
say ${ $i2->() }; | |
say ${ $i2->() }; | |
say ${ $i2->() }; | |
say Dumper $i2; | |
say "---"; | |
say join '', | |
Acme::IEnumerable | |
->range(1) | |
->select(sub { $_ ** 3 }) | |
->select(sub { sprintf "%6.0f\n", $_ }) | |
->take(20) | |
->to_list; | |
say "---"; | |
say Acme::IEnumerable | |
->range(1) | |
->take(100) | |
->aggregate(sub { $_[0] + $_[1] }); | |
say "---"; | |
say join "\n", Acme::IEnumerable | |
->range(1) | |
->take(20) | |
->order_by(sub { $_ & 1 }) | |
->then_by_descending(sub { $_ }) | |
->reverse | |
->where(sub { $_ % 3 != 0 }) | |
->to_list; | |
__END__ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment