**diff options**

-rw-r--r-- | table.tsv | 4 |

1 files changed, 2 insertions, 2 deletions

@@ -756,7 +756,6 @@ i0(|⟜↕⟜≠⊔⊢)y Distribute major cells of y into i0 groups round-robin (≠(«-⊢)/)b1 Changing starting indicators b1 of sublists to lengths Tacit Monadic Function Boolean/Logical partitions change converting conversion segments (≠(«-⊢)/)i1 Segment lengths given the number of segments that start at each position Tacit Monadic Function Data Conversion chunk start leading converting change changing segments partitions i0/⟜(≍⎉(-m0))y Create a new axis of y before axis m0, and replicate to length i0 Tacit Dyadic Function Structural copying repeating replicate replication add dimension increase incrementing rank by 1 one insertion inserting extending extension -(0⌈´(0⌈+)`)n1 Largest sum of any contiguous sublist Tacit Monadic Function Mathematical maximum subarray sublist sub-array sub-list sub-vector biggest highest kadane's kadanes algorithm x2(¯1⊑≠)⊸(↑˘)y2 Widen table y2 to be compatible with x2 Tacit Dyadic Function Structural adjust width table (××¯0.5⌈∘+|)n Round to nearest integer, ties towards 0 Tacit Monadic Function Mathematical precision favoring integer round() (××0.5⌊∘+|)n Round to nearest integer, ties away from 0 Tacit Monadic Function Mathematical precision favoring integer round() @@ -794,6 +793,7 @@ x(+´∧`∘⌽∘≠)y Count number of trailing elements that are unequal Tacit (100×÷⟜(+˝)˘)n Row-wise percentage per row Tacit Monadic Function Mathematical ≢ horizontally rowwise (⥊(↕2˘)/¨<)y Power set: a list of all subsets of the cells of y Tacit Monadic Function Sets powerset power-set all combinations choices at most one (⌈´(⊢⌈+)`)n1 Largest sum of any contiguous non-empty sublist Tacit Monadic Function Mathematical maximum subarray sublist sub-array sub-list sub-vector biggest highest kadane's kadanes algorithm +(0⌈´0(0⌈+)`⊢)n1 Largest sum of any contiguous sublist Tacit Monadic Function Mathematical maximum subarray sublist sub-array sub-list sub-vector biggest highest kadane's kadanes algorithm i0((+˝÷≠)⍉⁼)n Average (mean value) of elements of n along axis i0 Tacit Monadic Function Mathematical arithmeticmean() AM() avg() axis dimension cells items c1(⊣∾(@+10)∾⊢)d1 Join lines with line feed (LF) Tacit Dyadic Function Text combine glue 0x0A U+0A U+000A {⍋⍒2|↕≠𝕩}⊸⊏y Perfect Ripple Shuffle Tacit Function Structural faro weave dovetail zipper zipping merge merging interweave interweaving interleave interleaving shuffling meshing grade carddeck diversions riffleshuffle @@ -885,7 +885,7 @@ a1(1⌈·⌈`↕∘≠⊸×)⊸⊏y Copy each cell of y until before next 1 in a (⍉↕∘≠+˝∘×=⌜⟜1‿¯1)j2 Change connection matrix j2 (¯1 to 1) to a node matrix Tacit Monadic Function Mathematical graph connectivity table change converting conversion m1(+´¨+⌜○↕○≠⊔×⌜)n1 Product of polynomials (ascending or descending order) Tacit Dyadic Function Mathematical multiplicationof multiply times coefficients m1((√+´∘×˜)÷⟜2⊸∾)n0 Length of edges of rectangular pyramid with base dimensions m1 and height n0 Tacit Dyadic Function Mathematical lengths sides -i0(-÷○(×´)1⊸+)⟜↕˜j0 Number of unordered selections (combinations) of i0 items from j0 choices Tacit Dyadic Function Mathematical exclamation bang shriek binomial combinatorics countcombinations unordered selecting picking outof nCk C(n,k) +i0(-÷○(×´)1⊸+)⟜↕˜j0 Number of unordered selections (combinations) of i0 items from j0 choices Tacit Dyadic Function Mathematical exclamation bang shriek binomial combinatorics countcombinations choose unordered selecting picking outof nCk C(n,k) i(⊢/˜¬∘∊˜⟜(↕≠))y Remove major cells with indices i from y Tacit Dyadic Function Selection without remove indices delete drop x0((∨`∧∨⟜«)∘≠/⊢)y1 Remove leading, trailing and duplicate x0's Tacit Dyadic Function Selection trim left right spaces multiple consecutive blanks start beginning ending i0(⌊∘×⟜(↕⊸÷≠)⊔⊢)y Distribute major cells of y into i0 slices as evenly as possible Tacit Dyadic Function Structural unzip elements items deal |