File Coverage

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

Criterion	Covered	Total	%
statement	22	22	100.0
branch	4	4	100.0
condition	3	3	100.0
subroutine	7	7	100.0
pod	1	1	100.0
total	37	37	100.0

package Tree::Binary::Visitor::PreOrderTraversal;

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";
    # get all things set up
	my @results;
	my $func;
    if ($self->{_filter_function}) {
        $func = sub { push @results => $self->{_filter_function}->(@_) };
    }
    else {
        $func = sub { push @results => $_[0]->getNodeValue() };
    }
	# then recursively to all its children
	# if the object is configured that way
	$tree->traverse($func);
    # now store the results we got
    $self->setResults(@results);
}


1;

__END__