From 4cfeb0f2a9c040e85f67a8d78e8a40de68530e46 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Wed, 1 Jun 2022 16:06:28 -0400 Subject: Consistently use the name Reorder Axes, not dyadic Transpose --- docs/doc/rank.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'docs/doc/rank.html') diff --git a/docs/doc/rank.html b/docs/doc/rank.html index d030055d..23a5630e 100644 --- a/docs/doc/rank.html +++ b/docs/doc/rank.html @@ -281,7 +281,7 @@ Error: ⎉: Argument frames don't agree (2‿3‿5 ≡ ≢𝕨, 3‿4 ≡ ≢𝕩, common frame of 1 axes)

On the other hand, Rank doesn't care about the argument cell shapes—it leaves that up to the function 𝔽. If 𝔽 is an arithmetic function, you'll get two layers of prefix agreement: one outer matching with ⎉, and an inner one with 𝔽.

-

It's also possible to apply multiple copies of Rank, which in general is powerful enough to match and not-match axes in any combination as long as the axes for each argument stay in order (of course, BQN also provides the tools to reorder axes).

+

It's also possible to apply multiple copies of Rank, which in general is powerful enough to match and not-match axes in any combination as long as the axes for each argument stay in order (of course, BQN also provides the tools to reorder axes).

One of the relatively more common instance of this pattern is a variation on the Table modifier, to work with cells instead of elements. Here we'll make a table of all combinations of one row (1-cell) from 𝕨 and one from 𝕩. To do this, we want to first line up each row of 𝕨 with the whole of 𝕩. As in a matrix product, that's ⎉1‿∞. But then we'd like to pair that row with the rows of 𝕩 individually, which could be written ⎉∞‿1. But since we know the left argument has been reduced to lists, ⎉1 also works. We then arrange the two layers of mapping with ⎉1 on the inside, giving (∾⎉1)⎉1‿∞.

↗️
    ("abc"≍"def") ∾⎉1⎉1‿∞ >"QR"‿"ST"‿"UV"
 ┌─       
-- 
cgit v1.2.3