Add patch for nebulous

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

diff --git a/t/lib/TreeTest.pm b/t/lib/TreeTest.pm
index 95a0dec..7af89b3 100644 (file)
--- a/t/lib/TreeTest.pm
+++ b/t/lib/TreeTest.pm
@@ -3,12 +3,17 @@ use strict;
 use warnings;
 
 use Test::More;
+use Test::Exception;
 use TreeTest::Schema;
 
 our $NODE_COUNT = 80;
 
 sub count_tests {
-    return 11;
+    my $count = 17;
+    if( TreeTest::Schema::Node->can('position_column') ){
+        $count ++;
+    }
+    return $count;
 }
 
 sub run_tests {
@@ -23,6 +28,7 @@ sub run_tests {
         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' );
@@ -41,6 +47,33 @@ sub run_tests {
     $nodes->find(22)->attach_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' );
+
+    my @ancestors = $nodes->find(44)->ancestors();
+    ok( scalar(@ancestors)==8, 'node 44 has correct number of ancestors' );
+    ok( $ancestors[0]->id == $nodes->find(44)->parent_id, 'node 44\'s first ancestor is its parent' );
+    ok( $ancestors[-1]->name eq 'root', 'node 44\'s last ancestor is root' );
+
+    if( TreeTest::Schema::Node->can('position_column') ){
+        ok( check_positions(scalar $root->children()), 'positions are correct' );
+    }
+
+    lives_and ( sub {
+      is( $nodes->find(3)->copy({name => 'special'})->name,'special','copy test');
+    }, 'copy does not throw');
+}
+
+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;