mirror of
https://git.freebsd.org/ports.git
synced 2025-05-31 10:26:28 -04:00
Hash::Ordered implements an ordered hash, meaning that it associates keys with values like a Perl hash, but keeps the keys in a consistent order. Because it is implemented as an object and manipulated with method calls, it is much slower than a Perl hash. This is the cost of keeping order. However, compared to other ordered hash implementations, Hash::Ordered is optimized for getting and setting individual elements and is generally faster at most other tasks as well. For specific details, see Hash::Ordered::Benchmarks.
4 lines
152 B
Text
4 lines
152 B
Text
%%SITE_PERL%%/Hash/Ordered.pm
|
|
%%SITE_PERL%%/Hash/Ordered/Benchmarks.pod
|
|
%%PERL5_MAN3%%/Hash::Ordered.3.gz
|
|
%%PERL5_MAN3%%/Hash::Ordered::Benchmarks.3.gz
|