fbaf4169c2
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
166 B
Plaintext
4 lines
166 B
Plaintext
TIMESTAMP = 1681843820
|
|
SHA256 (Hash-Ordered-0.014.tar.gz) = 8dc36cd79155ae37ab8a3de5fd9120ffba9a31e409258c28529ec5251c59747b
|
|
SIZE (Hash-Ordered-0.014.tar.gz) = 36831
|