File Coverage

blib/lib/Tree/Visualize/ASCII/Layouts/Binary.pm

Criterion	Covered	Total	%
statement	30	30	100.0
branch	7	8	87.5
condition	4	9	44.4
subroutine	9	9	100.0
pod	3	3	100.0
total	53	59	89.8

package Tree::Visualize::ASCII::Layouts::Binary;

use strict;
use warnings;

our $VERSION = '0.01';

use base qw(Tree::Visualize::Layout::ILayout);

use Tree::Visualize::Exceptions;
use Tree::Visualize::ASCII::BoundingBox;
use Tree::Visualize::Node::Factory;

sub checkTree {
    my ($self, $tree) = @_;
    (defined($tree) && ref($tree) &&
        (UNIVERSAL::isa($tree, "Tree::Binary") || UNIVERSAL::isa($tree, "Tree::Binary::Search")))
            || throw Tree::Visualize::IncorrectObjectType
                        "binary tree argument must be a Tree::Binary or a Tree::Binary::Search object";
    return $tree->getTree() if $tree->isa("Tree::Binary::Search");
    return $tree;
}

sub drawNode {
    my ($self, $tree) = @_;
    my $node = Tree::Visualize::Node::Factory->new()->get(output => 'ASCII', node_type => 'PlainBox', args => [ $tree ]);
    return Tree::Visualize::ASCII::BoundingBox->new($node->draw());
}

sub drawChildren {
    my ($self, $tree) = @_;
    # ready the children
    my ($left, $right) = (undef, undef);
    # get the left node, if we have one
    $left = $self->draw($tree->getLeft()) if $tree->hasLeft();
    # get the right node, if we have one
    $right = $self->draw($tree->getRight()) if $tree->hasRight();
    # and now return the children
    # in our case we need to handle
    # them postionally and let an
    # undef value exist
    return ($left, $right);
}

1;

__END__