pyomo__pyomo-3017

{
  "status": "error",
  "error_type": "CommandError",
  "error_message": "Traceback (most recent call last):\n  File \"<stdin>\", line 5, in <module>\n  File \"/workspace/pyomo/core/base/units_container.py\", line 1532, in __getattribute__\n    return getattr(pint_module, attr)\n  File \"/workspace/pyomo/common/dependencies.py\", line 75, in __getattr__\n    raise DeferredImportError(self._moduleunavailable_message())\npyomo.common.errors.DeferredImportError: The \"pint\" package failed to import. This package is necessary to use Pyomo units. (import raised ModuleNotFoundError: No module named 'pint')\n",
  "details": {
    "stdout": "",
    "stderr": "Traceback (most recent call last):\n  File \"<stdin>\", line 5, in <module>\n  File \"/workspace/pyomo/core/base/units_container.py\", line 1532, in __getattribute__\n    return getattr(pint_module, attr)\n  File \"/workspace/pyomo/common/dependencies.py\", line 75, in __getattr__\n    raise DeferredImportError(self._moduleunavailable_message())\npyomo.common.errors.DeferredImportError: The \"pint\" package failed to import. This package is necessary to use Pyomo units. (import raised ModuleNotFoundError: No module named 'pint')\n",
    "exit_code": 1
  }
}

{
  "status": "error",
  "error_type": "CommandError",
  "error_message": "Traceback (most recent call last):\n  File \"/workspace/pyomo/common/collections/component_map.py\", line 71, in __getitem__\n    return self._dict[id(obj)][1]\nKeyError: 139952349192416\n\nDuring handling of the above exception, another exception occurred:\n\nTraceback (most recent call last):\n  File \"<stdin>\", line 15, in <module>\n  File \"/workspace/pyomo/core/expr/calculus/derivatives.py\", line 96, in differentiate\n    res = reverse_sd(expr=expr)\n  File \"/workspace/pyomo/core/expr/calculus/diff_with_pyomo.py\", line 484, in reverse_sd\n    return _reverse_diff_helper(expr, False)\n  File \"/workspace/pyomo/core/expr/calculus/diff_with_pyomo.py\", line 442, in _reverse_diff_helper\n    _diff_GeneralExpression(e, val_dict, der_dict)\n  File \"/workspace/pyomo/core/expr/calculus/diff_with_pyomo.py\", line 331, in _diff_GeneralExpression\n    der_dict[node.expr] += der_dict[node]\n  File \"/workspace/pyomo/common/collections/component_map.py\", line 73, in __getitem__\n    raise KeyError(\"Component with id '%s': %s\" % (id(obj), str(obj)))\nKeyError: \"Component with id '139952349192416': 2.0\"\n",
  "details": {
    "stdout": "",
    "stderr": "Traceback (most recent call last):\n  File \"/workspace/pyomo/common/collections/component_map.py\", line 71, in __getitem__\n    return self._dict[id(obj)][1]\nKeyError: 139952349192416\n\nDuring handling of the above exception, another exception occurred:\n\nTraceback (most recent call last):\n  File \"<stdin>\", line 15, in <module>\n  File \"/workspace/pyomo/core/expr/calculus/derivatives.py\", line 96, in differentiate\n    res = reverse_sd(expr=expr)\n  File \"/workspace/pyomo/core/expr/calculus/diff_with_pyomo.py\", line 484, in reverse_sd\n    return _reverse_diff_helper(expr, False)\n  File \"/workspace/pyomo/core/expr/calculus/diff_with_pyomo.py\", line 442, in _reverse_diff_helper\n    _diff_GeneralExpression(e, val_dict, der_dict)\n  File \"/workspace/pyomo/core/expr/calculus/diff_with_pyomo.py\", line 331, in _diff_GeneralExpression\n    der_dict[node.expr] += der_dict[node]\n  File \"/workspace/pyomo/common/collections/component_map.py\", line 73, in __getitem__\n    raise KeyError(\"Component with id '%s': %s\" % (id(obj), str(obj)))\nKeyError: \"Component with id '139952349192416': 2.0\"\n",
    "exit_code": 1
  }
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/calculus/diff_with_pyomo.py",
  "content": "_unary_map['sqrt'] = _diff_sqrt\n_unary_map['abs'] = _diff_abs\n\n\ndef _diff_UnaryFunctionExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.UnaryFunctionExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    if node.getname() in _unary_map:\n        _unary_map[node.getname()](node, val_dict, der_dict)\n    else:\n        raise DifferentiationException(\n            'Unsupported expression type for differentiation: {0}'.format(type(node))\n        )\n\n\ndef _diff_GeneralExpression(node, val_dict, der_dict):\n    \"\"\"\n    Reverse automatic differentiation for named expressions.\n\n    Parameters\n    ----------\n    node: The named expression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    der_dict[node.expr] += der_dict[node]\n\n\ndef _diff_ExternalFunctionExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.ExternalFunctionExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    der = der_dict[node]\n    vals = tuple(val_dict[i] for i in node.args)\n    derivs = node._fcn.evaluate_fgh(vals, fgh=1)[1]\n    for ndx, arg in enumerate(node.args):\n        der_dict[arg] += der * derivs[ndx]\n\n\n_diff_map = dict()",
  "start_line": 300,
  "end_line": 350,
  "total_lines": 484,
  "is_truncated": false
}

