Struct rustc_ast_lowering::index::NodeCollector
source · [−]pub(crate) struct NodeCollector<'a, 'hir> {
source_map: &'a SourceMap,
bodies: &'a SortedMap<ItemLocalId, &'hir Body<'hir>>,
nodes: IndexVec<ItemLocalId, Option<ParentedNode<'hir>>>,
parenting: FxHashMap<LocalDefId, ItemLocalId>,
parent_node: ItemLocalId,
owner: LocalDefId,
definitions: &'a Definitions,
}Expand description
A visitor that walks over the HIR and collects Nodes into a HIR map.
Fields
source_map: &'a SourceMapSource map
bodies: &'a SortedMap<ItemLocalId, &'hir Body<'hir>>nodes: IndexVec<ItemLocalId, Option<ParentedNode<'hir>>>Outputs
parenting: FxHashMap<LocalDefId, ItemLocalId>parent_node: ItemLocalIdThe parent of this node
owner: LocalDefIddefinitions: &'a DefinitionsImplementations
Trait Implementations
Because we want to track parent items and so forth, enable deep walking so that we walk nested items in the context of their outer items.
Like visit_nested_item(), but for trait items. See
visit_nested_item() for advice on when to override this
method. Read more
Like visit_nested_item(), but for impl items. See
visit_nested_item() for advice on when to override this
method. Read more
Like visit_nested_item(), but for foreign items. See
visit_nested_item() for advice on when to override this
method. Read more
Invoked to visit the body of a function, method or closure. Like
visit_nested_item, does nothing by default unless you override
nested_visit_map to return other than None, in which case it will walk
the body. Read more
Visits the top-level item and (optionally) nested items / impl items. See
visit_nested_item for details. Read more
type Map: Map<'v> = <Self::NestedFilter as NestedFilter<'v>>::Map
type NestedFilter: NestedFilter<'v> = None
The default versions of the visit_nested_XXX routines invoke
this method to get a map to use. By selecting an enum variant,
you control which kinds of nested HIR are visited; see
NestedVisitorMap for details. By “nested HIR”, we are
referring to bits of HIR that are not directly embedded within
one another but rather indirectly, through a table in the
crate. This is done to control dependencies during incremental
compilation: the non-inline bits of HIR can be tracked and
hashed separately. Read more
When invoking visit_all_item_likes(), you need to supply an
item-like visitor. This method converts an “intra-visit”
visitor into an item-like visitor that walks the entire tree.
If you use this, you probably don’t want to process the
contents of nested item-like things, since the outer loop will
visit them as well. Read more
fn visit_variant_data(
&mut self,
s: &VariantData,
Symbol,
&Generics,
_parent_id: HirId,
Span
)
fn visit_enum_def(
&mut self,
enum_definition: &EnumDef,
generics: &Generics,
item_id: HirId,
Span
)
Auto Trait Implementations
impl<'a, 'hir> !RefUnwindSafe for NodeCollector
impl<'a, 'hir> !Send for NodeCollector
impl<'a, 'hir> !Sync for NodeCollector
impl<'a, 'hir> Unpin for NodeCollector where
'hir: 'a,
impl<'a, 'hir> !UnwindSafe for NodeCollector
Blanket Implementations
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