4?lyM 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 ddlmZ ddlmZ erd dlm Z ee ee f Z ee ee df df Z ede f Z ed Z!e
e df Z"e
ede ed f ed f Z# ed ee df Z$ ej% d Z&g d Z' G d! d"e( Z) G d# d$e) Z* G d% d&e) Z+ G d' d(e) Z, G d) d*e) Z- G d+ d,e- Z. G d- d.e- Z/ G d/ d0e.e/ Z0 G d1 d2 Z1 G d3 d Z2ed?d8 Z3ed@d; Z3d< Z3dAd>Z4dS )B ) annotationsN)Any)Callable)cast)
Collection)Deque)Dict) FrozenSet)Iterable)Iterator)List)Optional)overload)Sequence)Set)Tuple)
TYPE_CHECKING)TypeVar)Union)util )not_none)Literal.Revision)r zLiteral['base'] _T)boundz (?:(.+?)@)?(\w+)?((?:\+|-)\d+))@-+c e Zd ZdS )
RevisionErrorN)__name__
__module__ __qualname__r i/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib/python3.11/site-packages/alembic/script/revision.pyr" r" , s Dr& r" c e Zd Zd fd Z xZS )RangeNotAncestorErrorlower_RevisionIdentifierTypeupperreturnNonec z || _ || _ t d|pdd|pd d S )N Revision basez is not an ancestor of revision )r* r, super__init__)selfr* r, __class__s r' r3 z RangeNotAncestorError.__init__1 sT
1
r& )r* r+ r, r+ r- r. r# r$ r% r3
__classcell__r5 s @r' r) r) 0 s=
r& r) c e Zd Zd fd Z xZS )
MultipleHeadsheads
Sequence[str]argument
Optional[str]r- r. c || _ || _ t d|dd | d S )Nz/Multiple heads are present for given argument 'z'; , )r; r= r2 r3 join)r4 r; r= r5 s r' r3 zMultipleHeads.__init__= sW
HHdii . . .
0
r& )r; r< r= r> r- r. r6 r8 s @r' r: r: < s=
r& r: c e Zd Zd fd Z xZS )ResolutionErrormessagestrr= r- r. c X t | || _ d S N)r2 r3 r= )r4 rD r= r5 s r' r3 zResolutionError.__init__G s&
!!!
r& )rD rE r= rE r- r. r6 r8 s @r' rC rC F s= ! ! ! ! ! ! ! ! ! !r& rC c $ e Zd ZdZd fd Z xZS )
CycleDetectedCycle revisionsr< r- r. c || _ t | j dd | d d S )Nz is detected in revisions (r@ ))rK r2 r3 kindrA r4 rK r5 s r' r3 zCycleDetected.__init__O sR "
yyy$))I....
0
r& rK r< r- r. r# r$ r% rN r3 r7 r8 s @r' rI rI L sB D
r& rI c $ e Zd ZdZd fd Z xZS )DependencyCycleDetectedzDependency cyclerK r< r- r. c J t | d S rG r2 r3 rO s r' r3 z DependencyCycleDetected.__init__Z s!
#####r& rP rQ r8 s @r' rS rS W sB D$ $ $ $ $ $ $ $ $ $r& rS c $ e Zd ZdZd fd Z xZS ) LoopDetectedz Self-looprevisionrE r- r. c L t |g d S rG rU r4 rX r5 s r' r3 zLoopDetected.__init__a s#
($$$$$r& rX rE r- r. rQ r8 s @r' rW rW ^ sB D% % % % % % % % % %r& rW c $ e Zd ZdZd fd Z xZS )DependencyLoopDetectedzDependency self-looprX r< r- r. c J t | d S rG rU rZ s r' r3 z DependencyLoopDetected.__init__h s!
"""""r& )rX r< r- r. rQ r8 s @r' r] r] e sB !D# # # # # # # # # #r& r] c e Zd ZdZdldZej dmd Zej dmd Zej dmd
Z ej dmd Z
ej dnd
Z dodZ dpdZ
dpdZdpd Zdpd Zdqdrd#Z dsdtd'Zdud*Zdvd.Zdwd0Zdxd1Z dsdyd5Zdzd9Z dqd{d>Z dqd|dCZd}dEZ d~ddOZ dddUZ dddVZ dqddYZ dd\Z dddcZ!ddfZ"ddgZ#ddhZ$ddjZ%ddkZ&d$S ) RevisionMapzMaintains 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`.
generator Callable[[], Iterable[Revision]]r- r. c || _ 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)r4 ra s r' r3 zRevisionMap.__init__u s $r& Tuple[str, ...]c | j | j S )zAll "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_mapr; r4 s r' r; zRevisionMap.heads
zr& c | j | j S )zAll "base" revisions as strings.
These are revisions that have a ``down_revision`` of None,
or empty tuple.
:return: a tuple of string revision numbers.
)rg basesrh s r' rk zRevisionMap.bases ri r& c | j | j S )zeAll "real" head revisions as strings.
:return: a tuple of string revision numbers.
)rg _real_headsrh s r' rm zRevisionMap._real_heads
r& c | j | j S )zeAll "real" base revisions as strings.
:return: a tuple of string revision numbers.
)rg _real_basesrh s r' rp zRevisionMap._real_bases rn r& _RevisionMapTypec t j }t j }t j }d}d}t }t }| D ]}| | |j |v r t j d|j z |||j < |j r| | | | | | |j
r||fz
}|j r||fz
}| } |
|t t | | |t t | | D ]{}
|
j D ]q} | |vrt j d| d|
d || } | |
| |
j v r| | | | r|| |t t | | | |||| t1 | }
dx|
d< |
d< t5 d |D | _ t5 d |D | _ t5 d |D | _ t5 d
|D | _ | ||
|
S ) z_memoized attribute, initializes the revision map from the
initial collection.
r %Revision %s is present more than oncer0 referenced from is not presentNc 3 $ K | ] }|j V d S rG rX .0revs r' z,RevisionMap._revision_map.. $ 99C3<999999r& c 3 $ K | ] }|j V d S rG rw rx s r' r{ z,RevisionMap._revision_map.. $ E E# E E E E E Er& c 3 $ K | ] }|j V d S rG rw rx s r' r{ z,RevisionMap._revision_map.. r| r& c 3 $ K | ] }|j V d S rG rw rx s r' r{ z,RevisionMap._revision_map.. r~ r& ) sqlautil OrderedDict
OrderedSetsetrd addrX r warn
branch_labelsis_base
_is_real_basecopy_map_branch_labelsr rq _add_depends_onvalues_all_down_revisions add_nextrev_versioned_down_revisionsdiscard_normalize_depends_on_detect_cyclesdictitemstupler; rm rk rp
_add_branches)r4 map_r; rm rk rp has_branch_labels
all_revisionsrX rev_maprz downrev
down_revision revision_maps r' rg zRevisionMap._revision_map s6 )1(<(>(> ' 2 4 4%-%8%:%: &(,. EE
)) + +H h ' ' ' D(( ;h>OO '/D" #%
0!%%h/// IIh OOH % % %
%($%
+{* ))++ t$4d ; ;
]D1A4,H,HIII;;== 3 3C 2
3
3$&&II"77CCC) !%W
))#...c ;;;MM-000##M2222
3
""=$7G2N2NOOO GUE; LLL)-djjll);); 044 T\" -99599999
E E E E EEE99599999
E E E E EEE ,l;;;r& r _InterimRevisionMapTyper;
Set[Revision]rk Tuple[Revision, ...]rm rp c |sd S |r|s t t | d | d |t t | D d | d |t t | D }t
| |z
}|r t t | |r|s t t | d | d |t t | D d | d |t t | D }t
| |z
}|r t t | d S )
Nc h | ] }|j
S r rw rx s r' z-RevisionMap._detect_cycles.. *
L
r& c | j S rG r rs r' z,RevisionMap._detect_cycles.. s !5 r& )r c 3 $ K | ] }|j V d S rG rw rx s r' r{ z-RevisionMap._detect_cycles.. 8
L
r& c | j S rG nextrevr s r' r z,RevisionMap._detect_cycles.. s !) r& c h | ] }|j
S r rw rx s r' r z-RevisionMap._detect_cycles.. r r& c | j S rG )r r s r' r z,RevisionMap._detect_cycles.. s !/ r& c 3 $ K | ] }|j V d S rG rw rx s r' r{ z-RevisionMap._detect_cycles..! r r& c | j S rG _all_nextrevr s r' r z,RevisionMap._detect_cycles..$ s !. r& )
rI list_iterate_related_revisionsr rq intersectionr keyssortedrS )r4 r r; rk rm rp total_space deleted_revss r' r zRevisionMap._detect_cycles s$ F /E / W
.. .
6655*G44 7
,
66##*G44 7
7<<>>**[8 6 | 4 455 5 9+ 9)$w--88 8
66//*G44 7
,
66((*G44 7
7<<>>**[8 @)& *>*>?? ? @ @r& rK Collection[Revision]r c
|D ]S}|j rJ|j J |j D ]9}||v r.|| }|J t d|d|j d|j |||< :Td S )Nz
Branch name 'z' in revision z already used by revision )r _orig_branch_labelsr" rX )r4 rK r rX branch_labelmap_revs r' r z RevisionMap._map_branch_labels- s " 2 2H%
2 3???$,$@
2
2L#t++"&|"4 & 2 2 2 +m !- ( 1 1 1 ' 0 0 *2D &&! 2 2r& c |D ]}|j r|j |j | |g|d D ]!}|j |j "|}|rS|j sL|j sE|j |j |j r||j }nn|r|j s|j Ed S NFinclude_dependencies)r update_get_descendant_nodes_is_real_branch_pointis_merge_pointr )r4 rK r rX nodeparents r' r zRevisionMap._add_branchesB s " H%
&--h.DEEE 6 6 J5 7 F FD &--h.DEEEE
" 8
# 1
(//0FGGG + !%f&:!;
" 8
# 1
r& c |D ]T}|j rDfdt j |j D }t d |D |_ Md|_ UdS )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 g | ]
}| S r r )ry depr s r'
z/RevisionMap._add_depends_on..h s* "%DI r& c g | ] }||j S rG rw ry ds r' r z/RevisionMap._add_depends_on..l s ???A QZ r& r N) dependenciesr to_tupler _resolved_dependencies)r4 rK r rX depss ` r' r zRevisionMap._add_depends_onZ s " 5 5H$
5 )- x7L)M)M 38?????3 3// 35// 5 5r& c ( |D ]}|j r~t |j }| |gdt t | D ](}||u r|j r| |j )t
| |_ d|_ dS )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 r _get_ancestor_nodesr rq difference_updater !_normalized_resolved_dependencies)r4 rK r rX normalized_resolvedrz s r' r z!RevisionMap._normalize_depends_onq s & " @ @H.
@&)(*I&J&J# 33 J). .55 4
C
h 3 +== 6 >C'> >:: >@::' @ @r& FrX r _replaceboolc b | j }|s&j |v r t j dj z n"|r j |vrt dj z |j < g}| || | || | || j r| xj j fz
c_ j
r| xj j fz
c_ j D ]I}||vrt j d|dd t || J| || j r.t# fd| j D j fz | _ j r0t# fd| j D j fz | _ dS dS ) zadd 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.
rs zrevision %s not in mapr0 rt ru c 3 z K | ]5}|t j j g v1|V 6d S rG )r r unionrX ry headrX s r' r{ z+RevisionMap.add_revision.. sk % %8788>> &' % %r& c 3 z K | ]5}|t j j g v1|V 6d S rG )r r r rX r s r' r{ z+RevisionMap.add_revision.. sk 8=>>DD &' r& N)rg rX r r Exceptionr r r r rk r rp r r r r
_is_real_headr rm is_headr; )r4 rX r r rK r s ` r' add_revisionzRevisionMap.add_revision sL ! JH - 5 5 I7(:KK
J(+477 4x7H HII I"*X
J 9d+++ 4000 Y--- / JJ8,. .JJ ! 5 !2 4 4 3 : :Gd"" ww*
T'] # # / / 9 9 9 9 ""9d333 ! % $ % % % % ,% % % "$ %D % J "$%DJJJ % %r& Nr r> c | j }|r| || }t | dk rt ||rd|z nd |r|d S 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)r; filter_for_lineagelenr: )r4 r
current_headss r' get_current_headz RevisionMap.get_current_head s ( (,z
3 3 | M } ! ! ,8D L((f
# #4r&
identifierrE c 8 | | j | S rG )r rk )r4 r s r' _get_base_revisionsz RevisionMap._get_base_revisions s &&tz:>>>r& id_+Union[str, Collection[Optional[str]], None]%Tuple[Optional[_RevisionOrBase], ...]c t |t t t t f r t fd|D d S | \ }t | dk r{ t |d dk rN d }t fd|D }t fd|D S n# t $ r Y nw xY wt fd |D S )
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 : g | ]} | S r )
get_revisions)ry id_elemr4 s r' r z-RevisionMap.get_revisions..
s' GGG**733GGGr& r r r r; Nc 3 H K | ] }t | j v |V d S rG ) is_revisionr )ry r r s r' r{ z,RevisionMap.get_revisions.. sX 1 1 $(#/#.t#4#4#B$C $C !%$C $C $C $C1 1 r& c 3 F K | ]} | V dS ))stepsN)_walk)ry r rintr4 s r' r{ z,RevisionMap.get_revisions.. sG % % $ !JJt4J 8 8% % % % % %r& c 3 D K | ]} | V d S rG )_revision_for_ident)ry rev_idr r4 s r' r{ z,RevisionMap.get_revisions..& sG (( >> r& )
isinstancer r r frozensetsum_resolve_revision_numberr intr
ValueError)r4 r resolved_id select_headsr r s ` @@r' r zRevisionMap.get_revisions s ( cD%i8 9 9 GGGG3GGGLL L(,(E(E) ) %K ; 1$$ {1~..Daxx'+'9'9''B'B '3+0 1 1 1 1 ,81 1 1 , , L % % % % % %(4% % % " D )
s 4A(C
C+*C+Optional[Revision]c | | \ }}t | dk rt || |r|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 )r4 r r r resolveds r' get_revisionzRevisionMap.get_revision+ sg %)$A$A#$F$F! \ { a S11 1.e sJ Q! [(A(A #r& z No such revision or branch '' z\; please ensure at least four characters are present for partial revision identifier matches r z Multiple revisions start with 'z': r@ c 3 K | ] }d |z V
dS )z'%s'Nr ry r s r' r{ z2RevisionMap._revision_for_ident.. s& -L-LQfqj-L-L-L-L-L-Lr& r r z...r0 z is not a member of branch ') r rg r r rC r rA _shares_lineagerX )r4 r r r rX revss ` r' r z RevisionMap._revision_for_identP s --l;;JJ J )+6HH HHH u ; + D
C..t\BB
7%o $ #; / /! 3 3 N N "$ $ TQ %o #{{DII-L-L$qs)-L-L-L$L$L$L$LN -d1g6
H 0 ))) ;''!:#6
&o (((,,,8
s
+ ::targets#Iterable[Optional[_RevisionOrBase]] Set[Optional[_RevisionOrBase]]c t | }t | D ]Z}|sJ | | |gd |g r| | [|S r )r r r r
differencer )r4 r! rz s r' _filter_into_branch_headsz%RevisionMap._filter_into_branch_heads s g,,== % %CJJ3##**C5u*MM j#
% $$$r& Iterable[_T]
check_againstr Tuple[_T, ...]c | \ }}g |r | |r | t fd|D S )Nc 3 L K | ] } | |V dS )r N)r )ry tgr r4 sharess r' r{ z1RevisionMap.filter_for_lineage.. sZ
##F1E $
r& )r appendextendr )r4 r! r( r r r r- s ` ` @r' r z RevisionMap.filter_for_lineage s ! 9 9- H H\ ( MM, ' ' ' MM#
r& target_RevisionOrStrtest_against_revsSequence[_RevisionOrStr]c |sdS t |t s#t | }n|} fdt j |d D }t
t |g|
|g| | S )NTc h g | ].}t |t s | n|/S r )r r r )ry test_against_revr4 s r' r z/RevisionMap._shares_lineage.. sR &
&
&
! .99
"D $ $%5 6 6 6!&
&
&
r& r defaultr ) r r r r r r r r r r r r )r4 r0 r2 r resolved_targetresolved_test_against_revss ` r' r zRevisionMap._shares_lineage s ! 4&(++ % &t'?'?'G'G H HOO $O&
&
&
&
%)M!2% % % &
&
&
" **$%)= +
U(($%)= ) \4
5
5
r& %Tuple[Tuple[str, ...], Optional[str]]c 0 t |t r d|v r| dd \ }}ne|at |t r |rt |d t r t |t t f st d|d d }| j |dk r(|r | | j | |fS | j |fS |dk r | | }|r|f|fS d|fS |d k s|d|fS t j |d
|fS ) Nr r r zrevision identifier z= is not a string; ensure database driver settings are correctr; r r r1 r7 ) r rE splitr r" rg r r; rm r r r )r4 r r current_heads r' r z$RevisionMap._resolve_revision_number sh c3
C3JJ # #q 1 1 L##
_
U
#
# (+ 4>s1vs4K4K cC<00 -147
L
'>>
6++DJ EE
' 55
F]] 00 >>L
($ 44<''
F]]ck|# #=d333\A Ar& Tr, r+ r*
implicit_base inclusiveassert_relative_lengthselect_for_downgradeIterator[Revision]c # K |r| j }n| j } |||||| \ }} | || D ]&}
t | |
V 'dS )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? rA N) _collect_downgrade_revisions_collect_upgrade_revisions_topological_sortr r ) r4 r, r* r? r@ rA rB fnrK r; r s r' iterate_revisionsz RevisionMap.iterate_revisions s * 12BB0B 2 '#9
5 **9e<< 4 4D4,,T2233 3 3 3 3 4 4r& %Collection[Optional[_RevisionOrBase]]Optional[_RevisionMapType]checkomit_immediate_dependencies
Iterator[Any]c X |rfd}n |rd }nd }| ||| S )Nc ( | vr| j S | j S rG )r r )rz r! s r' rH z-RevisionMap._get_descendant_nodes..fn3 s g%% ++ ;&r& c | j S rG r rz s r' rH z-RevisionMap._get_descendant_nodes..fn; s ''r& c | j S rG r rR s r' rH z-RevisionMap._get_descendant_nodes..fn@ s
{"r& r rL r )r4 r! r rL rM r rH s ` r' r z!RevisionMap._get_descendant_nodes( s ' #
'
'
'
'
'
' " #
(
(
(
(
#
#
# .. d% /
r& c F |rd }nd }| |||| S )Nc | j S rG _normalized_down_revisionsrR s r' rH z+RevisionMap._get_ancestor_nodes..fnQ s 55r& c | j S rG r rR s r' rH z+RevisionMap._get_ancestor_nodes..fnV s 44r& rT rU )r4 r! r rL r rH s r' r z RevisionMap._get_ancestor_nodesG sW 5
6
6
6
6
5
5
5 .. d% /
r& rH r c
# K || j }t }t j }|D ]1}t | }| | |rt } |r| }
|r| |
|
|v r2| |
||
D ]=} || } | J | j | k rt d | | >|
V ||rb|
| |g }
|
r7t d|j dd d |
D 3d S )Nz(Dependency resolution failed; broken mapzRequested revision z) overlaps with other requested revisions r@ c 3 $ K | ] }|j V d S rG rw r s r' r{ z9RevisionMap._iterate_related_revisions.. s$ %C%CQaj%C%C%C%C%C%Cr& )
rg r collectionsdequer r. popr rX r" r r% rA )r4 rH r! r rL seentodo
target_forr0
per_targetrz r next_revoverlapss r' r z&RevisionMap._iterate_related_revisions] s <%Duu + 1 3 3! $ $ J ,,F KK
# UU
hhjj ( NN3'''$;;
bgg * *F #F|H#/// (F22 + F KK)))) #
$
%227;;FFH '- #OOO II%C%C(%C%C%C C C C ;$ $ r& r List[str]c
j fd
d |D t j }t t fd|D |j
fd D }g }d} rD | }t | D ]\ }} ||k r || v r|} n|v r*| | | | }
|
J fd|
j D } | s |= ||= t |d z
d }n|
j s?t |
j d k r'| d |< || | ne| d |<
| d d
| d ||< |
fd
| d d D DrJ |S ) zYield 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.
c P d | g D S )Nc h | ] }|j
S r rw r s r' r zGRevisionMap._topological_sort..get_ancestors.. s*
r& )r )r id_to_revr4 s r'
get_ancestorsz4RevisionMap._topological_sort..get_ancestors s: 119V3D2EFF
r& c h | ] }|j
S r rw r s r' r z0RevisionMap._topological_sort.. s ...q
...r& c 0 h | ]}|j v |j S r rw )ry r ra s r' r z0RevisionMap._topological_sort.. s' AAAajD.@.@.@.@.@r& )keyc & g | ]
} | S r r )ry r rk s r' r z1RevisionMap._topological_sort.. s# NNNfMM& 1 1NNNr& r Nc $ g | ] }|v |v
|
S r r )ry r r ra s r' r z1RevisionMap._topological_sort.. s6 DyyQm%;%; %;%;%;r& r c 3 . K | ]} | V d S rG r )ry r rk s r' r{ z0RevisionMap._topological_sort.. s> 0 048MM$ / /0 0 0 0 0 0r& )rg r r index enumerater. removerY maxr r r r r/ )r4 rK r; inserted_orderancestors_by_idxoutputcurrent_candidate_idx candidatecheck_head_index ancestors
candidate_rev heads_to_addr rk rj ra s ` @@@@r' rG z RevisionMap._topological_sort s & /.I... d 011 AAAAUAAA"(
ONNN
NNN ! @ %&;?,/0E0I1,M,M)) * K
G H HA M M?KA
&;< ))>?GG % @LA
&;<%,,\!""-=>>> *M,q/ : : ) 1 )// 0 0 0 0 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 r1 c , g | ]}t | S r r rx s r' r z%RevisionMap._walk.. s0 $$ r& Nr )r1 r zAmbiguous walk)
r rE r rangeabsr rk r r r; r r r" )
r4 r r r r initial_walk_upchildrenrets
r' r zRevisionMap._walk sk ( eS ! ! ''..GGG s5zz"" ! " ! "Aqyy &(((( # 1 1&-o
7? ' # 6 6w M MHH &HH f$$ !HH # 1 1"?
$ 2 H
$ -#,
6 *6ddw
X ""#$4555 qkGGr& current_revisions/Tuple[Optional[str], Optional[_RevisionOrBase]]c |dS t |t s
J d t | }|r| \ }}}t | }|dk rQ|!t
d|t | fz | |||| } | t
d || fS |du }
|
r|rt j
| } | | | } | sUt t t | | }
| |
| }d |D } t! | d k sJ | d }nut j
| }|s!t
d|t | fz t! t# | d k rt j d
|d }|}| || | n| |d | || } | 2|
r!t
d|t | fz t
d || fS | d \ }}}|sd}|| | fS )
aV
Parse downgrade command syntax :target to retrieve the target revision
and branch label (if any) given the :current_revisons 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_revsions is None if the command
refers to 'base'. The target may be specified in absolute form, or
relative to :current_revisions.
NNNz(Expected downgrade target in string formr 1Relative revision %s didn't produce %d migrations)r zWalked too farc $ g | ]
}|r|j n|S r rw r s r' r z7RevisionMap._parse_downgrade_target..x s3 + + + $% /0 6
Q+ + + r& r zadowngrade -1 from multiple heads is ambiguous; this usage will be disallowed in a future release.r r r r )r rE _relative_destinationmatchgroupsr r" r r r r r r r r _get_all_currentr r r r
rpartition)r4 r r0 rA r r symbolrelativerel_intrz relative_revisioncr_tuple symbol_list all_currentsl_all_currentr s r' _parse_downgrade_targetz#RevisionMap._parse_downgrade_target7 sJ $ > : C
6 6 5 6 6
&++F33 T )-2\\^^ *L&((mmG!||>'03;S\\2JK
jj 6 ! ;'(8999#S(($*dN!$ -.# +.#'=1B#C#C&*&=&= $l' ' +
+/ #H
t/D/DX/N/N+ + K .2-D-D +\. . N+ + )7+ + + K
#; / /1 4 4 4 4!,Q ,0M:K,L,L) 0 "/!8#+S\\":!;# # s#4 5 566:: I!+ "31!5 (. jj#+ ++F333 **lllFF+KLL! 6 ! ;( > + 47?W 6N O
,,< = ==#S(( #)"3"3C"8"8 a LT . .v 6 666r& c N t |t rt | }nd}|s| | S t j | }| \ }}}t | } | dk r0| |sd}|}
|r| | | | }
|
sf| |
| | | } t d | D d | D z
}
|
sd}
t |
dk rt d | |
d | || } | !t d |t | fz | fS | | | | || fS |!t d | t | fz | || | n| |d
| | | fS ) aI
Parse upgrade command syntax :target to retrieve the target revision
and given the :current_revisons 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 rG c h | ] }|j
S r rw rx s r' r z4RevisionMap._parse_upgrade_target.. s F F FcS\ F F Fr& c & h | ]}|j D ]}|S r rX )ry rz downs r' r z4RevisionMap._parse_upgrade_target.. sB $',/,J %) !% r& r z1Ambiguous upgrade from multiple current revisions)r r r r r r r )r rE r r r r r r r r r r r r" r r r )
r4 r r0 rA r current_revisions_tupr r relative_strr
start_revsactive_on_branchrz s
r' _parse_upgrade_targetz!RevisionMap._parse_upgrade_target s fc " " )//77EEE .%%f-- - !%
.? @ @ -2\\^^* fl|$$ a<<~, 4,3) 2
1!%!8!8 **+@AA<" "J & 1 ,0+B+B 4 4 $ 2 23H I I ) , ,( &+ F F5E F F F +; & &
* 1 *1Jz??Q&&'K jj$Q-"!- 6 ! ;'03?X 2OP v
JJ " / / 7 7 &%1$: ~#,/7X .GH
#+ ++F333 **lllFF+KLL" 6
r& c | ||| \ }}|dk rd}|t |t sJ |$d | j D }n*|r|g}n$d | |j D }|rt | dk rd | | | gd D } d
| d |D
| D }t | d k rt d
| | }
t |
|dd } t | |
d } | | |r;| | | | || s||
vrt# d| | |
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 r0 rA r1 Nc $ g | ]
}||j |S rG r rx s r' r z.1 s/ ?s'8'@ '@'@'@r& c , g | ]}t | S r r rx s r' r z.; s0 C r& r c h | ] }|j
S r rw rx s r' r z;RevisionMap._collect_downgrade_revisions..B s* r& Fr c , g | ]}t | S r r rx s r' r z.K s0 C r& c h | ] }|j
S r rw rx s r' r z;RevisionMap._collect_downgrade_revisions..N s 333cS\333r& r z/Not a valid downgrade target from current headsT)r rM zNothing to drop)r r r rg r r r r r r r r" r r intersection_updater r% r) )
r4 r, r0 r@ r? rA r target_revisionrootsr| r; downgrade_revisionsactive_revisionss
r' rE z(RevisionMap._collect_downgrade_revisions s )-(D(D ##9 )E )
)
% o
f $ $ "O &*_h*O*O&&O " -4466 EE
$%EE --o.EFF E
CJJNN 33)),778). 4 I --33U333@@KK E 5zzQ#E ""5)) " & &%),1
'
$ $U $ F F
//0@AAA & & ++D,D,DU,K,KLL
''
( u,, ((95AA A"E))r& 6Tuple[Set[Revision], Tuple[Optional[_RevisionOrBase]]]c d | ||| D }t |t rd|v r| d \ }}| }|F|j k r;t
|j dk sJ t t |j fd|D }t | |dd | |
| } |s+t fd | D rt || t! | t" u s
J d
| rH| d @| ||| \ }}
|
sJ |
d k rt# } d}n
|
f} |
j }t | | dd | } | } |r2| d
|
| D | r9|s7| 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 , g | ]}t | S r r rx s r' r z:RevisionMap._collect_upgrade_revisions.. s0 )
)
)
)
)
)
r& r r Nr c & h | ]
}|j v |S r )r )ry needbranchs r' r z9RevisionMap._collect_upgrade_revisions.. s- Fd6H,H,H,H,H,Hr& T)rL r c 3 $ K | ]
}||vV d S rG r )ry rz required_node_sets r' r{ z9RevisionMap._collect_upgrade_revisions.. s7 %
%
( ( %
%
r& z#current_revisions should be a tupler r1 c 3 4 K | ]}t | V d S rG r rx s r' r{ z9RevisionMap._collect_upgrade_revisions.. s* OOcS))OOOOOOr& c , g | ]}t | S r r rx s r' r z:RevisionMap._collect_upgrade_revisions.. s ???cS!!???r& F)r r rE partitionr rX r r nextiterr r r r anyr) typer r r% r r r )r4 r, r* r@ r? rA r! r r r rz current_node_setneedslower_descendentsr r s @@r' rF z&RevisionMap._collect_upgrade_revisions{ s. &)
)
11"' '= 2 )
)
)
eS ! ! cUll ??3//LFAq **622J%**=*G*G:3449999 d:#; < <== !( G $ $t$
%
%.. ! . .u 5 5 6 %
%
%
%
(%
%
%
"
"
6
(u55 5 " # #u , , , 0
- , ,
%!21!5!=11"' '= 2 FAs
JJ3f}}$)GG! %(F! $ $!D
%
%!
"
" ",,-=>> P LLOOT5G5G5N5NOOO O O O
9] 9 $ : :??->???%* !; ! !
% %&7 8 8 8eGnn$$r& c t | | }| | t | d | | S )NTr )r r r r r r& )r4 r top_revss r' r z RevisionMap._get_all_current sg t))#..// $ $T(^^$ $ O O
--h777r& )ra rb r- r. r- re )r- rq ) r r r; r rk r rm r rp r r- r. )rK r r rq r- r. )F)rX r r r r- r. rG )r r> r- r> )r rE r- re )r r r- r )r r> r- r )r rE r- r )r r r r> r- r )r! r" r- r# )r! r' r( r> r r r- r) )r0 r1 r2 r3 r r r- r )r r> r- r; )FFTF)r, r+ r* r+ r? r r@ r rA r rB r r- rC )NFFT) r! rJ r rK rL r rM r r r r- rN )NFT)
r! rJ r rK rL r r r r- rC )
rH r r! rJ r rK rL r r- rC )rK r r; r r- rf )NT)
r r r r r r> r r r- r )r r+ r0 r+ rA r r- r )r r+ r0 r+ rA r r- r ) r, r+ r0 r+ r@ r r? r rA r r- r ) r, r+ r* r+ r@ r r? r rA r r- r )r re r- r# )'r# r$ r% __doc__r3 r memoized_propertyr; rk rm rp rg r r r r r r r r r r r r r& r r r rI r r r rG r r r rE rF r r r& r' r` r` l s $ $ $ $
I I I I V2@ 2@ 2@ 2@h2 2 2 2* 05 5 5 5.&@ &@ &@ &@P6% 6% 6% 6% 6%r -1" " " " "H? ? ? ?1 1 1 1f@ @ @ @* & '+@ @ @ @ @D " &+
4 &+ $
$
$
$
$
L&B &B &B &BX $ '+%*#4 #4 #4 #4 #4P ,0,1%)
D ,0%)
6 0 0 0 0 0dg g g gZ '+ = = = = =~r7 r7 r7 r7hg g g gRe* e* e* e*Nc% c% c% c%J8 8 8 8 8 8r& r` c e Zd ZU dZ e Zded< e Zded< dZded< dZ ded < dZ
ded
< dZ d ed < d
ed< d
ed< e d"d Z
d#d$dZd%dZd&dZed'd Zed'd Zed'd Zed(d Zed(d Zed(d Zed(d Zed(d Zed(d Zed(d! ZdS ))r 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 NrE rX zOptional[_RevIdType]r r zSet[str]r re r r r- r. c t | t }|r6t dd t | d|d d S )NzCharacter(s) 'r@ z&' not allowed in revision identifier 'r )r r _revision_illegal_charsr" rA r )clsrX
illegal_charss r'
verify_rev_idzRevision.verify_rev_id sj H
223JKK
-99VM 2 23333XXX?
r& %Optional[Union[str, Tuple[str, ...]]]c |r%|t j | v rt | |%|t j | v rt | | | || _ t
| | _ t
| | _ t j |d | _ t | j | _ d S Nr r7 ) r r rW r] r rX tuple_rev_as_scalarr r r r r )r4 rX r r r s r' r3 zRevision.__init__ s 3X })E)E E E x(( (
%(dm 7
7
+
+
)22 2 8$$$
0 ? ? / = =#'= #K#K#K !9 : :r& c , t | j t | j g}| j r | d| j | j r | d| j | j j dd | dS )Nz
dependencies=zbranch_labels=(r@ rM ) reprrX r r r. r r5 r# rA )r4 argss r' __repr__zRevision.__repr__5 s T]##T$*<%=%=> B KKKT->->@ A A A D KKKd.@.@B C C C >222DIIdOOOODDr& c | j |j g | _ | j |j v r'| j |j g | _ d S d S rG )r r rX r r )r4 rX s r' r zRevision.add_nextrev= sZ - 3 3X5F4G H H =H > > > <--x/@.ABBDLLL ? >r& c l t j t j | j d | j z S r )r dedupe_tupler r r rh s r' r z Revision._all_down_revisionsB s7 M$,b 9 9 9)
*
r& c l t j t j | j d | j z S )z|return immediate down revisions for a rev, omitting dependencies
that are still dependencies of ancestors.
r r7 )r r r r r rh s r' rY z#Revision._normalized_down_revisionsI s9 M$,b 9 9 94
5
r& c 8 t j | j d S r )r r r rh s r' r z"Revision._versioned_down_revisionsT s }T /<<<r s " " " " " " ' ' ' ' ' '
3
%
&
U38_d :; z3'56 sJ/ dCr 23Xj5IIJ WTsJ/000"
#DEE )// I
M
M
! ! ! ! !m ! ! !
M
$ $ $ $ $m $ $ $% % % % %= % % %# # # # # 4l # # #|8 |8 |8 |8 |8 |8 |8 |8~+d7 d7 d7 d7 d7 d7 d7 d7N
r&