Surprising Results with Hash Maps and Index Maps

This chapter explores surprising findings related to hash maps and index maps in the context of the compiler. The experiments reveal that scanning through a flat array can be faster than constant time lookup in regular hash maps. They also discuss the performance of an index map in the Rust compiler and highlight the lack of impact from retaining insertion order. The chapter emphasizes the significance of conducting experiments and considering alternative implementations in computer science.