<gh_stars>0
# -*- coding: utf-8 -*-
"""Detect let and do forms, and destructure them writably.

Separate from letdo.py for dependency reasons.
Separate from util.py due to the length.
"""

from ast import Call, Name, Subscript, Index, Compare, In, Tuple, List, Str, BinOp, LShift
import re

from macropy.core import Captured

def where(*bindings):
    """[syntax] Only meaningful in a let[body, where((k0, v0), ...)]."""
    raise RuntimeError("where() is only meaningful in a let[body, where((k0, v0), ...)]")

# avoid circular dependency; can't import from .util, so implement a minimal isx() for what we need
def _isx(tree, x):
    ismatch = x if callable(x) else lambda s: s == x
    return (type(tree) is Name and ismatch(tree.id)) or \
           (type(tree) is Captured and ismatch(tree.name))
def _pred(x):
    rematch = re.match
    pat = re.compile(r"^{}\d*$".format(x))
    return lambda s: rematch(pat, s)
_isletf = _pred("letter")  # name must match what ``unpythonic.syntax.letdo._letimpl`` uses in its output.
_isdof = _pred("dof")      # name must match what ``unpythonic.syntax.letdo.do`` uses in its output.
_iscurrycall = _pred("currycall")  # output of ``unpythonic.syntax.curry``

def _canonize_bindings(elts, locref, allow_call_in_name_position=False):
    """Wrap a single binding without container into a length-1 list.

    Pass through multiple bindings as-is.

    Yell if the input format is invalid.

    elts: list of bindings, either::
        [(k0, v0), ...]   # multiple bindings
        [(k, v)]          # single binding also ok
        [k, v]            # special single binding format, missing container

    locref: AST node to copy location information from, in case we need to
    make a wrapper for a single binding.

    allow_call_in_name_position: used by let_syntax to allow template definitions.
    """
    def iskey(x):
        return type(x) is Name or \
               allow_call_in_name_position and type(x) is Call and type(x.func) is Name
    if len(elts) == 2 and iskey(elts[0]):
        return [Tuple(elts=elts, lineno=locref.lineno, col_offset=locref.col_offset)]
    if all((type(b) is Tuple and len(b.elts) == 2 and iskey(b.elts[0])) for b in elts):
        return elts
    assert False, "expected bindings to be ((k0, v0), ...) or a single (k, v)"

def islet(tree, expanded=True):
    """Test whether tree is a ``let[]``, ``letseq[]``, ``letrec[]``,
    ``let_syntax[]``, or ``abbrev[]``.

    expanded: if ``True``, test for the already expanded form.
    If ``False``, test for the form that exists prior to macro expansion.
    (Which you need depends on when your macro runs.)

    Note ``let_syntax[]`` and ``abbrev[]`` are completely eliminated by
    macro expansion, so they are seen only if ``expanded=False``.

    Return a truthy value if ``tree`` is a let form, ``False`` if not.
    The truthy return value is a tuple of two strings, ``(kind, mode)``.

    **If expanded=False**:

    Then ``kind`` is one of ``"decorator"``, ``"lispy_expr"``, ``"in_expr"``
    or ``"where_expr"``.

    If ``kind="decorator"``, then ``mode`` is one of ``"dlet"``, ``"dletseq"``,
    ``"dletrec"``, ``"blet"``, ``"bletseq"`` or ``"bletrec"``, identifying
    which decorator it is.

    Otherwise ``mode`` is one of ``"let"``, ``"letseq"``, ``"letrec"``,
    ``"let_syntax"`` or ``"abbrev"``, identifying which let form it is.

    **If expanded=True**:

    Then ``kind`` is one of ``"expanded_decorator"``, ``"expanded_expr"``,
    ``"curried_decorator"`` or ``"curried_expr"``, and ``mode`` is
    ``"let"`` or ``"letrec"``.

    Keep in mind that ``letseq[]`` expands into a sequence of nested ``let[]``.

    (This is a lot of cases for the caller to handle, but that's because
    there are many different AST structures that correspond to ``let`` forms
    in unpythonic.)
    """
    if expanded:
        if type(tree) is not Call:
            return False
        kind = "expanded"
        if _isx(tree.func, _iscurrycall) and _isx(tree.args[0], _isletf):
            kind = "curried"
        elif not _isx(tree.func, _isletf):
            return False
        mode = [kw.value for kw in tree.keywords if kw.arg == "mode"]
        assert len(mode) == 1 and type(mode[0]) is Str
        mode = mode[0].s
        kwnames = [kw.arg for kw in tree.keywords]
        if "_envname" in kwnames:
            return ("{}_decorator".format(kind), mode)  # this call was generated by _dletimpl
        else:
            return ("{}_expr".format(kind), mode)       # this call was generated by _letimpl
        return False
    # dlet((k0, v0), ...)  (call, usually in a decorator list)
    deconames = ("dlet", "dletseq", "dletrec",
                 "blet", "bletseq", "bletrec")
    if type(tree) is Call and type(tree.func) is Name:
        s = tree.func.id
        if any(s == x for x in deconames):
            return ("decorator", s)
    # otherwise we should have an expr macro invocation
    if not (type(tree) is Subscript and type(tree.slice) is Index):
        return False
    macro = tree.value
    expr = tree.slice.value
    exprnames = ("let", "letseq", "letrec", "let_syntax", "abbrev")
    # let((k0, v0), ...)[body]
    if type(macro) is Call and type(macro.func) is Name:
        s = macro.func.id
        if any(s == x for x in exprnames):
            return ("lispy_expr", s)
    # The haskelly syntaxes are only available as a let expression (no decorator form).
    elif type(macro) is Name:
        s = macro.id
        if not any(s == x for x in exprnames):
            return False
        h = _ishaskellylet(expr)
        if h:
            return (h, s)
    return False

def _ishaskellylet(tree):
    """Test whether tree is the content of a haskelly let.

    Return a truthy value if it is, ``False`` if not.

    In other words, detect the part inside the brackets in::

        let[((k0, v0), ...) in body]
        let[body, where((k0, v0), ...)]

    To detect the full expression including the ``let[]``, use ``islet`` instead.
    """
    # let[((k0, v0), ...) in body]
    if type(tree) is Compare and \
       len(tree.ops) == 1 and type(tree.ops[0]) is In and \
       type(tree.left) is Tuple:
        bindings = tree.left
        if all((type(b) is Tuple and len(b.elts) == 2 and type(b.elts[0]) is Name)
                   for b in bindings.elts):
            return "in_expr"
        # Single binding special case: let's not require a trailing comma.
        # In this case, the wrapper tuple containing the bindings is missing.
        # (For consistency of surface syntax with the other variants that don't
        #  require it, because they look like function calls in the AST.)
        if len(bindings.elts) == 2 and type(bindings.elts[0]) is Name:
            return "in_expr"
    # let[body, where((k0, v0), ...)]
    elif type(tree) is Tuple and len(tree.elts) == 2 and type(tree.elts[1]) is Call:
        thecall = tree.elts[1]
        if type(thecall.func) is Name and thecall.func.id == "where":
            return "where_expr"
    return False

