@@ -1,6 +1,30 @@
Change log for Tie-LLHash:
-1.003
+Development
+
+1.004 2014-10-03 XAERXESS
+
+ - added explicit SCALAR implementation, as perltie suggests
+
+ - added warning about hash behavior in scalar context on Perls < 5.8.3
+
+ - updated README
+
+1.003_01 2014-09-30 XAERXESS
+
+ - Grzegorz Rożniecki (XAERXESS) has taken over maintenance
+
+ - updated revision history in Changes (as per CPAN::Changes::Spec)
+
+ - cleaned up documentation
+
+ - moved LLHash.pm to lib/Tie/LLHash.pm
+
+ - tweaked Makefile.PL
+
+ - migrated tests to Test::More
+
+1.003 2004-03-13 16:53:28
- delete($hash{$key}) now returns the associated value, previously it
returned an internal data structure not meant for external use.
@@ -12,19 +36,19 @@ Change log for Tie-LLHash:
- Un-synchronized version numbers with CVS
-1.002 2000/04/01 16:04:27
+1.002 2000-04-01 16:04:27
- Added more documentation about the differences between this module and
Tie::IxHash.
-
+
- Synchronized version numbers with CVS.
-0.04 Wed Dec 1 22:51:01 EST 1999
+0.04 1999-12-01 22:51:01
- Added 'lazy-mode', which allows you to append new entries to the end
of the hash by assigning to the hash by doing $hash{key} = 'value';
-
-0.03
+
+0.03 1998-09-29 20:14:53
- fixed a fatal bug in the current_value() method
@@ -34,7 +58,7 @@ Change log for Tie-LLHash:
- wrote documentation for the non-TIEHASH methods
-0.02 Wed May 20 19:21:52 1998
+0.02 1998-05-20 19:21:52
- forgot to include a README file in the original distribution, so I
added one now
@@ -50,12 +74,10 @@ Change log for Tie-LLHash:
- can give initialization hash for tie() constructor
-0.01 Mon May 11 17:45:43 1998
+0.01 1998-05-11 17:45:43
- original version; created by h2xs 1.18
- wrote tests 2-6
- thanks to Byron Brummer who pointed out a pre-release bug in the EXISTS method
-
-
@@ -0,0 +1,372 @@
+This is free software; you can redistribute it and/or modify it under
+the same terms as the Perl 5 programming language system itself.
+
+Terms of the Perl programming language system itself
+
+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"
+
+--- The GNU General Public License, Version 1, February 1989 ---
+
+This is free software, licensed under:
+
+ The GNU General Public License, Version 1, February 1989
+
+ GNU GENERAL PUBLIC LICENSE
+ Version 1, February 1989
+
+ Copyright (C) 1989 Free Software Foundation, Inc.
+ 51 Franklin St, Suite 500, Boston, MA 02110-1335 USA
+
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The license agreements of most software companies try to keep users
+at the mercy of those companies. By contrast, our 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. The
+General Public License applies to the Free Software Foundation's
+software and to any other program whose authors commit to using it.
+You can use it for your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Specifically, the General Public License is designed to make
+sure that you have the freedom to give away or sell copies of free
+software, 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 a 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 tell them 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.
+
+ 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 Agreement 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 work containing the
+Program or a portion of it, either verbatim or with modifications. Each
+licensee is addressed as "you".
+
+ 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
+General Public License and to the absence of any warranty; and give any
+other recipients of the Program a copy of this General Public License
+along with the Program. You may charge a fee for the physical act of
+transferring a copy.
+
+ 2. You may modify your copy or copies of the Program or any portion of
+it, and copy and distribute such modifications under the terms of Paragraph
+1 above, provided that you also do the following:
+
+ a) cause the modified files to carry prominent notices stating that
+ you changed the files and the date of any change; and
+
+ b) cause the whole of any work that you distribute or publish, that
+ in whole or in part contains the Program or any part thereof, either
+ with or without modifications, to be licensed at no charge to all
+ third parties under the terms of this General Public License (except
+ that you may choose to grant warranty protection to some or all
+ third parties, at your option).
+
+ c) If the modified program normally reads commands interactively when
+ run, you must cause it, when started running for such interactive use
+ in the simplest and most usual 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 General
+ Public License.
+
+ d) 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.
+
+Mere aggregation of another independent work with the Program (or its
+derivative) on a volume of a storage or distribution medium does not bring
+the other work under the scope of these terms.
+
+ 3. You may copy and distribute the Program (or a portion or derivative of
+it, under Paragraph 2) in object code or executable form under the terms of
+Paragraphs 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
+ Paragraphs 1 and 2 above; or,
+
+ b) accompany it with a written offer, valid for at least three
+ years, to give any third party free (except for a nominal charge
+ for the cost of distribution) a complete machine-readable copy of the
+ corresponding source code, to be distributed under the terms of
+ Paragraphs 1 and 2 above; or,
+
+ c) accompany it with the information you received as to where the
+ corresponding source code may be obtained. (This alternative is
+ allowed only for noncommercial distribution and only if you
+ received the program in object code or executable form alone.)
+
+Source code for a work means the preferred form of the work for making
+modifications to it. For an executable file, complete source code means
+all the source code for all modules it contains; but, as a special
+exception, it need not include source code for modules which are standard
+libraries that accompany the operating system on which the executable
+file runs, or for standard header files or definitions files that
+accompany that operating system.
+
+ 4. You may not copy, modify, sublicense, distribute or transfer the
+Program except as expressly provided under this General Public License.
+Any attempt otherwise to copy, modify, sublicense, distribute or transfer
+the Program is void, and will automatically terminate your rights to use
+the Program under this License. However, parties who have received
+copies, or rights to use copies, from you under this General Public
+License will not have their licenses terminated so long as such parties
+remain in full compliance.
+
+ 5. By copying, distributing or modifying 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.
+
+ 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.
+
+ 7. 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 the 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
+the license, you may choose any version ever published by the Free Software
+Foundation.
+
+ 8. 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
+
+ 9. 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.
+
+ 10. 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
+
+ Appendix: 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 humanity, 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.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) 19yy <name of author>
+
+ 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 1, 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., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 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) 19xx 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 a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the
+ program `Gnomovision' (a program to direct compilers to make passes
+ at assemblers) written by James Hacker.
+
+ <signature of Ty Coon>, 1 April 1989
+ Ty Coon, President of Vice
+
+That's all there is to it!
+
+
+--- The Artistic License 1.0 ---
+
+This is free software, licensed under:
+
+ The Artistic License 1.0
+
+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.
+ - "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 ftp.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) accompany any non-standard executables with their corresponding Standard
+ Version executables, giving the non-standard executables non-standard
+ names, and clearly documenting 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.
+
+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 whomever generated them, and may be sold
+commercially, and may be aggregated with this Package.
+
+7. C or perl subroutines supplied by you and linked into this Package shall not
+be considered part of this Package.
+
+8. The name of the Copyright Holder may not be used to endorse or promote
+products derived from this software without specific prior written permission.
+
+9. 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
@@ -1,407 +0,0 @@
-package Tie::LLHash;
-use strict;
-use vars qw($VERSION);
-use Carp;
-
-
-$VERSION = '1.003';
-
-sub TIEHASH {
- my $pkg = shift;
-
- my $self = bless {}, $pkg;
- %$self = ( %$self, %{shift()} ) if ref $_[0];
- $self->CLEAR;
-
- # Initialize the hash if more arguments are given
- while (@_) {
- $self->last( splice(@_, 0, 2) );
- }
-
- return $self;
-}
-
-# Standard access methods:
-
-sub FETCH {
- my $self = shift;
- my $key = shift;
-
- return undef unless $self->EXISTS($key);
- return $self->{'nodes'}{$key}{'value'};
-}
-
-sub STORE {
- my $self = shift;
- my $name = shift;
- my $value = shift;
-
- if (exists $self->{'nodes'}{$name}) {
- return $self->{'nodes'}{$name}{'value'} = $value;
- }
-
- croak ("No such key '$name', use first() or insert() to add keys") unless $self->{lazy};
- return $self->last($name, $value);
-}
-
-
-sub FIRSTKEY {
- my $self = shift;
- return $self->{'current'} = $self->{'first'};
-}
-
-sub NEXTKEY {
- my $self = shift;
- return $self->{'current'} = (defined $self->{'current'}
- ? $self->{'nodes'}{ $self->{'current'} }{'next'}
- : $self->{'first'});
-}
-
-sub EXISTS {
- my $self = shift;
- my $name = shift;
- return exists $self->{'nodes'}{$name};
-}
-
-sub DELETE {
- my $self = shift;
- my $key = shift;
- #my $debug = 0;
-
- return unless $self->EXISTS($key);
- my $node = $self->{'nodes'}{$key};
-
- if ($self->{'first'} eq $self->{'last'}) {
- $self->{'first'} = undef;
- $self->{'current'} = undef;
- $self->{'last'} = undef;
-
- } elsif ($self->{'first'} eq $key) {
- $self->{'first'} = $node->{'next'};
- $self->{'nodes'}{ $self->{'first'} }{'prev'} = undef;
- $self->{'current'} = undef;
-
- } elsif ($self->{'last'} eq $key) {
- $self->{'current'} = $self->{'last'} = $node->{'prev'};
- $self->{'nodes'}{ $self->{'last'} }{'next'} = undef;
-
- } else {
- my $key_one = $node->{'prev'};
- my $key_three = $node->{'next'};
- $self->{'nodes'}{$key_one }{'next'} = $key_three;
- $self->{'nodes'}{$key_three}{'prev'} = $key_one;
- $self->{'current'} = $key_one;
- }
-
- return +(delete $self->{'nodes'}{$key})->{value};
-}
-
-sub CLEAR {
- my $self = shift;
-
- $self->{'first'} = undef;
- $self->{'last'} = undef;
- $self->{'current'} = undef;
- $self->{'nodes'} = {};
-}
-
-# Special access methods
-# Use (tied %hash)->method to get at them
-
-sub insert {
- my $self = shift;
- my $two_key = shift;
- my $two_value = shift;
- my $one_key = shift;
-
- # insert(key,val) and insert(key,val,undef) == first(key,val)
- return $self->first($two_key, $two_value) unless defined $one_key;
-
- croak ("No such key '$one_key'") unless $self->EXISTS($one_key);
- croak ("'$two_key' already exists") if $self->EXISTS($two_key);
-
- my $three_key = $self->{'nodes'}{$one_key}{'next'};
-
- $self->{'nodes'}{$one_key}{'next'} = $two_key;
-
- $self->{'nodes'}{$two_key}{'prev'} = $one_key;
- $self->{'nodes'}{$two_key}{'next'} = $three_key;
- $self->{'nodes'}{$two_key}{'value'} = $two_value;
-
- if (defined $three_key) {
- $self->{'nodes'}{$three_key}{'prev'} = $two_key;
- }
-
- # If we're adding to the end of the hash, adjust the {last} pointer:
- if ($one_key eq $self->{'last'}) {
- $self->{'last'} = $two_key;
- }
-
- return $two_value;
-}
-
-sub first {
- my $self = shift;
-
- if (@_) { # Set it
- my $newkey = shift;
- my $newvalue = shift;
-
- croak ("'$newkey' already exists") if $self->EXISTS($newkey);
-
- # Create the new node
- $self->{'nodes'}{$newkey} =
- {
- 'next' => undef,
- 'value' => $newvalue,
- 'prev' => undef,
- };
-
- # Put it in its relative place
- if (defined $self->{'first'}) {
- $self->{'nodes'}{$newkey}{'next'} = $self->{'first'};
- $self->{'nodes'}{ $self->{'first'} }{'prev'} = $newkey;
- }
-
- # Finally, make this node the first node
- $self->{'first'} = $newkey;
-
- # If this is an empty hash, make it the last node too
- $self->{'last'} = $newkey unless (defined $self->{'last'});
- }
- return $self->{'first'};
-}
-
-sub last {
- my $self = shift;
-
- if (@_) { # Set it
- my $newkey = shift;
- my $newvalue = shift;
-
- croak ("'$newkey' already exists") if $self->EXISTS($newkey);
-
- # Create the new node
- $self->{'nodes'}{$newkey} =
- {
- 'next' => undef,
- 'value' => $newvalue,
- 'prev' => undef,
- };
-
- # Put it in its relative place
- if (defined $self->{'last'}) {
- $self->{'nodes'}{$newkey}{'prev'} = $self->{'last'};
- $self->{'nodes'}{ $self->{'last'} }{'next'} = $newkey;
- }
-
- # Finally, make this node the last node
- $self->{'last'} = $newkey;
-
- # If this is an empty hash, make it the first node too
- $self->{'first'} = $newkey unless (defined $self->{'first'});
- }
- return $self->{'last'};
-}
-
-sub key_before {
- return $_[0]->{'nodes'}{$_[1]}{'prev'};
-}
-
-sub key_after {
- return $_[0]->{'nodes'}{$_[1]}{'next'};
-}
-
-sub current_key {
- return $_[0]->{'current'};
-}
-
-sub current_value {
- my $self = shift;
- return $self->FETCH($self->{'current'});
-}
-
-sub next { my $s=shift; $s->NEXTKEY($_) }
-sub prev {
- my $self = shift;
- return $self->{'current'} = $self->{'nodes'}{ $self->{'current'} }{'prev'};
-}
-sub reset { my $s=shift; $s->FIRSTKEY($_) }
-
-1;
-__END__
-
-=head1 NAME
-
-Tie::LLHash.pm - ordered hashes
-
-=head1 DESCRIPTION
-
-This class implements an ordered hash-like object. It's a cross between a
-Perl hash and a linked list. Use it whenever you want the speed and
-structure of a Perl hash, but the orderedness of a list.
-
-Don't use it if you want to be able to address your hash entries by number,
-like you can in a real list ($list[5]).
-
-See also Tie::IxHash by Gurusamy Sarathy. It's similar (it also does
-ordered hashes), but it has a different internal data structure and a
-different flavor of usage. IxHash stores its data internally as both
-a hash and an array in parallel. LLHash stores its data as a
-bidirectional linked list, making both inserts and deletes very fast.
-IxHash therefore makes your hash behave more like a list than LLHash
-does. This module keeps more of the hash flavor.
-
-=head1 SYNOPSIS
-
- use Tie::LLHash;
-
- # A new empty ordered hash:
- tie (%hash, "Tie::LLHash");
- # A new ordered hash with stuff in it:
- tie (%hash2, "Tie::LLHash", key1=>$val1, key2=>$val2);
- # Allow easy insertions at the end of the hash:
- tie (%hash2, "Tie::LLHash", {lazy=>1}, key1=>$val1, key2=>$val2);
-
- # Add some entries:
- (tied %hash)->first('the' => 'hash');
- (tied %hash)->insert('here' => 'now', 'the');
- (tied %hash)->first('All' => 'the');
- (tied %hash)->insert('are' => 'right', 'the');
- (tied %hash)->insert('things' => 'in', 'All');
- (tied %hash)->last('by' => 'gum');
-
- $value = $hash{'things'}; # Look up a value
- $hash{'here'} = 'NOW'; # Set the value of an EXISTING RECORD!
-
-
- $key = (tied %hash)->key_before('in'); # Returns the previous key
- $key = (tied %hash)->key_after('in'); # Returns the next key
-
- # Luxury routines:
- $key = (tied %hash)->current_key;
- $val = (tied %hash)->current_value;
- (tied %hash)->next;
- (tied %hash)->prev;
- (tied %hash)->reset;
-
- # If lazy-mode is set, new keys will be added at the end.
- $hash{newkey} = 'newval';
- $hash{newkey2} = 'newval2';
-
-=head1 METHODS
-
-=over 4
-
-=item * insert(key, value, previous_key)
-
-This inserts a new key-value pair into the hash right after the C<previous_key> key.
-If C<previous_key> is undefined (or not supplied), this is exactly equivalent to
-C<first(key, value)>. If C<previous_key> is defined, then it must be a string which
-is already a key in the hash - otherwise we'll croak().
-
-=item * first(key, value) (or) first()
-
-Gets or sets the first key in the hash. Without arguments, simply returns a string
-which is the first key in the database. With arguments, it inserts a new key-value
-pair at the beginning of the hash.
-
-=item * last(key, value) (or) last()
-
-Gets or sets the last key in the hash. Without arguments, simply returns a string
-which is the last key in the database. With arguments, it inserts a new key-value
-pair at the end of the hash.
-
-=item * key_before(key)
-
-Returns the name of the key immediately before the given key. If no keys are
-before the given key, returns C<undef>.
-
-=item * key_after(key)
-
-Returns the name of the key immediately after the given key. If no keys are
-after the given key, returns C<undef>.
-
-=item * current_key()
-
-When iterating through the hash, this returns the key at the current position
-in the hash.
-
-=item * current_value()
-
-When iterating through the hash, this returns the value at the current position
-in the hash.
-
-=item * next()
-
-Increments the current position in the hash forward one item. Returns the
-new current key, or C<undef> if there are no more entries.
-
-=item * prev()
-
-Increments the current position in the hash backward one item. Returns the
-new current key, or C<undef> if there are no more entries.
-
-=item * reset()
-
-Resets the current position to be the start of the order. Returns the new
-current key, or C<undef> if there are no keys.
-
-=back
-
-=head1 ITERATION TECHNIQUES
-
-Here is a smattering of ways you can iterate over the hash. I include it here
-simply because iteration is probably important to people who need ordered data.
-
- while (($key, $val) = each %hash) {
- print ("$key: $val\n");
- }
-
- foreach $key (keys %hash) {
- print ("$key: $hash{$key}\n");
- }
-
- my $obj = tied %hash; # For the following examples
-
- $key = $obj->reset;
- while (exists $hash{$key}) {
- print ("$key: $hash{$key}\n");
- $key = $obj->next;
- }
-
- $obj->reset;
- while (exists $hash{$obj->current_key}) {
- $key = $obj->current_key;
- print ("$key: $hash{$key}\n");
- $obj->next;
- }
-
-=head1 WARNINGS
-
-=over 4
-
-=item * Unless you're using lazy-mode, don't add new elements to the hash by
-simple assignment, a la <$hash{$new_key} = $value>, because LLHash won't
-know where in the order to put the new element.
-
-
-=head1 TO DO
-
-I could speed up the keys() routine in a scalar context if I knew how to
-sense when NEXTKEY is being called on behalf of keys(). Not sure whether
-this is possible.
-
-I may also want to add a method for... um, I forgot. Something.
-
-=head1 AUTHOR
-
-Ken Williams <ken@forum.swarthmore.edu>
-
-Copyright (c) 1998 Swarthmore College. All rights reserved.
-This program is free software; you can redistribute it and/or
-modify it under the same terms as Perl itself.
-
-=cut
-
-# LocalWords: undef
@@ -1,7 +1,12 @@
Changes
-LLHash.pm
+lib/Tie/LLHash.pm
+LICENSE
Makefile.PL
MANIFEST
-META.yml Module meta-data (added by MakeMaker)
README
-t/basic.t
+t/00_load.t
+t/01_basic.t
+t/10_changes.t
+t/11_kwalitee.t
+META.yml Module YAML meta-data (added by MakeMaker)
+META.json Module JSON meta-data (added by MakeMaker)
@@ -0,0 +1,59 @@
+{
+ "abstract" : "Ordered hashes",
+ "author" : [
+ "Ken Williams <kwilliams@cpan.org>"
+ ],
+ "dynamic_config" : 1,
+ "generated_by" : "ExtUtils::MakeMaker version 6.98, CPAN::Meta::Converter version 2.142060",
+ "license" : [
+ "perl_5"
+ ],
+ "meta-spec" : {
+ "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec",
+ "version" : "2"
+ },
+ "name" : "Tie-LLHash",
+ "no_index" : {
+ "directory" : [
+ "t",
+ "inc"
+ ]
+ },
+ "prereqs" : {
+ "build" : {
+ "requires" : {
+ "ExtUtils::MakeMaker" : "0"
+ }
+ },
+ "configure" : {
+ "requires" : {
+ "ExtUtils::MakeMaker" : "0"
+ }
+ },
+ "runtime" : {
+ "requires" : {
+ "Carp" : "0",
+ "perl" : "5.006000",
+ "strict" : "0",
+ "warnings" : "0"
+ }
+ },
+ "test" : {
+ "requires" : {
+ "Test::More" : "0.88"
+ }
+ }
+ },
+ "release_status" : "stable",
+ "resources" : {
+ "bugtracker" : {
+ "web" : "https://rt.cpan.org/Dist/Display.html?Name=Tie-LLHash"
+ },
+ "repository" : {
+ "type" : "git",
+ "url" : "git://github.com/Xaerxess/Tie-LLHash.git",
+ "web" : "https://github.com/Xaerxess/Tie-LLHash"
+ }
+ },
+ "version" : "1.004"
+}
@@ -1,10 +1,29 @@
-# http://module-build.sourceforge.net/META-spec.html
-#XXXXXXX This is a prototype!!! It will change in the future!!! XXXXX#
-name: Tie-LLHash
-version: 1.003
-version_from: LLHash.pm
-installdirs: site
+---
+abstract: 'Ordered hashes'
+author:
+ - 'Ken Williams <kwilliams@cpan.org>'
+build_requires:
+ ExtUtils::MakeMaker: '0'
+ Test::More: '0.88'
+configure_requires:
+ ExtUtils::MakeMaker: '0'
+dynamic_config: 1
+generated_by: 'ExtUtils::MakeMaker version 6.98, CPAN::Meta::Converter version 2.142060'
+license: perl
+meta-spec:
+ url: http://module-build.sourceforge.net/META-spec-v1.4.html
+ version: '1.4'
+name: Tie-LLHash
+no_index:
+ directory:
+ - t
+ - inc
requires:
-
-distribution_type: module
-generated_by: ExtUtils::MakeMaker version 6.21
+ Carp: '0'
+ perl: '5.006000'
+ strict: '0'
+ warnings: '0'
+resources:
+ bugtracker: https://rt.cpan.org/Dist/Display.html?Name=Tie-LLHash
+ repository: git://github.com/Xaerxess/Tie-LLHash.git
+version: '1.004'
@@ -1,15 +1,58 @@
-
use strict;
+use warnings;
+
use ExtUtils::MakeMaker;
-my $name = 'Tie::LLHash';
-my $file = ($name =~ /::(\w+)/)[0] . '.pm';
-
-WriteMakefile(
- 'NAME' => $name,
- 'VERSION_FROM' => $file, # finds $VERSION
- 'PL_FILES' => {},
- 'dist' => { COMPRESS=>'gzip',
- SUFFIX=>'gz',
- },
- );
+my %WriteMakefileArgs = (
+ NAME => 'Tie::LLHash',
+ VERSION_FROM => 'lib/Tie/LLHash.pm',
+ MIN_PERL_VERSION => '5.6.0',
+ PREREQ_PM => {
+ 'Carp' => 0,
+ 'strict' => 0,
+ 'warnings' => 0,
+ },
+ TEST_REQUIRES => {
+ 'Test::More' => 0.88,
+ },
+ ABSTRACT_FROM => 'lib/Tie/LLHash.pm',
+ AUTHOR => 'Ken Williams <kwilliams@cpan.org>',
+ LICENSE => 'perl_5',
+ META_MERGE => {
+ 'meta-spec' => { version => 2 },
+ resources => {
+ repository => {
+ type => 'git',
+ url => 'git://github.com/Xaerxess/Tie-LLHash.git',
+ web => 'https://github.com/Xaerxess/Tie-LLHash',
+ },
+ bugtracker => {
+ web => 'https://rt.cpan.org/Dist/Display.html?Name=Tie-LLHash',
+ },
+ },
+ },
+ test => {
+ TESTS => "t/*.t"
+ },
+);
+
+unless (eval { ExtUtils::MakeMaker->VERSION(6.64) }) {
+ my $test_requires = delete $WriteMakefileArgs{TEST_REQUIRES};
+ if (eval { ExtUtils::MakeMaker->VERSION(6.5503) }) {
+ $WriteMakefileArgs{BUILD_REQUIRES} = $test_requires;
+ }
+}
+
+unless (eval { ExtUtils::MakeMaker->VERSION(6.48) }) {
+ delete $WriteMakefileArgs{MIN_PERL_VERSION};
+}
+
+unless (eval { ExtUtils::MakeMaker->VERSION(6.46) }) {
+ delete $WriteMakefileArgs{META_MERGE};
+}
+
+unless (eval { ExtUtils::MakeMaker->VERSION(6.31) }) {
+ delete $WriteMakefileArgs{LICENSE};
+}
+
+WriteMakefile(%WriteMakefileArgs);
@@ -1,22 +1,42 @@
-Hi,
+Tie-LLHash
+==========
-This is the Tie::LLHash.pm module. It is a class for implementing
-ordered Perl hashes. It is designed to be flexible and sub-classible.
+This is the Tie::LLHash module -- a class for implementing ordered Perl
+hashes. It is designed to be flexible and sub-classible.
-It also may change significantly - this is only version 0.01, after all =).
+INSTALLATION
+------------
+
+To install the module from CPAN, use
+
+ cpan Tie::LLHash
+
+If you have the App::cpanminus installer, you may prefer
+
+ cpanm Tie::LLHash
+
+To install this module from tarball archive file containing this distribution,
+type
+
+ perl Makefile.PL
+ make
+ make test
+ make install
+
+DOCUMENTATION
+-------------
For more specific information, please see the documentation inside
LLHash.pm, by doing "pod2txt LLHash.pm", or "perldoc Tie::LLHash" once
you've installed the module.
-To install the module, do the usual:
-
- perl Makefile.PL
- make
- make test
- make install
+COPYRIGHT AND LICENSE
+---------------------
+Copyright 1998 Ken Williams <kenahoo@gmail.com>. All rights reserved.
+This library is free software; you can redistribute it and/or modify
+it under the same terms as Perl itself.
--Ken Williams
- ken@forum.swarthmore.edu
+The full text of the license can be found in the LICENSE file included with
+this module.
@@ -0,0 +1,436 @@
+package Tie::LLHash;
+
+use strict;
+use warnings;
+use Carp;
+
+our $VERSION = '1.004';
+
+sub TIEHASH {
+ my $pkg = shift;
+
+ my $self = bless {}, $pkg;
+ %$self = ( %$self, %{shift()} ) if ref $_[0];
+ $self->CLEAR;
+
+ # Initialize the hash if more arguments are given
+ while (@_) {
+ $self->last( splice(@_, 0, 2) );
+ }
+
+ return $self;
+}
+
+# Standard access methods:
+
+sub FETCH {
+ my $self = shift;
+ my $key = shift;
+
+ return undef unless $self->EXISTS($key);
+ return $self->{'nodes'}{$key}{'value'};
+}
+
+sub STORE {
+ my $self = shift;
+ my $name = shift;
+ my $value = shift;
+
+ if (exists $self->{'nodes'}{$name}) {
+ return $self->{'nodes'}{$name}{'value'} = $value;
+ }
+
+ croak ("No such key '$name', use first() or insert() to add keys") unless $self->{lazy};
+ return $self->last($name, $value);
+}
+
+
+sub FIRSTKEY {
+ my $self = shift;
+ return $self->{'current'} = $self->{'first'};
+}
+
+sub NEXTKEY {
+ my $self = shift;
+ return $self->{'current'} = (defined $self->{'current'}
+ ? $self->{'nodes'}{ $self->{'current'} }{'next'}
+ : $self->{'first'});
+}
+
+sub EXISTS {
+ my $self = shift;
+ my $name = shift;
+ return exists $self->{'nodes'}{$name};
+}
+
+sub DELETE {
+ my $self = shift;
+ my $key = shift;
+
+ return unless $self->EXISTS($key);
+ my $node = $self->{'nodes'}{$key};
+
+ if ($self->{'first'} eq $self->{'last'}) {
+ $self->{'first'} = undef;
+ $self->{'current'} = undef;
+ $self->{'last'} = undef;
+
+ } elsif ($self->{'first'} eq $key) {
+ $self->{'first'} = $node->{'next'};
+ $self->{'nodes'}{ $self->{'first'} }{'prev'} = undef;
+ $self->{'current'} = undef;
+
+ } elsif ($self->{'last'} eq $key) {
+ $self->{'current'} = $self->{'last'} = $node->{'prev'};
+ $self->{'nodes'}{ $self->{'last'} }{'next'} = undef;
+
+ } else {
+ my $key_one = $node->{'prev'};
+ my $key_three = $node->{'next'};
+ $self->{'nodes'}{$key_one }{'next'} = $key_three;
+ $self->{'nodes'}{$key_three}{'prev'} = $key_one;
+ $self->{'current'} = $key_one;
+ }
+
+ return +(delete $self->{'nodes'}{$key})->{value};
+}
+
+sub CLEAR {
+ my $self = shift;
+
+ $self->{'first'} = undef;
+ $self->{'last'} = undef;
+ $self->{'current'} = undef;
+ $self->{'nodes'} = {};
+}
+
+sub SCALAR {
+ my $self = shift;
+ return scalar %{$self->{'nodes'}};
+}
+
+# Special access methods
+# Use (tied %hash)->method to get at them
+
+sub insert {
+ my $self = shift;
+ my $two_key = shift;
+ my $two_value = shift;
+ my $one_key = shift;
+
+ # insert(key,val) and insert(key,val,undef) == first(key,val)
+ return $self->first($two_key, $two_value) unless defined $one_key;
+
+ croak ("No such key '$one_key'") unless $self->EXISTS($one_key);
+ croak ("'$two_key' already exists") if $self->EXISTS($two_key);
+
+ my $three_key = $self->{'nodes'}{$one_key}{'next'};
+
+ $self->{'nodes'}{$one_key}{'next'} = $two_key;
+
+ $self->{'nodes'}{$two_key}{'prev'} = $one_key;
+ $self->{'nodes'}{$two_key}{'next'} = $three_key;
+ $self->{'nodes'}{$two_key}{'value'} = $two_value;
+
+ if (defined $three_key) {
+ $self->{'nodes'}{$three_key}{'prev'} = $two_key;
+ }
+
+ # If we're adding to the end of the hash, adjust the {last} pointer:
+ if ($one_key eq $self->{'last'}) {
+ $self->{'last'} = $two_key;
+ }
+
+ return $two_value;
+}
+
+sub first {
+ my $self = shift;
+
+ if (@_) { # Set it
+ my $newkey = shift;
+ my $newvalue = shift;
+
+ croak ("'$newkey' already exists") if $self->EXISTS($newkey);
+
+ # Create the new node
+ $self->{'nodes'}{$newkey} =
+ {
+ 'next' => undef,
+ 'value' => $newvalue,
+ 'prev' => undef,
+ };
+
+ # Put it in its relative place
+ if (defined $self->{'first'}) {
+ $self->{'nodes'}{$newkey}{'next'} = $self->{'first'};
+ $self->{'nodes'}{ $self->{'first'} }{'prev'} = $newkey;
+ }
+
+ # Finally, make this node the first node
+ $self->{'first'} = $newkey;
+
+ # If this is an empty hash, make it the last node too
+ $self->{'last'} = $newkey unless (defined $self->{'last'});
+ }
+ return $self->{'first'};
+}
+
+sub last {
+ my $self = shift;
+
+ if (@_) { # Set it
+ my $newkey = shift;
+ my $newvalue = shift;
+
+ croak ("'$newkey' already exists") if $self->EXISTS($newkey);
+
+ # Create the new node
+ $self->{'nodes'}{$newkey} =
+ {
+ 'next' => undef,
+ 'value' => $newvalue,
+ 'prev' => undef,
+ };
+
+ # Put it in its relative place
+ if (defined $self->{'last'}) {
+ $self->{'nodes'}{$newkey}{'prev'} = $self->{'last'};
+ $self->{'nodes'}{ $self->{'last'} }{'next'} = $newkey;
+ }
+
+ # Finally, make this node the last node
+ $self->{'last'} = $newkey;
+
+ # If this is an empty hash, make it the first node too
+ $self->{'first'} = $newkey unless (defined $self->{'first'});
+ }
+ return $self->{'last'};
+}
+
+sub key_before {
+ return $_[0]->{'nodes'}{$_[1]}{'prev'};
+}
+
+sub key_after {
+ return $_[0]->{'nodes'}{$_[1]}{'next'};
+}
+
+sub current_key {
+ return $_[0]->{'current'};
+}
+
+sub current_value {
+ my $self = shift;
+ return $self->FETCH($self->{'current'});
+}
+
+sub next {
+ my $self = shift;
+ return $self->NEXTKEY;
+}
+
+sub prev {
+ my $self = shift;
+ return $self->{'current'} = $self->{'nodes'}{ $self->{'current'} }{'prev'};
+}
+
+sub reset {
+ my $self = shift;
+ return $self->FIRSTKEY;
+}
+
+1;
+__END__
+
+=head1 NAME
+
+Tie::LLHash - Ordered hashes
+
+=head1 DESCRIPTION
+
+This class implements an ordered hash-like object. It's a cross between a
+Perl hash and a linked list. Use it whenever you want the speed and
+structure of a Perl hash, but the orderedness of a list.
+
+See also L<Tie::IxHash> by Gurusamy Sarathy. It's similar (it also does
+tied ordered hashes), but it has a different internal data structure and a
+different flavor of usage. L<Tie::IxHash> stores its data internally as
+both a hash and an array in parallel. C<Tie::LLHash> stores its data as a
+bidirectional linked list, making both inserts and deletes very fast.
+L<Tie::IxHash> therefore makes your hash behave more like a list than
+C<Tie::LLHash> does. This module keeps more of the hash flavor.
+
+=head1 SYNOPSIS
+
+ use Tie::LLHash;
+
+ # A new empty ordered hash:
+ tie (%hash, "Tie::LLHash");
+ # A new ordered hash with stuff in it:
+ tie (%hash2, "Tie::LLHash", key1=>$val1, key2=>$val2);
+ # Allow easy insertions at the end of the hash:
+ tie (%hash2, "Tie::LLHash", {lazy=>1}, key1=>$val1, key2=>$val2);
+
+ # Add some entries:
+ (tied %hash)->first('the' => 'hash');
+ (tied %hash)->insert('here' => 'now', 'the');
+ (tied %hash)->first('All' => 'the');
+ (tied %hash)->insert('are' => 'right', 'the');
+ (tied %hash)->insert('things' => 'in', 'All');
+ (tied %hash)->last('by' => 'gum');
+
+ $value = $hash{'things'}; # Look up a value
+ $hash{'here'} = 'NOW'; # Set the value of an existing record
+ # or insert as last node in lazy mode
+
+ $key = (tied %hash)->key_before('in'); # Returns the previous key
+ $key = (tied %hash)->key_after('in'); # Returns the next key
+
+ # Luxury routines:
+ $key = (tied %hash)->current_key;
+ $val = (tied %hash)->current_value;
+ (tied %hash)->next;
+ (tied %hash)->prev;
+ (tied %hash)->reset;
+
+ # If lazy mode is set, new keys will be added at the end.
+ $hash{newkey} = 'newval';
+ $hash{newkey2} = 'newval2';
+
+=head1 METHODS
+
+=over 4
+
+=item * insert(key, value, previous_key)
+
+This inserts a new key-value pair into the hash right after the C<previous_key> key.
+If C<previous_key> is undefined (or not supplied), this is exactly equivalent to
+C<first(key, value)>. If C<previous_key> is defined, then it must be a string which
+is already a key in the hash - otherwise we'll croak().
+
+=item * first(key, value) (or) first()
+
+Gets or sets the first key in the hash. Without arguments, simply returns a string
+which is the first key in the database. With arguments, it inserts a new key-value
+pair at the beginning of the hash.
+
+=item * last(key, value) (or) last()
+
+Gets or sets the last key in the hash. Without arguments, simply returns a string
+which is the last key in the database. With arguments, it inserts a new key-value
+pair at the end of the hash.
+
+=item * key_before(key)
+
+Returns the name of the key immediately before the given key. If no keys are
+before the given key, returns C<undef>.
+
+=item * key_after(key)
+
+Returns the name of the key immediately after the given key. If no keys are
+after the given key, returns C<undef>.
+
+=item * current_key()
+
+When iterating through the hash, this returns the key at the current position
+in the hash.
+
+=item * current_value()
+
+When iterating through the hash, this returns the value at the current position
+in the hash.
+
+=item * next()
+
+Increments the current position in the hash forward one item. Returns the
+new current key, or C<undef> if there are no more entries.
+
+=item * prev()
+
+Increments the current position in the hash backward one item. Returns the
+new current key, or C<undef> if there are no more entries.
+
+=item * reset()
+
+Resets the current position to be the start of the order. Returns the new
+current key, or C<undef> if there are no keys.
+
+=back
+
+=head1 ITERATION TECHNIQUES
+
+Here is a smattering of ways you can iterate over the hash. I include it here
+simply because iteration is probably important to people who need ordered data.
+
+ while (($key, $val) = each %hash) {
+ print ("$key: $val\n");
+ }
+
+ foreach $key (keys %hash) {
+ print ("$key: $hash{$key}\n");
+ }
+
+ my $obj = tied %hash; # For the following examples
+
+ $key = $obj->reset;
+ while (exists $hash{$key}) {
+ print ("$key: $hash{$key}\n");
+ $key = $obj->next;
+ }
+
+ $obj->reset;
+ while (exists $hash{$obj->current_key}) {
+ $key = $obj->current_key;
+ print ("$key: $hash{$key}\n");
+ $obj->next;
+ }
+
+=head1 WARNINGS
+
+=over 4
+
+=item * Unless you're using lazy mode, don't add new elements to the hash by
+simple assignment, a la C<$hash{$new_key} = $value>, because C<Tie::LLHash>
+won't know where in the order to put the new element and will die.
+
+=item * Evaluating tied hash in scalar context wasn't implemented until Perl
+5.8.3, so on earlier Perl versions it will always return 0, even if hash is not
+empty.
+
+=back
+
+=head1 TODO
+
+=over 4
+
+=item * Add support for NEXTKEY and next with
+L<additional argument|http://perldoc.perl.org/perltie.html#NEXTKEY-this%2c-lastkey>.
+
+=item * I could speed up the keys() routine in a scalar context if I knew how
+to sense when NEXTKEY is being called on behalf of keys(). Not sure whether
+this is possible.
+
+=back
+
+=head1 SEE ALSO
+
+=over 4
+
+=item * L<Tie::IxHash>
+
+=item * L<Hash::Ordered>
+
+=back
+
+=head1 COPYRIGHT AND LICENSE
+
+Ken Williams <kenahoo@gmail.com>
+
+Copyright (c) 1998 Swarthmore College. All rights reserved.
+This program is free software; you can redistribute it and/or
+modify it under the same terms as Perl itself.
+
+=cut
+
+# LocalWords: undef
@@ -0,0 +1,6 @@
+use strict;
+use warnings;
+use Test::More tests => 1;
+
+use_ok 'Tie::LLHash';
+diag "Testing Tie::LLHash $Tie::LLHash::VERSION, Perl $], $^X";
@@ -0,0 +1,131 @@
+use strict;
+use warnings;
+
+use Test::More 0.88;
+END { done_testing }
+use Tie::LLHash;
+
+{
+ # Test the tie interface
+ tie(my %hash, 'Tie::LLHash');
+ isa_ok tied %hash, 'Tie::LLHash';
+
+ # Add first element
+ (tied %hash)->first('firstkey', 'firstval');
+ is $hash{firstkey}, 'firstval';
+
+ # Add more elements
+ (tied %hash)->insert( red => 'rudolph', 'firstkey');
+ (tied %hash)->insert( orange => 'julius', 'red');
+ is $hash{red}, 'rudolph';
+ is $hash{orange}, 'julius';
+ {
+ my @keys = keys %hash;
+ is $keys[0], 'firstkey';
+ is $keys[1], 'red';
+ is $keys[2], 'orange';
+ }
+
+ # Delete first element
+ delete $hash{firstkey};
+ is keys %hash, 2;
+ ok !exists $hash{firstkey};
+
+ # Delete all elements
+ {
+ my $o = delete $hash{orange};
+ is $o, 'julius';
+ ok !exists $hash{orange};
+
+ my $r = delete $hash{red};
+ is $r, 'rudolph';
+ ok !exists $hash{red};
+
+ is keys %hash, 0;
+ ok !scalar %hash;
+ }
+
+ # Exercise the ->last method
+ {
+ for my $i (0..9) {
+ (tied %hash)->last($i, 1);
+ }
+
+ is_deeply [ keys %hash ], [ 0..9 ];
+ }
+
+ # Scalar context and delete all contents
+ SKIP: {
+ skip q{$tied_hash->SCALAR wasn't implemented on Perls < 5.8.3}, 1 if $^V lt v5.8.3;
+ ok scalar %hash;
+ }
+ %hash = ();
+ ok !%hash;
+
+ # Combine some ->first and ->last action
+ {
+ my @result = qw(1 6 4 5 7 9 n r);
+ (tied %hash)->first(5 => 1);
+ (tied %hash)->last (7 => 1);
+ (tied %hash)->last (9 => 1);
+ (tied %hash)->first(4 => 1);
+ (tied %hash)->last (n => 1);
+ (tied %hash)->first(6 => 1);
+ (tied %hash)->first(1 => 1);
+ (tied %hash)->last (r => 1);
+
+ is_deeply [ keys %hash ], \@result;
+ }
+}
+
+# Create a new hash with an initialization hash
+{
+ my @keys = qw(zero one two three four five six seven eight);
+ tie(my %hash, 'Tie::LLHash', map { $keys[$_], $_ } 0..8);
+
+ is_deeply [ keys %hash ], \@keys;
+ is_deeply [ values %hash ], [ 0..8 ];
+ my $i = 0;
+ is_deeply \%hash, { map { $_ => $i++ } @keys };
+}
+
+# Use insert() to add an item at the beginning
+{
+ my $t = tie(my %hash, 'Tie::LLHash', one => 1);
+ $t->insert(zero => 0);
+ is $t->first, 'zero';
+ is $t->last, 'one';
+}
+
+# Lazy mode
+{
+ tie(my %hash, 'Tie::LLHash', { lazy => 1 }, zero => 0);
+ $hash{one} = 1;
+ my @keys = keys %hash;
+ is $keys[0], 'zero';
+ is $keys[1], 'one';
+}
+
+{
+ # Test deletes in a loop
+ tie(my %hash, 'Tie::LLHash', { lazy => 1 });
+
+ $hash{one} = 1;
+ $hash{two} = 2;
+ $hash{three} = 3;
+ is keys %hash, 3;
+
+ my ($k, $v) = each %hash;
+ is $k, 'one';
+ delete $hash{$k};
+
+ ($k, $v) = each %hash;
+ is $k, 'two';
+ delete $hash{$k};
+
+ ($k, $v) = each %hash;
+ is $k, 'three';
+ delete $hash{$k};
+
+ is keys %hash, 0;
+}
@@ -0,0 +1,5 @@
+use Test::More;
+eval 'use Test::CPAN::Changes';
+plan skip_all => 'Test::CPAN::Changes required for this test' if $@;
+
+changes_ok();
@@ -0,0 +1,18 @@
+use strict;
+use warnings;
+
+BEGIN {
+ unless ($ENV{RELEASE_TESTING}) {
+ use Test::More;
+ plan(skip_all => 'these tests are for release candidate testing');
+ }
+}
+
+eval {
+ require Test::Kwalitee;
+ Test::Kwalitee->import();
+ 1;
+} or do {
+ plan(skip_all => 'Test::Kwalitee not installed; skipping');
+ done_testing();
+};
@@ -1,139 +0,0 @@
-$^W = 1;
-
-use strict;
-use Test;
-BEGIN { plan tests => 22 }
-use Tie::LLHash;
-ok 1;
-
-{
- my (%hash, %hash2);
-
- # 2: Test the tie interface
- tie (%hash, "Tie::LLHash");
- ok( tied %hash );
-
- # 3: Add first element
- (tied %hash)->first('firstkey', 'firstval');
- ok( $hash{firstkey} eq 'firstval' );
-
- # 4: Add more elements
- (tied %hash)->insert( red => 'rudolph', 'firstkey');
- (tied %hash)->insert( orange => 'julius', 'red');
- ok( $hash{red} eq 'rudolph'
- and $hash{orange} eq 'julius'
- and (keys(%hash))[0] eq 'firstkey'
- and (keys(%hash))[1] eq 'red'
- and (keys(%hash))[2] eq 'orange');
-
- # 5: Delete first element
- delete $hash{firstkey};
- ok( keys %hash == 2
- and not exists $hash{firstkey} );
-
- # 6: Delete all elements
- {
- my $o = delete $hash{orange};
- ok $o, 'julius';
- ok !exists $hash{orange};
-
- my $r = delete $hash{red};
- ok $r, 'rudolph';
- ok !exists $hash{red};
-
- ok( keys %hash, 0 );
- }
-
- # 7: Exercise the ->last method
- {
- my ($i, $bad);
- for ($i=0; $i<10; $i++) {
- (tied %hash)->last($i, $i**2);
- }
-
- $i=0;
- foreach (keys %hash) {
- $bad++ if ($i++ ne $_);
- }
- ok(!$bad);
- }
-
- # 8: delete all contents
- %hash = ();
- ok( !%hash );
-
- # 9: Combine some ->first and ->last action
- {
- my @result = qw(1 6 4 5 7 9 n r);
- (tied %hash)->first(5=>1);
- (tied %hash)->last (7=>1);
- (tied %hash)->last (9=>1);
- (tied %hash)->first(4=>1);
- (tied %hash)->last (n=>1);
- (tied %hash)->first(6=>1);
- (tied %hash)->first(1=>1);
- (tied %hash)->last (r=>1);
-
- my ($i, $bad);
- foreach (keys %hash) {
- $bad++ if ($_ ne $result[$i++]);
- }
- ok(!$bad);
- }
-
- # 10: create a new hash with an initialization hash
- {
- my @keys = qw(zero one two three four five six seven eight);
-
- tie(%hash2, 'Tie::LLHash', map {$keys[$_], $_} 0..8);
- my ($bad, $i) = (0,0);
-
- foreach (keys %hash2) {
- $bad++ unless ($_ eq $keys[$i] and $hash2{$_} eq $i++);
- }
-
- ok( !$bad );
- }
-
- # 11: use insert() to add an item at the beginning
- untie %hash2;
- {
- my $t = tie(%hash2, 'Tie::LLHash', one=>1);
- $t->insert(zero=>0);
- ok($t->first eq 'zero' and $t->last eq 'one')
- }
-
- # 12: lazy mode
- untie %hash2;
- {
- tie(%hash2, 'Tie::LLHash', {lazy=>1}, zero=>0);
- $hash2{one}=1;
- my @k = keys %hash2;
- ok($k[0] eq 'zero' and $k[1] eq 'one')
- }
-}
-
-{
- # Test deletes in a loop
- tie my(%hash), "Tie::LLHash", {lazy => 1};
- ok tied(%hash);
-
- $hash{one} = 1;
- $hash{two} = 2;
- $hash{three} = 3;
- ok keys(%hash), 3;
-
- my ($k, $v) = each %hash;
- ok $k, 'one';
- delete $hash{$k};
-
- ($k, $v) = each %hash;
- ok $k, 'two';
- delete $hash{$k};
-
- ($k, $v) = each %hash;
- ok $k, 'three';
- delete $hash{$k};
-
- ok keys(%hash), 0;
-}