Left

Struct Left 

Source
pub struct Left<PrevDirection>(/* private fields */);

Trait Implementations§

Source§

impl<Target, Req, SubtreeL, SubtreeR, SubtreePath> Get<Target, Left<SubtreePath>> for Node<Req, SubtreeL, SubtreeR>
where SubtreeL: Get<Target, SubtreePath>,

Source§

fn get(&self) -> &Target

Source§

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

Source§

impl<Req, ReqL, SubtreeLL, SubtreeLR, ReqR, SubtreeRL, SubtreeRR, NewReq, NextSubtreeL, PrevQueriesL> Insert<NewReq, <Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>> as MinDepth>::Output, Left<PrevQueriesL>, Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>>> for Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, Node<ReqR, SubtreeRL, SubtreeRR>>
where Node<ReqL, SubtreeLL, SubtreeLR>: MinDepth + Insert<NewReq, <NextSubtreeL as MinDepth>::Output, PrevQueriesL, NextSubtreeL>, Node<ReqR, SubtreeRL, SubtreeRR>: MinDepth, Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>>: MinDepth, NextSubtreeL: MinDepth, (): LessThan<<Node<ReqL, SubtreeLL, SubtreeLR> as MinDepth>::Output, <Node<ReqR, SubtreeRL, SubtreeRR> as MinDepth>::Output>,

Source§

type MinDepth = Succ<<Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>> as MinDepth>::Output>

Source§

type Queries = Left<PrevQueriesL>

Source§

fn insert( self, new_req: NewReq, ) -> Node<Req, NextSubtreeL, Node<ReqR, SubtreeRL, SubtreeRR>>

Inserts a new requirement into the tree. If you want to replace an existing requirement, remove it beforehand.
Source§

impl<Req, ReqR, NewReq> Insert<NewReq, Succ<Succ<Zero>>, Left<Right<Here>>, Node<Req, Node<NewReq, (), ()>, Node<ReqR, (), ()>>> for Node<Req, (), Node<ReqR, (), ()>>

Source§

type MinDepth = Succ<Succ<Zero>>

Source§

type Queries = Left<Here>

Source§

fn insert( self, new_req: NewReq, ) -> Node<Req, Node<NewReq, (), ()>, Node<ReqR, (), ()>>

Inserts a new requirement into the tree. If you want to replace an existing requirement, remove it beforehand.
Source§

impl<Req, NewReq> Insert<NewReq, Succ<Zero>, Left<Here>, Node<Req, Node<NewReq, (), ()>, ()>> for Node<Req, (), ()>

Source§

type MinDepth = Succ<Zero>

Source§

type Queries = Left<Here>

Source§

fn insert(self, new_req: NewReq) -> Node<Req, Node<NewReq, (), ()>, ()>

Inserts a new requirement into the tree. If you want to replace an existing requirement, remove it beforehand.

Auto Trait Implementations§

§

impl<PrevDirection> Freeze for Left<PrevDirection>

§

impl<PrevDirection> RefUnwindSafe for Left<PrevDirection>
where PrevDirection: RefUnwindSafe,

§

impl<PrevDirection> Send for Left<PrevDirection>
where PrevDirection: Send,

§

impl<PrevDirection> Sync for Left<PrevDirection>
where PrevDirection: Sync,

§

impl<PrevDirection> Unpin for Left<PrevDirection>
where PrevDirection: Unpin,

§

impl<PrevDirection> UnwindSafe for Left<PrevDirection>
where PrevDirection: UnwindSafe,

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> 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, U> TryFrom<U> for T
where U: Into<T>,

Source§

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>,

Source§

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.