TITLE

Provide functionality similar to Haskell's span


SUBTITLE

data

=begin data
{"type":"page","file":"work_mods/zef/snip/snip-0.0.1/README.md","sources":[],"node":{"type":"block","id":"-PUBTBNAh_qIOcNa8jmBl","margin":"","name":"root","content":[{"type":"para","id":"T_KsMcepKiMfwvRkM-RoR","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":129,"offset":128}},"text":"text","content":[{"meta":"https://github.com/lizmat/spin/actions","type":"fcode","name":"L","content":[{"type":"block","id":"RsReTyZDoRp8KNf7SAdrf","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":88,"offset":87}},"content":[{"type":"image","src":"https://github.com/lizmat/spin/actions/workflows/test.yml/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"iRM3hC6EP8EsmZ6BET73p","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":130},"end":{"line":4,"column":5,"offset":139}},"content":["NAME"]},{"type":"para","id":"TbA3uoaiyl8i5N9MkB1LP","margin":"","location":{"start":{"line":6,"column":1,"offset":141},"end":{"line":6,"column":55,"offset":195}},"text":"text","content":["snip - Provide functionality similar to Haskell's span"]},{"type":"block","id":"toy2JSzhcdjpizkg1Vp51","margin":"","level":1,"name":"head","location":{"start":{"line":8,"column":1,"offset":197},"end":{"line":9,"column":9,"offset":214}},"content":["SYNOPSIS"]},{"type":"block","id":"LRv_Hlt1OeSbRZ_5rcEEt","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":11,"column":1,"offset":216},"end":{"line":26,"column":4,"offset":515}},"content":[{"type":"verbatim","value":"use snip;\n\n.say for snip * < 10, 2, 2, 2, 5, 5, 7, 13, 9, 6, 2, 20, 4;\n# (2 2 2 5 5 7)\n# (13 9 6 2 20 4)\n\n.say for snip (* < 10, * < 20), 2, 2, 2, 5, 5, 7, 13, 9, 6, 2, 20, 4;\n# (2 2 2 5 5 7)\n# (13 9 6 2)\n# (20 4)\n\n.say for snip Int, 2, 2, 2, 5, 5, \"a\", \"b\", \"c\";\n# (2 2 2 5 5)\n# (a b c)"}]},{"type":"block","id":"43mJAlcLh7xk29H3El74D","margin":"","level":1,"name":"head","location":{"start":{"line":28,"column":1,"offset":517},"end":{"line":29,"column":12,"offset":540}},"content":["DESCRIPTION"]},{"type":"para","id":"QPPBZEFiNRla3Oj5ijII6","margin":"","location":{"start":{"line":31,"column":1,"offset":542},"end":{"line":31,"column":318,"offset":859}},"text":"text","content":["The ",{"type":"fcode","name":"C","content":["snip"]}," distribution exports a single subroutine ",{"type":"fcode","name":"C","content":["snip"]}," that mimics the functionality provided by ",{"meta":"https://hackage.haskell.org/package/base-4.16.1.0/docs/Prelude.html#v:snip","type":"fcode","name":"L","content":["Haskell's span functionality"]},". But only if the core does not supply a ",{"type":"fcode","name":"C","content":["snip"]}," subroutine already (which it may at some point in the future)."]},{"type":"para","id":"Rymkd5QediEN5AQ8fU-Hp","margin":"","location":{"start":{"line":33,"column":1,"offset":861},"end":{"line":33,"column":288,"offset":1148}},"text":"text","content":["The ",{"type":"fcode","name":"C","content":["snip"]}," subroutine takes a matcher much like ",{"type":"fcode","name":"C","content":["grep"]}," does, which can be a ",{"type":"fcode","name":"C","content":["Callable"]}," or any other object that can have the ",{"type":"fcode","name":"C","content":["ACCEPTS"]}," method called on it. Different from the Haskell's ",{"type":"fcode","name":"C","content":["span"]}," implementation, ",{"type":"fcode","name":"C","content":["snip"]}," can take multiple matchers to snip the origin list in more than 2 parts."]},{"type":"block","id":"9I3tu-NpwSsDbNe5rjRLN","margin":"","level":1,"name":"head","location":{"start":{"line":35,"column":1,"offset":1150},"end":{"line":36,"column":7,"offset":1163}},"content":["AUTHOR"]},{"type":"para","id":"XVgWA-bWOAcPrPRQPb6qY","margin":"","location":{"start":{"line":38,"column":1,"offset":1165},"end":{"line":38,"column":37,"offset":1201}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"X1jmG7bvDc7e6Fn23LAt7","margin":"","location":{"start":{"line":40,"column":1,"offset":1203},"end":{"line":40,"column":99,"offset":1301}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/snip","type":"fcode","name":"L","content":["https://github.com/lizmat/snip"]}," . Comments and Pull Requests are welcome."]},{"type":"para","id":"keuy-eabuHzIqKOAbeNGr","margin":"","location":{"start":{"line":42,"column":1,"offset":1303},"end":{"line":42,"column":163,"offset":1465}},"text":"text","content":["If you like this module, or what I’m doing more generally, committing to a ",{"meta":"https://github.com/sponsors/lizmat/","type":"fcode","name":"L","content":["small sponsorship"]}," would mean a great deal to me!"]},{"type":"block","id":"SUakaeuyCEXe2gCArZ9P6","margin":"","level":1,"name":"head","location":{"start":{"line":44,"column":1,"offset":1467},"end":{"line":45,"column":22,"offset":1510}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"Oi6DhX08EViUrAZa_nbic","margin":"","location":{"start":{"line":47,"column":1,"offset":1512},"end":{"line":47,"column":35,"offset":1546}},"text":"text","content":["Copyright 2022 Elizabeth Mattijsen"]},{"type":"para","id":"HF13ATICiQF0Te3ZyZ7xl","margin":"","location":{"start":{"line":49,"column":1,"offset":1548},"end":{"line":49,"column":104,"offset":1651}},"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/snip/snip-0.0.1/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"Provide functionality similar to Haskell's span","dist":"snip:ver<0.0.1>:auth<zef:lizmat>","license":"Artistic-2.0","name":"snip","path":"S/NI/SNIP/1c8b0681577db1fd8c37bd6017ca64422976fc5d.tar.gz","perl":"6.d","provides":{"snip":"lib/snip.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/spin.git","tags":["SPAN","SNIP"],"test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/snip/snip-0.0.1/README.md","publishUrl":"/mods/zef/snip/snip-0.0.1/README.md"},{"file":"work_mods/zef/snip/snip-0.0.1/lib/snip.rakumod","publishUrl":"/mods/zef/snip/snip-0.0.1/lib/snip.rakumod"}],"src":"zef","url":"/mods/zef/snip"}}}
=end data


React

    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/snip/snip-0.0.1/README.md","sources":[],"node":{"type":"block","id":"-PUBTBNAh_qIOcNa8jmBl","margin":"","name":"root","content":[{"type":"para","id":"T_KsMcepKiMfwvRkM-RoR","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":129,"offset":128}},"text":"text","content":[{"meta":"https://github.com/lizmat/spin/actions","type":"fcode","name":"L","content":[{"type":"block","id":"RsReTyZDoRp8KNf7SAdrf","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":88,"offset":87}},"content":[{"type":"image","src":"https://github.com/lizmat/spin/actions/workflows/test.yml/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"iRM3hC6EP8EsmZ6BET73p","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":130},"end":{"line":4,"column":5,"offset":139}},"content":["NAME"]},{"type":"para","id":"TbA3uoaiyl8i5N9MkB1LP","margin":"","location":{"start":{"line":6,"column":1,"offset":141},"end":{"line":6,"column":55,"offset":195}},"text":"text","content":["snip - Provide functionality similar to Haskell's span"]},{"type":"block","id":"toy2JSzhcdjpizkg1Vp51","margin":"","level":1,"name":"head","location":{"start":{"line":8,"column":1,"offset":197},"end":{"line":9,"column":9,"offset":214}},"content":["SYNOPSIS"]},{"type":"block","id":"LRv_Hlt1OeSbRZ_5rcEEt","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":11,"column":1,"offset":216},"end":{"line":26,"column":4,"offset":515}},"content":[{"type":"verbatim","value":"use snip;\n\n.say for snip * < 10, 2, 2, 2, 5, 5, 7, 13, 9, 6, 2, 20, 4;\n# (2 2 2 5 5 7)\n# (13 9 6 2 20 4)\n\n.say for snip (* < 10, * < 20), 2, 2, 2, 5, 5, 7, 13, 9, 6, 2, 20, 4;\n# (2 2 2 5 5 7)\n# (13 9 6 2)\n# (20 4)\n\n.say for snip Int, 2, 2, 2, 5, 5, \"a\", \"b\", \"c\";\n# (2 2 2 5 5)\n# (a b c)"}]},{"type":"block","id":"43mJAlcLh7xk29H3El74D","margin":"","level":1,"name":"head","location":{"start":{"line":28,"column":1,"offset":517},"end":{"line":29,"column":12,"offset":540}},"content":["DESCRIPTION"]},{"type":"para","id":"QPPBZEFiNRla3Oj5ijII6","margin":"","location":{"start":{"line":31,"column":1,"offset":542},"end":{"line":31,"column":318,"offset":859}},"text":"text","content":["The ",{"type":"fcode","name":"C","content":["snip"]}," distribution exports a single subroutine ",{"type":"fcode","name":"C","content":["snip"]}," that mimics the functionality provided by ",{"meta":"https://hackage.haskell.org/package/base-4.16.1.0/docs/Prelude.html#v:snip","type":"fcode","name":"L","content":["Haskell's span functionality"]},". But only if the core does not supply a ",{"type":"fcode","name":"C","content":["snip"]}," subroutine already (which it may at some point in the future)."]},{"type":"para","id":"Rymkd5QediEN5AQ8fU-Hp","margin":"","location":{"start":{"line":33,"column":1,"offset":861},"end":{"line":33,"column":288,"offset":1148}},"text":"text","content":["The ",{"type":"fcode","name":"C","content":["snip"]}," subroutine takes a matcher much like ",{"type":"fcode","name":"C","content":["grep"]}," does, which can be a ",{"type":"fcode","name":"C","content":["Callable"]}," or any other object that can have the ",{"type":"fcode","name":"C","content":["ACCEPTS"]}," method called on it. Different from the Haskell's ",{"type":"fcode","name":"C","content":["span"]}," implementation, ",{"type":"fcode","name":"C","content":["snip"]}," can take multiple matchers to snip the origin list in more than 2 parts."]},{"type":"block","id":"9I3tu-NpwSsDbNe5rjRLN","margin":"","level":1,"name":"head","location":{"start":{"line":35,"column":1,"offset":1150},"end":{"line":36,"column":7,"offset":1163}},"content":["AUTHOR"]},{"type":"para","id":"XVgWA-bWOAcPrPRQPb6qY","margin":"","location":{"start":{"line":38,"column":1,"offset":1165},"end":{"line":38,"column":37,"offset":1201}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"X1jmG7bvDc7e6Fn23LAt7","margin":"","location":{"start":{"line":40,"column":1,"offset":1203},"end":{"line":40,"column":99,"offset":1301}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/snip","type":"fcode","name":"L","content":["https://github.com/lizmat/snip"]}," . Comments and Pull Requests are welcome."]},{"type":"para","id":"keuy-eabuHzIqKOAbeNGr","margin":"","location":{"start":{"line":42,"column":1,"offset":1303},"end":{"line":42,"column":163,"offset":1465}},"text":"text","content":["If you like this module, or what I’m doing more generally, committing to a ",{"meta":"https://github.com/sponsors/lizmat/","type":"fcode","name":"L","content":["small sponsorship"]}," would mean a great deal to me!"]},{"type":"block","id":"SUakaeuyCEXe2gCArZ9P6","margin":"","level":1,"name":"head","location":{"start":{"line":44,"column":1,"offset":1467},"end":{"line":45,"column":22,"offset":1510}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"Oi6DhX08EViUrAZa_nbic","margin":"","location":{"start":{"line":47,"column":1,"offset":1512},"end":{"line":47,"column":35,"offset":1546}},"text":"text","content":["Copyright 2022 Elizabeth Mattijsen"]},{"type":"para","id":"HF13ATICiQF0Te3ZyZ7xl","margin":"","location":{"start":{"line":49,"column":1,"offset":1548},"end":{"line":49,"column":104,"offset":1651}},"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/snip/snip-0.0.1/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"Provide functionality similar to Haskell's span","dist":"snip:ver<0.0.1>:auth<zef:lizmat>","license":"Artistic-2.0","name":"snip","path":"S/NI/SNIP/1c8b0681577db1fd8c37bd6017ca64422976fc5d.tar.gz","perl":"6.d","provides":{"snip":"lib/snip.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/spin.git","tags":["SPAN","SNIP"],"test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/snip/snip-0.0.1/README.md","publishUrl":"/mods/zef/snip/snip-0.0.1/README.md"},{"file":"work_mods/zef/snip/snip-0.0.1/lib/snip.rakumod","publishUrl":"/mods/zef/snip/snip-0.0.1/lib/snip.rakumod"}],"src":"zef","url":"/mods/zef/snip"}}}
    =end data
    =end React


root

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

snip


A tool for generating unique ID numbers.


=begin data
{"type":"page","file":"work_mods/zef/SnowFlake/dist/README.md","sources":[],"node":{"type":"block","id":"ZzSGg-d-wXsVJHEez6LFi","margin":"","name":"root","content":[{"type":"block","id":"tcRFkdcYRjKNZA8Qwf6fj","margin":"","level":2,"name":"head","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":8,"offset":7}},"content":["NAME"]},{"type":"para","id":"YVnvDsDdTmH5-XQAc-ioD","margin":"","location":{"start":{"line":3,"column":1,"offset":9},"end":{"line":3,"column":53,"offset":61}},"text":"text","content":["SnowFlake - A tool for generating unique ID numbers."]},{"type":"block","id":"WGhmsHIuc0Lrqn5jBRJ-b","margin":"","level":2,"name":"head","location":{"start":{"line":5,"column":1,"offset":63},"end":{"line":5,"column":12,"offset":74}},"content":["SYNOPSIS"]},{"type":"block","id":"J_76-VgCA4reyG6Jdei4R","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":7,"column":1,"offset":76},"end":{"line":12,"column":4,"offset":184}},"content":[{"type":"verbatim","value":"use SnowFlake;\n\nmy $worker = SnowFlake.new(worker_id => 1, sequence => 2);\nsay $worker.get_id();"}]},{"type":"block","id":"1pwRClCt7-BwEy-TFgv7c","margin":"","level":2,"name":"head","location":{"start":{"line":14,"column":1,"offset":186},"end":{"line":14,"column":15,"offset":200}},"content":["DESCRIPTION"]},{"type":"para","id":"xrPUDjNvEnTcT0wkTJLsV","margin":"","location":{"start":{"line":16,"column":1,"offset":202},"end":{"line":16,"column":54,"offset":255}},"text":"text","content":["SnowFlake is a tool for generating unique ID numbers."]},{"type":"block","id":"AtF783v98KABHRDuCNShe","margin":"","level":2,"name":"head","location":{"start":{"line":18,"column":1,"offset":257},"end":{"line":18,"column":11,"offset":267}},"content":["LICENSE"]},{"type":"para","id":"qwAJzBvuQD5uos9UgzeNK","margin":"","location":{"start":{"line":20,"column":1,"offset":269},"end":{"line":20,"column":137,"offset":405}},"text":"text","content":[{"meta":"https://opensource.org/licenses/Artistic-2.0","type":"fcode","name":"L","content":[{"type":"block","id":"XBcX-enFFrZJ7QEQ4RhkK","margin":"","name":"Image","config":[],"location":{"start":{"line":20,"column":2,"offset":270},"end":{"line":20,"column":90,"offset":358}},"content":[{"type":"image","src":"https://img.shields.io/badge/License-Artistic%202.0-0298c3.svg","alt":"License: Artistic-2.0"}]}]}]},{"type":"block","id":"dLvrwemJH78YwktLEBAUT","margin":"","level":2,"name":"head","location":{"start":{"line":22,"column":1,"offset":407},"end":{"line":22,"column":11,"offset":417}},"content":["AUTHORS"]},{"type":"list","id":"GJ328UWelKtgd90lflTjM","margin":"","level":1,"list":"itemized","content":[{"type":"block","id":"ltijefH8fvlAHyBgS2pa9","margin":"","name":"item","level":1,"location":{"start":{"line":24,"column":1,"offset":419},"end":{"line":24,"column":25,"offset":443}},"content":[{"type":"para","id":"KIgZQLBsb_9M8vDGK4wRh","margin":"","location":{"start":{"line":24,"column":3,"offset":421},"end":{"line":24,"column":25,"offset":443}},"text":"text","content":[{"meta":"mailto:ohmycloudy@gmail.com","type":"fcode","name":"L","content":["ohmycloudy@gmail.com"]}]}]}]}]},"publishUrl":"/mods/zef/SnowFlake/dist/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:ohmycloudy","authors":["ohmycloud <ohmycloudy@gmail.com>"],"build-depends":[],"depends":[],"description":"A tool for generating unique ID numbers.","dist":"SnowFlake:ver<0.0.1>:auth<zef:ohmycloudy>","license":"Artistic-2.0","name":"SnowFlake","path":"S/NO/SNOWFLAKE/a2bf70722f40115133e41a643df854bc01c5d290.tar.gz","perl":"6.d","provides":{"SnowFlake":"lib/SnowFlake.rakumod"},"resources":[],"source-url":"https://github.com/ohmycloud/SnowFlake.git","tags":[],"test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/SnowFlake/dist/README.md","publishUrl":"/mods/zef/SnowFlake/dist/README.md"}],"src":"zef","url":"/mods/zef/SnowFlake"}}}
=end data


    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/SnowFlake/dist/README.md","sources":[],"node":{"type":"block","id":"ZzSGg-d-wXsVJHEez6LFi","margin":"","name":"root","content":[{"type":"block","id":"tcRFkdcYRjKNZA8Qwf6fj","margin":"","level":2,"name":"head","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":8,"offset":7}},"content":["NAME"]},{"type":"para","id":"YVnvDsDdTmH5-XQAc-ioD","margin":"","location":{"start":{"line":3,"column":1,"offset":9},"end":{"line":3,"column":53,"offset":61}},"text":"text","content":["SnowFlake - A tool for generating unique ID numbers."]},{"type":"block","id":"WGhmsHIuc0Lrqn5jBRJ-b","margin":"","level":2,"name":"head","location":{"start":{"line":5,"column":1,"offset":63},"end":{"line":5,"column":12,"offset":74}},"content":["SYNOPSIS"]},{"type":"block","id":"J_76-VgCA4reyG6Jdei4R","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":7,"column":1,"offset":76},"end":{"line":12,"column":4,"offset":184}},"content":[{"type":"verbatim","value":"use SnowFlake;\n\nmy $worker = SnowFlake.new(worker_id => 1, sequence => 2);\nsay $worker.get_id();"}]},{"type":"block","id":"1pwRClCt7-BwEy-TFgv7c","margin":"","level":2,"name":"head","location":{"start":{"line":14,"column":1,"offset":186},"end":{"line":14,"column":15,"offset":200}},"content":["DESCRIPTION"]},{"type":"para","id":"xrPUDjNvEnTcT0wkTJLsV","margin":"","location":{"start":{"line":16,"column":1,"offset":202},"end":{"line":16,"column":54,"offset":255}},"text":"text","content":["SnowFlake is a tool for generating unique ID numbers."]},{"type":"block","id":"AtF783v98KABHRDuCNShe","margin":"","level":2,"name":"head","location":{"start":{"line":18,"column":1,"offset":257},"end":{"line":18,"column":11,"offset":267}},"content":["LICENSE"]},{"type":"para","id":"qwAJzBvuQD5uos9UgzeNK","margin":"","location":{"start":{"line":20,"column":1,"offset":269},"end":{"line":20,"column":137,"offset":405}},"text":"text","content":[{"meta":"https://opensource.org/licenses/Artistic-2.0","type":"fcode","name":"L","content":[{"type":"block","id":"XBcX-enFFrZJ7QEQ4RhkK","margin":"","name":"Image","config":[],"location":{"start":{"line":20,"column":2,"offset":270},"end":{"line":20,"column":90,"offset":358}},"content":[{"type":"image","src":"https://img.shields.io/badge/License-Artistic%202.0-0298c3.svg","alt":"License: Artistic-2.0"}]}]}]},{"type":"block","id":"dLvrwemJH78YwktLEBAUT","margin":"","level":2,"name":"head","location":{"start":{"line":22,"column":1,"offset":407},"end":{"line":22,"column":11,"offset":417}},"content":["AUTHORS"]},{"type":"list","id":"GJ328UWelKtgd90lflTjM","margin":"","level":1,"list":"itemized","content":[{"type":"block","id":"ltijefH8fvlAHyBgS2pa9","margin":"","name":"item","level":1,"location":{"start":{"line":24,"column":1,"offset":419},"end":{"line":24,"column":25,"offset":443}},"content":[{"type":"para","id":"KIgZQLBsb_9M8vDGK4wRh","margin":"","location":{"start":{"line":24,"column":3,"offset":421},"end":{"line":24,"column":25,"offset":443}},"text":"text","content":[{"meta":"mailto:ohmycloudy@gmail.com","type":"fcode","name":"L","content":["ohmycloudy@gmail.com"]}]}]}]}]},"publishUrl":"/mods/zef/SnowFlake/dist/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:ohmycloudy","authors":["ohmycloud <ohmycloudy@gmail.com>"],"build-depends":[],"depends":[],"description":"A tool for generating unique ID numbers.","dist":"SnowFlake:ver<0.0.1>:auth<zef:ohmycloudy>","license":"Artistic-2.0","name":"SnowFlake","path":"S/NO/SNOWFLAKE/a2bf70722f40115133e41a643df854bc01c5d290.tar.gz","perl":"6.d","provides":{"SnowFlake":"lib/SnowFlake.rakumod"},"resources":[],"source-url":"https://github.com/ohmycloud/SnowFlake.git","tags":[],"test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/SnowFlake/dist/README.md","publishUrl":"/mods/zef/SnowFlake/dist/README.md"}],"src":"zef","url":"/mods/zef/SnowFlake"}}}
    =end data
    =end React


