ó
HÊRc @ s5 d d l m Z d Z d „ Z d „ Z d „ Z d S( iÿÿÿÿ( t Dependenciess <>c C s
t | k S( N( t PARENT_DOT_THIS( t s( ( s[ /afs/athena.mit.edu/user/x/a/xavid/.local/lib/python2.7/site-packages/bazbase/formatting.pyt is_parent_dot_this s c C sA t ƒ } t r=| j } | j ƒ } | } | j } | j | ƒ | j | ƒ x„ | rÓ t | j ƒ rÓ | j ƒ } | j
| ƒ } | d k r¶ | j | j
| ƒ d | j
| f | f S| j | ƒ | j | ƒ qP Wt | j d ƒ j ƒ } d } d } | j | ƒ r3| j | ƒ r3| t | ƒ t | ƒ !} n | | f Sd S( Ns %s has no default for %ss utf-8s <>s <>( R t Truet elementt
get_ancestorst propnamet addDept addParentDepR t valuet popt get_propvalt Nonet addNoPropvalDept enamet unicodet stript
startswitht endswitht len( t propvalt depst et anct pvR t rett dst de( ( s[ /afs/athena.mit.edu/user/x/a/xavid/.local/lib/python2.7/site-packages/bazbase/formatting.pyt
nice_value s,
c C s g } | g } x‡ t | ƒ d k r˜ | j d ƒ } x8 t | ƒ d k rm | d d j | ƒ rm | j ƒ q6 W| g } | d j | ƒ | j | ƒ q W| S( sW Formats elms as a tree.
elms should be a list of elements ordered preorder, such that each element
is followed by a single region of its descendants, but with missing
elements allowed.
The return value is a list of roots. A node is either a leaf
or a subtree.
A leaf is [element]. A subtree is [element, [<>], [<>]].i i iÿÿÿÿ( R R t is_ancestor_oft append( t elmsR t stackR t bubble( ( s[ /afs/athena.mit.edu/user/x/a/xavid/.local/lib/python2.7/site-packages/bazbase/formatting.pyt as_tree" s - N( t bazbase.dependenciesR R R R R# ( ( ( s[ /afs/athena.mit.edu/user/x/a/xavid/.local/lib/python2.7/site-packages/bazbase/formatting.pyt s