관리-도구
편집 파일: revision.cpython-38.pyc
U 0?�fb� � @ s� d dl mZ d dlZd dlZd dlmZ d dlmZ d dlmZ d dlmZ d dlm Z d dlm Z d d lm Z d d lm Z d d lm Z d d lmZ d d lmZ d dlmZ d dlmZ d dlmZ d dlmZ d dlmZ d dlmZ d dlmZ d dlmZ d dlmZ ddlmZ ddlm Z e�r6d dlm Z ee ee ee df f Z ee e ee e e f Z ee ee df df Z!ede f Z"ed Z#e e df Z$e ede ed f ed f Z%ed �Z&ed ee" d �Z'e�(d!�Z)d"d#d$gZ*G d%d&� d&e�Z+G d'd(� d(e,�Z-G d)d*� d*e-�Z.G d+d,� d,e-�Z/G d-d.� d.e-�Z0G d/d0� d0e-�Z1G d1d2� d2e1�Z2G d3d4� d4e1�Z3G d5d6� d6e2e3�Z4G d7d8� d8�Z5G d9d� d�Z6ed:d:d;�d<d=��Z7ed>d?d;�d@d=��Z7dAdBd;�dCd=�Z7dDdd;�dEdF�Z8dS )G� )� annotationsN)�Any)�Callable)�cast)� Collection)�Deque)�Dict)� FrozenSet)�Iterable)�Iterator)�List)�Optional)�overload)�Protocol)�Sequence)�Set)�Tuple)� TYPE_CHECKING)�TypeVar)�Union)�util� )�not_none)�Literal.�Revision)r zLiteral['base']� �_T�_TR)�boundz (?:(.+?)@)?(\w+)?((?:\+|-)\d+)�@�-�+c @ s$ e Zd Zddddddd�dd�ZdS )�_CollectRevisionsProtocol�_RevisionIdentifierType�bool�;Tuple[Set[Revision], Tuple[Optional[_RevisionOrBase], ...]]��upper�lower� inclusive� implicit_base�assert_relative_length�returnc C s d S �Nr )�selfr' r( r) r* r+ r r �E/opt/hc_python/lib/python3.8/site-packages/alembic/script/revision.py�__call__4 s z"_CollectRevisionsProtocol.__call__N)�__name__� __module__� __qualname__r0 r r r r/ r" 3 s r" c @ s e Zd ZdS )� RevisionErrorN)r1 r2 r3 r r r r/ r4 > s r4 c s& e Zd Zdddd�� fdd� Z� ZS )�RangeNotAncestorErrorr# �None)r( r' r, c s, || _ || _t� �d|pd|p df � d S )Nz-Revision %s is not an ancestor of revision %s�base)r( r' �super�__init__)r. r( r' �� __class__r r/ r9 C s ��z RangeNotAncestorError.__init__�r1 r2 r3 r9 � __classcell__r r r: r/ r5 B s r5 c s& e Zd Zdddd�� fdd� Z� ZS )� MultipleHeads� Sequence[str]� Optional[str]r6 )�heads�argumentr, c s* || _ || _t� �d|d�|�f � d S )Nz6Multiple heads are present for given argument '%s'; %s�, )rA rB r8 r9 �join)r. rA rB r: r r/ r9 O s ��zMultipleHeads.__init__r< r r r: r/ r> N s r> c s& e Zd Zdddd�� fdd� Z� ZS )�ResolutionError�strr6 )�messagerB r, c s t � �|� || _d S r- )r8 r9 rB )r. rG rB r: r r/ r9 Y s zResolutionError.__init__r< r r r: r/ rE X s rE c s( e Zd ZdZddd�� fdd� Z� ZS )� CycleDetectedZCycler? r6 �� revisionsr, c s& || _ t� �d| jd�|�f � d S )Nz %s is detected in revisions (%s)rC )rJ r8 r9 �kindrD �r. rJ r: r r/ r9 a s ��zCycleDetected.__init__�r1 r2 r3 rK r9 r= r r r: r/ rH ^ s rH c s( e Zd ZdZddd�� fdd� Z� ZS )�DependencyCycleDetectedzDependency cycler? r6 rI c s t � �|� d S r- �r8 r9 rL r: r r/ r9 l s z DependencyCycleDetected.__init__rM r r r: r/ rN i s rN c s( e Zd ZdZddd�� fdd� Z� ZS )� LoopDetectedz Self-looprF r6 ��revisionr, c s t � �|g� d S r- rO �r. rR r: r r/ r9 s s zLoopDetected.__init__rM r r r: r/ rP p s rP c s( e Zd ZdZddd�� fdd� Z� ZS )�DependencyLoopDetectedzDependency self-loopr? r6 rQ c s t � �|� d S r- rO rS r: r r/ r9 z s z DependencyLoopDetected.__init__rM r r r: r/ rT w s rT c @ s� e Zd ZdZddd�dd�Zejdd�d d ��Zejdd�d d ��Zejdd�d d��Z ejdd�dd��Z ejdd�dd��Z ddddddd�dd�Z dddd�d d �Z dddd�d d �Zdddd�d d!�Zdddd�d"d#�Zd�d%d&dd'�d(d)�Zd�d+d+d,�d-d.�Zd/dd0�d1d2�Zd3d4d5�d6d7�Zd+d8d5�d9d:�Zd/d8d,�d;d<�Zd�d=d+d8d>�d?d@�ZdAdBdC�dDdE�Zd�dFd+d&dGdH�dIdJ�Zd�dKdLd&d&dM�dNdO�Zd3dPd5�dQdR�Zd�dTdTd&d&d&d&dUdV�dWdX�Z d�dYdZd&d&d&d[d\�d]d^�Z d�dYdZd&d&dUd_�d`da�Z d�dbdYdZd&dUdc�ddde�Z ddfdgdh�didj�Z d�dkdld+d&dmdn�dodp�Z!dTdTd&dqdr�dsdt�Z"dTdTd&d4dr�dudv�Z#dTdTd&d&d&dwdx�dydz�Z$dTdTd&d&d&d{dx�d|d}�Z%ddBd5�d~d�Z&d*S )�� RevisionMapz�Maintains a map of :class:`.Revision` objects. :class:`.RevisionMap` is used by :class:`.ScriptDirectory` to maintain and traverse the collection of :class:`.Script` objects, which are themselves instances of :class:`.Revision`. z Callable[[], Iterable[Revision]]r6 )� generatorr, c C s || _ dS )a Construct a new :class:`.RevisionMap`. :param generator: a zero-arg callable that will generate an iterable of :class:`.Revision` instances to be used. These are typically :class:`.Script` subclasses within regular Alembic use. N)� _generator)r. rV r r r/ r9 � s zRevisionMap.__init__�Tuple[str, ...]�r, c C s | j | jS )z�All "head" revisions as strings. This is normally a tuple of length one, unless unmerged branches are present. :return: a tuple of string revision numbers. )� _revision_maprA �r. r r r/ rA � s zRevisionMap.headsc C s | j | jS )z�All "base" revisions as strings. These are revisions that have a ``down_revision`` of None, or empty tuple. :return: a tuple of string revision numbers. )rZ �basesr[ r r r/ r\ � s zRevisionMap.basesc C s | j | jS )zeAll "real" head revisions as strings. :return: a tuple of string revision numbers. )rZ � _real_headsr[ r r r/ r] � s zRevisionMap._real_headsc C s | j | jS )zeAll "real" base revisions as strings. :return: a tuple of string revision numbers. )rZ � _real_basesr[ r r r/ r^ � s zRevisionMap._real_bases�_RevisionMapTypec C s� t �� }t �� }t �� }d}d}t� }t� }| �� D ]v}|�|� |j|kr\t�d|j � |||j< |j rv|�|� |�|� |�|� |j r�||f7 }|j r4||f7 }q4|� � } | � |tt|�� | �|tt|�� |�� D ]^} | jD ]R} | |k�r t�d| | f � || } | �| � | | jk�r2|�| � |�| � q�q�| �|tt|�� | �| ||||� t|�� �} d | d< | d< tdd� |D ��| _tdd� |D ��| _ tdd� |D ��| _ td d� |D ��| _ | � || � | S ) z_memoized attribute, initializes the revision map from the initial collection. r �%Revision %s is present more than once�-Revision %s referenced from %s is not presentNc s s | ] }|j V qd S r- �rR ��.0�revr r r/ � <genexpr> s z,RevisionMap._revision_map.<locals>.<genexpr>c s s | ] }|j V qd S r- rb rc r r r/ rf s c s s | ] }|j V qd S r- rb rc r r r/ rf s c s s | ] }|j V qd S r- rb rc r r r/ rf s ) �sqlautil� OrderedDictZ OrderedSet�setrW �addrR r �warn� branch_labels�is_base� _is_real_base�copy�_map_branch_labelsr r_ �_add_depends_on�values�_all_down_revisions� add_nextrev�_versioned_down_revisions�discard�_normalize_depends_on�_detect_cycles�dict�items�tuplerA r] r\ r^ � _add_branches)r. �map_rA r] r\ r^ Zhas_branch_labelsZ all_revisionsrR �rev_mapre �downrev� down_revisionZ revision_mapr r r/ rZ � sf � � �� zRevisionMap._revision_map�_InterimRevisionMapTypez Set[Revision]zTuple[Revision, ...])r~ rA r\ r] r^ r, c C s |sd S |r|s t t|���dd� | jdd� |tt|�d�D ��dd� | jdd� |tt|�d�D ��}t|�� �| }|r�t t|���|r�|s�t t|���d d� | jd d� |tt|�d�D ��d d� | jd d� |tt|�d�D ��}t|�� �| }|�rt t|���d S ) Nc S s h | ] }|j �qS r rb rc r r r/ � <setcomp> s �z-RevisionMap._detect_cycles.<locals>.<setcomp>c S s | j S r- �ru ��rr r r/ �<lambda> � z,RevisionMap._detect_cycles.<locals>.<lambda>�r} c s s | ] }|j V qd S r- rb rc r r r/ rf s �z-RevisionMap._detect_cycles.<locals>.<genexpr>c S s | j S r- ��nextrevr� r r r/ r� ! r� c S s h | ] }|j �qS r rb rc r r r/ r� , s �c S s | j S r- )rs r� r r r/ r� / r� c s s | ] }|j V qd S r- rb rc r r r/ rf 3 s �c S s | j S r- �� _all_nextrevr� r r r/ r� 6 r� ) rH �list�_iterate_related_revisionsr r_ � intersectionri �keys�sortedrN )r. r~ rA r\ r] r^ Z total_spaceZ deleted_revsr r r/ rx sT ����� �����zRevisionMap._detect_cycleszCollection[Revision])rJ r} r, c C sh |D ]^}|j r|jd k s t�|jD ]>}||krX|| }|d k sBt�td||j|jf ��|||< q"qd S )Nz;Branch name '%s' in revision %s already used by revision %s)rl �_orig_branch_labels�AssertionErrorr4 rR )r. rJ r} rR � branch_labelZmap_revr r r/ rp ? s ��� z RevisionMap._map_branch_labelsc C s� |D ]v}|j r|j �|j � | j|g|dd�D ]}|j �|j � q.|}|r|js|js|j �|j � |jrz||j }qFqqFqd S �NF��include_dependencies)rl �update�_get_descendant_nodes�_is_real_branch_point�is_merge_pointr� )r. rJ r} rR �node�parentr r r/ r| T s( � ��� zRevisionMap._add_branchesc sJ |D ]@}|j r>� fdd�t�|j �D �}tdd� |D ��|_qd|_qdS )a Resolve the 'dependencies' for each revision in a collection in terms of actual revision ids, as opposed to branch labels or other symbolic names. The collection is then assigned to the _resolved_dependencies attribute on each revision object. c s g | ] }� | �qS r r )rd �depr� r r/ � <listcomp>y s z/RevisionMap._add_depends_on.<locals>.<listcomp>c S s g | ]}|d k r|j �qS r- rb �rd �dr r r/ r� } s r N)� dependenciesr �to_tupler{ �_resolved_dependencies)r. rJ r} rR �depsr r� r/ rq k s � �zRevisionMap._add_depends_onc C sf |D ]\}|j rZt|j �}| j|gd|d�D ]"}||kr:q*q*|j r*|�|j � q*t|�|_qd|_qdS )a� Create a collection of "dependencies" that omits dependencies that are already ancestor nodes for each revision in a given collection. This builds upon the _resolved_dependencies collection created in the _add_depends_on() method, looking in the fully populated revision map for ancestors, and omitting them as the _resolved_dependencies collection as it is copied to a new collection. The new collection is then assigned to the _normalized_resolved_dependencies attribute on each revision object. The collection is then used to determine the immediate "down revision" identifiers for this revision. F)r� r} r N)r� ri �_get_ancestor_nodes�difference_updater{ �!_normalized_resolved_dependencies)r. rJ r} rR Znormalized_resolvedre r r r/ rw � s$ � ��z!RevisionMap._normalize_depends_onFr r$ )rR �_replacer, c sB | j }|s&� j|kr&t�d� j � n |rB� j|krBtd� j ��� |� j< � g}| �||� | �||� | �||� � jr�| j � jf7 _ � j r�| j � jf7 _ � j D ]0}||kr�t�d|� f � t || ��� � q�| �||� � j�rt� fdd�| jD ��� jf | _� j�r>t� fdd�| jD ��� jf | _dS )z�add a single revision to an existing map. This method is for single-revision use cases, it's not appropriate for fully populating an entire revision map. r` zrevision %s not in mapra c 3 s* | ]"}|t � j��� jg�kr|V qd S r- )ri rs �unionrR �rd �headrb r r/ rf � s ���z+RevisionMap.add_revision.<locals>.<genexpr>c 3 s* | ]"}|t � j��� jg�kr|V qd S r- )ri ru r� rR r� rb r r/ rf � s ���N)rZ rR r rk � Exceptionr| rp rq rm r\ rn r^ rs r rt rw � _is_real_headr{ r] �is_headrA )r. rR r� r} rJ r r rb r/ � add_revision� sJ � �� �� ��zRevisionMap.add_revisionNr@ )r� r, c C sL | j }|r| �||�}t|�dkr8t||r2d| nd��|rD|d S dS dS )a� Return the current head revision. If the script directory has multiple heads due to branching, an error is raised; :meth:`.ScriptDirectory.get_heads` should be preferred. :param branch_label: optional branch name which will limit the heads considered to those which include that branch_label. :return: a string revision number. .. seealso:: :meth:`.ScriptDirectory.get_heads` � z%s@headr� r N)rA �filter_for_lineage�lenr> )r. r� � current_headsr r r/ �get_current_head� s � �z RevisionMap.get_current_headrF )� identifierr, c C s | � | j|�S r- )r� r\ )r. r� r r r/ �_get_base_revisions s z RevisionMap._get_base_revisionszOptional[_GetRevArg]z%Tuple[Optional[_RevisionOrBase], ...])�id_r, c s� t |ttttf�r*t�fdd�|D �d�S ��|�\}� t|�dkr�zZt|d ���dk r��� d�}� dk r�t� fdd �|D ��}t��fd d �|D ��W S W n t k r� Y nX t� �fd d �|D ��S dS ) a� Return the :class:`.Revision` instances with the given rev id or identifiers. May be given a single identifier, a sequence of identifiers, or the special symbols "head" or "base". The result is a tuple of one or more identifiers, or an empty tuple in the case of "base". In the cases where 'head', 'heads' is requested and the revision map is empty, returns an empty tuple. Supports partial identifiers, where the given identifier is matched against all identifiers that start with the given characters; if there is exactly one match, that determines the full revision. c s g | ]}� � |��qS r )� get_revisions)rd Zid_elemr[ r r/ r� s z-RevisionMap.get_revisions.<locals>.<listcomp>r r� r rA Nc 3 s | ]}� t |�jkr|V qd S r- )� is_revisionrl r� )r� r r/ rf ( s ��z,RevisionMap.get_revisions.<locals>.<genexpr>c 3 s | ]}�j |� d �V qdS ))�stepsN)�_walkr� )�rintr. r r/ rf . s �c 3 s | ]}�� |� �V qd S r- )�_revision_for_ident�rd �rev_id)r� r. r r/ rf 5 s �) � isinstancer� r{ ri � frozenset�sum�_resolve_revision_numberr� �intr� � ValueError)r. r� � resolved_idZ select_headsr )r� r� r. r/ r� s( ���zRevisionMap.get_revisionszOptional[Revision]c C s@ | � |�\}}t|�dkr$t||��|r0|d nd}| �||�S )a Return the :class:`.Revision` instance with the given rev id. If a symbolic name such as "head" or "base" is given, resolves the identifier into the current head or base revision. If the symbolic name refers to multiples, :class:`.MultipleHeads` is raised. Supports partial identifiers, where the given identifier is matched against all identifiers that start with the given characters; if there is exactly one match, that determines the full revision. r� r r )r� r� r> r� )r. r� r� r� �resolvedr r r/ � get_revision: s zRevisionMap.get_revisionc C sv z| j | }W n^ tk rl z| �|�}W n2 tk r^ } ztd| |�|�W 5 d }~X Y n X | Y S Y nX |S d S )NzNo such branch: '%s')rZ �KeyErrorr� rE )r. r� � branch_revZ nonbranch_rev�rer r r/ �_resolve_branchO s ��zRevisionMap._resolve_branchzUnion[str, Tuple[()], None])r� � check_branchr, c s. |r| � |�}nd }z| j� }W n tk r: d}Y nX |dkrވ sLt�� fdd�| jD �}|rp| �||�}|s�td� t� �dk r�dndf � ��nFt|�dkr�td � d �d d � |d d� D ��f � ��n| j|d }|�r*|d k �r*|d k s�t�� �st�| �|j |j ��s*td|j |f � ��|S )NFc s* g | ]"}|rt |�d kr|�� �r|�qS )� )r� � startswith)rd �x�r� r r/ r� t s �z3RevisionMap._revision_for_ident.<locals>.<listcomp>z!No such revision or branch '%s'%s� z\; please ensure at least four characters are present for partial revision identifier matches� r� z)Multiple revisions start with '%s': %s...rC c s s | ]}d | V qdS )z'%s'Nr �rd r� r r r/ rf � s z2RevisionMap._revision_for_ident.<locals>.<genexpr>r r� z*Revision %s is not a member of branch '%s') r� rZ r� r� r� rE r� rD �_shares_lineagerR )r. r� r� r� rR �revsr r� r/ r� _ s^ � ��� � �� ���z RevisionMap._revision_for_identz#Iterable[Optional[_RevisionOrBase]]z Set[Optional[_RevisionOrBase]])�targetsr, c C sJ t |�}t|�D ]4}|s t�|�| j|gdd���|g�r|�|� q|S r� )ri r� r� r� r� � differencerv )r. r� re r r r/ �_filter_into_branch_heads� s �� z%RevisionMap._filter_into_branch_headsz Iterable[_TR]zTuple[_TR, ...])r� � check_againstr� r, c sH �� |�\}}g �|r ��|� |r.��|� t� ��fdd�|D ��S )Nc 3 s" | ]}�j |�� d �r|V qdS )r� N)r� )rd �tg�r� r. Zsharesr r/ rf � s ��z1RevisionMap.filter_for_lineage.<locals>.<genexpr>)r� �append�extendr{ )r. r� r� r� r� r� r r� r/ r� � s �z RevisionMap.filter_for_lineagezOptional[_RevisionOrStr]zSequence[_RevisionOrStr])�target�test_against_revsr� r, c sr |sdS t |t�s"t� �|��}n|}� fdd�tj|dd�D �}tt� j|g|d��� � j |g|d��� |��S )NTc s$ g | ] }t |t�s � �|�n|�qS r )r� r r� )rd Ztest_against_revr[ r r/ r� � s �� z/RevisionMap._shares_lineage.<locals>.<listcomp>r ��defaultr� ) r� r r r� r r� r$ ri r� r� r� r� )r. r� r� r� Zresolved_targetZresolved_test_against_revsr r[ r/ r� � s4 �� ���� ��zRevisionMap._shares_lineagez%Tuple[Tuple[str, ...], Optional[str]]c C s� t |t�r$d|kr$|�dd�\}}nF|d k rft |t�rH|rHt |d t�rVt |ttf�sftd|f ��nd }| j |dkr�|r�| �| j|�|fS | j|fS nT|dkr�| � |�}|r�|f|fS d|fS n*|dks�|d kr�d|fS t j |d d �|fS d S ) Nr r� r zSrevision identifier %r is not a string; ensure database driver settings are correctrA r� r r7 r� ) r� rF �splitr{ r4 rZ r� rA r] r� r r� )r. r� r� Z current_headr r r/ r� � s@ �� � ��� � z$RevisionMap._resolve_revision_numberTr# zIterator[Revision])r' r( r* r) r+ �select_for_downgrader, c c sN |r | j }n| j}||||||d�\}} | �|| �D ]} t| �| ��V q4dS )au Iterate through script revisions, starting at the given upper revision identifier and ending at the lower. The traversal uses strictly the `down_revision` marker inside each migration script, so it is a requirement that upper >= lower, else you'll get nothing back. The iterator yields :class:`.Revision` objects. )r) r* r+ N)� _collect_downgrade_revisions�_collect_upgrade_revisions�_topological_sortr r� ) r. r' r( r* r) r+ r� �fnrJ rA r� r r r/ �iterate_revisions s � z RevisionMap.iterate_revisionsz%Collection[Optional[_RevisionOrBase]]zOptional[_RevisionMapType]z Iterator[Any])r� r} �check�omit_immediate_dependenciesr� r, c sR |rddd�� fdd� }n&|r0ddd�dd�}nddd�dd�}| j |� ||d�S ) Nr � Iterable[str]�re r, c s | � kr| j S | jS d S r- )r� r� �re �r� r r/ r� C s z-RevisionMap._get_descendant_nodes.<locals>.fnc S s | j S r- r� r� r r r/ r� K s c S s | j S r- r� r� r r r/ r� P s �r} r� �r� )r. r� r} r� r� r� r� r r� r/ r� 9 s �z!RevisionMap._get_descendant_nodes)r� r} r� r� r, c C s8 |rddd�dd�}nddd�dd�}| j ||||d�S )Nr r� r� c S s | j S r- ��_normalized_down_revisionsr� r r r/ r� ` s z+RevisionMap._get_ancestor_nodes.<locals>.fnc S s | j S r- r� r� r r r/ r� e s r� r� )r. r� r} r� r� r� r r r/ r� W s �z RevisionMap._get_ancestor_nodesz#Callable[[Revision], Iterable[str]])r� r� r} r� r, c c s� |d kr| j }t� }t�� }|D ]�}t|�}|�|� |r@t� } |r�|�� } |rZ| �| � | |krdq@|�| � || �D ]4} || } | d k s�t�| j | kr�t d��|�| � qv| V q@|r | � |�� |g�} | r t d|j d� dd� | D ��f ��q d S )Nz(Dependency resolution failed; broken mapz@Requested revision %s overlaps with other requested revisions %srC c s s | ] }|j V qd S r- rb r� r r r/ rf � s z9RevisionMap._iterate_related_revisions.<locals>.<genexpr>)rZ ri � collections�dequer� r� �poprj r� rR r4 r� r� rD )r. r� r� r} r� �seen�todoZ target_forr� Z per_targetre r� Znext_rev�overlapsr r r/ r� l sJ � ����z&RevisionMap._iterate_related_revisionsr z List[str])rJ rA r, c s� �j �ddd���fdd� �dd� |D ��t�j �}tt�fdd�|D �|jd ��� �fd d �� D �}g }d }� �r�� | }t|�D ] \}} ||kr�|| kr�|} qnq�|�kr�|�|� ��|� �| } | d k s�t�� �fdd �| jD �} | �s� |= ||= t |d d �}qn| j �sBt | j �dk�rB| d � |< || � |� qn| d � |< � �| dd � � �| d �||< |��fdd�| dd � D �� qn��r�t�|S )z�Yield revision ids of a collection of Revision objects in topological sorted order (i.e. revisions always come after their down_revisions and dependencies). Uses the order of keys in _revision_map to sort. rF �Set[str])r� r, c s dd� �� � | g�D �S )Nc S s h | ] }|j �qS r rb r� r r r/ r� � s �zGRevisionMap._topological_sort.<locals>.get_ancestors.<locals>.<setcomp>)r� )r� )� id_to_revr. r r/ � get_ancestors� s �z4RevisionMap._topological_sort.<locals>.get_ancestorsc S s h | ] }|j �qS r rb r� r r r/ r� � s z0RevisionMap._topological_sort.<locals>.<setcomp>c s h | ]}|j � kr|j �qS r rb r� )r� r r/ r� � s )�keyc s g | ] }� |��qS r r r� �r� r r/ r� � s z1RevisionMap._topological_sort.<locals>.<listcomp>r Nc s g | ]}|�kr|� kr|�qS r r r� )r� r� r r/ r� � s �r� c 3 s | ]}� |�V qd S r- r r� r� r r/ rf � s z0RevisionMap._topological_sort.<locals>.<genexpr>)rZ r� r� �index� enumerater� �remover� r� �maxr� r� ru rv r� ) r. rJ rA Zinserted_orderZancestors_by_idx�outputZcurrent_candidate_idx� candidateZcheck_head_index� ancestorsZ candidate_revZ heads_to_addr )r� r� r� r. r� r/ r� � sf ���� �� � � � � z RevisionMap._topological_sortz Optional[Union[str, Revision]]r� zOptional[_RevisionOrBase])�startr� r� � no_overwalkr, c C s� t |t�r| �|�}n|}tt|��D ]�}|dkrz|dks>t�dd� | �|dkrV| jn|j�D �}|rt| � ||�}q�|}n0|dkr�d}n"| �|dkr�| j n|j �}|s�d}|s�|r�dn|} | S t |�dkr�t d ��|d }q&|S ) a� Walk the requested number of :steps up (steps > 0) or down (steps < 0) the revision tree. :branch_label is used to select branches only when walking up. If the walk goes past the boundaries of the tree and :no_overwalk is True, None is returned, otherwise the walk terminates early. A RevisionError is raised if there is no unambiguous revision to walk to. r r7 c S s g | ] }t |��qS r �r� rc r r r/ r� $ s �z%RevisionMap._walk.<locals>.<listcomp>Nr )r7 r� zAmbiguous walk)r� rF r� �range�absr� r� r\ r� r� rA r� r� r4 ) r. r r� r� r �initial�_Zwalk_up�children�retr r r/ r� s< ���� zRevisionMap._walkz/Tuple[Optional[str], Optional[_RevisionOrBase]])�current_revisionsr� r+ r, c C s� |dkr dS t |t�s td��t�|�}|�r�|�� \}}}t|�}|dkr�|dkrhtd|t|�f ��| j ||||d�} | dkr�td��|| fS |dk} | �rV|�r t � |�} | � | |�} | s�t tt | �| ��} | � | |�}dd � |D �} t| �d k�s t�| d }nLt � |�}|�s.td|t|�f ��tt|��d k�rJt �d � |d }|}| j |dk�rn| �|�n| �d ||f �||d �} | dk�r�| �r�td|t|�f ��ntd��|| fS |�d�\}}}|�s�d}|| �|�fS )aX Parse downgrade command syntax :target to retrieve the target revision and branch label (if any) given the :current_revisions stamp of the database. Returns a tuple (branch_label, target_revision) where branch_label is a string from the command specifying the branch to consider (or None if no branch given), and target_revision is a Revision object which the command refers to. target_revisions is None if the command refers to 'base'. The target may be specified in absolute form, or relative to :current_revisions. N)NNz(Expected downgrade target in string formr �1Relative revision %s didn't produce %d migrations)r zWalked too farc S s g | ]}|r|j n|�qS r rb r� r r r/ r� � s �z7RevisionMap._parse_downgrade_target.<locals>.<listcomp>r� zadowngrade -1 from multiple heads is ambiguous; this usage will be disallowed in a future release.�%s@%s�r r� r r )r� rF r� �_relative_destination�match�groupsr� r4 r r� r r� r� r r r �_get_all_currentr� ri rk r� � rpartition)r. r r� r+ r r� �symbol�relativeZrel_intre Zrelative_revisionZcr_tupleZ symbol_listZ all_currentZsl_all_currentr r r r/ �_parse_downgrade_targetE s� �� ��� � � �� ���� �� ��z#RevisionMap._parse_downgrade_targetc C s� t |t�rt�|�}nd}|s(| �|�S t�|�}|�� \}}}t|�} | dk�r,|dk�r|sdd}|} |r�| � | �|�|�} | s�| � | � | �|��|�} t dd� | D �dd� | D � �} | s�d} t | �dkr�t d��| j| d | ||d �} | dk�r t d |t| �f ��| fS | j| �|�| ||d �fS nR|dk�rJt d | t| �f ��| j|dk�rb| �|�n| �d ||f �| |d �fS dS ) aJ Parse upgrade command syntax :target to retrieve the target revision and given the :current_revisions stamp of the database. Returns a tuple of Revision objects which should be iterated/upgraded to. The target may be specified in absolute form, or relative to :current_revisions. Nr r- c S s h | ] }|j �qS r rb rc r r r/ r� � s z4RevisionMap._parse_upgrade_target.<locals>.<setcomp>c S s h | ]}|j D ]}|�qqS r r� )rd re Zdownr r r/ r� � s �r� z1Ambiguous upgrade from multiple current revisions)r r� r� r r r r )r� rF r r r� r r� r r� r� r� r{ r� r4 r� r r� ) r. r r� r+ r Zcurrent_revisions_tupr� r Z relative_strr Z start_revsZactive_on_branchre r r r/ �_parse_upgrade_target� s� ��� ��� �� ���� ��� ���z!RevisionMap._parse_upgrade_targetr% r& c C s` | j |||d�\}}|dkr d}|dks6t|t�s6t�|dkrTdd� | j�� D �}n"|r`|g}ndd� | �|j�D �}|r�t|�dkr�dd � | j | � |�gd d �D �} d d� | �d d � |D �� | ��D �}t|�dkr�t d��| �|�} t | j|dd d��} t | j | dd ��} | �| � |�r4| �| �| � |��� |dk �rX| �sX|| k�rXtd|��| | fS )a Compute the set of current revisions specified by :upper, and the downgrade target specified by :target. Return all dependents of target which are currently active. :inclusive=True includes the target revision in the set �r r� r+ r7 Nc S s" g | ]}|d k r|j d kr|�qS r- �r� rc r r r/ r� H s �z<RevisionMap._collect_downgrade_revisions.<locals>.<listcomp>c S s g | ] }t |��qS r r rc r r r/ r� R s �r� c S s h | ] }|j �qS r rb rc r r r/ r� Y s �z;RevisionMap._collect_downgrade_revisions.<locals>.<setcomp>Fr� c S s g | ] }t |��qS r r rc r r r/ r� b s �c S s h | ] }|j �qS r rb rc r r r/ r� e s r z/Not a valid downgrade target from current headsT)r� r� zNothing to drop)r r� r r� rZ rr r� r� r� r� r� r� r4 ri r� �intersection_updater� r� r5 ) r. r' r( r) r* r+ r� Ztarget_revision�rootsr rA Zdowngrade_revisionsZactive_revisionsr r r/ r� + sr � � � �� �� � �� � ���� z(RevisionMap._collect_downgrade_revisionsz*Tuple[Set[Revision], Tuple[Revision, ...]]c s� dd� | j |||d�D �}t|t�r�d|kr�|�d�\� }}| �� �}|dk rx|j� krxt|j�dksjt�t t |j��� � fdd�|D �}t | j |d d d ��� |��| �|�} |s�t�fd d �| D ��r�t||��t| �tks�td ��| �r:| d dk�r:| j|||d�\}} | �st�| dk�r.t� } d}n | f} | j}t | j | d d d ��� | �} ��| �} |�r~| �dd � | �|�D �� | �r�|�s�| jdd� | D �d dd �} | �| � | t|�fS )a� Compute the set of required revisions specified by :upper, and the current set of active revisions specified by :lower. Find the difference between the two to compute the required upgrades. :inclusive=True includes the current/lower revisions in the set :implicit_base=False only returns revisions which are downstream of the current/lower revisions. Dependencies from branches with different bases will not be included. c S s g | ] }t |��qS r r rc r r r/ r� � s �z:RevisionMap._collect_upgrade_revisions.<locals>.<listcomp>r r Nr� c s h | ]}� |j kr|�qS r )rl )rd Zneed)�branchr r/ r� � s z9RevisionMap._collect_upgrade_revisions.<locals>.<setcomp>T)r� r� c 3 s | ]}|d k r|� kV qd S r- r rc )�required_node_setr r/ rf � s �z9RevisionMap._collect_upgrade_revisions.<locals>.<genexpr>z#current_revisions should be a tupler r7 c s s | ]}t |�V qd S r- r rc r r r/ rf � s c S s g | ] }t |��qS r r rc r r r/ r� � s F)r r� rF � partitionr� rR r� rl r� �next�iterri r� r� r� �anyr5 �typer{ r r� r� r� r )r. r' r( r) r* r+ r� r r� r re Zcurrent_node_setZneedsZlower_descendentsr )r! r" r/ r� � s� �� � ��� � ��� ��� � z&RevisionMap._collect_upgrade_revisionsc C s0 t | �|��}|�| jt|�dd�� | �|�S )NTr� )ri r� r� r� r� r� )r. r� Ztop_revsr r r/ r � s �z RevisionMap._get_all_current)F)N)N)F)F)FFTF)NFFT)NFT)F)NT)'r1 r2 r3 �__doc__r9 r Zmemoized_propertyrA r\ r] r^ rZ rx rp r| rq rw r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r� r� r r r r r/ rU ~ sr K4(9 �$1 �B � �(, � ( �! � �2l �?xngerU c @ sl e Zd ZU dZe� Zded< e� Zded< dZded< dZ ded < dZ ded < dZ d ed < d ed< d ed< e ddd�dd��Z d2dddddd�dd�Zdd�dd�Zd dd�dd �Zed d�d d ��Zed d�d d ��Zed d�d!d"��Zed#d�d$d%��Zed#d�d&d'��Zed#d�d(d)��Zed#d�d*d+��Zed#d�d,d-��Zed#d�d.d/��Zed#d�d0d1��ZdS )3r ao Base class for revisioned objects. The :class:`.Revision` class is the base of the more public-facing :class:`.Script` object, which represents a migration script. The mechanics of revision management and traversal are encapsulated within :class:`.Revision`, while :class:`.Script` applies this logic to Python files in a version directory. zFrozenSet[str]r� r� NrF rR zOptional[_RevIdType]r� r� r� rl rX r� r� r6 rQ c C s0 t |��t�}|r,tdd�t|��|f ��d S )Nz9Character(s) '%s' not allowed in revision identifier '%s'rC )ri r� �_revision_illegal_charsr4 rD r� )�clsrR Z illegal_charsr r r/ � verify_rev_id. s ��zRevision.verify_rev_idz%Optional[Union[str, Tuple[str, ...]]])rR r� r� rl r, c C s� |r |t �|�kr t|��n |d k r:|t �|�kr:t|��| �|� || _tt �|��| _tt �|��| _t j|dd�| _ t | j �| _ d S �Nr r� ) r r� rP rT r+ rR �tuple_rev_as_scalarr� r� r� ri rl )r. rR r� r� rl r r r/ r9 7 s � zRevision.__init__rY c C sZ t | j�t | j�g}| jr,|�d| jf � | jrD|�d| jf � d| jjd�|�f S )Nzdependencies=%rzbranch_labels=%rz%s(%s)rC ) �reprrR r� r� r� rl r; r1 rD )r. �argsr r r/ �__repr__L s zRevision.__repr__c C s4 | j �|jg�| _ | j|jkr0| j�|jg�| _d S r- )r� r� rR ru r� rS r r r/ rt T s zRevision.add_nextrevc C s t �t j| jdd�| j �S r, )r � dedupe_tupler� r� r� r[ r r r/ rs Y s ��z Revision._all_down_revisionsc C s t �t j| jdd�| j �S )z|return immediate down revisions for a rev, omitting dependencies that are still dependencies of ancestors. r r� )r r1 r� r� r� r[ r r r/ r� ` s ��z#Revision._normalized_down_revisionsc C s t j| jdd�S r, )r r� r� r[ r r r/ ru k s z"Revision._versioned_down_revisionsr$ c C s t | j� S )a Return True if this :class:`.Revision` is a 'head' revision. This is determined based on whether any other :class:`.Script` within the :class:`.ScriptDirectory` refers to this :class:`.Script`. Multiple heads can be present. )r$ r� r[ r r r/ r� o s zRevision.is_headc C s t | j� S r- )r$ r� r[ r r r/ r� z s zRevision._is_real_headc C s | j dkS )z<Return True if this :class:`.Revision` is a 'base' revision.Nr r[ r r r/ rm ~ s zRevision.is_basec C s | j dko| jdkS )zrReturn True if this :class:`.Revision` is a "real" base revision, e.g. that it has no dependencies either.N)r� r� r[ r r r/ rn � s zRevision._is_real_basec C s t | j�dkS )a+ Return True if this :class:`.Script` is a branch point. A branchpoint is defined as a :class:`.Script` which is referred to by more than one succeeding :class:`.Script`, that is more than one :class:`.Script` has a `down_revision` identifier pointing here. r� )r� r� r[ r r r/ �is_branch_point� s zRevision.is_branch_pointc C s t | j�dkS )zzReturn True if this :class:`.Script` is a 'real' branch point, taking into account dependencies as well. r� )r� r� r[ r r r/ r� � s z Revision._is_real_branch_pointc C s t | j�dkS )z6Return True if this :class:`.Script` is a merge point.r� )r� ru r[ r r r/ r� � s zRevision.is_merge_point)NN) r1 r2 r3 r( r� r� �__annotations__r� rR r� r� rl � classmethodr+ r9 r0 rt �propertyrs r� ru r� r� rm rn r2 r� r� r r r r/ r sH � r6 r� c C s d S r- r r� r r r/ r- � s r- z Union[Tuple[_T, ...], List[_T]]z#Union[_T, Tuple[_T, ...], List[_T]]c C s d S r- r r� r r r/ r- � s zOptional[Sequence[_T]]z Union[_T, Sequence[_T], None]c C s$ | sd S t | �dkr | d S | S d S )Nr� r )r� r� r r r/ r- � s r c C s t | t�st�| S r- )r� r r� r� r r r/ r� � s r� )9� __future__r r� r� �typingr r r r r r r r r r r r r r r r r r r Z sqlalchemyr rg r� r r rF Z _RevIdTypeZ _GetRevArgr# Z_RevisionOrStrZ_RevisionOrBaser� r_ r r �compiler r) r" r� r4 r5 r> rE rH rN rP rT rU r r- r� r r r r/ �<module> s� �� (