Return-Path: X-Original-To: apmail-directory-commits-archive@www.apache.org Delivered-To: apmail-directory-commits-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 5628612F7E for ; Sun, 11 May 2014 02:01:04 +0000 (UTC) Received: (qmail 13012 invoked by uid 500); 10 May 2014 23:27:24 -0000 Delivered-To: apmail-directory-commits-archive@directory.apache.org Received: (qmail 50373 invoked by uid 500); 10 May 2014 23:15:13 -0000 Mailing-List: contact commits-help@directory.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: dev@directory.apache.org Delivered-To: mailing list commits@directory.apache.org Received: (qmail 10583 invoked by uid 99); 10 May 2014 22:57:05 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Sat, 10 May 2014 22:57:05 +0000 X-ASF-Spam-Status: No, hits=-2000.0 required=5.0 tests=ALL_TRUSTED X-Spam-Check-By: apache.org Received: from [140.211.11.4] (HELO eris.apache.org) (140.211.11.4) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 09 May 2014 15:21:40 +0000 Received: from eris.apache.org (localhost [127.0.0.1]) by eris.apache.org (Postfix) with ESMTP id 91CDA2388AAA for ; Fri, 9 May 2014 15:21:20 +0000 (UTC) Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Subject: svn commit: r908472 - in /websites/staging/directory/trunk/content: ./ mavibot/user-guide.html mavibot/user-guide/4-btree-operations.html Date: Fri, 09 May 2014 15:21:20 -0000 To: commits@directory.apache.org From: buildbot@apache.org X-Mailer: svnmailer-1.0.9 Message-Id: <20140509152120.91CDA2388AAA@eris.apache.org> X-Virus-Checked: Checked by ClamAV on apache.org 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 @@
  • 4 - Mavibot B-tree operations

      +
    • Cursor informations
    • browse
    • contains
    • has
    • 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).

      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.

      4.1.2.4 prev

      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.

      -

      4.1 Browse Operations

      +

      4.2 Browse Operations

      Now that we know what a Cursor is about, we can describe the various browse operations that can be applied on a BTree.

      -

      4.1.1 BTree.browse()

      +

      4.2.1 BTree.browse()

      This method returns a cursor with the position set before the first element of the B-tree, for the current revision. It returns a TupleCursor that contain the tuples present in the Btree.

      Assuming you have an existing BTree, using this method is quite straigthforward. Here is an example with a persisted BTree :

          // Create a RecordManager that will contain the BTree
      @@ -232,12 +232,12 @@ returned).

      -

      4.1.2 BTree.browse( long )

      +

      4.2.2 BTree.browse( long )

      This method returns a cursor with the position set before the first element of the B-tree, for the given revision.

      Here, the big difference is that you can fetch some data from an older revision - assuming this revision is still present, of course -.

      It returns a TupleCursor that contain the tuples present in the Btree.

      You can use the exact same code than for the browse() method, except that you have to pass the version you want to browse.

      -

      4.1.3 BTree.browseFrom( K key )

      +

      4.2.3 BTree.browseFrom( K key )

      This method returns a cursor with the position set before the given key of the B-tree. 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)

      It returns a TupleCursor that contain the tuples present in the Btree.

      You can use the exact same code than for the browse() method. Here is an example, where we start after the latest present key :

      @@ -256,37 +256,37 @@ returned).

      -

      4.1.4 BTree.browseFrom( long revision, K key )

      +

      4.2.4 BTree.browseFrom( long revision, K key )

      TODO

      -

      4.2 Contains Operations

      -

      4.2.1 BTree.contains( K key, V value )

      +

      4.3 Contains Operations

      +

      4.3.1 BTree.contains( K key, V value )

      TODO

      -

      4.2.2 BTree.contains( long revision, K key, V value )

      +

      4.3.2 BTree.contains( long revision, K key, V value )

      TODO

      -

      4.3 Has Operations

      -

      4.3.1 BTree.hasKey( K key )

      +

      4.4 Has Operations

      +

      4.4.1 BTree.hasKey( K key )

      TODO

      -

      4.3.2 BTree.hasKey( long revision, K key )

      +

      4.4.2 BTree.hasKey( long revision, K key )

      TODO

      -

      4.4 Get Operations

      -

      4.4.1 BTree.get( K key )

      +

      4.5 Get Operations

      +

      4.5.1 BTree.get( K key )

      TODO

      -

      4.4.2 BTree.get( long revision, K key )

      +

      4.5.2 BTree.get( long revision, K key )

      TODO

      -

      4.4.3 BTree.getValues( K key )

      +

      4.5.3 BTree.getValues( K key )

      TODO

      -

      4.5 Insert Operation

      -

      4.6 Delete Operations

      -

      4.6.1 BTree.delete( K key )

      +

      4.6 Insert Operation

      +

      4.7 Delete Operations

      +

      4.8.1 BTree.delete( K key )

      TODO

      -

      4.6.2 BTree.delete( K key, V value )

      +

      4.7.2 BTree.delete( K key, V value )

      TODO

      -

      4.7 Other BTree operations

      -

      4.7.1 BTree.close()

      +

      4.8 Other BTree operations

      +

      4.8.1 BTree.close()

      TODO

      -

      4.7.2 BTree.flush()

      +

      4.8.2 BTree.flush()

      TODO

      -

      4.7.3 BTree.getRevision()

      +

      4.8.3 BTree.getRevision()

      TODO