Enum orx_linked_list::NodeIndexError

source ·
pub enum NodeIndexError {
    RemovedNode,
    WrongCollection,
    ReorganizedCollection,
}
Expand description

Error observed while using a NodeIndex to access a node in a SelfRefCol.

Variants§

§

RemovedNode

RemovedNode => Referenced node is removed from the collection. Node index can only be used if the corresponding node still belongs to the collection.

§Examples

use orx_selfref_col::*;

#[derive(Clone, Copy, Debug)]
struct Var;
impl<'a> Variant<'a, char> for Var {
    type Storage = NodeDataLazyClose<char>;
    type Prev = NodeRefSingle<'a, Self, char>;
    type Next = NodeRefsVec<'a, Self, char>;
    type Ends = NodeRefsArray<'a, 2, Self, char>;
    type MemoryReclaim = MemoryReclaimOnThreshold<2>;
}

let mut col = SelfRefCol::<Var, _>::new();
let [a, b, c, d, e, f, g] = col
    .mutate_take(['a', 'b', 'c', 'd', 'e', 'f', 'g'], |x, values| {
        values.map(|val| x.push_get_ref(val).index(&x))
    });

let removed_b = col.mutate_take(b, |x, b| x.as_node_ref(b).close_node_take_data(&x)); // does not trigger reclaim yet
assert_eq!(removed_b, 'b');

assert_eq!(a.invalidity_reason_for_collection(&col), None);
assert_eq!(c.invalidity_reason_for_collection(&col), None);

assert_eq!(b.invalidity_reason_for_collection(&col), Some(NodeIndexError::RemovedNode));
§

WrongCollection

WrongCollection => Node index is used on a collection different than the collection it is created for. Node indices can only be used for the collection they belong to.

§Examples

use orx_selfref_col::*;

#[derive(Clone, Copy, Debug)]
struct Var;
impl<'a> Variant<'a, char> for Var {
    type Storage = NodeDataLazyClose<char>;
    type Prev = NodeRefSingle<'a, Self, char>;
    type Next = NodeRefsVec<'a, Self, char>;
    type Ends = NodeRefsArray<'a, 2, Self, char>;
    type MemoryReclaim = MemoryReclaimOnThreshold<2>;
}

let mut col1 = SelfRefCol::<Var, _>::new();
let a = col1.mutate_take('a', |x, a| x.push_get_ref(a).index(&x));

let col2 = SelfRefCol::<Var, _>::new();

assert_eq!(a.invalidity_reason_for_collection(&col1), None);
assert_eq!(a.invalidity_reason_for_collection(&col2), Some(NodeIndexError::WrongCollection));
§

ReorganizedCollection

ReorganizedCollection => All nodes of the containing collection is re-organized in order to reclaim memory of closed nodes. Such a reorganization happens only if the collection uses MemoryReclaimOnThreshold policy and utilization level of memory drops below the threshold due to pop and remove operations. It is never observed if the list only grows or if MemoryReclaimNever policy is used. In this case, the references need to be recreated.

§Examples

use orx_selfref_col::*;

#[derive(Clone, Copy, Debug)]
struct Var;
impl<'a> Variant<'a, char> for Var {
    type Storage = NodeDataLazyClose<char>;
    type Prev = NodeRefSingle<'a, Self, char>;
    type Next = NodeRefsVec<'a, Self, char>;
    type Ends = NodeRefsArray<'a, 2, Self, char>;
    type MemoryReclaim = MemoryReclaimOnThreshold<2>;
}

let mut col = SelfRefCol::<Var, _>::new();
let [a, b, c] = col.mutate_take(['a', 'b', 'c'], |x, values| {
    values.map(|val| x.push_get_ref(val).index(&x))
});

// triggers memory reclaim, invalidating all prior node indices
let removed_b = col.mutate_take(b, |x, b| x.as_node_ref(b).close_node_take_data(&x));
assert_eq!(removed_b, 'b');

assert_eq!(a.invalidity_reason_for_collection(&col), Some(NodeIndexError::ReorganizedCollection));
assert_eq!(b.invalidity_reason_for_collection(&col), Some(NodeIndexError::ReorganizedCollection));
assert_eq!(c.invalidity_reason_for_collection(&col), Some(NodeIndexError::ReorganizedCollection));

Trait Implementations§

source§

impl Clone for NodeIndexError

source§

fn clone(&self) -> NodeIndexError

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for NodeIndexError

source§

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

Formats the value using the given formatter. Read more
source§

impl Display for NodeIndexError

source§

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

Formats the value using the given formatter. Read more
source§

impl Error for NodeIndexError

1.30.0 · source§

fn source(&self) -> Option<&(dyn Error + 'static)>

Returns the lower-level source of this error, if any. Read more
1.0.0 · source§

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()
1.0.0 · source§

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
source§

fn provide<'a>(&'a self, request: &mut Request<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)
Provides type-based access to context intended for error reports. Read more
source§

impl PartialEq for NodeIndexError

source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

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

impl Copy for NodeIndexError

source§

impl Eq for NodeIndexError

source§

impl StructuralPartialEq for NodeIndexError

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

default unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> CloneToUninit for T
where T: Copy,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> ToString for T
where T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<'a, V, T, P> CanLeak<'a, V, T, P> for T
where V: Variant<'a, T>, P: PinnedVec<Node<'a, V, T>>,