with 'Moose::Autobox::Ref',
'Moose::Autobox::List';
+
+## Array Interface
+
+sub pop {
+ my ($array) = @_;
+ CORE::pop @$array;
+}
+
+sub push {
+ my ($array, @rest) = @_;
+ CORE::push @$array, @rest;
+ $array;
+}
+
+sub unshift {
+ my ($array, @rest) = @_;
+ CORE::unshift @$array, @rest;
+ $array;
+}
-## List interface
+sub delete {
+ my ($array, $index) = @_;
+ CORE::delete $array->[$index];
+}
+
+sub shift {
+ my ($array) = @_;
+ CORE::shift @$array;
+}
+
+# NOTE:
+# sprintf args need to be reversed,
+# because the invocant is the array
+sub sprintf { CORE::sprintf $_[1], @{$_[0]} }
+
+## ::List interface implementation
+
+sub head { $_[0]->[0] }
+sub tail { [ @{$_[0]}[ 1 .. $#{$_[0]} ] ] }
sub length {
my ($array) = @_;
}
sub join {
- my ($array, $sep) = @_;
+ my ($array, $sep) = @_;
+ $sep ||= '';
CORE::join $sep, @$array;
}
[ CORE::sort { $sub->($a, $b) } @$array ];
}
-# ...
+# ::Value requirement
-sub reduce {
- my ($array, $func) = @_;
- my $a = $array->values;
- my $acc = $a->shift;
- $a->map(sub { $acc = $func->($acc, $_) });
- return $acc;
-}
+sub print { CORE::print @{$_[0]} }
-sub zip {
- my ($array, $other) = @_;
- ($array->length < $other->length
- ? $other
- : $array)
- ->keys
- ->map(sub {
- [ $array->[$_], $other->[$_] ]
- });
-}
+## ::Indexed implementation
-##
+sub exists {
+ my ($array, $index) = @_;
+ CORE::exists $array->[$index];
+}
sub keys {
my ($array) = @_;
sub kv {
my ($array) = @_;
- [ CORE::map { [ $_, $array->[$_] ] } (0 .. $#{$array}) ];
-}
-
-## Array Interface
-
-sub pop {
- my ($array) = @_;
- CORE::pop @$array;
-}
-
-sub push {
- my ($array, @rest) = @_;
- CORE::push @$array, @rest;
- $array;
-}
-
-sub unshift {
- my ($array, @rest) = @_;
- CORE::unshift @$array, @rest;
- $array;
-}
-sub exists {
- my ($array, $index) = @_;
- CORE::exists $array->[$index];
-}
-
-sub delete {
- my ($array, $index) = @_;
- CORE::delete $array->[$index];
-}
-
-sub shift {
- my ($array) = @_;
- CORE::shift @$array;
+ $array->keys->map(sub { [ $_, $array->[$_] ] });
}
1;