We can create a nodemap in memory when there isn't a persistent
one. When listing all commits in the hg repo, it sped up the
equivalent of hg log -T '{node}\n' --hidden (but run with my hobby
project's hg backend) from 123 s to 2.55 s.
What do we actually want to do here? Calculate the map after we've
done a few O(n) node-to-rev requests? I think that's what the C
implementation does.
.expect("node should exist in index")