Hash::Sorted - customizable role for sorted Hashes
my %m is Hash::Sorted = a => 42, b => 666; # [str,Any]
my %n is Hash::Sorted[int,str] = 42 => "a", 666 => "b";
This module provides the
Hash::Sorted role, that allows you to create a Hash that always keeps its keys in sorted order. It also allows you to customize exactly how you would like to type your keys and/or your values.
Internally, this implementation works off two arrays that are being kept in sync, so any standard constraints available to arrays, can be applied as types for the keys or values.
Hash::Sorted is a role, you can also use it as a base for creating your own custom implementations of hashes.
Elizabeth Mattijsen firstname.lastname@example.org
Source can be located at: https://github.com/lizmat/Hash-Sorted . Comments and Pull Requests are welcome.
COPYRIGHT AND LICENSE
Copyright 2021 Elizabeth Mattijsen
This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0.