From 78af096e176ab416d160a0bfeb9e6ffaaecec49d Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Wed, 21 Jul 2021 21:52:30 -0400 Subject: Low-stack iteration technique --- docs/doc/fromDyalog.html | 1 + 1 file changed, 1 insertion(+) (limited to 'docs/doc/fromDyalog.html') diff --git a/docs/doc/fromDyalog.html b/docs/doc/fromDyalog.html index fdafbf13..d213dbb5 100644 --- a/docs/doc/fromDyalog.html +++ b/docs/doc/fromDyalog.html @@ -274,6 +274,7 @@

In BQN is Rank and is Atop. Dyalog's Atop () and Over () were added in version 18.0.

For writing

The tables below give approximate implementations of Dyalog primitives for the ones that aren't the same. First- and last-axis pairs are also mostly omitted. BQN just has the first-axis form, and you can get the last-axis form with 1.

+

The form FG (Power with a function right operand; Power limit) must be implemented with recursion instead of primitives because it performs unbounded iteration. The modifier _while_ {𝔽𝔾𝔽_𝕣_𝔾𝔽𝔾𝕩} provides similar functionality without risk of stack overflow. It's discussed here and called as Fn _while_ Cond arg.

-- cgit v1.2.3
Functions
Glyph Monadic Dyadic