Quellcodebibliothek Statistik Leitseite products/sources/formale Sprachen/GAP/pkg/datastructures/doc/   (Algebra von RWTH Aachen Version 4.15.1©)  Datei vom 14.9.2025 mit Größe 27 kB image not shown  

Quelle  chap0.html   Sprache: HTML

 
 products/sources/formale Sprachen/GAP/pkg/datastructures/doc/chap0.html


<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (datastructures) - Contents</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chap0"  onload="jscontent()">


<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chap8.html">8</a>  <a href="chap9.html">9</a>  <a href="chap10.html">10</a>  <a href="chap11.html">11</a>  <a href="chap12.html">12</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap1.html">[Next Chapter]</a>   </div>

<p id="mathjaxlink" class="pcenter"><a href="chap0_mj.html">[MathJax on]</a></p>
<p><a id="X7D2C85EC87DD46E5" name="X7D2C85EC87DD46E5"></a></p>
<div class="pcenter">

<h1>datastructures</h1>


<h2>Collection of standard data structures for <strong class="pkg">GAP</strong></h2>

<p>
    0.4.0</p>

<p>
    14 October 2025
  </p>

</div>
<p><b>
    Markus Pfeiffer




  </b>
<br />Email: <span class="URL"><a href="mailto:markus.pfeiffer@st-andrews.ac.uk">markus.pfeiffer@st-andrews.ac.uk</a></span>
<br />Homepage: <span class="URL"><a href="http://www.morphism.de/~markusp">http://www.morphism.de/~markusp</a></span>
<br />Address: <br />School of Computer Science<br /> University of St Andrews<br /> Jack Cole Building, North Haugh<br /> St Andrews, Fife, KY16 9SX<br /> United Kingdom<br />
</p><p><b>
    Max Horn




  </b>
<br />Email: <span class="URL"><a href="mailto:mhorn@rptu.de">mhorn@rptu.de</a></span>
<br />Homepage: <span class="URL"><a href="https://www.quendi.de/math">https://www.quendi.de/math</a></span>
<br />Address: <br />Fachbereich Mathematik<br /> RPTU Kaiserslautern-Landau<br /> Gottlieb-Daimler-Straße 48<br /> 67663 Kaiserslautern<br /> Germany<br />
</p><p><b>
    Christopher Jefferson




  </b>
<br />Email: <span class="URL"><a href="mailto:caj21@st-andrews.ac.uk">caj21@st-andrews.ac.uk</a></span>
<br />Homepage: <span class="URL"><a href="http://caj.host.cs.st-andrews.ac.uk/">http://caj.host.cs.st-andrews.ac.uk/</a></span>
<br />Address: <br />School of Computer Science<br /> University of St Andrews<br /> Jack Cole Building, North Haugh<br /> St Andrews, Fife, KY16 9SX<br /> United Kingdom<br />
</p><p><b>
    Steve Linton




  </b>
<br />Email: <span class="URL"><a href="mailto:steve.linton@st-andrews.ac.uk">steve.linton@st-andrews.ac.uk</a></span>
<br />Homepage: <span class="URL"><a href="http://sl4.host.cs.st-andrews.ac.uk/">http://sl4.host.cs.st-andrews.ac.uk/</a></span>
<br />Address: <br />School of Computer Science<br /> University of St Andrews<br /> Jack Cole Building, North Haugh<br /> St Andrews, Fife, KY16 9SX<br /> United Kingdom<br />
</p>

<p><a id="X81488B807F2A1CF1" name="X81488B807F2A1CF1"></a></p>
<h3>Copyright</h3>
<p>© 2015-18 by Chris Jefferson, Steve Linton, Markus Pfeiffer, Max Horn, Reimer Behrends and others</p>

<p><strong class="pkg">datastructures</strong> package is free software; you can redistribute it and/or modify it under the terms of the <span class="URL"><a href="https://www.fsf.org/licenses/gpl.html">GNU General Public License</a></span> as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.</p>

<p><a id="X82A988D47DFAFCFA" name="X82A988D47DFAFCFA"></a></p>
<h3>Acknowledgements</h3>
<p>We appreciate very much all past and future comments, suggestions and contributions to this package and its documentation provided by <strong class="pkg">GAP</strong> users and developers.</p>

