def __processNewNode(self, new_node, new_search_indx, patt_len, spanIndxLst=[]):

        global dfsStack
        global matchLst

        if new_search_indx >= patt_len:
            dfsStack.append( (new_node, new_search_indx, spanIndxLst) )
        else:
            if new_node.isLeaf():
                # @type new_node SuffixTreeNode
                matchLst.append( (new_node.label_path, spanIndxLst) )

        return None
dataset/ETHPy150Open sfu-natlang/Kriya/src/Kriya-Grammar-Xtrctr/myTrie1.py/SuffixTreeNode.__processNewNode/operator `<` -> `>=`