Indexing - Revision history

Sudleyplace at 18:11, 30 June 2018

2018-06-30T18:11:23Z

← Older revision		Revision as of 14:11, 30 June 2018
Line 4:		Line 4:
	<table border="0" cellpadding="5" cellspacing="0" summary="">		<table border="0" cellpadding="5" cellspacing="0" summary="">
	<tr>		<tr>
	<td valign="top"><apll>Z←R[L]</apll>, <apll>R[L]←A</apll>, and <apll>R[L]<i>f</i>←A</apll></td>		<td valign="top"><apll>Z←R[L]</apll>,    <apll>R[L]←A</apll>,    and    <apll>R[L]<i>f</i>←A</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
Line 20:		Line 20:
	<tr>		<tr>
	<td><apll>A</apll> is an arbitrary array.</td>		<td><apll>A</apll> is an arbitrary array.</td>
			</tr>
			<tr>
			<td><apll><i>f</i></apll> is an arbitrary function.</td>
	</tr>		</tr>
	<tr>		<tr>
Line 41:		Line 44:
	</tr>		</tr>
	<tr>		<tr>
	<td>Both Reach and Scatter indexing may appear together within a single instance of <apll>R[L]</apll>, <apll>R[L]←A</apll>, and <apll>R[L]<i>f</i>←A</apll></td>		<td>Both Reach and Scatter indexing may appear together within a single instance of <apll>R[L]</apll>,    <apll>R[L]←A</apll>,    and    <apll>R[L]<i>f</i>←A</apll></td>
	</tr>		</tr>
	<tr>		<tr>
Line 62:		Line 65:
	<table border="0" cellpadding="5" cellspacing="0" summary="">		<table border="0" cellpadding="5" cellspacing="0" summary="">
	<tr>		<tr>
	<td valign="top"><apll>Z←R[L]</apll>, <apll>R[L]←A</apll>, <apll>R[L]<i>f</i>←A</apll>, <apll>~~L⌷R~~</apll>, <apll>L⍉R</apll>, and <apll>L⊃R</apll></td>		<td valign="top"><apll>Z←R[L]</apll>,    <apll>R[L]←A</apll>,    <apll>R[L]<i>f</i>←A</apll>,    <apll>L⌷[X] R</apll>,    <apll>L⍉R</apll>,    and    <apll>L⊃R</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
Line 74:		Line 77:
	</tr>		</tr>
	<tr>		<tr>
	<td>That is, if the largest allowed value for <apll>L</apll> is <apll>N</apll>, then the previous allowable range of values was <apll>⎕IO</apll> to <apll>N</apll>, inclusive. Now, the allowable range of values is <apll>1 ¯1[1]-N</apll> to <apll>N</apll>, inclusive. For example, <apll>A</apll>, <apll>A[⍳⍴A]</apll>, <apll>A[⍳-⍴A]</apll>, and even <apll>A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A]</apll> are all identical for any array <apll>A</apll> in either origin.<br />Also, <apll>A</apll>, <apll>(⍳⍴⍴A)⍉A</apll>, and <apll>(⍳-⍴⍴A)⍉A</apll> are all identical for any array <apll>A</apll> in either origin.</td>		<td>That is, if the largest allowed value for <apll>L</apll> is <apll>N</apll>, then the previous allowable range of values was <apll>⎕IO</apll> to <apll>N</apll>, inclusive. Now, the allowable range of values is <apll>1 ¯1[1]-N</apll> to <apll>N</apll>, inclusive. For example,    <apll>A</apll>,    <apll>A[⍳⍴A]</apll>,    <apll>A[⍳-⍴A]</apll>,    and even    <apll>A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A]</apll>    are all identical for any array <apll>A</apll> in either origin.<br />Also,    <apll>A</apll>,    <apll>(⍳⍴⍴A)⍉A</apll>,    and    <apll>(⍳-⍴⍴A)⍉A</apll>    are all identical for any array <apll>A</apll> in either origin.</td>
	</tr>		</tr>
	<tr>		<tr>

Sudleyplace at 22:41, 15 April 2018

2018-04-15T22:41:25Z

