Struct sanakirja::Txn

pub struct Txn<L, E: Borrow<Env<L>>> { /* fields omitted */ }

An immutable transaction.

Implementations

impl<L, E: Borrow<Env<L>>> Txn<L, E>

pub fn statistics(&self) -> Statistics

Compute statistics about pages. This is a potentially costlty operation, as we need to go through all bookkeeping pages.

pub fn references<K: Representable, V: Representable>(
    &self,
    h: &mut HashMap<u64, usize>,
    root: Db<K, V>
)

Fills the h argument with the set of all pages referenced at least once in the tree whose root is root.

pub fn check_references(&self, refs: &mut HashMap<u64, usize>)

Checks that the references match the RC table.

Trait Implementations

impl<L, E: Borrow<Env<L>>> Drop for Txn<L, E>

pub fn drop(&mut self)

Executes the destructor for this type.

impl<L, E: Borrow<Env<L>>> LoadPage for Txn<L, E>

pub fn load_page(&self, off: u64) -> Result<Page, CRCError>

Find the appropriate map segment

pub fn root_(&self, num: usize) -> u64

Offset (in bytes, from the beginning of the file) to root number num.

impl<L, E: Borrow<Env<L>>> Transaction for Txn<L, E>

pub fn iter<'a, K: Representable, V: Representable>(
    &'a self,
    db: &'a Db<K, V>,
    key: Option<(K, Option<V>)>
) -> Result<DbIterator<'a, Self, K, V>, CRCError>

Iterate over a database, starting at the first value larger than or equal to (key, value) (and at the smallest key, or smallest value if one or both of them is None).

pub fn rev_iter<'a, K: Representable, V: Representable>(
    &'a self,
    db: &'a Db<K, V>,
    key: Option<(K, Option<V>)>
) -> Result<RevDbIterator<'a, Self, K, V>, CRCError>

Iterate over a database in the reverse order, starting from the last binding strictly before k (or from the last binding in the table if k.is_none()).

pub fn set_cursors<K: Representable, V: Representable>(
    &self,
    root: &Db<K, V>,
    key: Option<(K, Option<V>)>
) -> Result<(Cursor, bool), CRCError>

Create a cursor positionned just on the largest (key, value) that is strictly smaller than key (at the beginning if key.is_none()).

pub fn set_cursors_last<K: Representable, V: Representable>(
    &self,
    root: &Db<K, V>
) -> Result<Cursor, CRCError>

Create a cursor positionned just on the largest (key, value) that is strictly smaller than key (at the beginning if key.is_none()).

pub fn root<K: Representable, V: Representable>(
    &self,
    root: usize
) -> Option<Db<K, V>>

Gets the specified root. At most 508 different roots are allowed.

pub fn get<'a, K: Representable, V: Representable>(
    &'a self,
    root: &Db<K, V>,
    key: K,
    value: Option<V>
) -> Result<Option<V>, CRCError>

Get the smallest value associated to key, or returns the given binding if value is Some(..) and is associated to key in the given database.