File: //usr/lib/python3/dist-packages/sphinx/__pycache__/versioning.cpython-310.pyc
o
�$�a@ � @ s> d Z ddlZddlmZmZ ddlmZ ddlmZ ddl m
Z
m Z m Z m
Z
ddlmZ ddlmZ dd lmZ e
r@dd
lmZ zddlZd ZW n eyS d ZY nw d
Zdede de
e fdd�Zdedede de
e fdd�Zde de de fdd�Z de de de fdd �Z G d d � d e�Z!d d de e e f fd!d"�Z"dS )#z�
sphinx.versioning
~~~~~~~~~~~~~~~~~
Implements the low-level algorithms Sphinx uses for the versioning of
doctrees.
:copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
:license: BSD, see LICENSE for details.
� N)�product� zip_longest)�
itemgetter)�path)�
TYPE_CHECKING�Any�Dict�Iterator)�uuid4)�Node)�SphinxTransform)�SphinxTF�A �doctree� condition�returnc c s& � | � |�D ]
}t� j|_|V qdS )a Add a unique id to every node in the `doctree` which matches the
condition and yield the nodes.
:param doctree:
A :class:`docutils.nodes.document` instance.
:param condition:
A callable which returns either ``True`` or ``False`` for a given node.
N)�traverser
�hex�uid)r r �node� r �3/usr/lib/python3/dist-packages/sphinx/versioning.py�add_uids# s
�
�r �old�newc c s� � | � |�}|� |�}g }g }i }t� }t||�D ]H\} }
| du r'|�|
� qt| dd�s2t� j| _|
du r<|�| � qt| j |
j �} | dkrQ| j|
_|�
|
� q| || |
f< |�| � |�|
� qt ||�D ]*\} }
|
|v su| |
f|v rvqgt| j |
j �} | dkr�| j|
_|�
|
� qg| || |
f< qgt |�
� td�d�}|D ]!\\} }
} |
|v r�q�|�
|
� | tk r�| j|
_q�t� j|
_|
V q�t|�| D ]
}
t� j|
_|
V q�dS )a1 Merge the `old` doctree with the `new` one while looking at nodes
matching the `condition`.
Each node which replaces another one or has been added to the `new` doctree
will be yielded.
:param condition:
A callable which returns either ``True`` or ``False`` for a given node.
Nr r � )�key)r �setr �append�getattrr
r r � get_ratio� rawsource�addr �sorted�itemsr �VERSIONING_RATIO) r r r �old_iter�new_iter� old_nodes� new_nodes�ratios�seen�old_node�new_node�ratior r r �merge_doctrees2 sX �
�r/ c C sB t | |g�stS trt�| |�t| �d S t| |�t| �d S )z�Return a "similarity ratio" (in percent) representing the similarity
between the two strings where 0 is equal and anything above less than equal.
g Y@)�allr% �
IS_SPEEDUP� Levenshtein�distance�len�levenshtein_distance)r r r r r r u s
r �a�bc C s� | |krdS t | �t |�k r|| } }| st |�S ttt |�d ��}t| �D ]3\}}|d g}t|�D ]#\}}||d d }|| d } || ||k }
|�t|| |
�� q4|}q'|d S )zEReturn the Levenshtein edit distance between two strings *a* and *b*.r r ���)r4 �list�range� enumerater �min) r6 r7 � previous_row�i�column1� current_row�j�column2�
insertions� deletions�
substitutionsr r r r5 � s
r5 c @ s& e Zd ZdZdZdeddfdd�ZdS )� UIDTransformz#Add UIDs to doctree for versioning.ip �kwargsr Nc K s� | j }d }|js
d S |jr=z&t�|j|jd �}t|d��
}t� |�}W d � n1 s-w Y W n t
y< Y nw |jrD|d u rOt t | j
|j�� d S t t|| j
|j�� d S )Nz.doctree�rb)�env�versioning_condition�versioning_comparer �join�
doctreedir�docname�open�pickle�load�OSErrorr9 r �documentr/ )�selfrG rI � old_doctree�filename�fr r r �apply� s" �� �zUIDTransform.apply)�__name__�
__module__� __qualname__�__doc__�default_priorityr rX r r r r rF � s rF �appr
c C s | � t� dddd�S )N�builtinT)�version�parallel_read_safe�parallel_write_safe)�
add_transformrF )r^ r r r �setup� s
�rd )#r\ rP � itertoolsr r �operatorr �osr �typingr r r r �uuidr
�docutils.nodesr �sphinx.transformsr �sphinx.applicationr
r2 r1 � ImportErrorr% r r/ �str�floatr �intr5 rF rd r r r r �<module> s0
� C