Enum StorageAction 

pub enum StorageAction {
    Reference(BlockInfo, References),
    Unreference(BlockInfo, References),
    Structure(BTreeMap<WeakCid, References>),
    ReferenceCreate(BlockInfo, References),
    Remove(BlockInfo, BTreeSet<WeakCid>, bool),
    Delete(BlockInfo, BTreeMap<WeakCid, BTreeSet<WeakCid>>, bool),
    TagsInsert(BTreeSet<WeakCid>, Tags),
    TagsRemove(BTreeSet<WeakCid>, Tags),
    PinCreate(String, PinStrategy, References),
    PinUpdate(String, PinStrategy),
    PinReference(String, References),
    PinRemove(String),
    Batch(CoList<StorageAction>),
}

Variants

Reference(BlockInfo, References)

Increase [Cid] reference count by one. Refernces are creates on-the-fly if not exist. Shallow: [Cid] links are not added automatically (not recusrive).

Args

• BlockInfo contains causality data about the reference
• The blocks to reference
• Tags will be merged with BlockMetadata::tags

Unreference(BlockInfo, References)

Decrease [Cid] reference count by one.

Structure(BTreeMap<WeakCid, References>)

Structurally reference/delete [Cid]. Expects all children references passed for a parent even is they not exist on disk.

Vec Arguments

• 0: The parent reference.
• 1: The links of the parent reference.

ReferenceCreate(BlockInfo, References)

Create [Cid] references with ref count of zero if the reference not exists yet. This is normally used to track newly created blocks.

Arguments

• 0: The [Cid] of entries to create.

Remove(BlockInfo, BTreeSet<WeakCid>, bool)

Mark to remove [Cid]. This will make the references shallow again. And eventually shedule them to delete.

Note

This is basically the same as Unreference.

Arguments

• 0: The BlockInfo of the blocks to remove.
• 0: The [Cid] of entries to remove.
• 1: Force remove all instances.

Delete(BlockInfo, BTreeMap<WeakCid, BTreeSet<WeakCid>>, bool)

Delete [Cid] references.

Arguments

• 0: The [Cid] of entries to remove with all of its direct children.
• 1: Force delete. If false only references with a zero ref count will be removed.

TagsInsert(BTreeSet<WeakCid>, Tags)

Append tags to references.

TagsRemove(BTreeSet<WeakCid>, Tags)

Remove tags from references.

PinCreate(String, PinStrategy, References)

Create a named pin and reference all specified [Cid]s.

PinUpdate(String, PinStrategy)

Update a named pin by setting the PinStrategy.

PinReference(String, References)

Insert references to a named pin and reference all specified [Cid]s.

PinRemove(String)

Remove a named pin and unreference all [Cid]s.

Batch(CoList<StorageAction>)

Batch process actions.

Trait Implementations

impl Clone for StorageAction

fn clone(&self) -> StorageAction

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for StorageAction

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for StorageAction

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for StorageAction

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for StorageAction

fn cmp(&self, other: &StorageAction) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for StorageAction

fn eq(&self, other: &StorageAction) -> 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 PartialOrd for StorageAction

fn partial_cmp(&self, other: &StorageAction) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Reducer<StorageAction> for Storage

async fn reduce( state: OptionLink<Self>, event: Link<ReducerAction<StorageAction>>, storage: &CoreBlockStorage, ) -> Result<Link<Self>, Error>

impl Serialize for StorageAction

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for StorageAction

impl StructuralPartialEq for StorageAction