TITLE

SUBTITLE

data

=begin data
{"type":"page","file":"work_mods/zef/Hash::int/Hash-int-0.0.3/README.md","sources":[],"node":{"type":"block","id":"VAtBHly1r0Ayatlt_HW7d","margin":"","name":"root","content":[{"type":"para","id":"AaiVQqQLvF7kuDGC9b5p8","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-int/actions","type":"fcode","name":"L","content":[{"type":"block","id":"Ln94tS2J1UJoIfJAAjcH1","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-int/workflows/test/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"ifuRJ2PrUiquKVw27L4Tp","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":"fOYwn3g9tEZyc526M93h5","margin":"","location":{"start":{"line":5,"column":1,"offset":134},"end":{"line":5,"column":52,"offset":185}},"text":"text","content":["Hash::int - provide a hash with native integer keys"]},{"type":"block","id":"j5XztQ3zwQR8DcyS7SWAy","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":187},"end":{"line":7,"column":11,"offset":197}},"content":["SYNOPSIS"]},{"type":"block","id":"ao81w7bT3tDNhVbauGnJb","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":9,"column":1,"offset":199},"end":{"line":13,"column":4,"offset":277}},"content":[{"type":"verbatim","value":"use Hash::int;\n\nmy %hash is Hash::int = 42 => \"foo\", 666 => \"bar\";"}]},{"type":"block","id":"yI1E7dWf8DqHzupPrYZ-7","margin":"","level":1,"name":"head","location":{"start":{"line":15,"column":1,"offset":279},"end":{"line":15,"column":14,"offset":292}},"content":["DESCRIPTION"]},{"type":"para","id":"wFG5yPc_fNDXIqCFulvHy","margin":"","location":{"start":{"line":17,"column":1,"offset":294},"end":{"line":17,"column":273,"offset":566}},"text":"text","content":["Hash::int is module that provides the ",{"type":"fcode","name":"C","content":["Hash::int"]}," class to be applied to the initialization of an Associative, making it limit the keys to native integers that fit the ",{"type":"fcode","name":"C","content":["int"]}," type. This allows this module to take some shortcuts, making it up to 7x as fast as a normal hash."]},{"type":"block","id":"5zoS3f-Hvp2yAuiWz8JCn","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":568},"end":{"line":19,"column":9,"offset":576}},"content":["AUTHOR"]},{"type":"para","id":"AxX0YiNRt13tBc_hyIQDa","margin":"","location":{"start":{"line":21,"column":1,"offset":578},"end":{"line":21,"column":37,"offset":614}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"N_q1jupCowviZNQaTQqyg","margin":"","location":{"start":{"line":23,"column":1,"offset":616},"end":{"line":23,"column":103,"offset":718}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/Hash-int","type":"fcode","name":"L","content":["https://github.com/lizmat/Hash-int"]}," . Comments and Pull Requests are welcome."]},{"type":"block","id":"Y1O3PB0GbIPklmLU5QeRp","margin":"","level":1,"name":"head","location":{"start":{"line":25,"column":1,"offset":720},"end":{"line":25,"column":24,"offset":743}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"q1pIq5LVTT2ge_q0hcaCF","margin":"","location":{"start":{"line":27,"column":1,"offset":745},"end":{"line":27,"column":35,"offset":779}},"text":"text","content":["Copyright 2021 Elizabeth Mattijsen"]},{"type":"para","id":"0PDK95XZL-4d6ndVPEbts","margin":"","location":{"start":{"line":29,"column":1,"offset":781},"end":{"line":29,"column":104,"offset":884}},"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::int/Hash-int-0.0.3/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"provide a hash with native integer keys","dist":"Hash::int:ver<0.0.3>:auth<zef:lizmat>","license":"Artistic-2.0","name":"Hash::int","path":"H/AS/HASH_INT/bab2ea807d0b000cd3b3ce84164ad28d0374ece9.tar.gz","perl":"6.d","provides":{"Hash::int":"lib/Hash/int.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/Hash-int.git","tags":[],"test-depends":[],"version":"0.0.3"},"files":[{"file":"work_mods/zef/Hash::int/Hash-int-0.0.3/README.md","publishUrl":"/mods/zef/Hash::int/Hash-int-0.0.3/README.md"},{"file":"work_mods/zef/Hash::int/Hash-int-0.0.3/lib/Hash/int.rakumod","publishUrl":"/mods/zef/Hash::int/Hash-int-0.0.3/lib/Hash/int.rakumod"}],"src":"zef","url":"/mods/zef/Hash::int"}}}
=end data


React

    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/Hash::int/Hash-int-0.0.3/README.md","sources":[],"node":{"type":"block","id":"VAtBHly1r0Ayatlt_HW7d","margin":"","name":"root","content":[{"type":"para","id":"AaiVQqQLvF7kuDGC9b5p8","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-int/actions","type":"fcode","name":"L","content":[{"type":"block","id":"Ln94tS2J1UJoIfJAAjcH1","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-int/workflows/test/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"ifuRJ2PrUiquKVw27L4Tp","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":"fOYwn3g9tEZyc526M93h5","margin":"","location":{"start":{"line":5,"column":1,"offset":134},"end":{"line":5,"column":52,"offset":185}},"text":"text","content":["Hash::int - provide a hash with native integer keys"]},{"type":"block","id":"j5XztQ3zwQR8DcyS7SWAy","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":187},"end":{"line":7,"column":11,"offset":197}},"content":["SYNOPSIS"]},{"type":"block","id":"ao81w7bT3tDNhVbauGnJb","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":9,"column":1,"offset":199},"end":{"line":13,"column":4,"offset":277}},"content":[{"type":"verbatim","value":"use Hash::int;\n\nmy %hash is Hash::int = 42 => \"foo\", 666 => \"bar\";"}]},{"type":"block","id":"yI1E7dWf8DqHzupPrYZ-7","margin":"","level":1,"name":"head","location":{"start":{"line":15,"column":1,"offset":279},"end":{"line":15,"column":14,"offset":292}},"content":["DESCRIPTION"]},{"type":"para","id":"wFG5yPc_fNDXIqCFulvHy","margin":"","location":{"start":{"line":17,"column":1,"offset":294},"end":{"line":17,"column":273,"offset":566}},"text":"text","content":["Hash::int is module that provides the ",{"type":"fcode","name":"C","content":["Hash::int"]}," class to be applied to the initialization of an Associative, making it limit the keys to native integers that fit the ",{"type":"fcode","name":"C","content":["int"]}," type. This allows this module to take some shortcuts, making it up to 7x as fast as a normal hash."]},{"type":"block","id":"5zoS3f-Hvp2yAuiWz8JCn","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":568},"end":{"line":19,"column":9,"offset":576}},"content":["AUTHOR"]},{"type":"para","id":"AxX0YiNRt13tBc_hyIQDa","margin":"","location":{"start":{"line":21,"column":1,"offset":578},"end":{"line":21,"column":37,"offset":614}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"N_q1jupCowviZNQaTQqyg","margin":"","location":{"start":{"line":23,"column":1,"offset":616},"end":{"line":23,"column":103,"offset":718}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/Hash-int","type":"fcode","name":"L","content":["https://github.com/lizmat/Hash-int"]}," . Comments and Pull Requests are welcome."]},{"type":"block","id":"Y1O3PB0GbIPklmLU5QeRp","margin":"","level":1,"name":"head","location":{"start":{"line":25,"column":1,"offset":720},"end":{"line":25,"column":24,"offset":743}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"q1pIq5LVTT2ge_q0hcaCF","margin":"","location":{"start":{"line":27,"column":1,"offset":745},"end":{"line":27,"column":35,"offset":779}},"text":"text","content":["Copyright 2021 Elizabeth Mattijsen"]},{"type":"para","id":"0PDK95XZL-4d6ndVPEbts","margin":"","location":{"start":{"line":29,"column":1,"offset":781},"end":{"line":29,"column":104,"offset":884}},"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::int/Hash-int-0.0.3/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"provide a hash with native integer keys","dist":"Hash::int:ver<0.0.3>:auth<zef:lizmat>","license":"Artistic-2.0","name":"Hash::int","path":"H/AS/HASH_INT/bab2ea807d0b000cd3b3ce84164ad28d0374ece9.tar.gz","perl":"6.d","provides":{"Hash::int":"lib/Hash/int.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/Hash-int.git","tags":[],"test-depends":[],"version":"0.0.3"},"files":[{"file":"work_mods/zef/Hash::int/Hash-int-0.0.3/README.md","publishUrl":"/mods/zef/Hash::int/Hash-int-0.0.3/README.md"},{"file":"work_mods/zef/Hash::int/Hash-int-0.0.3/lib/Hash/int.rakumod","publishUrl":"/mods/zef/Hash::int/Hash-int-0.0.3/lib/Hash/int.rakumod"}],"src":"zef","url":"/mods/zef/Hash::int"}}}
    =end data
    =end React


root

provide a hash with native integer keys


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::int


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


=begin data
{"type":"page","file":"work_mods/zef/Hash::Consistent/dist/README.md","sources":[],"node":{"type":"block","id":"xOFrB5pegA3amVePBoT6w","margin":"","name":"root","content":[{"type":"para","id":"wnGIeKAyG0AzJF4gB540u","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":2,"column":137,"offset":252}},"text":"text","content":[{"meta":"https://opensource.org/licenses/BSD-2-Clause","type":"fcode","name":"L","content":[{"type":"block","id":"k9qNu_sDCq9ATfdpgdhcA","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":69,"offset":68}},"content":[{"type":"image","src":"https://img.shields.io/badge/License-BSD-yellow.svg","alt":"License:BSD"}]}]},"\n",{"meta":"https://github.com/bradclawsie/Hash-Consistent/actions","type":"fcode","name":"L","content":[{"type":"block","id":"nAbRV4lAz2Kwsn6oHpvFW","margin":"","name":"Image","config":[],"location":{"start":{"line":2,"column":2,"offset":117},"end":{"line":2,"column":80,"offset":195}},"content":[{"type":"image","src":"https://github.com/bradclawsie/Hash-Consistent/workflows/test/badge.svg","alt":"ci"}]}]}]},{"type":"block","id":"BC4oHxXdEgSeLlGJvAKkH","margin":"","level":1,"name":"head","location":{"start":{"line":4,"column":1,"offset":254},"end":{"line":4,"column":19,"offset":272}},"content":["Hash::Consistent"]},{"type":"para","id":"tlKaNzRdoQPm0kP7IiQJb","margin":"","location":{"start":{"line":6,"column":1,"offset":274},"end":{"line":6,"column":44,"offset":317}},"text":"text","content":["A Raku implementation of a Consistent Hash."]},{"type":"block","id":"gAxPXe-0AKm-nha8ZJI_D","margin":"","level":2,"name":"head","location":{"start":{"line":8,"column":1,"offset":319},"end":{"line":8,"column":15,"offset":333}},"content":["DESCRIPTION"]},{"type":"para","id":"_HEKaJZsGXKuyh8wTHPb5","margin":"","location":{"start":{"line":10,"column":1,"offset":335},"end":{"line":13,"column":21,"offset":610}},"text":"text","content":["A \"consistent\" hash allows the user to create a data structure in which a set of string\nflags are entered in the hash at intervals specified by the CRC32 hash of the flag.\nOptionally, each flag can have suffixes appended to it in order to create multiple\nentries in the hash."]},{"type":"para","id":"EqGFIg3FUwmpC8juA19q_","margin":"","location":{"start":{"line":15,"column":1,"offset":612},"end":{"line":19,"column":18,"offset":954}},"text":"text","content":["Once flags are entered into the hash, we can find which flag would be associated with\na candidate string of our choice. A typical use-case for this is to enter host\nnames into the hash the represent destination hosts where values are stored\nfor particular keys, as determined by the result of searching for the corresponding\nflag in the hash."]},{"type":"para","id":"h47HAGG4wBChVXg3LIvji","margin":"","location":{"start":{"line":21,"column":1,"offset":956},"end":{"line":21,"column":49,"offset":1004}},"text":"text","content":["This technique is best explained in these links:"]},{"type":"para","id":"DaEhgKWHih8-Wkp_Iysyn","margin":"","location":{"start":{"line":23,"column":1,"offset":1006},"end":{"line":23,"column":48,"offset":1053}},"text":"text","content":[{"meta":"http://en.wikipedia.org/wiki/Consistent_hashing","type":"fcode","name":"L","content":["http://en.wikipedia.org/wiki/Consistent_hashing"]}]},{"type":"para","id":"RMqZUowPvAr_8DufxaEwx","margin":"","location":{"start":{"line":25,"column":1,"offset":1055},"end":{"line":25,"column":87,"offset":1141}},"text":"text","content":[{"meta":"http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/","type":"fcode","name":"L","content":["http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/"]}]},{"type":"block","id":"gYDOvGJODgyzEvdvL1BND","margin":"","level":2,"name":"head","location":{"start":{"line":27,"column":1,"offset":1143},"end":{"line":27,"column":12,"offset":1154}},"content":["SYNOPSIS"]},{"type":"block","id":"vEy9H2mXvgGpCjHbzsyUn","margin":"","name":"code","config":[],"location":{"start":{"line":29,"column":1,"offset":1156},"end":{"line":52,"column":69,"offset":2056}},"content":[{"type":"verbatim","value":"use v6;\nuse Hash::Consistent;\nuse String::CRC32;\nuse Test;\n\nmy $ch = Hash::Consistent.new(mult=>2);\n$ch.insert('example.org');\n$ch.insert('example.com');\nis $ch.sum_list.elems(), 4, 'correct hash cardinality';\n# > $ch.print();\n# 0: 2725249910 [crc32 of example.org.0 derived from example.org]\n# 1: 3210990709 [crc32 of example.com.1 derived from example.com]\n# 2: 3362055395 [crc32 of example.com.0 derived from example.com]\n# 3: 3581359072 [crc32 of example.org.1 derived from example.org]\n\n# > String::CRC32::crc32('blah');\n# 3458818396\n# (should find next at 3581359072 -> example.org)\nis $ch.find('blah'), 'example.org', 'found blah -> example.org';\n\n# > String::CRC32::crc32('whee');\n# 3023755156\n# (should find next at 3210990709 -> example.com)\nis $ch.find('whee'), 'example.com', 'found whee -> example.com';"}]},{"type":"block","id":"doRyFXf54aZWC53rGLDLr","margin":"","level":2,"name":"head","location":{"start":{"line":54,"column":1,"offset":2058},"end":{"line":54,"column":10,"offset":2067}},"content":["AUTHOR"]},{"type":"para","id":"oNmmE4exbY4MhZ71jpy0f","margin":"","location":{"start":{"line":56,"column":1,"offset":2069},"end":{"line":56,"column":53,"offset":2121}},"text":"text","content":["Brad Clawsie (zef:bradclawsie, email:",{"meta":"mailto:brad@b7j0c.org","type":"fcode","name":"L","content":["brad@b7j0c.org"]},")"]},{"type":"block","id":"HM5vQw-Qxq3_HnaMe2xDf","margin":"","level":2,"name":"head","location":{"start":{"line":58,"column":1,"offset":2123},"end":{"line":58,"column":10,"offset":2132}},"content":["Notice"]},{"type":"para","id":"801xLNJB9xkMhseelRLH9","margin":"","location":{"start":{"line":60,"column":1,"offset":2134},"end":{"line":62,"column":33,"offset":2307}},"text":"text","content":["This repository was uploaded via ",{"type":"fcode","name":"C","content":["fez"]}," under the username ",{"type":"fcode","name":"C","content":["b7j0c"]},",\nand later ",{"type":"fcode","name":"C","content":["bradclawsie"]},". This change was made so the username would match\nGithub. Sorry for any confusion."]},{"type":"block","id":"tffIwFvRCCwqnr7PglCT6","margin":"","level":2,"name":"head","location":{"start":{"line":64,"column":1,"offset":2309},"end":{"line":64,"column":16,"offset":2324}},"content":["Installation"]},{"type":"block","id":"eAmjnHENOG0YRY9C3ZIHj","margin":"","name":"code","config":[],"location":{"start":{"line":66,"column":1,"offset":2326},"end":{"line":68,"column":4,"offset":2362}},"content":[{"type":"verbatim","value":"zef install Hash::Consistent"}]}]},"publishUrl":"/mods/zef/Hash::Consistent/dist/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:bradclawsie","author":"Brad Clawsie","depends":["String::CRC32","Subsets::Common"],"description":"Basic Consistent Hash implementation.","dist":"Hash::Consistent:ver<0.0.4>:auth<zef:bradclawsie>","name":"Hash::Consistent","path":"H/AS/HASH_CONSISTENT/02ca6d9a3574055533aff503a55e947d5e71ae5f.tar.gz","perl":"6.*","provides":{"Hash::Consistent":"lib/Hash/Consistent.rakumod"},"source-url":"https://github.com/bradclawsie/Hash-Consistent.git","version":"0.0.4"},"files":[{"file":"work_mods/zef/Hash::Consistent/dist/README.md","publishUrl":"/mods/zef/Hash::Consistent/dist/README.md"},{"file":"work_mods/zef/Hash::Consistent/dist/lib/Hash/Consistent.rakumod","publishUrl":"/mods/zef/Hash::Consistent/dist/lib/Hash/Consistent.rakumod"}],"src":"zef","url":"/mods/zef/Hash::Consistent"}}}
=end data


    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/Hash::Consistent/dist/README.md","sources":[],"node":{"type":"block","id":"xOFrB5pegA3amVePBoT6w","margin":"","name":"root","content":[{"type":"para","id":"wnGIeKAyG0AzJF4gB540u","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":2,"column":137,"offset":252}},"text":"text","content":[{"meta":"https://opensource.org/licenses/BSD-2-Clause","type":"fcode","name":"L","content":[{"type":"block","id":"k9qNu_sDCq9ATfdpgdhcA","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":69,"offset":68}},"content":[{"type":"image","src":"https://img.shields.io/badge/License-BSD-yellow.svg","alt":"License:BSD"}]}]},"\n",{"meta":"https://github.com/bradclawsie/Hash-Consistent/actions","type":"fcode","name":"L","content":[{"type":"block","id":"nAbRV4lAz2Kwsn6oHpvFW","margin":"","name":"Image","config":[],"location":{"start":{"line":2,"column":2,"offset":117},"end":{"line":2,"column":80,"offset":195}},"content":[{"type":"image","src":"https://github.com/bradclawsie/Hash-Consistent/workflows/test/badge.svg","alt":"ci"}]}]}]},{"type":"block","id":"BC4oHxXdEgSeLlGJvAKkH","margin":"","level":1,"name":"head","location":{"start":{"line":4,"column":1,"offset":254},"end":{"line":4,"column":19,"offset":272}},"content":["Hash::Consistent"]},{"type":"para","id":"tlKaNzRdoQPm0kP7IiQJb","margin":"","location":{"start":{"line":6,"column":1,"offset":274},"end":{"line":6,"column":44,"offset":317}},"text":"text","content":["A Raku implementation of a Consistent Hash."]},{"type":"block","id":"gAxPXe-0AKm-nha8ZJI_D","margin":"","level":2,"name":"head","location":{"start":{"line":8,"column":1,"offset":319},"end":{"line":8,"column":15,"offset":333}},"content":["DESCRIPTION"]},{"type":"para","id":"_HEKaJZsGXKuyh8wTHPb5","margin":"","location":{"start":{"line":10,"column":1,"offset":335},"end":{"line":13,"column":21,"offset":610}},"text":"text","content":["A \"consistent\" hash allows the user to create a data structure in which a set of string\nflags are entered in the hash at intervals specified by the CRC32 hash of the flag.\nOptionally, each flag can have suffixes appended to it in order to create multiple\nentries in the hash."]},{"type":"para","id":"EqGFIg3FUwmpC8juA19q_","margin":"","location":{"start":{"line":15,"column":1,"offset":612},"end":{"line":19,"column":18,"offset":954}},"text":"text","content":["Once flags are entered into the hash, we can find which flag would be associated with\na candidate string of our choice. A typical use-case for this is to enter host\nnames into the hash the represent destination hosts where values are stored\nfor particular keys, as determined by the result of searching for the corresponding\nflag in the hash."]},{"type":"para","id":"h47HAGG4wBChVXg3LIvji","margin":"","location":{"start":{"line":21,"column":1,"offset":956},"end":{"line":21,"column":49,"offset":1004}},"text":"text","content":["This technique is best explained in these links:"]},{"type":"para","id":"DaEhgKWHih8-Wkp_Iysyn","margin":"","location":{"start":{"line":23,"column":1,"offset":1006},"end":{"line":23,"column":48,"offset":1053}},"text":"text","content":[{"meta":"http://en.wikipedia.org/wiki/Consistent_hashing","type":"fcode","name":"L","content":["http://en.wikipedia.org/wiki/Consistent_hashing"]}]},{"type":"para","id":"RMqZUowPvAr_8DufxaEwx","margin":"","location":{"start":{"line":25,"column":1,"offset":1055},"end":{"line":25,"column":87,"offset":1141}},"text":"text","content":[{"meta":"http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/","type":"fcode","name":"L","content":["http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/"]}]},{"type":"block","id":"gYDOvGJODgyzEvdvL1BND","margin":"","level":2,"name":"head","location":{"start":{"line":27,"column":1,"offset":1143},"end":{"line":27,"column":12,"offset":1154}},"content":["SYNOPSIS"]},{"type":"block","id":"vEy9H2mXvgGpCjHbzsyUn","margin":"","name":"code","config":[],"location":{"start":{"line":29,"column":1,"offset":1156},"end":{"line":52,"column":69,"offset":2056}},"content":[{"type":"verbatim","value":"use v6;\nuse Hash::Consistent;\nuse String::CRC32;\nuse Test;\n\nmy $ch = Hash::Consistent.new(mult=>2);\n$ch.insert('example.org');\n$ch.insert('example.com');\nis $ch.sum_list.elems(), 4, 'correct hash cardinality';\n# > $ch.print();\n# 0: 2725249910 [crc32 of example.org.0 derived from example.org]\n# 1: 3210990709 [crc32 of example.com.1 derived from example.com]\n# 2: 3362055395 [crc32 of example.com.0 derived from example.com]\n# 3: 3581359072 [crc32 of example.org.1 derived from example.org]\n\n# > String::CRC32::crc32('blah');\n# 3458818396\n# (should find next at 3581359072 -> example.org)\nis $ch.find('blah'), 'example.org', 'found blah -> example.org';\n\n# > String::CRC32::crc32('whee');\n# 3023755156\n# (should find next at 3210990709 -> example.com)\nis $ch.find('whee'), 'example.com', 'found whee -> example.com';"}]},{"type":"block","id":"doRyFXf54aZWC53rGLDLr","margin":"","level":2,"name":"head","location":{"start":{"line":54,"column":1,"offset":2058},"end":{"line":54,"column":10,"offset":2067}},"content":["AUTHOR"]},{"type":"para","id":"oNmmE4exbY4MhZ71jpy0f","margin":"","location":{"start":{"line":56,"column":1,"offset":2069},"end":{"line":56,"column":53,"offset":2121}},"text":"text","content":["Brad Clawsie (zef:bradclawsie, email:",{"meta":"mailto:brad@b7j0c.org","type":"fcode","name":"L","content":["brad@b7j0c.org"]},")"]},{"type":"block","id":"HM5vQw-Qxq3_HnaMe2xDf","margin":"","level":2,"name":"head","location":{"start":{"line":58,"column":1,"offset":2123},"end":{"line":58,"column":10,"offset":2132}},"content":["Notice"]},{"type":"para","id":"801xLNJB9xkMhseelRLH9","margin":"","location":{"start":{"line":60,"column":1,"offset":2134},"end":{"line":62,"column":33,"offset":2307}},"text":"text","content":["This repository was uploaded via ",{"type":"fcode","name":"C","content":["fez"]}," under the username ",{"type":"fcode","name":"C","content":["b7j0c"]},",\nand later ",{"type":"fcode","name":"C","content":["bradclawsie"]},". This change was made so the username would match\nGithub. Sorry for any confusion."]},{"type":"block","id":"tffIwFvRCCwqnr7PglCT6","margin":"","level":2,"name":"head","location":{"start":{"line":64,"column":1,"offset":2309},"end":{"line":64,"column":16,"offset":2324}},"content":["Installation"]},{"type":"block","id":"eAmjnHENOG0YRY9C3ZIHj","margin":"","name":"code","config":[],"location":{"start":{"line":66,"column":1,"offset":2326},"end":{"line":68,"column":4,"offset":2362}},"content":[{"type":"verbatim","value":"zef install Hash::Consistent"}]}]},"publishUrl":"/mods/zef/Hash::Consistent/dist/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:bradclawsie","author":"Brad Clawsie","depends":["String::CRC32","Subsets::Common"],"description":"Basic Consistent Hash implementation.","dist":"Hash::Consistent:ver<0.0.4>:auth<zef:bradclawsie>","name":"Hash::Consistent","path":"H/AS/HASH_CONSISTENT/02ca6d9a3574055533aff503a55e947d5e71ae5f.tar.gz","perl":"6.*","provides":{"Hash::Consistent":"lib/Hash/Consistent.rakumod"},"source-url":"https://github.com/bradclawsie/Hash-Consistent.git","version":"0.0.4"},"files":[{"file":"work_mods/zef/Hash::Consistent/dist/README.md","publishUrl":"/mods/zef/Hash::Consistent/dist/README.md"},{"file":"work_mods/zef/Hash::Consistent/dist/lib/Hash/Consistent.rakumod","publishUrl":"/mods/zef/Hash::Consistent/dist/lib/Hash/Consistent.rakumod"}],"src":"zef","url":"/mods/zef/Hash::Consistent"}}}
    =end data
    =end React


Basic Consistent Hash implementation.


Hash::Consistent


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::int

NAME

SYNOPSIS

DESCRIPTION

AUTHOR

COPYRIGHT AND LICENSE

Hash::int v0.0.3

Authors

License

Dependencies

Test Dependencies

Provides

Documentation