Subversion Repositories HelenOS-doc

Rev

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

Rev 105 Rev 131
Line 54... Line 54...
54 
      <title>Doubly-circularly-linked list</title>
 54 
      <title>Doubly-circularly-linked list</title>
55 
    </figure>
 55 
    </figure>
56 
  </section>
 56 
  </section>
57 
 
 57 
 
58 
  <section>
 58 
  <section>
59 
    <title>FIFO queues</title>
 59 
    <title>FIFO Queues</title>
60 
 
 60 
 
61 
    <indexterm>
 61 
    <indexterm>
62 
      <primary>FIFO queue</primary>
 62 
      <primary>FIFO queue</primary>
63 
    </indexterm>
 63 
    </indexterm>
64 
 
 64 
 
Line 94... Line 94...
94 
      <title>FIFO queue showing the wrap around the end of the array.</title>
 94 
      <title>FIFO queue showing the wrap around the end of the array.</title>
95 
    </figure>
 95 
    </figure>
96 
  </section>
 96 
  </section>
97 
 
 97 
 
98 
  <section id="hashtables">
 98 
  <section id="hashtables">
99 
    <title>Hash tables</title>
 99 
    <title>Hash Tables</title>
100 
 
 100 
 
101 
    <indexterm>
 101 
    <indexterm>
102 
      <primary>hash table</primary>
 102 
      <primary>hash table</primary>
103 
    </indexterm>
 103 
    </indexterm>
104 
 
 104 
 
Line 125... Line 125...
125 
        </imageobject>
 125 
        </imageobject>
126 
      </mediaobject>
 126 
      </mediaobject>
127 
 
 127 
 
128 
      <title>Generic hash table.</title>
 128 
      <title>Generic hash table.</title>
129 
    </figure>
 129 
    </figure>
130 
 
 - 
 
131 
  </section>
 130 
  </section>
132 
 
 131 
 
133 
  <section>
 132 
  <section>
134 
    <title>Bitmaps</title>
 133 
    <title>Bitmaps</title>
135 
 
 134 
 
Line 145... Line 144...
145 
  <section>
 144 
  <section>
146 
    <title>B+trees</title>
 145 
    <title>B+trees</title>
147 
 
 146 
 
148 
    <indexterm>
 147 
    <indexterm>
149 
      <primary>B-trees</primary>
 148 
      <primary>B-trees</primary>
- 
 
 149 
 
150 
      <secondary> - B+tree</secondary>
 150 
      <secondary>- B+tree</secondary>
151 
    </indexterm>
 151 
    </indexterm>
152 
 
 152 
 
153 
    <para>HelenOS makes use of a variant of B-tree called B+tree. B+trees, in
 153 
    <para>HelenOS makes use of a variant of B-tree called B+tree. B+trees, in
154 
    HelenOS implementation, are 3-4-5 balanced trees. They are characteristic
 154 
    HelenOS implementation, are 3-4-5 balanced trees. They are characteristic
155 
    by the fact that values are kept only in the leaf-level nodes and that
 155 
    by the fact that values are kept only in the leaf-level nodes and that