h2tSSKJr SSKJr SSKJrJr \"SS55r"SS\5r"S S 5r g ) )total_ordering) ProjectState)CircularDependencyErrorNodeNotFoundErrorcN\rSrSrSrSrSrSrSrSr Sr S r S r S r S rg )Nodezd A single node in the migration graph. Contains direct links to adjacent nodes in either direction. cLXl[5Ul[5UlgN)keysetchildrenparents)selfr s L/var/www/html/env/lib/python3.13/site-packages/django/db/migrations/graph.py__init__ Node.__init__s u c URU:H$r r rothers r__eq__ Node.__eq__sxx5  rc URU:$r rrs r__lt__ Node.__lt__sxx%rc,[UR5$r )hashr rs r__hash__ Node.__hash__sDHH~rc URU$r r)ritems r __getitem__Node.__getitem__sxx~rc,[UR5$r )strr r!s r__str__ Node.__str__ s488}rc|SURR<SURS<SURS<S3$)N) __class____name__r r!s r__repr__ Node.__repr__#s*#'>>#:#:DHHQKRSUUrc:URRU5 gr )radd)rchilds r add_childNode.add_child&s % rc:URRU5 gr )rr4)rparents r add_parentNode.add_parent)s  r)rr rN)r0 __module__ __qualname____firstlineno____doc__rrrr"r&r*r1r6r:__static_attributes__rrr r s5  ! V!!rr c2^\rSrSrSrU4SjrSrSrU=r$) DummyNode-a A node that doesn't correspond to a migration file on disk. (A squashed migration that was removed, for example.) After the migration graph is processed, all dummy nodes should be removed. If there are any left, a nonexistent dependency error is raised. c<>[TU]U5 X lX0lgr )superrorigin error_message)rr rGrHr/s rrDummyNode.__init__6s  *rcT[URURURS9e)N)rG)rrHr rGr!s r raise_errorDummyNode.raise_error;s 2 2DHHT[[QQr)rHrG) r0r<r=r>r?rrKr@ __classcell__)r/s@rrCrC-s+ RRrrCc\rSrSrSrSrSrSrSSjrSr Sr S r S r S r SS jrSSjrSSjrSrSrSrSrSrSSjrSrSrg )MigrationGraph?a 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. c 0Ul0Ulgr node_mapnodesr!s rrMigrationGraph.__init__Vs  rctXR;de[U5nX0RU'X RU'gr )rSr rT)rr migrationnodes radd_nodeMigrationGraph.add_nodeZs2--'''Cy! c# 3rcV[XU5nX@RU'SURU'gr )rCrSrT)rr rGrHrXs radd_dummy_nodeMigrationGraph.add_dummy_node`s'm4! c 3rcX R;aSU<SU<3nURX!U5 X0R;aSU<SU<3nURX1U5 URURURU5 URUR URU5 U(dUR 5 gg)z This may create dummy nodes if they don't yet exist. If `skip_validation=True`, validate_consistency() should be called afterward. z Migration z/ dependencies reference nonexistent child node z0 dependencies reference nonexistent parent node N)rTr\rSr:r6validate_consistency)rrWr5r9skip_validationrHs radd_dependencyMigrationGraph.add_dependencyes  "%.u6    - @  #&/8    = A e'' f(=> f'' e(<=  % % 'rc[U5nURUnUGH nURR US5 URR US5nU(dMEUR HRnURRU5 URU;dM0URU5 URU5 MT URHRnUR RU5 URU;dM0URU5 URU5 MT GM g![an[SU<S3U5UeSnAff=f)z Remove each of the `replaced` nodes (when they exist). Any dependencies that were referencing them are changed to reference the `replacement` node instead. z Unable to find replacement node zH. It was either never added to the migration graph, or has been removed.N) rrSKeyErrorrrTpoprrremover r6r:) r replacementreplacedreplacement_nodeerr replaced_key replaced_noder5r9s rremove_replaced_nodes$MigrationGraph.remove_replaced_nodes|s$x= #}}[9 %L JJNN< . MM--lDAM}*33EMM((7yy0(2259(()9:4,33FOO**=9zz1(33F;(()9: 4%  #CNQ   sD-- E7E  EcURRUS5 URRU5n[ 5n[ 5nUHFnURR U5nU(dM'URU5 XhR-nMH XV-nURHIn U RRU5 UH%nURU 5 U RU5 M' MK URHn U RRU5 M g![an[ SU<S3U5UeSnAff=f)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. Nz"Unable to remove replacement node zP. It was either never added to the migration graph, or has been removed already.) rTrerSrdrrgetr4rrrfr6r:) rrgrhrirjreplaced_nodesreplaced_nodes_parentsr rlr5r9s rremove_replacement_node&MigrationGraph.remove_replacement_nodes, {D) #}}00= !$C MM--c2M}""=1&*?*??&  0%..E MM !1 2!/ ''.  /"0/ '..F OO " "#3 4/- #!     sD%% E/EEcURR5Vs/sH*n[U[5(dMUR 5PM, ngs snf)z7Ensure there are no dummy nodes remaining in the graph.N)rSvalues isinstancerCrK)rns rr_#MigrationGraph.validate_consistencys7"&--"6"6"8U"8QJq)# UHoSTS:gv M g7frNrA.0r rXs r ,MigrationGraph.root_nodes..sL0Kq6T!W$0Kr)rrTallrSrr4r)rapprootsrXs @r root_nodesMigrationGraph.root_nodess^ JJDL d0C0K0KLLL3$q'> $  e}rc^[5nURHYm[U4SjURTR55(dM6U(a UTS:XdMHUR T5 M[ [ U5$)a= 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. c38># UHoSTS:gv M g7frrArs rr,MigrationGraph.leaf_nodes..sM0Lq6T!W$0Lrr)rrTrrSrr4r)rrleavesrXs @r leaf_nodesMigrationGraph.leaf_nodess_JJDM d0C0L0LMMM3$q'> 4  f~rc[UR5nU(aUR5nU/nU(aUSnURURHqnUR nX#;a4X3R U5Sn[SRSU555eX!;dMOURU5 URU5 O UR5nU(aMU(aMgg)Nr.c3,# UH nSU-v M g7f)z%s.%sNrA)rrxs rr3MigrationGraph.ensure_not_cyclic..s%A5agk5s) rrTrerSrr indexrjoinrrf)rtodorXrtopr5cycles rensure_not_cyclic MigrationGraph.ensure_not_cyclic s4::88:DFEBi!]]3/88E!99D} %kk$&7&9 :5 II%A5%AA| T* D)9!99;D!%drc(SUR5-$)NzGraph: %s nodes, %s edges)_nodes_and_edgesr!s rr*MigrationGraph.__str__&s*T-B-B-DDDrclUR5upSURR<SU<SU<S3$)Nr-z: nodes=z, edges=>)rr/r0)rrTedgess rr1MigrationGraph.__repr__)s+,,. u-1^^-D-DeUSSrc[UR5[SURR 5554$)Nc3L# UHn[UR5v M g7fr )lenr)rrXs rr2MigrationGraph._nodes_and_edges...s $ *@$C  *@s"$)rrTsumrSrvr!s rrMigrationGraph._nodes_and_edges-s84::$ *.--*>*>*@$ !   rc/nUHAnURU5H)nXS;dM U(dXQ;dMURU5 M+ MC U$r )rr)rrTat_endplanrXrWs r_generate_planMigrationGraph._generate_plan2sFD!//5 (f 8NKK *6 rcUc[UR55nU(d [5$[US[5(dU/nUR X5n[US9nUH nUR URUSS9nM" U$)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. r) real_appsF)preserve)listrrrwtuplerrT mutate_state)rrTrrr project_staterXs r make_stateMigrationGraph.make_state:s =*+E> !%(E**GE""51$y9 D JJt,99-RW9XMrcXR;$r )rT)rrXs r __contains__MigrationGraph.__contains__Lszz!!rrR)F)Tr )NTN)r0r<r=r>r?rrYr\rarmrsr_rrr~rrrr*r1rrrrr@rArrrOrO?sl,$  (.!;F!5JV9I(  '2ET $"rrON) functoolsrdjango.db.migrations.stater exceptionsrrr rCrOrArrrsB$3B!!!!!!HRR$N"N"r