/
tree_interface.jl
35 lines (27 loc) · 1.12 KB
/
tree_interface.jl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
AbstractTrees.children(p::Problem) = (p.objective, p.constraints)
AbstractTrees.children(e::AbstractExpr) = e.children
AbstractTrees.children(v::Variable) = ()
AbstractTrees.children(c::Constant) = ()
AbstractTrees.children(C::Constraint) = (C.lhs, C.rhs)
AbstractTrees.children(C::SDPConstraint) = (C.child,)
AbstractTrees.children(C::SOCConstraint) = C.children
AbstractTrees.children(C::SOCElemConstraint) = C.children
AbstractTrees.children(C::ExpConstraint) = C.children
AbstractTrees.printnode(io::IO, node::AbstractExpr) = summary(io, node)
AbstractTrees.printnode(io::IO, node::Constraint) = summary(io, node)
function AbstractTrees.printnode(io::IO, node::Vector{Constraint})
if length(node) == 0
print(io, "no constraints")
else
print(io, "constraints")
end
end
AbstractTrees.printnode(io::IO, node::Problem) = print(io, node.head)
function AbstractTrees.printnode(io::IO, node::Constant)
if length(node.value) <= 3
show(IOContext(io, :compact => true), node.value)
else
summary(io, node.value)
end
end
AbstractTrees.printnode(io::IO, node::Variable) = summary(io, node)