From 60d51c85dd306989e919e91e37d9b94fe60411c2 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sat, 22 Aug 2020 09:47:16 -0400 Subject: Add REPL links to documentation code blocks --- docs/doc/windows.html | 22 +++++++++++----------- 1 file changed, 11 insertions(+), 11 deletions(-) (limited to 'docs/doc/windows.html') diff --git a/docs/doc/windows.html b/docs/doc/windows.html index 7a8bb76d..41923fa6 100644 --- a/docs/doc/windows.html +++ b/docs/doc/windows.html @@ -5,7 +5,7 @@

The Window function replaces APL's Windowed Reduction, J's more general Infix operator, and Dyalog's Stencil, which is adapted from one case of J's Cut operator.

Definition

We'll start with the one-axis case. Here Window's left argument is a number between 0 and 1+≠𝕩. The result is composed of slices of 𝕩 (contiguous sections of major cells) with length 𝕨, starting at each possible index in order.

-
    5↕"abcdefg"
+↗️
    5↕"abcdefg"
 β”Œβ”€       
 β•΅"abcde  
   bcdef  
@@ -14,7 +14,7 @@
 

 
There are 1+(≠𝕩)-𝕨, or (≠𝕩)¬𝕨, of these sections, because the starting index must be at least 0 and at most (≠𝕩)-𝕨. Another way to find this result is to look at the number of cells in or before a given slice: there are always 𝕨 in the slice and there are only ≠𝕩 in total, so the number of slices is the range spanned by these two endpoints.

 
You can take a slice of an array 𝕩 that has length l and starts at index i using l↑i↓𝕩 or l↑iβŒ½π•©. The Prefixes function returns all the slices that end at the end of the array ((≠𝕩)=i+l), and Suffixes gives the slices that start at the beginning (i=0). Windows gives yet another collection of slices: the ones that have a fixed length l=𝕨. Selecting one cell from its result gives you the slice starting at that cell's index:

-
    2⊏5↕"abcdefg"
+↗️
    2⊏5↕"abcdefg"
 "cdefg"
     5↑2↓"abcdefg"
 "cdefg"
@@ -22,7 +22,7 @@
 
Windows differs from Prefixes and Suffixes in that it doesn't add a layer of nesting (it doesn't enclose each slice). This is possible because the slices have a fixed size.

 
Multiple dimensions

 
The above description applies to a higher-rank right argument. As an example, we'll look at two-row slices of a shape 3β€Ώ4 array. For convenience, we will enclose each slice. Note that slices always have the same rank as the argument array.

-
    <βŽ‰2 2↕"0123"∾"abcd"≍"ABCD"
+↗️
    <βŽ‰2 2↕"0123"∾"abcd"≍"ABCD"
 β”Œβ”€                   
 Β· β”Œβ”€       β”Œβ”€        
   β•΅"0123   β•΅"abcd    
@@ -31,7 +31,7 @@
                     β”˜
 

 
Passing a list as the left argument to Windows takes slices along any number of leading axes. Here are all the shape 2β€Ώ2 slices:

-
    <βŽ‰2 2β€Ώ2↕"0123"∾"abcd"≍"ABCD"
+↗️
    <βŽ‰2 2β€Ώ2↕"0123"∾"abcd"≍"ABCD"
 β”Œβ”€                      
 β•΅ β”Œβ”€     β”Œβ”€     β”Œβ”€      
   β•΅"01   β•΅"12   β•΅"23    
@@ -50,7 +50,7 @@
 
Using Group we could also write iβŠ‘z ←→ π•©βŠ‘Λœ(π•¨βˆΎβ—‹(β†•βˆ˜β‰ )≒𝕩) +Β΄Β¨βˆ˜βŠ” i.

 
Symmetry

 
Let's look at an earlier example, along with its transpose.

-
    {βŸ¨π•©,β‰π•©βŸ©}5↕"abcdefg"
+↗️
    {βŸ¨π•©,β‰π•©βŸ©}5↕"abcdefg"
 β”Œβ”€                   
 Β· β”Œβ”€        β”Œβ”€       
   β•΅"abcde   β•΅"abc    
@@ -62,30 +62,30 @@
                     β”˜
 

 
Although the two arrays have different shapes, they are identical where they overlap.

-
    ≑○(3β€Ώ3βŠΈβ†‘)βŸœβ‰5↕"abcdefg"
+↗️
    ≑○(3β€Ώ3βŠΈβ†‘)βŸœβ‰5↕"abcdefg"
 1
 

 
In other words, the i'th element of slice j is the same as the j'th element of slice i: it is the i+j'th element of the argument. So transposing still gives a possible result of Windows, but with a different slice length.

-
    {(5↕𝕩)≑⍉(3↕𝕩)}"abcdefg"
+↗️
    {(5↕𝕩)≑⍉(3↕𝕩)}"abcdefg"
 1
 

 
In general, we need a more complicated transposeβ€”swapping the first set of ≠𝕨 axes with the second set. Note again the use of Span, our slice-length to slice-number converter.

-
    {((5β€Ώ6Β¬2β€Ώ2)↕𝕩) ≑ 2β€Ώ3⍉(2β€Ώ2↕𝕩)} ↕5β€Ώ6β€Ώ7
+↗️
    {((5β€Ώ6Β¬2β€Ώ2)↕𝕩) ≑ 2β€Ώ3⍉(2β€Ώ2↕𝕩)} ↕5β€Ώ6β€Ώ7
 1
 

 
Applications

 
Windows can be followed up with a reduction on each slice to give a windowed reduction. Here we take running sums of 3 values.

-
    +´˘3↕ ⟨2,6,0,1,4,3⟩
+↗️
    +´˘3↕ ⟨2,6,0,1,4,3⟩
 ⟨ 8 7 5 8 ⟩
 

 
A common task is to pair elements, with an initial or final element so the total length stays the same. This can also be done with a pairwise reduction, but another good way (and more performant without special support in the interpreter) is to add the element and then use windows matching the original length. Here both methods are used to invert +`, which requires we take pairwise differences starting at initial value 0.

-
    -˜´˘2↕0∾ +` 3β€Ώ2β€Ώ1β€Ώ1
+↗️
    -˜´˘2↕0∾ +` 3β€Ώ2β€Ώ1β€Ώ1
 ⟨ 3 2 1 1 ⟩
     (-ΛœΛβ‰ β†•0∾⊒) +` 3β€Ώ2β€Ώ1β€Ώ1
 ⟨ 3 2 1 1 ⟩
 

 
This method extends to any number of initial elements. We can modify the running sum above to keep the length constant by starting with two zeros.

-
    (+˝≠↕(2β₯Š0)⊸∾) ⟨2,6,0,1,4,3⟩
+↗️
    (+˝≠↕(2β₯Š0)⊸∾) ⟨2,6,0,1,4,3⟩
 ⟨ 2 8 8 7 5 8 ⟩
 

 
-- 
cgit v1.2.3