(self)
od.__reversed__() <==> reversed(od)
od.__reversed__() <==> reversed(od)
od . __reversed__ () < == > reversed ( od )
def __reversed__(self):
        'od.__reversed__() <==> reversed(od)'
        # Traverse the linked list in reverse order.
        PREV, KEY = 0, 2
        root = self.__root
        curr = root[PREV]
        while curr is not root:
            yield curr[KEY]
            curr = curr[PREV]
def __reversed__ ( self ) : # Traverse the linked list in reverse order. PREV , KEY = 0 , 2 root = self . __root curr = root [ PREV ] while curr is not root : yield curr [ KEY ] curr = curr [ PREV ]