pub(super) struct TraverseCoverageGraphWithLoops<'a> {
basic_coverage_blocks: &'a CoverageGraph,
backedges: IndexVec<BasicCoverageBlock, Vec<BasicCoverageBlock>>,
context_stack: Vec<TraversalContext>,
visited: BitSet<BasicCoverageBlock>,
}
Fields§
§basic_coverage_blocks: &'a CoverageGraph
§backedges: IndexVec<BasicCoverageBlock, Vec<BasicCoverageBlock>>
§context_stack: Vec<TraversalContext>
§visited: BitSet<BasicCoverageBlock>
Implementations§
source§impl<'a> TraverseCoverageGraphWithLoops<'a>
impl<'a> TraverseCoverageGraphWithLoops<'a>
pub(super) fn new(basic_coverage_blocks: &'a CoverageGraph) -> Self
sourcepub(super) fn reloop_bcbs_per_loop(
&self
) -> impl Iterator<Item = &[BasicCoverageBlock]>
pub(super) fn reloop_bcbs_per_loop( &self ) -> impl Iterator<Item = &[BasicCoverageBlock]>
For each loop on the loop context stack (top-down), yields a list of BCBs within that loop that have an outgoing edge back to the loop header.
pub(super) fn next(&mut self) -> Option<BasicCoverageBlock>
pub fn add_successors_to_worklists(&mut self, bcb: BasicCoverageBlock)
pub fn is_complete(&self) -> bool
pub fn unvisited(&self) -> Vec<BasicCoverageBlock>
Auto Trait Implementations§
impl<'a> !DynSend for TraverseCoverageGraphWithLoops<'a>
impl<'a> !DynSync for TraverseCoverageGraphWithLoops<'a>
impl<'a> Freeze for TraverseCoverageGraphWithLoops<'a>
impl<'a> RefUnwindSafe for TraverseCoverageGraphWithLoops<'a>
impl<'a> Send for TraverseCoverageGraphWithLoops<'a>
impl<'a> Sync for TraverseCoverageGraphWithLoops<'a>
impl<'a> Unpin for TraverseCoverageGraphWithLoops<'a>
impl<'a> UnwindSafe for TraverseCoverageGraphWithLoops<'a>
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
§impl<T> Filterable for T
impl<T> Filterable for T
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<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
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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<'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: 88 bytes