def isdo(tree, expanded=True):
    """Detect whether tree is a ``do[]`` or ``do0[]``.

    expanded: if ``True``, test for the already expanded form.
    If ``False``, test for the form that exists prior to macro expansion.

    Return a truthy value if ``tree`` is a do form, ``False`` if not.

    **If expanded=False**:

    Then the truthy return value is just ``True``.

    **If expanded=True**:

    Then the truthy return value is one of the strings ``"expanded"`` or
    ``"curried"``.
    """
    if expanded:
        if type(tree) is not Call:
            return False
        kind = "expanded"
        if _isx(tree.func, _iscurrycall) and _isx(tree.args[0], _isdof):
            kind = "curried"
        elif not _isx(tree.func, _isdof):
            return False
        return kind
    # TODO: detect also do[] with a single expression inside? (now requires a comma)
    return type(tree) is Subscript and \
           type(tree.value) is Name and any(tree.value.id == x for x in ("do", "do0")) and \
           type(tree.slice) is Index and type(tree.slice.value) is Tuple

def isenvassign(tree):
    """Detect whether tree is an unpythonic ``env`` assignment, ``name << value``.

    The only way this differs from a general left-shift is that the LHS must be
    an ``ast.Name``.
    """
    return type(tree) is BinOp and type(tree.op) is LShift and type(tree.left) is Name

# -----------------------------------------------------------------------------

# TODO: kwargs support for let(x=42)[...] if implemented later
class UnexpandedLetView:
    """Destructure a let form, writably.

    If ``tree`` cannot be interpreted as a ``let`` form, then ``TypeError``
    is raised.

    For in-place modification of ``bindings`` or ``body``. Use before the ``let``
    form is expanded away.

    **Supported formats**::

        dlet((k0, v0), ...)              # decorator
        let((k0, v0), ...)[body]         # lispy expression
        let[((k0, v0), ...) in body]     # haskelly expression
        let[body, where((k0, v0), ...)]  # haskelly expression, inverted

    In addition, we also support *just the bracketed part* of the haskelly
    formats. This is to make it easier for the macro interface to destructure
    these forms (for sending into the ``let`` syntax transformer). So these
    forms are supported, too::

        ((k0, v0), ...) in body
        (body, where((k0, v0), ...))

    This is a data abstraction that hides the detailed structure of the AST,
    since there are three alternate syntaxes that can be used for a ``let``
    expression.

    For the decorator forms, ``tree`` should be the decorator call. In this case
    only ``bindings`` is available (the body is then the body of the function
    being decorated).

    **Attributes**:

        ``bindings`` is a ``list`` of ``ast.Tuple``, where each item is of the form
        ``(k, v)``, where ``k`` is an ``ast.Name``. Writing to ``bindings`` updates
        the original.

        ``body`` (when available) is an AST representing a single expression.
        If it is an ``ast.List``, it means an implicit ``do[]`` (handled by the
        ``let`` expander), allowing a multiple-expression body.

        Writing to ``body`` updates the original.

        When not available, ``body is None``.

        ``mode`` is one of ``let``, ``letseq``, ``letrec``; for information only
        (this essentially says what the ``bindings`` mean).

        If ``tree`` is just the bracketed part of a haskelly let, then ``mode`` is
        ``None``, because the mode information is contained in the surrounding
        subscript form (expr macro invocation) and hence not accessible from here.
    """
    def __init__(self, tree):
        data = islet(tree, expanded=False)
        self._has_subscript_container = True
        if not data:
            # the macro interface only gets the bracketed part as tree,
            # so we jump through hoops to make this usable both from
            # syntax transformers (which have access to the full AST)
            # and the macro interface (which needs to destructure bindings and body
            # from the given tree, to send them to the let transformer).
            h = _ishaskellylet(tree)
            if not h:
                raise TypeError("expected a tree representing an unexpanded let, got {}".format(tree))
            data = (h, None)  # cannot detect mode, no access to the surrounding subscript form
            self._has_subscript_container = False
        self._tree = tree
        self._type, self.mode = data
        if self._type not in ("decorator", "lispy_expr", "in_expr", "where_expr"):
            raise NotImplementedError("unknown unexpanded let form type '{}'".format(self._type))
        if self._type == "decorator":
            self.body = None

    def _getbindings(self):
        t = self._type
        if t == "decorator":  # bare Call
            return _canonize_bindings(self._tree.args, self._tree)
        elif t == "lispy_expr":  # Call inside a Subscript
            return _canonize_bindings(self._tree.value.args, self._tree.value)
        else:  # haskelly let
            theexpr = self._tree.slice.value if self._has_subscript_container else self._tree
            if t == "in_expr":
                return _canonize_bindings(theexpr.left.elts, theexpr.left)
            elif t == "where_expr":
                return _canonize_bindings(theexpr.elts[1].args, theexpr.elts[1])
    def _setbindings(self, newbindings):
        t = self._type
        if t == "decorator":
            self._tree.args = newbindings
        elif t == "lispy_expr":
            self._tree.value.args = newbindings
        else:
            theexpr = self._tree.slice.value if self._has_subscript_container else self._tree
            if t == "in_expr":
                theexpr.left.elts = newbindings
            elif t == "where_expr":
                theexpr.elts[1].args = newbindings
    bindings = property(fget=_getbindings, fset=_setbindings, doc="The bindings subform of the let. Writable.")

    def _getbody(self):
        t = self._type
        if t == "decorator":
            # not reached, but let's leave this here for documentation.
            raise TypeError("the body of a decorator let form is the body of decorated function, not a subform of the let.")
        elif t == "lispy_expr":
            return self._tree.slice.value
        else:
            theexpr = self._tree.slice.value if self._has_subscript_container else self._tree
            if t == "in_expr":
                return theexpr.comparators[0]
            elif t == "where_expr":
                return theexpr.elts[0]
    def _setbody(self, newbody):
        t = self._type
        if t == "decorator":
            # not reached, but let's leave this here for documentation.
            raise TypeError("the body of a decorator let form is the body of decorated function, not a subform of the let.")
        elif t == "lispy_expr":
            self._tree.slice.value = newbody
        else:
            theexpr = self._tree.slice.value if self._has_subscript_container else self._tree
            if t == "in_expr":
                theexpr.comparators[0] = newbody
            elif t == "where_expr":
                theexpr.elts[0] = newbody
    body = property(fget=_getbody, fset=_setbody, doc="The body subform of the let (only for expr forms). Writable.")

