Ñò
Š„[Jc @ s¤ d Z d d k l Z d d k l Z d d d g Z d „ Z d „ Z e d „ Z d
e
f d „ ƒ YZ d e
f d
„ ƒ YZ e e d „ Z
d „ Z d „ Z d S( sM Topological sorting algorithms.
The topological sort is an algorithm that receives this list of
dependencies as a *partial ordering*, that is a list of pairs which
might say, *X is dependent on Y*, *Q is dependent on Z*, but does not
necessarily tell you anything about Q being dependent on X. Therefore,
its not a straight sort where every element can be compared to
another... only some of the elements have any sorting preference, and
then only towards just some of the other elements. For a particular
partial ordering, there can be many possible sorts that satisfy the
conditions.
iÿÿÿÿ( t CircularDependencyError( t utilt sortt sort_with_cyclest sort_as_treec C s7 g } t | | d t d t ƒD] } | | i q ~ S( sw sort the given list of items by dependency.
'tuples' is a list of tuples representing a partial ordering.
t allow_cyclest ignore_self_cycles( t _sortt Falset Truet item( t tuplest allitemst _[1]t n( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR s c C s_ g } t | | d t ƒD]> } | | i g } | i p g D] } | | i q> ~ f q ~ S( s! sort the given list of items by dependency, cutting out cycles.
returns results as an iterable of 2-tuples, containing the item,
and a list containing items involved in a cycle with this item, if any.
'tuples' is a list of tuples representing a partial ordering.
R ( R R R
t cycles( R R R
R t _[2]( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR " s c C s t t | | d | ƒƒ S( s sort the given list of items by dependency, and return results
as a hierarchical tree structure.
returns results as an iterable of 3-tuples, containing the item,
a list containing items involved in a cycle with this item, if any,
and a list of child tuples.
if with_cycles is False, the returned structure is of the same form
but the second element of each tuple, i.e. the 'cycles', is an empty list.
'tuples' is a list of tuples representing a partial ordering.
R ( t _organize_as_treeR ( R R t with_cycles( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR - s t _Nodec B s> e Z d Z d „ Z d „ Z d d „ Z d „ Z d „ Z RS( s Represent each item in the sort.c C s+ | | _ t ƒ | _ g | _ d | _ d S( N( R
t sett dependenciest childrent NoneR ( t selfR
( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt __init__A s c C s
| i ƒ S( N( t safestr( R ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt __str__G s i c C s~ d | d t | i ƒ | i d j o3 d t g } | i D]
} | | q< ~ ƒ d p d d d i d „ | i Dƒ ƒ S( Nt i s
(cycles: t )t s
c s s x | ] } t | ƒ Vq Wd S( N( t str( t .0R ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pys O s ( R R
R R t reprt joinR ( R t indentR
t x( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR J s cc C s d t | i ƒ S( Ns %s( R R
( R ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt __repr__Q s c C sK t | i ƒ } | i d j o( x% | i D] } | i | i ƒ q) Wn | S( s> Return a set of dependencies for this node and all its cycles.N( R R R R t update( R t depst c( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt all_depsT s
( t __name__t
__module__t __doc__R R R R% R) ( ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR > s t _EdgeCollectionc B sh e Z d Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z d „ Z
d „ Z d
„ Z RS( s A collection of directed edges.c C s( t i t ƒ | _ t i t ƒ | _ d S( N( R t defaultdictR t parent_to_childrent child_to_parents( R ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR ` s c C sH | \ } } | i | i | ƒ | i | i | ƒ | i i | ƒ d S( s Add an edge to this collection.N( R/ t addR0 R ( R t edget
parentnodet childnode( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR1 d s c C sO | \ } } | i | i | ƒ | i | i | ƒ | i | p | Sd Sd S( sg Remove an edge from this collection.
Return the childnode if it has no other parents.
N( R/ t removeR0 R ( R R2 R3 R4 ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR5 l s c C s! | | i j o t | i | ƒ S( N( R0 t bool( R t node( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt has_parentsz s c C sE | | i j o- g } | i | D] } | | | f q" ~ Sg Sd S( N( R/ ( R R7 R
t child( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt edges_by_parent} s -c C s
| i i ƒ S( N( R/ t keys( R ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt get_parentsƒ s c c sf | i i | d ƒ } | d j o@ x= | D]1 } | i | i | ƒ | i | p | Vq) q) Wn d S( s³ Remove all edges where the given node is a parent.
Return the collection of all nodes which were children of the
given node, and have no further parents.
N( R/ t popR R0 R5 ( R R7 R R9 ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt pop_node† s
c C s t d „ | i i ƒ Dƒ ƒ S( Nc s s x | ] } t | ƒ Vq Wd S( N( t len( R R$ ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pys • s ( t sumR/ t values( R ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt __len__” s c c s@ x9 | i i ƒ D]( \ } } x | D] } | | f Vq# Wq Wd S( N( R/ t iteritems( R t parentR R9 ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt __iter__— s
c C s t t | ƒ ƒ S( N( R! t list( R ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR% œ s (
R* R+ R, R R1 R5 R8 R: R< R> RB RE R% ( ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR- ] s c C s@ h } t ƒ } x‡ t | ƒ g } | D] } | | d q& ~ g } | D] } | | d qI ~ D]3 } t | ƒ | j o t | ƒ }
|
| | ( R R R R t nodest edgesR
t tR R
R7 R R4 R3 t queuet outputt cyclet leadR2 t k( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR Ÿ st S
#$
c C s | p d Sg } xRt | ƒ D]D} t | g ƒ } | i d j o t | i ƒ } n
t ƒ } | i ƒ } | oÚ x× t t | ƒ d d d ƒ D]µ } | | \ } } } | i | ƒ p | i | i ƒ oy | i g }
| i p g D] } |
| i qç ~
| i
f g | i
d d +| i | ƒ | i | ƒ g | | | d +q q Wn | i | | | f ƒ q W| i
ƒ d } g }
| D]P } |
| d i g } | d i p g D] } | | i q®~ | d i
f q‚~
| i
d d +| i g } | i p g D] } | | i q ~ | i
f S( sî Given a list of nodes from a topological sort, organize the
nodes into a tree structure, with as many non-dependent nodes
set as siblings to each other as possible.
returns nodes as 3-tuples (item, cycles, children).
i iÿÿÿÿi N( R t reversedR R R) t xrangeR? t intersectionR R
R R& RI R= ( RL t independentsR7 t subtreeR t nodealldepst indexR9 t childsubtreet childcyclesR
R t headR t it _[3]t _[4]( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyR Ú s.
#J
nc # sÑ t ƒ ‰ h ‰ d d ‡ ‡ ‡ ‡ f d † ‰ x ˆ i ƒ D] } ˆ | ƒ q: Wt d „ ˆ i ƒ Dƒ ƒ i ƒ } xZ | D]R } g } ˆ D]3 } | d | j o | d | j o | | qˆ qˆ ~ } | Vqw Wd S( Nc
s- | d j o | } g } n | | j o t Sx÷ ˆ i | ƒ D]æ \ } } | | j o q? n | i | ƒ ˆ | | | ƒ oœ t | ƒ } x | D] } ˆ i | ƒ | ˆ j oW ˆ | } g } | D] } | | i | ƒ qÇ ~ x | D] } | ˆ | ) s i i ( R R R< t dictRA ( RM RD t
unique_cyclesRQ R
R2 t edgecollection( ( Rg RM Rf R s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyRJ s
" 6N( R, t sqlalchemy.excR t
sqlalchemyR t __all__R R R R t objectR R- R R RJ ( ( ( s: /usr/lib/python2.6/site-packages/sqlalchemy/topological.pyt s B; /