def _getTransformWalkSiblings(node, direction="right", multi=False):
    """ Get the sibling transforms on the hierarchy

    Arguments:
        node (dagNode or list of dagNode): dagNode to walk the siblings
        direction (str, optional): Direction of the walk. Values "right"
            and "left"
        multi (bool, optional): If true, selects all the siblings

    Returns:
        dagNode: list of dagNode

    """
    if direction == "right":
        d = 1
    else:
        d = -1

    if not isinstance(node, list):
        node = [node]
    siblings = []
    for n in node:
        p = n.getParent()
        sib = p.getChildren()
        tSib = [t for t in sib if t.type() == "transform"]
        if multi:
            siblings = siblings + tSib
        else:
            i = tSib.index(n)
            if i <= len(tSib) - 2:
                siblings.append(tSib[i + d])
            else:
                siblings.append(tSib[0])

    return siblings