You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@directory.apache.org by bu...@apache.org on 2014/05/09 17:21:20 UTC
svn commit: r908472 - in /websites/staging/directory/trunk/content: ./
mavibot/user-guide.html mavibot/user-guide/4-btree-operations.html
Author: buildbot
Date: Fri May 9 15:21:20 2014
New Revision: 908472
Log:
Staging update by buildbot for directory
Modified:
websites/staging/directory/trunk/content/ (props changed)
websites/staging/directory/trunk/content/mavibot/user-guide.html
websites/staging/directory/trunk/content/mavibot/user-guide/4-btree-operations.html
Propchange: websites/staging/directory/trunk/content/
------------------------------------------------------------------------------
--- cms:source-revision (original)
+++ cms:source-revision Fri May 9 15:21:20 2014
@@ -1 +1 @@
-1593560
+1593561
Modified: websites/staging/directory/trunk/content/mavibot/user-guide.html
==============================================================================
--- websites/staging/directory/trunk/content/mavibot/user-guide.html (original)
+++ websites/staging/directory/trunk/content/mavibot/user-guide.html Fri May 9 15:21:20 2014
@@ -167,6 +167,7 @@
<li>
<p><a href="user-guide/4-btree-operations.html">4 - Mavibot B-tree operations</a></p>
<ul>
+<li>Cursor informations</li>
<li>browse</li>
<li>contains</li>
<li>has</li>
Modified: websites/staging/directory/trunk/content/mavibot/user-guide/4-btree-operations.html
==============================================================================
--- websites/staging/directory/trunk/content/mavibot/user-guide/4-btree-operations.html (original)
+++ websites/staging/directory/trunk/content/mavibot/user-guide/4-btree-operations.html Fri May 9 15:21:20 2014
@@ -184,9 +184,9 @@ returned).</p>
<p>Moves to the next value of the current key or to the next key if all the values of the current key have been processed, and return the associated tuple.</p>
<h4 id="4124-prev">4.1.2.4 prev</h4>
<p>Moves to the previous value of the current key or to the previous key if all the values of the current key have been processed, and return the associated tuple.</p>
-<h2 id="41-browse-operations">4.1 Browse Operations</h2>
+<h2 id="42-browse-operations">4.2 Browse Operations</h2>
<p>Now that we know what a <em>Cursor</em> is about, we can describe the various <em>browse</em> operations that can be applied on a <em>BTree</em>.</p>
-<h3 id="411-btreebrowse">4.1.1 BTree.browse()</h3>
+<h3 id="421-btreebrowse">4.2.1 BTree.browse()</h3>
<p>This method returns a cursor with the position set before the first element of the <strong>B-tree</strong>, for the current revision. It returns a <em>TupleCursor</em> that contain the tuples <key,value> present in the <em>Btree</em>.</p>
<p>Assuming you have an existing <em>BTree</em>, using this method is quite straigthforward. Here is an example with a persisted <em>BTree</em> :</p>
<div class="codehilite"><pre> <span class="o">//</span> <span class="n">Create</span> <span class="n">a</span> <span class="n">RecordManager</span> <span class="n">that</span> <span class="n">will</span> <span class="n">contain</span> <span class="n">the</span> <span class="n">BTree</span>
@@ -232,12 +232,12 @@ returned).</p>
</pre></div>
-<h3 id="412-btreebrowse-long">4.1.2 BTree.browse( long )</h3>
+<h3 id="422-btreebrowse-long">4.2.2 BTree.browse( long )</h3>
<p>This method returns a cursor with the position set before the first element of the <strong>B-tree</strong>, for the given revision. </p>
<p>Here, the big difference is that you can fetch some data from an older revision - assuming this revision is still present, of course -.</p>
<p>It returns a <em>TupleCursor</em> that contain the tuples <key,value> present in the <em>Btree</em>.</p>
<p>You can use the exact same code than for the <em>browse()</em> method, except that you have to pass the version you want to browse.</p>
-<h3 id="413-btreebrowsefrom-k-key">4.1.3 BTree.browseFrom( K key )</h3>
+<h3 id="423-btreebrowsefrom-k-key">4.2.3 BTree.browseFrom( K key )</h3>
<p>This method returns a cursor with the position set before the given key of the <strong>B-tree</strong>. If the key does not exist, the cursor will be set to the closest lower value (or upper value if it's lower than the lowest value)</p>
<p>It returns a <em>TupleCursor</em> that contain the tuples <key,value> present in the <em>Btree</em>.</p>
<p>You can use the exact same code than for the <em>browse()</em> method. Here is an example, where we start after the latest present key :</p>
@@ -256,37 +256,37 @@ returned).</p>
</pre></div>
-<h3 id="414-btreebrowsefrom-long-revision-k-key">4.1.4 BTree.browseFrom( long revision, K key )</h3>
+<h3 id="424-btreebrowsefrom-long-revision-k-key">4.2.4 BTree.browseFrom( long revision, K key )</h3>
<p>TODO</p>
-<h2 id="42-contains-operations">4.2 Contains Operations</h2>
-<h3 id="421-btreecontains-k-key-v-value">4.2.1 BTree.contains( K key, V value )</h3>
+<h2 id="43-contains-operations">4.3 Contains Operations</h2>
+<h3 id="431-btreecontains-k-key-v-value">4.3.1 BTree.contains( K key, V value )</h3>
<p>TODO</p>
-<h3 id="422-btreecontains-long-revision-k-key-v-value">4.2.2 BTree.contains( long revision, K key, V value )</h3>
+<h3 id="432-btreecontains-long-revision-k-key-v-value">4.3.2 BTree.contains( long revision, K key, V value )</h3>
<p>TODO</p>
-<h2 id="43-has-operations">4.3 Has Operations</h2>
-<h3 id="431-btreehaskey-k-key">4.3.1 BTree.hasKey( K key )</h3>
+<h2 id="44-has-operations">4.4 Has Operations</h2>
+<h3 id="441-btreehaskey-k-key">4.4.1 BTree.hasKey( K key )</h3>
<p>TODO</p>
-<h3 id="432-btreehaskey-long-revision-k-key">4.3.2 BTree.hasKey( long revision, K key )</h3>
+<h3 id="442-btreehaskey-long-revision-k-key">4.4.2 BTree.hasKey( long revision, K key )</h3>
<p>TODO</p>
-<h2 id="44-get-operations">4.4 Get Operations</h2>
-<h3 id="441-btreeget-k-key">4.4.1 BTree.get( K key )</h3>
+<h2 id="45-get-operations">4.5 Get Operations</h2>
+<h3 id="451-btreeget-k-key">4.5.1 BTree.get( K key )</h3>
<p>TODO</p>
-<h3 id="442-btreeget-long-revision-k-key">4.4.2 BTree.get( long revision, K key )</h3>
+<h3 id="452-btreeget-long-revision-k-key">4.5.2 BTree.get( long revision, K key )</h3>
<p>TODO</p>
-<h3 id="443-btreegetvalues-k-key">4.4.3 BTree.getValues( K key )</h3>
+<h3 id="453-btreegetvalues-k-key">4.5.3 BTree.getValues( K key )</h3>
<p>TODO</p>
-<h2 id="45-insert-operation">4.5 Insert Operation</h2>
-<h2 id="46-delete-operations">4.6 Delete Operations</h2>
-<h3 id="461-btreedelete-k-key">4.6.1 BTree.delete( K key )</h3>
+<h2 id="46-insert-operation">4.6 Insert Operation</h2>
+<h2 id="47-delete-operations">4.7 Delete Operations</h2>
+<h3 id="481-btreedelete-k-key">4.8.1 BTree.delete( K key )</h3>
<p>TODO</p>
-<h3 id="462-btreedelete-k-key-v-value">4.6.2 BTree.delete( K key, V value )</h3>
+<h3 id="472-btreedelete-k-key-v-value">4.7.2 BTree.delete( K key, V value )</h3>
<p>TODO</p>
-<h2 id="47-other-btree-operations">4.7 Other BTree operations</h2>
-<h3 id="471-btreeclose">4.7.1 BTree.close()</h3>
+<h2 id="48-other-btree-operations">4.8 Other BTree operations</h2>
+<h3 id="481-btreeclose">4.8.1 BTree.close()</h3>
<p>TODO</p>
-<h3 id="472-btreeflush">4.7.2 BTree.flush()</h3>
+<h3 id="482-btreeflush">4.8.2 BTree.flush()</h3>
<p>TODO</p>
-<h3 id="473-btreegetrevision">4.7.3 BTree.getRevision()</h3>
+<h3 id="483-btreegetrevision">4.8.3 BTree.getRevision()</h3>
<p>TODO</p>