TITLE

SUBTITLE

data

=begin data
{"type":"page","file":"work_mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/README.md","sources":[],"node":{"type":"block","id":"JQtv2et4gg-WtxiMuv8vi","margin":"","name":"root","content":[{"type":"para","id":"X73gOIsseJgSV8ewY4HOc","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":133,"offset":132}},"text":"text","content":[{"meta":"https://github.com/lizmat/Hash-Ordered/actions","type":"fcode","name":"L","content":[{"type":"block","id":"WcxWTcqlskAm-WWX8MhZ1","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":84,"offset":83}},"content":[{"type":"image","src":"https://github.com/lizmat/Hash-Ordered/workflows/test/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"6m9UdhKVqi5uQ_s5yf-qC","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":134},"end":{"line":3,"column":7,"offset":140}},"content":["NAME"]},{"type":"para","id":"ZJcb6FKw74_HctXe4geOK","margin":"","location":{"start":{"line":5,"column":1,"offset":142},"end":{"line":5,"column":40,"offset":181}},"text":"text","content":["Hash::Ordered - role for ordered Hashes"]},{"type":"block","id":"Bj4hKvIkXp15CErhgxQ0-","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":183},"end":{"line":7,"column":11,"offset":193}},"content":["SYNOPSIS"]},{"type":"block","id":"oae5keqRk2u0fmi-4YaX3","margin":"","name":"code","config":[],"location":{"start":{"line":9,"column":1,"offset":195},"end":{"line":11,"column":48,"offset":266}},"content":[{"type":"verbatim","value":"use Hash::Ordered;\n\nmy %m is Hash::Ordered = a => 42, b => 666;"}]},{"type":"block","id":"Zp4-vHakhTYrGFBOi9oTc","margin":"","level":1,"name":"head","location":{"start":{"line":13,"column":1,"offset":268},"end":{"line":13,"column":14,"offset":281}},"content":["DESCRIPTION"]},{"type":"para","id":"RI5j9SmpHWoZ1UfXOtZTr","margin":"","location":{"start":{"line":15,"column":1,"offset":283},"end":{"line":15,"column":185,"offset":467}},"text":"text","content":["Exports a ",{"type":"fcode","name":"C","content":["Hash::Ordered"]}," role that can be used to indicate the implementation of a ",{"type":"fcode","name":"C","content":["Hash"]}," in which the keys are ordered the way the ",{"type":"fcode","name":"C","content":["Hash"]}," got initialized or any later keys got added."]},{"type":"para","id":"bdxo68xvO4_luhB2yrVTg","margin":"","location":{"start":{"line":17,"column":1,"offset":469},"end":{"line":17,"column":119,"offset":587}},"text":"text","content":["Since ",{"type":"fcode","name":"C","content":["Hash::Ordered"]}," is a role, you can also use it as a base for creating your own custom implementations of hashes."]},{"type":"block","id":"1P5tiMeXvd-lMj50FZ4xM","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":589},"end":{"line":19,"column":9,"offset":597}},"content":["AUTHOR"]},{"type":"para","id":"0BfDlwgTdxVW6r41IoYhu","margin":"","location":{"start":{"line":21,"column":1,"offset":599},"end":{"line":21,"column":37,"offset":635}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"-dl2RTt-ptrMoZHx-hSPl","margin":"","location":{"start":{"line":23,"column":1,"offset":637},"end":{"line":23,"column":107,"offset":743}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/Hash-Ordered","type":"fcode","name":"L","content":["https://github.com/lizmat/Hash-Ordered"]}," . Comments and Pull Requests are welcome."]},{"type":"block","id":"dlXmTYq5cSJE4Ky2B3TuC","margin":"","level":1,"name":"head","location":{"start":{"line":25,"column":1,"offset":745},"end":{"line":25,"column":24,"offset":768}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"8TRp1yIfcdT-IAWkJsj2a","margin":"","location":{"start":{"line":27,"column":1,"offset":770},"end":{"line":27,"column":41,"offset":810}},"text":"text","content":["Copyright 2018, 2021 Elizabeth Mattijsen"]},{"type":"para","id":"8-ZSFoRj5LO2P4vliOZfR","margin":"","location":{"start":{"line":29,"column":1,"offset":812},"end":{"line":29,"column":104,"offset":915}},"text":"text","content":["This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0."]}]},"publishUrl":"/mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":["Hash::Agnostic:ver<0.0.10>:auth<zef:lizmat>"],"description":"role for ordered Hashes","dist":"Hash::Ordered:ver<0.0.2>:auth<zef:lizmat>","license":"Artistic-2.0","name":"Hash::Ordered","path":"H/AS/HASH_ORDERED/d56a4032088eb7d55f1c8ed8ce53c75f05b416f7.tar.gz","perl":"6.c","provides":{"Hash::Ordered":"lib/Hash/Ordered.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/Hash-Ordered.git","tags":["UTILS"],"test-depends":[],"version":"0.0.2"},"files":[{"file":"work_mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/README.md","publishUrl":"/mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/README.md"},{"file":"work_mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/lib/Hash/Ordered.rakumod","publishUrl":"/mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/lib/Hash/Ordered.rakumod"}],"src":"zef","url":"/mods/zef/Hash::Ordered"}}}
=end data


