Subversion Repositories HelenOS-doc

Rev

Rev 61 | Rev 73 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 61 Rev 62
Line 48... Line 48...
48 
 
 48 
 
49 
    <para>FIFO queues are used, for example, in ASID management code to store
 49 
    <para>FIFO queues are used, for example, in ASID management code to store
50 
    inactive ASIDs or in userspace keyboard driver to buffer read
 50 
    inactive ASIDs or in userspace keyboard driver to buffer read
51 
    characters.</para>
 51 
    characters.</para>
52 
 
 52 
 
53 
    <para>
 53 
    <figure>
54 
    <mediaobject id="fifo" xreflabel="">
 54 
    <mediaobject id="fifo" xreflabel="">
55 
    <imageobject role="html">
 55 
    <imageobject role="html">
56 
        <imagedata fileref="images/fifo.png" format="PNG" />
 56 
        <imagedata fileref="images/fifo.png" format="PNG" />
57 
    </imageobject>
 57 
    </imageobject>
58 
           
 58 
           
59 
    <imageobject role="fop">
 59 
    <imageobject role="fop">
60 
        <imagedata fileref="images.vector/fifo.svg" format="SVG" />
 60 
        <imagedata fileref="images.vector/fifo.svg" format="SVG" />
61 
    </imageobject>
 61 
    </imageobject>
62 
                   
 62 
                   
63 
    <caption>FIFO queue showing the wrap around the end of the array.</caption>
 - 
 
64 
    </mediaobject>
 63 
    </mediaobject>
- 
 
 64 
    <title>FIFO queue showing the wrap around the end of the array.</title>
65 
    </para>
 65 
    </figure>
66 
 
 66 
 
67 
  </section>
 67 
  </section>
68 
 
 68 
 
69 
  <section>
 69 
  <section>
70 
    <title>Hash tables</title>
 70 
    <title>Hash tables</title>
Line 96... Line 96...
96 
    logaritmic search, insertion and deletion times and, thanks to the
 96 
    logaritmic search, insertion and deletion times and, thanks to the
97 
    leaf-level list, provides fantastic means of walking the nodes containing
 97 
    leaf-level list, provides fantastic means of walking the nodes containing
98 
    data. Moreover, B+trees can be used for easy storing, resizing and merging
 98 
    data. Moreover, B+trees can be used for easy storing, resizing and merging
99 
    of disjunctive intervals.</para>
 99 
    of disjunctive intervals.</para>
100 
 
 100 
 
101 
    <para>
 101 
    <figure>
102 
    <mediaobject id="btree" xreflabel="">
 102 
    <mediaobject id="btree" xreflabel="">
103 
    <imageobject role="html">
 103 
    <imageobject role="html">
104 
        <imagedata fileref="images/btree.png" format="PNG" />
 104 
        <imagedata fileref="images/btree.png" format="PNG" />
105 
    </imageobject>
 105 
    </imageobject>
106 
           
 106 
           
107 
    <imageobject role="fop">
 107 
    <imageobject role="fop">
108 
        <imagedata fileref="images.vector/btree.svg" format="SVG" />
 108 
        <imagedata fileref="images.vector/btree.svg" format="SVG" />
109 
    </imageobject>
 109 
    </imageobject>
110 
                   
 110 
                   
111 
    <caption>B+tree containing keys ranging from 1 to 12.</caption>
 - 
 
- 
 
 111 
 
112 
    </mediaobject>
 112 
    </mediaobject>
- 
 
 113 
    <title>B+tree containing keys ranging from 1 to 12.</title>
113 
    </para>
 114 
    </figure>
114 
 
 115 
 
115 
  </section>
 116 
  </section>
116 
</chapter>
 117 
</chapter>
117 

            118