LogicalToDoCplex

(class from pyomo.contrib.cp.repn.docplex_writer)

class pyomo.contrib.cp.repn.docplex_writer.LogicalToDoCplex(cpx_model, symbolic_solver_labels=False)

Bases: StreamBasedExpressionVisitor

__init__(cpx_model, symbolic_solver_labels=False)

Methods

__init__(cpx_model[, symbolic_solver_labels])
beforeChild(node, child, child_idx)
exitNode(node, data)
initializeWalker(expr)
walk_expression(expr)	Walk an expression, calling registered callbacks.
walk_expression_nonrecursive(expr)	Nonrecursively walk an expression, calling registered callbacks.

Attributes

client_methods
exit_node_dispatcher
finalizeResult

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.