File Coverage

blib/lib/Data/NestedSet.pm

Criterion	Covered	Total	%
statement	54	56	96.4
branch	6	10	60.0
condition	1	3	33.3
subroutine	9	9	100.0
pod	2	5	40.0
total	72	83	86.7

package Data::NestedSet;

use 5.008008;
use strict;
use warnings;
use Carp;


our $VERSION=1.03;

	sub new {
	    my ($class,$data,$depth_position)= @_;

	    croak 'An array ref must be supplied as the first argument. Seen '. ref($data) if(ref($data) ne 'ARRAY');
	    my $nb = scalar @{$data};

	    croak 'The number of items within the array ref must be >=1 . Seen '.$nb if($nb==0);
	    croak 'An integer must be supplied as the second argument. Seen '. $depth_position if(not defined $depth_position
 												  || $depth_position!~m/^[0-9]+/mx);


	    my $this    = {
	      left_node           => 1,
              previous_right_node => [],
              last_depth          => 0,
              Data_length         => $nb,
              Max_right_node      => $nb*2,
              depth_position      => $depth_position,
	      data                => $data,
            };

	    $this->{Left}  = scalar @{$data->[0]};
	    $this->{Right} = $this->{Left} + 1;

	    #the first row is the root, we assign 1 to left and the maximum value possible to right
	    $this->{data}->[0]->[$this->{Left}]  = $this->{left_node};
	    $this->{data}->[0]->[$this->{Right}] = $this->{Max_right_node};

	    bless $this, $class;
	    return $this;

	}

	sub create_nodes {
	    my $this = shift;

	    for(my $i=1; $i<$this->{Data_length}; $i++) {

	       my $orientation = $this->{data}->[$i][$this->{depth_position}] - $this->{last_depth};

              if($orientation==1) { #go down in depth

	           $this->set_left_node($i);

	       }
	       elsif($orientation==0) { # same depth level

		   $this->set_previous_right_node();
	           $this->set_left_node($i);

	       }
	       else { # go back up in depth

	          $this->set_previous_right_node();

		  my $depth = abs $orientation;

		  for(0..$depth-1) {
		       $this->set_previous_right_node();
	          }
	          $this->set_left_node($i);
             }

             push @{$this->{previous_right_node}},$i;
             $this->{last_depth}=$this->{data}->[$i]->[$this->{depth_position}];
        }
	 $this->set_right_nodes();
	 return $this->{data};
     }

     sub set_previous_right_node {
	    my $this=shift;
	    $this->{left_node}++;
	    $this->{data}->[pop @{$this->{previous_right_node}}]->[$this->{Right}]=$this->{left_node};
     }

     sub set_left_node {
	   my $this=shift;
	   $this->{left_node}++;
	   $this->{data}->[shift]->[$this->{Left}]=$this->{left_node};
     }

     sub set_right_nodes {
	   my $this=shift;
	   my $last_node = $this->{data}->[$this->{Data_length}-1][$this->{Left}];
	   for(my $i=scalar(@{$this->{previous_right_node}}) -1; $i >= 0; $i--) {
		$last_node++;
		$this->{data}->[$this->{previous_right_node}->[$i]]->[$this->{Right}]=$last_node;
	   }
    }

1;

__END__