{
  "status": "ok",
  "filepath": "pyomo/common/collections/component_map.py",
  "content": "#  ___________________________________________________________________________\n#\n#  Pyomo: Python Optimization Modeling Objects\n#  Copyright (c) 2008-2022\n#  National Technology and Engineering Solutions of Sandia, LLC\n#  Under the terms of Contract DE-NA0003525 with National Technology and\n#  Engineering Solutions of Sandia, LLC, the U.S. Government retains certain\n#  rights in this software.\n#  This software is distributed under the 3-clause BSD License.\n#  ___________________________________________________________________________\n\nfrom collections.abc import MutableMapping as collections_MutableMapping\nfrom collections.abc import Mapping as collections_Mapping\nfrom pyomo.common.autoslots import AutoSlots\n\n\ndef _rebuild_ids(encode, val):\n    if encode:\n        return val\n    else:\n        # object id() may have changed after unpickling,\n        # so we rebuild the dictionary keys\n        return {id(obj): (obj, v) for obj, v in val.values()}\n\n\nclass ComponentMap(AutoSlots.Mixin, collections_MutableMapping):\n    \"\"\"\n    This class is a replacement for dict that allows Pyomo\n    modeling components to be used as entry keys. The\n    underlying mapping is based on the Python id() of the\n    object, which gets around the problem of hashing\n    subclasses of NumericValue. This class is meant for\n    creating mappings from Pyomo components to values. The\n    use of non-Pyomo components as entry keys should be\n    avoided.\n\n    A reference to the object is kept around as long as it\n    has a corresponding entry in the container, so there is\n    no need to worry about id() clashes.\n\n    We also override __setstate__ so that we can rebuild the\n    container based on possibly updated object ids after\n    a deepcopy or pickle.\n\n    *** An instance of this class should never be\n    deepcopied/pickled unless it is done so along with the\n    components for which it contains map entries (e.g., as\n    part of a block). ***\n    \"\"\"\n\n    __slots__ = (\"_dict\",)\n    __autoslot_mappers__ = {'_dict': _rebuild_ids}\n\n    def __init__(self, *args, **kwds):\n        # maps id(obj) -> (obj,val)\n        self._dict = {}\n        # handle the dict-style initialization scenarios\n        self.update(*args, **kwds)\n\n    def __str__(self):\n        \"\"\"String representation of the mapping.\"\"\"\n        tmp = {str(c) + \" (id=\" + str(id(c)) + \")\": v for c, v in self.items()}\n        return \"ComponentMap(\" + str(tmp) + \")\"\n\n    #\n    # Implement MutableMapping abstract methods\n    #\n\n    def __getitem__(self, obj):\n        try:\n            return self._dict[id(obj)][1]\n        except KeyError:\n            raise KeyError(\"Component with id '%s': %s\" % (id(obj), str(obj)))\n\n    def __setitem__(self, obj, val):\n        self._dict[id(obj)] = (obj, val)\n\n    def __delitem__(self, obj):\n        try:\n            del self._dict[id(obj)]\n        except KeyError:\n            raise KeyError(\"Component with id '%s': %s\" % (id(obj), str(obj)))\n\n    def __iter__(self):\n        return (obj for obj, val in self._dict.values())\n\n    def __len__(self):\n        return self._dict.__len__()\n\n    #\n    # Overload MutableMapping default implementations\n    #\n\n    # We want to avoid generating Pyomo expressions due to\n    # comparison of values, so we convert both objects to a\n    # plain dictionary mapping key->(type(val), id(val)) and\n    # compare that instead.\n    def __eq__(self, other):\n        if not isinstance(other, collections_Mapping):\n            return False\n        return {(type(key), id(key)): val for key, val in self.items()} == {\n            (type(key), id(key)): val for key, val in other.items()\n        }\n\n    def __ne__(self, other):\n        return not (self == other)\n\n    #\n    # The remaining methods have slow default\n    # implementations for MutableMapping. In particular,\n    # they rely KeyError catching, which is slow for this\n    # class because KeyError messages use fully qualified\n    # names.\n    #\n\n    def __contains__(self, obj):\n        return id(obj) in self._dict\n\n    def clear(self):\n        'D.clear() -> None.  Remove all items from D.'\n        self._dict.clear()\n\n    def get(self, key, default=None):\n        'D.get(k[,d]) -> D[k] if k in D, else d.  d defaults to None.'\n        if key in self:\n            return self[key]\n        return default\n\n    def setdefault(self, key, default=None):\n        'D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D'\n        if key in self:\n            return self[key]\n        else:\n            self[key] = default\n        return default",
  "start_line": 1,
  "end_line": 135,
  "total_lines": 135,
  "is_truncated": false
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/calculus/diff_with_pyomo.py",
  "content": "            self.operation_func = _numeric_apply_operation\n        else:\n            self.value_func = _symbolic_value\n            self.operation_func = _symbolic_apply_operation\n\n    def visit(self, node, values):\n        self.val_dict[node] = self.operation_func(node, values)\n        self.der_dict[node] = 0\n        self.expr_list.append(node)\n        return self.val_dict[node]\n\n    def visiting_potential_leaf(self, node):\n        if node in self.val_dict:\n            return True, self.val_dict[node]\n\n        if node.__class__ in nonpyomo_leaf_types:\n            self.val_dict[node] = node\n            self.der_dict[node] = 0\n            return True, node\n\n        if not node.is_expression_type():\n            val = self.value_func(node)\n            self.val_dict[node] = val\n            self.der_dict[node] = 0\n            return True, val\n\n        return False, None\n\n\ndef _reverse_diff_helper(expr, numeric=True):\n    val_dict = ComponentMap()\n    der_dict = ComponentMap()\n    expr_list = list()\n\n    visitorA = _LeafToRootVisitor(val_dict, der_dict, expr_list, numeric=numeric)\n    visitorA.dfs_postorder_stack(expr)\n\n    der_dict[expr] = 1\n    for e in reversed(expr_list):\n        if e.__class__ in _diff_map:\n            _diff_map[e.__class__](e, val_dict, der_dict)\n        elif e.is_named_expression_type():\n            _diff_GeneralExpression(e, val_dict, der_dict)\n        else:\n            raise DifferentiationException(\n                'Unsupported expression type for differentiation: {0}'.format(type(e))\n            )\n\n    return der_dict\n\n",
  "start_line": 400,
  "end_line": 450,
  "total_lines": 484,
  "is_truncated": false
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/calculus/diff_with_pyomo.py",
  "content": "_diff_map = dict()\n_diff_map[_expr.ProductExpression] = _diff_ProductExpression\n_diff_map[_expr.DivisionExpression] = _diff_DivisionExpression\n_diff_map[_expr.PowExpression] = _diff_PowExpression\n_diff_map[_expr.SumExpression] = _diff_SumExpression\n_diff_map[_expr.MonomialTermExpression] = _diff_ProductExpression\n_diff_map[_expr.NegationExpression] = _diff_NegationExpression\n_diff_map[_expr.UnaryFunctionExpression] = _diff_UnaryFunctionExpression\n_diff_map[_expr.ExternalFunctionExpression] = _diff_ExternalFunctionExpression\n_diff_map[_expr.LinearExpression] = _diff_SumExpression\n_diff_map[_expr.AbsExpression] = _diff_abs\n\n_diff_map[_expr.NPV_ProductExpression] = _diff_ProductExpression\n_diff_map[_expr.NPV_DivisionExpression] = _diff_DivisionExpression\n_diff_map[_expr.NPV_PowExpression] = _diff_PowExpression\n_diff_map[_expr.NPV_SumExpression] = _diff_SumExpression\n_diff_map[_expr.NPV_NegationExpression] = _diff_NegationExpression\n_diff_map[_expr.NPV_UnaryFunctionExpression] = _diff_UnaryFunctionExpression\n_diff_map[_expr.NPV_ExternalFunctionExpression] = _diff_ExternalFunctionExpression\n_diff_map[_expr.NPV_AbsExpression] = _diff_abs\n\n\ndef _symbolic_value(x):\n    return x\n\n\ndef _numeric_apply_operation(node, values):\n    return node._apply_operation(values)\n\n\ndef _symbolic_apply_operation(node, values):\n    return node\n\n\nclass _LeafToRootVisitor(ExpressionValueVisitor):\n    def __init__(self, val_dict, der_dict, expr_list, numeric=True):\n        \"\"\"\n        Parameters\n        ----------\n        val_dict: ComponentMap\n        der_dict: ComponentMap\n        \"\"\"\n        self.val_dict = val_dict\n        self.der_dict = der_dict\n        self.expr_list = expr_list\n        assert len(self.expr_list) == 0\n        assert len(self.val_dict) == 0\n        assert len(self.der_dict) == 0\n        if numeric:\n            self.value_func = value\n            self.operation_func = _numeric_apply_operation",
  "start_line": 350,
  "end_line": 400,
  "total_lines": 484,
  "is_truncated": false
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/calculus/diff_with_pyomo.py",
  "content": "#  ___________________________________________________________________________\n#\n#  Pyomo: Python Optimization Modeling Objects\n#  Copyright (c) 2008-2022\n#  National Technology and Engineering Solutions of Sandia, LLC\n#  Under the terms of Contract DE-NA0003525 with National Technology and\n#  Engineering Solutions of Sandia, LLC, the U.S. Government retains certain\n#  rights in this software.\n#  This software is distributed under the 3-clause BSD License.\n#  ___________________________________________________________________________\n\nfrom pyomo.common.collections import ComponentMap, ComponentSet\nimport pyomo.core.expr as _expr\nfrom pyomo.core.expr.visitor import ExpressionValueVisitor, nonpyomo_leaf_types\nfrom pyomo.core.expr.numvalue import value, is_constant\nfrom pyomo.core.expr import exp, log, sin, cos\nimport math\n\n\n\"\"\"\nThe purpose of this file is to perform symbolic differentiation and \nfirst order automatic differentiation directly with pyomo \nexpressions. This is certainly not as efficient as doing AD in C or \nC++, but it avoids the translation from pyomo expressions to a form \nwhere AD can be performed efficiently. The only functions that are \nmeant to be used by users are reverse_ad and reverse_sd. First, \nvalues are propagated from the leaves to each node in the tree with \nthe LeafToRoot visitors. Then derivative values are propagated from \nthe root to the leaves with the RootToLeaf visitors.\n\"\"\"\n\n\nclass DifferentiationException(Exception):\n    pass\n\n\ndef _diff_ProductExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.ProductExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    assert len(node.args) == 2\n    arg1, arg2 = node.args\n    der = der_dict[node]\n    der_dict[arg1] += der * val_dict[arg2]\n    der_dict[arg2] += der * val_dict[arg1]",
  "start_line": 1,
  "end_line": 50,
  "total_lines": 484,
  "is_truncated": false
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/visitor.py",
  "content": "#  ___________________________________________________________________________\n#\n#  Pyomo: Python Optimization Modeling Objects\n#  Copyright (c) 2008-2022\n#  National Technology and Engineering Solutions of Sandia, LLC\n#  Under the terms of Contract DE-NA0003525 with National Technology and\n#  Engineering Solutions of Sandia, LLC, the U.S. Government retains certain\n#  rights in this software.\n#  This software is distributed under the 3-clause BSD License.\n#  ___________________________________________________________________________\n\nfrom __future__ import division\n\nimport inspect\nimport logging\nimport sys\nfrom copy import deepcopy\nfrom collections import deque\n\nlogger = logging.getLogger('pyomo.core')\n\nfrom pyomo.common.deprecation import deprecated, deprecation_warning\nfrom pyomo.common.errors import DeveloperError, TemplateExpressionError\nfrom pyomo.common.numeric_types import (\n    nonpyomo_leaf_types,\n    native_types,\n    native_numeric_types,\n    value,\n)\nimport pyomo.core.expr.expr_common as common\nfrom pyomo.core.expr.symbol_map import SymbolMap\n\ntry:\n    # sys._getframe is slightly faster than inspect's currentframe, but\n    # is not guaranteed to exist everywhere\n    currentframe = sys._getframe\nexcept AttributeError:\n    currentframe = inspect.currentframe\n\n\ndef get_stack_depth():\n    n = -1  # skip *this* frame in the count\n    f = currentframe()\n    while f is not None:\n        n += 1\n        f = f.f_back\n    return n\n\n\n# For efficiency, we want to run recursively, but don't want to hit\n# Python's recursion limit (because that would be difficult to recover\n# from cleanly).  However, there is a non-trivial cost to determine the\n# current stack depth - and we don't want to hit that for every call.\n# Instead, we will assume that the walker is always called with at\n# least RECURSION_LIMIT frames available on the stack.  When we hit the\n# end of that limit, we will actually check how much space is left on\n# the stack and run recursively until only 2*RECURSION_LIMIT frames are\n# left.  For the vast majority of well-formed expressions this approach\n# avoids a somewhat costly call to get_stack_depth, but still catches\n# the vast majority of cases that could generate a recursion error.\nRECURSION_LIMIT = 50\n\n\nclass RevertToNonrecursive(Exception):\n    pass\n\n\n# NOTE: This module also has dependencies on numeric_expr; however, to\n# avoid circular dependencies, we will NOT import them here.  Instead,\n# until we can resolve the circular dependencies, they will be injected\n# into this module by the .current module (which must be imported\n# *after* numeric_expr, logocal_expr, and this module.\n\n\n# -------------------------------------------------------\n#\n# Visitor Logic\n#\n# -------------------------------------------------------\n\n\nclass StreamBasedExpressionVisitor(object):\n    \"\"\"This class implements a generic stream-based expression walker.\n\n     This visitor walks an expression tree using a depth-first strategy\n     and generates a full event stream similar to other tree visitors\n     (e.g., the expat XML parser).  The following events are triggered\n     through callback functions as the traversal enters and leaves nodes\n     in the tree:\n\n       initializeWalker(expr) -> walk, result\n       enterNode(N1) -> args, data\n       {for N2 in args:}\n         beforeChild(N1, N2) -> descend, child_result\n           enterNode(N2) -> N2_args, N2_data\n           [...]\n           exitNode(N2, n2_data) -> child_result\n         acceptChildResult(N1, data, child_result) -> data\n         afterChild(N1, N2) -> None\n       exitNode(N1, data) -> N1_result\n       finalizeWalker(result) -> result\n\n     Individual event callbacks match the following signatures:\n\n    walk, result = initializeWalker(self, expr):\n\n         initializeWalker() is called to set the walker up and perform\n         any preliminary processing on the root node.  The method returns\n         a flag indicating if the tree should be walked and a result.  If\n         `walk` is True, then result is ignored.  If `walk` is False,\n         then `result` is returned as the final result from the walker,\n         bypassing all other callbacks (including finalizeResult).\n\n    args, data = enterNode(self, node):\n\n         enterNode() is called when the walker first enters a node (from\n         above), and is passed the node being entered.  It is expected to\n         return a tuple of child `args` (as either a tuple or list) and a\n         user-specified data structure for collecting results.  If None\n         is returned for args, the node's args attribute is used for\n         expression types and the empty tuple for leaf nodes.  Returning\n         None is equivalent to returning (None,None).  If the callback is\n         not defined, the default behavior is equivalent to returning\n         (None, []).\n\n     node_result = exitNode(self, node, data):\n\n         exitNode() is called after the node is completely processed (as\n         the walker returns up the tree to the parent node).  It is\n         passed the node and the results data structure (defined by\n         enterNode() and possibly further modified by\n         acceptChildResult()), and is expected to return the \"result\" for\n         this node.  If not specified, the default action is to return\n         the data object from enterNode().\n\n     descend, child_result = beforeChild(self, node, child, child_idx):\n\n         beforeChild() is called by a node for every child before\n         entering the child node.  The node, child node, and child index\n         (position in the args list from enterNode()) are passed as\n         arguments.  beforeChild should return a tuple (descend,\n         child_result).  If descend is False, the child node will not be\n         entered and the value returned to child_result will be passed to\n         the node's acceptChildResult callback.  Returning None is\n         equivalent to (True, None).  The default behavior if not\n         specified is equivalent to (True, None).\n\n     data = acceptChildResult(self, node, data, child_result, child_idx):\n\n         acceptChildResult() is called for each child result being",
  "start_line": 1,
  "end_line": 150,
  "total_lines": 1660,
  "is_truncated": true
}

