File: //opt/alt/python27/lib64/python2.7/site-packages/sqlalchemy/util/topological.pyo
�
��4]c @ sc d Z d d l m Z d d l m Z d d d g Z e d � Z e d � Z d � Z d
� Z
d S( s Topological sorting algorithms.i ( t util( t CircularDependencyErrort sortt sort_as_subsetst find_cyclesc
c s� t j t � } x% | D] \ } } | | j | � q W| rF t j n t } | | � } x� | r� | � } x1 | D]) } | j | | � rq | j | � qq qq W| s� t d t | | � t | � � � n | j | � | Vq[ Wd S( Ns Circular dependency detected.(
R t defaultdictt sett addt
OrderedSett
isdisjointR R t
_gen_edgest difference_update(
t tuplest allitemst deterministic_ordert edgest parentt childt Sett todot outputt node( ( sN /opt/alt/python27/lib64/python2.7/site-packages/sqlalchemy/util/topological.pyR s"
c c s7 x0 t | | | � D] } x | D] } | Vq Wq Wd S( s� sort the given list of items by dependency.
'tuples' is a list of tuples representing a partial ordering.
'deterministic_order' keeps items within a dependency tier in list order.
N( R ( R R
R t set_t s( ( sN /opt/alt/python27/lib64/python2.7/site-packages/sqlalchemy/util/topological.pyR , s
c C s t j t � } x% | D] \ } } | | j | � q Wt | � } t � } x� | D]� } | g } | j | � } x� | r| d }
x� | |
D]l } | | k r� | | j | � } | j | � | j | � n | | k r� | j | � | j | � Pq� q� W| j
� } qt WqS W| S( Ni����( R R R R t
differencet indexR t updatet appendt removet pop( R R
R R R t
nodes_to_testR R t stackR t topt cyc( ( sN /opt/alt/python27/lib64/python2.7/site-packages/sqlalchemy/util/topological.pyR 8 s*
c C s4 t g | D]# } | | D] } | | f ^ q q
� S( N( R ( R t leftt right( ( sN /opt/alt/python27/lib64/python2.7/site-packages/sqlalchemy/util/topological.pyR
` s N( t __doc__t R t excR t __all__t FalseR R R R
( ( ( sN /opt/alt/python27/lib64/python2.7/site-packages/sqlalchemy/util/topological.pyt <module> s (