File Coverage

blib/lib/Tree/Binary/Visitor/BreadthFirstTraversal.pm

Criterion	Covered	Total	%
statement	23	23	100.0
branch	8	8	100.0
condition	3	3	100.0
subroutine	5	5	100.0
pod	1	1	100.0
total	40	40	100.0

package Tree::Binary::Visitor::BreadthFirstTraversal;

use strict;
use warnings;

use Scalar::Util qw(blessed);

use Tree::Binary::Visitor::Base;

our $VERSION = '1.09';

our @ISA = qw(Tree::Binary::Visitor::Base);

# visit routine
sub visit {
	my ($self, $tree) = @_;
	(blessed($tree) && $tree->isa("Tree::Binary"))
		|| die "Insufficient Arguments : You must supply a valid Tree::Binary object";
    # create a holder for our results
    my @results;
    # get our filter function
    my $filter_function = $self->getNodeFilter();
    # now create a queue for
    # processing depth first
    my @queue = ($tree);
    # until our queue is empty
    while (scalar(@queue) != 0){
        # get the first item off the queue
        my $current_tree = shift @queue;
        # enqueue all the current tree's children
        push @queue => $current_tree->getLeft() if $current_tree->hasLeft();
        push @queue => $current_tree->getRight() if $current_tree->hasRight();
        # now collect the results
        push @results => (($filter_function) ?
                                    $filter_function->($current_tree)
                                    :
                                    $current_tree->getNodeValue());
    }
    # store our results
    $self->setResults(@results);
}


1;

__END__