def _moveCallLaterSooner(self, tple):
        # Linear time find: slow.
        heap = self._pendingTimedCalls
        try:
            pos = heap.index(tple)

            # Move elt up the heap until it rests at the right place.
            elt = heap[pos]
            while pos != 0:
                parent = (pos-1) // 2
                if heap[parent] <= elt:
                    break
                # move parent down
                heap[pos] = heap[parent]
                pos = parent
            heap[pos] = elt
        except __HOLE__:
            # element was not found in heap - oh well...
            pass
dataset/ETHPy150Open kuri65536/python-for-android/python-modules/twisted/twisted/internet/base.py/ReactorBase._moveCallLaterSooner