Improvements to AdjacentList.pm:

[dbsrgits/DBIx-Class-Tree.git] / t / lib / TreeTest.pm

package TreeTest;
use strict;
use warnings;

use Test::More;
use TreeTest::Schema;

our $NODE_COUNT = 80;

sub count_tests {
    my $count = 22;
    if( TreeTest::Schema::Node->can('position_column') ){
        $count ++;
    }
    return $count;
}

sub run_tests {
    my $schema = TreeTest::Schema->connect();
    my $nodes = $schema->resultset('Node');
    my $root = $nodes->create({ name=>'root' });
    my @parents = (
        1,1,3,4,4,3,3,8,8,10,10,8,8,3,3,16,3,3,1,20,1,22,22,24,24,22,27,27,29,29,27,32,32,34,34,36,34,38,38,40,40,42,42,44,44,46,44,44,49,44,51,51,53,51,55,55,57,57,55,60,55,62,55,64,64,55,67,67,55,70,70,55,55,51,51,76,76,78,78,76
    );

    foreach my $parent_id (@parents) {
        my $node = $nodes->create({ name=>'child' });
        $node->parent( $parent_id );
    }
    ok( ($nodes->count()==81), 'correct number of nodes in random tree' );
    ok( ($nodes->find(3)->children->count()==7), 'node 3 has correct number of children' );
    ok( ($nodes->find(22)->children->count()==3), 'node 22 has correct number of children' );

    my $child = ($nodes->find(22)->children->all())[0];
    $child->parent( $nodes->find(3) );
    ok( ($nodes->find(3)->children->count()==8), 'node 3 has correct number of children' );
    ok( ($nodes->find(3)->siblings->count()==3), 'node 3 has correct number of siblings' );
    ok( ($nodes->find(22)->children->count()==2), 'node 22 has correct number of children' );
    ok( ($nodes->find(22)->siblings->count()==3), 'node 22 has correct number of siblings' );

    $nodes->find(22)->add_child( $nodes->find(3) );
    ok( ($nodes->find(22)->children->count()==3), 'node 22 has correct number of children' );
    ok( ($nodes->find(22)->siblings->count()==2), 'node 22 has correct number of siblings' );

    $nodes->find(22)->add_sibling( $nodes->find(3) );
    ok( ($nodes->find(22)->children->count()==2), 'node 22 has correct number of children' );
    ok( ($nodes->find(22)->siblings->count()==3), 'node 22 has correct number of siblings' );

    ok( ($nodes->find(22)->parents->count()==1), 'node 22 has correct number of parents' );
    ok( (($nodes->find(22)->parents->all())[0]->id()==$nodes->find(22)->parent->id()), 'node 22 parent matches parents' );

    if( TreeTest::Schema::Node->can('position_column') ){
        ok( check_positions(scalar $root->children()), 'positions are correct' );
    }

    #$nodes->delete;
    $schema = TreeTest::Schema->connect();
    $nodes = $schema->resultset('Node');
    $root = $nodes->create({ name=>'root' });
    @parents = (
        1,1,3,2,3,3,6,6,2,5,3,5,12,1
    );
    foreach my $parent_id (@parents) {
        my $node = $nodes->create({ name=>'child' });
        $node->parent( $parent_id );
    }

    ok ($nodes->find(1)->descendents == 14, 'root node has 14 descendents');
    ok ($nodes->find(2)->descendents == 4, 'node 2 has 4 descendents');
    ok ($nodes->find(6)->descendents == 2, 'node 6 has 2 descendents');
    ok ($nodes->find(10)->descendents == 0, 'node 10 has no descendents');
    
    $nodes->find(2)->pharaoh_delete;
    ok ($nodes->find(1)->descendents == 9, 'root node has 9 descendents after pharaohing node 2');

    ok ($nodes->find(3)->children == 4, 'node 3 has 4 children');
    $nodes->find(6)->grandmother_delete;
    ok ($nodes->find(3)->children == 5, 'node 3 has 5 children after node 6 dies');

    $nodes->find(3)->replace_with_and_delete($nodes->find(12));
    ok ($nodes->find(12)->children == 5, 'node 12 has 5 children after taking over from node 3');
    ok ($nodes->find(7)->parent->id == 12, 'node 7\'s parent is node 12');
    
    
    

}

sub check_positions {
    my $nodes = shift;
    my $position = 0;
    while (my $node = $nodes->next()) {
        $position ++;
        return 0 if ($node->position() != $position);
        return 0 if ( !check_positions(scalar $node->children()) );
    }
    return 1;
}

1;