package Moose::Meta::Attribute::Native::Trait::Array;
use Moose::Role;
-our $VERSION = '0.89';
-$VERSION = eval $VERSION;
our $AUTHORITY = 'cpan:STEVAN';
-use Moose::Meta::Attribute::Native::MethodProvider::Array;
-
with 'Moose::Meta::Attribute::Native::Trait';
-has 'method_provider' => (
- is => 'ro',
- isa => 'ClassName',
- predicate => 'has_method_provider',
- default => 'Moose::Meta::Attribute::Native::MethodProvider::Array'
-);
-
sub _helper_type { 'ArrayRef' }
no Moose::Role;
1;
+# ABSTRACT: Helper trait for array delegation
+
__END__
=pod
-=head1 NAME
-
-Moose::Meta::Attribute::Native::Trait::Array
-
=head1 SYNOPSIS
package Stuff;
use Moose;
has 'options' => (
- traits => ['Array'],
- is => 'ro',
- isa => 'ArrayRef[Str]',
- default => sub { [] },
- handles => {
- all_options => 'elements',
- map_options => 'map',
- filter_options => 'grep',
- find_option => 'find',
- first_option => 'first',
- last_option => 'last',
- get_option => 'get',
- join_options => 'join',
- count_options => 'count',
- has_no_options => 'empty',
- sorted_options => 'sort',
- }
+ traits => ['Array'],
+ is => 'ro',
+ isa => 'ArrayRef[Str]',
+ default => sub { [] },
+ handles => {
+ all_options => 'elements',
+ add_option => 'push',
+ map_options => 'map',
+ filter_options => 'grep',
+ find_option => 'first',
+ get_option => 'get',
+ join_options => 'join',
+ count_options => 'count',
+ has_options => 'count',
+ has_no_options => 'is_empty',
+ sorted_options => 'sort',
+ },
);
no Moose;
=head1 DESCRIPTION
-This module provides an Array attribute which provides a number of
-array operations.
+This trait provides native delegation methods for array references.
-=head1 PROVIDED METHODS
+=head1 DEFAULT TYPE
+
+If you don't provide an C<isa> value for your attribute, it will default to
+C<ArrayRef>.
-These methods are implemented in
-L<Moose::Meta::Attribute::Native::MethodProvider::Array>.
+=head1 PROVIDED METHODS
=over 4
-=item B<count>
+=item * B<count>
Returns the number of elements in the array.
- $stuff = Stuff->new;
- $stuff->options(["foo", "bar", "baz", "boo"]);
+ $stuff = Stuff->new;
+ $stuff->options( [ "foo", "bar", "baz", "boo" ] );
+
+ print $stuff->count_options; # prints 4
+
+This method does not accept any arguments.
+
+=item * B<is_empty>
+
+Returns a boolean value that is true when the array has no elements.
+
+ $stuff->has_no_options ? die "No options!\n" : print "Good boy.\n";
+
+This method does not accept any arguments.
+
+=item * B<elements>
+
+Returns all of the elements of the array as an array (not an array reference).
+
+ my @option = $stuff->all_options;
+ print "@options\n"; # prints "foo bar baz boo"
+
+This method does not accept any arguments.
+
+=item * B<get($index)>
+
+Returns an element of the array by its index. You can also use negative index
+numbers, just as with Perl's core array handling.
+
+ my $option = $stuff->get_option(1);
+ print "$option\n"; # prints "bar"
+
+If the specified element does not exist, this will return C<undef>.
+
+This method does accepts just one argument.
+
+=item * B<pop>
+
+Just like Perl's builtin C<pop>.
+
+This method does not accept any arguments.
+
+=item * B<push($value1, $value2, value3 ...)>
+
+Just like Perl's builtin C<push>. Returns the number of elements in the new
+array.
+
+This method accepts any number of arguments.
+
+=item * B<shift>
+
+Just like Perl's builtin C<shift>.
+
+This method does not accept any arguments.
+
+=item * B<unshift($value1, $value2, value3 ...)>
+
+Just like Perl's builtin C<unshift>. Returns the number of elements in the new
+array.
- my $count = $stuff->count_options;
- print "$count\n"; # prints 4
+This method accepts any number of arguments.
-=item B<empty>
+=item * B<splice($offset, $length, @values)>
-Returns a boolean value indicating whether or not the array has any elements.
+Just like Perl's builtin C<splice>. In scalar context, this returns the last
+element removed, or C<undef> if no elements were removed. In list context,
+this returns all the elements removed from the array.
- $stuff->has_no_options ? die "No options!\n" : print "Good boy.\n";
+This method requires at least one argument.
-=item B<find>
+=item * B<first( sub { ... } )>
-This method returns the first item matching item in the array. The matching is
-done with a subroutine reference you pass to this method. The reference will
-be called against each element in the array until one matches or all elements
-have been checked.
+This method returns the first item matching item in the array, just like
+L<List::Util>'s C<first> function. The matching is done with a subroutine
+reference you pass to this method. The subroutine will be called against each
+element in the array until one matches or all elements have been checked.
- my $found = $stuff->find_option( sub { $_[0] =~ /^b/ } );
- print "$found\n"; # prints "bar"
+ my $found = $stuff->find_option( sub {/^b/} );
+ print "$found\n"; # prints "bar"
-=item B<grep>
+This method requires a single argument.
+
+=item * B<grep( sub { ... } )>
This method returns every element matching a given criteria, just like Perl's
core C<grep> function. This method requires a subroutine which implements the
matching logic.
- my @found = $stuff->filter_options( sub { $_[0] =~ /^b/ } );
- print "@found\n"; # prints "bar baz boo"
+ my @found = $stuff->filter_options( sub {/^b/} );
+ print "@found\n"; # prints "bar baz boo"
+
+This method requires a single argument.
-=item B<map>
+=item * B<map( sub { ... } )>
This method transforms every element in the array and returns a new array,
just like Perl's core C<map> function. This method requires a subroutine which
implements the transformation.
- my @mod_options = $stuff->map_options( sub { $_[0] . "-tag" } );
- print "@mod_options\n"; # prints "foo-tag bar-tag baz-tag boo-tag"
+ my @mod_options = $stuff->map_options( sub { $_ . "-tag" } );
+ print "@mod_options\n"; # prints "foo-tag bar-tag baz-tag boo-tag"
+
+This method requires a single argument.
+
+=item * B<reduce( sub { ... } )>
+
+This method turns an array into a single value, by passing a function the
+value so far and the next value in the array, just like L<List::Util>'s
+C<reduce> function. The reducing is done with a subroutine reference you pass
+to this method.
+
+ my $found = $stuff->reduce_options( sub { $_[0] . $_[1] } );
+ print "$found\n"; # prints "foobarbazboo"
+
+This method requires a single argument.
+
+=item * B<sort>
+
+=item * B<sort( sub { ... } )>
-=item B<sort>
+Returns the elements of the array in sorted order.
-Returns a the array in sorted order.
+You can provide an optional subroutine reference to sort with (as you can with
+Perl's core C<sort> function). However, instead of using C<$a> and C<$b> in
+this subroutine, you will need to use C<$_[0]> and C<$_[1]>.
+
+ # ascending ASCIIbetical
+ my @sorted = $stuff->sort_options();
+
+ # Descending alphabetical order
+ my @sorted_options = $stuff->sort_options( sub { lc $_[1] cmp lc $_[0] } );
+ print "@sorted_options\n"; # prints "foo boo baz bar"
+
+This method accepts a single argument.
+
+=item * B<sort_in_place>
+
+=item * B<sort_in_place( sub { ... } )>
+
+Sorts the array I<in place>, modifying the value of the attribute.
You can provide an optional subroutine reference to sort with (as you can with
Perl's core C<sort> function). However, instead of using C<$a> and C<$b>, you
will need to use C<$_[0]> and C<$_[1]> instead.
- # ascending ASCIIbetical
- my @sorted = $stuff->sort_options();
+This method does not define a return value.
- # Descending alphabetical order
- my @sorted_options = $stuff->sort_options( sub { lc $_[1] cmp lc $_[0] } );
- print "@sorted_options\n"; # prints "foo boo baz bar"
+This method accepts a single argument.
-=item B<elements>
+=item * B<shuffle>
-Returns all of the elements of the array.
+Returns the elements of the array in random order, like C<shuffle> from
+L<List::Util>.
- my @option = $stuff->all_options;
- print "@options\n"; # prints "foo bar baz boo"
+This method does not accept any arguments.
-=item B<join>
+=item * B<uniq>
-Joins every element of the array using the separator given as argument, just
-like Perl's core C<join> function.
+Returns the array with all duplicate elements removed, like C<uniq> from
+L<List::MoreUtils>.
- my $joined = $stuff->join_options( ':' );
- print "$joined\n"; # prints "foo:bar:baz:boo"
+This method does not accept any arguments.
-=item B<get>
+=item * B<join($str)>
-Returns an element of the array by its index. You can also use negative index
-numbers, just as with Perl's core array handling.
+Joins every element of the array using the separator given as argument, just
+like Perl's core C<join> function.
- my $option = $stuff->get_option(1);
- print "$option\n"; # prints "bar"
+ my $joined = $stuff->join_options(':');
+ print "$joined\n"; # prints "foo:bar:baz:boo"
-=item B<first>
+This method requires a single argument.
-Returns the first element of the array.
+=item * B<set($index, $value)>
- my $first = $stuff->first_option;
- print "$first\n"; # prints "foo"
+Given an index and a value, sets the specified array element's value.
-=item B<last>
+This method returns the value at C<$index> after the set.
-Returns the last element of the array.
+This method requires two arguments.
- my $last = $stuff->last_option;
- print "$last\n"; # prints "boo"
+=item * B<delete($index)>
-=item B<pop>
+Removes the element at the given index from the array.
-=item B<push>
+This method returns the deleted value. Note that if no value exists, it will
+return C<undef>.
-=item B<set>
+This method requires one argument.
-=item B<shift>
+=item * B<insert($index, $value)>
-=item B<unshift>
+Inserts a new element into the array at the given index.
-=item B<clear>
+This method returns the new value at C<$index>.
-=item B<delete>
+This method requires two arguments.
-=item B<insert>
+=item * B<clear>
-=item B<splice>
+Empties the entire array, like C<@array = ()>.
-=item B<sort_in_place>
+This method does not define a return value.
-Sorts the array I<in place>, modifying the value of the attribute.
+This method does not accept any arguments.
-You can provide an optional subroutine reference to sort with (as you can with
-Perl's core C<sort> function). However, instead of using C<$a> and C<$b>, you
-will need to use C<$_[0]> and C<$_[1]> instead.
+=item * B<accessor($index)>
-=item B<accessor>
+=item * B<accessor($index, $value)>
This method provides a get/set accessor for the array, based on array indexes.
If passed one argument, it returns the value at the specified index. If
passed two arguments, it sets the value of the specified index.
-=back
+When called as a setter, this method returns the new value at C<$index>.
-=head1 METHODS
+This method accepts one or two arguments.
-=over 4
+=item * B<natatime($n)>
-=item B<meta>
+=item * B<natatime($n, $code)>
-=item B<method_provider>
+This method returns an iterator which, on each call, returns C<$n> more items
+from the array, in order, like C<natatime> from L<List::MoreUtils>. A coderef
+can optionally be provided; it will be called on each group of C<$n> elements
+in the array.
-=item B<has_method_provider>
+This method accepts one or two arguments.
=back
=head1 BUGS
-All complex software has bugs lurking in it, and this module is no
-exception. If you find a bug please either email me, or add the bug
-to cpan-RT.
-
-=head1 AUTHOR
-
-Stevan Little E<lt>stevan@iinteractive.comE<gt>
-
-=head1 COPYRIGHT AND LICENSE
-
-Copyright 2007-2009 by Infinity Interactive, Inc.
-
-L<http://www.iinteractive.com>
-
-This library is free software; you can redistribute it and/or modify
-it under the same terms as Perl itself.
+See L<Moose/BUGS> for details on reporting bugs.
=cut
projects / gitmo/Moose.git / blobdiff