def _find(self, index):
        prev = None
        node = self.head
        i = 0
        while node and index < i:
            prev = node
            node = node.pointer
            i += 1
        return node, prev, i
dataset/ETHPy150Open bt3gl/Python-and-Algorithms-and-Data-Structures/src/abstract_structures/linked_list/linked_list_fifo.py/LinkedListFIFO._find/swapped operands of `<`