Struct ra_ap_hir_expand::InFile

pub struct InFile<T> {
    pub file_id: HirFileId,
    pub value: T,
}

InFile<T> stores a value of T inside a particular file/syntax tree.

Typical usages are:

• InFile<SyntaxNode> – syntax node in a file
• InFile<ast::FnDef> – ast node in a file
• InFile<TextSize> – offset in a file

Fields

file_id: HirFileId

value: T

Implementations

impl<N: AstIdNode> InFile<FileAstId<N>>

pub fn to_node(&self, db: &dyn ExpandDatabase) -> N

pub fn to_in_file_node(&self, db: &dyn ExpandDatabase) -> InFile<N>

pub fn to_ptr(&self, db: &dyn ExpandDatabase) -> AstPtr<N>

impl InFile<Idx<SyntaxNodePtr<RustLanguage>>>

pub fn to_ptr(&self, db: &dyn ExpandDatabase) -> SyntaxNodePtr

impl<T> InFile<T>

pub fn new(file_id: HirFileId, value: T) -> InFile<T>

pub fn with_value<U>(&self, value: U) -> InFile<U>

pub fn map<F: FnOnce(T) -> U, U>(self, f: F) -> InFile<U>

pub fn as_ref(&self) -> InFile<&T>

pub fn file_syntax(&self, db: &dyn ExpandDatabase) -> SyntaxNode

impl<T: Clone> InFile<&T>

pub fn cloned(&self) -> InFile<T>

impl<T> InFile<Option<T>>

pub fn transpose(self) -> Option<InFile<T>>

impl<L, R> InFile<Either<L, R>>

pub fn transpose(self) -> Either<InFile<L>, InFile<R>>

impl InFile<&SyntaxNode>

pub fn ancestors_with_macros( self, db: &dyn ExpandDatabase ) -> impl Iterator<Item = InFile<SyntaxNode>> + Clone + '_

pub fn ancestors_with_macros_skip_attr_item( self, db: &dyn ExpandDatabase ) -> impl Iterator<Item = InFile<SyntaxNode>> + '_

Skips the attributed item that caused the macro invocation we are climbing up

pub fn original_file_range(self, db: &dyn ExpandDatabase) -> FileRange

Falls back to the macro call range if the node cannot be mapped up fully.

For attributes and derives, this will point back to the attribute only. For the entire item use InFile::original_file_range_full.

pub fn original_file_range_full(self, db: &dyn ExpandDatabase) -> FileRange

Falls back to the macro call range if the node cannot be mapped up fully.

pub fn original_file_range_opt( self, db: &dyn ExpandDatabase ) -> Option<FileRange>

Attempts to map the syntax node back up its macro calls.

pub fn original_syntax_node( self, db: &dyn ExpandDatabase ) -> Option<InFile<SyntaxNode>>

impl InFile<SyntaxToken>

pub fn upmap(self, db: &dyn ExpandDatabase) -> Option<InFile<SyntaxToken>>

pub fn original_file_range(self, db: &dyn ExpandDatabase) -> FileRange

Falls back to the macro call range if the node cannot be mapped up fully.

pub fn original_file_range_opt( self, db: &dyn ExpandDatabase ) -> Option<FileRange>

Attempts to map the syntax node back up its macro calls.

impl<N: AstNode> InFile<N>

pub fn descendants<T: AstNode>(self) -> impl Iterator<Item = InFile<T>>

pub fn original_ast_node(self, db: &dyn ExpandDatabase) -> Option<InFile<N>>

pub fn syntax(&self) -> InFile<&SyntaxNode>

Trait Implementations

impl<T: Clone> Clone for InFile<T>

fn clone(&self) -> InFile<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for InFile<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> From<InMacroFile<T>> for InFile<T>

fn from(macro_file: InMacroFile<T>) -> Self

Converts to this type from the input type.

impl<T: Hash> Hash for InFile<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq> PartialEq<InFile<T>> for InFile<T>

fn eq(&self, other: &InFile<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Copy> Copy for InFile<T>

impl<T: Eq> Eq for InFile<T>

impl<T> StructuralEq for InFile<T>

impl<T> StructuralPartialEq for InFile<T>