From f910f64594053011efd57a97100ad19ee1e39fb4 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sun, 20 Sep 2020 13:50:30 -0400 Subject: Use "unit" or "rank-0" instead of "scalar" --- docs/doc/transpose.html | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'docs/doc/transpose.html') diff --git a/docs/doc/transpose.html b/docs/doc/transpose.html index 455a8488..96371227 100644 --- a/docs/doc/transpose.html +++ b/docs/doc/transpose.html @@ -87,7 +87,7 @@

Finally, it's worth noting that, as monadic Transpose moves the first axis to the end, it's equivalent to dyadic Transpose with a "default" left argument: (=-1˙)⊸⍉.

Definitions

Here we define the two valences of Transpose more precisely.

-

Monadic transpose is identical to (=-1˙)⊸⍉, except that for scalar arguments (including atoms) it returns the array unchanged rather than giving an error.

-

An atom right argument to dyadic Transpose is always enclosed to get a scalar array before doing anything else.

+

Monadic transpose is identical to (=-1˙)⊸⍉, except that if the argument is a unit it is returned unchanged rather than giving an error.

+

An atom right argument to dyadic Transpose is always enclosed to get an array before doing anything else.

In dyadic Transpose, the left argument is a number or numeric array of rank 1 or less, and 𝕨≤○≠≢𝕩. Define the result rank r←(=𝕩)-+´¬∊𝕨 to be the argument rank minus the number of duplicate entries in the left argument. We require ∧´𝕨<r. Bring 𝕨 to full length by appending the missing indices: 𝕨∾↩𝕨(¬∘∊˜/⊢)↕r. Now the result shape is defined to be ⌊´¨𝕨⊔≢𝕩. Element i⊑z of the result z is element (𝕨⊏i)⊑𝕩 of the argument.

-- cgit v1.2.3