//! keys to be used with `DynMap` use std::marker::PhantomData; use hir_expand::InFile; use ra_syntax::{ast, AstNode, AstPtr}; use rustc_hash::FxHashMap; use crate::{ dyn_map::{DynMap, Policy}, ConstId, EnumVariantId, FunctionId, ImplId, StaticId, StructFieldId, StructId, TraitId, TypeAliasId, TypeParamId, EnumId, UnionId, }; type Key = crate::dyn_map::Key, V, AstPtrPolicy>; pub const FUNCTION: Key = Key::new(); pub const CONST: Key = Key::new(); pub const STATIC: Key = Key::new(); pub const TYPE_ALIAS: Key = Key::new(); pub const IMPL: Key = Key::new(); pub const TRAIT: Key = Key::new(); pub const STRUCT: Key = Key::new(); pub const UNION: Key = Key::new(); pub const ENUM: Key = Key::new(); pub const ENUM_VARIANT: Key = Key::new(); pub const TUPLE_FIELD: Key = Key::new(); pub const RECORD_FIELD: Key = Key::new(); pub const TYPE_PARAM: Key = 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 { _phantom: PhantomData<(AST, ID)>, } impl Policy for AstPtrPolicy { type K = InFile; type V = ID; fn insert(map: &mut DynMap, key: InFile, value: ID) { let key = key.as_ref().map(AstPtr::new); map.map .entry::>, ID>>() .or_insert_with(Default::default) .insert(key, value); } fn get<'a>(map: &'a DynMap, key: &InFile) -> Option<&'a ID> { let key = key.as_ref().map(AstPtr::new); map.map.get::>, ID>>()?.get(&key) } }