TITLE

provide %*SUB-MAIN-OPTS <allow-no> for older Rakudos


SUBTITLE

data

=begin data
{"type":"page","file":"work_mods/zef/allow-no/allow-no-0.0.1/README.md","sources":[],"node":{"type":"block","id":"8DEBEPJk43l_DcHtzgZTM","margin":"","name":"root","content":[{"type":"para","id":"LvBqbZfATUoLhf31r5LUP","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":137,"offset":136}},"text":"text","content":[{"meta":"https://github.com/lizmat/allow-no/actions","type":"fcode","name":"L","content":[{"type":"block","id":"rnax8_Lt_TVXke74irjM1","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":92,"offset":91}},"content":[{"type":"image","src":"https://github.com/lizmat/allow-no/actions/workflows/test.yml/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"OF8KGre3XUowW68cxcjbW","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":138},"end":{"line":3,"column":7,"offset":144}},"content":["NAME"]},{"type":"para","id":"VqVseRSkzynNntYiArvlK","margin":"","location":{"start":{"line":5,"column":1,"offset":146},"end":{"line":5,"column":65,"offset":210}},"text":"text","content":["allow-no - provide %*SUB-MAIN-OPTS ",{"type":"block","id":"orffh_IQK_TXdxSYqKCAv","margin":"","name":"Html","location":{"start":{"line":5,"column":37,"offset":182},"end":{"line":5,"column":47,"offset":192}},"content":[{"type":"verbatim","value":"<allow-no>"}]}," for older Rakudos"]},{"type":"block","id":"foxX18_cJg05J_K3ZcCRA","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":212},"end":{"line":7,"column":11,"offset":222}},"content":["SYNOPSIS"]},{"type":"block","id":"tq8AOxrrQw8ANP32nIMrR","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":9,"column":1,"offset":224},"end":{"line":17,"column":4,"offset":364}},"content":[{"type":"verbatim","value":"use allow-no;\n\nsub MAIN(:$foo, :$bar) {\n    # calling script with --foo, --no-bar\n    say $foo;  # True\n    say $bar;  # False\n}"}]},{"type":"block","id":"sejI8AC-gSFcUjkZ_PWzN","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":366},"end":{"line":19,"column":14,"offset":379}},"content":["DESCRIPTION"]},{"type":"para","id":"p8xM_EOZeGmcevn2toWtL","margin":"","location":{"start":{"line":21,"column":1,"offset":381},"end":{"line":21,"column":248,"offset":628}},"text":"text","content":["The ",{"type":"fcode","name":"C","content":["allow-no"]}," module provides functionality that has been provided by Rakudo 2022.08 and higher: it allows command line parameters to indicate a ",{"type":"fcode","name":"C","content":["False"]}," flag to be specified as ",{"type":"fcode","name":"C","content":["--no-foo"]}," as well as the standard allowed ",{"type":"fcode","name":"C","content":["--/foo"]}," or ",{"type":"fcode","name":"C","content":["--foo-False"]},"."]},{"type":"para","id":"tv_d3oqFzci8L1lD6T2ZD","margin":"","location":{"start":{"line":23,"column":1,"offset":630},"end":{"line":23,"column":147,"offset":776}},"text":"text","content":["Using this module will run an INIT block that will perform the necessary transformation on ",{"type":"fcode","name":"C","content":["@*ARGS"]},". No further action or configuration is needed."]},{"type":"block","id":"ZjPWxAHb7yeRJX0FoltJa","margin":"","level":1,"name":"head","location":{"start":{"line":25,"column":1,"offset":778},"end":{"line":25,"column":9,"offset":786}},"content":["AUTHOR"]},{"type":"para","id":"Es6guA0uQ7TRWZMQF6DFd","margin":"","location":{"start":{"line":27,"column":1,"offset":788},"end":{"line":27,"column":37,"offset":824}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"E8nm7i3xruo9MrDKLCZRL","margin":"","location":{"start":{"line":29,"column":1,"offset":826},"end":{"line":29,"column":103,"offset":928}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/allow-no","type":"fcode","name":"L","content":["https://github.com/lizmat/allow-no"]}," . Comments and Pull Requests are welcome."]},{"type":"para","id":"VapDPGPG7NCXI0wwQVGts","margin":"","location":{"start":{"line":31,"column":1,"offset":930},"end":{"line":31,"column":163,"offset":1092}},"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":"OOFZGufkuYgGU0Jm6IgJZ","margin":"","level":1,"name":"head","location":{"start":{"line":33,"column":1,"offset":1094},"end":{"line":33,"column":24,"offset":1117}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"5ZIUkRuJK8XhcGLuXVkDj","margin":"","location":{"start":{"line":35,"column":1,"offset":1119},"end":{"line":35,"column":35,"offset":1153}},"text":"text","content":["Copyright 2022 Elizabeth Mattijsen"]},{"type":"para","id":"QMQldB0DR74Z1vsm9znh2","margin":"","location":{"start":{"line":37,"column":1,"offset":1155},"end":{"line":37,"column":104,"offset":1258}},"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/allow-no/allow-no-0.0.1/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"provide %*SUB-MAIN-OPTS <allow-no> for older Rakudos","dist":"allow-no:ver<0.0.1>:auth<zef:lizmat>","license":"Artistic-2.0","name":"allow-no","path":"A/LL/ALLOWNO/14bf5ecc54693c092ba32c4de095fc7abcb12928.tar.gz","perl":"6.d","provides":{"allow-no":"lib/allow-no.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/allow-no.git","tags":["CLI","ARGS"],"test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/allow-no/allow-no-0.0.1/README.md","publishUrl":"/mods/zef/allow-no/allow-no-0.0.1/README.md"},{"file":"work_mods/zef/allow-no/allow-no-0.0.1/lib/allow-no.rakumod","publishUrl":"/mods/zef/allow-no/allow-no-0.0.1/lib/allow-no.rakumod"}],"src":"zef","url":"/mods/zef/allow-no"}}}
=end data


React

    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/allow-no/allow-no-0.0.1/README.md","sources":[],"node":{"type":"block","id":"8DEBEPJk43l_DcHtzgZTM","margin":"","name":"root","content":[{"type":"para","id":"LvBqbZfATUoLhf31r5LUP","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":137,"offset":136}},"text":"text","content":[{"meta":"https://github.com/lizmat/allow-no/actions","type":"fcode","name":"L","content":[{"type":"block","id":"rnax8_Lt_TVXke74irjM1","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":92,"offset":91}},"content":[{"type":"image","src":"https://github.com/lizmat/allow-no/actions/workflows/test.yml/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"OF8KGre3XUowW68cxcjbW","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":138},"end":{"line":3,"column":7,"offset":144}},"content":["NAME"]},{"type":"para","id":"VqVseRSkzynNntYiArvlK","margin":"","location":{"start":{"line":5,"column":1,"offset":146},"end":{"line":5,"column":65,"offset":210}},"text":"text","content":["allow-no - provide %*SUB-MAIN-OPTS ",{"type":"block","id":"orffh_IQK_TXdxSYqKCAv","margin":"","name":"Html","location":{"start":{"line":5,"column":37,"offset":182},"end":{"line":5,"column":47,"offset":192}},"content":[{"type":"verbatim","value":"<allow-no>"}]}," for older Rakudos"]},{"type":"block","id":"foxX18_cJg05J_K3ZcCRA","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":212},"end":{"line":7,"column":11,"offset":222}},"content":["SYNOPSIS"]},{"type":"block","id":"tq8AOxrrQw8ANP32nIMrR","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":9,"column":1,"offset":224},"end":{"line":17,"column":4,"offset":364}},"content":[{"type":"verbatim","value":"use allow-no;\n\nsub MAIN(:$foo, :$bar) {\n    # calling script with --foo, --no-bar\n    say $foo;  # True\n    say $bar;  # False\n}"}]},{"type":"block","id":"sejI8AC-gSFcUjkZ_PWzN","margin":"","level":1,"name":"head","location":{"start":{"line":19,"column":1,"offset":366},"end":{"line":19,"column":14,"offset":379}},"content":["DESCRIPTION"]},{"type":"para","id":"p8xM_EOZeGmcevn2toWtL","margin":"","location":{"start":{"line":21,"column":1,"offset":381},"end":{"line":21,"column":248,"offset":628}},"text":"text","content":["The ",{"type":"fcode","name":"C","content":["allow-no"]}," module provides functionality that has been provided by Rakudo 2022.08 and higher: it allows command line parameters to indicate a ",{"type":"fcode","name":"C","content":["False"]}," flag to be specified as ",{"type":"fcode","name":"C","content":["--no-foo"]}," as well as the standard allowed ",{"type":"fcode","name":"C","content":["--/foo"]}," or ",{"type":"fcode","name":"C","content":["--foo-False"]},"."]},{"type":"para","id":"tv_d3oqFzci8L1lD6T2ZD","margin":"","location":{"start":{"line":23,"column":1,"offset":630},"end":{"line":23,"column":147,"offset":776}},"text":"text","content":["Using this module will run an INIT block that will perform the necessary transformation on ",{"type":"fcode","name":"C","content":["@*ARGS"]},". No further action or configuration is needed."]},{"type":"block","id":"ZjPWxAHb7yeRJX0FoltJa","margin":"","level":1,"name":"head","location":{"start":{"line":25,"column":1,"offset":778},"end":{"line":25,"column":9,"offset":786}},"content":["AUTHOR"]},{"type":"para","id":"Es6guA0uQ7TRWZMQF6DFd","margin":"","location":{"start":{"line":27,"column":1,"offset":788},"end":{"line":27,"column":37,"offset":824}},"text":"text","content":["Elizabeth Mattijsen ",{"meta":"mailto:liz@raku.rocks","type":"fcode","name":"L","content":["liz@raku.rocks"]}]},{"type":"para","id":"E8nm7i3xruo9MrDKLCZRL","margin":"","location":{"start":{"line":29,"column":1,"offset":826},"end":{"line":29,"column":103,"offset":928}},"text":"text","content":["Source can be located at: ",{"meta":"https://github.com/lizmat/allow-no","type":"fcode","name":"L","content":["https://github.com/lizmat/allow-no"]}," . Comments and Pull Requests are welcome."]},{"type":"para","id":"VapDPGPG7NCXI0wwQVGts","margin":"","location":{"start":{"line":31,"column":1,"offset":930},"end":{"line":31,"column":163,"offset":1092}},"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":"OOFZGufkuYgGU0Jm6IgJZ","margin":"","level":1,"name":"head","location":{"start":{"line":33,"column":1,"offset":1094},"end":{"line":33,"column":24,"offset":1117}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"5ZIUkRuJK8XhcGLuXVkDj","margin":"","location":{"start":{"line":35,"column":1,"offset":1119},"end":{"line":35,"column":35,"offset":1153}},"text":"text","content":["Copyright 2022 Elizabeth Mattijsen"]},{"type":"para","id":"QMQldB0DR74Z1vsm9znh2","margin":"","location":{"start":{"line":37,"column":1,"offset":1155},"end":{"line":37,"column":104,"offset":1258}},"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/allow-no/allow-no-0.0.1/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:lizmat","authors":["Elizabeth Mattijsen"],"build-depends":[],"depends":[],"description":"provide %*SUB-MAIN-OPTS <allow-no> for older Rakudos","dist":"allow-no:ver<0.0.1>:auth<zef:lizmat>","license":"Artistic-2.0","name":"allow-no","path":"A/LL/ALLOWNO/14bf5ecc54693c092ba32c4de095fc7abcb12928.tar.gz","perl":"6.d","provides":{"allow-no":"lib/allow-no.rakumod"},"resources":[],"source-url":"https://github.com/lizmat/allow-no.git","tags":["CLI","ARGS"],"test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/allow-no/allow-no-0.0.1/README.md","publishUrl":"/mods/zef/allow-no/allow-no-0.0.1/README.md"},{"file":"work_mods/zef/allow-no/allow-no-0.0.1/lib/allow-no.rakumod","publishUrl":"/mods/zef/allow-no/allow-no-0.0.1/lib/allow-no.rakumod"}],"src":"zef","url":"/mods/zef/allow-no"}}}
    =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

allow-no


=begin data
{"type":"page","file":"work_mods/zef/annotations/ra-annotations/README.md","sources":[],"node":{"type":"block","id":"7hC1iGBpga2uzOoRTcIGf","margin":"","name":"root","content":[{"type":"para","id":"xfHHrnuT3h9k1bnYTP7TN","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":95,"offset":94}},"text":"text","content":[{"type":"block","id":"kwgncICfvQ6hNR-sm0TxZ","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":95,"offset":94}},"content":[{"type":"image","src":"https://github.com/Kaiepi/ra-annotations/actions/workflows/test.yml/badge.svg","alt":"Build Status"}]}]},{"type":"block","id":"OYb8Rr3zWyWVMGhZL1wYd","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":96},"end":{"line":3,"column":7,"offset":102}},"content":["NAME"]},{"type":"para","id":"rCnyMH3XZKOcr4eFUfeZd","margin":"","location":{"start":{"line":5,"column":1,"offset":104},"end":{"line":5,"column":39,"offset":142}},"text":"text","content":["annotations - Thread-safe static state"]},{"type":"block","id":"1AyGGnf9jEzBlPoWI6LCN","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":144},"end":{"line":7,"column":11,"offset":154}},"content":["SYNOPSIS"]},{"type":"block","id":"rYh5Ls_ekhYTnlYKsbUdg","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":9,"column":1,"offset":156},"end":{"line":96,"column":4,"offset":4049}},"content":[{"type":"verbatim","value":"use v6.e.PREVIEW;\n\nmy constant LATIN = 'a'..'z';\n\nmodule Upper {\n    use annotations <declare symbolic class>;\n    # We may now declare a class with a symbolic object buffer associated with\n    # it. This can be retrieved by parameterizing ANN with our type object,\n    # which is typically knowable at compile-time.\n\n    role Alphabet[@LOOKUP is raw] is repr<Uninstantiable> {\n        # The annotated operator makes some allocations in an annotation's ANN\n        # buffer eagerly given some Str-coercive objects. These become IntStr:D\n        # symbols, which is to say they're a name and a position in the buffer\n        # for this mixin. Because we take care of this immediately, this can act\n        # as our compile-time check for whether or not we really are composing\n        # an annotation. Such allocating in ANN is thread-safe.\n        my @SYMBOLS := $?CLASS annotate @LOOKUP;\n\n        # The bare slots can be fetched by ANN's list method given thse\n        # symbols. Because these carry containers regardless of whether or not\n        # a value is being stored, this can always be assigned to dynamically.\n        method alphabet(::?CLASS: --> List:D) is raw { ANN[$?CLASS].list: :of(@SYMBOLS) }\n\n        # Likewise, these symbols can form the keys of a map by the ANN's hash\n        # method.\n        method dictionary(::?CLASS: --> Map:D) { ANN[$?CLASS].hash: :of(@SYMBOLS) }\n\n        # This will find a letter given the key of a booked symbol.\n        method translate(::?CLASS: Str:D --> Str) { ... }\n    }\n\n    annotation Half does Alphabet[LATIN] is repr<Uninstantiable> {\n        CHECK $?CLASS.alphabet = 'A'..'Z';\n        my %DICTIONARY := $?CLASS.dictionary;\n        method translate(::?CLASS: Str:D $letter --> Str) { %DICTIONARY.AT-KEY: $letter }\n    }\n\n    annotation Full does Alphabet[LATIN] is repr<Uninstantiable> {\n        CHECK $?CLASS.alphabet = 'Ａ'..'Ｚ';\n        my %DICTIONARY := $?CLASS.dictionary;\n        method translate(::?CLASS: Str:D $letter --> Str) { %DICTIONARY.AT-KEY: $letter }\n    }\n}\n\n# Despite the inner alphabet list being static, public, mutable state by\n# technicality, its inner Binder slots each only respects its first assignment.\nput Upper::Full.alphabet = Upper::Half.alphabet; # OUTPUT:\n# Ａ Ｂ Ｃ Ｄ Ｅ Ｆ Ｇ Ｈ Ｉ Ｊ Ｋ Ｌ Ｍ Ｎ Ｏ Ｐ Ｑ Ｒ Ｓ Ｔ Ｕ Ｖ Ｗ Ｘ Ｙ Ｚ\nput Upper::Full.translate: 'a'; # OUTPUT:\n# Ａ\n\n# But because we can achieve all this with static input alone, we can write a\n# cheaper annotation.\nmodule LowerPsychUpper {\n    use annotations <declare direct class>;\n    # Now the ANN buffer is purely a buffer. Direct annotations' ANN buffer is\n    # a lower level construct compared to before; because we get references\n    # over symbols, we generally need to track any value bound ourselves.\n\n    annotation Full is repr<Uninstantiable> {\n        # Note the RW array this time around.\n        my constant @ALPHABET = $?CLASS annotate ['ａ'..'ｚ'];\n\n        my constant %DICTIONARY = Map.new: LATIN Z=> @ALPHABET;\n\n        method alphabet(::?CLASS: --> List:D) { @ALPHABET }\n\n        method dictionary(::?CLASS: --> Map:D) { %DICTIONARY }\n\n        method translate(::?CLASS: Str:D $letter --> Str) { %DICTIONARY.AT-KEY: $letter }\n    }\n}\n\n# Unlike before, the RW containers provided by the RW array we annotated are\n# preserved, so an assignment will carry through.\nput LowerPsychUpper::Full.alphabet = Upper::Full.alphabet; # OUTPUT:\n# Ａ Ｂ Ｃ Ｄ Ｅ Ｆ Ｇ Ｈ Ｉ Ｊ Ｋ Ｌ Ｍ Ｎ Ｏ Ｐ Ｑ Ｒ Ｓ Ｔ Ｕ Ｖ Ｗ Ｘ Ｙ Ｚ\nput LowerPsychUpper::Full.translate: 'z'; # OUTPUT:\n# Ｚ\n\n# In this example, we have code resembling what's possible to write with OUR.\n# Unlike a Stash in a WHO or a PseudoStash, ANN errs more toward order and\n# immutability, but deconts of a Scalar are cheaper than those of a wrapper\n# Proxy. An OUR-scoped value skips a call we need otherwise on top of this, and\n# would thus be more efficient if the WHO Stash's inherent mutability is OK."}]},{"type":"block","id":"mtcM5XT9uqdi3-yQl4r3f","margin":"","level":1,"name":"head","location":{"start":{"line":98,"column":1,"offset":4051},"end":{"line":98,"column":14,"offset":4064}},"content":["DESCRIPTION"]},{"type":"para","id":"j8xIncppLArd-CCXVjxqa","margin":"","location":{"start":{"line":100,"column":1,"offset":4066},"end":{"line":100,"column":246,"offset":4311}},"text":"text","content":[{"type":"fcode","name":"C","content":["annotations"]}," is a collection of containers in a package trench coat. Through these, a thread-safe, positional buffer may be associated with any kind of type, retrievable with ",{"type":"fcode","name":"C","content":["ANN"]},", regardless of whether or not it actually can support stashing."]},{"type":"para","id":"zu6aqQcmFPYF6l2nBQABM","margin":"","location":{"start":{"line":102,"column":1,"offset":4313},"end":{"line":102,"column":404,"offset":4716}},"text":"text","content":["Importing ",{"type":"fcode","name":"C","content":["annotations"]}," can either create an ",{"type":"fcode","name":"C","content":["annotation"]}," declarator with ",{"type":"fcode","name":"C","content":["'declare'"]}," or override another (e.g. ",{"type":"fcode","name":"C","content":["'role'"]},") with ",{"type":"fcode","name":"C","content":["'supersede'"]}," (though this produces an erroneous deprecation warning as of v2020.07). As demonstrated, the ",{"type":"fcode","name":"C","content":["'direct'"]}," and ",{"type":"fcode","name":"C","content":["'symbolic'"]}," arguments determine the mode of assignment to a package's ",{"type":"fcode","name":"C","content":["ANN"]},". Finally, a package declarator must be provided in order to retrieve its HOW."]},{"type":"block","id":"weLjR7TFaH3MlrwY_ztMr","margin":"","level":1,"name":"head","location":{"start":{"line":104,"column":1,"offset":4718},"end":{"line":104,"column":9,"offset":4726}},"content":["AUTHOR"]},{"type":"para","id":"kvPv60Aw30DohjQskex0U","margin":"","location":{"start":{"line":106,"column":1,"offset":4728},"end":{"line":106,"column":20,"offset":4747}},"text":"text","content":["Ben Davies (Kaiepi)"]},{"type":"block","id":"C8BNywBNsh3FWnl4UEPUw","margin":"","level":1,"name":"head","location":{"start":{"line":108,"column":1,"offset":4749},"end":{"line":108,"column":24,"offset":4772}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"Rijgk4uIyS87kw1495BBp","margin":"","location":{"start":{"line":110,"column":1,"offset":4774},"end":{"line":110,"column":26,"offset":4799}},"text":"text","content":["Copyright 2022 Ben Davies"]},{"type":"para","id":"ZfFW_CiO2JSeMlb41I1KZ","margin":"","location":{"start":{"line":112,"column":1,"offset":4801},"end":{"line":112,"column":104,"offset":4904}},"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/annotations/ra-annotations/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:Kaiepi","authors":["Ben Davies"],"build-depends":[],"depends":[],"description":"Thread-safe static state","dist":"annotations:ver<0.0.1>:auth<zef:Kaiepi>","license":"Artistic-2.0","name":"annotations","path":"A/NN/ANNOTATIONS/8b87b8729601e47b5468732ced33868138a9a8f0.tar.gz","perl":"6.e.PREVIEW","provides":{"annotations":"lib/annotations.rakumod","annotations::containers":"lib/annotations/containers.rakumod","annotations::core":"lib/annotations/core.rakumod","annotations::how":"lib/annotations/how.rakumod"},"resources":[],"source-url":"https://github.com/Kaiepi/ra-annotations.git","test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/annotations/ra-annotations/README.md","publishUrl":"/mods/zef/annotations/ra-annotations/README.md"},{"file":"work_mods/zef/annotations/ra-annotations/README.pod6","publishUrl":"/mods/zef/annotations/ra-annotations/README.pod6"}],"src":"zef","url":"/mods/zef/annotations"}}}
=end data


    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/annotations/ra-annotations/README.md","sources":[],"node":{"type":"block","id":"7hC1iGBpga2uzOoRTcIGf","margin":"","name":"root","content":[{"type":"para","id":"xfHHrnuT3h9k1bnYTP7TN","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":95,"offset":94}},"text":"text","content":[{"type":"block","id":"kwgncICfvQ6hNR-sm0TxZ","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":95,"offset":94}},"content":[{"type":"image","src":"https://github.com/Kaiepi/ra-annotations/actions/workflows/test.yml/badge.svg","alt":"Build Status"}]}]},{"type":"block","id":"OYb8Rr3zWyWVMGhZL1wYd","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":96},"end":{"line":3,"column":7,"offset":102}},"content":["NAME"]},{"type":"para","id":"rCnyMH3XZKOcr4eFUfeZd","margin":"","location":{"start":{"line":5,"column":1,"offset":104},"end":{"line":5,"column":39,"offset":142}},"text":"text","content":["annotations - Thread-safe static state"]},{"type":"block","id":"1AyGGnf9jEzBlPoWI6LCN","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":144},"end":{"line":7,"column":11,"offset":154}},"content":["SYNOPSIS"]},{"type":"block","id":"rYh5Ls_ekhYTnlYKsbUdg","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":9,"column":1,"offset":156},"end":{"line":96,"column":4,"offset":4049}},"content":[{"type":"verbatim","value":"use v6.e.PREVIEW;\n\nmy constant LATIN = 'a'..'z';\n\nmodule Upper {\n    use annotations <declare symbolic class>;\n    # We may now declare a class with a symbolic object buffer associated with\n    # it. This can be retrieved by parameterizing ANN with our type object,\n    # which is typically knowable at compile-time.\n\n    role Alphabet[@LOOKUP is raw] is repr<Uninstantiable> {\n        # The annotated operator makes some allocations in an annotation's ANN\n        # buffer eagerly given some Str-coercive objects. These become IntStr:D\n        # symbols, which is to say they're a name and a position in the buffer\n        # for this mixin. Because we take care of this immediately, this can act\n        # as our compile-time check for whether or not we really are composing\n        # an annotation. Such allocating in ANN is thread-safe.\n        my @SYMBOLS := $?CLASS annotate @LOOKUP;\n\n        # The bare slots can be fetched by ANN's list method given thse\n        # symbols. Because these carry containers regardless of whether or not\n        # a value is being stored, this can always be assigned to dynamically.\n        method alphabet(::?CLASS: --> List:D) is raw { ANN[$?CLASS].list: :of(@SYMBOLS) }\n\n        # Likewise, these symbols can form the keys of a map by the ANN's hash\n        # method.\n        method dictionary(::?CLASS: --> Map:D) { ANN[$?CLASS].hash: :of(@SYMBOLS) }\n\n        # This will find a letter given the key of a booked symbol.\n        method translate(::?CLASS: Str:D --> Str) { ... }\n    }\n\n    annotation Half does Alphabet[LATIN] is repr<Uninstantiable> {\n        CHECK $?CLASS.alphabet = 'A'..'Z';\n        my %DICTIONARY := $?CLASS.dictionary;\n        method translate(::?CLASS: Str:D $letter --> Str) { %DICTIONARY.AT-KEY: $letter }\n    }\n\n    annotation Full does Alphabet[LATIN] is repr<Uninstantiable> {\n        CHECK $?CLASS.alphabet = 'Ａ'..'Ｚ';\n        my %DICTIONARY := $?CLASS.dictionary;\n        method translate(::?CLASS: Str:D $letter --> Str) { %DICTIONARY.AT-KEY: $letter }\n    }\n}\n\n# Despite the inner alphabet list being static, public, mutable state by\n# technicality, its inner Binder slots each only respects its first assignment.\nput Upper::Full.alphabet = Upper::Half.alphabet; # OUTPUT:\n# Ａ Ｂ Ｃ Ｄ Ｅ Ｆ Ｇ Ｈ Ｉ Ｊ Ｋ Ｌ Ｍ Ｎ Ｏ Ｐ Ｑ Ｒ Ｓ Ｔ Ｕ Ｖ Ｗ Ｘ Ｙ Ｚ\nput Upper::Full.translate: 'a'; # OUTPUT:\n# Ａ\n\n# But because we can achieve all this with static input alone, we can write a\n# cheaper annotation.\nmodule LowerPsychUpper {\n    use annotations <declare direct class>;\n    # Now the ANN buffer is purely a buffer. Direct annotations' ANN buffer is\n    # a lower level construct compared to before; because we get references\n    # over symbols, we generally need to track any value bound ourselves.\n\n    annotation Full is repr<Uninstantiable> {\n        # Note the RW array this time around.\n        my constant @ALPHABET = $?CLASS annotate ['ａ'..'ｚ'];\n\n        my constant %DICTIONARY = Map.new: LATIN Z=> @ALPHABET;\n\n        method alphabet(::?CLASS: --> List:D) { @ALPHABET }\n\n        method dictionary(::?CLASS: --> Map:D) { %DICTIONARY }\n\n        method translate(::?CLASS: Str:D $letter --> Str) { %DICTIONARY.AT-KEY: $letter }\n    }\n}\n\n# Unlike before, the RW containers provided by the RW array we annotated are\n# preserved, so an assignment will carry through.\nput LowerPsychUpper::Full.alphabet = Upper::Full.alphabet; # OUTPUT:\n# Ａ Ｂ Ｃ Ｄ Ｅ Ｆ Ｇ Ｈ Ｉ Ｊ Ｋ Ｌ Ｍ Ｎ Ｏ Ｐ Ｑ Ｒ Ｓ Ｔ Ｕ Ｖ Ｗ Ｘ Ｙ Ｚ\nput LowerPsychUpper::Full.translate: 'z'; # OUTPUT:\n# Ｚ\n\n# In this example, we have code resembling what's possible to write with OUR.\n# Unlike a Stash in a WHO or a PseudoStash, ANN errs more toward order and\n# immutability, but deconts of a Scalar are cheaper than those of a wrapper\n# Proxy. An OUR-scoped value skips a call we need otherwise on top of this, and\n# would thus be more efficient if the WHO Stash's inherent mutability is OK."}]},{"type":"block","id":"mtcM5XT9uqdi3-yQl4r3f","margin":"","level":1,"name":"head","location":{"start":{"line":98,"column":1,"offset":4051},"end":{"line":98,"column":14,"offset":4064}},"content":["DESCRIPTION"]},{"type":"para","id":"j8xIncppLArd-CCXVjxqa","margin":"","location":{"start":{"line":100,"column":1,"offset":4066},"end":{"line":100,"column":246,"offset":4311}},"text":"text","content":[{"type":"fcode","name":"C","content":["annotations"]}," is a collection of containers in a package trench coat. Through these, a thread-safe, positional buffer may be associated with any kind of type, retrievable with ",{"type":"fcode","name":"C","content":["ANN"]},", regardless of whether or not it actually can support stashing."]},{"type":"para","id":"zu6aqQcmFPYF6l2nBQABM","margin":"","location":{"start":{"line":102,"column":1,"offset":4313},"end":{"line":102,"column":404,"offset":4716}},"text":"text","content":["Importing ",{"type":"fcode","name":"C","content":["annotations"]}," can either create an ",{"type":"fcode","name":"C","content":["annotation"]}," declarator with ",{"type":"fcode","name":"C","content":["'declare'"]}," or override another (e.g. ",{"type":"fcode","name":"C","content":["'role'"]},") with ",{"type":"fcode","name":"C","content":["'supersede'"]}," (though this produces an erroneous deprecation warning as of v2020.07). As demonstrated, the ",{"type":"fcode","name":"C","content":["'direct'"]}," and ",{"type":"fcode","name":"C","content":["'symbolic'"]}," arguments determine the mode of assignment to a package's ",{"type":"fcode","name":"C","content":["ANN"]},". Finally, a package declarator must be provided in order to retrieve its HOW."]},{"type":"block","id":"weLjR7TFaH3MlrwY_ztMr","margin":"","level":1,"name":"head","location":{"start":{"line":104,"column":1,"offset":4718},"end":{"line":104,"column":9,"offset":4726}},"content":["AUTHOR"]},{"type":"para","id":"kvPv60Aw30DohjQskex0U","margin":"","location":{"start":{"line":106,"column":1,"offset":4728},"end":{"line":106,"column":20,"offset":4747}},"text":"text","content":["Ben Davies (Kaiepi)"]},{"type":"block","id":"C8BNywBNsh3FWnl4UEPUw","margin":"","level":1,"name":"head","location":{"start":{"line":108,"column":1,"offset":4749},"end":{"line":108,"column":24,"offset":4772}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"Rijgk4uIyS87kw1495BBp","margin":"","location":{"start":{"line":110,"column":1,"offset":4774},"end":{"line":110,"column":26,"offset":4799}},"text":"text","content":["Copyright 2022 Ben Davies"]},{"type":"para","id":"ZfFW_CiO2JSeMlb41I1KZ","margin":"","location":{"start":{"line":112,"column":1,"offset":4801},"end":{"line":112,"column":104,"offset":4904}},"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/annotations/ra-annotations/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:Kaiepi","authors":["Ben Davies"],"build-depends":[],"depends":[],"description":"Thread-safe static state","dist":"annotations:ver<0.0.1>:auth<zef:Kaiepi>","license":"Artistic-2.0","name":"annotations","path":"A/NN/ANNOTATIONS/8b87b8729601e47b5468732ced33868138a9a8f0.tar.gz","perl":"6.e.PREVIEW","provides":{"annotations":"lib/annotations.rakumod","annotations::containers":"lib/annotations/containers.rakumod","annotations::core":"lib/annotations/core.rakumod","annotations::how":"lib/annotations/how.rakumod"},"resources":[],"source-url":"https://github.com/Kaiepi/ra-annotations.git","test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/annotations/ra-annotations/README.md","publishUrl":"/mods/zef/annotations/ra-annotations/README.md"},{"file":"work_mods/zef/annotations/ra-annotations/README.pod6","publishUrl":"/mods/zef/annotations/ra-annotations/README.pod6"}],"src":"zef","url":"/mods/zef/annotations"}}}
    =end data
    =end React


