Struct ModuleData

pub struct ModuleData {
    pub origin: ModuleOrigin,
    pub visibility: Visibility,
    pub parent: Option<LocalModuleId>,
    pub children: IndexMap<Name, LocalModuleId, BuildHasherDefault<FxHasher>>,
    pub scope: ItemScope,
}

Fields

origin: ModuleOrigin

Where does this module come from?

visibility: Visibility

Declared visibility of this module.

parent: Option<LocalModuleId>

Parent module in the same DefMap.

None for block modules because they are always its DefMap’s root.

children: IndexMap<Name, LocalModuleId, BuildHasherDefault<FxHasher>>

scope: ItemScope

Implementations

impl ModuleData

pub fn definition_source(&self, db: &dyn DefDatabase) -> InFile<ModuleSource>

Returns a node which defines this module. That is, a file or a mod foo {} with items.

pub fn definition_source_file_id(&self) -> HirFileId

Same as [definition_source] but only returns the file id to prevent parsing the ASt.

pub fn definition_source_range(&self, db: &dyn DefDatabase) -> InFile<TextRange>

pub fn declaration_source(&self, db: &dyn DefDatabase) -> Option<InFile<Module>>

Returns a node which declares this module, either a mod foo; or a mod foo {}. None for the crate root or block.

pub fn declaration_source_range( &self, db: &dyn DefDatabase, ) -> Option<InFile<TextRange>>

Returns the range which declares this module, either a mod foo; or a mod foo {}. None for the crate root or block.

Trait Implementations

impl Debug for ModuleData

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

Formats the value using the given formatter.

impl PartialEq for ModuleData

fn eq(&self, other: &ModuleData) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl Eq for ModuleData

impl StructuralPartialEq for ModuleData