[libarray-iterator-perl] 01/08: unapply patches

[gregor herrmann]

This is an automated email from the git hooks/post-receive script.

gregoa pushed a commit to branch master
in repository libarray-iterator-perl.

commit 78fd90ec854d4f35dee3dc8969529bb4f6e6b111
Author: gregor herrmann <gregoa at debian.org>
Date:   Tue Sep 17 19:23:36 2013 +0200

    unapply patches
    
    Git-Dch: Ignore
---
 lib/Array/Iterator.pm               |    4 ++--
 lib/Array/Iterator/BiDirectional.pm |    6 +++---
 lib/Array/Iterator/Circular.pm      |    2 +-
 3 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/lib/Array/Iterator.pm b/lib/Array/Iterator.pm
index f331d7d..0b7419c 100644
--- a/lib/Array/Iterator.pm
+++ b/lib/Array/Iterator.pm
@@ -173,7 +173,7 @@ sub getLength { my $self = shift; $self->get_length(@_) }
 
 =head1 NAME
 
-Array::Iterator - Provides iterator for Array or Array ref
+Array::Iterator
 
 =head1 VERSION
 
@@ -411,7 +411,7 @@ When this iterator reaches the end of its list, it will loop back to the start a
 
 =item B<Array::Iterator::Reusable>
 
-This iterator can be reset to its beginning and used again.
+This iterator can be reset to its begining and used again.
 
 =back
 
diff --git a/lib/Array/Iterator/BiDirectional.pm b/lib/Array/Iterator/BiDirectional.pm
index d7b2fd9..b74f9e8 100644
--- a/lib/Array/Iterator/BiDirectional.pm
+++ b/lib/Array/Iterator/BiDirectional.pm
@@ -100,17 +100,17 @@ This is a subclass of Array::Iterator, only those methods that have been added a
 
 =item B<has_previous([$n])>
 
-This method works much like C<hasNext> does, it will return true (C<1>) unless the beginning of the array has been reached, and false (C<0>) otherwise.
+This method works much like C<hasNext> does, it will return true (C<1>) unless the begining of the array has been reached, and false (C<0>) otherwise.
 
 Optional argument has the same meaning except that it specifies C<$n>th previous element.
 
 =item B<previous>
 
-This method is much like C<next>. It will return the previous item in the iterator, and throw an exception if it attempts to reach past the beginning of the array.
+This method is much like C<next>. It will return the previous item in the iterator, and throw an exception if it attempts to reach past the begining of the array.
 
 =item B<get_previous>
 
-This method is much like C<get_next>. It will return the previous item in the iterator, and return undef if it attempts to reach past the beginning of the array.
+This method is much like C<get_next>. It will return the previous item in the iterator, and return undef if it attempts to reach past the begining of the array.
 
 =item B<look_back([$n])>
 
diff --git a/lib/Array/Iterator/Circular.pm b/lib/Array/Iterator/Circular.pm
index ff67d0a..51c5785 100644
--- a/lib/Array/Iterator/Circular.pm
+++ b/lib/Array/Iterator/Circular.pm
@@ -110,7 +110,7 @@ Since we endlessly loop, this will always return true (C<1>).
 
 =item B<next>
 
-This will return the next item in the array, and when it reaches the end of the array, it will loop back to the beginning again.
+This will return the next item in the array, and when it reaches the end of the array, it will loop back to the begining again.
 
 =item B<get_next>
 

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libarray-iterator-perl.git