import p5-Tie-LLHash

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.

ok merdely@
This commit is contained in:
sthen 2007-09-09 22:54:42 +00:00
parent bcc7e8ced0
commit 032330cc26
4 changed files with 37 additions and 0 deletions

View File

@ -0,0 +1,14 @@
# $OpenBSD: Makefile,v 1.1.1.1 2007/09/09 22:54:42 sthen Exp $
COMMENT= ordered hashes
MODULES= cpan
DISTNAME= Tie-LLHash-1.003
CATEGORIES= devel
# perl
PERMIT_PACKAGE_CDROM= Yes
PERMIT_PACKAGE_FTP= Yes
PERMIT_DISTFILES_CDROM= Yes
PERMIT_DISTFILES_FTP= Yes
.include <bsd.port.mk>

View File

@ -0,0 +1,5 @@
MD5 (Tie-LLHash-1.003.tar.gz) = tYkDUePkoeq4kmfZqkEBRw==
RMD160 (Tie-LLHash-1.003.tar.gz) = QPmYrHccI87Kb3yj8OPAaudc7EI=
SHA1 (Tie-LLHash-1.003.tar.gz) = dTgMuD8MwQiwsY34+zqrxYdOSr8=
SHA256 (Tie-LLHash-1.003.tar.gz) = dTPcsTMb3HJ6ThiyO6Njr+LgjRXW6THfxh7b968jU88=
SIZE (Tie-LLHash-1.003.tar.gz) = 5983

View File

@ -0,0 +1,14 @@
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.

View File

@ -0,0 +1,4 @@
@comment $OpenBSD: PLIST,v 1.1.1.1 2007/09/09 22:54:42 sthen Exp $
${P5SITE}/Tie/
${P5SITE}/Tie/LLHash.pm
@man man/man3p/Tie::LLHash.3p