B 0H[<@stddlZddlmZddlmZddlmZddlmZm Z dZ eGdd d Z Gd d d e Z Gd d d Z dS)N)total_ordering) ProjectState) OrderedSet)CircularDependencyErrorNodeNotFoundErroraMaximum recursion depth exceeded while generating migration graph, falling back to iterative approach. If you're experiencing performance issues, consider squashing migrations as described at https://docs.djangoproject.com/en/dev/topics/migrations/#squashing-migrations.c@sheZdZdZddZddZddZdd Zd d Zd d Z ddZ ddZ ddZ ddZ ddZdS)Nodezp A single node in the migration graph. Contains direct links to adjacent nodes in either direction. cCs||_t|_t|_dS)N)keysetchildrenparents)selfr r^C:\Users\HIRONO~1\AppData\Local\Temp\pip-install-6bm3nxem\django\django\db\migrations\graph.py__init__sz Node.__init__cCs |j|kS)N)r )r otherrrr__eq__sz Node.__eq__cCs |j|kS)N)r )r rrrr__lt__sz Node.__lt__cCs t|jS)N)hashr )r rrr__hash__"sz Node.__hash__cCs |j|S)N)r )r itemrrr __getitem__%szNode.__getitem__cCs t|jS)N)strr )r rrr__str__(sz Node.__str__cCsd|jj|jd|jdfS)Nz<%s: (%r, %r)>rr) __class____name__r )r rrr__repr__+sz Node.__repr__cCs|j|dS)N)r add)r childrrr add_child.szNode.add_childcCs|j|dS)N)r r)r parentrrr add_parent1szNode.add_parentcCsZd|jkrPg}x"t|jddD]}||7}qW||jtt||jd<|jdS)N _ancestorsT)reverse)__dict__sortedr ancestorsappendr listr)r r&r rrrr&6s  zNode.ancestorscCsZd|jkrPg}x"t|jddD]}||7}qW||jtt||jd<|jdS)N _descendantsT)r#)r$r%r descendantsr'r r(r)r r*rrrrr*Cs  zNode.descendantsN)r __module__ __qualname____doc__rrrrrrrrr!r&r*rrrrrs rcs,eZdZfddZddZddZZS) DummyNodecst|||_||_dS)N)superrorigin error_message)r r r0r1)rrrrPs zDummyNode.__init__cCs|`|`t|_dS)z Transition dummy to a normal node and clean off excess attribs. Creating a Node object from scratch would be too much of a hassle as many dependendies would need to be remapped. N)r0r1rr)r rrrpromoteUszDummyNode.promotecCst|j|j|jddS)N)r0)rr1r r0)r rrr raise_error_szDummyNode.raise_error)rr+r,rr2r3 __classcell__rr)rrr.Os  r.c@seZdZdZddZddZddZd+d d Zd d Zd dZ ddZ ddZ ddZ ddZ d,ddZd-ddZd.ddZdd Zd!d"Zd#d$Zd%d&Zd/d'd(Zd)d*ZdS)0MigrationGraphaH Represent the digraph of all migrations in a project. Each migration is a node, and each dependency is an edge. There are no implicit dependencies between numbered migrations - the numbering is merely a convention to aid file listing. Every new numbered migration has a declared dependency to the previous number, meaning that VCS branch merges can be detected and resolved. Migrations files can be marked as replacing another set of migrations - this is to support the "squash" feature. The graph handler isn't responsible for these; instead, the code to load them in here should examine the migration files and if the replaced migrations are all either unapplied or not present, it should ignore the replaced ones, load in just the replacing migration, and repoint any dependencies that pointed to the replaced migrations to point to the replacing one. A node should be a tuple: (app_path, migration_name). The tree special-cases things within an app - namely, root nodes and leaf nodes ignore dependencies to other apps. cCsi|_i|_d|_dS)NF)node_mapnodescached)r rrrrzszMigrationGraph.__init__cCsB|j|}|r|nt|}||j|<||j|<|dS)N)r6getr2rr7 clear_cache)r r migrationZ dummy_nodenoderrradd_nodes    zMigrationGraph.add_nodecCs$t|||}||j|<d|j|<dS)N)r.r6r7)r r r0r1r<rrradd_dummy_nodes  zMigrationGraph.add_dummy_nodeFcCs||jkr$d||f}||||||jkrHd||f}|||||j||j||j||j||s||dS)z This may create dummy nodes if they don't yet exist. If `skip_validation=True`, validate_consistency() should be called afterwards. z=Migration %s dependencies reference nonexistent child node %rz>Migration %s dependencies reference nonexistent parent node %rN)r7r>r6r!rvalidate_consistencyr:)r r;rr Zskip_validationr1rrradd_dependencys    zMigrationGraph.add_dependencyc Cst|}y|j|}Wn4tk rJ}ztd|f||Wdd}~XYnXx|D]}|j|d|j|d}|rRx8|jD].}|j||j |kr~| || |q~Wx8|jD].}|j||j |kr| || |qWqRW| dS)z Remove each of the `replaced` nodes (when they exist). Any dependencies that were referencing them are changed to reference the `replacement` node instead. zjUnable to find replacement node %r. It was either never added to the migration graph, or has been removed.N) r r6KeyErrorrr7popr r remover rr!r:) r replacementreplacedreplacement_nodeerrZ replaced_key replaced_noderr rrrremove_replaced_nodess0         z$MigrationGraph.remove_replaced_nodesc Cs|j|dy|j|}Wn4tk rR}ztd|f||Wdd}~XYnXt}t}x0|D](}|j|}|rf||||jO}qfW||8}x<|j D]2} | j |x |D]}| | | |qWqWx|jD]} | j |qW| dS)a* The inverse operation to `remove_replaced_nodes`. Almost. Remove the replacement node `replacement` and remap its child nodes to `replaced` - the list of nodes it would have replaced. Don't remap its parent nodes as they are expected to be correct already. NztUnable to remove replacement node %r. It was either never added to the migration graph, or has been removed already.)r7rBr6rArr r9rr r rCrr!r:) r rDrErFrGZreplaced_nodesZreplaced_nodes_parentsr rHrr rrrremove_replacement_nodes2        z&MigrationGraph.remove_replacement_nodecCsdd|jDdS)z7Ensure there are no dummy nodes remaining in the graph.cSsg|]}t|tr|qSr) isinstancer.r3).0nrrr sz7MigrationGraph.validate_consistency..N)r6values)r rrrr?sz#MigrationGraph.validate_consistencycCsH|jrDx6|jD],}|j|jdd|j|jddqWd|_dS)Nr"r)F)r8r7r6r$rB)r r<rrrr:s  zMigrationGraph.clear_cachecsr|jkrtd|f||fddd_j|}y|Stk rltt t  |SXdS)z Given a node, return a list of which previous nodes (dependencies) must be applied, ending with the node itself. This is the list you would follow if applying the migrations to a database. zNode %r not a valid nodecsddj|jDS)Ncss|] }|jVqdS)N)r )rLr rrr szAMigrationGraph.forwards_plan....)r6r )x)r rrsz.MigrationGraph.forwards_plan..TN) r7rensure_not_cyclicr8r6r& RuntimeErrorwarningswarnRECURSION_DEPTH_WARNINGRuntimeWarning iterative_dfs)r targetr<r)r r forwards_plans   zMigrationGraph.forwards_plancsv|jkrtd|f||fddd_j|}y|Stk rptt t j |ddSXdS)z Given a node, return a list of which dependent nodes (dependencies) must be unapplied, ending with the node itself. This is the list you would follow if removing the migrations from a database. zNode %r not a valid nodecsddj|jDS)Ncss|] }|jVqdS)N)r )rLrrrrrPszBMigrationGraph.backwards_plan....)r6r )rQ)r rrrRsz/MigrationGraph.backwards_plan..TF)forwardsN) r7rrSr8r6r*rTrUrVrWrXrY)r rZr<r)r rbackwards_plans   zMigrationGraph.backwards_planTcCsNg}|g}x2|r<|}|||t|r0|jn|j7}q Wttt|S)z6Iterative depth-first search for finding dependencies.)rBr'r%r r r(rreversed)r startr\visitedstackr<rrrrY"s zMigrationGraph.iterative_dfsNcsVt}xF|jD]<tfdd|jjDs|r@|dkr|qWt|S)z Return all root nodes - that is, nodes with no dependencies inside their app. These are the starting point for an app. c3s|]}|ddkVqdS)rNr)rLr )r<rrrP3sz,MigrationGraph.root_nodes..r)r r7anyr6r rr%)r approotsr)r<r root_nodes,s  .zMigrationGraph.root_nodescsVt}xF|jD]<tfdd|jjDs|r@|dkr|qWt|S)am Return all leaf nodes - that is, nodes with no dependents in their app. These are the "most current" version of an app's schema. Having more than one per app is technically an error, but one that gets handled further up, in the interactive command - it's usually the result of a VCS merge and needs some user input. c3s|]}|ddkVqdS)rNr)rLr )r<rrrPAsz,MigrationGraph.leaf_nodes..r)r r7rbr6r rr%)r rcZleavesr)r<r leaf_nodes7s  .zMigrationGraph.leaf_nodescCst|j}x|r|}|g}xz|r|d}xh||D]T}||krl|||d}tddd|D||kr6||||Pq6W|}q Wq WdS)Nz, css|]}d|VqdS)z%s.%sNr)rLrMrrrrPQsz3MigrationGraph.ensure_not_cyclic..)r r7rBindexrjoinr'rC)r r_Z get_childrentodor<ratopcyclerrrrSEs   z MigrationGraph.ensure_not_cycliccCs d|S)NzGraph: %s nodes, %s edges)_nodes_and_edges)r rrrrYszMigrationGraph.__str__cCs|\}}d|jj||fS)Nz<%s: nodes=%s, edges=%s>)rmrr)r r7edgesrrrr\s zMigrationGraph.__repr__cCs"t|jtdd|jDfS)Ncss|]}t|jVqdS)N)lenr )rLr<rrrrPasz2MigrationGraph._nodes_and_edges..)ror7sumr6rO)r rrrrm`szMigrationGraph._nodes_and_edgescCs|dkrt|}t|dkr&tSt|dts:|g}g}x@|D]8}x2||D]$}||krT|sn||krnqT||qTWqDWt|d}x |D]}|j|j |dd}qW|S)z Given a migration node or nodes, return a complete ProjectState for it. If at_end is False, return the state before the migration has run. If nodes is not provided, return the overall most current project state. Nr) real_appsF)Zpreserve) r(rfrorrKtupler[r'r7Z mutate_state)r r7Zat_endrqZplanr<r;Z project_staterrr make_statecs"      zMigrationGraph.make_statecCs ||jkS)N)r7)r r<rrr __contains__{szMigrationGraph.__contains__)F)T)N)N)NTN)rr+r,r-rr=r>r@rIrJr?r:r[r]rYrerfrSrrrmrsrtrrrrr5cs(  $%  r5)rU functoolsrZdjango.db.migrations.staterZdjango.utils.datastructuresr exceptionsrrrWrr.r5rrrrs   >