r3946 - in
/packages/libtie-array-sorted-perl/branches/upstream/current:
Changes MANIFEST META.yml README lib/Tie/Array/Sorted.pm
gwolf at users.alioth.debian.org
gwolf at users.alioth.debian.org
Tue Sep 26 22:44:11 UTC 2006
Author: gwolf
Date: Tue Sep 26 22:44:10 2006
New Revision: 3946
URL: http://svn.debian.org/wsvn/pkg-perl/?sc=1&rev=3946
Log:
Load /tmp/tmp.ByUCC28028/libtie-array-sorted-perl-1.41 into
packages/libtie-array-sorted-perl/branches/upstream/current.
Added:
packages/libtie-array-sorted-perl/branches/upstream/current/README
Modified:
packages/libtie-array-sorted-perl/branches/upstream/current/Changes
packages/libtie-array-sorted-perl/branches/upstream/current/MANIFEST
packages/libtie-array-sorted-perl/branches/upstream/current/META.yml
packages/libtie-array-sorted-perl/branches/upstream/current/lib/Tie/Array/Sorted.pm
Modified: packages/libtie-array-sorted-perl/branches/upstream/current/Changes
URL: http://svn.debian.org/wsvn/pkg-perl/packages/libtie-array-sorted-perl/branches/upstream/current/Changes?rev=3946&op=diff
==============================================================================
--- packages/libtie-array-sorted-perl/branches/upstream/current/Changes (original)
+++ packages/libtie-array-sorted-perl/branches/upstream/current/Changes Tue Sep 26 22:44:10 2006
@@ -1,4 +1,8 @@
Revision history for Perl extension Tie::Array::Sorted.
+
+1.41 Mon Jan 16 11:23:14 UTC 2006
+ - Note that this is effectively unmaintained now that it is no
+ longer used by Plucene
1.4 Sat Sep 3 20:29:42 UTC 2005
- Test for sort method calling object methods
Modified: packages/libtie-array-sorted-perl/branches/upstream/current/MANIFEST
URL: http://svn.debian.org/wsvn/pkg-perl/packages/libtie-array-sorted-perl/branches/upstream/current/MANIFEST?rev=3946&op=diff
==============================================================================
--- packages/libtie-array-sorted-perl/branches/upstream/current/MANIFEST (original)
+++ packages/libtie-array-sorted-perl/branches/upstream/current/MANIFEST Tue Sep 26 22:44:10 2006
@@ -4,6 +4,7 @@
Makefile.PL
MANIFEST
META.yml Module meta-data (added by MakeMaker)
+README
t/1.t
t/pod-coverage.t
t/pod.t
Modified: packages/libtie-array-sorted-perl/branches/upstream/current/META.yml
URL: http://svn.debian.org/wsvn/pkg-perl/packages/libtie-array-sorted-perl/branches/upstream/current/META.yml?rev=3946&op=diff
==============================================================================
--- packages/libtie-array-sorted-perl/branches/upstream/current/META.yml (original)
+++ packages/libtie-array-sorted-perl/branches/upstream/current/META.yml Tue Sep 26 22:44:10 2006
@@ -1,7 +1,7 @@
# http://module-build.sourceforge.net/META-spec.html
#XXXXXXX This is a prototype!!! It will change in the future!!! XXXXX#
name: Tie-Array-Sorted
-version: 1.4
+version: 1.41
version_from: lib/Tie/Array/Sorted.pm
installdirs: site
requires:
Added: packages/libtie-array-sorted-perl/branches/upstream/current/README
URL: http://svn.debian.org/wsvn/pkg-perl/packages/libtie-array-sorted-perl/branches/upstream/current/README?rev=3946&op=file
==============================================================================
--- packages/libtie-array-sorted-perl/branches/upstream/current/README (added)
+++ packages/libtie-array-sorted-perl/branches/upstream/current/README Tue Sep 26 22:44:10 2006
@@ -1,0 +1,58 @@
+NAME
+ Tie::Array::Sorted - An array which is kept sorted
+
+SYNOPSIS
+ use Tie::Array::Sorted;
+
+ tie @a, "Tie::Array::Sorted", sub { $_[0] <=> $_[1] };
+
+ push @a, 10, 4, 7, 3, 4;
+ print "@a"; # "3 4 4 7 10"
+
+DESCRIPTION
+ This presents an ordinary array, but is kept sorted. All pushes and
+ unshifts cause the elements in question to be inserted in the
+ appropriate location to maintain order.
+
+ Direct stores ("$a[10] = "wibble"") effectively splice out the original
+ value and insert the new element. It's not clear why you'd want to use
+ direct stores like that, but this module does the right thing if you do.
+
+ If you don't like the ordinary lexical comparator, you can provide your
+ own; it should compare the two elements it is given. For instance, a
+ numeric comparator would look like this:
+
+ tie @a, "Tie::Array::Sorted", sub { $_[0] <=> $_[1] }
+
+ Whereas to compare a list of files by their sizes, you'd so something
+ like:
+
+ tie @a, "Tie::Array::Sorted", sub { -s $_[0] <=> -s $_[1] }
+
+LAZY SORTING
+ If you do more stores than fetches, you may find
+ Tie::Array::Sorted::Lazy more efficient.
+
+AUTHOR
+ Original author: Simon Cozens
+
+ Current maintainer: Tony Bowden
+
+BUGS and QUERIES
+ Please direct all correspondence regarding this module to:
+ bug-Tie-Array-Sorted at rt.cpan.org
+
+ This module was originall written as part of the Plucene project.
+ However, as Plucene no longer uses this, it is effectively unmaintained.
+
+COPYRIGHT AND LICENSE
+ Copyright (C) 2003-2006 Simon Cozens and Tony Bowden.
+
+ This program is free software; you can redistribute it and/or modify it under
+ the terms of the GNU General Public License; 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.
+
Modified: packages/libtie-array-sorted-perl/branches/upstream/current/lib/Tie/Array/Sorted.pm
URL: http://svn.debian.org/wsvn/pkg-perl/packages/libtie-array-sorted-perl/branches/upstream/current/lib/Tie/Array/Sorted.pm?rev=3946&op=diff
==============================================================================
--- packages/libtie-array-sorted-perl/branches/upstream/current/lib/Tie/Array/Sorted.pm (original)
+++ packages/libtie-array-sorted-perl/branches/upstream/current/lib/Tie/Array/Sorted.pm Tue Sep 26 22:44:10 2006
@@ -7,7 +7,7 @@
use base 'Tie::Array';
-our $VERSION = '1.4';
+our $VERSION = '1.41';
=head1 NAME
@@ -45,8 +45,8 @@
=head1 LAZY SORTING
-If you do more stores than fetches, you may wish to use
-Tie::Array::Sorted::Lazy instead.
+If you do more stores than fetches, you may find
+L<Tie::Array::Sorted::Lazy> more efficient.
=cut
@@ -110,9 +110,12 @@
Please direct all correspondence regarding this module to:
bug-Tie-Array-Sorted at rt.cpan.org
+This module was originall written as part of the L<Plucene> project.
+However, as Plucene no longer uses this, it is effectively unmaintained.
+
=head1 COPYRIGHT AND LICENSE
- Copyright (C) 2003-2005 Tony Bowden.
+ Copyright (C) 2003-2006 Simon Cozens and Tony Bowden.
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License; either version 2 of the License,
More information about the Pkg-perl-cvs-commits
mailing list