-=[ Mr. Bumblebee ]=-
_Indonesia_
σ
ξ:οNc @@ s d Z d d l m Z d d l m Z d d l m Z m Z d e f d YZ d e f d YZ
d e f d
YZ d S( sK Implementation of Graph algorithms when we have already loaded everything.
i ( t absolute_import( t deque( t errorst revisiont _KnownGraphNodec B@ s& e Z d Z d Z d Z d Z RS( s. Represents a single object in the known graph.t keyt parent_keyst
child_keyst gdfoc C@ s( | | _ | | _ g | _ d | _ d S( N( R R R t NoneR ( t selfR R ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt __init__" s c C@ s) d | j j | j | j | j | j f S( Ns %s(%s gdfo:%s par:%s child:%s)( t __class__t __name__R R R R ( R
( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt __repr__) s ( s keys parent_keyss
child_keyss gdfo( R
t
__module__t __doc__t __slots__R R ( ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyR s t _MergeSortNodec B@ s e Z d Z d Z d Z RS( s5 Information about a specific node in the merge graph.R t merge_deptht revnot end_of_mergec C@ s( | | _ | | _ | | _ | | _ d S( N( R R R R ( R
R R R R ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyR 4 s ( s keys merge_depths revnos end_of_merge( R
R R R R ( ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyR / s t
KnownGraphc B@ s} e Z d Z e d 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= This is a class which assumes we already know the full graph.c C@ s6 i | _ i | _ | | _ | j | | j d S( sn Create a new KnownGraph instance.
:param parent_map: A dictionary mapping key => parent_keys
N( t _nodest _known_headst do_cachet _initialize_nodest
_find_gdfo( R
t
parent_mapR ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyR > s
c C@ sΑ | j } x± | j D]£ \ } } | | k rD | | } | | _ n t | | } | | | <xY | D]Q } y | | } Wn* t k
r€ t | d } | | | <n X| j j | qd Wq Wd S( s Populate self._nodes.
After this has finished:
- self._nodes will have an entry for every entry in parent_map.
- ghosts will have a parent_keys = None,
- all nodes found will also have .child_keys populated with all known
child_keys,
N( R t iteritemsR R t KeyErrorR R t append( R
R t nodesR R t nodet
parent_keyt parent_node( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyR J s
c C@ s) g | j j D] } | j s | ^ q S( N( R t
itervaluesR ( R
R! ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt _find_tailsc s c C@ s) g | j j D] } | j s | ^ q S( N( R R$ R ( R
R! ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt
_find_tipsg s c C@ s# | j } i } g } x* | j D] } d | _ | j | q" WxΪ | r | j } xΑ | j D]Ά } | | } | | k r | | d } t } n d } t } | j d k sΕ | j d | j k rΨ | j d | _ n | t | j
k r
| j | | r| | =qqa | | | <qa WqE Wd S( Ni ( R R% R R t popR t Truet FalseR t lenR ( R
R t known_parent_gdfost pendingR! t child_keyt childt
known_gdfot present( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyR k s,
%
c
C@ sΉ | j } | | k r | | } | j d k rG | | _ | j j q§ t | } t | j } | | k rr d St d | | | f n t | | } | | | <d } x} | D]u } y | | } Wn3 t k
rύ t | d } d | _ | | | <n X| | j k r| j } n | j
j | q΄ W| d | _ t | g } xi | r΄| j
} | j d }
xC | j
D]8 } | | } | j |
k ru|
| _ | j | ququWqLWd S( sr Add a new node to the graph.
If this fills in a ghost, then the gdfos of all children will be
updated accordingly.
:param key: The node being added. If this is a duplicate, this is a
no-op.
:param parent_keys: The parents of the given node.
:return: None (should we return if this was a ghost, etc?)
Ns> Parent key mismatch, existing node %s has parents of %s not %si i ( R R R R t cleart listt
ValueErrorR R R R R R t popleft(
R
R R R R! t existing_parent_keyst parent_gdfoR" R# R, t next_gdfoR- R. ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt add_node sF
c @ sΌ t f d | D } t j | k rT | j t j | sT t t j g Sn t | d k rp t | St | } y j | } | SWn t k
r€ n Xt } g } d } xW | j
D]I } | j rι | j | j n | d k s| j
| k rΗ | j
} qΗ qΗ W j } xp | r| j }
|
| k rDq n | j |
| |
} | j
| k rpq n | j r | j | j q q W| j | } j rΈ| j | <n | S( s+ Return the heads from amongst keys.
This is done by searching the ancestries of each key. Any key that is
reachable from another key is not returned; all the others are.
This operation scales with the relative depth between any two keys. It
uses gdfo to avoid walking all ancestry.
:param keys: An iterable of keys.
:return: A set of the heads. Note that as a set there is no ordering
information. Callers will need to filter their input to create
order if they need it.
c 3@ s" | ] } | j | f Vq d S( N( R ( t .0R ( R
( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pys <genexpr>Ω s i N( t dictR t
NULL_REVISIONR' t frozensetR* R R t setR t valuesR t extendR R t addt
differenceR ( R
t keyst candidate_nodest heads_keyt headst seenR, t min_gdfoR! R t node_key( ( R
s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyRE Λ sH
c C@ s x; | j j D]* } | j d k r t j | j q q W| j } | j } | j } g } | j } t j
| j d } x | r| } | j d k r± | | j n x_ | j
D]T } | j | } | | d }
|
t | j k r| | | | =q» |
| | <q» Wq W| S( sd Return the nodes in topological order.
All parents must occur before all children.
i i N( R R$ R R R t GraphCycleErrorR% R' R R: t fromkeysR R R R* ( R
R! R, t pending_popt pending_appendt
topo_ordert topo_order_appendt num_seen_parentsR- t
child_nodet seen_parents( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt topo_sort s*
c C@ s} | j } i } xd | D]\ } | j j t k sF t | j d k rO d } n
| j d } | j | g j | q Wt j | j d } g } xβ t
| D]Τ } t
| | d d d t } x¬ | rt| j } | j
d k rπ qΙ n | j | j xn t
| j
d t D]W } | j | } | | d }
|
t | j k rc| j | | | =q|
| | <qWqΙ Wq‘ W| S( sΨ Return a reverse topological ordering which is 'stable'.
There are a few constraints:
1) Reverse topological (all children before all parents)
2) Grouped by prefix
3) 'stable' sorting, so that we get the same result, independent of
machine, or extra data.
To do this, we use the same basic algorithm as topo_sort, but when we
aren't sure what node to access next, we sort them lexicographically.
i t i R c S@ s | j S( N( R ( t n( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt <lambda>> s t reverseN( R& R R t strR* t
setdefaultR R: RJ R t sortedR( R' R R R ( R
t tipst prefix_tipsR! t prefixt num_seen_childrent resultR, R" R# t
seen_children( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt gc_sort% s2
'
c C@ s| d d l m } t d | j j D } g | j | | d d d t D]* \ } } } } } t | | | | ^ qN S( s& Compute the merge sorted graph output.i ( t tsortc s@ s0 | ]& } | j d k r | j | j f Vq d S( N( R R R ( R9 R! ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pys <genexpr>U s t mainline_revisionst generate_revnoN( t bzrlibRa R: R R$ t
merge_sortR R( R ( R
t tip_keyRa t
as_parent_mapt _R R R R ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyRe R s c C@ s | j | j S( s/ Get the parents for a key
Returns a list containg the parents keys. If the key is a ghost,
None is returned. A KeyError will be raised if the key is not in
the graph.
:param keys: Key to check (eg revision_id)
:return: A list of parents
( R R ( R
R ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt get_parent_keysa s
c C@ s | j | j S( s Get the children for a key
Returns a list containg the children keys. A KeyError will be raised
if the key is not in the graph.
:param keys: Key to check (eg revision_id)
:return: A list of children
( R R ( R
R ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt get_child_keysm s ( R
R R R( R R R% R& R R8 RE RR R` Re Ri Rj ( ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyR ; s A 8 " - N( R t
__future__R t collectionsR Rd R R t objectR R R ( ( ( s: /usr/lib/python2.7/dist-packages/bzrlib/_known_graph_py.pyt <module> s
Copyright © 2017 || Recoded By Mr.Bumblebee