pub struct NamedViewResolver<'a> { /* private fields */ }Expand description
Resolves named views from explicit execution data without engine calls.
Implementations§
Source§impl<'a> NamedViewResolver<'a>
impl<'a> NamedViewResolver<'a>
Sourcepub fn new(
artifact_graph: &'a ArtifactGraph,
operations: &'a IndexMap<ModuleId, Vec<Operation>>,
filenames: &IndexMap<ModuleId, ModulePath>,
) -> Result<Self, ViewResolutionError>
pub fn new( artifact_graph: &'a ArtifactGraph, operations: &'a IndexMap<ModuleId, Vec<Operation>>, filenames: &IndexMap<ModuleId, ModulePath>, ) -> Result<Self, ViewResolutionError>
Validates module paths before constructing complete named-view metadata.
Sourcepub fn list(&self) -> Vec<NamedViewInfo>
pub fn list(&self) -> Vec<NamedViewInfo>
Returns declared views in graph order.
- Views from imported modules are included.
- Repeated display names remain separate entries.
- The computed default is excluded because it is not declared.
pub fn resolve( &self, target: &ViewTarget, ) -> Result<ResolvedView, ViewResolutionError>
Trait Implementations§
Auto Trait Implementations§
impl<'a> Freeze for NamedViewResolver<'a>
impl<'a> RefUnwindSafe for NamedViewResolver<'a>
impl<'a> Send for NamedViewResolver<'a>
impl<'a> Sync for NamedViewResolver<'a>
impl<'a> Unpin for NamedViewResolver<'a>
impl<'a> UnsafeUnpin for NamedViewResolver<'a>
impl<'a> UnwindSafe for NamedViewResolver<'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
impl<T, U> Imply<T> for U
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<T> IntoResult<T> for T
impl<T> IntoResult<T> for T
type Err = !
fn into_result(self) -> Result<T, <T as IntoResult<T>>::Err>
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.