[][src]Struct c2rust_refactor::util::dataflow::Ctxt

pub struct Ctxt<'a, K: 'a, V: 'a> { /* fields omitted */ }

Worklist algorithm context. K is the type of keys, which identify nodes, and V is the type of value associated with each node. Allows indexing to retrieve data from other nodes. Accessing the current node's data triggers a panic.

Trait Implementations

impl<'a, K, V> Index<K> for Ctxt<'a, K, V> where
    K: Hash + Eq + Clone + Debug
[src]

type Output = V

The returned type after indexing.

Auto Trait Implementations

impl<'a, K, V> !Send for Ctxt<'a, K, V>

impl<'a, K, V> !Sync for Ctxt<'a, K, V>

Blanket Implementations

impl<T> Lone for T[src]

impl<T> From for T[src]

impl<T, U> Into for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T> Borrow for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> BorrowMut for T where
    T: ?Sized
[src]

impl<T, U> TryInto for T where
    U: TryFrom<T>, 
[src]

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

The type returned in the event of a conversion error.

impl<E> SpecializationError for E[src]

impl<T> Erased for T[src]

impl<T> Send for T where
    T: ?Sized
[src]

impl<T> Sync for T where
    T: ?Sized
[src]

impl<T> Same for T

type Output = T

Should always be Self

impl<T> MaybeResult for T[src]

impl<'a, T> Captures for T where
    T: ?Sized
[src]

impl<T> Erased for T

impl<T> Make for T[src]

impl<T> Slottable for T[src]