- Update to 0.0.9

PR:		ports/73829
Submitted by:	maintainer
This commit is contained in:
Sergey Matveychuk 2004-11-24 10:06:20 +00:00
parent a3d18b0f15
commit 1e73c21646
Notes: svn2git 2021-03-31 03:12:20 +00:00
svn path=/head/; revision=122295
4 changed files with 17 additions and 44 deletions

View file

@ -6,7 +6,7 @@
#
PORTNAME= Heap-Simple
PORTVERSION= 0.06
PORTVERSION= 0.09
CATEGORIES= devel perl5
MASTER_SITES= ${MASTER_SITE_PERL_CPAN}
MASTER_SITE_SUBDIR= Heap
@ -25,4 +25,7 @@ MAN3= Heap::Simple.3
IGNORE= Uses ??{} in regexps, which came with perl5.6, install lang/perl5 or lang/perl5.8
.endif
post-install:
@${CAT} ${PKGMESSAGE}
.include <bsd.port.post.mk>

View file

@ -1,2 +1,2 @@
MD5 (Heap-Simple-0.06.tar.gz) = 097a6a86e8ef8a1bf88e385bad58c69b
SIZE (Heap-Simple-0.06.tar.gz) = 17303
MD5 (Heap-Simple-0.09.tar.gz) = ca17d666fc181c0483a00fe912cb3c60
SIZE (Heap-Simple-0.09.tar.gz) = 12595

View file

@ -1,21 +1,21 @@
A heap is a partially sorted structure where it's always easy to extract the
smallest element. If the collection of elements is changing dynamically, a
heap has less overhead than keeping the collection fully sorted.
smallest element. If the collection of elements is changing dynamically, a heap
has less overhead than keeping the collection fully sorted.
The order in which equal elements get extracted is unspecified.
The main order relations supported by this module are "<" (numeric compare)
and "lt" (string compare).
The module allows you to manage data where the elements are of several
allowed types, in particular array references, hash references, objects or
just the keys themselves.
The main order relations supported by this module are "<" (numeric compare) and
"lt" (string compare).
The internals of the module do nothing with the elements inserted except
inspecting the key. This means that if you for example store a blessed object,
that's what you will get back on extract. It's also ok to keep references to
the elements around and make changes to them while they are in the heap as
long as you don't change the key.
that's what you will get back on extract. It's also ok to keep references to the
elements around and make changes to them while they are in the heap as long as
you don't change the key.
Heap::Simple itself is just a loader for the code that will actually implement
the functionality mentioned above. You will need to install something like
Heap::Simple::XS or Heap::Simple::Perl to be able to actually do anything.
WWW: http://search.cpan.org/dist/Heap-Simple/
Author: Ton Hospel <cpan@ton.iguana.be>

View file

@ -1,35 +1,5 @@
%%SITE_PERL%%/Heap/Simple.pm
%%SITE_PERL%%/Heap/Simple/Any.pm
%%SITE_PERL%%/Heap/Simple/Array.pm
%%SITE_PERL%%/Heap/Simple/Function.pm
%%SITE_PERL%%/Heap/Simple/Hash.pm
%%SITE_PERL%%/Heap/Simple/Key.pm
%%SITE_PERL%%/Heap/Simple/Less.pm
%%SITE_PERL%%/Heap/Simple/Method.pm
%%SITE_PERL%%/Heap/Simple/Number.pm
%%SITE_PERL%%/Heap/Simple/NumberReverse.pm
%%SITE_PERL%%/Heap/Simple/Object.pm
%%SITE_PERL%%/Heap/Simple/String.pm
%%SITE_PERL%%/Heap/Simple/StringReverse.pm
%%SITE_PERL%%/Heap/Simple/Wrapper.pm
%%SITE_PERL%%/auto/Heap/Simple/autosplit.ix
%%SITE_PERL%%/auto/Heap/Simple/extract_min.al
%%SITE_PERL%%/auto/Heap/Simple/extract_top.al
%%SITE_PERL%%/auto/Heap/Simple/extract_upto.al
%%SITE_PERL%%/auto/Heap/Simple/first.al
%%SITE_PERL%%/auto/Heap/Simple/first_key.al
%%SITE_PERL%%/auto/Heap/Simple/infinity.al
%%SITE_PERL%%/auto/Heap/Simple/insert.al
%%SITE_PERL%%/auto/Heap/Simple/key.al
%%SITE_PERL%%/auto/Heap/Simple/keys.al
%%SITE_PERL%%/auto/Heap/Simple/min_key.al
%%SITE_PERL%%/auto/Heap/Simple/top_key.al
%%SITE_PERL%%/auto/Heap/Simple/user_data.al
%%SITE_PERL%%/auto/Heap/Simple/values.al
%%SITE_PERL%%/%%PERL_ARCH%%/auto/Heap/Simple/.packlist
@dirrm %%SITE_PERL%%/%%PERL_ARCH%%/auto/Heap/Simple
@unexec rmdir %D/%%SITE_PERL%%/%%PERL_ARCH%%/auto/Heap 2>/dev/null || true
@dirrm %%SITE_PERL%%/auto/Heap/Simple
@unexec rmdir %D/%%SITE_PERL%%/auto/Heap 2>/dev/null || true
@dirrm %%SITE_PERL%%/Heap/Simple
@unexec rmdir %D/%%SITE_PERL%%/Heap 2>/dev/null || true