| products/Sources/formale Sprachen/GAP/pkg/datastructures/doc/chapInd.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) - Index</ 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= "chapInd" 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="chapBib.html">[Previous Chapter]</a> </div>
<p id="mathjaxlink" class="pcenter"><a href="chapInd_mj.html">[MathJax on]</a></p>
<p><a id="X83A0356F839C696F" name="X83A0356F839C696F"></a></p>
<div class="index">
<h3>Index</h3>
<strong class="pkg">datastructures</strong> <a href="chap2.html#X8360C04082558A12">2.</a> <br />
<code class="func"><span>\</span>[<span>\</span>]</code>, for IsHashMapRep, IsObject <a href="chap7.html#X818E60167B0B12F7">7.1-8</a> <br />
for IsSliceRep, IsPosInt <a href="chap11.html#X7D9428F87FB473C1">11.1-3</a> <br />
<code class="func"><span>\</span>[<span>\</span>]\:\=</code>, for IsHashMapRep, IsObject, IsObject <a href="chap7.html#X8028C04B7895B9CD">7.1-9</a> <br />
for IsSliceRep and IsMutable, IsPosInt, IsObject <a href="chap11.html#X7F7746247EFACC8E">11.1-4</a> <br />
<code class="func">\in</code>, for IsObject, IsHashMapRep <a href="chap7.html#X78DF0E377A70207E">7.1-10</a> <br />
for IsObject, IsHashSetRep <a href="chap8.html#X7CECEB107D9B8645">8.1-4</a> <br />
for IsObject, IsOrderedSetDS <a href="chap10.html#X7DD7225D7A6F92C6">10.2-12</a> <br />
for IsObject, IsSliceRep <a href="chap11.html#X81BD0E81835A66C2">11.1-5</a> <br />
<code class="func">AddSet</code>, for IsHashSetRep, IsObject <a href="chap8.html#X7C7FBBE27E833BB3">8.1-3</a> <br />
for IsOrderedSetDS and IsMutable, IsObject <a href="chap10.html#X785F29D484E84A9B">10.2-10</a> <br />
<code class="func">AsList</code>, for IsOrderedSetDS <a href="chap10.html#X84A6178D7F4FEF35">10.3-4</a> <br />
<code class="func">AsSet</code>, for IsHashSetRep <a href="chap8.html#X835176CB8124AF70">8.1-9</a> <br />
<code class="func">AsSortedList</code>, for IsOrderedSetDS <a href="chap10.html#X7CEA1C9283A69F26">10.3-3</a> <br />
<code class="func">AsSSortedList</code>, for IsOrderedSetDS <a href="chap10.html#X7BA094DE791ADBC1">10.3-2</a> <br />
<code class="func">BinaryHeap</code> <a href="chap3.html#X7F627E817F17CD8A">3.3-1</a> <br />
<code class="func">Capacity</code>, for IsDeque <a href="chap4.html#X7AFCE0EC7D282807">4.1-10</a> <br />
for IsQueue <a href="chap4.html#X84CF84A087CA6719">4.1-9</a> <br />
<code class="func">Dequeue</code>, for IsQueue, IsObject <a href="chap4.html#X87D9EF6E84B98629">4.1-8</a> <br />
<code class="func">Enqueue</code>, for IsQueue, IsObject <a href="chap4.html#X80D3DF0B7DF6B8BC">4.1-7</a> <br />
<code class="func">Enumerator</code>, for IsOrderedSetDS <a href="chap10.html#X786CD5B57A439204">10.3-6</a> <br />
<code class="func">EnumeratorSorted</code>, for IsOrderedSetDS <a href="chap10.html#X7B0571977A8480EA">10.3-5</a> <br />
<code class="func">Hash_PermGroup_Complete</code> <a href="chap6.html#X86FFE7A07E784C24">6.3-2</a> <br />
<code class="func">Hash_PermGroup_Fast</code> <a href="chap6.html#X848AD86F8089106F">6.3-1</a> <br />
<code class="func">HashBasic</code> <a href="chap6.html#X85E86FF080A3A37A">6.2-1</a> <br />
<code class="func">HashMap</code> <a href="chap7.html#X7FC1C1CD87229F1B">7.1-2</a> <br />
<code class="func">HashSet</code> <a href="chap8.html#X789A593B7C227BE5">8.1-2</a> <br />
<code class="func">Heap</code> <a href="chap3.html#X81244A537F7E02FC">3.2-2</a> <br />
<code class="func">IsBinaryHeapFlatRep</code>, for IsHeap and IsPositionalObjectRep <a href="chap3.html#X7BDAA17C7A89C7C7">3.5-1</a> <br />
<code class="func">IsBound<span>\</span>[<span>\</span>]</code>, for IsHashMapRep, IsObject <a href="chap7.html#X84CD9B0B82DC85F7">7.1-11</a> <br />
for IsSliceRep, IsPosInt <a href="chap11.html#X8312D61C86DFA27E">11.1-6</a> <br />
<code class="func">IsDeque</code>, for IsObject <a href="chap4.html#X7CD371EE7EB88DA8">4.1-2</a> <br />
<code class="func">IsEmpty</code>, for IsHashMapRep <a href="chap7.html#X857102527A38A649">7.1-14</a> <br />
for IsHashSetRep <a href="chap8.html#X8142E775878A1A6E">8.1-7</a> <br />
for IsOrderedSetDS <a href="chap10.html#X7DD174FE79F86562">10.3-7</a> <br />
<code class="func">IsHashMap</code>, for IsObject and IsFinite <a href="chap7.html#X7C142C0B7AD53629">7.1-1</a> <br />
<code class="func">IsHashSet</code>, for IsObject and IsFinite <a href="chap8.html#X81FA1C7B84314DAF">8.1-1</a> <br />
<code class="func">IsHeap</code>, for IsObject <a href="chap3.html#X85D1DDCF86FD53EB">3.2-1</a> <br />
<code class="func">IsOrderedSetDS</code>, for IsObject <a href="chap10.html#X829BF6468120FCF4">10.2-1</a> <br />
<code class="func">IsPairingHeapFlatRep</code>, for IsHeap and IsPositionalObjectRep <a href="chap3.html#X7D2529247BC9A1A5">3.6-1</a> <br />
<code class="func">IsPartitionDS</code>, for IsObject <a href="chap5.html#X804726FA84A7EA0F">5.2-1</a> <br />
<code class="func">IsQueue</code>, for IsObject <a href="chap4.html#X82229C878341CDDC">4.1-1</a> <br />
<code class="func">IsSlice</code>, for IsList <a href="chap11.html#X80E65DC586FCB3A0">11.1-2</a> <br />
<code class="func">IsStack</code>, for IsObject <a href="chap12.html#X7D9693A07FF1452D">12.1-2</a> <br />
<code class="func">IsStandardOrderedSetDS</code>, for IsOrderedSetDS <a href="chap10.html#X83DF983D824ADA52">10.2-2</a> <br />
<code class="func">Iterator</code>, for IsHashSetRep <a href="chap8.html#X792F44027D8C73DA">8.1-10</a> <br />
for IsOrderedSetDS <a href="chap10.html#X805D48307D3FBC57">10.3-1</a> <br />
<code class="func">IteratorSorted</code>, for IsOrderedSetDS <a href="chap10.html#X83A682A08318DBA0">10.2-15</a> <br />
<code class="func">KeyIterator</code>, for IsHashMap <a href="chap7.html#X820C9185827968FA">7.1-5</a> <br />
<code class="func">Keys</code>, for IsHashMap <a href="chap7.html#X827F974B7B5111CA">7.1-3</a> <br />
<code class="func">KeyValueIterator</code>, for IsHashMap <a href="chap7.html#X7F75A43984B05E73">7.1-7</a> <br />
<code class="func">Length</code>, for IsDeque <a href="chap4.html#X78F8FB38830FF16A">4.1-12</a> <br />
for IsOrderedSetDS <a href="chap10.html#X78B39A307B3B8879">10.3-8</a> <br />
for IsQueue <a href="chap4.html#X86CB9F747A49AA9F">4.1-11</a> <br />
for IsSliceRep <a href="chap11.html#X7AC67617811B6218">11.1-8</a> <br />
<code class="func">LessFunction</code>, for IsOrderedSetDS <a href="chap10.html#X85F4EDA0841AADFD">10.2-13</a> <br />
<code class="func">MemoizeFunction</code> <a href="chap9.html#X7E7224D77AFAFE00">9.1-1</a> <br />
<code class="func">Merge</code>, for IsHeap, IsHeap <a href="chap3.html#X84E27F257EA4556A">3.2-7</a> <br />
<code class="func">NewHeap</code>, for IsHeap, IsObject, IsObject <a href="chap3.html#X84E3B88F7FD83B3C">3.2-3</a> <br />
<code class="func">NumberParts</code>, for IsPartitionDS <a href="chap5.html#X83E6F1DE84ABFB69">5.2-12</a> <br />
<code class="func">OrderedSetDS</code>, for IsOrderedSetDS <a href="chap10.html#X87CC3ADD8273BDDC">10.2-9</a> <br />
for IsOrderedSetDS, IsFunction <a href="chap10.html#X7EE9AD66864EFD95">10.2-7</a> <br />
for IsOrderedSetDS, IsFunction, IsListOrCollection <a href="chap10.html#X7B3E75657C8758DA">10.2-6</a> <br />
for IsOrderedSetDS, IsFunction, IsListOrCollection, IsRandomSource <a href="chap10.html#X7C0A0ACD833B09E8">10.2-3</a> <br />
for IsOrderedSetDS, IsFunction, IsRandomSource <a href="chap10.html#X784F06667B9CAE61">10.2-4</a> <br />
for IsOrderedSetDS, IsListOrCollection <a href="chap10.html#X84341B117B22B200">10.2-8</a> <br />
for IsOrderedSetDS, IsListOrCollection, IsRandomSource <a href="chap10.html#X82EBF9967A1BC1F4">10.2-5</a> <br />
<code class="func">PairingHeap</code> <a href="chap3.html#X7F8B54F282A4B1A7">3.4-1</a> <br />
<code class="func">PartitionDS</code>, for IsCyclotomicCollColl <a href="chap5.html#X8796F318875443C4">5.2-7</a> <br />
for IsFunction, IsCyclotomicCollColl <a href="chap5.html#X7B0B222583188A6B">5.2-6</a> <br />
for IsFunction, IsPosInt <a href="chap5.html#X85E4403778DC83A0">5.2-4</a> <br />
for IsPosInt <a href="chap5.html#X876385547BD14FDD">5.2-5</a> <br />
<code class="func">PartitionDSCons</code>, for IsPartitionDS, IsCyclotomicCollColl <a href="chap5.html#X7EAC43E97BE451C0">5.2-3</a> <br />
for IsPartitionDS, IsPosInt <a href="chap5.html#X794FFC5983C63468">5.2-2</a> <br />
<code class="func">PartsOfPartitionDS</code>, for IsPartitionDS <a href="chap5.html#X8716AC8F79820C86">5.2-14</a> <br />
<code class="func">Peek</code>, for IsHeap <a href="chap3.html#X78052DBE7B563C2C">3.2-5</a> <br />
for IsStack <a href="chap12.html#X79A21A337C035011">12.1-4</a> <br />
<code class="func">PlistDeque</code> <a href="chap4.html#X7817028981968371">4.2-1</a> <br />
<code class="func">PlistDequeExpand</code> <a href="chap4.html#X7B35697B780919D7">4.2-8</a> <br />
<code class="func">PlistDequePeekBack</code> <a href="chap4.html#X81D966A282FB7872">4.2-7</a> <br />
<code class="func">PlistDequePeekFront</code> <a href="chap4.html#X841543137B0F720C">4.2-6</a> <br />
<code class="func">PlistDequePopBack</code> <a href="chap4.html#X86B4266878A93741">4.2-5</a> <br />
<code class="func">PlistDequePopFront</code> <a href="chap4.html#X8704C6BD875D0385">4.2-4</a> <br />
<code class="func">PlistDequePushBack</code> <a href="chap4.html#X7E8676DB84B2C360">4.2-3</a> <br />
<code class="func">PlistDequePushFront</code> <a href="chap4.html#X7BF75DB47D46C91E">4.2-2</a> <br />
<code class="func">Pop</code>, for IsHeap <a href="chap3.html#X783D92BE8344CBD3">3.2-6</a> <br />
for IsStack <a href="chap12.html#X7E4935478082CF2F">12.1-5</a> <br />
<code class="func">PopBack</code>, for IsDeque <a href="chap4.html#X7FFC2AAF85355F50">4.1-5</a> <br />
<code class="func">PopFront</code>, for IsDeque <a href="chap4.html#X7CD527F87861A5FE">4.1-6</a> <br />
<code class="func">Position</code>, for IsOrderedSetDS, IsObject, IsInt <a href="chap10.html#X81CAD5FC819FD0AA">10.3-9</a> <br />
<code class="func">PositionSortedOp</code>, for IsOrderedSetDS, IsObject <a href="chap10.html#X7B74B4107A33E68A">10.3-10</a> <br />
for IsOrderedSetDS, IsObject, IsFunction <a href="chap10.html#X7FDCE67179997482">10.3-11</a> <br />
<code class="func">Push</code>, for IsHeap, IsObject <a href="chap3.html#X812240D187506B40">3.2-4</a> <br />
for IsStack, IsObject <a href="chap12.html#X7B642BD77ABDD80E">12.1-3</a> <br />
<code class="func">PushBack</code>, for IsDeque, IsObject <a href="chap4.html#X8372434383E08554">4.1-3</a> <br />
<code class="func">PushFront</code>, for IsDeque, IsObject <a href="chap4.html#X7A19020A835C39A7">4.1-4</a> <br />
<code class="func">RemoveSet</code>, for IsHashSetRep, IsObject <a href="chap8.html#X80E770C2845B4155">8.1-5</a> <br />
for IsOrderedSetDS and IsMutable, IsObject <a href="chap10.html#X79CA0BD27822C1FB">10.2-11</a> <br />
<code class="func">Representative</code>, for IsPartitionDS, IsPosInt <a href="chap5.html#X8344F7007AD2C44B">5.2-8</a> <br />
<code class="func">RootsIteratorOfPartitionDS</code>, for IsPartitionDS <a href="chap5.html#X7A41C16979664337">5.2-10</a> <br />
<code class="func">RootsOfPartitionDS</code>, for IsPartitionDS <a href="chap5.html#X7EA363F57FC53B4E">5.2-11</a> <br />
<code class="func">Set</code>, for IsHashSetRep <a href="chap8.html#X7D1EE80687CAB426">8.1-8</a> <br />
<code class="func">Size</code>, for [IsStack] <a href="chap12.html#X878BEB5C85B8E0A4">12.1-6</a> <br />
for IsHashMapRep <a href="chap7.html#X866A89F080CE944A">7.1-13</a> <br />
for IsHashSetRep <a href="chap8.html#X82596CD77B2EC7C5">8.1-6</a> <br />
for IsOrderedSetDS <a href="chap10.html#X7B2E5BB28435AE50">10.2-14</a> <br />
<code class="func">SizeUnderlyingSetDS</code>, for IsPartitionDS <a href="chap5.html#X8635245A83D7DC1B">5.2-13</a> <br />
<code class="func">Slice</code> <a href="chap11.html#X787DE4958435192B">11.1-1</a> <br />
<code class="func">Stack</code> <a href="chap12.html#X7FBD84A987069E53">12.1-1</a> <br />
<code class="func">Unbind<span>\</span>[<span>\</span>]</code>, for IsHashMapRep, IsObject <a href="chap7.html#X85A876A479D7161D">7.1-12</a> <br />
for IsSliceRep and IsMutable, IsPosInt <a href="chap11.html#X82CF5B21869B0F91">11.1-7</a> <br />
<code class="func">Unite</code>, for IsPartitionDS and IsMutable, IsPosInt, IsPosInt <a href="chap5.html#X7FABCE367DC2F82B">5.2-9</a> <br />
<code class="func">ValueIterator</code>, for IsHashMap <a href="chap7.html#X7B4D76A47B09C173">7.1-6</a> <br />
<code class="func">Values</code>, for IsHashMap <a href="chap7.html#X7B774EB27F2B7148">7.1-4</a> <br />
<p> </p>
</div>
<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chapBib.html">[Previous 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>
¤ Dauer der Verarbeitung: 0.9 Sekunden
¤
*© Formatika GbR, Deutschland
|
|