Implements a class where every node in a linked list can be found by key (hashtable), but every node is also ordered in a linked list. This way, a node may be "bumped" to the head/tail of the linked list by key in near O(1) complexity.

[SerializableAttribute]
public class DoubleLinkedHashtable : Hashtable