From ae8d0791777e9ff3e43569089ddd446b666ac626 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Thu, 11 Feb 2021 14:58:27 -0500 Subject: Allow a left argument to Scan (`) --- docs/spec/primitive.html | 1 + 1 file changed, 1 insertion(+) (limited to 'docs/spec') diff --git a/docs/spec/primitive.html b/docs/spec/primitive.html index 74fb79d1..8f0dba65 100644 --- a/docs/spec/primitive.html +++ b/docs/spec/primitive.html @@ -113,6 +113,7 @@

Depth () is nearly a generalization of Each: ¨ is equivalent to ¯1, except that ¯1 doesn't enclose its result if all arguments are atoms. The list given by the right operand specifies how deeply to recurse into the arguments. A negative number -n means to recurse n times or until the argument is an atom, while a positive number n means to recurse until the argument has depth n or less. Recursion continues until all arguments have met the criterion for stopping. This recursion is guaranteed to stop because arrays are immutable, and form an inductive type.

Rank () applies the left operand to cells of the arguments of the specified ranks, forming a result whose cells are the results. Cells (˘) is identical to ¯1, and applies to major cells of the arguments, where a value of rank less than 1 is considered its own major cell. All results must have the same shape, as with elements of the argument to Merge (>). The combined result is always an array, but results of the left operand can be atoms: an atom result will be enclosed to give a 0-cell. If a specified rank is a natural number n, Rank applies the operand to n-cells of the corresponding argument, or the entire argument if it has rank less than or equal to n. If instead it's a negative integer -n, then an effective rank of 0k-n is used, so that the entire argument is used exactly when k=0. Thus an atom will always be passed unchanged to the operand; in particular, Rank does not enclose it. Like Each, Rank matches cells of its arguments according to leading axis agreement, so that a cell of one argument might be paired with multiple cells of the other.

Fold (´), Insert (˝), and Scan (`) repeatedly apply a function between parts of an array. Fold requires the argument to have rank 1 and applies the operand between its elements, while Insert requires it to have rank 1 or more and applies it between the cells. For each of these two functions, the operand is applied beginning at the end of the array, and an identity value is returned if the array is empty. While these functions reduce multiple values to a single result, Scan returns many results and preserves the shape of its argument. It requires the argument to have rank at least 1, and applies the function between elements along columns—that is, from one element in a major cell to the one in the same position of the next major cell. This application begins at the first major cell of the array. Scan never uses the identity element of its operand because if the argument is empty then the result, which has the same shape, will be empty as well.

+

A left argument for any of the three reduction-based modifiers indicates an initial value to be used, so that the first application of the operand function applies not to two values from 𝕩 but instead to a value from 𝕨 and a value from 𝕩. In Fold and Insert, the entire value 𝕨 is the initial value, while in Scan, 𝕨 is an array of initial values, which must have shape 1↓≢𝕩.

Repeat () applies the operand function, or its inverse, several times in sequence. The right operand must consist only of integer atoms (arranged in arrays of any depth), and each number there is replaced with the application of the left operand that many times to the arguments. If a left argument is present, then it's reused each time, as if it were bound to the operand function. For a negative number -n, the function is "applied" -n times by undoing it n times. In both directions, the total number of times the function is applied is the maximum of all numbers present: results must be saved if intermediate values are needed.

Restructuring

Enclose (<) forms a unit array that contains its argument.

-- cgit v1.2.3