6 use Test::More tests => 34;
9 use Scalar::Util 'isweak';
19 has 'node' => (is => 'rw', isa => 'Any');
24 predicate => 'has_parent',
31 predicate => 'has_left',
33 default => sub { BinaryTree->new(parent => $_[0]) },
39 predicate => 'has_right',
41 default => sub { BinaryTree->new(parent => $_[0]) },
44 before 'right', 'left' => sub {
45 my ($self, $tree) = @_;
46 $tree->parent($self) if defined $tree;
49 __PACKAGE__->meta->make_immutable(debug => 0);
52 my $root = BinaryTree->new(node => 'root');
53 isa_ok($root, 'BinaryTree');
55 is($root->node, 'root', '... got the right node value');
57 ok(!$root->has_left, '... no left node yet');
58 ok(!$root->has_right, '... no right node yet');
60 ok(!$root->has_parent, '... no parent for root node');
64 my $left = $root->left;
65 isa_ok($left, 'BinaryTree');
67 is($root->left, $left, '... got the same node (and it is $left)');
68 ok($root->has_left, '... we have a left node now');
70 ok($left->has_parent, '... lefts has a parent');
71 is($left->parent, $root, '... lefts parent is the root');
73 ok(isweak($left->{parent}), '... parent is a weakened ref');
75 ok(!$left->has_left, '... $left no left node yet');
76 ok(!$left->has_right, '... $left no right node yet');
78 is($left->node, undef, '... left has got no node value');
82 } '... assign to lefts node';
84 is($left->node, 'left', '... left now has a node value');
88 ok(!$root->has_right, '... still no right node yet');
90 is($root->right->node, undef, '... right has got no node value');
92 ok($root->has_right, '... now we have a right node');
94 my $right = $root->right;
95 isa_ok($right, 'BinaryTree');
99 } '... assign to rights node';
101 is($right->node, 'right', '... left now has a node value');
103 is($root->right, $right, '... got the same node (and it is $right)');
104 ok($root->has_right, '... we have a right node now');
106 ok($right->has_parent, '... rights has a parent');
107 is($right->parent, $root, '... rights parent is the root');
109 ok(isweak($right->{parent}), '... parent is a weakened ref');
111 my $left_left = $left->left;
112 isa_ok($left_left, 'BinaryTree');
114 ok($left_left->has_parent, '... left does have a parent');
116 is($left_left->parent, $left, '... got a parent node (and it is $left)');
117 ok($left->has_left, '... we have a left node now');
118 is($left->left, $left_left, '... got a left node (and it is $left_left)');
120 ok(isweak($left_left->{parent}), '... parent is a weakened ref');