user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Remove obsolete comment

Browse source
This commit is contained in:
Fabian Drinck 2019-04-27 19:23:00 +02:00
parent e232636693
commit 78b53db286
1 changed files with 0 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

9
src/librustc/hir/map/mod.rs
View file

@ -174,15 +174,6 @@ pub struct Map<'hir> {
/// The SVH of the local crate.
pub crate_hash: Svh,
/// `NodeId`s are sequential integers from 0, so we can be
/// super-compact by storing them in a vector. Not everything with
/// a `NodeId` is in the map, but empirically the occupancy is about
/// 75-80%, so there's not too much overhead (certainly less than
/// a hashmap, since they (at the time of writing) have a maximum
/// of 75% occupancy).
///
/// Also, indexing is pretty quick when you've got a vector and
/// plain old integers.
map: FxHashMap<HirId, Entry<'hir>>,
definitions: &'hir Definitions,