{
  "status": "ok",
  "stdout": "796:class ExpressionValueVisitor(object):\n",
  "stderr": "",
  "exit_code": 0
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/visitor.py",
  "content": "class ExpressionValueVisitor(object):\n    \"\"\"\n    Note:\n        This class is a customization of the PyUtilib :class:`ValueVisitor\n        <pyutilib.misc.visitor.ValueVisitor>` class that is tailored\n        to efficiently walk Pyomo expression trees.  However, this class\n        is not a subclass of the PyUtilib :class:`ValueVisitor\n        <pyutilib.misc.visitor.ValueVisitor>` class because all key methods\n        are reimplemented.\n    \"\"\"\n\n    def visit(self, node, values):  # pragma: no cover\n        \"\"\"\n        Visit a node in a tree and compute its value using\n        the values of its children.\n\n        This method should be over-written by a user\n        that is creating a sub-class.\n\n        Args:\n            node: a node in a tree\n            values: a list of values of this node's children\n\n        Returns:\n            The *value* for this node, which is computed using :attr:`values`\n        \"\"\"\n        pass\n\n    def visiting_potential_leaf(self, node):  # pragma: no cover\n        \"\"\"\n        Visit a node and return its value if it is a leaf.\n\n        Note:\n            This method needs to be over-written for a specific\n            visitor application.\n\n        Args:\n            node: a node in a tree\n\n        Returns:\n            A tuple: ``(flag, value)``.   If ``flag`` is False,\n            then the node is not a leaf and ``value`` is :const:`None`.\n            Otherwise, ``value`` is the computed value for this node.\n        \"\"\"\n        raise RuntimeError(\"The visiting_potential_leaf method needs to be defined.\")\n\n    def finalize(self, ans):  # pragma: no cover\n        \"\"\"\n        This method defines the return value for the search methods\n        in this class.\n\n        The default implementation returns the value of the\n        initial node (aka the root node), because\n        this visitor pattern computes and returns value for each\n        node to enable the computation of this value.\n\n        Args:\n            ans: The final value computed by the search method.\n\n        Returns:\n            The final value after the search. Defaults to simply\n            returning :attr:`ans`.\n        \"\"\"\n        return ans\n\n    def dfs_postorder_stack(self, node):\n        \"\"\"\n        Perform a depth-first search in postorder using a stack\n        implementation.\n\n        Note:\n            This method has the same functionality as the\n            PyUtilib :class:`ValueVisitor.dfs_postorder_stack <pyutilib.misc.visitor.ValueVisitor.dfs_postorder_stack>`\n            method.  The difference is that this method\n            is tailored to efficiently walk Pyomo expression trees.\n\n        Args:\n            node: The root node of the expression tree\n                that is searched.\n\n        Returns:\n            The return value is determined by the :func:`finalize` function,\n            which may be defined by the user.\n        \"\"\"\n        flag, value = self.visiting_potential_leaf(node)\n        if flag:\n            return self.finalize(value)\n        # _stack = [ (node, self.children(node), 0, len(self.children(node)), [])]\n        _stack = [(node, node._args_, 0, node.nargs(), [])]\n        #\n        # Iterate until the stack is empty\n        #\n        # Note: 1 is faster than True for Python 2.x\n        #\n        while 1:\n            #\n            # Get the top of the stack\n            #   _obj        Current expression object\n            #   _argList    The arguments for this expression object\n            #   _idx        The current argument being considered\n            #   _len        The number of arguments\n            #   _result     The return values\n            #\n            _obj, _argList, _idx, _len, _result = _stack.pop()\n            #",
  "start_line": 796,
  "end_line": 900,
  "total_lines": 1660,
  "is_truncated": false
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/calculus/diff_with_pyomo.py",
  "content": "#  ___________________________________________________________________________\n#\n#  Pyomo: Python Optimization Modeling Objects\n#  Copyright (c) 2008-2022\n#  National Technology and Engineering Solutions of Sandia, LLC\n#  Under the terms of Contract DE-NA0003525 with National Technology and\n#  Engineering Solutions of Sandia, LLC, the U.S. Government retains certain\n#  rights in this software.\n#  This software is distributed under the 3-clause BSD License.\n#  ___________________________________________________________________________\n\nfrom pyomo.common.collections import ComponentMap, ComponentSet\nimport pyomo.core.expr as _expr\nfrom pyomo.core.expr.visitor import ExpressionValueVisitor, nonpyomo_leaf_types\nfrom pyomo.core.expr.numvalue import value, is_constant\nfrom pyomo.core.expr import exp, log, sin, cos\nimport math\n\n\n\"\"\"\nThe purpose of this file is to perform symbolic differentiation and \nfirst order automatic differentiation directly with pyomo \nexpressions. This is certainly not as efficient as doing AD in C or \nC++, but it avoids the translation from pyomo expressions to a form \nwhere AD can be performed efficiently. The only functions that are \nmeant to be used by users are reverse_ad and reverse_sd. First, \nvalues are propagated from the leaves to each node in the tree with \nthe LeafToRoot visitors. Then derivative values are propagated from \nthe root to the leaves with the RootToLeaf visitors.\n\"\"\"\n\n\nclass DifferentiationException(Exception):\n    pass\n\n\ndef _diff_ProductExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.ProductExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    assert len(node.args) == 2\n    arg1, arg2 = node.args\n    der = der_dict[node]\n    der_dict[arg1] += der * val_dict[arg2]\n    der_dict[arg2] += der * val_dict[arg1]\n\n\ndef _diff_SumExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.SumExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    der = der_dict[node]\n    for arg in node.args:\n        der_dict[arg] += der\n\n\ndef _diff_PowExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.PowExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    assert len(node.args) == 2\n    arg1, arg2 = node.args\n    der = der_dict[node]\n    val1 = val_dict[arg1]\n    val2 = val_dict[arg2]\n    der_dict[arg1] += der * val2 * val1 ** (val2 - 1)\n    if arg2.__class__ not in nonpyomo_leaf_types:\n        der_dict[arg2] += der * val1**val2 * log(val1)\n\n\ndef _diff_DivisionExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.DivisionExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    assert len(node.args) == 2\n    num = node.args[0]\n    den = node.args[1]\n    der = der_dict[node]\n    der_dict[num] += der * (1 / val_dict[den])\n    der_dict[den] -= der * val_dict[num] / val_dict[den] ** 2\n\n\ndef _diff_NegationExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.UnaryFunctionExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    assert len(node.args) == 1\n    arg = node.args[0]\n    der = der_dict[node]\n    der_dict[arg] -= der\n\n\ndef _diff_exp(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.UnaryFunctionExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    assert len(node.args) == 1\n    arg = node.args[0]\n    der = der_dict[node]\n    der_dict[arg] += der * exp(val_dict[arg])\n\n\ndef _diff_log(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.UnaryFunctionExpression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    assert len(node.args) == 1\n    arg = node.args[0]\n    der = der_dict[node]\n    der_dict[arg] += der / val_dict[arg]\n\n\ndef _diff_log10(node, val_dict, der_dict):\n    \"\"\"\n",
  "start_line": 1,
  "end_line": 150,
  "total_lines": 484,
  "is_truncated": true
}

