Struct Node 

pub struct Node<Req, SubtreeL, SubtreeR> {
    pub requirement: Req,
    pub prev_left: SubtreeL,
    pub prev_right: SubtreeR,
}

Fields

requirement: Req

prev_left: SubtreeL

prev_right: SubtreeR

Trait Implementations

impl<Req, SubtreeL, SubtreeR> Depth for Node<Req, SubtreeL, SubtreeR>

where SubtreeL: Depth, SubtreeR: Depth, <SubtreeL as Depth>::Output: IsNumber, <SubtreeR as Depth>::Output: IsNumber, (): Max<<SubtreeL as Depth>::Output, <SubtreeR as Depth>::Output>,

type Output = Succ<<() as Max<<SubtreeL as Depth>::Output, <SubtreeR as Depth>::Output>>::Output>

impl<Target, SubtreeL, SubtreeR> Get<Target, Here> for Node<Target, SubtreeL, SubtreeR>

fn get(&self) -> &Target

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

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

where SubtreeL: Get<Target, SubtreePath>,

fn get(&self) -> &Target

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

impl<Target, Req, SubtreeL, SubtreeR, SubtreePath> Get<Target, Right<SubtreePath>> for Node<Req, SubtreeL, SubtreeR>

where SubtreeR: Get<Target, SubtreePath>,

fn get(&self) -> &Target

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

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

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

type Queries = Left<PrevQueriesL>

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.

impl<Req, ReqL, SubtreeLL, SubtreeLR, ReqR, SubtreeRL, SubtreeRR, NewReq, NextSubtreeR, PrevQueriesR> Insert<NewReq, <Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR> as MinDepth>::Output, Right<PrevQueriesR>, Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR>> for Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, Node<ReqR, SubtreeRL, SubtreeRR>>

where Node<ReqL, SubtreeLL, SubtreeLR>: MinDepth, Node<ReqR, SubtreeRL, SubtreeRR>: MinDepth + Insert<NewReq, <NextSubtreeR as MinDepth>::Output, PrevQueriesR, NextSubtreeR>, Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR>: MinDepth, NextSubtreeR: MinDepth, (): GreaterThanOrEqual<<Node<ReqL, SubtreeLL, SubtreeLR> as MinDepth>::Output, <Node<ReqR, SubtreeRL, SubtreeRR> as MinDepth>::Output>,

type MinDepth = Succ<<Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR> as MinDepth>::Output>

type Queries = Right<PrevQueriesR>

fn insert( self, new_req: NewReq, ) -> Node<Req, Node<ReqL, SubtreeLL, SubtreeLR>, NextSubtreeR>

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

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

type MinDepth = Succ<Succ<Zero>>

type Queries = Left<Here>

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.

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

type MinDepth = Succ<Succ<Zero>>

type Queries = Right<Here>

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

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

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

type MinDepth = Succ<Zero>

type Queries = Left<Here>

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.

impl<Req, SubtreeL, SubtreeR> MinDepth for Node<Req, SubtreeL, SubtreeR>

where SubtreeL: MinDepth, SubtreeR: MinDepth, <SubtreeL as MinDepth>::Output: IsNumber, <SubtreeR as MinDepth>::Output: IsNumber, (): Min<<SubtreeL as MinDepth>::Output, <SubtreeR as MinDepth>::Output>,

type Output = Succ<<() as Min<<SubtreeL as MinDepth>::Output, <SubtreeR as MinDepth>::Output>>::Output>