class UnexpandedDoView:
    """Destructure a do form, writably.

    If ``tree`` cannot be interpreted as a ``do`` form, then ``TypeError``
    is raised.

    For easy in-place modification of ``body``. Use before the ``do`` form
    is expanded away.

    **Supported formats**:

        do[body0, ...]
        do0[body0, ...]
        [...]

    The list format is for convenience, for viewing an implicit ``do[]`` in the
    body of a ``let`` form.

    **Attributes**:

        ``body`` is a ``list`` of the expressions in the body of the ``do[]``.
        Writing to it updates the original.
    """
    def __init__(self, tree):
        self._implicit = False
        if not isdo(tree, expanded=False):
            if type(tree) is not List:  # for implicit do[]
                raise TypeError("expected a tree representing an unexpanded do, got {}".format(tree))
            self._implicit = True
        self._tree = tree

    def _getbody(self):
        return self._tree.slice.value.elts if not self._implicit else self._tree.elts
    def _setbody(self, newbody):
        if not self._implicit:
            self._tree.slice.value.elts = newbody
        else:
            self._tree.elts = newbody
    body = property(fget=_getbody, fset=_setbody, doc="The body of the do. Writable.")

class UnexpandedEnvAssignView:
    """Destructure an env-assignment, writably.

    If ``tree`` cannot be interpreted as an unpythonic ``env`` assignment
    of the form ``name << value``, then ``TypeError`` is raised.

    For easy in-place modification of both ``name`` and ``value``. Use before
    the env-assignment is expanded away (so, before the ``let[]`` or ``do[]``
    containing it is expanded away).

    **Attributes**:

        ``name``: the name of the variable, as a str.

        ``value``: the thing being assigned, as an AST.

    Writing to either attribute updates the original.
    """
    def __init__(self, tree):
        if not isenvassign(tree):
            raise TypeError("expected a tree representing an unexpanded env-assignment, got {}".format(tree))
        self._tree = tree

    def _getname(self):
        return self._tree.left.id
    def _setname(self, newname):
        if not isinstance(newname, str):
            raise TypeError("expected str for new name, got '{}' with value '{}'".format(type(newname), newname))
        self._tree.left.id = newname
    name = property(fget=_getname, fset=_setname, doc="The name of the assigned var, as an str. Writable.")

    def _getvalue(self):
        return self._tree.right
    def _setvalue(self, newvalue):
        self._tree.right = newvalue
    value = property(fget=_getvalue, fset=_setvalue, doc="The value of the assigned var, as an AST. Writable.")

# -----------------------------------------------------------------------------

class ExpandedLetView:
    """Like UnexpandedLetView, but for already expanded let constructs.

    We support both "with curry" and bare formats.

    This is for simple in-place modifications; changing the number of bindings
    is currently not supported. Prefer doing any extensive modifications in the
    first pass, before the ``let[]`` expands.

    Depending on whether let mode is "let" or "letrec", each binding is a
    bare value or ``lambda e: ...``, respectively.

    Usually ``body``, when available, is a single expression. In the case of a
    multiple-expression body, ``body`` is an expanded ``do``, which can be
    destructured using ``ExpandedDoView``.
    """
    def __init__(self, tree):
        data = islet(tree, expanded=True)
        if not data:
            raise TypeError("expected a tree representing an expanded let, got {}".format(tree))
        self._tree = tree
        self._type, self.mode = data
        if self._type not in ("expanded_decorator", "expanded_expr", "curried_decorator", "curried_expr"):
            raise NotImplementedError("unknown expanded let form type '{}'".format(self._type))
        if self._type.endswith("decorator"):
            self.body = None
        self.curried = self._type.startswith("curried")

    def _getbindings(self):
        # Abstract away the namelambda(...). We support both "with curry" and bare formats:
        #   currycall(letter, bindings, currycall(currycall(namelambda, "let_body"), curryf(lambda e: ...)))
        #   letter(bindings, namelambda("let_body")(lambda e: ...))
        thebindings = self._tree.args[1] if self.curried else self._tree.args[0]
        if self.mode == "letrec":
            myelts = []
            if self.curried:
                # "((k, currycall(currycall(namelambda, "letrec_binding_YYY"), curryf(lambda e: ...))), ...)"
                for b in thebindings.elts:
                    k, v = b.elts
                    myelts.append(Tuple(elts=[k, v.args[1].args[0]]))
            else:
                # "((k, namelambda("letrec_binding_YYY")(lambda e: ...)), ...)"
                for b in thebindings.elts:
                    k, v = b.elts
                    myelts.append(Tuple(elts=[k, v.args[0]]))
            return Tuple(elts=myelts)
        else:  # "((k, v), ...)"
            return thebindings
    def _setbindings(self, newbindings):
        if type(newbindings) is not Tuple:
            raise TypeError("Expected ast.Tuple as the new bindings of the let, got {}".format(type(newbindings)))
        if not all(type(elt) is Tuple for elt in newbindings.elts):
            raise TypeError("Expected ast.Tuple of ast.Tuple as the new bindings of the let")
        if not all(len(binding.elts) == 2 for binding in newbindings.elts):
            raise TypeError("Expected ast.Tuple of length-2 ast.Tuple as the new bindings of the let")
        if len(newbindings.elts) != len(self.bindings.elts):
            assert False, "changing the number of items currently not supported by this view (do that before the let[] expands)"
        thebindings = self._tree.args[1] if self.curried else self._tree.args[0]
        if self.mode == "letrec":
            newelts = []
            curried = self.curried
            for oldb, newb in zip(thebindings.elts, newbindings.elts):
                oldk, oldv = oldb.elts
                newk, newv = newb.elts
                if curried:
                    oldv.args[1].args[0] = newv
                    oldv.args[0].args[1].s = "letrec_binding_{}".format(newk.id)
                else:
                    oldv.args[0] = newv
                    oldv.func.args[0].s = "letrec_binding_{}".format(newk.id)  # update name in the namelambda(...)
                newelts.append(Tuple(elts=[newk, oldv], lineno=oldb.lineno, col_offset=oldb.col_offset))
            thebindings.elts = newelts
        else:
            thebindings.elts = newbindings.elts
    bindings = property(fget=_getbindings, fset=_setbindings, doc="The bindings subform of the let, as an ast.Tuple. Writable.")

    def _getbody(self):
        #   currycall(letter, bindings, currycall(currycall(namelambda, "let_body"), curryf(lambda e: ...)))
        #   letter(bindings, namelambda("let_body")(lambda e: ...))
        if self.curried:
            return self._tree.args[2].args[1].args[0]
        else:
            return self._tree.args[1].args[0]
    def _setbody(self, newbody):
        if self.curried:
            self._tree.args[2].args[1].args[0] = newbody
        else:
            self._tree.args[1].args[0] = newbody
    body = property(fget=_getbody, fset=_setbody, doc="The body subform of the let (only for expr forms). Writable.")