← Older revision		Revision as of 18:41, 15 April 2018
Line 50:		Line 50:
	<p>For example, in origin-1</p>		<p>For example, in origin-1</p>

	<apll>~~      ~~V←'123'(⊂4 5)~~</apll><br />~~		<apll><pre>
	~~<apll>      ~~V[1 (2 ⍬ 1)]~~</apll><br />~~		V←'123'(⊂4 5)
	~~<apll> ~~123 4~~</apll>~~		V[1 (2 ⍬ 1)]
			123 4
	~~<apll>      ~~M←2 2⍴(10 20) (30 40 'abc') 50 60~~<br />~~		M←2 2⍴(10 20) (30 40 'abc') 50 60
	~~      ~~M[(1 1)((1 2) 3)]~~<br />~~		M[(1 1)((1 2) 3)]
	~~ ~~10 20~~  ~~abc</apll>		10 20 abc</pre></apll>


	<table border="1" cellpadding="5" cellspacing="0" rules="none" summary="">		<table border="1" cellpadding="5" cellspacing="0" rules="none" summary="">
	<tr>		<tr>
Line 85:		Line 83:
	</tr>		</tr>
	<tr>		<tr>
	<td>These functions are sensitive to <apll>⎕IO</apll>.</td>		<td>These functions are sensitive to <apll>⎕IO</apll>. Negative indexing is available only when the first element of <apll>⎕FEATURE</apll> is set to <apll>1</apll>.</td>
	</tr>		</tr>
	</table>		</table>
Line 91:		Line 89:
	<p>For example, in origin-1</p>		<p>For example, in origin-1</p>

	<apll>~~      ~~V←'123'(⊂4 5)~~</apll><br />~~		<apll><pre>
	~~<apll>      ~~V[¯1 (0 ⍬ ¯1)]</~~apll><br />~~		⎕FEATURE[1]←1
	~~<apll~~>~~ 123 4~~</apll>		V←'123'(⊂4 5)
			V[¯1 (0 ⍬ ¯1)]
			123 4</pre></apll>

WikiSysop at 11:50, 9 October 2014

2014-10-09T11:50:56Z

← Older revision		Revision as of 07:50, 9 October 2014
Line 36:		Line 36:
	<tr>		<tr>
	<td></td>		<td></td>
	<td>If <apll>L⌷¨⊂R</apll> is valid, it is equivalent to <apll>⊂¨R[⊂¨L]</apll></td>		<td>if <apll>L⌷¨⊂R</apll> is valid, it is equivalent to <apll>⊂¨R[⊂¨L]</apll></td>
	</tr>		</tr>
	</table>		</table>

WikiSysop at 15:19, 2 October 2014

2014-10-02T15:19:31Z

← Older revision		Revision as of 11:19, 2 October 2014
Line 22:		Line 22:
	</tr>		</tr>
	<tr>		<tr>
	<td><b>Reach Indexing</b>: If <apll>L⊃R</apll> is valid, it is equivalent to <apll>⊃R[⊂L]</apll></td>		<td><table border="0" cellpadding="0" cellspacing="0" summary="">
	</tr>		<tr>
	<tr>		<td><b>Reach Indexing</b>:  </td>
	<td><b>Scatter Indexing</b>: If <apll>L⌷R</apll> is valid, it is equivalent to <apll>R[⊃∘.,/L]</apll></td>		<td>If <apll>L⊃R</apll> is valid, it is equivalent to <apll>⊃R[⊂L]</apll>, and</td>
			</tr>
			<tr>
			<td></td>
			<td>if <apll>L⊃¨⊂R</apll> is valid, it is equivalent to <apll>R[L]</apll></td>
			</tr>
			<tr>
			<td><b>Scatter Indexing</b>:  </td>
			<td>If <apll>L⌷R</apll> is valid, it is equivalent to <apll>R[⊃∘.,/L]</apll>, and</td>
			<tr>
			<td></td>
			<td>If <apll>L⌷¨⊂R</apll> is valid, it is equivalent to <apll>⊂¨R[⊂¨L]</apll></td>
			</tr>
			</table>
	</tr>		</tr>
	<tr>		<tr>

WikiSysop at 15:38, 26 May 2013

2013-05-26T15:38:27Z

← Older revision		Revision as of 11:38, 26 May 2013
Line 29:		Line 29:
	<tr>		<tr>
	<td>Both Reach and Scatter indexing may appear together within a single instance of <apll>R[L]</apll>, <apll>R[L]←A</apll>, and <apll>R[L]<i>f</i>←A</apll></td>		<td>Both Reach and Scatter indexing may appear together within a single instance of <apll>R[L]</apll>, <apll>R[L]←A</apll>, and <apll>R[L]<i>f</i>←A</apll></td>
			</tr>
			<tr>
			<td>These functions are sensitive to <apll>⎕IO</apll>.</td>
	</tr>		</tr>
	</table>		</table>
