HTML-Template-Expr-0.07/ 0000755 0000764 0000764 00000000000 10421225461 014260 5 ustar sam sam 0000000 0000000 HTML-Template-Expr-0.07/t/ 0000755 0000764 0000764 00000000000 10421225461 014523 5 ustar sam sam 0000000 0000000 HTML-Template-Expr-0.07/t/03complex.t 0000644 0000764 0000764 00000011462 10402146135 016525 0 ustar sam sam 0000000 0000000 use Test::More qw(no_plan);
use HTML::Template::Expr;
my $template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'complex.tmpl',
);
is($template->query(name => 'unused'), 'VAR', "query(name => unused)");
my %params = map { $_ => 1 } $template->param();
ok(exists $params{unused}, "param(unused)");
$template->param(foo => 11,
bar => 0,
fname => 'president',
lname => 'clinton',
unused => 0);
my $output = $template->output();
like($output, qr/Foo is greater than 10/i, "greater than");
unlike($output, qr/Bar and Foo/i, "and");
like($output, qr/Bar or Foo/i, "or");
like($output, qr/Bar - Foo = -11/i, "subtraction");
like($output, qr/Foo - Bar \+ 10 = 21/i, "math strings");
like($output, qr/Math Works, Alright/i, "math");
like($output, qr/My name is President Clinton/, "string op 1");
like($output, qr/Resident Alien is phat/, "string op 2");
like($output, qr/Resident has 8 letters, which is less than 10 and greater than 5/, "string length");
like($output, qr/Multiple ors works/, 'multiple or test');
like($output, qr/Addition and comparison 1/);
unlike($output, qr/Addition and comparison 2/);
like($output, qr/Addition and comparison 3/);
unlike($output, qr/And 0 works/);
$template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'loop.tmpl',
);
$template->param(simple => [
{ foo => 10 },
{ foo => 100 },
{ foo => 1000 }
]);
$template->param(color => 'blue');
$template->param(complex => [
{
fname => 'Yasunari',
lname => 'Kawabata',
inner => [
{ stat_name => 'style',
stat_value => 100 ,
},
{ stat_name => 'shock',
stat_value => 1,
},
{ stat_name => 'poetry',
stat_value => 100
},
{ stat_name => 'machismo',
stat_value => 50
},
],
},
{
fname => 'Yukio',
lname => 'Mishima',
inner => [
{ stat_name => 'style',
stat_value => 50,
},
{ stat_name => 'shock',
stat_value => 100,
},
{ stat_name => 'poetry',
stat_value => 1
},
{ stat_name => 'machismo',
stat_value => 100
},
],
},
]);
$output = $template->output();
like($output, qr/Foo is less than 10.\s+Foo is greater than 10.\s+Foo is greater than 10./, "math in loops");
# test user-defined functions
my $repeat = sub { $_[0] x $_[1] };
$template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'func.tmpl',
functions => {
repeat => $repeat,
},
);
$template->param(repeat_me => 'foo ');
$output = $template->output();
like($output, qr/foo foo foo foo/, "user defined function");
like($output, qr/FOO FOO FOO FOO/, "user defined function with uc()");
# test numeric functions
$template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'numerics.tmpl',
);
$template->param(float => 5.1,
four => 4);
$output = $template->output;
like($output, qr/INT: 5/, "int()");
like($output, qr/SQRT: 2/, "sqrt()");
like($output, qr/SQRT2: 4/, "sqrt() 2");
like($output, qr/SUM: 14/, "int(4 + 10.1)");
like($output, qr/SPRINTF: 14.1000/, "sprintf('%0.4f', (10.1 + 4))");
HTML-Template-Expr-0.07/t/06extra_attributes.t 0000644 0000764 0000764 00000001206 10421224076 020447 0 ustar sam sam 0000000 0000000 use Test::More qw(no_plan);
use HTML::Template::Expr;
my $template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'extra_attributes.tmpl',
);
$template->param(who => 'me & you',
xss => '',
back => 'http://google.com',
js_string => "This is\n'me'",);
my $output = $template->output();
like($output, qr/ME & YOU/);
like($output, qr/<script src="malicious\.js" \/>/);
like($output, qr/Http%3A%2F%2Fgoogle\.com/);
like($output, qr/this is\\n\\'me\\'/);
HTML-Template-Expr-0.07/t/01parse.t 0000644 0000764 0000764 00000002564 10402125700 016164 0 ustar sam sam 0000000 0000000 use Test::More qw(no_plan);
use Parse::RecDescent;
use constant DEBUG => 0;
$::RD_HINT = DEBUG;
# $::RD_TRACE = 1;
use HTML::Template::Expr;
use Data::Dumper;
# test grammar directly
my @tests = (
"(foo > 10)",
"((foo < 10) != (bar > 10))",
"('foo' eq 'bar')",
"((foo + 10.1) > 100)",
"(((foo > 10) || (200 < bar)) + 10.5)",
"(call(foo, 10, 20, 30))",
"(call(foo, 10) > 10)",
"(first( foo, 10 ))",
"(call(foo, \"baz\", 10) eq 'string val')",
"((foo < 10) != (bar > 10))",
"(((call(foo, 10) + 100) > 10) || (foo eq \"barf\"))",
"((foo > bar))",
"call(call2(call3()))",
"call(foo > bar)",
"(foo || bar || baz || bif)",
"((foo || bar || baz) && bif)",
"((foo || bar || baz) && (bif || 10))",
);
foreach my $test (@tests) {
print STDERR "TRYING TO PARSE $test\n" if DEBUG;
my $tree = $HTML::Template::Expr::PARSER->expression($test);
ok($tree, "parsing \"$test\"");
if (DEBUG) {
local $Data::Dumper::Indent = 1;
local $Data::Dumper::Purity = 0;
local $Data::Dumper::Deepcopy = 1;
print STDERR Data::Dumper->Dump([\$tree],['$tree']);
print STDERR "vars: ", join(',', HTML::Template::Expr::_expr_vars($tree)), "\n\n";
}
}
HTML-Template-Expr-0.07/t/00load.t 0000644 0000764 0000764 00000000073 10401715173 015771 0 ustar sam sam 0000000 0000000 use Test::More tests => 1;
use_ok('HTML::Template::Expr');
HTML-Template-Expr-0.07/t/04register.t 0000644 0000764 0000764 00000001516 10421223646 016706 0 ustar sam sam 0000000 0000000 use Test::More tests => 4;
use HTML::Template::Expr;
HTML::Template::Expr->register_function(directory_exists => sub {
my $dir = shift;
return -d $dir;
});
HTML::Template::Expr->register_function(commify => sub {
local $_ = shift;
1 while s/^([-+]?\d+)(\d{3})/$1,$2/;
return $_;
});
HTML::Template::Expr->register_function(nada => sub { return });
my $template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'register.tmpl',
);
my $output = $template->output;
like $output, qr/^OK/, 'directory_exists()';
like $output, qr/2,000/, 'comify';
like $output, qr/nada worked/, 'nada worked';
eval {
HTML::Template::Expr->register_function('foo', 'bar');
};
like $@, qr/must be subroutine ref/, 'type check';
HTML-Template-Expr-0.07/t/02basic.t 0000644 0000764 0000764 00000001205 10402146120 016122 0 ustar sam sam 0000000 0000000 use Test::More tests => 3;
use HTML::Template::Expr;
my $template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'foo.tmpl');
$template->param(foo => 100);
my $output = $template->output();
like($output, qr/greater than/i, "greater than");
$template->param(foo => 10);
$output = $template->output();
like($output, qr/less than/i, "less than");
$template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'negative.tmpl');
$template->param(foo => 100);
$output = $template->output();
like($output, qr/Yes/, "negative numbers work");
HTML-Template-Expr-0.07/t/templates/ 0000755 0000764 0000764 00000000000 10421225461 016521 5 ustar sam sam 0000000 0000000 HTML-Template-Expr-0.07/t/templates/negative.tmpl 0000644 0000764 0000764 00000000047 10401715173 021224 0 ustar sam sam 0000000 0000000 Yes
HTML-Template-Expr-0.07/t/templates/complex.tmpl 0000644 0000764 0000764 00000002415 10402145721 021067 0 ustar sam sam 0000000 0000000 ...
Foo is greater than 10.
Bar and Foo.
Bar or Foo.
Multiple ors works
And 0 works
Addition and comparison 1
Addition and comparison 2
Addition and comparison 3
Bar - Foo =
Foo - Bar + 10 =
Math Works, Alright
My name is .
Yo, Alien is phat.
has letters, which is less than 10greater than 10 and greater than 5less than 5
HTML-Template-Expr-0.07/t/templates/extra_attributes.tmpl 0000644 0000764 0000764 00000000256 10421224103 023003 0 ustar sam sam 0000000 0000000
HTML-Template-Expr-0.07/t/templates/register.tmpl 0000644 0000764 0000764 00000000210 10421223571 021234 0 ustar sam sam 0000000 0000000 OK
nada worked
HTML-Template-Expr-0.07/t/templates/numerics.tmpl 0000644 0000764 0000764 00000000324 10401715173 021245 0 ustar sam sam 0000000 0000000 INT:
SQRT:
SQRT2:
SUM:
SPRINTF:
HTML-Template-Expr-0.07/t/templates/foo.tmpl 0000644 0000764 0000764 00000000211 10401715173 020176 0 ustar sam sam 0000000 0000000 Foo:
Foo is greater than 11.
Foo is less than or equal to 11.
HTML-Template-Expr-0.07/t/templates/func.tmpl 0000644 0000764 0000764 00000000122 10401715173 020347 0 ustar sam sam 0000000 0000000
HTML-Template-Expr-0.07/t/templates/loop.tmpl 0000644 0000764 0000764 00000001212 10401715173 020366 0 ustar sam sam 0000000 0000000 Foo is greater thanless than 10.
Name:
Stats:
[high][low][medium]
Color:
HTML-Template-Expr-0.07/t/05cache.t 0000644 0000764 0000764 00000003337 10401715173 016130 0 ustar sam sam 0000000 0000000 use Test::More tests => 15;
use HTML::Template::Expr;
use strict;
my ($template, $output);
# first load
$template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'numerics.tmpl',
cache => 1,
cache_debug => 0,
);
$template->param(float => 5.1,
four => 4);
$output = $template->output;
like($output, qr/INT: 5/, "int()");
like($output, qr/SQRT: 2/, "sqrt()");
like($output, qr/SQRT2: 4/, "sqrt() 2");
like($output, qr/SUM: 14/, "int(4 + 10.1)");
like($output, qr/SPRINTF: 14.1000/, "sprintf('%0.4f', (10.1 + 4))");
# load from cache
$template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'numerics.tmpl',
cache => 1,
cache_debug => 0,
);
$template->param(float => 5.1,
four => 4);
$output = $template->output;
like($output, qr/INT: 5/, "int()");
like($output, qr/SQRT: 2/, "sqrt()");
like($output, qr/SQRT2: 4/, "sqrt() 2");
like($output, qr/SUM: 14/, "int(4 + 10.1)");
like($output, qr/SPRINTF: 14.1000/, "sprintf('%0.4f', (10.1 + 4))");
# one more time...
$template = HTML::Template::Expr->new(path => ['t/templates'],
filename => 'numerics.tmpl',
cache => 1,
cache_debug => 0,
);
$template->param(float => 5.1,
four => 4);
$output = $template->output;
like($output, qr/INT: 5/, "int()");
like($output, qr/SQRT: 2/, "sqrt()");
like($output, qr/SQRT2: 4/, "sqrt() 2");
like($output, qr/SUM: 14/, "int(4 + 10.1)");
like($output, qr/SPRINTF: 14.1000/, "sprintf('%0.4f', (10.1 + 4))");
HTML-Template-Expr-0.07/MANIFEST 0000644 0000764 0000764 00000000730 10421225404 015406 0 ustar sam sam 0000000 0000000 Changes
Expr.pm
Makefile.PL
MANIFEST
README
t/00load.t
t/01parse.t
t/02basic.t
t/03complex.t
t/04register.t
t/05cache.t
t/06extra_attributes.t
t/templates/foo.tmpl
t/templates/complex.tmpl
t/templates/loop.tmpl
t/templates/func.tmpl
t/templates/complex.tmpl
t/templates/numerics.tmpl
t/templates/register.tmpl
t/templates/negative.tmpl
t/templates/extra_attributes.tmpl
GPL
ARTISTIC
ANNOUNCE
META.yml Module meta-data (added by MakeMaker)
HTML-Template-Expr-0.07/META.yml 0000644 0000764 0000764 00000000704 10421225461 015532 0 ustar sam sam 0000000 0000000 # http://module-build.sourceforge.net/META-spec.html
#XXXXXXX This is a prototype!!! It will change in the future!!! XXXXX#
name: HTML-Template-Expr
version: 0.07
version_from: Expr.pm
installdirs: site
requires:
HTML::Template: 2.4
Parse::RecDescent: 0
Test::More: 0
Text::Balanced: 0
distribution_type: module
generated_by: ExtUtils::MakeMaker version 6.17
HTML-Template-Expr-0.07/Makefile.PL 0000644 0000764 0000764 00000000716 10401715173 016240 0 ustar sam sam 0000000 0000000 use ExtUtils::MakeMaker;
WriteMakefile(
'NAME' => 'HTML::Template::Expr',
'VERSION_FROM' => 'Expr.pm',
'PREREQ_PM' => {
'HTML::Template' => '2.4',
'Parse::RecDescent' => 0,
'Text::Balanced' => 0,
'Test::More' => 0,
},
'ABSTRACT_FROM' => 'Expr.pm',
'AUTHOR' => 'Sam Tregar ',
);
HTML-Template-Expr-0.07/README 0000644 0000764 0000764 00000003402 10401715173 015141 0 ustar sam sam 0000000 0000000 HTML::Template::Expr version 0.05
=================================
CHANGES
- Added a compatibility fix required by HTML::Template v2.8.
DESCRIPTION
This module provides an extension to HTML::Template which allows
expressions in the template syntax. This is purely an addition - all
the normal HTML::Template options, syntax and behaviors will still
work. See L for details.
Expression support includes comparisons, math operations, string
operations and a mechanism to allow you add your own functions at
runtime.
INSTALLATION
To install this module type the following:
perl Makefile.PL
make
make test
make install
DEPENDENCIES
This module requires these other modules and libraries:
Parse::RecDescent
Text::Balanced
LICENSE
HTML::Template::Expr : HTML::Template extension adding expression support
Copyright (C) 2001 Sam Tregar (sam@tregar.com)
This module is free software; you can redistribute it and/or modify it
under the terms of either:
a) the GNU General Public License as published by the Free Software
Foundation; either version 1, or (at your option) any later version,
or
b) the "Artistic License" which comes with this module.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See either
the GNU General Public License or the Artistic License for more details.
You should have received a copy of the Artistic License with this
module, in the file ARTISTIC. If not, I'll be glad to provide one.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
USA
HTML-Template-Expr-0.07/Expr.pm 0000644 0000764 0000764 00000046302 10421225246 015542 0 ustar sam sam 0000000 0000000 package HTML::Template::Expr;
use strict;
use vars qw($VERSION);
$VERSION = '0.07';
use HTML::Template 2.4;
use Carp qw(croak confess carp);
use Parse::RecDescent;
use base 'HTML::Template';
use vars qw($GRAMMAR);
$GRAMMAR = <<'END';
expression : paren /^$/ { $return = $item[1] }
paren : '(' binary_op ')' { $item[2] }
| '(' subexpression ')' { $item[2] }
| subexpression { $item[1] }
| '(' paren ')' { $item[2] }
subexpression : function_call
| var
| literal
|
binary_op : paren (op paren { [ $item[2], $item[1] ] })(s)
{ $return = [ 'SUB_EXPR', $item[1], map { @$_ } @{$item[2]} ] }
op : />=?|<=?|!=|==/ { [ 'BIN_OP', $item[1] ] }
| /le|ge|eq|ne|lt|gt/ { [ 'BIN_OP', $item[1] ] }
| /\|\||or|&&|and/ { [ 'BIN_OP', $item[1] ] }
| /[-+*\/%]/ { [ 'BIN_OP', $item[1] ] }
function_call : function_name '(' args ')'
{ [ 'FUNCTION_CALL', $item[1], $item[3] ] }
| function_name ...'(' paren
{ [ 'FUNCTION_CALL', $item[1], [ $item[3] ] ] }
| function_name '(' ')'
{ [ 'FUNCTION_CALL', $item[1] ] }
function_name : /[A-Za-z_][A-Za-z0-9_]*/
args :
var : /[A-Za-z_][A-Za-z0-9_]*/ { [ 'VAR', $item[1] ] }
literal : /-?\d*\.\d+/ { [ 'LITERAL', $item[1] ] }
| /-?\d+/ { [ 'LITERAL', $item[1] ] }
| { [ 'LITERAL', $item[1][2] ] }
END
# create global parser
use vars qw($PARSER);
$PARSER = Parse::RecDescent->new($GRAMMAR);
# initialize preset function table
use vars qw(%FUNC);
%FUNC =
(
'sprintf' => sub { sprintf(shift, @_); },
'substr' => sub {
return substr($_[0], $_[1]) if @_ == 2;
return substr($_[0], $_[1], $_[2]);
},
'lc' => sub { lc($_[0]); },
'lcfirst' => sub { lcfirst($_[0]); },
'uc' => sub { uc($_[0]); },
'ucfirst' => sub { ucfirst($_[0]); },
'length' => sub { length($_[0]); },
'defined' => sub { defined($_[0]); },
'abs' => sub { abs($_[0]); },
'atan2' => sub { atan2($_[0], $_[1]); },
'cos' => sub { cos($_[0]); },
'exp' => sub { exp($_[0]); },
'hex' => sub { hex($_[0]); },
'int' => sub { int($_[0]); },
'log' => sub { log($_[0]); },
'oct' => sub { oct($_[0]); },
'rand' => sub { rand($_[0]); },
'sin' => sub { sin($_[0]); },
'sqrt' => sub { sqrt($_[0]); },
'srand' => sub { srand($_[0]); },
);
sub new {
my $pkg = shift;
my $self;
# check hashworthyness
croak("HTML::Template::Expr->new() called with odd number of option parameters - should be of the form option => value")
if (@_ % 2);
my %options = @_;
# check for unsupported options file_cache and shared_cache
croak("HTML::Template::Expr->new() : sorry, this module won't work with file_cache or shared_cache modes. This will hopefully be fixed in an upcoming version.")
if ($options{file_cache} or $options{shared_cache});
# push on our filter, one way or another. Why did I allow so many
# different ways to say the same thing? Was I smoking crack?
my @expr;
if (exists $options{filter}) {
# CODE => ARRAY
$options{filter} = [ { 'sub' => $options{filter},
'format' => 'scalar' } ]
if ref($options{filter}) eq 'CODE';
# HASH => ARRAY
$options{filter} = [ $options{filter} ]
if ref($options{filter}) eq 'HASH';
# push onto ARRAY
if (ref($options{filter}) eq 'ARRAY') {
push(@{$options{filter}}, { 'sub' => sub { _expr_filter(\@expr, @_); },
'format' => 'scalar' });
} else {
# unrecognized
croak("HTML::Template::Expr->new() : bad format for filter argument. Please check the HTML::Template docs for the allowed forms.");
}
} else {
# new filter
$options{filter} = [ { 'sub' => sub { _expr_filter(\@expr, @_) },
'format' => 'scalar'
} ];
}
# force global_vars on
$options{global_vars} = 1;
# create an HTML::Template object, catch the results to keep error
# message line-numbers helpful.
eval {
$self = $pkg->SUPER::new(%options,
expr => \@expr,
expr_func => $options{functions} || {});
};
croak("HTML::Template::Expr->new() : Error creating HTML::Template object : $@") if $@;
return $self;
}
sub _expr_filter {
my $expr = shift;
my $text = shift;
# find expressions and create parse trees
my ($ref, $tree, $before_expr, $expr_text, $after_expr, $vars, $which, $out);
$$text =~ s/
<(?:!--\s*)?
[Tt][Mm][Pp][Ll]_
([Ii][Ff]|[Uu][Nn][Ll][Ee][Ss][Ss]|[Vv][Aa][Rr]) # $1 => which tag
(\s+[^<]+)? # $2 => before expr
\s+[Ee][Xx][Pp][Rr]=
"([^"]*)" # $3 => the actual expr
(\s+[^>-]+)? # $4 => after expr
\s*(?:--)?>
/
$which = $1;
$before_expr = $2 || '';
$expr_text = $3;
$after_expr = $4 || '';
# add enclosing parens to keep grammar simple
$expr_text = "($expr_text)";
# parse the expression
eval {
$tree = $PARSER->expression($expr_text);
};
croak("HTML::Template::Expr : Unable to parse expression: $expr_text")
if $@ or not $tree;
# stub out variables needed by the expression
$out = "";
foreach my $var (_expr_vars($tree)) {
next unless defined $var;
$out .= "";
}
# save parse tree for later
push(@$expr, $tree);
# add the expression placeholder and replace
$out . "<\/tmpl_if>";
/xeg;
# stupid emacs - /
return;
}
# find all variables in a parse tree
sub _expr_vars {
my $tree = shift;
my %vars;
# hunt for VAR nodes in the tree
my @stack = @$tree;
while (@stack) {
my $node = shift @stack;
if (ref $node and ref $node eq 'ARRAY') {
if ($node->[0] eq 'VAR') {
$vars{$node->[1]} = 1;
} else {
push @stack, @$node;
}
}
}
return keys %vars;
}
# allow loops to stay as HTML::Template objects, we don't need to
# override output for them
sub _new_from_loop {
my ($pkg, @args) = @_;
return HTML::Template->_new_from_loop(@args);
}
sub output {
my $self = shift;
my $parse_stack = $self->{parse_stack};
my $options = $self->{options};
my ($expr, $expr_func);
# pull expr and expr_func out of the parse_stack for cache mode.
if ($options->{cache}) {
$expr = pop @$parse_stack;
$expr_func = pop @$parse_stack;
} else {
$expr = $options->{expr};
$expr_func = $options->{expr_func};
}
# setup expression evaluators
my %param;
for (my $x = 0; $x < @$expr; $x++) {
my $node = $expr->[$x];
$param{"__expr_" . $x . "__"} = sub { _expr_evaluate($node, @_) };
}
$self->param(\%param);
# setup %FUNC
local %FUNC = (%FUNC, %$expr_func);
my $result = $self->SUPER::output(@_);
# restore cached values to their hideout in the parse_stack
if ($options->{cache}) {
push @$parse_stack, $expr_func;
push @$parse_stack, $expr;
}
return $result;
}
sub _expr_evaluate {
my ($tree, $template) = @_;
my ($op, $lhs, $rhs, $node, $type, @stack);
my @nodes = $tree;
while (@nodes) {
my $node = shift @nodes;
my $type = $node->[0];
if ($type eq 'LITERAL') {
push @stack, $node->[1];
next;
}
if ($type eq 'VAR') {
push @stack, $template->param($node->[1]);
next;
}
if ($type eq 'SUB_EXPR') {
unshift @nodes, @{$node}[1..$#{$node}];
next;
}
if ($type eq 'BIN_OP') {
$op = $node->[1];
$rhs = pop(@stack);
$lhs = pop(@stack);
# do the op
if ($op eq '==') {push @stack, $lhs == $rhs; next; }
if ($op eq 'eq') {push @stack, $lhs eq $rhs; next; }
if ($op eq '>') {push @stack, $lhs > $rhs; next; }
if ($op eq '<') {push @stack, $lhs < $rhs; next; }
if ($op eq '!=') {push @stack, $lhs != $rhs; next; }
if ($op eq 'ne') {push @stack, $lhs ne $rhs; next; }
if ($op eq '>=') {push @stack, $lhs >= $rhs; next; }
if ($op eq '<=') {push @stack, $lhs <= $rhs; next; }
if ($op eq '+') {push @stack, $lhs + $rhs; next; }
if ($op eq '-') {push @stack, $lhs - $rhs; next; }
if ($op eq '/') {push @stack, $lhs / $rhs; next; }
if ($op eq '*') {push @stack, $lhs * $rhs; next; }
if ($op eq '%') {push @stack, $lhs % $rhs; next; }
if ($op eq 'le') {push @stack, $lhs le $rhs; next; }
if ($op eq 'ge') {push @stack, $lhs ge $rhs; next; }
if ($op eq 'lt') {push @stack, $lhs lt $rhs; next; }
if ($op eq 'gt') {push @stack, $lhs gt $rhs; next; }
# short circuit or
if ($op eq 'or' or $op eq '||') {
if ($lhs) {
push @stack, 1;
next;
}
if ($rhs) {
push @stack, 1;
next;
}
push @stack, 0;
next;
}
# short circuit and
if ($op eq '&&' or $op eq 'and') {
unless ($lhs) {
push @stack, 0;
next;
}
unless ($rhs) {
push @stack, 0;
next;
}
push @stack, 1;
next;
}
confess("HTML::Template::Expr : unknown op: $op");
}
if ($type eq 'FUNCTION_CALL') {
my $name = $node->[1];
my $args = $node->[2];
croak("HTML::Template::Expr : found unknown subroutine call ".
": $name.\n")
unless exists($FUNC{$name});
if (defined $args) {
push @stack,
scalar
$FUNC{$name}->(map { _expr_evaluate($_, $template) } @$args);
} else {
push @stack, scalar $FUNC{$name}->();
}
next;
}
confess("HTML::Template::Expr : unrecognized node in tree: $node");
}
unless (@stack == 1) {
confess("HTML::Template::Expr : stack overflow! ".
"Please report this bug to the maintainer.");
}
return $stack[0];
}
sub register_function {
my($class, $name, $sub) = @_;
croak("HTML::Template::Expr : args 3 of register_function must be subroutine reference\n")
unless ref($sub) eq 'CODE';
$FUNC{$name} = $sub;
}
# Make caching work right by hiding our vars in the parse_stack
# between cache store and load. This is such a hack.
sub _commit_to_cache {
my $self = shift;
my $parse_stack = $self->{parse_stack};
push @$parse_stack, $self->{options}{expr_func};
push @$parse_stack, $self->{options}{expr};
my $result = HTML::Template::_commit_to_cache($self, @_);
}
1;
__END__
=pod
=head1 NAME
HTML::Template::Expr - HTML::Template extension adding expression support
=head1 SYNOPSIS
use HTML::Template::Expr;
my $template = HTML::Template::Expr->new(filename => 'foo.tmpl');
$template->param(banana_count => 10);
print $template->output();
=head1 DESCRIPTION
This module provides an extension to HTML::Template which allows
expressions in the template syntax. This is purely an addition - all
the normal HTML::Template options, syntax and behaviors will still
work. See L for details.
Expression support includes comparisons, math operations, string
operations and a mechanism to allow you add your own functions at
runtime. The basic syntax is:
I've got a lot of bananas.
This will output "I've got a lot of bananas" if you call:
$template->param(banana_count => 100);
In your script. s also work with expressions:
I'd like to have bananas.
This will output "I'd like to have 200 bananas." with the same param()
call as above.
=head1 MOTIVATION
Some of you may wonder if I've been replaced by a pod person. Just
for the record, I still think this sort of thing should be avoided.
However, I realize that there are some situations where allowing the
template author some programatic leeway can be invaluable.
If you don't like it, don't use this module. Keep using plain ol'
HTML::Template - I know I will! However, if you find yourself needing
a little programming in your template, for whatever reason, then this
module may just save you from HTML::Mason.
=head1 BASIC SYNTAX
Variables are unquoted alphanumeric strings with the same restrictions
as variable names in HTML::Template. Their values are set through
param(), just like normal HTML::Template variables. For example,
these two lines are equivalent:
Numbers are unquoted strings of numbers and may have a single "." to
indicate a floating point number. For example:
String constants must be enclosed in quotes, single or double. For example:
You can string together operators to produce complex booleans:
I'm in a complex situation.
The parser is pretty simple, so you may need to use parenthesis to get
the desired precedence.
=head1 COMPARISON
Here's a list of supported comparison operators:
=over 4
=item * Numeric Comparisons
=over 4
=item * E
=item * E
=item * ==
=item * !=
=item * E=
=item * E=
=item * E=E
=back 4
=item * String Comparisons
=over 4
=item * gt
=item * lt
=item * eq
=item * ne
=item * ge
=item * le
=item * cmp
=back 4
=back 4
=head1 MATHEMATICS
The basic operators are supported:
=over 4
=item * +
=item * -
=item * *
=item * /
=item * %
=back 4
There are also some mathy functions. See the FUNCTIONS section below.
=head1 LOGIC
Boolean logic is available:
=over 4
=item * && (synonym: and)
=item * || (synonym: or)
=back 4
=head1 FUNCTIONS
The following functions are available to be used in expressions. See
perldoc perlfunc for details.
=over 4
=item * sprintf
=item * substr (2 and 3 arg versions only)
=item * lc
=item * lcfirst
=item * uc
=item * ucfirst
=item * length
=item * defined
=item * abs
=item * atan2
=item * cos
=item * exp
=item * hex
=item * int
=item * log
=item * oct
=item * rand
=item * sin
=item * sqrt
=item * srand
=back 4
All functions must be called using full parenthesis. For example,
this is a syntax error:
But this is good:
=head1 DEFINING NEW FUNCTIONS
To define a new function, pass a C option to new:
$t = HTML::Template::Expr->new(filename => 'foo.tmpl',
functions =>
{ func_name => \&func_handler });
Or, you can use C class method to register
the function globally:
HTML::Template::Expr->register_function(func_name => \&func_handler);
You provide a subroutine reference that will be called during output.
It will recieve as arguments the parameters specified in the template.
For example, here's a function that checks if a directory exists:
sub directory_exists {
my $dir_name = shift;
return 1 if -d $dir_name;
return 0;
}
If you call HTML::Template::Expr->new() with a C arg:
$t = HTML::Template::Expr->new(filename => 'foo.tmpl',
functions => {
directory_exists => \&directory_exists
});
Then you can use it in your template:
This can be abused in ways that make my teeth hurt.
=head1 MOD_PERL TIP
C class method can be called in mod_perl's
startup.pl to define widely used common functions to
HTML::Template::Expr. Add something like this to your startup.pl:
use HTML::Template::Expr;
HTML::Template::Expr->register_function(foozicate => sub { ... });
HTML::Template::Expr->register_function(barify => sub { ... });
HTML::Template::Expr->register_function(baznate => sub { ... });
You might also want to pre-compile some commonly used templates and
cache them. See L's FAQ for instructions.
=head1 CAVEATS
Currently the module forces the HTML::Template global_vars option to
be set. This will hopefully go away in a future version, so if you
need global_vars in your templates then you should set it explicitely.
The module won't work with HTML::Template's file_cache or shared_cache
modes, but normal memory caching should work. I hope to address this
is a future version.
The module is inefficient, both in parsing and evaluation. I'll be
working on this for future versions and patches are always welcome.
=head1 BUGS
I am aware of no bugs - if you find one, join the mailing list and
tell us about it. You can join the HTML::Template mailing-list by
visiting:
http://lists.sourceforge.net/lists/listinfo/html-template-users
Of course, you can still email me directly (sam@tregar.com) with bugs,
but I reserve the right to forward bug reports to the mailing list.
When submitting bug reports, be sure to include full details,
including the VERSION of the module, a test script and a test template
demonstrating the problem!
=head1 CREDITS
The following people have generously submitted bug reports, patches
and ideas:
Peter Leonard
Tatsuhiko Miyagawa
Don Brodale
Thanks!
=head1 AUTHOR
Sam Tregar
=head1 LICENSE
HTML::Template::Expr : HTML::Template extension adding expression support
Copyright (C) 2001 Sam Tregar (sam@tregar.com)
This module is free software; you can redistribute it and/or modify it
under the terms of either:
a) the GNU General Public License as published by the Free Software
Foundation; either version 1, or (at your option) any later version,
or
b) the "Artistic License" which comes with this module.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See either
the GNU General Public License or the Artistic License for more details.
You should have received a copy of the Artistic License with this
module, in the file ARTISTIC. If not, I'll be glad to provide one.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
USA
HTML-Template-Expr-0.07/GPL 0000644 0000764 0000764 00000043127 10401715173 014636 0 ustar sam sam 0000000 0000000 GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C) 19yy
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19yy name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
HTML-Template-Expr-0.07/ANNOUNCE 0000644 0000764 0000764 00000002156 10421225276 015421 0 ustar sam sam 0000000 0000000 ANNOUNCEMENT: HTML::Template::Expr 0.07
CHANGES
- Added support for ESCAPE attribute in combination with EXPR.
(Michael Peters)
- Fixed a bug where functions which returned 0 or more than one
return value would cause a stack under or overflow. Functions
are now called in scalar context, eliminating the problem.
Thanks to Jamie Krasnoo for the spot.
DESCRIPTION
This module provides an extension to HTML::Template which allows
expressions in the template syntax. This is purely an addition - all
the normal HTML::Template options, syntax and behaviors will still
work.
Expression support includes comparisons, math operations, string
operations and a mechanism to allow you add your own functions at
runtime.
AVAILABILITY
This module is available on SourceForge. Download it at:
http://html-template.sourceforge.net
The module is also available on CPAN. You can get it using CPAN.pm or
go to:
http://www.cpan.org/authors/id/S/SA/SAMTREGAR/
CONTACT INFO
You can join the HTML::Template mailing-list by visiting:
http://lists.sourceforge.net/lists/listinfo/html-template-users
HTML-Template-Expr-0.07/Changes 0000644 0000764 0000764 00000002441 10421224230 015545 0 ustar sam sam 0000000 0000000 0.07
- Added support for ESCAPE attribute in combination with EXPR.
(Michael Peters)
- Fixed a bug where functions which returned 0 or more than one
return value would cause a stack under or overflow. Functions
are now called in scalar context, eliminating the problem.
Thanks to Jamie Krasnoo for the spot.
0.06
- Rewrote grammar to support expressions with less parenthesis.
For example, "foo || bar || baz" now works.
0.05 Wed Dec 21 18:56:49 EST 2005
- Added a compatibility fix required by HTML::Template v2.8.
0.04 Thu Aug 29 12:00:00 2002
- Fixed parser to recognize negative numbers. Thanks to Fran
Fabrizio for the report.
- Fixed parser to allow for HTML-comment style tags. Thanks to
Stuhlpfarrer Gerhard for the spot.
- Updated mailing-list information to reflect move from vm.com to
sourceforge.net
0.03
- Added register_function() class method add functions globally.
(Tatsuhiko Miyagawa)
- Fixed broken cache mode.
0.02
- Fixed bug where numeric functions all returned 1.
(reported by Peter Leonard)
- Improved performance over 300% with a new grammar and expression
evaluator.
- Enhanced grammar to support call(foo > 10) syntax.
0.01
- Initial Release.
HTML-Template-Expr-0.07/ARTISTIC 0000644 0000764 0000764 00000013737 10401715173 015442 0 ustar sam sam 0000000 0000000
The "Artistic License"
Preamble
The intent of this document is to state the conditions under which a
Package may be copied, such that the Copyright Holder maintains some
semblance of artistic control over the development of the package,
while giving the users of the package the right to use and distribute
the Package in a more-or-less customary fashion, plus the right to make
reasonable modifications.
Definitions:
"Package" refers to the collection of files distributed by the
Copyright Holder, and derivatives of that collection of files
created through textual modification.
"Standard Version" refers to such a Package if it has not been
modified, or has been modified in accordance with the wishes
of the Copyright Holder as specified below.
"Copyright Holder" is whoever is named in the copyright or
copyrights for the package.
"You" is you, if you're thinking about copying or distributing
this Package.
"Reasonable copying fee" is whatever you can justify on the
basis of media cost, duplication charges, time of people involved,
and so on. (You will not be required to justify it to the
Copyright Holder, but only to the computing community at large
as a market that must bear the fee.)
"Freely Available" means that no fee is charged for the item
itself, though there may be fees involved in handling the item.
It also means that recipients of the item may redistribute it
under the same conditions they received it.
1. You may make and give away verbatim copies of the source form of the
Standard Version of this Package without restriction, provided that you
duplicate all of the original copyright notices and associated disclaimers.
2. You may apply bug fixes, portability fixes and other modifications
derived from the Public Domain or from the Copyright Holder. A Package
modified in such a way shall still be considered the Standard Version.
3. You may otherwise modify your copy of this Package in any way, provided
that you insert a prominent notice in each changed file stating how and
when you changed that file, and provided that you do at least ONE of the
following:
a) place your modifications in the Public Domain or otherwise make them
Freely Available, such as by posting said modifications to Usenet or
an equivalent medium, or placing the modifications on a major archive
site such as uunet.uu.net, or by allowing the Copyright Holder to include
your modifications in the Standard Version of the Package.
b) use the modified Package only within your corporation or organization.
c) rename any non-standard executables so the names do not conflict
with standard executables, which must also be provided, and provide
a separate manual page for each non-standard executable that clearly
documents how it differs from the Standard Version.
d) make other distribution arrangements with the Copyright Holder.
4. You may distribute the programs of this Package in object code or
executable form, provided that you do at least ONE of the following:
a) distribute a Standard Version of the executables and library files,
together with instructions (in the manual page or equivalent) on where
to get the Standard Version.
b) accompany the distribution with the machine-readable source of
the Package with your modifications.
c) give non-standard executables non-standard names, and clearly
document the differences in manual pages (or equivalent), together
with instructions on where to get the Standard Version.
d) make other distribution arrangements with the Copyright Holder.
5. You may charge a reasonable copying fee for any distribution of this
Package. You may charge any fee you choose for support of this
Package. You may not charge a fee for this Package itself. However,
you may distribute this Package in aggregate with other (possibly
commercial) programs as part of a larger (possibly commercial) software
distribution provided that you do not advertise this Package as a
product of your own. You may embed this Package's interpreter within
an executable of yours (by linking); this shall be construed as a mere
form of aggregation, provided that the complete Standard Version of the
interpreter is so embedded.
6. The scripts and library files supplied as input to or produced as
output from the programs of this Package do not automatically fall
under the copyright of this Package, but belong to whoever generated
them, and may be sold commercially, and may be aggregated with this
Package. If such scripts or library files are aggregated with this
Package via the so-called "undump" or "unexec" methods of producing a
binary executable image, then distribution of such an image shall
neither be construed as a distribution of this Package nor shall it
fall under the restrictions of Paragraphs 3 and 4, provided that you do
not represent such an executable image as a Standard Version of this
Package.
7. C subroutines (or comparably compiled subroutines in other
languages) supplied by you and linked into this Package in order to
emulate subroutines and variables of the language defined by this
Package shall not be considered part of this Package, but are the
equivalent of input as in Paragraph 6, provided these subroutines do
not change the language in any way that would cause it to fail the
regression tests for the language.
8. Aggregation of this Package with a commercial distribution is always
permitted provided that the use of this Package is embedded; that is,
when no overt attempt is made to make this Package's interfaces visible
to the end user of the commercial distribution. Such use shall not be
construed as a distribution of this Package.
9. The name of the Copyright Holder may not be used to endorse or promote
products derived from this software without specific prior written permission.
10. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
The End