class ExpandedDoView:
    """Like UnexpandedDoView, but for already expanded do forms.

    We support both "with curry" and bare formats.

    This is for simple in-place modifications; changing the number of do-items
    is currently not supported. Prefer doing any extensive modifications in the
    first pass, before the ``do[]`` expands.

    Each item in the ``body`` list is of the form ``lambda e: ...``.
    """
    def __init__(self, tree):
        t = isdo(tree, expanded=True)
        if not t:
            raise TypeError("expected a tree representing an expanded do, got {}".format(tree))
        self.curried = t.startswith("curried")
        self._tree = tree

    def _getbody(self):
        # "currycall(dof, currycall(currycall(namelambda, "do_lineXXX"), curryf(lambda e: ...)), ...)"
        # "dof(namelambda("do_lineXXX")(lambda e: ...), ...)"
        if self.curried:
            theitems = self._tree.args[1:]
            return [item.args[1].args[0] for item in theitems]
        else:
            theitems = self._tree.args
            return [item.args[0] for item in theitems]
    def _setbody(self, newbody):
        if not isinstance(newbody, list):  # yes, a runtime list!
            raise TypeError("Expected list as the new body of the do, got {}".format(type(newbody)))
        if len(newbody) != len(self.body):
            assert False, "changing the number of items currently not supported by this view (do that before the do[] expands)"
        if self.curried:
            theitems = self._tree.args[1:]
            for old, new in zip(theitems, newbody):
                old.args[1].args[0] = new
        else:
            theitems = self._tree.args
            for old, new in zip(theitems, newbody):
                old.args[0] = new
    body = property(fget=_getbody, fset=_setbody, doc="The body of the do. Writable.")

# -----------------------------------------------------------------------------

# -*- coding: utf-8 -*-
"""Detect let and do forms, and destructure them writably.

Separate from letdo.py for dependency reasons.
Separate from util.py due to the length.
"""

from ast import Call, Name, Subscript, Index, Compare, In, Tuple, List, Str, BinOp, LShift
import re

from macropy.core import Captured

def where(*bindings):
    """[syntax] Only meaningful in a let[body, where((k0, v0), ...)]."""
    raise RuntimeError("where() is only meaningful in a let[body, where((k0, v0), ...)]")

# avoid circular dependency; can't import from .util, so implement a minimal isx() for what we need
def _isx(tree, x):
    ismatch = x if callable(x) else lambda s: s == x
    return (type(tree) is Name and ismatch(tree.id)) or \
           (type(tree) is Captured and ismatch(tree.name))
def _pred(x):
    rematch = re.match
    pat = re.compile(r"^{}\d*$".format(x))
    return lambda s: rematch(pat, s)
_isletf = _pred("letter")  # name must match what ``unpythonic.syntax.letdo._letimpl`` uses in its output.
_isdof = _pred("dof")      # name must match what ``unpythonic.syntax.letdo.do`` uses in its output.
_iscurrycall = _pred("currycall")  # output of ``unpythonic.syntax.curry``

def _canonize_bindings(elts, locref, allow_call_in_name_position=False):
    """Wrap a single binding without container into a length-1 list.

    Pass through multiple bindings as-is.

    Yell if the input format is invalid.

    elts: list of bindings, either::
        [(k0, v0), ...]   # multiple bindings
        [(k, v)]          # single binding also ok
        [k, v]            # special single binding format, missing container

    locref: AST node to copy location information from, in case we need to
    make a wrapper for a single binding.

    allow_call_in_name_position: used by let_syntax to allow template definitions.
    """
    def iskey(x):
        return type(x) is Name or \
               allow_call_in_name_position and type(x) is Call and type(x.func) is Name
    if len(elts) == 2 and iskey(elts[0]):
        return [Tuple(elts=elts, lineno=locref.lineno, col_offset=locref.col_offset)]
    if all((type(b) is Tuple and len(b.elts) == 2 and iskey(b.elts[0])) for b in elts):
        return elts
    assert False, "expected bindings to be ((k0, v0), ...) or a single (k, v)"

def islet(tree, expanded=True):
    """Test whether tree is a ``let[]``, ``letseq[]``, ``letrec[]``,
    ``let_syntax[]``, or ``abbrev[]``.

    expanded: if ``True``, test for the already expanded form.
    If ``False``, test for the form that exists prior to macro expansion.
    (Which you need depends on when your macro runs.)

    Note ``let_syntax[]`` and ``abbrev[]`` are completely eliminated by
    macro expansion, so they are seen only if ``expanded=False``.

    Return a truthy value if ``tree`` is a let form, ``False`` if not.
    The truthy return value is a tuple of two strings, ``(kind, mode)``.

    **If expanded=False**:

    Then ``kind`` is one of ``"decorator"``, ``"lispy_expr"``, ``"in_expr"``
    or ``"where_expr"``.

    If ``kind="decorator"``, then ``mode`` is one of ``"dlet"``, ``"dletseq"``,
    ``"dletrec"``, ``"blet"``, ``"bletseq"`` or ``"bletrec"``, identifying
    which decorator it is.

    Otherwise ``mode`` is one of ``"let"``, ``"letseq"``, ``"letrec"``,
    ``"let_syntax"`` or ``"abbrev"``, identifying which let form it is.

    **If expanded=True**:

    Then ``kind`` is one of ``"expanded_decorator"``, ``"expanded_expr"``,
    ``"curried_decorator"`` or ``"curried_expr"``, and ``mode`` is
    ``"let"`` or ``"letrec"``.

    Keep in mind that ``letseq[]`` expands into a sequence of nested ``let[]``.

    (This is a lot of cases for the caller to handle, but that's because
    there are many different AST structures that correspond to ``let`` forms
    in unpythonic.)
    """
    if expanded:
        if type(tree) is not Call:
            return False
        kind = "expanded"
        if _isx(tree.func, _iscurrycall) and _isx(tree.args[0], _isletf):
            kind = "curried"
        elif not _isx(tree.func, _isletf):
            return False
        mode = [kw.value for kw in tree.keywords if kw.arg == "mode"]
        assert len(mode) == 1 and type(mode[0]) is Str
        mode = mode[0].s
        kwnames = [kw.arg for kw in tree.keywords]
        if "_envname" in kwnames:
            return ("{}_decorator".format(kind), mode)  # this call was generated by _dletimpl
        else:
            return ("{}_expr".format(kind), mode)       # this call was generated by _letimpl
        return False
    # dlet((k0, v0), ...)  (call, usually in a decorator list)
    deconames = ("dlet", "dletseq", "dletrec",
                 "blet", "bletseq", "bletrec")
    if type(tree) is Call and type(tree.func) is Name:
        s = tree.func.id
        if any(s == x for x in deconames):
            return ("decorator", s)
    # otherwise we should have an expr macro invocation
    if not (type(tree) is Subscript and type(tree.slice) is Index):
        return False
    macro = tree.value
    expr = tree.slice.value
    exprnames = ("let", "letseq", "letrec", "let_syntax", "abbrev")
    # let((k0, v0), ...)[body]
    if type(macro) is Call and type(macro.func) is Name:
        s = macro.func.id
        if any(s == x for x in exprnames):
            return ("lispy_expr", s)
    # The haskelly syntaxes are only available as a let expression (no decorator form).
    elif type(macro) is Name:
        s = macro.id
        if not any(s == x for x in exprnames):
            return False
        h = _ishaskellylet(expr)
        if h:
            return (h, s)
    return False

