Spaces:
Sleeping
Sleeping
File size: 3,872 Bytes
6a86ad5 |
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 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 |
def pprint_nodes(subtrees):
"""
Prettyprints systems of nodes.
Examples
========
>>> from sympy.printing.tree import pprint_nodes
>>> print(pprint_nodes(["a", "b1\\nb2", "c"]))
+-a
+-b1
| b2
+-c
"""
def indent(s, type=1):
x = s.split("\n")
r = "+-%s\n" % x[0]
for a in x[1:]:
if a == "":
continue
if type == 1:
r += "| %s\n" % a
else:
r += " %s\n" % a
return r
if not subtrees:
return ""
f = ""
for a in subtrees[:-1]:
f += indent(a)
f += indent(subtrees[-1], 2)
return f
def print_node(node, assumptions=True):
"""
Returns information about the "node".
This includes class name, string representation and assumptions.
Parameters
==========
assumptions : bool, optional
See the ``assumptions`` keyword in ``tree``
"""
s = "%s: %s\n" % (node.__class__.__name__, str(node))
if assumptions:
d = node._assumptions
else:
d = None
if d:
for a in sorted(d):
v = d[a]
if v is None:
continue
s += "%s: %s\n" % (a, v)
return s
def tree(node, assumptions=True):
"""
Returns a tree representation of "node" as a string.
It uses print_node() together with pprint_nodes() on node.args recursively.
Parameters
==========
asssumptions : bool, optional
The flag to decide whether to print out all the assumption data
(such as ``is_integer`, ``is_real``) associated with the
expression or not.
Enabling the flag makes the result verbose, and the printed
result may not be determinisitic because of the randomness used
in backtracing the assumptions.
See Also
========
print_tree
"""
subtrees = []
for arg in node.args:
subtrees.append(tree(arg, assumptions=assumptions))
s = print_node(node, assumptions=assumptions) + pprint_nodes(subtrees)
return s
def print_tree(node, assumptions=True):
"""
Prints a tree representation of "node".
Parameters
==========
asssumptions : bool, optional
The flag to decide whether to print out all the assumption data
(such as ``is_integer`, ``is_real``) associated with the
expression or not.
Enabling the flag makes the result verbose, and the printed
result may not be determinisitic because of the randomness used
in backtracing the assumptions.
Examples
========
>>> from sympy.printing import print_tree
>>> from sympy import Symbol
>>> x = Symbol('x', odd=True)
>>> y = Symbol('y', even=True)
Printing with full assumptions information:
>>> print_tree(y**x)
Pow: y**x
+-Symbol: y
| algebraic: True
| commutative: True
| complex: True
| even: True
| extended_real: True
| finite: True
| hermitian: True
| imaginary: False
| infinite: False
| integer: True
| irrational: False
| noninteger: False
| odd: False
| rational: True
| real: True
| transcendental: False
+-Symbol: x
algebraic: True
commutative: True
complex: True
even: False
extended_nonzero: True
extended_real: True
finite: True
hermitian: True
imaginary: False
infinite: False
integer: True
irrational: False
noninteger: False
nonzero: True
odd: True
rational: True
real: True
transcendental: False
zero: False
Hiding the assumptions:
>>> print_tree(y**x, assumptions=False)
Pow: y**x
+-Symbol: y
+-Symbol: x
See Also
========
tree
"""
print(tree(node, assumptions=assumptions))
|