51 lines
4.7 KiB
HTML
51 lines
4.7 KiB
HTML
<HTML><HEAD><object type="application/x-oleobject" classid="clsid:1e2a7bd0-dab9-11d0-b93a-00c04fc99f9e">
|
|
<param name="Keyword" value="Copy">
|
|
<param name="Keyword" value="High">
|
|
<param name="Keyword" value="Length">
|
|
<param name="Keyword" value="Low">
|
|
<param name="Keyword" value="Reverse">
|
|
<param name="Keyword" value="SetLength">
|
|
<param name="Keyword" value="Shuffle">
|
|
<param name="Keyword" value="Sort"></object>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=windows-1251"><link rel="StyleSheet" href="../../../default.css">
|
|
</HEAD><body><H1>Ïîäïðîãðàììû äëÿ ðàáîòû ñ äèíàìè÷åñêèìè ìàññèâàìè</H1>
|
|
<table border=0 cellpadding=5><tr><td><code><b>function</b> Copy(a: <b>array</b> <b>of</b> T): <b>array</b> <b>of</b> T;</code>
|
|
<br> Ñîçäà¸ò êîïèþ äèíàìè÷åñêîãî ìàññèâà</td></tr>
|
|
<tr><td><code><b>function</b> High(a: <b>array</b> <b>of</b> T): integer;</code>
|
|
<br> Âîçâðàùàåò âåðõíþþ ãðàíèöó äèíàìè÷åñêîãî ìàññèâà</td></tr>
|
|
<tr><td><code><b>function</b> Length(a: <b>array</b> <b>of</b> T): integer;</code>
|
|
<br> Âîçâðàùàåò äëèíó äèíàìè÷åñêîãî ìàññèâà</td></tr>
|
|
<tr><td><code><b>function</b> Length(a: <b>array</b> <b>of</b> T; dim: integer): integer;</code>
|
|
<br> Âîçâðàùàåò äëèíó äèíàìè÷åñêîãî ìàññèâà ïî ðàçìåðíîñòè dim</td></tr>
|
|
<tr><td><code><b>function</b> Low(a: <b>array</b> <b>of</b> T): integer;</code>
|
|
<br> Âîçâðàùàåò 0</td></tr>
|
|
<tr><td><code><b>procedure</b> Reverse<T>(a: <b>array</b> <b>of</b> T);</code>
|
|
<br> Èçìåíÿåò ïîðÿäîê ýëåìåíòîâ â äèíàìè÷åñêîì ìàññèâå íà ïðîòèâîïîëîæíûé</td></tr>
|
|
<tr><td><code><b>procedure</b> Reverse<T>(a: <b>array</b> <b>of</b> T; index, count: integer);</code>
|
|
<br> Èçìåíÿåò ïîðÿäîê ýëåìåíòîâ íà ïðîòèâîïîëîæíûé â äèàïàçîíå äèíàìè÷åñêîãî ìàññèâà äëèíû count, íà÷èíàÿ ñ èíäåêñà index</td></tr>
|
|
<tr><td><code><b>procedure</b> Reverse<T>(a: List<T>);</code>
|
|
<br> Èçìåíÿåò ïîðÿäîê ýëåìåíòîâ â ñïèñêå íà ïðîòèâîïîëîæíûé</td></tr>
|
|
<tr><td><code><b>procedure</b> Reverse<T>(a: List<T>; index, count: integer);</code>
|
|
<br> Èçìåíÿåò ïîðÿäîê ýëåìåíòîâ íà ïðîòèâîïîëîæíûé â äèàïàçîíå ñïèñêà äëèíû count, íà÷èíàÿ ñ èíäåêñà index</td></tr>
|
|
<tr><td><code><b>procedure</b> SetLength(<b>var</b> a: <b>array</b> <b>of</b> T; n: integer);</code>
|
|
<br> Óñòàíàâëèâàåò äëèíó îäíîìåðíîãî äèíàìè÷åñêîãî ìàññèâà. Ñòàðîå ñîäåðæèìîå ñîõðàíÿåòñÿ</td></tr>
|
|
<tr><td><code><b>procedure</b> SetLength(<b>var</b> a: <b>array</b> [,...,] <b>of</b> T; n1,n2,...: integer);</code>
|
|
<br> Óñòàíàâëèâàåò ðàçìåðû n-ìåðíîãî äèíàìè÷åñêîãî ìàññèâà. Ñòàðîå ñîäåðæèìîå ñîõðàíÿåòñÿ</td></tr>
|
|
<tr><td><code><b>procedure</b> Shuffle<T>(a: <b>array</b> <b>of</b> T);</code>
|
|
<br> Ïåðåìåøèâàåò äèíàìè÷åñêèé ìàññèâ ñëó÷àéíûì îáðàçîì</td></tr>
|
|
<tr><td><code><b>procedure</b> Shuffle<T>(l: List<T>);</code>
|
|
<br> Ïåðåìåøèâàåò ñïèñîê ñëó÷àéíûì îáðàçîì</td></tr>
|
|
<tr><td><code><b>procedure</b> Sort<T>(a: <b>array</b> <b>of</b> T);</code>
|
|
<br> Ñîðòèðóåò äèíàìè÷åñêèé ìàññèâ ïî âîçðàñòàíèþ</td></tr>
|
|
<tr><td><code><b>procedure</b> Sort<T>(a: <b>array</b> <b>of</b> T; cmp: (T,T)->integer);</code>
|
|
<br> Ñîðòèðóåò äèíàìè÷åñêèé ìàññèâ ïî êðèòåðèþ ñîðòèðîâêè, çàäàâàåìîìó ôóíêöèåé ñðàâíåíèÿ cmp</td></tr>
|
|
<tr><td><code><b>procedure</b> Sort<T>(a: <b>array</b> <b>of</b> T; less: (T,T)->boolean);</code>
|
|
<br> Ñîðòèðóåò äèíàìè÷åñêèé ìàññèâ ïî êðèòåðèþ ñîðòèðîâêè, çàäàâàåìîìó ôóíêöèåé ñðàâíåíèÿ less</td></tr>
|
|
<tr><td><code><b>procedure</b> Sort<T>(l: List<T>);</code>
|
|
<br> Ñîðòèðóåò ñïèñîê ïî âîçðàñòàíèþ</td></tr>
|
|
<tr><td><code><b>procedure</b> Sort<T>(l: List<T>; cmp: (T,T)->integer);</code>
|
|
<br> Ñîðòèðóåò ñïèñîê ïî êðèòåðèþ ñîðòèðîâêè, çàäàâàåìîìó ôóíêöèåé ñðàâíåíèÿ cmp</td></tr>
|
|
<tr><td><code><b>procedure</b> Sort<T>(l: List<T>; less: (T,T)->boolean);</code>
|
|
<br> Ñîðòèðóåò ñïèñîê ïî êðèòåðèþ ñîðòèðîâêè, çàäàâàåìîìó ôóíêöèåé ñðàâíåíèÿ less</td></tr>
|
|
</table>
|
|
</body></HTML> |