IIRC, the Borland C++ STL implementation made use of buckets of consecutively allocated entries so you would generally find consecutively inserted items next to

IIRC, the Borland C++ STL implementation made use of buckets of consecutively allocated entries so you would generally find consecutively inserted items next to each other in memory. You can also define your own allocator that does something similar.