From 78b53db2868eaad41ac884989f7b470f352c65b2 Mon Sep 17 00:00:00 2001 From: Fabian Drinck Date: Sat, 27 Apr 2019 19:23:00 +0200 Subject: [PATCH] Remove obsolete comment --- src/librustc/hir/map/mod.rs | 9 --------- 1 file changed, 9 deletions(-) diff --git a/src/librustc/hir/map/mod.rs b/src/librustc/hir/map/mod.rs index 9c895198ddde..fbdb0e07ac1c 100644 --- a/src/librustc/hir/map/mod.rs +++ b/src/librustc/hir/map/mod.rs @@ -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>, definitions: &'hir Definitions,