DEATH TO ALL zionist ELLIPSES

[gitmo/Moose.git] / lib / Moose / Cookbook / Basics / Recipe3.pod

diff --git a/lib/Moose/Cookbook/Basics/Recipe3.pod b/lib/Moose/Cookbook/Basics/Recipe3.pod
index 394e09c..4a0bcb8 100644 (file)
--- a/lib/Moose/Cookbook/Basics/Recipe3.pod
+++ b/lib/Moose/Cookbook/Basics/Recipe3.pod
@@ -236,74 +236,74 @@ use Scalar::Util 'isweak';
 my $root = BinaryTree->new(node => 'root');
 isa_ok($root, 'BinaryTree');
 
-is($root->node, 'root', '... got the right node value');
+is($root->node, 'root', 'got the right node value');
 
-ok(!$root->has_left, '... no left node yet');
-ok(!$root->has_right, '... no right node yet');
+ok(!$root->has_left, 'no left node yet');
+ok(!$root->has_right, 'no right node yet');
 
-ok(!$root->has_parent, '... no parent for root node');
+ok(!$root->has_parent, 'no parent for root node');
 
 # make a left node
 
 my $left = $root->left;
 isa_ok($left, 'BinaryTree');
 
-is($root->left, $left, '... got the same node (and it is $left)');
-ok($root->has_left, '... we have a left node now');
+is($root->left, $left, 'got the same node (and it is $left)');
+ok($root->has_left, 'we have a left node now');
 
-ok($left->has_parent, '... lefts has a parent');
-is($left->parent, $root, '... lefts parent is the root');
+ok($left->has_parent, 'lefts has a parent');
+is($left->parent, $root, 'lefts parent is the root');
 
-ok(isweak($left->{parent}), '... parent is a weakened ref');
+ok(isweak($left->{parent}), 'parent is a weakened ref');
 
-ok(!$left->has_left, '... $left no left node yet');
-ok(!$left->has_right, '... $left no right node yet');
+ok(!$left->has_left, '$left no left node yet');
+ok(!$left->has_right, '$left no right node yet');
 
-is($left->node, undef, '... left has got no node value');
+is($left->node, undef, 'left has got no node value');
 
 lives_ok {
     $left->node('left')
-} '... assign to lefts node';
+} 'assign to lefts node';
 
-is($left->node, 'left', '... left now has a node value');
+is($left->node, 'left', 'left now has a node value');
 
 # make a right node
 
-ok(!$root->has_right, '... still no right node yet');
+ok(!$root->has_right, 'still no right node yet');
 
-is($root->right->node, undef, '... right has got no node value');
+is($root->right->node, undef, 'right has got no node value');
 
-ok($root->has_right, '... now we have a right node');
+ok($root->has_right, 'now we have a right node');
 
 my $right = $root->right;
 isa_ok($right, 'BinaryTree');
 
 lives_ok {
     $right->node('right')
-} '... assign to rights node';
+} 'assign to rights node';
 
-is($right->node, 'right', '... left now has a node value');
+is($right->node, 'right', 'left now has a node value');
 
-is($root->right, $right, '... got the same node (and it is $right)');
-ok($root->has_right, '... we have a right node now');
+is($root->right, $right, 'got the same node (and it is $right)');
+ok($root->has_right, 'we have a right node now');
 
-ok($right->has_parent, '... rights has a parent');
-is($right->parent, $root, '... rights parent is the root');
+ok($right->has_parent, 'rights has a parent');
+is($right->parent, $root, 'rights parent is the root');
 
-ok(isweak($right->{parent}), '... parent is a weakened ref');
+ok(isweak($right->{parent}), 'parent is a weakened ref');
 
 # make a left node of the left node
 
 my $left_left = $left->left;
 isa_ok($left_left, 'BinaryTree');
 
-ok($left_left->has_parent, '... left does have a parent');
+ok($left_left->has_parent, 'left does have a parent');
 
-is($left_left->parent, $left, '... got a parent node (and it is $left)');
-ok($left->has_left, '... we have a left node now');
-is($left->left, $left_left, '... got a left node (and it is $left_left)');
+is($left_left->parent, $left, 'got a parent node (and it is $left)');
+ok($left->has_left, 'we have a left node now');
+is($left->left, $left_left, 'got a left node (and it is $left_left)');
 
-ok(isweak($left_left->{parent}), '... parent is a weakened ref');
+ok(isweak($left_left->{parent}), 'parent is a weakened ref');
 
 # make a right node of the left node
 
@@ -312,21 +312,21 @@ isa_ok($left_right, 'BinaryTree');
 
 lives_ok {
     $left->right($left_right)
-} '... assign to rights node';
+} 'assign to rights node';
 
-ok($left_right->has_parent, '... left does have a parent');
+ok($left_right->has_parent, 'left does have a parent');
 
-is($left_right->parent, $left, '... got a parent node (and it is $left)');
-ok($left->has_right, '... we have a left node now');
-is($left->right, $left_right, '... got a left node (and it is $left_left)');
+is($left_right->parent, $left, 'got a parent node (and it is $left)');
+ok($left->has_right, 'we have a left node now');
+is($left->right, $left_right, 'got a left node (and it is $left_left)');
 
-ok(isweak($left_right->{parent}), '... parent is a weakened ref');
+ok(isweak($left_right->{parent}), 'parent is a weakened ref');
 
 # and check the error
 
 dies_ok {
     $left_right->right($left_left)
-} '... cant assign a node which already has a parent';
+} 'cant assign a node which already has a parent';
 
 =end testing