Struct Dep 

pub struct Dep<Head, Tail>(pub Head, pub Tail);

Static dependency container (Heterogeneous List).

This structure allows storing mixed types of dependencies and accessing them in a zero-cost manner (offsets calculated at compile time).

Tuple Fields

0: Head

1: Tail

Implementations

impl Dep<(), ()>

pub fn new() -> Self

impl<Head, Tail> Dep<Head, Tail>

pub fn add<T>(self, item: T) -> Dep<T, Self>

Prepend a new dependency to the list.

pub fn get<T, I>(&self) -> &T

where Self: Has<T, I>,

Access a dependency by type.

The index I is automatically inferred by the compiler. This method shadows the trait method to provide better type inference.

pub fn get_mut<T, I>(&mut self) -> &mut T

where Self: Has<T, I>,

access a mutable dependency by type.

Trait Implementations

impl<Head: Clone, Tail: Clone> Clone for Dep<Head, Tail>

fn clone(&self) -> Dep<Head, Tail>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Head: Debug, Tail: Debug> Debug for Dep<Head, Tail>

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

Formats the value using the given formatter.

impl<Head: Default, Tail: Default> Default for Dep<Head, Tail>

fn default() -> Dep<Head, Tail>

Returns the “default value” for a type.

impl<T, Tail> Has<T, Here> for Dep<T, Tail>

Base case: The item matches the Head.

fn get(&self) -> &T

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

impl<Head, Tail, T, Index> Has<T, There<Index>> for Dep<Head, Tail>

where Tail: Has<T, Index>,

Recursive case: The item is not in Head, look into Tail.

fn get(&self) -> &T

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

impl<Head: Copy, Tail: Copy> Copy for Dep<Head, Tail>