From f469c6f9bd4c9cf3c2b8ce93c3f2331cdcdd589a Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Fri, 10 Jun 2022 22:42:44 -0400 Subject: More editing --- docs/doc/swap.html | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'docs/doc/swap.html') diff --git a/docs/doc/swap.html b/docs/doc/swap.html index 190b0d0a..409de900 100644 --- a/docs/doc/swap.html +++ b/docs/doc/swap.html @@ -54,8 +54,8 @@ -

Since ๐•ฉ is always the left argument, these two definitions can be unified as {๐•ฉ๐”ฝ๐•จโŠฃ๐•ฉ}, noting that Left becomes a plain identity function when the left argument ๐•จ isn't given.

-

Swap is arguably less transformative. Some common examples are -หœ and รทหœ, since these two functions run the wrong way for BQN's evaluation order. This is very often useful in tacit programming, and less useful for explicit code. While it sometimes allows for shorter code by making a pair of parentheses unnecessary (say, (aร—b)-c is c-หœaร—b), I personally don't think this is always a good idea. My opinion is that it should be used when it makes the semantics a better fit for BQN, but putting the primary argument on the right and a secondary or control argument on the left.

+

Since ๐•ฉ always becomes the left argument, these two definitions can be unified as {๐•ฉ๐”ฝ๐•จโŠฃ๐•ฉ}, noting that Left returns ๐•จ if it's given and ๐•ฉ if not.

+

Swap is arguably less transformative. Some common examples are -หœ and รทหœ, since these two functions run the wrong way for BQN's evaluation order. This is very often useful in tacit programming, and less needed for explicit code. While it sometimes allows for shorter code by making a pair of parentheses unnecessary (say, (aร—b)-c is c-หœaร—b), I personally don't think this is always a good idea. My opinion is that it should be used when it makes the semantics a better fit for BQN, but putting the primary argument on the right and a secondary or control argument on the left.

โ†—๏ธ
    'a' โ‹ˆหœ 'b'
 "ba"
 
@@ -65,7 +65,7 @@
   + + +" 
         โ”˜
-

Self re-uses one argument twice. In this way it's a little like Over, which re-uses one function twice. A common combination is with Table, โŒœหœ, so that the operand function is called on each combination of elements from the argument to form a square result. For example, =โŒœหœ applied to โ†•n gives the identity matrix of size n.

+

Moving on, Self re-uses one argument twice. In this way it's a little like Over, which re-uses one function twice. A common combination is with Table, โŒœหœ, so that the operand function is called on each combination of elements in ๐•ฉ to form a square result. For example, =โŒœหœ applied to โ†•n gives the identity matrix of size n.

โ†—๏ธ
    ร—หœ 4
 16
 
@@ -76,4 +76,4 @@
   0 0 1  
         โ”˜
-

Note that Self isn't needed with Before (โŠธ) and After (โŸœ), which essentially have a copy built in: for example FโŠธG ๐•ฉ is the same as FโŠธGหœ ๐•ฉ by definition.

+

Note that Self isn't needed with Before (โŠธ) and After (โŸœ), which essentially have a copy built in: for example FโŠธG ๐•ฉ is the same as FโŠธGหœ ๐•ฉ by definition.

-- cgit v1.2.3