OwlCyberSecurity - MANAGER
Edit File: graph.cpython-39.pyc
a ���e�2 � @ s\ d dl mZ d dlmZ ddlmZmZ eG dd� d��ZG dd� de�ZG d d � d �Z d S ) � )�total_ordering)� ProjectState� )�CircularDependencyError�NodeNotFoundErrorc @ sX e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dd� Z dd� Z dd� Z dS )�Nodezp A single node in the migration graph. Contains direct links to adjacent nodes in either direction. c C s || _ t� | _t� | _d S �N)�key�set�children�parents)�selfr � r �[/home/gouroczh/virtualenv/pat/3.9/lib/python3.9/site-packages/django/db/migrations/graph.py�__init__ s z Node.__init__c C s | j |kS r �r �r �otherr r r �__eq__ s z Node.__eq__c C s | j |k S r r r r r r �__lt__ s z Node.__lt__c C s t | j�S r )�hashr �r r r r �__hash__ s z Node.__hash__c C s | j | S r r )r �itemr r r � __getitem__ s zNode.__getitem__c C s t | j�S r )�strr r r r r �__str__ s z Node.__str__c C s d| j j| jd | jd f S )Nz<%s: (%r, %r)>r r )� __class__�__name__r r r r r �__repr__# s z Node.__repr__c C s | j �|� d S r )r �add)r �childr r r � add_child& s zNode.add_childc C s | j �|� d S r )r r )r �parentr r r � add_parent) s zNode.add_parentN) r � __module__� __qualname__�__doc__r r r r r r r r" r$ r r r r r s r c s( e Zd ZdZ� fdd�Zdd� Z� ZS )� DummyNodea 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 s t � �|� || _|| _d S r )�superr �origin� error_message)r r r* r+ �r r r r 6 s zDummyNode.__init__c C s t | j| j| jd��d S )N)r* )r r+ r r* r r r r � raise_error; s zDummyNode.raise_error)r r% r& r' r r- � __classcell__r r r, r r( - s r( c @ s� e Zd ZdZdd� Zdd� Zdd� Zd+d d �Zd d � Zd d� Z dd� Z dd� Z dd� Z d,dd�Z d-dd�Zd.dd �Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd/d'd(�Zd)d*� ZdS )0�MigrationGraphaH 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 C s i | _ i | _d S r )�node_map�nodesr r r r r V s zMigrationGraph.__init__c C s. || j vsJ �t|�}|| j |< || j|< d S r )r0 r r1 )r r � migration�noder r r �add_nodeZ s zMigrationGraph.add_nodec C s$ t |||�}|| j|< d | j|< d S r )r( r0 r1 )r r r* r+ r3 r r r �add_dummy_node` s z MigrationGraph.add_dummy_nodeFc C s� || j vr$d||f }| �|||� || j vrHd||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 afterward. z=Migration %s dependencies reference nonexistent child node %rz>Migration %s dependencies reference nonexistent parent node %rN)r1 r5 r0 r$ r" �validate_consistency)r r2 r! r# Zskip_validationr+ r r r �add_dependencye s �� ��z MigrationGraph.add_dependencyc C s� t |�}z| j| }W n6 tyL } z td|f |�|�W Y d}~n d}~0 0 |D ]�}| j�|d� | j�|d�}|rR|jD ].}|j�|� |j |vr||� |� |� |� q||jD ].}|j�|� |j |vr�|� |� |� |� q�qRdS )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 r0 �KeyErrorr r1 �popr r �remover r" r$ ) r � replacement�replaced�replacement_node�errZ replaced_key� replaced_noder! r# r r r �remove_replaced_nodes| s4 ��� z$MigrationGraph.remove_replaced_nodesc C s� | j �|d� z| j�|�}W n6 tyT } z td|f |�|�W Y d}~n d}~0 0 t� }t� }|D ](}| j�|�}|rf|�|� ||jO }qf||8 }|j D ].} | j� |� |D ]}|� | � | � |� q�q�|jD ]} | j � |� q�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.) r1 r9 r0 r8 r r �getr r r r: r" r$ ) r r; r< r= r> Zreplaced_nodesZreplaced_nodes_parentsr r? r! r# r r r �remove_replacement_node� s6 ��� z&MigrationGraph.remove_replacement_nodec C s dd� | j �� D � dS )z7Ensure there are no dummy nodes remaining in the graph.c S s g | ]}t |t�r|�� �qS r )� isinstancer( r- ��.0�nr r r � <listcomp>� � z7MigrationGraph.validate_consistency.<locals>.<listcomp>N)r0 �valuesr r r r r6 � s z#MigrationGraph.validate_consistencyc C s* || j vrtd|f |��| �| j| �S )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. �Node %r not a valid node�r1 r � iterative_dfsr0 �r �targetr r r � forwards_plan� s z MigrationGraph.forwards_planc C s. || j vrtd|f |��| j| j| dd�S )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. rJ F)�forwardsrK rM r r r �backwards_plan� s z MigrationGraph.backwards_planTc C s� g }t � }|dfg}|r||�� \}}||v r.q|rJ|�|� |�|j� q|�|df� |dd� t|rl|jn|j�D �7 }q|S )z6Iterative depth-first search for finding dependencies.FTc S s g | ] }|d f�qS )Fr rD r r r rG � s �z0MigrationGraph.iterative_dfs.<locals>.<listcomp>)r r9 r �appendr �sortedr r )r �startrP �visitedZ visited_set�stackr3 � processedr r r rL � s � z MigrationGraph.iterative_dfsNc sR t � }| jD ]<� t� fdd�| j� jD ��r |r>|� d kr |�� � q t|�S )z� Return all root nodes - that is, nodes with no dependencies inside their app. These are the starting point for an app. c 3 s | ]}|d � d kV qdS �r Nr �rE r �r3 r r � <genexpr>� rH z,MigrationGraph.root_nodes.<locals>.<genexpr>r )r r1 �allr0 r r rS )r �app�rootsr rZ r � root_nodes� s � � zMigrationGraph.root_nodesc sR t � }| jD ]<� t� fdd�| j� jD ��r |r>|� d kr |�� � q t|�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. c 3 s | ]}|d � d kV qdS rX r rY rZ r r r[ rH z,MigrationGraph.leaf_nodes.<locals>.<genexpr>r )r r1 r\ r0 r r rS )r r] �leavesr rZ r � leaf_nodes� s � � zMigrationGraph.leaf_nodesc C s� t | j�}|r�|�� }|g}|r |d }| j| jD ]\}|j}||v rp||�|�d � }td�dd� |D ����||v r4|� |� |� |� q q4|�� }q q d S )N���z, c s s | ]}d | V qdS )z%s.%sNr rD r r r r[ rH z3MigrationGraph.ensure_not_cyclic.<locals>.<genexpr>) r r1 r9 r0 r r �indexr �joinrR r: )r �todor3 rV �topr! �cycler r r �ensure_not_cyclic s$ � z MigrationGraph.ensure_not_cyclicc C s d| � � S )NzGraph: %s nodes, %s edges)�_nodes_and_edgesr r r r r & s zMigrationGraph.__str__c C s | � � \}}d| jj||f S )Nz<%s: nodes=%s, edges=%s>)ri r r )r r1 �edgesr r r r ) s zMigrationGraph.__repr__c C s" t | j�tdd� | j�� D ��fS )Nc s s | ]}t |j�V qd S r )�lenr )rE r3 r r r r[ . s z2MigrationGraph._nodes_and_edges.<locals>.<genexpr>)rk r1 �sumr0 rI r r r r ri - s �z MigrationGraph._nodes_and_edgesc C s@ g }|D ]2}| � |�D ]"}||vr|s.||vr|�|� qq|S r )rO rR )r r1 �at_end�planr3 r2 r r r �_generate_plan2 s z MigrationGraph._generate_planc C sj |du rt | �� �}|s t� S t|d t�s2|g}| �||�}t|d�}|D ]}| j| j|dd�}qL|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)�listra r rC �tuplero r1 Z mutate_state)r r1 rm rp rn Z project_stater3 r r r � make_state: s zMigrationGraph.make_statec C s || j v S r )r1 )r r3 r r r � __contains__L s zMigrationGraph.__contains__)F)T)N)N)NTN)r r% r& r' r r4 r5 r7 r@ rB r6 rO rQ rL r_ ra rh r r ri ro rs rt r r r r r/ ? s( #% r/ N) � functoolsr Zdjango.db.migrations.stater � exceptionsr r r r( r/ r r r r �<module> s $