React

    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/README.md","sources":[],"node":{"type":"block","id":"JQtv2et4gg-WtxiMuv8vi","margin":"","name":"root","content":[{"type":"para","id":"X73gOIsseJgSV8ewY4HOc","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":133,"offset":132}},"text":"text","content":[{"meta":"https://github.com/lizmat/Hash-Ordered/actions","type":"fcode","name":"L","content":[{"type":"block","id":"WcxWTcqlskAm-WWX8MhZ1","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":84,"offset":83}},"content":[{"type":"image","src":"https://github.com/lizmat/Hash-Ordered/workflows/test/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"6m9UdhKVqi5uQ_s5yf-qC","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":134},"end":{"line":3,"column":7,"offset":140}},"content":["NAME"]},{"type":"para","id":"ZJcb6FKw74_HctXe4geOK","margin":"","location":{"start":{"line":5,"column":1,"offset":142},"end":{"line":5,"column":40,"offset":181}},"text":"text","content":["Hash::Ordered - role for ordered Hashes"]},{"type":"block","id":"Bj4hKvIkXp15CErhgxQ0-","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":183},"end":{"line":7,"column":11,"offset":193}},"content":["SYNOPSIS"]},{"type":"block","id":"oae5keqRk2u0fmi-4YaX3","margin":"","name":"code","config":[],"location":{"start":{"line":9,"column":1,"offset":195},"end":{"line":11,"column":48,"offset":266}},"content":[{"type":"verbatim","value":"use Hash::Ordered;\n\nmy %m is Hash::Ordered = a => 42, b => 666;"}]},{"type":"block","id":"Zp4-vHakhTYrGFBOi9oTc","margin":"","level":1,"name":"head","location":{"start":{"line":13,"column":1,"offset":268},"end":{"line":13,"column":14,"offset":281}},"content":["DESCRIPTION"]},{"type":"para","id":"RI5j9SmpHWoZ1UfXOtZTr","margin":"","location":{"start":{"line":15,"column":1,"offset":283},"end":{"line":15,"column":185,"offset":467}},"text":"text","content":["Exports a ",{"type":"fcode","name":"C","content":["Hash::Ordered"]}," role that can be used to indicate the implementation of a ",{"type":"fcode","name":"C","content":["Hash"]}," in which the keys are ordered the way the ",{"type":"fcode","name":"C","content":["Hash"]}," got initialized or any later keys got added."]},{"type":"para","id":"bdxo68xvO4_luhB2yrVTg","margin":"","location":{"start":{"line":17,"column":1,"offset":469},"end":{"line":17,"column":119,"offset":587}},"text":"text","content":["Since ",{"type":"fcode","name":"C","content":["Hash::Ordered"]}," is a role, you can also use it as a base for creating your own custom implementations of hashes."]},{"type":"block","id":"1P5tiMeXvd-lMj50FZ4xM","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":589},"end":{"line":19,"column":9,"offset":597}},"content":["AUTHOR"]},{"type":"para","id":"0BfDlwgTdxVW6r41IoYhu","margin":"","location":{"start":{"line":21,"column":1,"offset":599},"end":{"line":21,"column":37,"offset":635}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"-dl2RTt-ptrMoZHx-hSPl","margin":"","location":{"start":{"line":23,"column":1,"offset":637},"end":{"line":23,"column":107,"offset":743}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/Hash-Ordered","type":"fcode","name":"L","content":["https://github.com/lizmat/Hash-Ordered"]}," . Comments and Pull Requests are welcome."]},{"type":"block","id":"dlXmTYq5cSJE4Ky2B3TuC","margin":"","level":1,"name":"head","location":{"start":{"line":25,"column":1,"offset":745},"end":{"line":25,"column":24,"offset":768}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"8TRp1yIfcdT-IAWkJsj2a","margin":"","location":{"start":{"line":27,"column":1,"offset":770},"end":{"line":27,"column":41,"offset":810}},"text":"text","content":["Copyright 2018, 2021 Elizabeth Mattijsen"]},{"type":"para","id":"8-ZSFoRj5LO2P4vliOZfR","margin":"","location":{"start":{"line":29,"column":1,"offset":812},"end":{"line":29,"column":104,"offset":915}},"text":"text","content":["This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0."]}]},"publishUrl":"/mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":["Hash::Agnostic:ver<0.0.10>:auth<zef:lizmat>"],"description":"role for ordered Hashes","dist":"Hash::Ordered:ver<0.0.2>:auth<zef:lizmat>","license":"Artistic-2.0","name":"Hash::Ordered","path":"H/AS/HASH_ORDERED/d56a4032088eb7d55f1c8ed8ce53c75f05b416f7.tar.gz","perl":"6.c","provides":{"Hash::Ordered":"lib/Hash/Ordered.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/Hash-Ordered.git","tags":["UTILS"],"test-depends":[],"version":"0.0.2"},"files":[{"file":"work_mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/README.md","publishUrl":"/mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/README.md"},{"file":"work_mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/lib/Hash/Ordered.rakumod","publishUrl":"/mods/zef/Hash::Ordered/Hash-Ordered-0.0.2/lib/Hash/Ordered.rakumod"}],"src":"zef","url":"/mods/zef/Hash::Ordered"}}}
    =end data
    =end React


