$ nix eval --expr 'let count = n: if n == 0 then 0 else 1 + count (n - 1); in count 10001'
I am willing to eat a shoe about this and be proven wrong. Both of these problems can be boiled down to "from one point spread in arbitrary directions." This can naively be done with stencil and power until it converges. Without accounting for solid blocks and going in all directions, it can be done as M ← 3@(4 4⋄) ⊢ 9 9⍴0 ⋄ {⍵⌈¯1+{⌈/,⍵}⌺3 3⊢⍵}⍣≡1 ⊢ M Nonetheless, I suspect doing this and also making sure solid blocks prevent spread are two things that cannot be done in an "APL-style" without a massive performance penalty. If you're able to find a solution that (1) works in large 3 dimensional arrays (16-by-128-by-16) and (2) is performant enough to not cause lag every time a torch is placed or water moves (dfns.cmpx should be at the bare minimum below 2E¯3), then please email me at last name dot first name at google mail dot com (My name is Kyle Croarkin). ↩︎
。业内人士推荐新收录的资料作为进阶阅读
you---you've been thinking about it longer and have，推荐阅读新收录的资料获取更多信息
It has a dead simple API and is easy to get up and running.，详情可参考新收录的资料