<p><a id="X8537FEB07AF2BEC8" name="X8537FEB07AF2BEC8"></a></p>

<div class="contents">
<h3>Contents<a id="contents" name="contents"></a></h3>

<div class="ContChap"><a href="chap1.html#X7DFB63A97E67C0A1">1 <span class="Heading">Introduction</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap1.html#X7F0445BA85C0D680">1.1 <span class="Heading">Purpose and goals of this package</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap1.html#X786BACDB82918A65">1.2 <span class="Heading">Overview over this manual</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap1.html#X80D704CC7EBFDF7A">1.3 <span class="Heading">Feedback</span></a>
</span>
</div>
</div>
<div class="ContChap"><a href="chap2.html#X8360C04082558A12">2 <span class="Heading">Installation</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap2.html#X8584FE1F8248F0A4">2.1 <span class="Heading">Building the Kernel Module</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap2.html#X7F7AE6058776DF06">2.2 <span class="Heading">Building the Documentation</span></a>
</span>
</div>
</div>
<div class="ContChap"><a href="chap3.html#X876CE0537BBE92BF">3 <span class="Heading">Heaps</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X7DFB63A97E67C0A1">3.1 <span class="Heading">Introduction</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X7C5F33687C53BEF0">3.2 <span class="Heading">API</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X85D1DDCF86FD53EB">3.2-1 IsHeap</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X81244A537F7E02FC">3.2-2 Heap</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X84E3B88F7FD83B3C">3.2-3 NewHeap</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X812240D187506B40">3.2-4 Push</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X78052DBE7B563C2C">3.2-5 Peek</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X783D92BE8344CBD3">3.2-6 Pop</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X84E27F257EA4556A">3.2-7 Merge</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X7A01096286198C96">3.3 <span class="Heading">Binary Heaps</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X7F627E817F17CD8A">3.3-1 BinaryHeap</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X82EFFA948516AD5C">3.4 <span class="Heading">Pairing Heaps</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X7F8B54F282A4B1A7">3.4-1 PairingHeap</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X844A8A1F85E6E038">3.5 <span class="Heading">Declarations</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X7BDAA17C7A89C7C7">3.5-1 IsBinaryHeapFlatRep</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap3.html#X78289A737AF28B39">3.6 <span class="Heading">Implementation</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap3.html#X7D2529247BC9A1A5">3.6-1 IsPairingHeapFlatRep</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap4.html#X7E4B7210874702B2">4 <span class="Heading">Queues and Deques</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7C5F33687C53BEF0">4.1 <span class="Heading">API</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X82229C878341CDDC">4.1-1 IsQueue</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7CD371EE7EB88DA8">4.1-2 IsDeque</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8372434383E08554">4.1-3 PushBack</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7A19020A835C39A7">4.1-4 PushFront</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7FFC2AAF85355F50">4.1-5 PopBack</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7CD527F87861A5FE">4.1-6 PopFront</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X80D3DF0B7DF6B8BC">4.1-7 Enqueue</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X87D9EF6E84B98629">4.1-8 Dequeue</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X84CF84A087CA6719">4.1-9 Capacity</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7AFCE0EC7D282807">4.1-10 Capacity</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X86CB9F747A49AA9F">4.1-11 Length</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X78F8FB38830FF16A">4.1-12 Length</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap4.html#X7E65C2D087E8B8CA">4.2 <span class="Heading">Deques implemented using plain lists</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7817028981968371">4.2-1 PlistDeque</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7BF75DB47D46C91E">4.2-2 PlistDequePushFront</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7E8676DB84B2C360">4.2-3 PlistDequePushBack</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X8704C6BD875D0385">4.2-4 PlistDequePopFront</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X86B4266878A93741">4.2-5 PlistDequePopBack</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X841543137B0F720C">4.2-6 PlistDequePeekFront</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X81D966A282FB7872">4.2-7 PlistDequePeekBack</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap4.html#X7B35697B780919D7">4.2-8 PlistDequeExpand</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap5.html#X7C0CE80081C1D1A2">5 <span class="Heading">Union-Find</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap5.html#X7DFB63A97E67C0A1">5.1 <span class="Heading">Introduction</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap5.html#X7C5F33687C53BEF0">5.2 <span class="Heading">API</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X804726FA84A7EA0F">5.2-1 IsPartitionDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X794FFC5983C63468">5.2-2 PartitionDSCons</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X7EAC43E97BE451C0">5.2-3 PartitionDSCons</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X85E4403778DC83A0">5.2-4 PartitionDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X876385547BD14FDD">5.2-5 PartitionDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X7B0B222583188A6B">5.2-6 PartitionDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X8796F318875443C4">5.2-7 PartitionDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X8344F7007AD2C44B">5.2-8 Representative</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X7FABCE367DC2F82B">5.2-9 Unite</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X7A41C16979664337">5.2-10 RootsIteratorOfPartitionDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X7EA363F57FC53B4E">5.2-11 RootsOfPartitionDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X83E6F1DE84ABFB69">5.2-12 NumberParts</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X8635245A83D7DC1B">5.2-13 SizeUnderlyingSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap5.html#X8716AC8F79820C86">5.2-14 PartsOfPartitionDS</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap6.html#X7AE36B967EB1382B">6 <span class="Heading">Hash Functions</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap6.html#X7DFB63A97E67C0A1">6.1 <span class="Heading">Introduction</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap6.html#X7A441DD97E6C78A6">6.2 <span class="Heading">Hash Functions for Basic Types</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap6.html#X85E86FF080A3A37A">6.2-1 HashBasic</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap6.html#X78424208807F992D">6.3 <span class="Heading">Hash Functions for Permutation Groups</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap6.html#X848AD86F8089106F">6.3-1 Hash_PermGroup_Fast</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap6.html#X86FFE7A07E784C24">6.3-2 Hash_PermGroup_Complete</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap7.html#X7D62ABFF8416C44C">7 <span class="Heading">Hashmaps</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap7.html#X7C5F33687C53BEF0">7.1 <span class="Heading">API</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X7C142C0B7AD53629">7.1-1 IsHashMap</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X7FC1C1CD87229F1B">7.1-2 HashMap</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X827F974B7B5111CA">7.1-3 Keys</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X7B774EB27F2B7148">7.1-4 Values</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X820C9185827968FA">7.1-5 KeyIterator</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X7B4D76A47B09C173">7.1-6 ValueIterator</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X7F75A43984B05E73">7.1-7 KeyValueIterator</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X818E60167B0B12F7"><code>7.1-8 <span>\</span>[<span>\</span>]</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X8028C04B7895B9CD"><code>7.1-9 <span>\</span>[<span>\</span>]\:\=</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X78DF0E377A70207E"><code>7.1-10 \in</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X84CD9B0B82DC85F7"><code>7.1-11 IsBound<span>\</span>[<span>\</span>]</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X85A876A479D7161D"><code>7.1-12 Unbind<span>\</span>[<span>\</span>]</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X866A89F080CE944A">7.1-13 Size</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap7.html#X857102527A38A649">7.1-14 IsEmpty</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap8.html#X80589F287F1620B2">8 <span class="Heading">Hashsets</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap8.html#X7C5F33687C53BEF0">8.1 <span class="Heading">API</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X81FA1C7B84314DAF">8.1-1 IsHashSet</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X789A593B7C227BE5">8.1-2 HashSet</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X7C7FBBE27E833BB3">8.1-3 AddSet</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X7CECEB107D9B8645"><code>8.1-4 \in</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X80E770C2845B4155">8.1-5 RemoveSet</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X82596CD77B2EC7C5">8.1-6 Size</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X8142E775878A1A6E">8.1-7 IsEmpty</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X7D1EE80687CAB426">8.1-8 Set</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X835176CB8124AF70">8.1-9 AsSet</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap8.html#X792F44027D8C73DA">8.1-10 Iterator</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap9.html#X8693FF6287BAAB84">9 <span class="Heading">Memoisation</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap9.html#X8779C9D987C7B094">9.1 <span class="Heading">Memoisation with HashMap</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap9.html#X7E7224D77AFAFE00">9.1-1 MemoizeFunction</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap10.html#X8134174379D8CD1E">10 <span class="Heading">Ordered Set Datastructures</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap10.html#X86A9B6F87E619FFF">10.1 <span class="Heading">Usage</span></a>
</span>
</div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap10.html#X7C5F33687C53BEF0">10.2 <span class="Heading">API</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X829BF6468120FCF4">10.2-1 IsOrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X83DF983D824ADA52">10.2-2 IsStandardOrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7C0A0ACD833B09E8">10.2-3 OrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X784F06667B9CAE61">10.2-4 OrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X82EBF9967A1BC1F4">10.2-5 OrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7B3E75657C8758DA">10.2-6 OrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7EE9AD66864EFD95">10.2-7 OrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X84341B117B22B200">10.2-8 OrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X87CC3ADD8273BDDC">10.2-9 OrderedSetDS</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X785F29D484E84A9B">10.2-10 AddSet</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X79CA0BD27822C1FB">10.2-11 RemoveSet</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7DD7225D7A6F92C6"><code>10.2-12 \in</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X85F4EDA0841AADFD">10.2-13 LessFunction</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7B2E5BB28435AE50">10.2-14 Size</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X83A682A08318DBA0">10.2-15 IteratorSorted</a></span>
</div></div>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap10.html#X8373B442852AB64B">10.3 <span class="Heading">Default methods</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X805D48307D3FBC57">10.3-1 Iterator</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7BA094DE791ADBC1">10.3-2 AsSSortedList</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7CEA1C9283A69F26">10.3-3 AsSortedList</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X84A6178D7F4FEF35">10.3-4 AsList</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7B0571977A8480EA">10.3-5 EnumeratorSorted</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X786CD5B57A439204">10.3-6 Enumerator</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7DD174FE79F86562">10.3-7 IsEmpty</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X78B39A307B3B8879">10.3-8 Length</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X81CAD5FC819FD0AA">10.3-9 Position</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7B74B4107A33E68A">10.3-10 PositionSortedOp</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap10.html#X7FDCE67179997482">10.3-11 PositionSortedOp</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap11.html#X83C843A97827C861">11 <span class="Heading">Slices</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap11.html#X7C5F33687C53BEF0">11.1 <span class="Heading">API</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap11.html#X787DE4958435192B">11.1-1 Slice</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap11.html#X80E65DC586FCB3A0">11.1-2 IsSlice</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap11.html#X7D9428F87FB473C1"><code>11.1-3 <span>\</span>[<span>\</span>]</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap11.html#X7F7746247EFACC8E"><code>11.1-4 <span>\</span>[<span>\</span>]\:\=</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap11.html#X81BD0E81835A66C2"><code>11.1-5 \in</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap11.html#X8312D61C86DFA27E"><code>11.1-6 IsBound<span>\</span>[<span>\</span>]</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap11.html#X82CF5B21869B0F91"><code>11.1-7 Unbind<span>\</span>[<span>\</span>]</code></a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap11.html#X7AC67617811B6218">11.1-8 Length</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chap12.html#X83723E3B7B144F19">12 <span class="Heading">Stacks</span></a>
<div class="ContSect"><span class="tocline"><span class="nocss"> </span><a href="chap12.html#X7C5F33687C53BEF0">12.1 <span class="Heading">API</span></a>
</span>
<div class="ContSSBlock">
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap12.html#X7FBD84A987069E53">12.1-1 Stack</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap12.html#X7D9693A07FF1452D">12.1-2 IsStack</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap12.html#X7B642BD77ABDD80E">12.1-3 Push</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap12.html#X79A21A337C035011">12.1-4 Peek</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap12.html#X7E4935478082CF2F">12.1-5 Pop</a></span>
<span class="ContSS"><br /><span class="nocss">  </span><a href="chap12.html#X878BEB5C85B8E0A4">12.1-6 Size</a></span>
</div></div>
</div>
<div class="ContChap"><a href="chapBib.html"><span class="Heading">References</span></a></div>
<div class="ContChap"><a href="chapInd.html"><span class="Heading">Index</span></a></div>
<br />
</div>

<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap1.html">[Next Chapter]</a>   </div>


<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chap8.html">8</a>  <a href="chap9.html">9</a>  <a href="chap10.html">10</a>  <a href="chap11.html">11</a>  <a href="chap12.html">12</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>

<hr />
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>

99%


¤ Dauer der Verarbeitung: 0.3 Sekunden  (vorverarbeitet)  ¤

*© Formatika GbR, Deutschland




Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.