Difference between revisions of "Array Predicates"

From NARS2000
Jump to navigationJump to search
Line 5: Line 5:
 
== Permutation Vectors ==
 
== Permutation Vectors ==
  
<p>In this case, index generator (<apll>⍳S</apll>) produces a Permutation Vector, as do the grade primitives (<apll>⍋V</apll> and <apll>⍒V</apll>), as well as deal (<apll>L?R</apll>) when the left and right arguments are the same &mdash; the results of these primitives are marked internally as Permutation Vectors.  Subsequent use of such arrays maintains that property when operated on by rotate/reversal (<apll>L⌽PV</apll> and <apll>⌽PV</apll>) and grade up/down.  Moreover, the two grade (<apll>⍋PV</apll> and <apll>⍒PV</apll>) and the index of (<apll>PV⍳R</apll>) and membership (<apll>L∊PV</apll>) primitives use a much faster (linear) algorithm than they would normally, given that the appropriate argument is a Permutation Vector.</p>
+
<p>In this case, index generator (<apll>⍳S</apll>) produces a Permutation Vector, as do the grade primitives (<apll>⍋V</apll> and <apll>⍒V</apll>), as well as deal (<apll>L?R</apll>) when the left and right arguments are the same &mdash; the results of these primitives are marked internally as Permutation Vectors.  Subsequent use of such arrays maintains that property when operated on by rotate/reversal (<apll>L⌽PV</apll> and <apll>⌽PV</apll>).  Moreover, the two grade (<apll>⍋PV</apll> and <apll>⍒PV</apll>) and the index of (<apll>PV⍳R</apll>) and membership (<apll>L∊PV</apll>) primitives use a much faster (linear) algorithm than they would normally, given that the lookup argument is a Permutation Vector.</p>
  
 
<p>In summary,</p>
 
<p>In summary,</p>
  
<p>Set The bit:  <apll>⍳S</apll>, <apll>⍋V</apll>, <apll>⍒V</apll>, and <apll>R?R</apll>.</p>
+
<p>Set the bit in the result:  <apll>⍳S</apll>, <apll>⍋V</apll>, <apll>⍒V</apll>, and <apll>R?R</apll>.</p>
  
<p>Pass on the bit:  <apll>⍋V</apll>, <apll>⍒V</apll>, <apll>L⌽PV</apll>, and <apll>⌽PV</apll>.</p>
+
<p>Pass on the bit:  <apll>L⌽PV</apll> and <apll>⌽PV</apll>.</p>
  
<p>Read and take advantage of the bit:  <apll>⍋V</apll>, <apll>⍒V</apll>, <apll>PV⍳R</apll>, and <apll>L∊PV</apll>.</p>
+
<p>Read and take advantage of the bit:  <apll>⍋PV</apll>, <apll>⍒PV</apll>, <apll>PV⍳R</apll>, and <apll>L∊PV</apll>.</p>
 +
 
 +
== Example ==
 +
 
 +
<p>In the common expression <apll>⍋⍋R</apll>, the right hand grade sets the bit and the left hand grade reads it and uses a linear algorithm to produce the result.</p>

Revision as of 20:41, 21 September 2010

This clever idea of Bob Bernecky's [1] provides a performance improvement for certain expressions by marking certain arrays with special properties. For example, the property of being a Permutation Vector [2] is invariant (is still a Permutation Vector, albeit a different one) under various APL primitives such as rotate/reversal (L⌽PV and ⌽PV) and grade up/down (⍋PV and ⍒PV).

Bernecky has defined several array predicate properties, one of which has been implemented in NARS so far.

Permutation Vectors

In this case, index generator (⍳S) produces a Permutation Vector, as do the grade primitives (⍋V and ⍒V), as well as deal (L?R) when the left and right arguments are the same — the results of these primitives are marked internally as Permutation Vectors. Subsequent use of such arrays maintains that property when operated on by rotate/reversal (L⌽PV and ⌽PV). Moreover, the two grade (⍋PV and ⍒PV) and the index of (PV⍳R) and membership (L∊PV) primitives use a much faster (linear) algorithm than they would normally, given that the lookup argument is a Permutation Vector.

In summary,

Set the bit in the result: ⍳S, ⍋V, ⍒V, and R?R.

Pass on the bit: L⌽PV and ⌽PV.

Read and take advantage of the bit: ⍋PV, ⍒PV, PV⍳R, and L∊PV.

Example

In the common expression ⍋⍋R, the right hand grade sets the bit and the left hand grade reads it and uses a linear algorithm to produce the result.