Constrained random points on a circle: Difference between revisions
Constrained random points on a circle (view source)
Revision as of 22:55, 19 April 2020
, 4 years ago→{{header|Raku}}: Fix-up some Perl6 -> Raku references
Thundergnat (talk | contribs) (→{{header|Raku}}: Fix-up some Perl6 -> Raku references) |
|||
Line 2,807:
This uses, among other things, a 0-based matrix rather than a hash, a <tt>given</tt> on the first line that allows us to print the final value of the matrix straight from its initial declaration, a <tt>for</tt> statement feeding a <tt>for</tt> statement modifier, a lambda that unpacks a single x-y argument into two variables, the functional form of pick rather than the method form, a quasi-list comprehension in the middle loop that filters each <tt>given</tt> with a <tt>when</tt>, precalculated squared limits so we don't have to take the square root, use of X- and X** to subtract and exponentiate both <tt>$x</tt> and <tt>$y</tt> in parallel.
After the <tt>given do</tt> has loaded up <tt>@matrix</tt> with our circle, the <tt>map</tt> on the first line substitutes a space for any undefined matrix element, and the extra space between elements is supplied by the stringification of the list value, performed by the prefix <tt>~</tt> operator, the unary equivalent of concatenation in
At this point you would be justified in concluding that we are completely mad. <tt>:-)</tt>
| |||