<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>9.2 Arrays</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="chunk.html#section.chunks.general"><< Prev</A></TD><TD><A href="node11.html">- Up -</A></TD><TD><A href="dictionary.html#section.chunks.dictionaries">Next >></A></TD></TR></TABLE><DIV id="section.chunks.arrays"><H2><A name="section.chunks.arrays">9.2 Arrays</A></H2><P> The module <A name="label506"></A><SPAN class="index"><CODE>Array</CODE></SPAN> contains procedures operating on arrays. Whenever an array access is indexed with an illegal key, an error exception is raised. </P><DL><DT><A name="label507"></A><SPAN class="index"><CODE>IsArray</CODE></SPAN> <A name="label509"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>is </CODE><CODE>+<I>X</I></CODE><CODE> </CODE><CODE>?<I>B</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>tests whether <CODE><I>X</I></CODE> is an array. </P></DD><DT><A name="label510"></A><SPAN class="index"><CODE>NewArray</CODE></SPAN> <A name="label512"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>new </CODE><CODE>+<I>LowI</I></CODE><CODE> </CODE><CODE>+<I>HighI</I></CODE><CODE> </CODE><CODE><I>InitX</I></CODE><CODE> </CODE><CODE>?<I>Array</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns a new array with key range from <CODE><I>LowI</I></CODE> to <CODE><I>HighI</I></CODE> including both. All items are initialized to <CODE><I>InitX</I></CODE>. </P></DD><DT><A name="label513"></A><SPAN class="index"><CODE>Put</CODE></SPAN> <A name="label514"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>put </CODE><CODE>+<I>Array</I></CODE><CODE> </CODE><CODE>+<I>I</I></CODE><CODE> </CODE><CODE><I>X</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>sets the item of <CODE><I>Array</I></CODE> under key <CODE><I>I</I></CODE> to <CODE><I>X</I></CODE>. </P></DD><DT><A name="label515"></A><SPAN class="index"><CODE>Get</CODE></SPAN> <A name="label516"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>get </CODE><CODE>+<I>Array</I></CODE><CODE> </CODE><CODE>+<I>I</I></CODE><CODE> </CODE><CODE><I>X</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns the item of <CODE><I>Array</I></CODE> under key <CODE><I>I</I></CODE>. </P></DD><DT><A name="label517"></A><SPAN class="index"><CODE>exchange</CODE></SPAN> <A name="label518"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>exchange </CODE><CODE>+<I>Array</I></CODE><CODE> </CODE><CODE>+<I>I</I></CODE><CODE> </CODE><CODE><I>OldVal</I></CODE><CODE> </CODE><CODE><I>NewVal</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns the current value of <CODE><I>Array</I></CODE> under key <CODE><I>I</I></CODE> as item <CODE><I>OldVal</I></CODE> and updates the value of <CODE><I>Array</I></CODE> under key <CODE><I>I</I></CODE> to be <CODE><I>NewVal</I></CODE>. </P></DD><DT><CODE>low</CODE> <A name="label520"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>low </CODE><CODE>+<I>Array</I></CODE><CODE> </CODE><CODE>?<I>LowI</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns the lower bound of the key range of <CODE><I>Array</I></CODE>. </P></DD><DT><CODE>high</CODE> <A name="label522"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>high </CODE><CODE>+<I>Array</I></CODE><CODE> </CODE><CODE>?<I>HighI</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns the upper bound of the key range of <CODE><I>Array</I></CODE>. </P></DD><DT><CODE>clone</CODE> <A name="label524"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>clone </CODE><CODE>+<I>A1</I></CODE><CODE> </CODE><CODE>?<I>A2</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns a new array with the same bounds and contents as <CODE><I>A1</I></CODE>. </P></DD><DT><CODE>toRecord</CODE> <A name="label526"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{Array<SPAN class="keyword">.</SPAN>toRecord </CODE><CODE>+<I>L</I></CODE><CODE> </CODE><CODE>+<I>A</I></CODE><CODE> </CODE><CODE>?<I>R</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns a record with label L that contains as features the integers between <CODE>{Array<SPAN class="keyword">.</SPAN>low </CODE><CODE><I>A</I></CODE><CODE>}</CODE> and <CODE>{Array<SPAN class="keyword">.</SPAN>high </CODE><CODE><I>A</I></CODE><CODE>}</CODE> and with the corresponding fields. </P></DD></DL><P> </P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="chunk.html#section.chunks.general"><< Prev</A></TD><TD><A href="node11.html">- Up -</A></TD><TD><A href="dictionary.html#section.chunks.dictionaries">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~duchier/">Denys Duchier</A>, <A href="http://www.ps.uni-sb.de/~kornstae/">Leif Kornstaedt</A> and <A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A><BR><SPAN class="version">Version 1.4.0 (20090610)</SPAN></ADDRESS></BODY></HTML>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
bd5c3d824c3db63ffd9226c15941e6ad
>
files
>
121
