pub struct TraitImpl {
pub def_id: TraitImplId,
pub item_meta: ItemMeta,
pub impl_trait: TraitDeclRef,
pub generics: GenericParams,
pub parent_trait_refs: Vector<TraitClauseId, TraitRef>,
pub consts: Vec<(TraitItemName, GlobalDeclRef)>,
pub types: Vec<(TraitItemName, Ty)>,
pub type_clauses: Vec<(TraitItemName, Vector<TraitClauseId, TraitRef>)>,
pub methods: Vec<(TraitItemName, Binder<FunDeclRef>)>,
}
Expand description
A trait implementation.
For instance:
impl Foo for List {
type Bar = ...
fn baz(...) { ... }
}
Fields§
§def_id: TraitImplId
§item_meta: ItemMeta
§impl_trait: TraitDeclRef
The information about the implemented trait. Note that this contains the instantiation of the “parent” clauses.
generics: GenericParams
§parent_trait_refs: Vector<TraitClauseId, TraitRef>
The trait references for the parent clauses (see TraitDecl).
consts: Vec<(TraitItemName, GlobalDeclRef)>
The associated constants declared in the trait.
types: Vec<(TraitItemName, Ty)>
The associated types declared in the trait.
type_clauses: Vec<(TraitItemName, Vector<TraitClauseId, TraitRef>)>
The Vec
corresponds to the same Vector
in TraitDecl
. In the same way, this is
empty after the lift_associated_item_clauses
pass.
methods: Vec<(TraitItemName, Binder<FunDeclRef>)>
The implemented methods
Implementations§
source§impl TraitImpl
impl TraitImpl
pub fn methods( &self, ) -> impl Iterator<Item = &(TraitItemName, Binder<FunDeclRef>)>
Trait Implementations§
source§impl AstVisitable for TraitImpl
impl AstVisitable for TraitImpl
source§fn drive<V: VisitAst>(&self, v: &mut V) -> ControlFlow<V::Break>
fn drive<V: VisitAst>(&self, v: &mut V) -> ControlFlow<V::Break>
Recursively visit this type with the provided visitor. This calls the visitor’s
visit_$any
method if it exists, otherwise visit_inner
.source§fn drive_mut<V: VisitAstMut>(&mut self, v: &mut V) -> ControlFlow<V::Break>
fn drive_mut<V: VisitAstMut>(&mut self, v: &mut V) -> ControlFlow<V::Break>
Recursively visit this type with the provided visitor. This calls the visitor’s
visit_$any
method if it exists, otherwise visit_inner
.source§fn dyn_visit<T: AstVisitable>(&self, f: impl FnMut(&T))
fn dyn_visit<T: AstVisitable>(&self, f: impl FnMut(&T))
Visit all occurrences of that type inside
self
, in pre-order traversal.source§fn dyn_visit_mut<T: AstVisitable>(&mut self, f: impl FnMut(&mut T))
fn dyn_visit_mut<T: AstVisitable>(&mut self, f: impl FnMut(&mut T))
Visit all occurrences of that type inside
self
, in pre-order traversal.source§impl<'de> Deserialize<'de> for TraitImpl
impl<'de> Deserialize<'de> for TraitImpl
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<'s, V> Drive<'s, V> for TraitImplwhere
V: Visitor + Visit<'s, ItemMeta> + Visit<'s, TraitDeclRef> + Visit<'s, GenericParams> + Visit<'s, Vector<TraitClauseId, TraitRef>> + Visit<'s, Vec<(TraitItemName, GlobalDeclRef)>> + Visit<'s, Vec<(TraitItemName, Ty)>> + Visit<'s, Vec<(TraitItemName, Vector<TraitClauseId, TraitRef>)>> + Visit<'s, Vec<(TraitItemName, Binder<FunDeclRef>)>>,
impl<'s, V> Drive<'s, V> for TraitImplwhere
V: Visitor + Visit<'s, ItemMeta> + Visit<'s, TraitDeclRef> + Visit<'s, GenericParams> + Visit<'s, Vector<TraitClauseId, TraitRef>> + Visit<'s, Vec<(TraitItemName, GlobalDeclRef)>> + Visit<'s, Vec<(TraitItemName, Ty)>> + Visit<'s, Vec<(TraitItemName, Vector<TraitClauseId, TraitRef>)>> + Visit<'s, Vec<(TraitItemName, Binder<FunDeclRef>)>>,
source§fn drive_inner(&'s self, visitor: &mut V) -> ControlFlow<V::Break>
fn drive_inner(&'s self, visitor: &mut V) -> ControlFlow<V::Break>
Call
v.visit()
on the immediate contents of self
.source§impl<'s, V> DriveMut<'s, V> for TraitImplwhere
V: Visitor + VisitMut<'s, ItemMeta> + VisitMut<'s, TraitDeclRef> + VisitMut<'s, GenericParams> + VisitMut<'s, Vector<TraitClauseId, TraitRef>> + VisitMut<'s, Vec<(TraitItemName, GlobalDeclRef)>> + VisitMut<'s, Vec<(TraitItemName, Ty)>> + VisitMut<'s, Vec<(TraitItemName, Vector<TraitClauseId, TraitRef>)>> + VisitMut<'s, Vec<(TraitItemName, Binder<FunDeclRef>)>>,
impl<'s, V> DriveMut<'s, V> for TraitImplwhere
V: Visitor + VisitMut<'s, ItemMeta> + VisitMut<'s, TraitDeclRef> + VisitMut<'s, GenericParams> + VisitMut<'s, Vector<TraitClauseId, TraitRef>> + VisitMut<'s, Vec<(TraitItemName, GlobalDeclRef)>> + VisitMut<'s, Vec<(TraitItemName, Ty)>> + VisitMut<'s, Vec<(TraitItemName, Vector<TraitClauseId, TraitRef>)>> + VisitMut<'s, Vec<(TraitItemName, Binder<FunDeclRef>)>>,
source§fn drive_inner_mut(&'s mut self, visitor: &mut V) -> ControlFlow<V::Break>
fn drive_inner_mut(&'s mut self, visitor: &mut V) -> ControlFlow<V::Break>
Call
v.visit()
on the immediate contents of self
.source§impl<C: AstFormatter> FmtWithCtx<C> for TraitImpl
impl<C: AstFormatter> FmtWithCtx<C> for TraitImpl
Auto Trait Implementations§
impl Freeze for TraitImpl
impl RefUnwindSafe for TraitImpl
impl Send for TraitImpl
impl Sync for TraitImpl
impl Unpin for TraitImpl
impl UnwindSafe for TraitImpl
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<I, T> ExtractContext<I, ()> for T
impl<I, T> ExtractContext<I, ()> for T
§fn extract_context(self, _original_input: I)
fn extract_context(self, _original_input: I)
Given the context attached to a nom error, and given the original
input to the nom parser, extract more the useful context information. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§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 more§impl<I> RecreateContext<I> for I
impl<I> RecreateContext<I> for I
§fn recreate_context(_original_input: I, tail: I) -> I
fn recreate_context(_original_input: I, tail: I) -> I
Given the original input, as well as the context reported by nom,
recreate a context in the original string where the error occurred. Read more
source§impl<T> TyVisitable for Twhere
T: AstVisitable,
impl<T> TyVisitable for Twhere
T: AstVisitable,
fn substitute(self, generics: &GenericArgs) -> Self
fn substitute_with_self( self, generics: &GenericArgs, self_ref: &TraitRefKind, ) -> Self
source§fn move_under_binder(self) -> Self
fn move_under_binder(self) -> Self
Move under one binder.
source§fn move_under_binders(self, depth: DeBruijnId) -> Self
fn move_under_binders(self, depth: DeBruijnId) -> Self
Move under
depth
binders.source§fn move_from_under_binders(self, depth: DeBruijnId) -> Option<Self>
fn move_from_under_binders(self, depth: DeBruijnId) -> Option<Self>
Move the value out of
depth
binders. Returns None
if it contains a variable bound in
one of these depth
binders.source§fn visit_db_id<B>(
&mut self,
f: impl FnMut(&mut DeBruijnId) -> ControlFlow<B>,
) -> ControlFlow<B>
fn visit_db_id<B>( &mut self, f: impl FnMut(&mut DeBruijnId) -> ControlFlow<B>, ) -> ControlFlow<B>
Visit the de Bruijn ids contained in
self
, as seen from the outside of self
. This means
that any variable bound inside self
will be skipped, and all the seen indices will count
from the outside of self.