def _ishaskellylet(tree):
    """Test whether tree is the content of a haskelly let.

    Return a truthy value if it is, ``False`` if not.

    In other words, detect the part inside the brackets in::

        let[((k0, v0), ...) in body]
        let[body, where((k0, v0), ...)]

    To detect the full expression including the ``let[]``, use ``islet`` instead.
    """
    # let[((k0, v0), ...) in body]
    if type(tree) is Compare and \
       len(tree.ops) == 1 and type(tree.ops[0]) is In and \
       type(tree.left) is Tuple:
        bindings = tree.left
        if all((type(b) is Tuple and len(b.elts) == 2 and type(b.elts[0]) is Name)
                   for b in bindings.elts):
            return "in_expr"
        # Single binding special case: let's not require a trailing comma.
        # In this case, the wrapper tuple containing the bindings is missing.
        # (For consistency of surface syntax with the other variants that don't
        #  require it, because they look like function calls in the AST.)
        if len(bindings.elts) == 2 and type(bindings.elts[0]) is Name:
            return "in_expr"
    # let[body, where((k0, v0), ...)]
    elif type(tree) is Tuple and len(tree.elts) == 2 and type(tree.elts[1]) is Call:
        thecall = tree.elts[1]
        if type(thecall.func) is Name and thecall.func.id == "where":
            return "where_expr"
    return False

def isdo(tree, expanded=True):
    """Detect whether tree is a ``do[]`` or ``do0[]``.

    expanded: if ``True``, test for the already expanded form.
    If ``False``, test for the form that exists prior to macro expansion.

    Return a truthy value if ``tree`` is a do form, ``False`` if not.

    **If expanded=False**:

    Then the truthy return value is just ``True``.

    **If expanded=True**:

    Then the truthy return value is one of the strings ``"expanded"`` or
    ``"curried"``.
    """
    if expanded:
        if type(tree) is not Call:
            return False
        kind = "expanded"
        if _isx(tree.func, _iscurrycall) and _isx(tree.args[0], _isdof):
            kind = "curried"
        elif not _isx(tree.func, _isdof):
            return False
        return kind
    # TODO: detect also do[] with a single expression inside? (now requires a comma)
    return type(tree) is Subscript and \
           type(tree.value) is Name and any(tree.value.id == x for x in ("do", "do0")) and \
           type(tree.slice) is Index and type(tree.slice.value) is Tuple

def isenvassign(tree):
    """Detect whether tree is an unpythonic ``env`` assignment, ``name << value``.

    The only way this differs from a general left-shift is that the LHS must be
    an ``ast.Name``.
    """
    return type(tree) is BinOp and type(tree.op) is LShift and type(tree.left) is Name

# -----------------------------------------------------------------------------

# TODO: kwargs support for let(x=42)[...] if implemented later
class UnexpandedLetView:
    """Destructure a let form, writably.

    If ``tree`` cannot be interpreted as a ``let`` form, then ``TypeError``
    is raised.

    For in-place modification of ``bindings`` or ``body``. Use before the ``let``
    form is expanded away.

    **Supported formats**::

        dlet((k0, v0), ...)              # decorator
        let((k0, v0), ...)[body]         # lispy expression
        let[((k0, v0), ...) in body]     # haskelly expression
        let[body, where((k0, v0), ...)]  # haskelly expression, inverted

    In addition, we also support *just the bracketed part* of the haskelly
    formats. This is to make it easier for the macro interface to destructure
    these forms (for sending into the ``let`` syntax transformer). So these
    forms are supported, too::

        ((k0, v0), ...) in body
        (body, where((k0, v0), ...))

    This is a data abstraction that hides the detailed structure of the AST,
    since there are three alternate syntaxes that can be used for a ``let``
    expression.

    For the decorator forms, ``tree`` should be the decorator call. In this case
    only ``bindings`` is available (the body is then the body of the function
    being decorated).

    **Attributes**:

        ``bindings`` is a ``list`` of ``ast.Tuple``, where each item is of the form
        ``(k, v)``, where ``k`` is an ``ast.Name``. Writing to ``bindings`` updates
        the original.

        ``body`` (when available) is an AST representing a single expression.
        If it is an ``ast.List``, it means an implicit ``do[]`` (handled by the
        ``let`` expander), allowing a multiple-expression body.

        Writing to ``body`` updates the original.

        When not available, ``body is None``.

        ``mode`` is one of ``let``, ``letseq``, ``letrec``; for information only
        (this essentially says what the ``bindings`` mean).

        If ``tree`` is just the bracketed part of a haskelly let, then ``mode`` is
        ``None``, because the mode information is contained in the surrounding
        subscript form (expr macro invocation) and hence not accessible from here.
    """
    def __init__(self, tree):
        data = islet(tree, expanded=False)
        self._has_subscript_container = True
        if not data:
            # the macro interface only gets the bracketed part as tree,
            # so we jump through hoops to make this usable both from
            # syntax transformers (which have access to the full AST)
            # and the macro interface (which needs to destructure bindings and body
            # from the given tree, to send them to the let transformer).
            h = _ishaskellylet(tree)
            if not h:
                raise TypeError("expected a tree representing an unexpanded let, got {}".format(tree))
            data = (h, None)  # cannot detect mode, no access to the surrounding subscript form
            self._has_subscript_container = False
        self._tree = tree
        self._type, self.mode = data
        if self._type not in ("decorator", "lispy_expr", "in_expr", "where_expr"):
            raise NotImplementedError("unknown unexpanded let form type '{}'".format(self._type))
        if self._type == "decorator":
            self.body = None

    def _getbindings(self):
        t = self._type
        if t == "decorator":  # bare Call
            return _canonize_bindings(self._tree.args, self._tree)
        elif t == "lispy_expr":  # Call inside a Subscript
            return _canonize_bindings(self._tree.value.args, self._tree.value)
        else:  # haskelly let
            theexpr = self._tree.slice.value if self._has_subscript_container else self._tree
            if t == "in_expr":
                return _canonize_bindings(theexpr.left.elts, theexpr.left)
            elif t == "where_expr":
                return _canonize_bindings(theexpr.elts[1].args, theexpr.elts[1])
    def _setbindings(self, newbindings):
        t = self._type
        if t == "decorator":
            self._tree.args = newbindings
        elif t == "lispy_expr":
            self._tree.value.args = newbindings
        else:
            theexpr = self._tree.slice.value if self._has_subscript_container else self._tree
            if t == "in_expr":
                theexpr.left.elts = newbindings
            elif t == "where_expr":
                theexpr.elts[1].args = newbindings
    bindings = property(fget=_getbindings, fset=_setbindings, doc="The bindings subform of the let. Writable.")

    def _getbody(self):
        t = self._type
        if t == "decorator":
            # not reached, but let's leave this here for documentation.
            raise TypeError("the body of a decorator let form is the body of decorated function, not a subform of the let.")
        elif t == "lispy_expr":
            return self._tree.slice.value
        else:
            theexpr = self._tree.slice.value if self._has_subscript_container else self._tree
            if t == "in_expr":
                return theexpr.comparators[0]
            elif t == "where_expr":
                return theexpr.elts[0]
    def _setbody(self, newbody):
        t = self._type
        if t == "decorator":
            # not reached, but let's leave this here for documentation.
            raise TypeError("the body of a decorator let form is the body of decorated function, not a subform of the let.")
        elif t == "lispy_expr":
            self._tree.slice.value = newbody
        else:
            theexpr = self._tree.slice.value if self._has_subscript_container else self._tree
            if t == "in_expr":
                theexpr.comparators[0] = newbody
            elif t == "where_expr":
                theexpr.elts[0] = newbody
    body = property(fget=_getbody, fset=_setbody, doc="The body subform of the let (only for expr forms). Writable.")

