| Server IP : 217.160.0.244 / Your IP : 216.73.217.138 Web Server : Apache System : Linux infong-eu155 4.4.400-icpu-108 #2 SMP Wed Feb 11 11:51:01 UTC 2026 x86_64 User : u100174116 ( 6746176) PHP Version : 8.5.10 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /lib/python3/dist-packages/breezy/__pycache__/ |
Upload File : |
�
p��g�| � �l � S r SSKJr SSKJr SSKJr / SQrS r " S S5 r S
S
jr
" S S 5 r g )z Topological sorting routines.� )�errors)�graph)�revision)� MergeSorter�
TopoSorter�
merge_sort� topo_sortc �` � [ R " [ U 5 5 nUR 5 $ )a^ Topological sort a graph.
graph -- sequence of pairs of node->parents_list.
The result is a list of node names, such that all parents come before their
children.
node identifiers can be any hashable object, and are typically strings.
This function has the same purpose as the TopoSorter class, but uses a
different algorithm to sort the graph. That means that while both return a
list with parents before their child nodes, the exact ordering can be
different.
topo_sort is faster when the whole list is needed, while when iterating
over a part of the list, TopoSorter.iter_topo_order should be used.
)�
_mod_graph�
KnownGraph�dictr )r �kgs �./usr/lib/python3/dist-packages/breezy/tsort.pyr r s$ � �$
� � �t�E�{� +�B�
�<�<�>�� c �& � \ rS rSrS rS rS rSrg)r �0 c �$ � [ U5 U l g)a� Topological sorting of a graph.
:param graph: sequence of pairs of node_name->parent_names_list.
i.e. [('C', ['B']), ('B', ['A']), ('A', [])]
For this input the output from the sort or
iter_topo_order routines will be:
'A', 'B', 'C'
node identifiers can be any hashable object, and are typically strings.
If you have a graph like [('a', ['b']), ('a', ['c'])] this will only use
one of the two values for 'a'.
The graph is sorted lazily: until you iterate or sort the input is
not processed other than to create an internal representation.
iteration or sorting may raise GraphCycleError if a cycle is present
in the graph.
N)r
�_graph)�selfr s r �__init__�TopoSorter.__init__1 s � �* �5�k�� r c �4 � [ U R 5 5 $ �zlSort the graph and return as a list.
After calling this the sorter is empty and you must create a new one.
��list�iter_topo_order�r s r �sorted�TopoSorter.sortedH � � �
�D�(�(�*�+�+r c # � # � U R n[ U5 n/ n/ n[ 5 nU( a� UR 5 u pgUR U5 UR [ U5 5 U( a� US nU( d6 UR 5 n UR 5 UR
U 5 U v � O[UR 5 n
X�; a M` X�; a Mg UR U
5 nUR U
5 UR [ U5 5 U( a M� U( a M� gg! [ a [ R " U5 ef = f7f)��Yield the nodes of the graph in a topological order.
After finishing iteration the sorter is empty and you cannot continue
iteration.
���N)
r �set�popitem�appendr �pop�add�KeyErrorr �GraphCycleError) r r � visitable�pending_node_stack�pending_parents_stack�completed_node_names� node_name�parents�parents_to_visit� popped_node�next_node_names r r �TopoSorter.iter_topo_orderY s8 � � � � � ����J� � �� !#� �
#�u� �� "'� � � � �I� � %� %�i� 0� !� (� (��g� � 7� %�#8��#<� �'� #5�"8�"8�":�K�)�-�-�/�(�,�,�[�9�%�%� &6�%9�%9�%;�N�%�=� �%�6� �I�"'�)�)�N�";�� '�-�-�n�=�)�0�0��g� �?�E %�$� �e��D $� I� %� 4� 4�5G� H�H�
I�s* �CE�D$ �%2E�E�"E�$!E�E)r N)�__name__�
__module__� __qualname__�__firstlineno__r r r �__static_attributes__� r r r r 0 s � �"�.,�"?@r r Nc �6 � [ XX#5 R 5 $ )a_ Topological sort a graph which groups merges.
:param graph: sequence of pairs of node->parents_list.
:param branch_tip: the tip of the branch to graph. Revisions not
reachable from branch_tip are not included in the
output.
:param mainline_revisions: If not None this forces a mainline to be
used rather than synthesised from the graph.
This must be a valid path through some part
of the graph. If the mainline does not cover all
the revisions, output stops at the start of the
old revision listed in the mainline revisions
list.
The order for this parameter is oldest-first.
:param generate_revno: Optional parameter controlling the generation of
revision number sequences in the output. See the output description of
the MergeSorter docstring for details.
:result: See the MergeSorter docstring for details.
Node identifiers can be any hashable object, and are typically strings.
)r r )r �
branch_tip�mainline_revisions�generate_revnos r r r � s � �, �u�*<� M� T� T� V�Vr c �@ � \ rS rSr/ SQr S S jrS rS rS rS r Sr
g)
r � )�_completed_node_names�_first_child_stack�_generate_revnor �_left_subtree_pushed_stack�_mainline_revisions�_node_merge_depth_stack�_node_name_stack�_original_graph�_pending_parents_stack�_revno_to_branch_count�_revnos�_scheduled_nodes�_stop_revisionNc � � X@l [ U5 U l Uc / U l SU l O$[ U5 U l U R S U l [
U R SS 5 Hy u pVU R U nUc M U R U nU( d M1 US U:X a M< U R U R U5 U R U R SU5 M{ U R R 5 U l
U R Vs0 s H ofSS/_M snU l 0 U l / U l
/ U l / U l / U l [# 5 U l / U l / U l UbZ U[* R, :w aE U[* R, 4:w a/ U R R/ U5 n U R1 USU 5 ggggs snf )a� Merge-aware topological sorting of a graph.
:param graph: sequence of pairs of node_name->parent_names_list.
i.e. [('C', ['B']), ('B', ['A']), ('A', [])]
For this input the output from the sort or
iter_topo_order routines will be:
'A', 'B', 'C'
:param branch_tip: the tip of the branch to graph. Revisions not
reachable from branch_tip are not included in the
output.
:param mainline_revisions: If not None this forces a mainline to be
used rather than synthesised from the graph.
This must be a valid path through some part
of the graph. If the mainline does not cover all
the revisions, output stops at the start of the
old revision listed in the mainline revisions
list.
The order for this parameter is oldest-first.
:param generate_revno: Optional parameter controlling the generation of
revision number sequences in the output. See the output description
for more details.
The result is a list sorted so that all parents come before
their children. Each element of the list is a tuple containing:
(sequence_number, node_name, merge_depth, end_of_merge)
* sequence_number: The sequence of this row in the output. Useful for
GUIs.
* node_name: The node name: opaque text to the merge routine.
* merge_depth: How many levels of merging deep this node has been
found.
* revno_sequence: When requested this field provides a sequence of
revision numbers for all revisions. The format is:
(REVNO, BRANCHNUM, BRANCHREVNO). BRANCHNUM is the number of the
branch that the revno is on. From left to right the REVNO numbers
are the sequence numbers within that branch of the revision.
For instance, the graph {A:[], B:['A'], C:['A', 'B']} will get
the following revno_sequences assigned: A:(1,), B:(1,1,1), C:(2,).
This should be read as 'A is the first commit in the trunk',
'B is the first commit on the first branch made from A', 'C is the
second commit in the trunk'.
* end_of_merge: When True the next node is part of a different merge.
node identifiers can be any hashable object, and are typically strings.
If you have a graph like [('a', ['b']), ('a', ['c'])] this will only use
one of the two values for 'a'.
The graph is sorted lazily: until you iterate or sort the input is
not processed other than to create an internal representation.
iteration or sorting may raise GraphCycleError if a cycle is present
in the graph.
Background information on the design:
-------------------------------------
definition: the end of any cluster or 'merge' occurs when:
1 - the next revision has a lower merge depth than we do.
i.e.
A 0
B 1
C 2
D 1
E 0
C, D are the ends of clusters, E might be but we need more data.
2 - or the next revision at our merge depth is not our left most
ancestor.
This is required to handle multiple-merges in one commit.
i.e.
A 0 [F, B, E]
B 1 [D, C]
C 2 [D]
D 1 [F]
E 1 [F]
F 0
C is the end of a cluster due to rule 1.
D is not the end of a cluster from rule 1, but is from rule 2: E
is not its left most ancestor
E is the end of a cluster due to rule 1
F might be but we need more data.
we show connecting lines to a parent when:
- The parent is the start of a merge within this cluster.
That is, the merge was not done to the mainline before this cluster
was merged to the mainline.
This can be detected thus:
* The parent has a higher merge depth and is the next revision in
the list.
The next revision in the list constraint is needed for this case:
A 0 [D, B]
B 1 [C, F] # we do not want to show a line to F which is depth 2
but not a merge
C 1 [H] # note that this is a long line to show back to the
ancestor - see the end of merge rules.
D 0 [G, E]
E 1 [G, F]
F 2 [G]
G 1 [H]
H 0
- Part of this merges 'branch':
The parent has the same merge depth and is our left most parent and we
are not the end of the cluster.
A 0 [C, B] lines: [B, C]
B 1 [E, C] lines: [C]
C 0 [D] lines: [D]
D 0 [F, E] lines: [E, F]
E 1 [F] lines: [F]
F 0
- The end of this merge/cluster:
we can ONLY have multiple parents at the end of a cluster if this
branch was previously merged into the 'mainline'.
- if we have one and only one parent, show it
Note that this may be to a greater merge depth - for instance if
this branch continued from a deeply nested branch to add something
to it.
- if we have more than one parent - show the second oldest (older ==
further down the list) parent with
an equal or lower merge depth
XXXX revisit when awake. ddaa asks about the relevance of each one
- maybe more than one parent is relevant
N� r T)rC r
r rE rM r � enumerate�remove�insert�copyrH rK rJ rG rF rI rB r$ rA rL rD �
_mod_revision�
NULL_REVISIONr' �
_push_node)
r r r< r= r> �indexr �parent�graph_parent_idsr0 s
r r �MergeSorter.__init__� s� � �z .� ��5�k�� � � %�')�D� $�"&�D� �'+�,>�'?�D� $�"&�":�":�1�"=�D� � )��)A�)A�!�"�)E� F�O�E� �-�-�e�4�F��~�� #�{�{�8� 4� �#� � ��"�f�,�� �K�K�� !� (� (�� 0� �K�K�� !� (� (��F� 3�% G�, $�{�{� /� /� 1�� � @D�{�{�K�{�8�4��,�.�{�K�� �&(��#� !#�� �')��$� ')��#� #%�� � &)�U��"� !#�� �
+-��'�
� "��m� 9� 9�9��}� :� :� <�<��k�k�o�o�j�1�G� �O�O�J��7� 3� =� :�
#��O Ls �Gc �4 � [ U R 5 5 $ r r r s r r �MergeSorter.sorted� r r c
# �| # � U R nU R nU R nU R nU R nU R
nU R R nUR UR UR UR U R R U R 4S jnUR UR U R R UR UR U R U R U R R UR U R 4
S jn U( a� US n
U
( d U " 5 OuUS ( ak US ( d US R S5 n Sn SUS' OUS R 5 n Sn X�; a ML U" U 5 n
SnU ( a SnOSnUS U- nU" X�U
5 U( a M� SnU R" nU R$ nU R nU( a� UR 5 u nnnUU:X a g[' U5 ( d SnO/US S U: a SnO US S U:X a US S UU ; a SnOSnU( a
UUUUU4v � OUUUU4v � US-
nU( a M� gg! [ a* X�R ; a [ R " U5 e GMd f = f7f) r" c �� � U" U 5 U" U5 U" S5 U" [ U5 5 Sn U( a X�S n U b U S n
SU S' OSn
U" U
5 g! [ a N%f = f)z�Add node_name to the pending node stack.
Names in this stack will get emitted into the output as they are popped
off the stack.
This inlines a lot of self._variable.append functions as local
variables.
FNrO r )r r) ) r/ � merge_depthr0 �node_name_stack_append� node_merge_depth_stack_append� left_subtree_pushed_stack_append� pending_parents_stack_append�first_child_stack_append�revnos� parent_info� first_childs r � push_node�.MergeSorter.iter_topo_order.<locals>.push_node� s~ � �&
#�9� -� )�+� 6� ,�U� 3� (��g� � 7� �K���"(���"4�K� �&� )�!�n� �!&� �A�� #� � $�[� 1�� � ���s �A �
A!� A!c
� � U " 5 n
U" 5 n U" 5 n U" 5 U" 5 XZ n
SnU
( a XmS S nUb@ U ( d) US nU R US5 nUS-
nUX�' US US4nO;USS US S- 4- nO+U R SS5 nUS-
nU( a SUS4nOSnUU S' UXj S' U" U
5 U" X�U45 U
$ ! [ a N�f = f�zLPop the top node off the stack.
The node is appended to the sorted output.
NrO r r# )r )r) �get)�node_name_stack_pop�node_merge_depth_stack_pop�first_child_stack_pop� left_subtree_pushed_stack_pop�pending_parents_stack_pop�original_graphre �completed_node_names_add�scheduled_nodes_append�revno_to_branch_countr/ r_ rg r0 � parent_revno�
base_revno� branch_count�revno�
root_counts r �pop_node�-MergeSorter.iter_topo_order.<locals>.pop_node� s1 � �$ ,�-�I�4�6�K�/�1�K� )� +� %� '�$�/�G� �L���#)�!�*�#5�a�#8�L� �'�"�!-�a� �J�#8�#<�#<�Z��#K�L� �A�%�L�8D�)�5� )�!�_�l�A� >�E�
)��"� -� �b�1A�A�1E�0G� G�E� 3� 6� 6�q�"� =�
��a��
� � �
�A� .�E� �E�+5�%�a�(� $)�F� �a� � $�Y� /� "�I�E�#B� C� � ��= � ���s �
C �
C�Cr# rO TFr N)rG rF rI rD rA rL r r' r& rB rK rH r( rJ r) r r* rM rC �len)r �node_name_stack�node_merge_depth_stackr- �left_subtree_pushed_stackr. �scheduled_nodes� graph_poprh r{ r1 r3 �is_left_subtreer0 �next_merge_depth�sequence_number�
stop_revisionr> rr r/ r_ ry � end_of_merges r r �MergeSorter.iter_topo_order� s� � � � �/�/��!%�!=�!=� � $� ;� ;� �$(�$C�$C�!� #� 9� 9� � �/�/���K�K�O�O� � $3�#9�#9�*@�*G�*G�-F�-M�-M�)>�)E�)E�%)�%<�%<�%C�%C��<�<�' 2�T !0� 3� 3�'=�'A�'A�"&�"9�"9�"=�"=�*C�*G�*G�&;�&?�&?� �/�/��<�<�%)�%?�%?�%C�%C�#2�#9�#9�"&�"=�"=�= �~ � 4�R� 8� �#� �
�+�B�/�4�R�8�)>�r�)B�)F�)F�q�)I��*.��8<�1�"�5� *?�r�)B�)F�)F�)H��*/��%�=� !� %�"+�N�";�� ()�$�&�+,�(�+,�(�'=�b�'A�DT�'T�$� �n��H� �o �o�t �� �+�+�
� �-�-�� �-�-�� �,;�,?�,?�,A� )�I�{�E��M�)����'�'� #� � ��$�Q�'�+�5� #� � ��$�Q�'�;�6� ��#�A�&�n�Y�.G�G� $� � $� � �&� �;��|�T�T�&� �;� �M�M� �q� �O�+ �o��; $�
%� *�-A�-A�A�"(�"8�"8� �"I� I� %�
%�s7 �F J<�!J �)'J<�B/J<�J<�/J9�4J<�8J9�9J<c � � U R R U5 U R R U5 U R R S5 U R R [ U5 5 SnU( a U R US nUb US nSUS' OSnU R R U5 g! [ a N8f = f)z�Add node_name to the pending node stack.
Names in this stack will get emitted into the output as they are popped
off the stack.
FNrO r ) rG r& rF rD rI r rK r) rB )r r/ r_ r0 rf rg s r rV �MergeSorter._push_nodes s� � �
� � �$�$�Y�/� �$�$�+�+�K�8� �'�'�.�.�u�5� �#�#�*�*�4��=�9�� � �
� "�l�l�7�1�:� 6� � � "�%�a�.�K� "�K��N� �K� � � �&�&�{�3�� �
��
�s � B> �>
C �
C c � � U R R 5 nU R R 5 nU R R 5 nU R R 5 U R
R 5 U R U nSnU( a U R US S nUbT U( d= US nU R R US5 nUS-
nXpR U' US US4nOjUSS US S- 4- nOZU R R SS5 n U R R SS5 n U S-
n U ( a SU S4nOSnX�R S' X�R U S' U R R U5 U R R XU R U S 45 U$ ! [ a GNf = frk )rG r' rF rB rD rI rH rK r) rJ rl rA r( rL r& )
r r/ r_ rg r0 rv rw rx ry rz s
r � _pop_node�MergeSorter._pop_node� s� � � �)�)�-�-�/� ��2�2�6�6�8� ��-�-�1�1�3� � �'�'�+�+�-� �#�#�'�'�)��&�&�y�1��� � �
� #�|�|�G�A�J� 7�� :� � � #� � )�!�_�
� #� :� :� >� >�z�1� M� � ��!� �:F�+�+�J�7�%�a� �,��:��
%�S�b�)�\�"�-=��-A�,C�C�� �4�4�8�8��A�>�J� �4�4�8�8��B�?�J� �!�O�J���J��*�� ��-7� '� '�� *� &+� � �Y� ��"� �"�"�&�&�y�1� � � �$�$�
�T�\�\�)�%<�Q�%?� @�
� ���C �
��
�s � F= �=
G �
G �NF) r5 r6 r7 r8 � __slots__r r r rV r� r9 r: r r r r � s- � ��I�$ JO�U4�n,�M!�^4�85r r r� ) �__doc__� r r r r rT �__all__r r r r r: r r �<module>r� s> ��" $� � !� '�
B���,h@� h@�VW�2P� Pr