| 36,7 → 36,7 |
|---|
| 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> |
| <figure float="1"> |
| <mediaobject id="list" xreflabel=""> |
| <imageobject role="pdf"> |
| <imagedata fileref="images.vector/list.pdf" format="PDF" /> |
| 76,7 → 76,7 |
|---|
| inactive ASIDs or in userspace keyboard driver to buffer read |
| characters.</para> |
| |
| <figure> |
| <figure float="1"> |
| <mediaobject id="fifo" xreflabel=""> |
| <imageobject role="pdf"> |
| <imagedata fileref="images.vector/fifo.pdf" format="PDF" /> |
| 110,7 → 110,7 |
|---|
| a dynamically allocated array of list heads that represent each chain, |
| number of chains and the maximal number of keys.</para> |
| |
| <figure> |
| <figure float="1"> |
| <mediaobject id="hash" xreflabel=""> |
| <imageobject role="pdf"> |
| <imagedata fileref="images.vector/hash.pdf" format="PDF" /> |
| 159,7 → 159,7 |
|---|
| data. Moreover, B+trees can be used for easy storing, resizing and merging |
| of disjunctive intervals.</para> |
| |
| <figure> |
| <figure float="1"> |
| <mediaobject id="btree" xreflabel=""> |
| <imageobject role="pdf"> |
| <imagedata fileref="images.vector/btree.pdf" format="PDF" /> |