LinearRepnVisitor

(class from pyomo.repn.linear)

class pyomo.repn.linear.LinearRepnVisitor(subexpression_cache, var_map=None, var_order=None, sorter=None, var_recorder=None)

Bases: StreamBasedExpressionVisitor

__init__(subexpression_cache, var_map=None, var_order=None, sorter=None, var_recorder=None)

Methods

__init__(subexpression_cache[, var_map, ...])
beforeChild(node, child, child_idx)
check_constant(ans, obj)
enterNode(node)
exitNode(node, data)
finalizeResult(result)
initializeWalker(expr)
walk_expression(expr)	Walk an expression, calling registered callbacks.
walk_expression_nonrecursive(expr)	Nonrecursively walk an expression, calling registered callbacks.

Attributes

before_child_dispatcher
client_methods
exit_node_dispatcher
expand_nonlinear_products
max_exponential_expansion

Member Documentation

walk_expression(expr)

Walk an expression, calling registered callbacks.

This is the standard interface for running the visitor. It defaults to using an efficient recursive implementation of the visitor, falling back on walk_expression_nonrecursive() if the recursion stack gets too deep.

walk_expression_nonrecursive(expr)

Nonrecursively walk an expression, calling registered callbacks.

This routine is safer than the recursive walkers for deep (or unbalanced) trees. It is, however, slightly slower than the recursive implementations.