35,6 → 35,24 |
type, which is also supported by HelenOS, they don't take up any unused |
space and are more general. On the other hand, they are slower than |
in-array FIFOs and can be hardly used to implement buffers.</para> |
|
<figure> |
<mediaobject id="list" xreflabel=""> |
<imageobject role="pdf"> |
<imagedata fileref="images.vector/list.pdf" format="PDF" /> |
</imageobject> |
|
<imageobject role="html"> |
<imagedata fileref="images/list.png" format="PNG" /> |
</imageobject> |
|
<imageobject role="fop"> |
<imagedata fileref="images.vector/list.svg" format="SVG" /> |
</imageobject> |
</mediaobject> |
|
<title>Doubly-circularly-linked list</title> |
</figure> |
</section> |
|
<section> |
91,6 → 109,25 |
function. Besides these virtual operations, the hash table is composed of |
a dynamically allocated array of list heads that represent each chain, |
number of chains and the maximal number of keys.</para> |
|
<figure> |
<mediaobject id="hash" xreflabel=""> |
<imageobject role="pdf"> |
<imagedata fileref="images.vector/hash.pdf" format="PDF" /> |
</imageobject> |
|
<imageobject role="html"> |
<imagedata fileref="images/hash.png" format="PNG" /> |
</imageobject> |
|
<imageobject role="fop"> |
<imagedata fileref="images.vector/hash.svg" format="SVG" /> |
</imageobject> |
</mediaobject> |
|
<title>Generic hash table.</title> |
</figure> |
|
</section> |
|
<section> |