SnowFlake


Given a list of factors, return a smooth number iterator


=begin data
{"type":"page","file":"work_mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/README.md","sources":[],"node":{"type":"block","id":"-uRFw0rmzl5TJkswkxLPS","margin":"","name":"root","content":[{"type":"para","id":"OrhaNfH9oR-jAW1kmvmVO","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":159,"offset":158}},"text":"text","content":[{"meta":"https://github.com/thundergnat/smooth-numbers/actions","type":"fcode","name":"L","content":[{"type":"block","id":"twpXneJEWnz3ra95recc5","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":103,"offset":102}},"content":[{"type":"image","src":"https://github.com/thundergnat/smooth-numbers/actions/workflows/test.yml/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"OGIIdDi5jbDMZUY33PFln","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":160},"end":{"line":4,"column":21,"offset":201}},"content":["NAME Smooth::Numbers"]},{"type":"para","id":"yHiMP0ShCEUTw1d81VfmN","margin":"","location":{"start":{"line":6,"column":1,"offset":203},"end":{"line":6,"column":113,"offset":315}},"text":"text","content":["Given a list of prime factors, return an iterator which will produce numbers that are \"smooth\" to those factors."]},{"type":"block","id":"bLKUe2SBeAngAX25Or8xd","margin":"","level":1,"name":"head","location":{"start":{"line":8,"column":1,"offset":317},"end":{"line":9,"column":9,"offset":334}},"content":["SYNOPSIS"]},{"type":"block","id":"5PhMkccE497MoyN0gsBvn","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":11,"column":1,"offset":336},"end":{"line":17,"column":4,"offset":482}},"content":[{"type":"verbatim","value":"use Smooth::Numbers;\n\nmy $Hammings = smooth-numbers(2,3,5);\n\nput $Hammings[^20]; # 1 2 3 4 5 6 8 9 10 12 15 16 18 20 24 25 27 30 32 36"}]},{"type":"block","id":"wP4D0Idd4zI_RjoCZbfLo","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":484},"end":{"line":20,"column":12,"offset":507}},"content":["DESCRIPTION"]},{"type":"para","id":"QdG2G6rRKJ1HDFnjCYl9w","margin":"","location":{"start":{"line":22,"column":1,"offset":509},"end":{"line":22,"column":82,"offset":590}},"text":"text","content":["Smooth numbers are defined as \"numbers that are products of small prime factors.\""]},{"type":"para","id":"_o2wIP2RLI35V2dfnBwoR","margin":"","location":{"start":{"line":24,"column":1,"offset":592},"end":{"line":24,"column":93,"offset":684}},"text":"text","content":["Hamming numbers, which are the numbers that are products of 2, 3, 5, is the classic example."]},{"type":"para","id":"JaMP3y_XszUBSbkMJMNcm","margin":"","location":{"start":{"line":26,"column":1,"offset":686},"end":{"line":26,"column":60,"offset":745}},"text":"text","content":["The first ten Hamming numbers ( 2,3,5 smooth numbers ) are:"]},{"type":"block","id":"Pxy0UlKbMC-HBX2HcE7ra","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":28,"column":1,"offset":747},"end":{"line":39,"column":4,"offset":958}},"content":[{"type":"verbatim","value":"1  ( 2⁰ * 3⁰ * 5⁰ )\n2  ( 2¹ * 3⁰ * 5⁰ )\n3  ( 2⁰ * 3¹ * 5⁰ )\n4  ( 2² * 3⁰ * 5⁰ )\n5  ( 2⁰ * 3⁰ * 5¹ )\n6  ( 2¹ * 3¹ * 5⁰ )\n8  ( 2³ * 3⁰ * 5⁰ )\n9  ( 2⁰ * 3² * 5⁰ )\n10 ( 2¹ * 3⁰ * 5¹ )\n12 ( 2² * 3¹ * 5⁰ )"}]},{"type":"para","id":"QrtbEBLbX19SPHrxsHNBf","margin":"","location":{"start":{"line":41,"column":1,"offset":960},"end":{"line":41,"column":142,"offset":1101}},"text":"text","content":["Smooth numbers are easy to conceptualize but can be challenging to generate in order. This module provides a simple routine to overcome that."]},{"type":"para","id":"YFgjg_4z2LC9b3m2R8_vD","margin":"","location":{"start":{"line":43,"column":1,"offset":1103},"end":{"line":43,"column":29,"offset":1131}},"text":"text","content":["Exports a single subroutine:"]},{"type":"block","id":"TVenY-NTLQYxMKaqqedRg","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":45,"column":1,"offset":1133},"end":{"line":47,"column":4,"offset":1174}},"content":[{"type":"verbatim","value":"sub smooth-numbers(*@factors)"}]},{"type":"para","id":"0QjFVKaXHeoqMRom5aEr8","margin":"","location":{"start":{"line":49,"column":1,"offset":1176},"end":{"line":49,"column":137,"offset":1312}},"text":"text","content":["Takes a list or array of factors and returns an iterator that generates an ordered sequence of numbers that are smooth to those factors."]},{"type":"para","id":"sA9f8pjCHhFBHEZF9uhTt","margin":"","location":{"start":{"line":51,"column":1,"offset":1314},"end":{"line":51,"column":231,"offset":1544}},"text":"text","content":["The factors need not be in any order, and need not be prime. Smooth numbers traditionally are thought of as products of only prime factors, but if you want, for instance, the products of powers of 4 and 9, this module will oblige."]},{"type":"block","id":"lnU4a2SD6BlcYJS6tsTST","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":53,"column":1,"offset":1546},"end":{"line":57,"column":4,"offset":1643}},"content":[{"type":"verbatim","value":"put smooth-numbers(4,9)[^15];\n\n# 1 4 9 16 36 64 81 144 256 324 576 729 1024 1296 2304"}]},{"type":"para","id":"gIKZRXxC52uPqq15_d6dG","margin":"","location":{"start":{"line":59,"column":1,"offset":1645},"end":{"line":59,"column":82,"offset":1726}},"text":"text","content":["For that matter, there is no constraint that the \"factors\" need even be integers."]},{"type":"block","id":"3L-gqhULLEC9ikYbkD2LY","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":61,"column":1,"offset":1728},"end":{"line":65,"column":4,"offset":1828}},"content":[{"type":"verbatim","value":"put smooth-numbers(1.5,2.5)[^10];\n\n# 1 1.5 2.25 2.5 3.375 3.75 5.0625 5.625 6.25 7.59375"}]},{"type":"para","id":"tLlP0H-259WRXl5cxE5Jt","margin":"","location":{"start":{"line":67,"column":1,"offset":1830},"end":{"line":67,"column":31,"offset":1860}},"text":"text","content":["There ",{"type":"fcode","name":"I","content":["are"]}," a few constraints:"]},{"type":"list","id":"DvmIw0epSAKlF6YiUVKFn","margin":"","level":1,"list":"itemized","content":[{"type":"block","id":"n7beATa-o9Oml_jDEMQLA","margin":"","name":"item","level":1,"location":{"start":{"line":69,"column":3,"offset":1864},"end":{"line":69,"column":46,"offset":1907}},"content":[{"type":"para","id":"_kjtid2_HeaSFuWMpAjNL","margin":"","location":{"start":{"line":69,"column":5,"offset":1866},"end":{"line":69,"column":46,"offset":1907}},"text":"text","content":["there must be at least one passed factor."]}]},{"type":"block","id":"g0Xz3qEfIfHH3UvpZrgEj","margin":"","name":"item","level":1,"location":{"start":{"line":71,"column":3,"offset":1911},"end":{"line":71,"column":77,"offset":1985}},"content":[{"type":"para","id":"RNOZ7HJoH-TY4IG_IBxo7","margin":"","location":{"start":{"line":71,"column":5,"offset":1913},"end":{"line":71,"column":77,"offset":1985}},"text":"text","content":["the passed parameters must all be numeric. (Can't exponentiate strings)."]}]},{"type":"block","id":"Cy8kF-q9vCQWs90F3UqlU","margin":"","name":"item","level":1,"location":{"start":{"line":73,"column":3,"offset":1989},"end":{"line":73,"column":97,"offset":2083}},"content":[{"type":"para","id":"95wpUtLLvwoeRTdB2NVZ7","margin":"","location":{"start":{"line":73,"column":5,"offset":1991},"end":{"line":73,"column":97,"offset":2083}},"text":"text","content":["the factors must all be greater than or equal to 1 (or the sequence would be non-ascending)."]}]}]},{"type":"para","id":"xWKzJ_zRI_OvIXUwcIIk9","margin":"","location":{"start":{"line":75,"column":1,"offset":2085},"end":{"line":75,"column":145,"offset":2229}},"text":"text","content":["Note that if ",{"type":"fcode","name":"I","content":["any"]}," of the factors is equal to 1, the sequence will return an infinite series of 1s. Should be obvious why if you think about it."]},{"type":"block","id":"tG5ix8qrt6XwWci5uchXx","margin":"","level":1,"name":"head","location":{"start":{"line":77,"column":1,"offset":2231},"end":{"line":78,"column":7,"offset":2244}},"content":["AUTHOR"]},{"type":"para","id":"8J8QPhktgJMmsunGUXBqh","margin":"","location":{"start":{"line":80,"column":1,"offset":2246},"end":{"line":80,"column":35,"offset":2280}},"text":"text","content":["2019 Steve Schulze aka thundergnat"]},{"type":"para","id":"b0qOrpoRn1XyuvGZmG6fA","margin":"","location":{"start":{"line":82,"column":1,"offset":2282},"end":{"line":82,"column":169,"offset":2450}},"text":"text","content":["This package is free software and is provided \"as is\" without express or implied warranty. You can redistribute it and/or modify it under the same terms as Perl itself."]},{"type":"block","id":"UOq0LTDSfDw59qRQJ8x7w","margin":"","level":1,"name":"head","location":{"start":{"line":84,"column":1,"offset":2452},"end":{"line":85,"column":8,"offset":2467}},"content":["LICENSE"]},{"type":"para","id":"9FtZWP-AqWCg3SVyNEaJ4","margin":"","location":{"start":{"line":87,"column":1,"offset":2469},"end":{"line":87,"column":46,"offset":2514}},"text":"text","content":["Licensed under The Artistic 2.0; see LICENSE."]}]},"publishUrl":"/mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:thundergnat","authors":["Steve Schulze (thundergnat)"],"build-depends":[],"depends":[],"description":"Given a list of factors, return a smooth number iterator","dist":"Smooth::Numbers:ver<0.0.3>:auth<zef:thundergnat>","license":"Artistic-2.0","name":"Smooth::Numbers","path":"S/MO/SMOOTH_NUMBERS/be93ec4f37721dba216613878315bf4b5b290387.tar.gz","perl":"6.*","provides":{"Smooth::Numbers":"lib/Smooth/Numbers.pm6"},"resources":[],"source-url":"git://github.com/thundergnat/smooth-numbers.git","tags":["Smooth numbers","Pierpont numbers","Hamming numbers","Humble numbers"],"test-depends":[],"version":"0.0.3"},"files":[{"file":"work_mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/README.md","publishUrl":"/mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/README.md"},{"file":"work_mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/lib/Smooth/Numbers.pm6","publishUrl":"/mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/lib/Smooth/Numbers.pm6"}],"src":"zef","url":"/mods/zef/Smooth::Numbers"}}}
=end data


    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/README.md","sources":[],"node":{"type":"block","id":"-uRFw0rmzl5TJkswkxLPS","margin":"","name":"root","content":[{"type":"para","id":"OrhaNfH9oR-jAW1kmvmVO","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":159,"offset":158}},"text":"text","content":[{"meta":"https://github.com/thundergnat/smooth-numbers/actions","type":"fcode","name":"L","content":[{"type":"block","id":"twpXneJEWnz3ra95recc5","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":103,"offset":102}},"content":[{"type":"image","src":"https://github.com/thundergnat/smooth-numbers/actions/workflows/test.yml/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"OGIIdDi5jbDMZUY33PFln","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":160},"end":{"line":4,"column":21,"offset":201}},"content":["NAME Smooth::Numbers"]},{"type":"para","id":"yHiMP0ShCEUTw1d81VfmN","margin":"","location":{"start":{"line":6,"column":1,"offset":203},"end":{"line":6,"column":113,"offset":315}},"text":"text","content":["Given a list of prime factors, return an iterator which will produce numbers that are \"smooth\" to those factors."]},{"type":"block","id":"bLKUe2SBeAngAX25Or8xd","margin":"","level":1,"name":"head","location":{"start":{"line":8,"column":1,"offset":317},"end":{"line":9,"column":9,"offset":334}},"content":["SYNOPSIS"]},{"type":"block","id":"5PhMkccE497MoyN0gsBvn","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":11,"column":1,"offset":336},"end":{"line":17,"column":4,"offset":482}},"content":[{"type":"verbatim","value":"use Smooth::Numbers;\n\nmy $Hammings = smooth-numbers(2,3,5);\n\nput $Hammings[^20]; # 1 2 3 4 5 6 8 9 10 12 15 16 18 20 24 25 27 30 32 36"}]},{"type":"block","id":"wP4D0Idd4zI_RjoCZbfLo","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":484},"end":{"line":20,"column":12,"offset":507}},"content":["DESCRIPTION"]},{"type":"para","id":"QdG2G6rRKJ1HDFnjCYl9w","margin":"","location":{"start":{"line":22,"column":1,"offset":509},"end":{"line":22,"column":82,"offset":590}},"text":"text","content":["Smooth numbers are defined as \"numbers that are products of small prime factors.\""]},{"type":"para","id":"_o2wIP2RLI35V2dfnBwoR","margin":"","location":{"start":{"line":24,"column":1,"offset":592},"end":{"line":24,"column":93,"offset":684}},"text":"text","content":["Hamming numbers, which are the numbers that are products of 2, 3, 5, is the classic example."]},{"type":"para","id":"JaMP3y_XszUBSbkMJMNcm","margin":"","location":{"start":{"line":26,"column":1,"offset":686},"end":{"line":26,"column":60,"offset":745}},"text":"text","content":["The first ten Hamming numbers ( 2,3,5 smooth numbers ) are:"]},{"type":"block","id":"Pxy0UlKbMC-HBX2HcE7ra","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":28,"column":1,"offset":747},"end":{"line":39,"column":4,"offset":958}},"content":[{"type":"verbatim","value":"1  ( 2⁰ * 3⁰ * 5⁰ )\n2  ( 2¹ * 3⁰ * 5⁰ )\n3  ( 2⁰ * 3¹ * 5⁰ )\n4  ( 2² * 3⁰ * 5⁰ )\n5  ( 2⁰ * 3⁰ * 5¹ )\n6  ( 2¹ * 3¹ * 5⁰ )\n8  ( 2³ * 3⁰ * 5⁰ )\n9  ( 2⁰ * 3² * 5⁰ )\n10 ( 2¹ * 3⁰ * 5¹ )\n12 ( 2² * 3¹ * 5⁰ )"}]},{"type":"para","id":"QrtbEBLbX19SPHrxsHNBf","margin":"","location":{"start":{"line":41,"column":1,"offset":960},"end":{"line":41,"column":142,"offset":1101}},"text":"text","content":["Smooth numbers are easy to conceptualize but can be challenging to generate in order. This module provides a simple routine to overcome that."]},{"type":"para","id":"YFgjg_4z2LC9b3m2R8_vD","margin":"","location":{"start":{"line":43,"column":1,"offset":1103},"end":{"line":43,"column":29,"offset":1131}},"text":"text","content":["Exports a single subroutine:"]},{"type":"block","id":"TVenY-NTLQYxMKaqqedRg","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":45,"column":1,"offset":1133},"end":{"line":47,"column":4,"offset":1174}},"content":[{"type":"verbatim","value":"sub smooth-numbers(*@factors)"}]},{"type":"para","id":"0QjFVKaXHeoqMRom5aEr8","margin":"","location":{"start":{"line":49,"column":1,"offset":1176},"end":{"line":49,"column":137,"offset":1312}},"text":"text","content":["Takes a list or array of factors and returns an iterator that generates an ordered sequence of numbers that are smooth to those factors."]},{"type":"para","id":"sA9f8pjCHhFBHEZF9uhTt","margin":"","location":{"start":{"line":51,"column":1,"offset":1314},"end":{"line":51,"column":231,"offset":1544}},"text":"text","content":["The factors need not be in any order, and need not be prime. Smooth numbers traditionally are thought of as products of only prime factors, but if you want, for instance, the products of powers of 4 and 9, this module will oblige."]},{"type":"block","id":"lnU4a2SD6BlcYJS6tsTST","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":53,"column":1,"offset":1546},"end":{"line":57,"column":4,"offset":1643}},"content":[{"type":"verbatim","value":"put smooth-numbers(4,9)[^15];\n\n# 1 4 9 16 36 64 81 144 256 324 576 729 1024 1296 2304"}]},{"type":"para","id":"gIKZRXxC52uPqq15_d6dG","margin":"","location":{"start":{"line":59,"column":1,"offset":1645},"end":{"line":59,"column":82,"offset":1726}},"text":"text","content":["For that matter, there is no constraint that the \"factors\" need even be integers."]},{"type":"block","id":"3L-gqhULLEC9ikYbkD2LY","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":61,"column":1,"offset":1728},"end":{"line":65,"column":4,"offset":1828}},"content":[{"type":"verbatim","value":"put smooth-numbers(1.5,2.5)[^10];\n\n# 1 1.5 2.25 2.5 3.375 3.75 5.0625 5.625 6.25 7.59375"}]},{"type":"para","id":"tLlP0H-259WRXl5cxE5Jt","margin":"","location":{"start":{"line":67,"column":1,"offset":1830},"end":{"line":67,"column":31,"offset":1860}},"text":"text","content":["There ",{"type":"fcode","name":"I","content":["are"]}," a few constraints:"]},{"type":"list","id":"DvmIw0epSAKlF6YiUVKFn","margin":"","level":1,"list":"itemized","content":[{"type":"block","id":"n7beATa-o9Oml_jDEMQLA","margin":"","name":"item","level":1,"location":{"start":{"line":69,"column":3,"offset":1864},"end":{"line":69,"column":46,"offset":1907}},"content":[{"type":"para","id":"_kjtid2_HeaSFuWMpAjNL","margin":"","location":{"start":{"line":69,"column":5,"offset":1866},"end":{"line":69,"column":46,"offset":1907}},"text":"text","content":["there must be at least one passed factor."]}]},{"type":"block","id":"g0Xz3qEfIfHH3UvpZrgEj","margin":"","name":"item","level":1,"location":{"start":{"line":71,"column":3,"offset":1911},"end":{"line":71,"column":77,"offset":1985}},"content":[{"type":"para","id":"RNOZ7HJoH-TY4IG_IBxo7","margin":"","location":{"start":{"line":71,"column":5,"offset":1913},"end":{"line":71,"column":77,"offset":1985}},"text":"text","content":["the passed parameters must all be numeric. (Can't exponentiate strings)."]}]},{"type":"block","id":"Cy8kF-q9vCQWs90F3UqlU","margin":"","name":"item","level":1,"location":{"start":{"line":73,"column":3,"offset":1989},"end":{"line":73,"column":97,"offset":2083}},"content":[{"type":"para","id":"95wpUtLLvwoeRTdB2NVZ7","margin":"","location":{"start":{"line":73,"column":5,"offset":1991},"end":{"line":73,"column":97,"offset":2083}},"text":"text","content":["the factors must all be greater than or equal to 1 (or the sequence would be non-ascending)."]}]}]},{"type":"para","id":"xWKzJ_zRI_OvIXUwcIIk9","margin":"","location":{"start":{"line":75,"column":1,"offset":2085},"end":{"line":75,"column":145,"offset":2229}},"text":"text","content":["Note that if ",{"type":"fcode","name":"I","content":["any"]}," of the factors is equal to 1, the sequence will return an infinite series of 1s. Should be obvious why if you think about it."]},{"type":"block","id":"tG5ix8qrt6XwWci5uchXx","margin":"","level":1,"name":"head","location":{"start":{"line":77,"column":1,"offset":2231},"end":{"line":78,"column":7,"offset":2244}},"content":["AUTHOR"]},{"type":"para","id":"8J8QPhktgJMmsunGUXBqh","margin":"","location":{"start":{"line":80,"column":1,"offset":2246},"end":{"line":80,"column":35,"offset":2280}},"text":"text","content":["2019 Steve Schulze aka thundergnat"]},{"type":"para","id":"b0qOrpoRn1XyuvGZmG6fA","margin":"","location":{"start":{"line":82,"column":1,"offset":2282},"end":{"line":82,"column":169,"offset":2450}},"text":"text","content":["This package is free software and is provided \"as is\" without express or implied warranty. You can redistribute it and/or modify it under the same terms as Perl itself."]},{"type":"block","id":"UOq0LTDSfDw59qRQJ8x7w","margin":"","level":1,"name":"head","location":{"start":{"line":84,"column":1,"offset":2452},"end":{"line":85,"column":8,"offset":2467}},"content":["LICENSE"]},{"type":"para","id":"9FtZWP-AqWCg3SVyNEaJ4","margin":"","location":{"start":{"line":87,"column":1,"offset":2469},"end":{"line":87,"column":46,"offset":2514}},"text":"text","content":["Licensed under The Artistic 2.0; see LICENSE."]}]},"publishUrl":"/mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:thundergnat","authors":["Steve Schulze (thundergnat)"],"build-depends":[],"depends":[],"description":"Given a list of factors, return a smooth number iterator","dist":"Smooth::Numbers:ver<0.0.3>:auth<zef:thundergnat>","license":"Artistic-2.0","name":"Smooth::Numbers","path":"S/MO/SMOOTH_NUMBERS/be93ec4f37721dba216613878315bf4b5b290387.tar.gz","perl":"6.*","provides":{"Smooth::Numbers":"lib/Smooth/Numbers.pm6"},"resources":[],"source-url":"git://github.com/thundergnat/smooth-numbers.git","tags":["Smooth numbers","Pierpont numbers","Hamming numbers","Humble numbers"],"test-depends":[],"version":"0.0.3"},"files":[{"file":"work_mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/README.md","publishUrl":"/mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/README.md"},{"file":"work_mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/lib/Smooth/Numbers.pm6","publishUrl":"/mods/zef/Smooth::Numbers/Smooth-Numbers-0.0.3/lib/Smooth/Numbers.pm6"}],"src":"zef","url":"/mods/zef/Smooth::Numbers"}}}
    =end data
    =end React


Smooth::Numbers


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


snip

NAME

SYNOPSIS

DESCRIPTION

AUTHOR

COPYRIGHT AND LICENSE

snip v0.0.1

Authors

License

Dependencies

Test Dependencies

Provides

Documentation