{
  "status": "ok",
  "stdout": "384:class _LeafToRootVisitor(ExpressionValueVisitor):\n434:    visitorA = _LeafToRootVisitor(val_dict, der_dict, expr_list, numeric=numeric)\n",
  "stderr": "",
  "exit_code": 0
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/calculus/diff_with_pyomo.py",
  "content": "class _LeafToRootVisitor(ExpressionValueVisitor):\n    def __init__(self, val_dict, der_dict, expr_list, numeric=True):\n        \"\"\"\n        Parameters\n        ----------\n        val_dict: ComponentMap\n        der_dict: ComponentMap\n        \"\"\"\n        self.val_dict = val_dict\n        self.der_dict = der_dict\n        self.expr_list = expr_list\n        assert len(self.expr_list) == 0\n        assert len(self.val_dict) == 0\n        assert len(self.der_dict) == 0\n        if numeric:\n            self.value_func = value\n            self.operation_func = _numeric_apply_operation\n        else:\n            self.value_func = _symbolic_value\n            self.operation_func = _symbolic_apply_operation\n\n    def visit(self, node, values):\n        self.val_dict[node] = self.operation_func(node, values)\n        self.der_dict[node] = 0\n        self.expr_list.append(node)\n        return self.val_dict[node]\n\n    def visiting_potential_leaf(self, node):\n        if node in self.val_dict:\n            return True, self.val_dict[node]\n\n        if node.__class__ in nonpyomo_leaf_types:\n            self.val_dict[node] = node\n            self.der_dict[node] = 0\n            return True, node\n\n        if not node.is_expression_type():\n            val = self.value_func(node)\n            self.val_dict[node] = val\n            self.der_dict[node] = 0\n            return True, val\n\n        return False, None\n\n\ndef _reverse_diff_helper(expr, numeric=True):\n    val_dict = ComponentMap()",
  "start_line": 384,
  "end_line": 430,
  "total_lines": 484,
  "is_truncated": false
}

