XA@sddlmZddlZddlZddlmZddlmZddlm Z ddl m Z ddl m Z ddlmZd d lmZmZd ZeeGd d d eZGdddeZeGdddeZdS))unicode_literalsN)deque)total_ordering) ProjectState)six) OrderedSet)python_2_unicode_compatible)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@seZdZdZddZddZddZdd 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 rH/home/ubuntu/projects/ifolica/build/django/django/db/migrations/graph.py__init__s  z Node.__init__cCs |j|kS)N)r )rotherrrr__eq__#sz Node.__eq__cCs |j|kS)N)r )rrrrr__lt__&sz Node.__lt__cCs t|jS)N)hashr )rrrr__hash__)sz Node.__hash__cCs |j|S)N)r )ritemrrr __getitem__,szNode.__getitem__cCs t|jS)N)strr )rrrr__str__/sz Node.__str__cCs d|jS)Nz)r )rrrr__repr__2sz Node.__repr__cCs|jj|dS)N)radd)rchildrrr add_child5szNode.add_childcCs|jj|dS)N)rr)rparentrrr add_parent8szNode.add_parentcCs{d|jkrpt|jg}x0t|jD]}|jt|jq1Wtt ||jd)r )rrrrrZszDummyNode.__repr__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)r3r4r r5)rrrrpromote]szDummyNode.promotecCs"t|j|jd|jdS)Nr3)r r4r r3)rrrr raise_errorgszDummyNode.raise_error)r-r.r/rrr6r7rr)r5rr1Ts   r1c@seZdZdZddZddZddZdd d Zd d Zd dZ ddZ ddZ ddZ ddZ dddZdddZdddZdd Zd!d"Zd#d$Zd%d&Zdddd'd(Zd)d*ZdS)+MigrationGraphaI Represents 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)rrrrrs  zMigrationGraph.__init__cCsY|jj|}|r%|jnt|}||j|<||j|<|jdS)N)r9getr6r r: clear_cache)rr migrationZ dummy_nodenoderrradd_nodes    zMigrationGraph.add_nodecCs0t|||}||j|Migration %s dependencies reference nonexistent parent node %rN)r:rAr9r#r!validate_consistencyr=)rr>r r"Zskip_validationr4rrradd_dependencys   zMigrationGraph.add_dependencyc Cst|}y|j|}Wntk r}zftd|f|}||_t|dsvtjd|_nt j t|tjdWYdd}~XnXx|D]}|j j |d|jj |d}|rxM|j D]B}|jj||j|kr|j||j|qqWxP|jD]B} | j j|| j|kr;|j| | j|q;q;WqqW|jdS)z Removes 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. __traceback__N)rr9KeyErrorr __cause__hasattrsysexc_inforDrreraiser:poprrremover r!r#r=) r replacementreplacedreplacement_nodeexc exc_valueZ replaced_key replaced_noder r"rrrremove_replaced_nodess6   0   z$MigrationGraph.remove_replaced_nodesc Cs|jj|dy|jj|}Wntk r}zftd|f|}||_t|dstjd|_ nt j t|tjdWYdd}~XnXt }t }xC|D];}|jj |} | r|j| || jO}qqW||8}xL|jD]A} | jj|x(|D] } | j| | j| q;WqWx!|jD]} | jj|qmW|jdS)a1 The inverse operation to `remove_replaced_nodes`. Almost. Removes the replacement node `replacement` and remaps its child nodes to `replaced` - the list of nodes it would have replaced. Its parent nodes are not remapped 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.rDrE)r:rLr9rFr rGrHrIrJrDrrKrr<rrrrMr!r#r=) rrNrOrPrQrRZreplaced_nodesZreplaced_nodes_parentsr rSr r"rrrremove_replacement_nodes8  0       z&MigrationGraph.remove_replacement_nodecCsdd|jjDdS)zI Ensure there are no dummy nodes remaining in the graph. cSs+g|]!}t|tr|jqSr) isinstancer1r7).0nrrr s z7MigrationGraph.validate_consistency..N)r9values)rrrrrBsz#MigrationGraph.validate_consistencycCsa|jr]xE|jD]:}|j|jjdd|j|jjddqWd|_ndS)Nr$r+F)r;r:r9r%rL)rr?rrrr=s  zMigrationGraph.clear_cachec s|jkr(td|f|nj|fddd_j|}y|jSWn/tk rtjt t j |SYnXdS)z Given a node, returns 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 )rWr"rrr szAMigrationGraph.forwards_plan....)r9r)x)rrrsz.MigrationGraph.forwards_plan..TN) r:r ensure_not_cyclicr;r9r) RuntimeErrorwarningswarnRECURSION_DEPTH_WARNINGRuntimeWarning iterative_dfs)rtargetr?r)rr forwards_plans   zMigrationGraph.forwards_planc s|jkr(td|f|nj|fddd_j|}y|jSWn5tk rtjt t j |ddSYnXdS)z Given a node, returns 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 )rWr rrrr[,szBMigrationGraph.backwards_plan....)r9r)r\)rrrr],sz/MigrationGraph.backwards_plan..TforwardsFN) r:r r^r;r9r,r_r`rarbrcrd)rrer?r)rrbackwards_plan"s   zMigrationGraph.backwards_planTcCst}|j||r4tt|j}ntt|j}xc|r|j}|j||rt|jdd}nt|jdd}|j|qLWtt |S)zI Iterative depth first search, for finding dependencies. reverseT) rappendr&rrpopleft appendleftr'r*r)rstartrgvisitedstackr?rrrrrd6s     zMigrationGraph.iterative_dfsNcsxt}xb|jD]Wtfdd|jjD r| sZ|dkr|jqqWt|S)z Returns all root nodes - that is, nodes with no dependencies inside their app. These are the starting point for an app. c3s#|]}|ddkVqdS)rNr)rWr )r?rrr[Tsz,MigrationGraph.root_nodes..r)rr:anyr9rrr&)rapprootsr)r?r root_nodesMs  AzMigrationGraph.root_nodescsxt}xb|jD]Wtfdd|jjD r| sZ|dkr|jqqWt|S)an Returns 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)rWr )r?rrr[bsz,MigrationGraph.leaf_nodes..r)rr:rpr9rrr&)rrqZleavesr)r?r leaf_nodesXs  AzMigrationGraph.leaf_nodescCst|j}x|r|j}|g}x|r|d}x||D]z}||kr||j|d}tdjdd|Dn||krM|j||j|PqMqMW|j}q0WqWdS)Nr z, css|]}d|VqdS)z%s.%sNr)rWrXrrrr[rsz3MigrationGraph.ensure_not_cyclic..)rr:rLindexr joinrjrM)rrmZ get_childrentodor?rotopcyclerrrr^fs      %   z MigrationGraph.ensure_not_cycliccCsd|jS)NzGraph: %s nodes, %s edges)_nodes_and_edges)rrrrrzszMigrationGraph.__str__cCs)|j\}}d|jj||fS)Nz<%s: nodes=%s, edges=%s>)r{r5r-)rr:edgesrrrr}szMigrationGraph.__repr__cCs/t|jtdd|jjDfS)Ncss|]}t|jVqdS)N)lenr)rWr?rrrr[sz2MigrationGraph._nodes_and_edges..)r}r:sumr9rZ)rrrrr{szMigrationGraph._nodes_and_edgescCs|dkr!t|j}nt|dkr:tSt|dtsY|g}ng}x]|D]U}xL|j|D];}||kr|| r||krq|n|j|q|q|WqfWtd|}x*|D]"}|j|j |dd}qW|S)z Given a migration node or nodes, returns a complete ProjectState for it. If at_end is False, returns the state before the migration has run. If nodes is not provided, returns the overall most current project state. Nr real_appsZpreserveF) r*rtr}rrVtuplerfrjr:Z mutate_state)rr:at_endrZplanr?r>Z project_staterrr make_states"      zMigrationGraph.make_statecCs ||jkS)N)r:)rr?rrr __contains__szMigrationGraph.__contains__)r-r.r/r0rr@rArCrTrUrBr=rfrhrdrsrtr^rrr{rrrrrrr8ks(    ( )         r8) __future__rrIr` collectionsr functoolsrZdjango.db.migrations.staterZ django.utilsrZdjango.utils.datastructuresrZdjango.utils.encodingr exceptionsr r rbobjectr r1r8rrrrs   ;