Enum Algorithm

pub enum Algorithm {
    Archive,
    EarlyMerge,
    OverlayRecent,
    RefCounted,
}

Journal database operating strategy.

Variants

Archive

Keep all keys forever.

EarlyMerge

Ancient and recent history maintained separately; recent history lasts for particular number of blocks.

Inserts go into backing database, journal retains knowledge of whether backing DB key is ancient or recent. Non-canon inserts get explicitly reverted and removed from backing DB.

OverlayRecent

Ancient and recent history maintained separately; recent history lasts for particular number of blocks.

Inserts go into memory overlay, which is tried for key fetches. Memory overlay gets flushed in backing only at end of recent history.

RefCounted

Ancient and recent history maintained separately; recent history lasts for particular number of blocks.

References are counted in disk-backed DB.

Implementations

impl Algorithm

pub fn as_str(&self) -> &'static str

Returns static str describing journal database algorithm.

pub fn as_internal_name_str(&self) -> &'static str

Returns static str describing journal database algorithm.

pub fn is_stable(&self) -> bool

Returns true if pruning strategy is stable

pub fn all_types() -> Vec<Algorithm>

Returns all algorithm types.

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl Display for Algorithm

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

Formats the value using the given formatter.

impl FromStr for Algorithm

type Err = String

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl PartialEq for Algorithm

fn eq(&self, other: &Algorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for Algorithm

impl StructuralPartialEq for Algorithm