From ad582b5ef4184e26be86ef61be60c28e90b0bb7d Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Tue, 2 Feb 2021 22:04:48 -0500 Subject: Documentation for Match, and atom equality --- tutorial/combinator.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'tutorial/combinator.md') diff --git a/tutorial/combinator.md b/tutorial/combinator.md index c4f523d7..6dac8f3e 100644 --- a/tutorial/combinator.md +++ b/tutorial/combinator.md @@ -303,8 +303,8 @@ Glyph | 1 arg | 2 args `=` | Rank | Equals `≤` | | Less Than or Equal to `≥` | | Greater Than or Equal to -`≡` | [Depth](../doc/depth.md) | Match -`≢` | | Not Match +`≡` | [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. -- cgit v1.2.3