class BDB::Btree - RDoc Documentation

# class BDB::Btree

Implementation of a sorted, balanced tree structure

Inherit from BDB::Common

### Public Instance Methods

stat(flags = 0) click to toggle source

Return an Hash with the fields (description for 4.0.14)

- bt_magic : Magic number that identifies the file as a Btree database.

- bt_version : The version of the Btree database.

- bt_nkeys : the number of unique keys in the database.

- bt_ndata : the number of key/data pairs in the database.

- bt_pagesize : Underlying database page size, in bytes.

- bt_minkey : The minimum keys per page.

- bt_re_len : The length of fixed-length records.

- bt_re_pad : The padding byte value for fixed-length records.

- bt_levels : Number of levels in the database.

- bt_int_pg : Number of database internal pages.

- bt_leaf_pg : Number of database leaf pages.

- bt_dup_pg : Number of database duplicate pages.

- bt_over_pg : Number of database overflow pages.

- bt_free : Number of pages on the free list.

- bt_int_pgfree : Number of bytes free in database internal pages.

- bt_leaf_pgfree : Number of bytes free in database leaf pages.

- bt_dup_pgfree : Number of bytes free in database duplicate pages.

- bt_over_pgfree : Number of bytes free in database overflow pages.

    # File comxxx.rb, line 25
    def stat(flags = 0)
    end