Thread-safe static state


annotations


Provides some functions from 'Introduction to Algorithms', Third Edition


=begin data
{"type":"page","file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/README.md","sources":[],"node":{"type":"block","id":"rDzmNUJ8tgsZqEwXgKUf2","margin":"","name":"root","content":[{"type":"para","id":"u-YjycmSre7LUdaxk_WYL","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":452,"offset":451}},"text":"text","content":[{"meta":"https://github.com/tbrowder/AlgorithmsIT/actions","type":"fcode","name":"L","content":[{"type":"block","id":"2wCLwSnO-Hf3v3fKJurCR","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":99,"offset":98}},"content":[{"type":"image","src":"https://github.com/tbrowder/AlgorithmsIT/actions/workflows/linux.yml/badge.svg","alt":"Actions Status"}]}]}," ",{"meta":"https://github.com/tbrowder/AlgorithmsIT/actions","type":"fcode","name":"L","content":[{"type":"block","id":"vKlQHvkVblQE3o2JBNG05","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":152,"offset":151},"end":{"line":1,"column":249,"offset":248}},"content":[{"type":"image","src":"https://github.com/tbrowder/AlgorithmsIT/actions/workflows/macos.yml/badge.svg","alt":"Actions Status"}]}]}," ",{"meta":"https://github.com/tbrowder/AlgorithmsIT/actions","type":"fcode","name":"L","content":[{"type":"block","id":"2GHck4cNErkBqthDXXxnk","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":302,"offset":301},"end":{"line":1,"column":401,"offset":400}},"content":[{"type":"image","src":"https://github.com/tbrowder/AlgorithmsIT/actions/workflows/windows.yml/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"Sjb075OyGD4PgqDdzR65Q","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":453},"end":{"line":3,"column":7,"offset":459}},"content":["NAME"]},{"type":"para","id":"M0pAb5OGW_26cHt4P0y_C","margin":"","location":{"start":{"line":5,"column":1,"offset":461},"end":{"line":5,"column":92,"offset":552}},"text":"text","content":[{"type":"fcode","name":"B","content":["AlgorithmsIT"]}," - Provides some functions from ",{"type":"fcode","name":"I","content":["Introduction to Algorithms"]},", Third Edition"]},{"type":"block","id":"KxkN0fBxXxSEeqMzx63k7","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":554},"end":{"line":7,"column":11,"offset":564}},"content":["SYNOPSIS"]},{"type":"block","id":"-6R3qdN4wv1K401uWTgIQ","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":9,"column":1,"offset":566},"end":{"line":19,"column":4,"offset":994}},"content":[{"type":"verbatim","value":"use AlgorithmsIT :ALL;\nuse Classes;\nmy $P = ArrayOneBased.new: \"pattern\";\nmy $T = ArrayOneBased.new: \"some text with pattern in it (or not)\";\nmy $pi = ArrayOneBased.new: 1, $T.length; # creates an array: [1, 2, ..., $T.length]\nmy @matches = KMP-Matcher $T, $P;\nsay @matches.gist;\n# OUTPUT: «[15]␤» # 15 shifts from the first character to the match position\n# The @matches array would be empty if no match were found."}]},{"type":"block","id":"74Lk-iZPUj1bFqnqt9L_V","margin":"","level":1,"name":"head","location":{"start":{"line":21,"column":1,"offset":996},"end":{"line":21,"column":14,"offset":1009}},"content":["DESCRIPTION"]},{"type":"para","id":"IKspfBUGahbL1ASkRRMAB","margin":"","location":{"start":{"line":23,"column":1,"offset":1011},"end":{"line":23,"column":80,"offset":1090}},"text":"text","content":[{"type":"fcode","name":"B","content":["AlgorithmsIT"]}," is a collection of a small subset of functions in Reference 1."]},{"type":"para","id":"-uoX8vgI48uHliVHH3IjI","margin":"","location":{"start":{"line":25,"column":1,"offset":1092},"end":{"line":25,"column":48,"offset":1139}},"text":"text","content":["See more details at ",{"meta":"./FUNCTIONS.md","type":"fcode","name":"L","content":["FUNCTIONS"]}]},{"type":"block","id":"05_TdC9VAXpnF8lVh2ldw","margin":"","level":1,"name":"head","location":{"start":{"line":27,"column":1,"offset":1141},"end":{"line":27,"column":10,"offset":1150}},"content":["Credits"]},{"type":"para","id":"WEssf_D6_Mmu6VrHD5h8i","margin":"","location":{"start":{"line":29,"column":1,"offset":1152},"end":{"line":29,"column":163,"offset":1314}},"text":"text","content":["Thanks to my Raku friend, '@tonyo' (on IRC #raku), for his help with the ",{"type":"fcode","name":"B","content":["ArrayOneBased"]}," class. See his many Raku contributions at ",{"type":"fcode","name":"C","content":["https://github.com/tony-o/"]},"."]},{"type":"block","id":"R9BPncwlBg_yySDQ0sGDn","margin":"","level":1,"name":"head","location":{"start":{"line":31,"column":1,"offset":1316},"end":{"line":31,"column":13,"offset":1328}},"content":["References"]},{"type":"block","id":"fu6ibsx1paTn7QcHKmGGS","margin":"","level":4,"name":"head","location":{"start":{"line":33,"column":1,"offset":1330},"end":{"line":33,"column":95,"offset":1424}},"content":["1. Thomas H. Cormen, et alii, ",{"type":"fcode","name":"I","content":["Introduction to Algorithms"]},", Third Edition, February 2009."]},{"type":"block","id":"f_v9u3mHBnzk8GUibAs6j","margin":"","level":1,"name":"head","location":{"start":{"line":35,"column":1,"offset":1426},"end":{"line":35,"column":9,"offset":1434}},"content":["AUTHOR"]},{"type":"para","id":"pilQGWeOJwW15zeKJb6Vw","margin":"","location":{"start":{"line":37,"column":1,"offset":1436},"end":{"line":37,"column":31,"offset":1466}},"text":"text","content":["Tom Browder ",{"meta":"mailto:tbrowder@acm.org","type":"fcode","name":"L","content":["tbrowder@acm.org"]}]},{"type":"block","id":"qyhaVPVC04coJxAOctLTi","margin":"","level":1,"name":"head","location":{"start":{"line":39,"column":1,"offset":1468},"end":{"line":39,"column":24,"offset":1491}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"-GDr0rDbuQhfNia0tGT3V","margin":"","location":{"start":{"line":41,"column":1,"offset":1493},"end":{"line":41,"column":19,"offset":1511}},"text":"text","content":["© 2023 Tom Browder"]},{"type":"para","id":"tjWJiwBiqYKFmlBIIOU4a","margin":"","location":{"start":{"line":43,"column":1,"offset":1513},"end":{"line":43,"column":100,"offset":1612}},"text":"text","content":["This library is free software; you may redistribute it or modify it under the Artistic License 2.0."]}]},"publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:tbrowder","authors":["Tom Browder"],"build-depends":[],"depends":[],"description":"Provides some functions from 'Introduction to Algorithms', Third Edition","dist":"AlgorithmsIT:ver<0.0.1>:auth<zef:tbrowder>","license":"Artistic-2.0","name":"AlgorithmsIT","path":"A/LG/ALGORITHMSIT/b7c1ca130394dd74c09c60af7905be4a2acc5598.tar.gz","perl":"6.d","provides":{"AlgorithmsIT":"lib/AlgorithmsIT.rakumod","Classes":"lib/Classes.rakumod"},"resources":[],"source-url":"https://github.com/tbrowder/AlgorithmsIT.git","tags":["algorithm pattern match string text"],"test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/README.md","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/README.md"},{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/FUNCTIONS.md","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/FUNCTIONS.md"},{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/docs/FUNCTIONS.rakudoc","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/docs/FUNCTIONS.rakudoc"},{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/docs/README.rakudoc","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/docs/README.rakudoc"},{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/lib/AlgorithmsIT.rakumod","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/lib/AlgorithmsIT.rakumod"}],"src":"zef","url":"/mods/zef/AlgorithmsIT"}}}
=end data


    =begin React :component<RenderItem>
    =begin data
    {"type":"page","file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/README.md","sources":[],"node":{"type":"block","id":"rDzmNUJ8tgsZqEwXgKUf2","margin":"","name":"root","content":[{"type":"para","id":"u-YjycmSre7LUdaxk_WYL","margin":"","location":{"start":{"line":1,"column":1,"offset":0},"end":{"line":1,"column":452,"offset":451}},"text":"text","content":[{"meta":"https://github.com/tbrowder/AlgorithmsIT/actions","type":"fcode","name":"L","content":[{"type":"block","id":"2wCLwSnO-Hf3v3fKJurCR","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":2,"offset":1},"end":{"line":1,"column":99,"offset":98}},"content":[{"type":"image","src":"https://github.com/tbrowder/AlgorithmsIT/actions/workflows/linux.yml/badge.svg","alt":"Actions Status"}]}]}," ",{"meta":"https://github.com/tbrowder/AlgorithmsIT/actions","type":"fcode","name":"L","content":[{"type":"block","id":"vKlQHvkVblQE3o2JBNG05","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":152,"offset":151},"end":{"line":1,"column":249,"offset":248}},"content":[{"type":"image","src":"https://github.com/tbrowder/AlgorithmsIT/actions/workflows/macos.yml/badge.svg","alt":"Actions Status"}]}]}," ",{"meta":"https://github.com/tbrowder/AlgorithmsIT/actions","type":"fcode","name":"L","content":[{"type":"block","id":"2GHck4cNErkBqthDXXxnk","margin":"","name":"Image","config":[],"location":{"start":{"line":1,"column":302,"offset":301},"end":{"line":1,"column":401,"offset":400}},"content":[{"type":"image","src":"https://github.com/tbrowder/AlgorithmsIT/actions/workflows/windows.yml/badge.svg","alt":"Actions Status"}]}]}]},{"type":"block","id":"Sjb075OyGD4PgqDdzR65Q","margin":"","level":1,"name":"head","location":{"start":{"line":3,"column":1,"offset":453},"end":{"line":3,"column":7,"offset":459}},"content":["NAME"]},{"type":"para","id":"M0pAb5OGW_26cHt4P0y_C","margin":"","location":{"start":{"line":5,"column":1,"offset":461},"end":{"line":5,"column":92,"offset":552}},"text":"text","content":[{"type":"fcode","name":"B","content":["AlgorithmsIT"]}," - Provides some functions from ",{"type":"fcode","name":"I","content":["Introduction to Algorithms"]},", Third Edition"]},{"type":"block","id":"KxkN0fBxXxSEeqMzx63k7","margin":"","level":1,"name":"head","location":{"start":{"line":7,"column":1,"offset":554},"end":{"line":7,"column":11,"offset":564}},"content":["SYNOPSIS"]},{"type":"block","id":"-6R3qdN4wv1K401uWTgIQ","margin":"","name":"code","config":[{"name":"lang","value":"raku","type":"string"}],"location":{"start":{"line":9,"column":1,"offset":566},"end":{"line":19,"column":4,"offset":994}},"content":[{"type":"verbatim","value":"use AlgorithmsIT :ALL;\nuse Classes;\nmy $P = ArrayOneBased.new: \"pattern\";\nmy $T = ArrayOneBased.new: \"some text with pattern in it (or not)\";\nmy $pi = ArrayOneBased.new: 1, $T.length; # creates an array: [1, 2, ..., $T.length]\nmy @matches = KMP-Matcher $T, $P;\nsay @matches.gist;\n# OUTPUT: «[15]␤» # 15 shifts from the first character to the match position\n# The @matches array would be empty if no match were found."}]},{"type":"block","id":"74Lk-iZPUj1bFqnqt9L_V","margin":"","level":1,"name":"head","location":{"start":{"line":21,"column":1,"offset":996},"end":{"line":21,"column":14,"offset":1009}},"content":["DESCRIPTION"]},{"type":"para","id":"IKspfBUGahbL1ASkRRMAB","margin":"","location":{"start":{"line":23,"column":1,"offset":1011},"end":{"line":23,"column":80,"offset":1090}},"text":"text","content":[{"type":"fcode","name":"B","content":["AlgorithmsIT"]}," is a collection of a small subset of functions in Reference 1."]},{"type":"para","id":"-uoX8vgI48uHliVHH3IjI","margin":"","location":{"start":{"line":25,"column":1,"offset":1092},"end":{"line":25,"column":48,"offset":1139}},"text":"text","content":["See more details at ",{"meta":"./FUNCTIONS.md","type":"fcode","name":"L","content":["FUNCTIONS"]}]},{"type":"block","id":"05_TdC9VAXpnF8lVh2ldw","margin":"","level":1,"name":"head","location":{"start":{"line":27,"column":1,"offset":1141},"end":{"line":27,"column":10,"offset":1150}},"content":["Credits"]},{"type":"para","id":"WEssf_D6_Mmu6VrHD5h8i","margin":"","location":{"start":{"line":29,"column":1,"offset":1152},"end":{"line":29,"column":163,"offset":1314}},"text":"text","content":["Thanks to my Raku friend, '@tonyo' (on IRC #raku), for his help with the ",{"type":"fcode","name":"B","content":["ArrayOneBased"]}," class. See his many Raku contributions at ",{"type":"fcode","name":"C","content":["https://github.com/tony-o/"]},"."]},{"type":"block","id":"R9BPncwlBg_yySDQ0sGDn","margin":"","level":1,"name":"head","location":{"start":{"line":31,"column":1,"offset":1316},"end":{"line":31,"column":13,"offset":1328}},"content":["References"]},{"type":"block","id":"fu6ibsx1paTn7QcHKmGGS","margin":"","level":4,"name":"head","location":{"start":{"line":33,"column":1,"offset":1330},"end":{"line":33,"column":95,"offset":1424}},"content":["1. Thomas H. Cormen, et alii, ",{"type":"fcode","name":"I","content":["Introduction to Algorithms"]},", Third Edition, February 2009."]},{"type":"block","id":"f_v9u3mHBnzk8GUibAs6j","margin":"","level":1,"name":"head","location":{"start":{"line":35,"column":1,"offset":1426},"end":{"line":35,"column":9,"offset":1434}},"content":["AUTHOR"]},{"type":"para","id":"pilQGWeOJwW15zeKJb6Vw","margin":"","location":{"start":{"line":37,"column":1,"offset":1436},"end":{"line":37,"column":31,"offset":1466}},"text":"text","content":["Tom Browder ",{"meta":"mailto:tbrowder@acm.org","type":"fcode","name":"L","content":["tbrowder@acm.org"]}]},{"type":"block","id":"qyhaVPVC04coJxAOctLTi","margin":"","level":1,"name":"head","location":{"start":{"line":39,"column":1,"offset":1468},"end":{"line":39,"column":24,"offset":1491}},"content":["COPYRIGHT AND LICENSE"]},{"type":"para","id":"-GDr0rDbuQhfNia0tGT3V","margin":"","location":{"start":{"line":41,"column":1,"offset":1493},"end":{"line":41,"column":19,"offset":1511}},"text":"text","content":["© 2023 Tom Browder"]},{"type":"para","id":"tjWJiwBiqYKFmlBIIOU4a","margin":"","location":{"start":{"line":43,"column":1,"offset":1513},"end":{"line":43,"column":100,"offset":1612}},"text":"text","content":["This library is free software; you may redistribute it or modify it under the Artistic License 2.0."]}]},"publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/README.md","pluginsData":{"moduleInfo":{"meta":{"api":"","auth":"zef:tbrowder","authors":["Tom Browder"],"build-depends":[],"depends":[],"description":"Provides some functions from 'Introduction to Algorithms', Third Edition","dist":"AlgorithmsIT:ver<0.0.1>:auth<zef:tbrowder>","license":"Artistic-2.0","name":"AlgorithmsIT","path":"A/LG/ALGORITHMSIT/b7c1ca130394dd74c09c60af7905be4a2acc5598.tar.gz","perl":"6.d","provides":{"AlgorithmsIT":"lib/AlgorithmsIT.rakumod","Classes":"lib/Classes.rakumod"},"resources":[],"source-url":"https://github.com/tbrowder/AlgorithmsIT.git","tags":["algorithm pattern match string text"],"test-depends":[],"version":"0.0.1"},"files":[{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/README.md","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/README.md"},{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/FUNCTIONS.md","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/FUNCTIONS.md"},{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/docs/FUNCTIONS.rakudoc","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/docs/FUNCTIONS.rakudoc"},{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/docs/README.rakudoc","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/docs/README.rakudoc"},{"file":"work_mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/lib/AlgorithmsIT.rakumod","publishUrl":"/mods/zef/AlgorithmsIT/AlgorithmsIT-0.0.1/lib/AlgorithmsIT.rakumod"}],"src":"zef","url":"/mods/zef/AlgorithmsIT"}}}
    =end data
    =end React


AlgorithmsIT


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


allow-no

NAME

SYNOPSIS

DESCRIPTION

AUTHOR

COPYRIGHT AND LICENSE

allow-no v0.0.1

Authors

License

Dependencies

Test Dependencies

Provides

Documentation