Struct moving_gc_arena::traverse::CallStack

pub struct CallStack;

A simple traversal using the call stack as memory, with iteration using HasIx::foreach_ix. While very general and performant, this means that these traversals are succeptible to stack overflows, and that only the greatest common denominator of features is supported.

Trait Implementations

impl Clone for CallStack

pub fn clone(&self) -> CallStack

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for CallStack

impl Eq for CallStack

impl PartialEq<CallStack> for CallStack

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T: 'static + HasIx<T>> Strategy<T, PreAndPost> for CallStack

pub fn run<'a, F, V>(
    &self,
    get_next: &mut F,
    visitor: &mut V,
    next: Entry<'_, T>
) where
    F: FnMut(Ix<T>) -> Option<Entry<'a, T>>,
    V: Visitor<T, PreAndPost>, 

Runs the traversal for a given starting point and function to get next entries by index. Should visit a corresponding state of the visitor for each entry.

impl<T: 'static + HasIx<T>> Strategy<T, PreOnly> for CallStack

pub fn run<'a, F, V>(
    &self,
    get_next: &mut F,
    visitor: &mut V,
    next: Entry<'_, T>
) where
    F: FnMut(Ix<T>) -> Option<Entry<'a, T>>,
    V: Visitor<T, PreOnly>, 

Runs the traversal for a given starting point and function to get next entries by index. Should visit a corresponding state of the visitor for each entry.

impl StructuralEq for CallStack

impl StructuralPartialEq for CallStack