class UnexpandedDoView:
    """Destructure a do form, writably.

    If ``tree`` cannot be interpreted as a ``do`` form, then ``TypeError``
    is raised.

    For easy in-place modification of ``body``. Use before the ``do`` form
    is expanded away.

    **Supported formats**:

        do[body0, ...]
        do0[body0, ...]
        [...]

    The list format is for convenience, for viewing an implicit ``do[]`` in the
    body of a ``let`` form.

    **Attributes**:

        ``body`` is a ``list`` of the expressions in the body of the ``do[]``.
        Writing to it updates the original.
    """
    def __init__(self, tree):
        self._implicit = False
        if not isdo(tree, expanded=False):
            if type(tree) is not List:  # for implicit do[]
                raise TypeError("expected a tree representing an unexpanded do, got {}".format(tree))
            self._implicit = True
        self._tree = tree

    def _getbody(self):
        return self._tree.slice.value.elts if not self._implicit else self._tree.elts
    def _setbody(self, newbody):
        if not self._implicit:
            self._tree.slice.value.elts = newbody
        else:
            self._tree.elts = newbody
    body = property(fget=_getbody, fset=_setbody, doc="The body of the do. Writable.")

class UnexpandedEnvAssignView:
    """Destructure an env-assignment, writably.

    If ``tree`` cannot be interpreted as an unpythonic ``env`` assignment
    of the form ``name << value``, then ``TypeError`` is raised.

    For easy in-place modification of both ``name`` and ``value``. Use before
    the env-assignment is expanded away (so, before the ``let[]`` or ``do[]``
    containing it is expanded away).

    **Attributes**:

        ``name``: the name of the variable, as a str.

        ``value``: the thing being assigned, as an AST.

    Writing to either attribute updates the original.
    """
    def __init__(self, tree):
        if not isenvassign(tree):
            raise TypeError("expected a tree representing an unexpanded env-assignment, got {}".format(tree))
        self._tree = tree

    def _getname(self):
        return self._tree.left.id
    def _setname(self, newname):
        if not isinstance(newname, str):
            raise TypeError("expected str for new name, got '{}' with value '{}'".format(type(newname), newname))
        self._tree.left.id = newname
    name = property(fget=_getname, fset=_setname, doc="The name of the assigned var, as an str. Writable.")

    def _getvalue(self):
        return self._tree.right
    def _setvalue(self, newvalue):
        self._tree.right = newvalue
    value = property(fget=_getvalue, fset=_setvalue, doc="The value of the assigned var, as an AST. Writable.")

# -----------------------------------------------------------------------------

