Index Generator: Difference between revisions

From NARS2000
Jump to navigationJump to search
No edit summary
No edit summary
Line 1: Line 1:
<ul>
<table border="1" cellpadding="5" cellspacing="0" rules="none" summary="">
   <li><p>Monadic iota (<apll>⍳R</apll>) is extended to negative right arguments, returning a vector of length <apll>|R</apll> whose values complement on the left the corresponding values from <apll>⍳|R</apll>.</p>
<tr>
 
  <td>
    <table border="0" cellpadding="5" cellspacing="0" summary="">
    <tr>
      <td><apll>Z←⍳R</apll></td>
      <td></td>
      <td></td>
      <td>returns a vector of consecutive ascending integers.</td>
    </tr>
    </table>
   </td>
</tr>
<tr>
  <td><apll>R</apll> is a negative integer scalar or one-element vector.</td>
</tr>
<tr>
  <td><apll>Z</apll> is an integer vector of length <apll>|R</apll>whose values range from <apll>⎕IO+R</apll> to <apll>⎕IO-1</apll>.</td>
</tr>
<tr>
  <td>This feature extends monadic iota to negative arguments.</td>
</tr>
</table>
<br />
<p>For example, in origin-0</p>
<p>For example, in origin-0</p>


Line 16: Line 37:


<apll>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;⍳¯3</apll><br />
<apll>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;⍳¯3</apll><br />
<apll>¯2 ¯1 0</apll></li>
<apll>¯2 ¯1 0</apll>
 
<p>This function is used to create [[APA|Arithmetic Progression Arrays (APAs)]].  For example, <apll>Z←2 3 4⍴⍳24</apll> has a very compact storage consisting of the array shape (<apll>2 3 4</apll>), the starting offset (<apll>⎕IO</apll>) and multiplier (<apll>1</apll>), plus the normal array overhead (which includes the number of elements (<apll>24</apll>)).</p>
 


  <li><p>Monadic iota (<apll>⍳R</apll>) is extended to length &gt; 1 vector right arguments, returning a nested array of shape <apll>R</apll> whose items are each integer vectors of length <apll>⍴⍴R</apll>.</p>


<table border="1" cellpadding="5" cellspacing="0" rules="none" summary="">
<tr>
  <td>
    <table border="0" cellpadding="5" cellspacing="0" summary="">
    <tr>
      <td><apll>Z←⍳R</apll></td>
      <td></td>
      <td></td>
      <td>returns an array of integer indices suitable for indexing all the elements of an array of shape <apll>|R</apll>.</td>
    </tr>
    </table>
  </td>
</tr>
<tr>
  <td><apll>R</apll> is an integer vector of length &gt; 1.</td>
</tr>
<tr>
  <td><apll>Z</apll> is a nested array of shape <apll>|R</apll> whose items are each integer vectors of length <apll>⍴⍴R</apll> and whose values range from <apll>⎕IO+R</apll> to <apll>(⍴R)⍴⎕IO-1</apll>.</td>
</tr>
<tr>
  <td>This feature extends monadic iota to multi-element vector arguments.</td>
</tr>
</table>
<br />
<p>For example, in origin-0</p>
<p>For example, in origin-0</p>


Line 40: Line 87:
<apll>&nbsp;2 ¯2&nbsp;&nbsp;2 ¯1&nbsp;&nbsp;2 0</apll>
<apll>&nbsp;2 ¯2&nbsp;&nbsp;2 ¯1&nbsp;&nbsp;2 0</apll>


<p>This extension is implemented via an internal magic function due to Carl M. Cheney:</p>
<p>In both of the above extensions it is always the case that, for an arbitrary array <apll>A</apll>, the following are all identical:  <apll>A</apll>, <apll>A[⍳⍴A]</apll>, <apll>A[⍳-⍴A]</apll>, and for that matter so is <apll>A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A]</apll>.</p>
 
 
 
<p>This last extension is implemented via an internal magic function due to Carl M. Cheney:</p>


<apll>&nbsp;&nbsp;&nbsp;&nbsp;∇&nbsp;Z←#MonIota V</apll><br />
<apll>&nbsp;&nbsp;&nbsp;&nbsp;∇&nbsp;Z←#MonIota V</apll><br />
<apll>[1]&nbsp;&nbsp;&nbsp;Z←⊃∘.,/⍳¨V</apll><br />
<apll>[1]&nbsp;&nbsp;&nbsp;Z←⊃∘.,/⍳¨V</apll><br />
<apll>&nbsp;&nbsp;&nbsp;&nbsp;∇</apll></li>
<apll>&nbsp;&nbsp;&nbsp;&nbsp;∇</apll>
</ul>

Revision as of 12:00, 13 April 2008

Z←⍳R returns a vector of consecutive ascending integers.
R is a negative integer scalar or one-element vector.
Z is an integer vector of length |Rwhose values range from ⎕IO+R to ⎕IO-1.
This feature extends monadic iota to negative arguments.


For example, in origin-0

      ⍳3
0 1 2

      ⍳¯3
¯3 ¯2 ¯1

and in origin-1

      ⍳3
1 2 3

      ⍳¯3
¯2 ¯1 0

This function is used to create Arithmetic Progression Arrays (APAs). For example, Z←2 3 4⍴⍳24 has a very compact storage consisting of the array shape (2 3 4), the starting offset (⎕IO) and multiplier (1), plus the normal array overhead (which includes the number of elements (24)).


Z←⍳R returns an array of integer indices suitable for indexing all the elements of an array of shape |R.
R is an integer vector of length > 1.
Z is a nested array of shape |R whose items are each integer vectors of length ⍴⍴R and whose values range from ⎕IO+R to (⍴R)⍴⎕IO-1.
This feature extends monadic iota to multi-element vector arguments.


For example, in origin-0

      ⍳2 3
 0 0  0 1  0 2
 1 0  1 1  1 2

      ⍳2 ¯3
 0 ¯3  0 ¯2  0 ¯1
 1 ¯3  1 ¯2  1 ¯1

and in origin-1

      ⍳2 3
 1 1  1 2  1 3
 2 1  2 2  2 3

      ⍳2 ¯3
 1 ¯2  1 ¯1  1 0
 2 ¯2  2 ¯1  2 0

In both of the above extensions it is always the case that, for an arbitrary array A, the following are all identical: A, A[⍳⍴A], A[⍳-⍴A], and for that matter so is A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A].


This last extension is implemented via an internal magic function due to Carl M. Cheney:

    ∇ Z←#MonIota V
[1]   Z←⊃∘.,/⍳¨V
    ∇