/ 
Data-LinkedList-0.01
/ Data::LinkedList::Iterator::DescendingIterator

NAME

Data::LinkedList::Iterator::ListIterator - A list iterator to walk through a linked list in reverse order.

SYNOPSIS

#!/usr/bin/env perl -w

use strict;
use Data::LinkedList;

my $list = Data::LinkedList->new();
$list->add_all(1, 2, 3, 4, 5);

my $iterator = $list->descending_iterator();
CORE::say $iterator->next() while $iterator->has_next();

DESCRIPTION

The descending list iterator walks through the linked list in reverse sequential order.

METHODS

new

Instantiates and returns a new Data::LinkedList::Iterator::ListIterator object. The starting index for the iterator is that of the last element in the list.

my $descending_iterator = Data::LinkedList::Iterator::DescendingIterator->new(
    list => Data::LinkedList->new() # Required for construction.
                                    # Won't complain if not passed, but will fail miserably.
);

has_next

Returns a boolean value to represent if there is a next entry in the list.

$descending_iterator->has_next();

next

Returns the next entry in the list.

$descending_iterator->next();

remove

Remove the most recently returned element from the list.

$descending_iterator->remove();

BUGS

Please report any bugs to lloydg@cpan.org

AUTHOR

Lloyd Griffiths

COPYRIGHT

Copyright (c) 2013 Lloyd Griffiths

This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.