From d52e68535a2a3af69cd9aa24796d2cdcd18aaa58 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Fri, 16 Jul 2021 22:31:30 -0400 Subject: Documentation for Find --- docs/doc/primitive.html | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'docs/doc/primitive.html') diff --git a/docs/doc/primitive.html b/docs/doc/primitive.html index 84bd38b3..56b8a1a3 100644 --- a/docs/doc/primitive.html +++ b/docs/doc/primitive.html @@ -9,7 +9,7 @@

Primitives have no side effects other than errors, and can't perform infinite computations, except when a primitive modifier calls an operand function that does one of these things (this can only happen when arguments are passed, as primitive modifiers are always deferred). Side effects here include both writing state such as variables or printed output, and reading any outside state, so that a function without them always returns the same result if passed the same arguments. Since trains and list notation have the same nice properties, tacit code written entirely with primitives, trains, and lists always describes finite, self-contained computations.

Recursion is the primary way to perform potentially infinite computations in BQN, and it can be packaged into control structures like While for ease of use. A given BQN implementation might also provide system values for "impure" tasks like file access or other I/O.

Functions

-

Functions that have significant differences from APL functions are marked with an asterisk. A few of the non-asterisk links go the the APL Wiki currently.

+

Functions that have significant differences from APL equivalents or don't appear in APL are marked with an asterisk.

@@ -222,7 +222,7 @@ - + -- cgit v1.2.3
⍷ DeduplicateFindFind
⊔