class ExpandedLetView:
    """Like UnexpandedLetView, but for already expanded let constructs.

    We support both "with curry" and bare formats.

    This is for simple in-place modifications; changing the number of bindings
    is currently not supported. Prefer doing any extensive modifications in the
    first pass, before the ``let[]`` expands.

    Depending on whether let mode is "let" or "letrec", each binding is a
    bare value or ``lambda e: ...``, respectively.

    Usually ``body``, when available, is a single expression. In the case of a
    multiple-expression body, ``body`` is an expanded ``do``, which can be
    destructured using ``ExpandedDoView``.
    """
    def __init__(self, tree):
        data = islet(tree, expanded=True)
        if not data:
            raise TypeError("expected a tree representing an expanded let, got {}".format(tree))
        self._tree = tree
        self._type, self.mode = data
        if self._type not in ("expanded_decorator", "expanded_expr", "curried_decorator", "curried_expr"):
            raise NotImplementedError("unknown expanded let form type '{}'".format(self._type))
        if self._type.endswith("decorator"):
            self.body = None
        self.curried = self._type.startswith("curried")

    def _getbindings(self):
        # Abstract away the namelambda(...). We support both "with curry" and bare formats:
        #   currycall(letter, bindings, currycall(currycall(namelambda, "let_body"), curryf(lambda e: ...)))
        #   letter(bindings, namelambda("let_body")(lambda e: ...))
        thebindings = self._tree.args[1] if self.curried else self._tree.args[0]
        if self.mode == "letrec":
            myelts = []
            if self.curried:
                # "((k, currycall(currycall(namelambda, "letrec_binding_YYY"), curryf(lambda e: ...))), ...)"
                for b in thebindings.elts:
                    k, v = b.elts
                    myelts.append(Tuple(elts=[k, v.args[1].args[0]]))
            else:
                # "((k, namelambda("letrec_binding_YYY")(lambda e: ...)), ...)"
                for b in thebindings.elts:
                    k, v = b.elts
                    myelts.append(Tuple(elts=[k, v.args[0]]))
            return Tuple(elts=myelts)
        else:  # "((k, v), ...)"
            return thebindings
    def _setbindings(self, newbindings):
        if type(newbindings) is not Tuple:
            raise TypeError("Expected ast.Tuple as the new bindings of the let, got {}".format(type(newbindings)))
        if not all(type(elt) is Tuple for elt in newbindings.elts):
            raise TypeError("Expected ast.Tuple of ast.Tuple as the new bindings of the let")
        if not all(len(binding.elts) == 2 for binding in newbindings.elts):
            raise TypeError("Expected ast.Tuple of length-2 ast.Tuple as the new bindings of the let")
        if len(newbindings.elts) != len(self.bindings.elts):
            assert False, "changing the number of items currently not supported by this view (do that before the let[] expands)"
        thebindings = self._tree.args[1] if self.curried else self._tree.args[0]
        if self.mode == "letrec":
            newelts = []
            curried = self.curried
            for oldb, newb in zip(thebindings.elts, newbindings.elts):
                oldk, oldv = oldb.elts
                newk, newv = newb.elts
                if curried:
                    oldv.args[1].args[0] = newv
                    oldv.args[0].args[1].s = "letrec_binding_{}".format(newk.id)
                else:
                    oldv.args[0] = newv
                    oldv.func.args[0].s = "letrec_binding_{}".format(newk.id)  # update name in the namelambda(...)
                newelts.append(Tuple(elts=[newk, oldv], lineno=oldb.lineno, col_offset=oldb.col_offset))
            thebindings.elts = newelts
        else:
            thebindings.elts = newbindings.elts
    bindings = property(fget=_getbindings, fset=_setbindings, doc="The bindings subform of the let, as an ast.Tuple. Writable.")

    def _getbody(self):
        #   currycall(letter, bindings, currycall(currycall(namelambda, "let_body"), curryf(lambda e: ...)))
        #   letter(bindings, namelambda("let_body")(lambda e: ...))
        if self.curried:
            return self._tree.args[2].args[1].args[0]
        else:
            return self._tree.args[1].args[0]
    def _setbody(self, newbody):
        if self.curried:
            self._tree.args[2].args[1].args[0] = newbody
        else:
            self._tree.args[1].args[0] = newbody
    body = property(fget=_getbody, fset=_setbody, doc="The body subform of the let (only for expr forms). Writable.")

class ExpandedDoView:
    """Like UnexpandedDoView, but for already expanded do forms.

    We support both "with curry" and bare formats.

    This is for simple in-place modifications; changing the number of do-items
    is currently not supported. Prefer doing any extensive modifications in the
    first pass, before the ``do[]`` expands.

    Each item in the ``body`` list is of the form ``lambda e: ...``.
    """
    def __init__(self, tree):
        t = isdo(tree, expanded=True)
        if not t:
            raise TypeError("expected a tree representing an expanded do, got {}".format(tree))
        self.curried = t.startswith("curried")
        self._tree = tree

    def _getbody(self):
        # "currycall(dof, currycall(currycall(namelambda, "do_lineXXX"), curryf(lambda e: ...)), ...)"
        # "dof(namelambda("do_lineXXX")(lambda e: ...), ...)"
        if self.curried:
            theitems = self._tree.args[1:]
            return [item.args[1].args[0] for item in theitems]
        else:
            theitems = self._tree.args
            return [item.args[0] for item in theitems]
    def _setbody(self, newbody):
        if not isinstance(newbody, list):  # yes, a runtime list!
            raise TypeError("Expected list as the new body of the do, got {}".format(type(newbody)))
        if len(newbody) != len(self.body):
            assert False, "changing the number of items currently not supported by this view (do that before the do[] expands)"
        if self.curried:
            theitems = self._tree.args[1:]
            for old, new in zip(theitems, newbody):
                old.args[1].args[0] = new
        else:
            theitems = self._tree.args
            for old, new in zip(theitems, newbody):
                old.args[0] = new
    body = property(fget=_getbody, fset=_setbody, doc="The body of the do. Writable.")

