'Return an iterator that returns the keys in the cache in order from
the most recently to least recently used. Does not modify the cache
order.'

def __iter__(self):

    node = self.head
    left = len(self.table)
    while (left > 0):
        left -= 1
        (yield node)
        node = node.next
