ó ”¼™\c@ s>ddlmZmZd„Zd„Zd„Zd„ZdS(i’’’’(tprint_functiontdivisioncC s\dd„}|sdSd}x"|d D]}|||ƒ7}q'W|||ddƒ7}|S(sĪ Prettyprints systems of nodes. Examples ======== >>> from sympy.printing.tree import pprint_nodes >>> print(pprint_nodes(["a", "b1\nb2", "c"])) +-a +-b1 | b2 +-c icS ss|jdƒ}d|d}xO|dD]C}|dkr@q(n|dkr]|d|7}q(|d|7}q(W|S(Ns s+-%s iits| %s s %s (tsplit(tsttypetxtrta((s2lib/python2.7/site-packages/sympy/printing/tree.pytindents  Ri’’’’i((tsubtreesR tfR((s2lib/python2.7/site-packages/sympy/printing/tree.pyt pprint_nodess cC syd|jjt|ƒf}|j}|ruxGt|ƒD]6}||}|dkrZq8n|d||f7}q8Wn|S(su Returns information about the "node". This includes class name, string representation and assumptions. s%s: %s N(t __class__t__name__tstrt _assumptionstsortedtNone(tnodeRtdRtv((s2lib/python2.7/site-packages/sympy/printing/tree.pyt print_node's   cC sGg}x$|jD]}|jt|ƒƒqWt|ƒt|ƒ}|S(s» Returns a tree representation of "node" as a string. It uses print_node() together with pprint_nodes() on node.args recursively. See Also ======== print_tree (targstappendttreeRR (RR targR((s2lib/python2.7/site-packages/sympy/printing/tree.pyR8s cC stt|ƒƒdS(s¢ Prints a tree representation of "node". Examples ======== >>> from sympy.printing import print_tree >>> from sympy import Symbol >>> x = Symbol('x', odd=True) >>> y = Symbol('y', even=True) >>> print_tree(y**x) Pow: y**x +-Symbol: y | algebraic: True | commutative: True | complex: True | even: True | hermitian: True | imaginary: 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 hermitian: True imaginary: False integer: True irrational: False noninteger: False nonzero: True odd: True rational: True real: True transcendental: False zero: False See Also ======== tree N(tprintR(R((s2lib/python2.7/site-packages/sympy/printing/tree.pyt print_treeKs2N(t __future__RRR RRR(((s2lib/python2.7/site-packages/sympy/printing/tree.pyts #