changed the recursion test to reflect subtype syntac clarification

diff --git a/Changes b/Changes
index 997ed79..4fa1b66 100644 (file)
--- a/Changes
+++ b/Changes
@@ -1,5 +1,9 @@
 Revision history for MooseX-Types-Structured
 
+0.09    07 March 2009
+        - I guess we don't support the "subtype MyType, [TypeConstraint]" syntax
+          anymore.  Changed the recursion test to reflect that, which should fix
+          my 100% fail rate :)
 0.08    06 March 2009
         - New Feature: slurpy method for when you want a structured type
           constraint that allows trailing arguments of indeterminate length.

diff --git a/lib/MooseX/Types/Structured.pm b/lib/MooseX/Types/Structured.pm
index 4124c39..354d629 100644 (file)
--- a/lib/MooseX/Types/Structured.pm
+++ b/lib/MooseX/Types/Structured.pm
@@ -7,7 +7,7 @@ use MooseX::Meta::TypeConstraint::Structured;
 use MooseX::Types -declare => [qw(Dict Tuple Optional)];
 use Sub::Exporter -setup => { exports => [ qw(Dict Tuple Optional slurpy) ] };
 
-our $VERSION = '0.08';
+our $VERSION = '0.09';
 our $AUTHORITY = 'cpan:JJNAPIORK';
 
 =head1 NAME

diff --git a/t/10-recursion.t b/t/10-recursion.t
index fc2e693..6667f01 100644 (file)
--- a/t/10-recursion.t
+++ b/t/10-recursion.t
@@ -31,13 +31,13 @@ BEGIN {
 
     subtype Var()   => as ScalarRef;
     subtype Const() => as Int | Str;
-    subtype Pair()  => Tuple[ Expr, Expr ];
+    subtype Pair()  => as Tuple[ Expr, Expr ];
 
     enum Op() => qw[ + - ];
 
-    subtype BinOp()  => Tuple[ Expr, Op, Expr ];
-    subtype Lambda() => Tuple[ Var, Expr ];
-    subtype App()    => Tuple[ Lambda, Expr ];
+    subtype BinOp()  => as Tuple[ Expr, Op, Expr ];
+    subtype Lambda() => as Tuple[ Var, Expr ];
+    subtype App()    => as Tuple[ Lambda, Expr ];
     subtype Expr()   => as Var | Const | Pair | BinOp | Lambda | App;
 
     sub match {