Line 67:		Line 70:
	<tr>		<tr>
	<td><apll>A</apll> is an arbitrary array.</td>		<td><apll>A</apll> is an arbitrary array.</td>
			</tr>
			<tr>
			<td>These functions are sensitive to <apll>⎕IO</apll>.</td>
	</tr>		</tr>
	</table>		</table>

WikiSysop at 14:12, 3 October 2009

2009-10-03T14:12:25Z

← Older revision		Revision as of 10:12, 3 October 2009
Line 37:		Line 37:
	<apll>      V[1 (2 ⍬ 1)]</apll><br />		<apll>      V[1 (2 ⍬ 1)]</apll><br />
	<apll> 123 4</apll>		<apll> 123 4</apll>

			<apll>      M←2 2⍴(10 20) (30 40 'abc') 50 60<br />
			M[(1 1)((1 2) 3)]<br />
			10 20  abc</apll>

WikiSysop at 18:54, 18 May 2009

2009-05-18T18:54:49Z

← Older revision		Revision as of 14:54, 18 May 2009
Line 53:		Line 53:
	</tr>		</tr>
	<tr>		<tr>
	<td>For all but transpose, <apll>L</apll> is a nested array of integer scalars and/or vectors, suitable for indexing <apll>R</apll>; for transpose, <apll>L</apll> is an integer scalar or vector of integers suitable for transposing <apll>R</apll>.</td>		<td>For all but transpose, <apll>L</apll> is a nested array of integer scalars and/or vectors, suitable for indexing <apll>R</apll>; for transpose, <apll>L</apll> is an integer scalar or vector of integers, suitable for transposing <apll>R</apll>.</td>
	</tr>		</tr>
	<tr>		<tr>
	<td>That is, if the largest allowed value for <apll>L</apll> is <apll>N</apll>, then the previous allowable range of values was <apll>⎕IO</apll> to <apll>N</apll>, inclusive. Now, the allowable range of values is <apll>1 ¯1[1]-N</apll> to <apll>N</apll>, inclusive. For example, <apll>A</apll>, <apll>A[⍳⍴A]</apll>, <apll>A[⍳-⍴A]</apll>, and even <apll>A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A]</apll> are all identical for any array <apll>A</apll> in either origin.<br />Also, <apll>A</apll>, <apll>(⍳⍴⍴A)⍉A</apll>, and <apll>(⍳-⍴⍴A)⍉A</apll> are identical for any array <apll>A</apll> in either origin.</td>		<td>That is, if the largest allowed value for <apll>L</apll> is <apll>N</apll>, then the previous allowable range of values was <apll>⎕IO</apll> to <apll>N</apll>, inclusive. Now, the allowable range of values is <apll>1 ¯1[1]-N</apll> to <apll>N</apll>, inclusive. For example, <apll>A</apll>, <apll>A[⍳⍴A]</apll>, <apll>A[⍳-⍴A]</apll>, and even <apll>A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A]</apll> are all identical for any array <apll>A</apll> in either origin.<br />Also, <apll>A</apll>, <apll>(⍳⍴⍴A)⍉A</apll>, and <apll>(⍳-⍴⍴A)⍉A</apll> are all identical for any array <apll>A</apll> in either origin.</td>
	</tr>		</tr>
	<tr>		<tr>

WikiSysop at 18:53, 18 May 2009

2009-05-18T18:53:15Z

← Older revision		Revision as of 14:53, 18 May 2009
Line 44:		Line 44:
	<table border="0" cellpadding="5" cellspacing="0" summary="">		<table border="0" cellpadding="5" cellspacing="0" summary="">
	<tr>		<tr>
	<td valign="top"><apll>Z←R[L]</apll>, <apll>R[L]←A</apll>, <apll>R[L]<i>f</i>←A</apll>, <apll>L⌷R</apll>, and <apll>L⊃R</apll></td>		<td valign="top"><apll>Z←R[L]</apll>, <apll>R[L]←A</apll>, <apll>R[L]<i>f</i>←A</apll>, <apll>L⌷R</apll>, <apll>L⍉R</apll>, and <apll>L⊃R</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
	<td>are all extended to allow negative ~~index~~ values.</td>		<td>are all extended to allow negative values in <apll>L</apll>.</td>
	</tr>		</tr>
	</table>		</table>
