def breadthArgs (limit=sys.getrecursionlimit(), testFn=isIterable, *args) :
    deq = _deque((x,0) for x in args)
    result = []
    while deq :
        arg, level = deq.popleft()
        if testFn(arg) and level<limit :
            for a in arg :
                deq.append ((a, level+1))
        else :
            result.append(arg)

    return tuple(result)

# Same behavior as expandListArg but implemented as an Python iterator, the recursieve approach
# will be more memory efficient, but slower
Get the corners of the Polyhedron.
dataset/ETHPy150Open CountZer0/PipelineConstructionSet/python/maya/site-packages/pymel-1.0.3/pymel/util/arguments.py/breadthArgs--crossover with--dataset/ETHPy150Open sympy/sympy/sympy/combinatorics/polyhedron.py/Polyhedron.corners