From 6408f52bdb80b0b79191675481bf59739ec3ad5b Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sat, 5 Sep 2020 12:56:39 -0400 Subject: =?UTF-8?q?Prefer=20=CB=99=20to=20=CB=9C=20for=20constant=20functi?= =?UTF-8?q?ons?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- 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 c8b54b42..455a8488 100644 --- a/docs/doc/transpose.html +++ b/docs/doc/transpose.html @@ -84,10 +84,10 @@ ↗️
    ≢ 2 ⍉ a23456  # Restrict Transpose to the first three axes
 ⟨ 3 4 2 5 6 ⟩
-

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˜)⊸⍉.

+

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.

+

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.

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