From b7a218903103b5f32360dce11523b76c6b5de5ae Mon Sep 17 00:00:00 2001 From: Gianni Ceccarelli Date: Wed, 29 Apr 2009 15:53:30 +0200 Subject: hopefully fixed P::C tests, and upped version --- lib/Tree/Transform/XSLTish.pm | 20 +++++++++++++++++++- 1 file changed, 19 insertions(+), 1 deletion(-) (limited to 'lib/Tree/Transform/XSLTish.pm') diff --git a/lib/Tree/Transform/XSLTish.pm b/lib/Tree/Transform/XSLTish.pm index 42b7222..9c4b1ec 100644 --- a/lib/Tree/Transform/XSLTish.pm +++ b/lib/Tree/Transform/XSLTish.pm @@ -8,7 +8,7 @@ use Tree::Transform::XSLTish::Transformer; use Carp::Clan qw(^Tree::Transform::XSLTish); use v5.8; -our $VERSION='0.1'; +our $VERSION='0.2'; my @DEFAULT_EXPORTS=('tree_rule', 'default_rules', @@ -270,6 +270,24 @@ and specify another one). This module uses L, see that module's documentation for things like renaming the imports. +=head1 KNOWN BUGS & ISSUES + +=over 4 + +=item * + +It's I. Right now each rule application is linear in the number +of defined rules I the depth of the node being +transformed. There are several ways to optimize this for most common +cases (patches welcome), but I prefer to "make it correct, before +making it fast" + +=item * + +Some sugaring with L could make everything look better + +=back + =head1 AUTHOR Gianni Ceccarelli -- cgit v1.2.3