{
  "status": "ok",
  "stdout": "321:def _diff_GeneralExpression(node, val_dict, der_dict):\n442:            _diff_GeneralExpression(e, val_dict, der_dict)\n",
  "stderr": "",
  "exit_code": 0
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/calculus/diff_with_pyomo.py",
  "content": "def _diff_GeneralExpression(node, val_dict, der_dict):\n    \"\"\"\n    Reverse automatic differentiation for named expressions.\n\n    Parameters\n    ----------\n    node: The named expression\n    val_dict: ComponentMap\n    der_dict: ComponentMap\n    \"\"\"\n    der_dict[node.expr] += der_dict[node]\n\n\ndef _diff_ExternalFunctionExpression(node, val_dict, der_dict):\n    \"\"\"\n\n    Parameters\n    ----------\n    node: pyomo.core.expr.numeric_expr.ExternalFunctionExpression\n    val_dict: ComponentMap",
  "start_line": 321,
  "end_line": 340,
  "total_lines": 484,
  "is_truncated": false
}

{
  "status": "ok",
  "stdout": "376:def _numeric_apply_operation(node, values):\n400:            self.operation_func = _numeric_apply_operation\n",
  "stderr": "",
  "exit_code": 0
}

{
  "status": "ok",
  "filepath": "pyomo/core/expr/calculus/diff_with_pyomo.py",
  "content": "def _numeric_apply_operation(node, values):\n    return node._apply_operation(values)\n\n\ndef _symbolic_apply_operation(node, values):\n    return node\n\n",
  "start_line": 376,
  "end_line": 383,
  "total_lines": 484,
  "is_truncated": false
}