File Coverage

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

Criterion	Covered	Total	%
statement	33	33	100.0
branch	6	6	100.0
condition	4	6	66.6
subroutine	7	7	100.0
pod	2	2	100.0
total	52	54	96.3

package Tree::Simple::Visitor::BreadthFirstTraversal;

use strict;
use warnings;

our $VERSION = '0.15';

use Scalar::Util qw(blessed);

use base qw(Tree::Simple::Visitor);

sub new {
    my ($_class) = @_;
    my $class = ref($_class) || $_class;
    my $visitor = {};
    bless($visitor, $class);
    $visitor->_init();
    return $visitor;
}

sub _init {
    my ($self) = @_;
    $self->SUPER::_init();
}

sub visit {
	my ($self, $tree) = @_;
	(blessed($tree) && $tree->isa("Tree::Simple"))
		|| die "Insufficient Arguments : You must supply a valid Tree::Simple 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;
    # if we are to include the trunk
    if ($self->includeTrunk()) {
        # then enqueue that
        @queue = ($tree);
    }
    # if we are not including the trunk
    else {
        # then we enqueue all the
        # trunks children instead
        @queue = ($tree->getAllChildren());
    }
    # 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->getAllChildren();
        # now collect the results
        push @results => (($filter_function) ?
                                    $filter_function->($current_tree)
                                    :
                                    $current_tree->getNodeValue());
    }
    # store our results
    $self->setResults(@results);
}

1;

__END__