3,056
edits
(→Primitives: Remove entries that are both experimental and deprecated, and unlink some entries) |
m (→Aggregating Modifiers: Link to the BQN Group, not K (not identical but much closer)) |
||
Line 249: | Line 249: | ||
| <code>\</code> || [[Scan]] || Reduce, but keep intermediate values | | <code>\</code> || [[Scan]] || Reduce, but keep intermediate values | ||
|- | |- | ||
| <code>⊕</code> || [[Group]] || Group elements of an array into buckets by index | | <code>⊕</code> || [[Group (BQN)|Group]] || Group elements of an array into buckets by index | ||
Takes a function and two arrays. | Takes a function and two arrays. | ||
The arrays must be the same <code>⧻ length.</code> | The arrays must be the same <code>⧻ length.</code> | ||
Line 275: | Line 275: | ||
If the function takes 0 or 1 arguments, then <code>⊜ partition</code> behaves like <code>≡ rows</code>. This is called iterating <code>⊜ partition.</code> | If the function takes 0 or 1 arguments, then <code>⊜ partition</code> behaves like <code>≡ rows</code>. This is called iterating <code>⊜ partition.</code> | ||
|} | |} | ||
==== Inversion Modifiers ==== | ==== Inversion Modifiers ==== | ||
Work with the inverses of functions | Work with the inverses of functions |