[Rt-commit] r5597 - in Scalar-Defer: .
audreyt at bestpractical.com
audreyt at bestpractical.com
Mon Jul 17 22:10:14 EDT 2006
Author: audreyt
Date: Mon Jul 17 22:10:14 2006
New Revision: 5597
Modified:
Scalar-Defer/Changes
Scalar-Defer/README
Scalar-Defer/lib/Scalar/Defer.pm
Log:
* 0.03.
* Documentation cleanup; no functional changes.
Modified: Scalar-Defer/Changes
==============================================================================
--- Scalar-Defer/Changes (original)
+++ Scalar-Defer/Changes Mon Jul 17 22:10:14 2006
@@ -1,3 +1,7 @@
+[Changes for 0.03 - 2006-07-17]
+
+* Documentation cleanup; no functional changes.
+
[Changes for 0.02 - 2006-07-17]
* Changed name from Data::Thunk to Scalar::Defer, per suggestion
Modified: Scalar-Defer/README
==============================================================================
--- Scalar-Defer/README (original)
+++ Scalar-Defer/README Mon Jul 17 22:10:14 2006
@@ -5,8 +5,8 @@
use Scalar::Defer; # exports 'defer' and 'lazy'
my ($x, $y);
- my $dv = defer { ++$y }; # a defer-value (not memoized)
- my $lv = lazy { ++$x }; # a lazy-value (memoized)
+ my $dv = defer { ++$x }; # a defer-value (not memoized)
+ my $lv = lazy { ++$y }; # a lazy-value (memoized)
print "$dv $dv $dv"; # 1 2 3
print "$lv $lv $lv"; # 1 1 1
@@ -22,20 +22,21 @@
lazy {...}
Like "defer", except the value is computed at most once. Subsequent
- evaluation will simly use the cached result.
+ evaluation will simply use the cached result.
NOTES
- Unlike the "tie" based Data::Lazy, this module operates on *values*, not
- *variables*. Therefore, assigning into $t simply replaces the value.
+ Unlike the "tie"-based Data::Lazy, this module operates on *values*, not
+ *variables*. Therefore, assigning into $dv and $lv above will simply
+ replace the value, instead of triggering a "STORE" method call.
- The "overload" based implementation also makes this module about 2x
- faster than Data::Lazy.
+ Also, thanks to the "overload"-based implementation, this module is
+ about 2x faster than Data::Lazy.
AUTHORS
Audrey Tang <cpan at audreyt.org>
COPYRIGHT (The "MIT" License)
- Copyright 2002-2006 by Audrey Tang <cpan at audreyt.org>.
+ Copyright 2006 by Audrey Tang <cpan at audreyt.org>.
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the
Modified: Scalar-Defer/lib/Scalar/Defer.pm
==============================================================================
--- Scalar-Defer/lib/Scalar/Defer.pm (original)
+++ Scalar-Defer/lib/Scalar/Defer.pm Mon Jul 17 22:10:14 2006
@@ -1,5 +1,5 @@
package Scalar::Defer;
-$Scalar::Defer::VERSION = '0.02';
+$Scalar::Defer::VERSION = '0.03';
use 5.006;
use strict;
@@ -48,8 +48,8 @@
use Scalar::Defer; # exports 'defer' and 'lazy'
my ($x, $y);
- my $dv = defer { ++$y }; # a defer-value (not memoized)
- my $lv = lazy { ++$x }; # a lazy-value (memoized)
+ my $dv = defer { ++$x }; # a defer-value (not memoized)
+ my $lv = lazy { ++$y }; # a lazy-value (memoized)
print "$dv $dv $dv"; # 1 2 3
print "$lv $lv $lv"; # 1 1 1
@@ -72,12 +72,12 @@
=head1 NOTES
-Unlike the C<tie> based L<Data::Lazy>, this module operates on I<values>,
+Unlike the C<tie>-based L<Data::Lazy>, this module operates on I<values>,
not I<variables>. Therefore, assigning into C<$dv> and C<$lv> above will
simply replace the value, instead of triggering a C<STORE> method call.
-The C<overload> based implementation also makes this module about 2x faster
-than L<Data::Lazy>.
+Also, thanks to the C<overload>-based implementation, this module is about
+2x faster than L<Data::Lazy>.
=head1 AUTHORS
@@ -85,7 +85,7 @@
=head1 COPYRIGHT (The "MIT" License)
-Copyright 2002-2006 by Audrey Tang <cpan at audreyt.org>.
+Copyright 2006 by Audrey Tang <cpan at audreyt.org>.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
More information about the Rt-commit
mailing list