perl-Algorithm-SkipList
Perl implementation of skip lists
SRPM: perl-Algorithm-SkipList-1.02-4.n0i.6.fc7.src.rpm SPEC: perl-Algorithm-SkipList.spec Version: 1.02 Release: 4.n0i.6.fc7 Epoch: License: Artistic Group: Development/Libraries Size: 33164 Packager: Marius Feraru <altblue@n0i.net> Vendor: n0i.net URL: http://search.cpan.org/dist/Algorithm-SkipList/ Date: Thu May 24 2007, 19:36 GMT
Description:
This is an implementation of skip lists in Perl.
Skip lists are a probabilistic data structure that seem likely to supplant
balanced trees as the implementation method of choice for many applications.
Skip list algorithms have the same asymptotic expected time bounds as balanced
trees and are simpler, faster and use less space.
Skip lists are a probabilistic data structure that seem likely to supplant
balanced trees as the implementation method of choice for many applications.
Skip list algorithms have the same asymptotic expected time bounds as balanced
trees and are simpler, faster and use less space.
Changelog:
- Tue May 22 2007 Marius Feraru <altblue@n0i.net> - 1.02-4.n0i.6
- spec file (re)created using N0i::CPAN::RPMizer v1.14.7
- mass rebuild - Fri Mar 03 2006 Marius Feraru <altblue@n0i.net> - 1.02-3.n0i.5
- automatic rebuild (perl 5.8.8) - Sat Jul 23 2005 Marius Feraru <altblue@n0i.net> 1.02-2.n0i.4
- spec file (re)created using N0i::CPAN::RPMizer/1.01
- rebuild on perl 5.8.7 - Sun Mar 20 2005 Marius Feraru <altblue@n0i.net> 0:1.02-2.n0i.3
- automatic rebuild (perl 5.8.6) - Thu Jan 13 2005 Marius Feraru <altblue@n0i.net> 0:1.02-1.n0i.2
- version 1.02 - Wed Jan 05 2005 Marius Feraru <altblue@n0i.net> 0:1.01-1.n0i.1
- version 1.01
- spec file (re?)created using N0i::CPAN::RPMizer/2004120601
Files:
- Algorithm-SkipList-1.02.tar.gz
- perl-Algorithm-SkipList.spec
Requires:
- perl(Module::Build)
- reb00t-rpmdevtools
- rpmlib(CompressedFileNames)