Difference between revisions of "Without"

From NARS2000
Jump to navigationJump to search
 
Line 28: Line 28:
 
<p>This feature is implemented by an internal magic function:</p>
 
<p>This feature is implemented by an internal magic function:</p>
  
<apll>&nbsp;&nbsp;&nbsp;&nbsp;{del}&nbsp;Z←L #DydTilde R</apll><br />
+
<apll><pre>
<apll>[1]&nbsp;&nbsp;&nbsp;Z←(~L∊R)/L</apll><br />
+
    ∇ Z←L #DydTilde R
<apll>&nbsp;&nbsp;&nbsp;&nbsp;{del}</apll>
+
[1]   Z←(~L∊R)/L
 +
    ∇</pre></apll>

Latest revision as of 23:25, 15 April 2018

Z←L~R returns a subset of L consisting of those elements in L which do not occur in R.
L is a scalar or vector, else signal RANK ERROR.
R is an arbitrary array.
Z is a vector identical to (~L∊R)/L.
The result is sensitive to ⎕CT.


This feature is implemented by an internal magic function:

    ∇ Z←L #DydTilde R
[1]   Z←(~L∊R)/L
    ∇