root

role for ordered Hashes


para

L<Examples| file:../examples/index.podlite>


L<Download |file:../download/index.podlite>


=begin React :component<HeaderCol> :id<menu> 
=para L<Documentation|/doc/introduction>
=para L<Modules| /mods>
=para L<Examples| file:../examples/index.podlite>
=para L<Download |file:../download/index.podlite>
=para L<About|file:../about/index.podlite>
=para 🔍 K<⌘K>/K<ctrl-K>
=end React


HEADER

FOOTER

Hash::Ordered


=begin data
{"type":"page","file":"work_mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/README.md","sources":[],"node":{"type":"block","id":"wbGif3zDrFLhBiBU_fm7k","margin":"","name":"root","content":[{"type":"para","id":"W6fLJkYoGe5zw1PVbCgx_","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":139,"offset":138}},"text":"text","content":[{"meta":"https://github.com/lizmat/Hash-Restricted/actions","type":"fcode","name":"L","content":[{"type":"block","id":"QExx646Dh8VdCaXUDPmcl","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":87,"offset":86}},"content":[{"type":"image","src":"https://github.com/lizmat/Hash-Restricted/workflows/test/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"09Si9GIMjltqWsWFgt19h","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":140},"end":{"line":3,"column":7,"offset":146}},"content":["NAME"]},{"type":"para","id":"4BtaHrVSEZhWSvLtlvS3S","margin":"","location":{"start":{"line":5,"column":1,"offset":148},"end":{"line":5,"column":56,"offset":203}},"text":"text","content":["Hash::Restricted - trait for restricting keys in hashes"]},{"type":"block","id":"kzl7YTVJnAsDLL5AhXQK7","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":205},"end":{"line":7,"column":11,"offset":215}},"content":["SYNOPSIS"]},{"type":"block","id":"zXUlXfNeUkUrU4RZ3mEUo","margin":"","name":"code","config":[],"location":{"start":{"line":9,"column":1,"offset":217},"end":{"line":17,"column":25,"offset":402}},"content":[{"type":"verbatim","value":"use Hash::Restricted;\n\nmy %h is restricted = a => 42, b => 666;\n%h<c> = 317;  # dies\n\nmy %h is restricted<a b>;\n%h<a> = 42;\n%h<b> = 666;\n%h<c> = 317;  # dies"}]},{"type":"block","id":"RgpnF3BwZPaIisDfLLgIZ","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":404},"end":{"line":19,"column":14,"offset":417}},"content":["DESCRIPTION"]},{"type":"para","id":"IBEyX26i2yemj2xf_w94h","margin":"","location":{"start":{"line":21,"column":1,"offset":419},"end":{"line":21,"column":158,"offset":576}},"text":"text","content":["Hash::Restricted provides a ",{"type":"fcode","name":"C","content":["is restricted"]}," trait on ",{"type":"fcode","name":"C","content":["Map"]},"s and ",{"type":"fcode","name":"C","content":["Hash"]},"es as an easy way to restrict which keys are going to be allowed in the ",{"type":"fcode","name":"C","content":["Map"]}," / ",{"type":"fcode","name":"C","content":["Hash"]},"."]},{"type":"para","id":"cjXjwHiLDNA8pccuxltPF","margin":"","location":{"start":{"line":23,"column":1,"offset":578},"end":{"line":23,"column":140,"offset":717}},"text":"text","content":["If you do not specify any keys with ",{"type":"fcode","name":"C","content":["is restricted"]},", it will limit to the keys that were specified when the ",{"type":"fcode","name":"C","content":["Map"]}," / ",{"type":"fcode","name":"C","content":["Hash"]}," was initialized."]},{"type":"para","id":"QjVRW07kC_5BfB6P1epmn","margin":"","location":{"start":{"line":25,"column":1,"offset":719},"end":{"line":25,"column":78,"offset":796}},"text":"text","content":["If you ",{"type":"fcode","name":"B","content":["do"]}," specify keys, then those will be the keys that will be allowed."]},{"type":"block","id":"AK9l3j4jY_EZeJH0t8Ze0","margin":"","level":1,"name":"head","location":{"start":{"line":27,"column":1,"offset":798},"end":{"line":27,"column":9,"offset":806}},"content":["AUTHOR"]},{"type":"para","id":"ovxHsrFR80LJ6Ca-n-4yF","margin":"","location":{"start":{"line":29,"column":1,"offset":808},"end":{"line":29,"column":37,"offset":844}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"vVDAPckmoPWnAu5F7bndi","margin":"","location":{"start":{"line":31,"column":1,"offset":846},"end":{"line":31,"column":110,"offset":955}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/Hash-Restricted","type":"fcode","name":"L","content":["https://github.com/lizmat/Hash-Restricted"]}," . Comments and Pull Requests are welcome."]},{"type":"block","id":"ddALwUwBr4GxffzGj6n-u","margin":"","level":1,"name":"head","location":{"start":{"line":33,"column":1,"offset":957},"end":{"line":33,"column":24,"offset":980}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"E_Yu62z2WdR-C4eMcndK4","margin":"","location":{"start":{"line":35,"column":1,"offset":982},"end":{"line":35,"column":47,"offset":1028}},"text":"text","content":["Copyright 2018, 2020, 2021 Elizabeth Mattijsen"]},{"type":"para","id":"hPpskWUawyjhipcTlJOLh","margin":"","location":{"start":{"line":37,"column":1,"offset":1030},"end":{"line":37,"column":104,"offset":1133}},"text":"text","content":["This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0."]}]},"publishUrl":"/mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"trait for restricting keys in hashes","dist":"Hash::Restricted:ver<0.0.7>:auth<zef:lizmat>","license":"Artistic-2.0","name":"Hash::Restricted","path":"H/AS/HASH_RESTRICTED/cd26cff46171f47aa0fedf83446c9aeab084f339.tar.gz","perl":"6.c","provides":{"Hash::Restricted":"lib/Hash/Restricted.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/Hash-Restricted.git","tags":["UTILS"],"test-depends":[],"version":"0.0.7"},"files":[{"file":"work_mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/README.md","publishUrl":"/mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/README.md"},{"file":"work_mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/lib/Hash/Restricted.rakumod","publishUrl":"/mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/lib/Hash/Restricted.rakumod"}],"src":"zef","url":"/mods/zef/Hash::Restricted"}}}
=end data


    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/README.md","sources":[],"node":{"type":"block","id":"wbGif3zDrFLhBiBU_fm7k","margin":"","name":"root","content":[{"type":"para","id":"W6fLJkYoGe5zw1PVbCgx_","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":139,"offset":138}},"text":"text","content":[{"meta":"https://github.com/lizmat/Hash-Restricted/actions","type":"fcode","name":"L","content":[{"type":"block","id":"QExx646Dh8VdCaXUDPmcl","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":87,"offset":86}},"content":[{"type":"image","src":"https://github.com/lizmat/Hash-Restricted/workflows/test/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"09Si9GIMjltqWsWFgt19h","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":140},"end":{"line":3,"column":7,"offset":146}},"content":["NAME"]},{"type":"para","id":"4BtaHrVSEZhWSvLtlvS3S","margin":"","location":{"start":{"line":5,"column":1,"offset":148},"end":{"line":5,"column":56,"offset":203}},"text":"text","content":["Hash::Restricted - trait for restricting keys in hashes"]},{"type":"block","id":"kzl7YTVJnAsDLL5AhXQK7","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":205},"end":{"line":7,"column":11,"offset":215}},"content":["SYNOPSIS"]},{"type":"block","id":"zXUlXfNeUkUrU4RZ3mEUo","margin":"","name":"code","config":[],"location":{"start":{"line":9,"column":1,"offset":217},"end":{"line":17,"column":25,"offset":402}},"content":[{"type":"verbatim","value":"use Hash::Restricted;\n\nmy %h is restricted = a => 42, b => 666;\n%h<c> = 317;  # dies\n\nmy %h is restricted<a b>;\n%h<a> = 42;\n%h<b> = 666;\n%h<c> = 317;  # dies"}]},{"type":"block","id":"RgpnF3BwZPaIisDfLLgIZ","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":404},"end":{"line":19,"column":14,"offset":417}},"content":["DESCRIPTION"]},{"type":"para","id":"IBEyX26i2yemj2xf_w94h","margin":"","location":{"start":{"line":21,"column":1,"offset":419},"end":{"line":21,"column":158,"offset":576}},"text":"text","content":["Hash::Restricted provides a ",{"type":"fcode","name":"C","content":["is restricted"]}," trait on ",{"type":"fcode","name":"C","content":["Map"]},"s and ",{"type":"fcode","name":"C","content":["Hash"]},"es as an easy way to restrict which keys are going to be allowed in the ",{"type":"fcode","name":"C","content":["Map"]}," / ",{"type":"fcode","name":"C","content":["Hash"]},"."]},{"type":"para","id":"cjXjwHiLDNA8pccuxltPF","margin":"","location":{"start":{"line":23,"column":1,"offset":578},"end":{"line":23,"column":140,"offset":717}},"text":"text","content":["If you do not specify any keys with ",{"type":"fcode","name":"C","content":["is restricted"]},", it will limit to the keys that were specified when the ",{"type":"fcode","name":"C","content":["Map"]}," / ",{"type":"fcode","name":"C","content":["Hash"]}," was initialized."]},{"type":"para","id":"QjVRW07kC_5BfB6P1epmn","margin":"","location":{"start":{"line":25,"column":1,"offset":719},"end":{"line":25,"column":78,"offset":796}},"text":"text","content":["If you ",{"type":"fcode","name":"B","content":["do"]}," specify keys, then those will be the keys that will be allowed."]},{"type":"block","id":"AK9l3j4jY_EZeJH0t8Ze0","margin":"","level":1,"name":"head","location":{"start":{"line":27,"column":1,"offset":798},"end":{"line":27,"column":9,"offset":806}},"content":["AUTHOR"]},{"type":"para","id":"ovxHsrFR80LJ6Ca-n-4yF","margin":"","location":{"start":{"line":29,"column":1,"offset":808},"end":{"line":29,"column":37,"offset":844}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"vVDAPckmoPWnAu5F7bndi","margin":"","location":{"start":{"line":31,"column":1,"offset":846},"end":{"line":31,"column":110,"offset":955}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/Hash-Restricted","type":"fcode","name":"L","content":["https://github.com/lizmat/Hash-Restricted"]}," . Comments and Pull Requests are welcome."]},{"type":"block","id":"ddALwUwBr4GxffzGj6n-u","margin":"","level":1,"name":"head","location":{"start":{"line":33,"column":1,"offset":957},"end":{"line":33,"column":24,"offset":980}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"E_Yu62z2WdR-C4eMcndK4","margin":"","location":{"start":{"line":35,"column":1,"offset":982},"end":{"line":35,"column":47,"offset":1028}},"text":"text","content":["Copyright 2018, 2020, 2021 Elizabeth Mattijsen"]},{"type":"para","id":"hPpskWUawyjhipcTlJOLh","margin":"","location":{"start":{"line":37,"column":1,"offset":1030},"end":{"line":37,"column":104,"offset":1133}},"text":"text","content":["This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0."]}]},"publishUrl":"/mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"trait for restricting keys in hashes","dist":"Hash::Restricted:ver<0.0.7>:auth<zef:lizmat>","license":"Artistic-2.0","name":"Hash::Restricted","path":"H/AS/HASH_RESTRICTED/cd26cff46171f47aa0fedf83446c9aeab084f339.tar.gz","perl":"6.c","provides":{"Hash::Restricted":"lib/Hash/Restricted.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/Hash-Restricted.git","tags":["UTILS"],"test-depends":[],"version":"0.0.7"},"files":[{"file":"work_mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/README.md","publishUrl":"/mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/README.md"},{"file":"work_mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/lib/Hash/Restricted.rakumod","publishUrl":"/mods/zef/Hash::Restricted/Hash-Restricted-0.0.7/lib/Hash/Restricted.rakumod"}],"src":"zef","url":"/mods/zef/Hash::Restricted"}}}
    =end data
    =end React


trait for restricting keys in hashes


Hash::Restricted


trait for limiting number of keys in hashes by usage


=begin data
{"type":"page","file":"work_mods/zef/Hash::LRU/Hash-LRU-0.0.5/README.md","sources":[],"node":{"type":"block","id":"QWoWoDe2UFlATnGSfAIxj","margin":"","name":"root","content":[{"type":"para","id":"Zbuqn_KdyeLScCnyIjLZc","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":125,"offset":124}},"text":"text","content":[{"meta":"https://github.com/lizmat/Hash-LRU/actions","type":"fcode","name":"L","content":[{"type":"block","id":"ibFu_1aw36YCwEG8xCl4W","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":80,"offset":79}},"content":[{"type":"image","src":"https://github.com/lizmat/Hash-LRU/workflows/test/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"SvVt5dKNRviqp2YK_0kI0","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":126},"end":{"line":3,"column":7,"offset":132}},"content":["NAME"]},{"type":"para","id":"7SgcbP_h7ZhBaZ4Nr1L06","margin":"","location":{"start":{"line":5,"column":1,"offset":134},"end":{"line":5,"column":65,"offset":198}},"text":"text","content":["Hash::LRU - trait for limiting number of keys in hashes by usage"]},{"type":"block","id":"VAv0F8URmYV99KU9h07Gz","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":200},"end":{"line":7,"column":11,"offset":210}},"content":["SYNOPSIS"]},{"type":"block","id":"4ej_iGO4mP2ZvBj4yrbT8","margin":"","name":"code","config":[],"location":{"start":{"line":9,"column":1,"offset":212},"end":{"line":15,"column":55,"offset":441}},"content":[{"type":"verbatim","value":"use Hash::LRU;  # Least Recently Used\n\nmy %h is LRU;   # defaults to elements => 100\n\nmy %h is LRU(elements => 42);  # note: value must be known at compile time!\n\nmy %h{Any} is LRU;  # object hashes also supported"}]},{"type":"block","id":"ZOAwyr2U1D141Rpbr_MoG","margin":"","level":1,"name":"head","location":{"start":{"line":17,"column":1,"offset":443},"end":{"line":17,"column":14,"offset":456}},"content":["DESCRIPTION"]},{"type":"para","id":"vMHAEyssYNc84IBS8zdc6","margin":"","location":{"start":{"line":19,"column":1,"offset":458},"end":{"line":19,"column":295,"offset":752}},"text":"text","content":["Hash::LRU provides a ",{"type":"fcode","name":"C","content":["is LRU"]}," trait on ",{"type":"fcode","name":"C","content":["Hash"]},"es as an easy way to limit the number of keys kept in the ",{"type":"fcode","name":"C","content":["Hash"]},". Keys will be added as long as the number of keys is under the limit. As soon as a new key is added that would exceed the limit, the least recently used key is removed from the ",{"type":"fcode","name":"C","content":["Hash"]},"."]},{"type":"para","id":"7xfofwnjOdjBRx_4ZZCGu","margin":"","location":{"start":{"line":21,"column":1,"offset":754},"end":{"line":21,"column":54,"offset":807}},"text":"text","content":["Both \"normal\" as well as object hashes are supported."]},{"type":"block","id":"rMBm3psd-8s1l9D0Thvh0","margin":"","level":1,"name":"head","location":{"start":{"line":23,"column":1,"offset":809},"end":{"line":23,"column":10,"offset":818}},"content":["EXAMPLE"]},{"type":"block","id":"xIReYEwJYYOujBAONaZeR","margin":"","name":"code","config":[],"location":{"start":{"line":25,"column":1,"offset":820},"end":{"line":35,"column":70,"offset":1081}},"content":[{"type":"verbatim","value":"use Hash::LRU;\n\nmy %h is LRU(elements => 3);\n\n%h<name>       = \"Alex\";\n%h<language>   = \"Raku\";\n%h<occupation> = \"devops\";\n%h<location>   = \"Russia\";\n\nsay %h.raku;\n# {:location(\"Russia\"), :occupation(\"devops\"), :language(\"Raku\")}"}]},{"type":"block","id":"JNIwbmi0htYFilZA5XFnW","margin":"","level":1,"name":"head","location":{"start":{"line":37,"column":1,"offset":1083},"end":{"line":37,"column":9,"offset":1091}},"content":["AUTHOR"]},{"type":"para","id":"THfkQgvj4PjIiQ_pEvGCK","margin":"","location":{"start":{"line":39,"column":1,"offset":1093},"end":{"line":39,"column":37,"offset":1129}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"_bMF2AgofUN3LK52Q9C-7","margin":"","location":{"start":{"line":41,"column":1,"offset":1131},"end":{"line":41,"column":103,"offset":1233}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/Hash-LRU","type":"fcode","name":"L","content":["https://github.com/lizmat/Hash-LRU"]}," . Comments and Pull Requests are welcome."]},{"type":"block","id":"T1cKUFMVFUi4zBODQWFS7","margin":"","level":1,"name":"head","location":{"start":{"line":43,"column":1,"offset":1235},"end":{"line":43,"column":24,"offset":1258}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"tTL28nbg7ReWPk1Ap-X7K","margin":"","location":{"start":{"line":45,"column":1,"offset":1260},"end":{"line":45,"column":47,"offset":1306}},"text":"text","content":["Copyright 2018, 2020, 2021 Elizabeth Mattijsen"]},{"type":"para","id":"u0Q34ZHWyUT0kYbkp_7Fi","margin":"","location":{"start":{"line":47,"column":1,"offset":1308},"end":{"line":47,"column":104,"offset":1411}},"text":"text","content":["This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0."]}]},"publishUrl":"/mods/zef/Hash::LRU/Hash-LRU-0.0.5/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"trait for limiting number of keys in hashes by usage","dist":"Hash::LRU:ver<0.0.5>:auth<zef:lizmat>","license":"Artistic-2.0","name":"Hash::LRU","path":"H/AS/HASH_LRU/ad21433a248a2ee7ae531e0140d72e2447681561.tar.gz","perl":"6.c","provides":{"Hash::LRU":"lib/Hash/LRU.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/Hash-LRU.git","tags":["UTILS"],"test-depends":[],"version":"0.0.5"},"files":[{"file":"work_mods/zef/Hash::LRU/Hash-LRU-0.0.5/README.md","publishUrl":"/mods/zef/Hash::LRU/Hash-LRU-0.0.5/README.md"},{"file":"work_mods/zef/Hash::LRU/Hash-LRU-0.0.5/lib/Hash/LRU.rakumod","publishUrl":"/mods/zef/Hash::LRU/Hash-LRU-0.0.5/lib/Hash/LRU.rakumod"}],"src":"zef","url":"/mods/zef/Hash::LRU"}}}
=end data


    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/Hash::LRU/Hash-LRU-0.0.5/README.md","sources":[],"node":{"type":"block","id":"QWoWoDe2UFlATnGSfAIxj","margin":"","name":"root","content":[{"type":"para","id":"Zbuqn_KdyeLScCnyIjLZc","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":125,"offset":124}},"text":"text","content":[{"meta":"https://github.com/lizmat/Hash-LRU/actions","type":"fcode","name":"L","content":[{"type":"block","id":"ibFu_1aw36YCwEG8xCl4W","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":80,"offset":79}},"content":[{"type":"image","src":"https://github.com/lizmat/Hash-LRU/workflows/test/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"SvVt5dKNRviqp2YK_0kI0","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":126},"end":{"line":3,"column":7,"offset":132}},"content":["NAME"]},{"type":"para","id":"7SgcbP_h7ZhBaZ4Nr1L06","margin":"","location":{"start":{"line":5,"column":1,"offset":134},"end":{"line":5,"column":65,"offset":198}},"text":"text","content":["Hash::LRU - trait for limiting number of keys in hashes by usage"]},{"type":"block","id":"VAv0F8URmYV99KU9h07Gz","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":200},"end":{"line":7,"column":11,"offset":210}},"content":["SYNOPSIS"]},{"type":"block","id":"4ej_iGO4mP2ZvBj4yrbT8","margin":"","name":"code","config":[],"location":{"start":{"line":9,"column":1,"offset":212},"end":{"line":15,"column":55,"offset":441}},"content":[{"type":"verbatim","value":"use Hash::LRU;  # Least Recently Used\n\nmy %h is LRU;   # defaults to elements => 100\n\nmy %h is LRU(elements => 42);  # note: value must be known at compile time!\n\nmy %h{Any} is LRU;  # object hashes also supported"}]},{"type":"block","id":"ZOAwyr2U1D141Rpbr_MoG","margin":"","level":1,"name":"head","location":{"start":{"line":17,"column":1,"offset":443},"end":{"line":17,"column":14,"offset":456}},"content":["DESCRIPTION"]},{"type":"para","id":"vMHAEyssYNc84IBS8zdc6","margin":"","location":{"start":{"line":19,"column":1,"offset":458},"end":{"line":19,"column":295,"offset":752}},"text":"text","content":["Hash::LRU provides a ",{"type":"fcode","name":"C","content":["is LRU"]}," trait on ",{"type":"fcode","name":"C","content":["Hash"]},"es as an easy way to limit the number of keys kept in the ",{"type":"fcode","name":"C","content":["Hash"]},". Keys will be added as long as the number of keys is under the limit. As soon as a new key is added that would exceed the limit, the least recently used key is removed from the ",{"type":"fcode","name":"C","content":["Hash"]},"."]},{"type":"para","id":"7xfofwnjOdjBRx_4ZZCGu","margin":"","location":{"start":{"line":21,"column":1,"offset":754},"end":{"line":21,"column":54,"offset":807}},"text":"text","content":["Both \"normal\" as well as object hashes are supported."]},{"type":"block","id":"rMBm3psd-8s1l9D0Thvh0","margin":"","level":1,"name":"head","location":{"start":{"line":23,"column":1,"offset":809},"end":{"line":23,"column":10,"offset":818}},"content":["EXAMPLE"]},{"type":"block","id":"xIReYEwJYYOujBAONaZeR","margin":"","name":"code","config":[],"location":{"start":{"line":25,"column":1,"offset":820},"end":{"line":35,"column":70,"offset":1081}},"content":[{"type":"verbatim","value":"use Hash::LRU;\n\nmy %h is LRU(elements => 3);\n\n%h<name>       = \"Alex\";\n%h<language>   = \"Raku\";\n%h<occupation> = \"devops\";\n%h<location>   = \"Russia\";\n\nsay %h.raku;\n# {:location(\"Russia\"), :occupation(\"devops\"), :language(\"Raku\")}"}]},{"type":"block","id":"JNIwbmi0htYFilZA5XFnW","margin":"","level":1,"name":"head","location":{"start":{"line":37,"column":1,"offset":1083},"end":{"line":37,"column":9,"offset":1091}},"content":["AUTHOR"]},{"type":"para","id":"THfkQgvj4PjIiQ_pEvGCK","margin":"","location":{"start":{"line":39,"column":1,"offset":1093},"end":{"line":39,"column":37,"offset":1129}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"_bMF2AgofUN3LK52Q9C-7","margin":"","location":{"start":{"line":41,"column":1,"offset":1131},"end":{"line":41,"column":103,"offset":1233}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/Hash-LRU","type":"fcode","name":"L","content":["https://github.com/lizmat/Hash-LRU"]}," . Comments and Pull Requests are welcome."]},{"type":"block","id":"T1cKUFMVFUi4zBODQWFS7","margin":"","level":1,"name":"head","location":{"start":{"line":43,"column":1,"offset":1235},"end":{"line":43,"column":24,"offset":1258}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"tTL28nbg7ReWPk1Ap-X7K","margin":"","location":{"start":{"line":45,"column":1,"offset":1260},"end":{"line":45,"column":47,"offset":1306}},"text":"text","content":["Copyright 2018, 2020, 2021 Elizabeth Mattijsen"]},{"type":"para","id":"u0Q34ZHWyUT0kYbkp_7Fi","margin":"","location":{"start":{"line":47,"column":1,"offset":1308},"end":{"line":47,"column":104,"offset":1411}},"text":"text","content":["This library is free software; you can redistribute it and/or modify it under the Artistic License 2.0."]}]},"publishUrl":"/mods/zef/Hash::LRU/Hash-LRU-0.0.5/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"trait for limiting number of keys in hashes by usage","dist":"Hash::LRU:ver<0.0.5>:auth<zef:lizmat>","license":"Artistic-2.0","name":"Hash::LRU","path":"H/AS/HASH_LRU/ad21433a248a2ee7ae531e0140d72e2447681561.tar.gz","perl":"6.c","provides":{"Hash::LRU":"lib/Hash/LRU.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/Hash-LRU.git","tags":["UTILS"],"test-depends":[],"version":"0.0.5"},"files":[{"file":"work_mods/zef/Hash::LRU/Hash-LRU-0.0.5/README.md","publishUrl":"/mods/zef/Hash::LRU/Hash-LRU-0.0.5/README.md"},{"file":"work_mods/zef/Hash::LRU/Hash-LRU-0.0.5/lib/Hash/LRU.rakumod","publishUrl":"/mods/zef/Hash::LRU/Hash-LRU-0.0.5/lib/Hash/LRU.rakumod"}],"src":"zef","url":"/mods/zef/Hash::LRU"}}}
    =end data
    =end React


Hash::LRU


The Raku Knowledge Base


=begin React :component<HeaderCol> :id<footer>  
=begin nested :!nested
=item1 B<Language>
    =item2 L<Get started|file:../getting-started/getting-started.podlite>
    =item2 L<Why Raku?|/doc/language/faq#Why-should-I-learn-Raku-What's-so-great-about-it>
    =item2 L<Try Raku|https://glot.io/new/raku>
    =item2 L<Raku cheat sheet|https://github.com/Raku/mu/blob/master/docs/Perl6/Cheatsheet/cheatsheet.txt>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<Raku on Exercism|https://exercism.org/tracks/raku>
    =item2 L<Wikipedia|https://en.wikipedia.org/wiki/Raku_(programming_language)>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>

=end nested
=begin nested :!nested

=item1 B<L<Documentation|/doc>>
    =item2 L<Getting started, Migration guides from other languages, & Tutorials | file:../doc/introduction.podlite>
    =item2 L<Language References|file:../doc/reference.podlite>
    =item2 L<Type Reference| file:../doc/types.podlite>
    =item2 L<Miscellaneous| file:../doc/miscellaneous.podlite>
    =item2 L<FAQs (Frequently Asked Questions)|/doc/language/faq>
    =item2 L<Community|/doc/language/community>
    =item2 L<The list of all documents|file:../doc/index.podlite>

=item1 B<Resources>
    =item2 L<The Raku Guide|https://raku.guide/>
    =item2 L<Books |https://perl6book.com/>
    =item2 L<Rosetta Code | https://www.raku.org/community/rosettacode>

=end nested
=begin nested :!nested

=item1 B<Resoures>
    =item2 L<Download | file:../download/index.podlite>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>

=item1 B<Learning>
    =item2 L<The Raku Guide|https://raku.guide/>
    =item2 L<Wikibook |https://en.wikibooks.org/wiki/Raku_Programming>
    =item2 L<Books |https://perl6book.com/>
    =item2 L<Rosetta Code | https://www.raku.org/community/rosettacode>
    =item2 L<Learn Raku in Y minutes|https://learnxinyminutes.com/docs/raku/>
    =item2 L<Golfing |https://github.com/AlexDaniel/raku-golf-cheatsheet>
=end nested
=begin nested :!nested

=item1 B<Explore>
    =item2 L<Raku Blog Aggregator|https://planet.raku.org/>
    =item2 L<Rakudo Weekly|https://rakudoweekly.blog/>
    =item2 L<The Weekly Challenge |https://perlweeklychallenge.org/>
    =item2 L<Raku Advent Calendar|https://raku-advent.blog/>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>
    =item2 L<empty|#>

=end nested
=end React


=begin React :component<CookieConsent> :id<CookieConsent> :buttonCaption("Got it!")
=para
This website uses cookies for analytics.
=end React


Hash::Ordered

NAME

SYNOPSIS

DESCRIPTION

AUTHOR

COPYRIGHT AND LICENSE

Hash::Ordered v0.0.2

Authors

License

Dependencies

Test Dependencies

Provides

Documentation