While reading this article, I surfed through links to LinkedHashMap into a few web pages discussing C++ imlpementations of something analogous. One of the articles I ran across (
http://www.ddj.com/cpp/184406207) describes a hash map with a fast iterator. His solution involves a node which I find a bit bloated. I had written an implementation of HashMap which uses a singly-linked list as its underlying struct. The iterator therefore resembles that of SList::Iterator. I've attached the code. (Note that the code has 2 implementations of HashMap: array-based and list-based. Internal comments explain their relative merits.)
Note that this does not satisfy the requirements described in the Yegge article since my implementation does not preserve insertion order. I'm on a tangent here; I'm just providing something close to what the DDJ article presents.
-- Michael J. Gourlay