rust/crates/hir_def/src/keys.rs

68 lines
2.7 KiB
Rust
Raw Normal View History

//! keys to be used with `DynMap`
use std::marker::PhantomData;
use hir_expand::{MacroCallId, MacroDefId};
use rustc_hash::FxHashMap;
2020-08-12 11:26:51 -05:00
use syntax::{ast, AstNode, AstPtr};
use crate::{
attr::AttrId,
dyn_map::{DynMap, Policy},
2021-01-01 03:06:42 -06:00
ConstId, ConstParamId, EnumId, EnumVariantId, FieldId, FunctionId, ImplId, LifetimeParamId,
StaticId, StructId, TraitId, TypeAliasId, TypeParamId, UnionId,
};
pub type Key<K, V> = crate::dyn_map::Key<K, V, AstPtrPolicy<K, V>>;
2020-07-30 07:51:08 -05:00
pub const FUNCTION: Key<ast::Fn, FunctionId> = Key::new();
2020-07-30 11:02:20 -05:00
pub const CONST: Key<ast::Const, ConstId> = Key::new();
pub const STATIC: Key<ast::Static, StaticId> = Key::new();
2020-07-30 08:25:46 -05:00
pub const TYPE_ALIAS: Key<ast::TypeAlias, TypeAliasId> = Key::new();
2020-07-30 11:28:28 -05:00
pub const IMPL: Key<ast::Impl, ImplId> = Key::new();
2020-07-30 11:17:28 -05:00
pub const TRAIT: Key<ast::Trait, TraitId> = Key::new();
2020-07-30 10:50:40 -05:00
pub const STRUCT: Key<ast::Struct, StructId> = Key::new();
2020-07-30 10:36:46 -05:00
pub const UNION: Key<ast::Union, UnionId> = Key::new();
2020-07-30 10:52:53 -05:00
pub const ENUM: Key<ast::Enum, EnumId> = Key::new();
2019-12-12 07:09:13 -06:00
2020-07-30 10:56:53 -05:00
pub const VARIANT: Key<ast::Variant, EnumVariantId> = Key::new();
2020-07-30 09:49:13 -05:00
pub const TUPLE_FIELD: Key<ast::TupleField, FieldId> = Key::new();
pub const RECORD_FIELD: Key<ast::RecordField, FieldId> = Key::new();
pub const TYPE_PARAM: Key<ast::TypeParam, TypeParamId> = Key::new();
pub const LIFETIME_PARAM: Key<ast::LifetimeParam, LifetimeParamId> = Key::new();
2021-01-01 03:06:42 -06:00
pub const CONST_PARAM: Key<ast::ConstParam, ConstParamId> = Key::new();
2020-01-16 09:08:46 -06:00
pub const MACRO: Key<ast::Macro, MacroDefId> = Key::new();
pub const ATTR_MACRO_CALL: Key<ast::Item, MacroCallId> = Key::new();
pub const DERIVE_MACRO_CALL: Key<ast::Attr, (AttrId, MacroCallId, Box<[Option<MacroCallId>]>)> =
Key::new();
/// XXX: AST Nodes and SyntaxNodes have identity equality semantics: nodes are
/// equal if they point to exactly the same object.
///
/// In general, we do not guarantee that we have exactly one instance of a
/// syntax tree for each file. We probably should add such guarantee, but, for
/// the time being, we will use identity-less AstPtr comparison.
pub struct AstPtrPolicy<AST, ID> {
_phantom: PhantomData<(AST, ID)>,
}
impl<AST: AstNode + 'static, ID: 'static> Policy for AstPtrPolicy<AST, ID> {
type K = AST;
type V = ID;
fn insert(map: &mut DynMap, key: AST, value: ID) {
let key = AstPtr::new(&key);
map.map
.entry::<FxHashMap<AstPtr<AST>, ID>>()
.or_insert_with(Default::default)
.insert(key, value);
}
fn get<'a>(map: &'a DynMap, key: &AST) -> Option<&'a ID> {
let key = AstPtr::new(key);
map.map.get::<FxHashMap<AstPtr<AST>, ID>>()?.get(&key)
}
fn is_empty(map: &DynMap) -> bool {
map.map.get::<FxHashMap<AstPtr<AST>, ID>>().map_or(true, |it| it.is_empty())
}
}