Changeset 21798 for misc

Timestamp:

08/06/08 05:32:39 (5 months ago)

Author:

rhr

Message:

[utable.t] syntax check with STD

Files:

• misc/pX/Common/Unicode/t/utable.t (modified) (12 diffs)

misc/pX/Common/Unicode/t/utable.t

@@ -12 +12 @@
 $u = undef;
 ok $u = Utable.new(@@( 1..2 ; 5..8 )), 'Utable.new with a list of ranges works';
-for 1..2, 5..8 -> my $n {
+for 1..2, 5..8 -> $n {
     is $u.contains($n), True, ".contains finds $n in @@( 1..2 ; 5..8 )";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.contains($n), False, ".contains doesn't find $n in @@( 1..2 ; 5..8 )";
 }
@@ -24 +24 @@
 $u = undef;
 ok $u = Utable.new('1..2;5..8'), 'Utable.new with a string works';
-for 1..2, 5..8 -> my $n {
+for 1..2, 5..8 -> $n {
     is $u.contains($n), True, ".contains finds $n in '1..2;5..8'";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.contains($n), False, ".contains doesn't find $n in '1..2;5..8'";
 }
@@ -34 +34 @@
 ok $u eqv $u.perl.eval, "round-trip to .perl works for '1..2;5..8'";
 
-is $u.inverse.tostr '0;3..4;9..1114111', '.inverse works';
+is $u.inverse.tostr, '0;3..4;9..1114111', '.inverse works';
 
 my $io = open "/tmp/utable.$*PID", :w orelse die;
@@ -66 +66 @@
 $u = undef;
 ok $u = Utable.new(@@( 1..2 ; 5..8 ), :val(1, 2)), 'Utable.new with a list of ranges and a list of values works';
-for 1..2 -> my $n {
+for 1..2 -> $n {
     is $u.get($n), 1, ".get finds 1 for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
-for 5..8 -> my $n {
+for 5..8 -> $n {
     is $u.get($n), 2, ".get finds 2 for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.get($n), undef, ".get returns undef for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
@@ -81 +81 @@
 $u = undef;
 ok $u = Utable.new('1..2:1;5..8:2'), 'Utable.new with a string with values works';
-for 1..2 -> my $n {
+for 1..2 -> $n {
     is $u.get($n), 1, ".get finds 1 for $n in '1..2:1;5..8:2'";
 }
-for 5..8 -> my $n {
+for 5..8 -> $n {
     is $u.get($n), 2, ".get finds 2 for $n in '1..2:1;5..8:2'";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.get($n), undef, ".get returns undef for $n in '1..2:1;5..8:2'";
 }
@@ -95 +95 @@
 
 $u = Utable.new;
-for 1..2, 5..8 -> my $n { $u.add($n); }
-# test redundant adds
-for 1..2, 5..8 -> my $n { $u.add($n); }
-for 1..2, 5..8 -> my $n {
+for 1..2, 5..8 -> $n { $u.add($n); }
+# test redundant adds
+for 1..2, 5..8 -> $n { $u.add($n); }
+for 1..2, 5..8 -> $n {
     is $u.contains($n), True, "(add) .contains finds $n in @@( 1..2 ; 5..8 )";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.contains($n), False, "(add) .contains doesn't find $n in @@( 1..2 ; 5..8 )";
 }
@@ -109 +109 @@
 
 $u = Utable.new;
-for 8, 7, 6, 5, 2, 1 -> my $n { $u.add($n); }
-# test redundant adds
-for 1..2, 5..8 -> my $n { $u.add($n); }
-for 1..2, 5..8 -> my $n {
+for 8, 7, 6, 5, 2, 1 -> $n { $u.add($n); }
+# test redundant adds
+for 1..2, 5..8 -> $n { $u.add($n); }
+for 1..2, 5..8 -> $n {
     is $u.contains($n), True, "(backwards add) .contains finds $n in @@( 1..2 ; 5..8 )";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.contains($n), False, "(backwards add) .contains doesn't find $n in @@( 1..2 ; 5..8 )";
 }
@@ -123 +123 @@
 
 $u = Utable.new;
-for 2, 6, 7, 5, 1, 8 -> my $n { $u.add($n); }
-# test redundant adds
-for 1..2, 5..8 -> my $n { $u.add($n); }
-for 1..2, 5..8 -> my $n {
+for 2, 6, 7, 5, 1, 8 -> $n { $u.add($n); }
+# test redundant adds
+for 1..2, 5..8 -> $n { $u.add($n); }
+for 1..2, 5..8 -> $n {
     is $u.contains($n), True, "(random add) .contains finds $n in @@( 1..2 ; 5..8 )";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.contains($n), False, "(random add) .contains doesn't find $n in @@( 1..2 ; 5..8 )";
 }
@@ -137 +137 @@
 
 $u = Utable.new;
-for 1..2 -> my $n { $u.add($n, :val(1)); }
-for 5..8 -> my $n { $u.add($n, :val(2)); }
-# test redundant adds
-for 1..2 -> my $n { $u.add($n, :val(1)); }
-for 5..8 -> my $n { $u.add($n, :val(2)); }
-for 1..2 -> my $n {
+for 1..2 -> $n { $u.add($n, :val(1)); }
+for 5..8 -> $n { $u.add($n, :val(2)); }
+# test redundant adds
+for 1..2 -> $n { $u.add($n, :val(1)); }
+for 5..8 -> $n { $u.add($n, :val(2)); }
+for 1..2 -> $n {
     is $u.get($n), 1, "(add) .get finds 1 for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
-for 5..8 -> my $n {
+for 5..8 -> $n {
     is $u.get($n), 2, "(add) .get finds 2 for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.get($n), undef, "(add) .get returns undef for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
@@ -156 +156 @@
 
 $u = Utable.new;
-for 8, 7, 6, 5 -> my $n { $u.add($n, :val(2)); }
-for 2, 1 -> my $n { $u.add($n, :val(1)); }
-# test redundant adds
-for 1..2 -> my $n { $u.add($n, :val(1)); }
-for 5..8 -> my $n { $u.add($n, :val(2)); }
-for 1..2 -> my $n {
+for 8, 7, 6, 5 -> $n { $u.add($n, :val(2)); }
+for 2, 1 -> $n { $u.add($n, :val(1)); }
+# test redundant adds
+for 1..2 -> $n { $u.add($n, :val(1)); }
+for 5..8 -> $n { $u.add($n, :val(2)); }
+for 1..2 -> $n {
     is $u.get($n), 1, "(backwards add) .get finds 1 for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
-for 5..8 -> my $n {
+for 5..8 -> $n {
     is $u.get($n), 2, "(backwards add) .get finds 2 for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.get($n), undef, "(backwards add) .get returns undef for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
@@ -175 +175 @@
 
 $u = Utable.new;
-for 2, 1 -> my $n { $u.add($n, :val(1)); }
-for 5, 8, 6, 7 -> my $n { $u.add($n, :val(2)); }
-# test redundant adds
-for 1..2 -> my $n { $u.add($n, :val(1)); }
-for 5..8 -> my $n { $u.add($n, :val(2)); }
-for 1..2 -> my $n {
+for 2, 1 -> $n { $u.add($n, :val(1)); }
+for 5, 8, 6, 7 -> $n { $u.add($n, :val(2)); }
+# test redundant adds
+for 1..2 -> $n { $u.add($n, :val(1)); }
+for 5..8 -> $n { $u.add($n, :val(2)); }
+for 1..2 -> $n {
     is $u.get($n), 1, "(random add) .get finds 1 for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
-for 5..8 -> my $n {
+for 5..8 -> $n {
     is $u.get($n), 2, "(random add) .get finds 2 for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
-for -2..0, 3..4, 9..11 -> my $n {
+for -2..0, 3..4, 9..11 -> $n {
     is $u.get($n), undef, "(random add) .get returns undef for $n in @@( 1..2 ; 5..8 ), (1, 2)";
 }
@@ -202 +202 @@
 my %h;
 for ^1000 {
-    my $n = rand 0..$unicode_max while %h{$n};
-    my $val = rand 1..2;
+    my $n = (0..$unicode_max).pick while %h{$n};
+    my $val = (1..2).pick;
     $u.add($n, :$val);
     %h{$n} = $val;
 }
-for %h.keys -> my $n {
+for %h.keys -> $n {
     is $u.get($n), %h{$n}, 'rand lookup succeeds';
 }