diff options
| author | Marshall Lochbaum <mwlochbaum@gmail.com> | 2020-06-09 16:00:12 -0400 |
|---|---|---|
| committer | Marshall Lochbaum <mwlochbaum@gmail.com> | 2020-06-09 16:00:34 -0400 |
| commit | 854bb370824a2f2b6c8008cb0460d42c4b0fae42 (patch) | |
| tree | fb0e554127c529a12562bb9fb326c526393b465b | |
| parent | 54409b681ad63ddeba6adc12d97b6a04e81fe7cb (diff) | |
Update FromDyalog page for new Group function
| -rw-r--r-- | FromDyalog.md | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/FromDyalog.md b/FromDyalog.md index 3ec2800f..f574b39c 100644 --- a/FromDyalog.md +++ b/FromDyalog.md @@ -9,10 +9,10 @@ Here are some closest equivalents in Dyalog APL for the BQN functions that don't | Monad | `*` | `*∘÷⍨` | `[⍋]` | `[⍒]` | `~` | `≢` | `⊂` | `↑` | `⍴` | `,` | `⊃,⌿` | `↑,⍥⊂` | | Dyad | | | `∧` | `∨` | `1+-` | `≠` | `<` | `>` | `≢` | `⍴` | `⍪` | | -| BQN | `↑` | `↓` | `↕` | `/` | `\` | `⍋` | `⍒` | `⊏` | `⊑` | `⊐` | `⊒` | `∊` | `⍷` | `⊔` | -|-------|------|---------|------|-----|-----|-----|-------|------|-----|-----|-----|-----|-----|-----| -| Monad | `,⍀` | `⌽,⌽⍀⌽` | `⍳` | `⍸` | | `⍋` | `⍒` | `⊣⌿` | `⊃` | | `…` | `≠` | | `⌸` | -| Dyad | `↑` | `↓` | `,⌿` | `⌿` | `⊆` | `⍸` | `⌽⍸⌽` | `⌷` | | `⍳` | `…` | `∊` | `⍷` | | +| BQN | `↑` | `↓` | `↕` | `/` | `⍋` | `⍒` | `⊏` | `⊑` | `⊐` | `⊒` | `∊` | `⍷` | `⊔` | +|-------|------|---------|------|-----|-----|-------|------|-----|-----|-----|-----|-----|------------| +| Monad | `,⍀` | `⌽,⌽⍀⌽` | `⍳` | `⍸` | `⍋` | `⍒` | `⊣⌿` | `⊃` | | `…` | `≠` | | `⌸` or `⊆` | +| Dyad | `↑` | `↓` | `,⌿` | `⌿` | `⍸` | `⌽⍸⌽` | `⌷` | | `⍳` | `…` | `∊` | `⍷` | | Modifiers and combinators are a little harder. Many have equivalents in some cases, but Dyalog sometimes chooses different functionality based on whether the operand is an array. In BQN an array is always treated as a constant function. @@ -42,8 +42,8 @@ The tables below give approximate implementations of Dyalog primitives for the o <tr><td> <code>⍪</code> </td><td> <code>∾˘</code> </td><td> <code>∾</code></td> </tr> <tr><td> <code>↑</code> </td><td> <code>></code> </td><td> <code>↑</code></td> </tr> <tr><td> <code>↓</code> </td><td> <code><˘<code> </td> <td> <code>↑</code></td> </tr> -<tr><td> <code>⊂</code> </td><td> <code><<code> </td> <td> <code>\</code></td> </tr> -<tr><td> <code>⊆</code> </td><td> <code><⍟(0<≡)<code> </td> <td> <code>\</code></td> </tr> +<tr><td> <code>⊂</code> </td><td> <code><<code> </td> <td> <code>+`⊸⊔</code></td> </tr> +<tr><td> <code>⊆</code> </td><td> <code><⍟(0<≡)<code> </td> <td> <code>⊔</code></td> </tr> <tr><td> <code>∊</code> </td><td> <code>{0=≡𝕩:⥊𝕩⋄∾⥊∇¨𝕩}</code> </td><td> <code>∊</code></td> </tr> <tr><td> <code>⊃</code> </td><td colspan=2><code>⊑</code></td> </tr> <tr><td> <code>⍀</code> </td><td> </td> <td> <code>/⁼</code></td> </tr> @@ -80,7 +80,7 @@ The tables below give approximate implementations of Dyalog primitives for the o <tr><td> <code>f⍥g</code> </td><td colspan=2> <code>f○g</code> </td></tr> <tr><td> <code>f@v</code> </td><td colspan=2> <code>f⌾(v⊸⊏)</code> </td></tr> <tr><td> <code>f⍠B</code> </td><td colspan=2> Uh </td></tr> -<tr><td> <code>f⌸</code> </td><td colspan=2> <code>⊔</code> </td></tr> +<tr><td> <code>f⌸</code> </td><td><code>∪⊸⊐⊔↕∘≠</code></td><td><code>∪⊸⊐⊸⊔</code> </td></tr> <tr><td> <code>f⌺B</code> </td><td colspan=2> <code>↕</code> </td></tr> <tr><td> <code>A⌶</code> </td><td colspan=2> <code>•</code> </td></tr> <tr><td> <code>f&</code> </td><td colspan=2> Nothing yet </td></tr> |