Set that remembers original insertion order. Implementation based on a doubly linked link and an internal dictionary. This design gives OrderedSet the same big-Oh running times as regular sets including O(1) adds, removes, and lookups as well as O(n) iteration. Dictionary in which the *insertion* order of items is preserved (using an internal double linked list). In this implementation replacing an existing item keeps it at its original position.