def _immediately_after(node):
    try:
        pos = node.treeposition()
        tree = node.root()
        current = node.parent()
    except AttributeError:
        return []
    # go "upwards" from pos until there is a place we can go to the
    # right
    idx = len(pos) - 1
    while 0 <= idx and pos[idx] == len(current) - 1:
        idx -= 1
        current = current.parent()
    if idx < 0:
        return []
    pos = list(pos[:idx + 1])
    pos[-1] += 1
    after = tree[pos]
    return [after] + _leftmost_descendants(after)
Returns the inverse of this function.
dataset/ETHPy150Open nltk/nltk/nltk/tgrep.py/_immediately_after--crossover with--dataset/ETHPy150Open sympy/sympy/sympy/functions/special/error_functions.py/erfinv.inverse