From 94d1dc0812959ce9d07ebb8c3796d83092cef9da Mon Sep 17 00:00:00 2001 From: moritz Date: Thu, 19 Feb 2009 07:56:19 +0000 Subject: [PATCH] [t] and [t/spec]: more Junction.eigenstates fixes git-svn-id: http://svn.pugscode.org/pugs@25410 c213334d-75ef-0310-aa23-eaa082d1ae64 --- S03-junctions/basic.t | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/S03-junctions/basic.t b/S03-junctions/basic.t index a7bb3ac905..fe324264e8 100644 --- a/S03-junctions/basic.t +++ b/S03-junctions/basic.t @@ -17,7 +17,7 @@ L my $j = any(1, 2, 3); ok $j ~~ Junction, '$j is a Junction'; -my @values = $j.values.sort; +my @values = $j.eigenstates.sort; is(+@values, 3, 'our junction has three values in it'); is(@values[0], 1, 'our junctions first value is 1'); @@ -28,7 +28,7 @@ my $sums = $j + 3; ok $sums ~~ Junction, '$j + 3 is also a Junction'; -my @sums_values = sort $sums.values; +my @sums_values = sort $sums.eigenstates; is(+@sums_values, 3, 'our junction has three values in it'); is(@sums_values[0], 4, 'our junctions first value is 4'); is(@sums_values[1], 5, 'our junctions second value is 5'); @@ -36,6 +36,6 @@ is(@sums_values[2], 6, 'our junctions third value is 6'); # loop enough to go through it twice for (1 .. 6) { - ok((1 ^ 2 ^ 3) == $j.values.pick, 'it is always at least one'); - ok((1 | 2 | 3) == $j.values.pick, 'it is always one of them'); + ok((1 ^ 2 ^ 3) == $j.eigenstates.pick, 'it is always at least one'); + ok((1 | 2 | 3) == $j.eigenstates.pick, 'it is always one of them'); }