struct RawConstraints<'a, 'tcx> {
regioncx: &'a RegionInferenceContext<'tcx>,
}
Fields§
§regioncx: &'a RegionInferenceContext<'tcx>
Trait Implementations§
source§impl<'a, 'this, 'tcx> GraphWalk<'this> for RawConstraints<'a, 'tcx>
impl<'a, 'this, 'tcx> GraphWalk<'this> for RawConstraints<'a, 'tcx>
type Node = RegionVid
type Edge = OutlivesConstraint<'tcx>
source§fn edges(&'this self) -> Edges<'this, OutlivesConstraint<'tcx>>
fn edges(&'this self) -> Edges<'this, OutlivesConstraint<'tcx>>
Returns all of the edges in this graph.
source§fn source(&'this self, edge: &OutlivesConstraint<'tcx>) -> RegionVid
fn source(&'this self, edge: &OutlivesConstraint<'tcx>) -> RegionVid
The source node for
edge
.source§fn target(&'this self, edge: &OutlivesConstraint<'tcx>) -> RegionVid
fn target(&'this self, edge: &OutlivesConstraint<'tcx>) -> RegionVid
The target node for
edge
.source§impl<'a, 'this, 'tcx> Labeller<'this> for RawConstraints<'a, 'tcx>
impl<'a, 'this, 'tcx> Labeller<'this> for RawConstraints<'a, 'tcx>
type Node = RegionVid
type Edge = OutlivesConstraint<'tcx>
source§fn graph_id(&'this self) -> Id<'this>
fn graph_id(&'this self) -> Id<'this>
Must return a DOT compatible identifier naming the graph.
source§fn node_id(&'this self, n: &RegionVid) -> Id<'this>
fn node_id(&'this self, n: &RegionVid) -> Id<'this>
Maps
n
to a unique identifier with respect to self
. The
implementor is responsible for ensuring that the returned name
is a valid DOT identifier.source§fn node_label(&'this self, n: &RegionVid) -> LabelText<'this>
fn node_label(&'this self, n: &RegionVid) -> LabelText<'this>
Maps
n
to a label that will be used in the rendered output.
The label need not be unique, and may be the empty string; the
default is just the output from node_id
.source§fn edge_label(&'this self, e: &OutlivesConstraint<'tcx>) -> LabelText<'this>
fn edge_label(&'this self, e: &OutlivesConstraint<'tcx>) -> LabelText<'this>
Maps
e
to a label that will be used in the rendered output.
The label need not be unique, and may be the empty string; the
default is in fact the empty string.source§fn node_style(&'a self, _n: &Self::Node) -> Style
fn node_style(&'a self, _n: &Self::Node) -> Style
Maps
n
to a style that will be used in the rendered output.source§fn edge_style(&'a self, _e: &Self::Edge) -> Style
fn edge_style(&'a self, _e: &Self::Edge) -> Style
Maps
e
to a style that will be used in the rendered output.Auto Trait Implementations§
impl<'a, 'tcx> Freeze for RawConstraints<'a, 'tcx>
impl<'a, 'tcx> !RefUnwindSafe for RawConstraints<'a, 'tcx>
impl<'a, 'tcx> !Send for RawConstraints<'a, 'tcx>
impl<'a, 'tcx> !Sync for RawConstraints<'a, 'tcx>
impl<'a, 'tcx> Unpin for RawConstraints<'a, 'tcx>
impl<'a, 'tcx> !UnwindSafe for RawConstraints<'a, 'tcx>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 8 bytes