Line 53:		Line 53:
	</tr>		</tr>
	<tr>		<tr>
	<td><apll>L</apll> is a nested array of integer scalars and/or vectors, suitable for indexing <apll>R</apll>.</td>		<td>For all but transpose, <apll>L</apll> is a nested array of integer scalars and/or vectors, suitable for indexing <apll>R</apll>; for transpose, <apll>L</apll> is an integer scalar or vector of integers suitable for transposing <apll>R</apll>.</td>
	</tr>		</tr>
	<tr>		<tr>
	<td>That is, if the largest allowed ~~index~~ value is <apll>N</apll>, then the previous allowable range of values was <apll>⎕IO</apll> to <apll>N</apll>, inclusive. Now, the allowable range of values is <apll>1 ¯1[1]-N</apll> to <apll>N</apll>, inclusive. For example, <apll>A</apll>, <apll>A[⍳⍴A]</apll>, <apll>A[⍳-⍴A]</apll>, and even <apll>A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A]</apll> are all identical for any array <apll>A</apll> in either origin.</td>		<td>That is, if the largest allowed value for <apll>L</apll> is <apll>N</apll>, then the previous allowable range of values was <apll>⎕IO</apll> to <apll>N</apll>, inclusive. Now, the allowable range of values is <apll>1 ¯1[1]-N</apll> to <apll>N</apll>, inclusive. For example, <apll>A</apll>, <apll>A[⍳⍴A]</apll>, <apll>A[⍳-⍴A]</apll>, and even <apll>A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A]</apll> are all identical for any array <apll>A</apll> in either origin.<br />Also, <apll>A</apll>, <apll>(⍳⍴⍴A)⍉A</apll>, and <apll>(⍳-⍴⍴A)⍉A</apll> are identical for any array <apll>A</apll> in either origin.</td>
	</tr>		</tr>
	<tr>		<tr>

Sudleyplace at 01:22, 8 May 2008

2008-05-08T01:22:47Z

← Older revision		Revision as of 21:22, 7 May 2008
Line 4:		Line 4:
	<table border="0" cellpadding="5" cellspacing="0" summary="">		<table border="0" cellpadding="5" cellspacing="0" summary="">
	<tr>		<tr>
	<td><apll>Z←R[L]</apll>, <apll>R[L]←A</apll>, and <apll>R[L]<i>f</i>←A</apll></td>		<td valign="top"><apll>Z←R[L]</apll>, <apll>R[L]←A</apll>, and <apll>R[L]<i>f</i>←A</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
Line 44:		Line 44:
	<table border="0" cellpadding="5" cellspacing="0" summary="">		<table border="0" cellpadding="5" cellspacing="0" summary="">
	<tr>		<tr>
	<td><apll>Z←R[L]</apll>, <apll>R[L]←A</apll>, <apll>R[L]<i>f</i>←A</apll>, <apll>L⌷R</apll>, and <apll>L⊃R</apll></td>		<td valign="top"><apll>Z←R[L]</apll>, <apll>R[L]←A</apll>, <apll>R[L]<i>f</i>←A</apll>, <apll>L⌷R</apll>, and <apll>L⊃R</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>

Sudleyplace at 21:47, 14 April 2008

2008-04-14T21:47:28Z

← Older revision		Revision as of 17:47, 14 April 2008
Line 56:		Line 56:
	</tr>		</tr>
	<tr>		<tr>
	<td>That is, if the largest allowed index value is <apll>N</apll>, then the previous allowable range of values was <apll>⎕IO</apll> to <apll>N</apll>, inclusive. Now, the allowable range of values is <apll>1 ¯1[1]-N</apll> to <apll>N</apll>, inclusive. For example, <apll>A</apll>, <apll>A[⍳⍴A]</apll>, ~~and~~ <apll>A[⍳-⍴A]</apll> are all identical for any array <apll>A</apll> in either origin.</td>		<td>That is, if the largest allowed index value is <apll>N</apll>, then the previous allowable range of values was <apll>⎕IO</apll> to <apll>N</apll>, inclusive. Now, the allowable range of values is <apll>1 ¯1[1]-N</apll> to <apll>N</apll>, inclusive. For example, <apll>A</apll>, <apll>A[⍳⍴A]</apll>, <apll>A[⍳-⍴A]</apll>, and even <apll>A[⍳¯1 1[?(⍴⍴A)⍴2]×⍴A]</apll> are all identical for any array <apll>A</apll> in either origin.</td>
	</tr>		</tr>
	<tr>		<tr>