diff options
| author | Marshall Lochbaum <mwlochbaum@gmail.com> | 2021-07-05 21:43:35 -0400 |
|---|---|---|
| committer | Marshall Lochbaum <mwlochbaum@gmail.com> | 2021-07-05 21:43:35 -0400 |
| commit | 8063d547e0fc3d0e9d271bce79d357d61c2525bd (patch) | |
| tree | b578704ca69fcfab90982411821eb7402a750c9a /tutorial/combinator.md | |
| parent | 228e1b6d9d60eb885e5cda1b2c05048b253e140d (diff) | |
Tutorial documentation links
Diffstat (limited to 'tutorial/combinator.md')
| -rw-r--r-- | tutorial/combinator.md | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/tutorial/combinator.md b/tutorial/combinator.md index 6dac8f3e..77c77d8c 100644 --- a/tutorial/combinator.md +++ b/tutorial/combinator.md @@ -295,16 +295,16 @@ With the still-mysterious trains, this function could even be cleaned up more, r BQN has a full complement of comparison functions, which are pervasive (work on atoms only) like arithmetic functions. The non-pervasive functions Match (`≡`) and Not Match (`≢`) compare entire arrays. Comparison functions return `1` if the comparison holds and `0` if it doesn't; these two numbers make up the "booleans". -Glyph | 1 arg | 2 args -------|--------------------------|-------- -`<` | | Less Than -`>` | | Greater Than -`≠` | Length | Not Equals -`=` | Rank | Equals -`≤` | | Less Than or Equal to -`≥` | | Greater Than or Equal to -`≡` | [Depth](../doc/depth.md) | [Match](../doc/match.md) -`≢` | | [Not Match](../doc/match.md) +Glyph | 1 arg | 2 args +------|---------------------------|-------- +`<` | | [Less Than](../doc/arithmetic.md#comparisons) +`>` | | [Greater Than](../doc/arithmetic.md#comparisons) +`≠` | [Length](../doc/shape.md) | [Not Equals](../doc/arithmetic.md#comparisons) +`=` | [Rank](../doc/shape.md) | [Equals](../doc/arithmetic.md#comparisons) +`≤` | | [Less Than or Equal to](../doc/arithmetic.md#comparisons) +`≥` | | [Greater Than or Equal to](../doc/arithmetic.md#comparisons) +`≡` | [Depth](../doc/depth.md) | [Match](../doc/match.md) +`≢` | | [Not Match](../doc/match.md) A combinator is a function or modifier that produces its result from its inputs purely by applying functions to arguments, without introducing any external values. BQN's combinators can all be described with diagrams showing how arguments are passed through operands, with the result emerging at the top. The diagrams below define six combinators in BQN. |