Struct sanakirja::btree::Db_

pub struct Db_<K, V, P> where
    P: BTreePage<K, V>,
    K: ?Sized,
    V: ?Sized,  {
    pub db: u64,
    pub k: PhantomData<K>,
    pub v: PhantomData<V>,
    pub p: PhantomData<P>,
}

A database, which is essentially just a page offset along with markers.

Fields

db: u64

k: PhantomData<K>

v: PhantomData<V>

p: PhantomData<P>

Implementations

impl<K, V, P> Db_<K, V, P> where
    P: BTreePage<K, V>,
    K: ?Sized,
    V: ?Sized, 

pub fn from_page(db: u64) -> Db_<K, V, P>

Load a database from a page offset.

Trait Implementations

impl<K, V, P> Debug for Db_<K, V, P> where
    K: Debug + ?Sized,
    V: Debug + ?Sized,
    P: Debug + BTreePage<K, V>, 

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<K, V, P> Storable for Db_<K, V, P> where
    K: Storable,
    V: Storable,
    P: BTreePage<K, V> + Debug, 

type PageReferences = Once<u64>

An iterator over the offsets to pages contained in this value. Only values from this crate can generate non-empty iterators, but combined values (like tuples) must chain the iterators returned by method page_offsets.

pub fn page_references(&self) -> <Db_<K, V, P> as Storable>::PageReferences

If this value is an offset to another page at offset offset, return Some(offset). Return None else.

pub fn drop<T>(&self, t: &mut T) -> Result<(), <T as LoadPage>::Error> where
    T: AllocPage, 

If this value is an offset to another page at offset offset, return Some(offset). Return None else.

fn compare<T>(&self, _txn: &T, _b: &Self) -> Ordering where
    T: LoadPage, 

This is required for B trees, not necessarily for other structures. The default implementation panics.