# -----------------------------------------------------------------------------
# -*- coding: utf-8 -*- Detect let and do forms, and destructure them writably.  Separate from letdo.py for dependency reasons. Separate from util.py due to the length. [syntax] Only meaningful in a let[body, where((k0, v0), ...)]. # avoid circular dependency; can't import from .util, so implement a minimal isx() for what we need # name must match what ``unpythonic.syntax.letdo._letimpl`` uses in its output. # name must match what ``unpythonic.syntax.letdo.do`` uses in its output. # output of ``unpythonic.syntax.curry`` Wrap a single binding without container into a length-1 list.      Pass through multiple bindings as-is.      Yell if the input format is invalid.      elts: list of bindings, either::         [(k0, v0), ...]   # multiple bindings         [(k, v)]          # single binding also ok         [k, v]            # special single binding format, missing container      locref: AST node to copy location information from, in case we need to     make a wrapper for a single binding.      allow_call_in_name_position: used by let_syntax to allow template definitions. Test whether tree is a ``let[]``, ``letseq[]``, ``letrec[]``,     ``let_syntax[]``, or ``abbrev[]``.      expanded: if ``True``, test for the already expanded form.     If ``False``, test for the form that exists prior to macro expansion.     (Which you need depends on when your macro runs.)      Note ``let_syntax[]`` and ``abbrev[]`` are completely eliminated by     macro expansion, so they are seen only if ``expanded=False``.      Return a truthy value if ``tree`` is a let form, ``False`` if not.     The truthy return value is a tuple of two strings, ``(kind, mode)``.      **If expanded=False**:      Then ``kind`` is one of ``"decorator"``, ``"lispy_expr"``, ``"in_expr"``     or ``"where_expr"``.      If ``kind="decorator"``, then ``mode`` is one of ``"dlet"``, ``"dletseq"``,     ``"dletrec"``, ``"blet"``, ``"bletseq"`` or ``"bletrec"``, identifying     which decorator it is.      Otherwise ``mode`` is one of ``"let"``, ``"letseq"``, ``"letrec"``,     ``"let_syntax"`` or ``"abbrev"``, identifying which let form it is.      **If expanded=True**:      Then ``kind`` is one of ``"expanded_decorator"``, ``"expanded_expr"``,     ``"curried_decorator"`` or ``"curried_expr"``, and ``mode`` is     ``"let"`` or ``"letrec"``.      Keep in mind that ``letseq[]`` expands into a sequence of nested ``let[]``.      (This is a lot of cases for the caller to handle, but that's because     there are many different AST structures that correspond to ``let`` forms     in unpythonic.) # this call was generated by _dletimpl # this call was generated by _letimpl # dlet((k0, v0), ...)  (call, usually in a decorator list) # otherwise we should have an expr macro invocation # let((k0, v0), ...)[body] # The haskelly syntaxes are only available as a let expression (no decorator form). Test whether tree is the content of a haskelly let.      Return a truthy value if it is, ``False`` if not.      In other words, detect the part inside the brackets in::          let[((k0, v0), ...) in body]         let[body, where((k0, v0), ...)]      To detect the full expression including the ``let[]``, use ``islet`` instead. # let[((k0, v0), ...) in body] # Single binding special case: let's not require a trailing comma. # In this case, the wrapper tuple containing the bindings is missing. # (For consistency of surface syntax with the other variants that don't #  require it, because they look like function calls in the AST.) # let[body, where((k0, v0), ...)] Detect whether tree is a ``do[]`` or ``do0[]``.      expanded: if ``True``, test for the already expanded form.     If ``False``, test for the form that exists prior to macro expansion.      Return a truthy value if ``tree`` is a do form, ``False`` if not.      **If expanded=False**:      Then the truthy return value is just ``True``.      **If expanded=True**:      Then the truthy return value is one of the strings ``"expanded"`` or     ``"curried"``. # TODO: detect also do[] with a single expression inside? (now requires a comma) Detect whether tree is an unpythonic ``env`` assignment, ``name << value``.      The only way this differs from a general left-shift is that the LHS must be     an ``ast.Name``. # ----------------------------------------------------------------------------- # TODO: kwargs support for let(x=42)[...] if implemented later Destructure a let form, writably.      If ``tree`` cannot be interpreted as a ``let`` form, then ``TypeError``     is raised.      For in-place modification of ``bindings`` or ``body``. Use before the ``let``     form is expanded away.      **Supported formats**::          dlet((k0, v0), ...)              # decorator         let((k0, v0), ...)[body]         # lispy expression         let[((k0, v0), ...) in body]     # haskelly expression         let[body, where((k0, v0), ...)]  # haskelly expression, inverted      In addition, we also support *just the bracketed part* of the haskelly     formats. This is to make it easier for the macro interface to destructure     these forms (for sending into the ``let`` syntax transformer). So these     forms are supported, too::          ((k0, v0), ...) in body         (body, where((k0, v0), ...))      This is a data abstraction that hides the detailed structure of the AST,     since there are three alternate syntaxes that can be used for a ``let``     expression.      For the decorator forms, ``tree`` should be the decorator call. In this case     only ``bindings`` is available (the body is then the body of the function     being decorated).      **Attributes**:          ``bindings`` is a ``list`` of ``ast.Tuple``, where each item is of the form         ``(k, v)``, where ``k`` is an ``ast.Name``. Writing to ``bindings`` updates         the original.          ``body`` (when available) is an AST representing a single expression.         If it is an ``ast.List``, it means an implicit ``do[]`` (handled by the         ``let`` expander), allowing a multiple-expression body.          Writing to ``body`` updates the original.          When not available, ``body is None``.          ``mode`` is one of ``let``, ``letseq``, ``letrec``; for information only         (this essentially says what the ``bindings`` mean).          If ``tree`` is just the bracketed part of a haskelly let, then ``mode`` is         ``None``, because the mode information is contained in the surrounding         subscript form (expr macro invocation) and hence not accessible from here. # the macro interface only gets the bracketed part as tree, # so we jump through hoops to make this usable both from # syntax transformers (which have access to the full AST) # and the macro interface (which needs to destructure bindings and body # from the given tree, to send them to the let transformer). # cannot detect mode, no access to the surrounding subscript form # bare Call # Call inside a Subscript # haskelly let # not reached, but let's leave this here for documentation. # not reached, but let's leave this here for documentation. Destructure a do form, writably.      If ``tree`` cannot be interpreted as a ``do`` form, then ``TypeError``     is raised.      For easy in-place modification of ``body``. Use before the ``do`` form     is expanded away.      **Supported formats**:          do[body0, ...]         do0[body0, ...]         [...]      The list format is for convenience, for viewing an implicit ``do[]`` in the     body of a ``let`` form.      **Attributes**:          ``body`` is a ``list`` of the expressions in the body of the ``do[]``.         Writing to it updates the original. # for implicit do[] Destructure an env-assignment, writably.      If ``tree`` cannot be interpreted as an unpythonic ``env`` assignment     of the form ``name << value``, then ``TypeError`` is raised.      For easy in-place modification of both ``name`` and ``value``. Use before     the env-assignment is expanded away (so, before the ``let[]`` or ``do[]``     containing it is expanded away).      **Attributes**:          ``name``: the name of the variable, as a str.          ``value``: the thing being assigned, as an AST.      Writing to either attribute updates the original. # ----------------------------------------------------------------------------- Like UnexpandedLetView, but for already expanded let constructs.      We support both "with curry" and bare formats.      This is for simple in-place modifications; changing the number of bindings     is currently not supported. Prefer doing any extensive modifications in the     first pass, before the ``let[]`` expands.      Depending on whether let mode is "let" or "letrec", each binding is a     bare value or ``lambda e: ...``, respectively.      Usually ``body``, when available, is a single expression. In the case of a     multiple-expression body, ``body`` is an expanded ``do``, which can be     destructured using ``ExpandedDoView``. # Abstract away the namelambda(...). We support both "with curry" and bare formats: #   currycall(letter, bindings, currycall(currycall(namelambda, "let_body"), curryf(lambda e: ...))) #   letter(bindings, namelambda("let_body")(lambda e: ...)) # "((k, currycall(currycall(namelambda, "letrec_binding_YYY"), curryf(lambda e: ...))), ...)" # "((k, namelambda("letrec_binding_YYY")(lambda e: ...)), ...)" # "((k, v), ...)" # update name in the namelambda(...) #   currycall(letter, bindings, currycall(currycall(namelambda, "let_body"), curryf(lambda e: ...))) #   letter(bindings, namelambda("let_body")(lambda e: ...)) Like UnexpandedDoView, but for already expanded do forms.      We support both "with curry" and bare formats.      This is for simple in-place modifications; changing the number of do-items     is currently not supported. Prefer doing any extensive modifications in the     first pass, before the ``do[]`` expands.      Each item in the ``body`` list is of the form ``lambda e: ...``. # "currycall(dof, currycall(currycall(namelambda, "do_lineXXX"), curryf(lambda e: ...)), ...)" # "dof(namelambda("do_lineXXX")(lambda e: ...), ...)" # yes, a runtime list! # -----------------------------------------------------------------------------