std::unordered_map allocates a node per entry and follows a pointer per lookup. Systems that look up orders by id millions of times a second often use a flat open addressing table instead: one array of slots, sized up front. A key hashes to a home slot; if that slot holds another key, try the next slot, then the next (linear probing), until you find the key or an empty slot.
Deleting needs care. Emptying a slot would cut the probe chain of every key that was placed past it, so a deleted slot becomes a tombstone: lookups step over it, and inserts may reuse it. The table must also keep some slots truly empty, or a lookup for a missing key would never stop, so inserts are refused above a load factor, here 70 percent.
With a power-of-two capacity the home slot is hash & (capacity - 1), which only looks at the low bits, so the hash must mix the high bits in; otherwise ids that are multiples of the capacity all land in one slot. The tests count heap allocations and, through probes(), how many slots lookups visit.
Linear probing walks forward from the home slot, wrapping at the end.