|
Server : Apache System : Linux iad1-shared-b8-43 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64 User : dh_edsupp ( 6597262) PHP Version : 8.2.26 Disable Function : NONE Directory : /lib/python3/dist-packages/django/db/migrations/__pycache__/ |
Upload File : |
o
3�a�� � @ s� d dl Z d dlZd dlmZ d dlmZ d dlmZ d dlm Z d dl
m Z d dl m
Z
d dlmZ d d lmZ d d
lmZmZ d d lmZ G d d
� d
�ZdS )� N)�chain)�settings)�models)�
operations)� Migration)�AlterModelOptions)�MigrationOptimizer)�MigrationQuestioner)�COMPILED_REGEX_TYPE� RegexObject)�stable_topological_sortc @ st e Zd ZdZdXdd�ZdYdd�Zdd� Zd d
� ZdZd d �Zd
d� Z dd� Z
e dd� �Z dXdd�Z
dd� Zdd� Zdd� Zd[d d �Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Zd2d3� Z d4d5� Z d6d7� Z d8d9� Z d:d;� Z d<d=� Z!d>d?� Z"d@dA� Z#dBdC� Z$dDdE� Z%dFdG� Z&dHdI� Z'dJdK� Z(dLdM� Z)dNdO� Z*dPdQ� Z+dXdRdS�Z,dTdU� Z-e.dVdW� �Z/dS )\�MigrationAutodetectora
Take a pair of ProjectStates and compare them to see what the first would
need doing to make it match the second (the second usually being the
project's current state).
Note that this naturally operates on entire projects at a time,
as it's likely that changes interact (for example, you can't
add a ForeignKey without having a migration to add the table it
depends on first). A user interface may offer single-app usage
if it wishes, with the caveat that it may not always be possible.
Nc C s. || _ || _|p
t� | _dd� |jD �| _d S )Nc S s h | ]\}}|�qS � r )�.0�app�modelr r �C/usr/lib/python3/dist-packages/django/db/migrations/autodetector.py� <setcomp>! � z1MigrationAutodetector.__init__.<locals>.<setcomp>)�
from_state�to_stater �
questionerr �
existing_apps)�selfr r r r r r �__init__ s z MigrationAutodetector.__init__c C s. | � ||�}| �|||�}|r| �||�}|S )z�
Main entry point to produce a list of applicable changes.
Take a graph to base names on and an optional set of apps
to try and restrict to (restriction is not guaranteed)
)�_detect_changes�arrange_for_graph�
_trim_to_apps)r �graph� trim_to_apps� convert_apps�migration_name�changesr r r r" # s
z MigrationAutodetector.changesc s t |t�r� fdd�|D �S t |t�r t� fdd�|D ��S t |t�r.� fdd�|�� D �S t |tj�rB|j� �|j �� �|j
�fS t |t �rKt |�S t |t
�rR|S t|d�r�|�� }t |tj�rg|dd � }|\}}}|� fd
d�|D �� fd d�|�� D �fS |S ) z�
Recursive deconstruction for a field and its arguments.
Used for full comparison for rename/alter; sometimes a single-level
deconstruction will not compare correctly.
c � g | ]}� � |��qS r ��deep_deconstruct�r �value�r r r �
<listcomp>6 � z:MigrationAutodetector.deep_deconstruct.<locals>.<listcomp>c 3 s � | ]}� � |�V qd S �Nr$ r& r( r r � <genexpr>8 s � z9MigrationAutodetector.deep_deconstruct.<locals>.<genexpr>c � i | ]
\}}|� � |��qS r r$ �r �keyr' r( r r �
<dictcomp>: �
��z:MigrationAutodetector.deep_deconstruct.<locals>.<dictcomp>� deconstruct� Nc r# r r$ r& r( r r r) N r* c r- r r$ r. r( r r r0 O r1 )�
isinstance�list�tuple�dict�items� functools�partial�funcr% �args�keywordsr
r �type�hasattrr2 r �Field)r �obj�
deconstructed�pathr< �kwargsr r( r r% / s4
�
�� z&MigrationAutodetector.deep_deconstructc C sJ g }t |�� �D ]\}}| �|�}|jr |jjr |d d= |�|� q|S )z�
Return a definition of the fields that ignores field names and
what related fields actually relate to. Used for detecting renames (as
the related fields change during renames).
� �to)�sortedr8 r% � remote_fieldr �append)r �fields�
fields_def�name�field�deconstructionr r r � only_relation_agnostic_fieldsW s
z3MigrationAutodetector.only_relation_agnostic_fieldsc C s i | _ i | _i | _| jj| _| jj| _t � | _
t � | _ t � | _ t � | _
t � | _t � | _| jjD ]3\}}| j�||�}|jjsG| j �||f� q/|| jjvrb|jjrZ| j �||f� q/| j
�||f� q/| jjD ]9\}}| j�||�}|jjs| j�||f� qg|| jjvs�|r�||v r�|jjr�| j�||f� qg| j
�||f� qg| �� | �� | �� | �� | �� | � � | � � | � � | � � | � � | �!� | �"� | �#� | �$� | �%� | �&� | �'� | �(� | �)� | �*� | �+� | �,� | �-� | �.� | �/|� | �0� | j1S )aX
Return a dict of migration plans which will achieve the
change from from_state to to_state. The dict has app labels
as keys and a list of migrations as values.
The resulting migrations aren't specially named, but the names
do matter for dependencies inside the set.
convert_apps is the list of apps to convert to use migrations
(i.e. to make initial migrations for, in the usual case)
graph is an optional argument that, if provided, can help improve
dependency generation and avoid potential circular dependencies.
)2�generated_operations�altered_indexes�altered_constraintsr �
concrete_apps�old_appsr �apps�new_apps�set�old_model_keys�old_proxy_keys�old_unmanaged_keys�new_model_keys�new_proxy_keys�new_unmanaged_keysr � get_model�_meta�managed�add� real_apps�proxy�generate_renamed_models�_prepare_field_lists�_generate_through_model_map�generate_deleted_models�generate_created_models�generate_deleted_proxies�generate_created_proxies�generate_altered_options�generate_altered_managers�create_altered_indexes�create_altered_constraints� generate_removed_constraints�generate_removed_indexes�generate_renamed_fields�generate_removed_fields�generate_added_fields�generate_altered_fields�&generate_altered_order_with_respect_to� generate_altered_unique_together� generate_altered_index_together�generate_added_indexes�generate_added_constraints�generate_altered_db_table�_sort_migrations�_build_migration_list�_optimize_migrations�
migrations)r r r �al�mnr r r r r e sv
� ��
z%MigrationAutodetector._detect_changesc s` � j � j@ � _� j� j@ � _� j� j@ � _i � _ � fdd�� jD �� _
� fdd�� jD �� _ dS )z�
Prepare field lists and a list of the fields that used through models
in the old state so dependencies can be made from the through model
deletion to the field that uses it.
c s@ h | ] \}}� j j|� j�||f|�f jD ]}|||f�qqS r )r r �renamed_models�getrJ �r � app_label�
model_name�
field_namer( r r r � s �����z=MigrationAutodetector._prepare_field_lists.<locals>.<setcomp>c s2 h | ]\}}� j j||f jD ]}|||f�qqS r )r r rJ r� r( r r r � s ���N) rX r[ �kept_model_keysrY r\ �kept_proxy_keysrZ r] �kept_unmanaged_keys�
through_users�old_field_keys�new_field_keysr( r r( r re � s
�
�z*MigrationAutodetector._prepare_field_listsc C s� t | j�D ]L\}}| j�||f|�}| jj||f }|jD ]3}| j�||�j �
|�}t |d�rPt |j
dd�rP|j
jj jsP|j
jj j|j
jj jf}|||f| j|< q qdS )z Through model map generation.rH �throughN)rG rX r� r� r r rJ rT r^ r_ � get_fieldr? �getattrrH r� � auto_createdr� r� r� )r r� r� �old_model_name�old_model_stater� � old_field� through_keyr r r rf � s
�
����z1MigrationAutodetector._generate_through_model_mapc C sH | d dkr
| dfS t t| d ��d�\}}||�� f| dd� dfS ) zp
Return the resolved dependency and a boolean denoting whether or not
it was swappable.
r � __setting__Fr3 �.rE NT)r� r �split�lower)�
dependency�resolved_app_label�resolved_object_namer r r �_resolve_dependency� s z)MigrationAutodetector._resolve_dependencyc C s\ i | _ tdd� | j�� D ��}d}|�r,t| j�D ]�}g }t� }t| j| �D ]�}d}t� } |jD ]v}
|
} | �|
�\}
} |
d |kr�| j� |
d g �D ] }
| �
|
|
�rWd} nqK|s\ nL| rj| � | d | d f� q1|
d | j v r�| � |
d | j |
d d j f� q1|r�|r�|�
|
d �r�| � |�
|
d �d � q1| � |
d df� q1d}q1|r�|�|� |�| � | j| d= q' |s�|�r| j| r�|r�td tfg g d
��}|d t| j � |g ��d |�}t|�|_||_|| jv|_| j �|g ��|� d}q|| j| | j|< qtd d� | j�� D ��}||k�r&|�s d}ntd
| j ��|}|sdS dS )ag
Chop the lists of operations up into migrations with dependencies on
each other. Do this by going through an app's list of operations until
one is found that has an outgoing dependency that isn't in another
app's migration yet (hasn't been chopped off its list). Then chop off
the operations before it into a migration and move onto the next app.
If the loops completes without doing anything, there's a circular
dependency (which _should_ be impossible as the operations are
all split at this point so they can't depend and be depended on).
c s � � | ]}t |�V qd S r+ ��len�r �xr r r r, � � z>MigrationAutodetector._build_migration_list.<locals>.<genexpr>FTr r3 ���� __first__r )r � dependencieszauto_%ic s r� r+ r� r� r r r r, G r� z)Cannot resolve operation dependencies: %rN)r~ �sumrP �valuesrG rW r5 �
_auto_depsr� r� �check_dependencyra rL �
leaf_nodesrI �updater> r r� r� r r �initial�
setdefault�
ValueError)r r �num_ops� chop_moder� �choppedr� � operation�deps_satisfied�operation_dependencies�dep� original_dep�is_swappable_dep�other_operation�subclass�instance� new_num_opsr r r r| � sl
�$�
�
�z+MigrationAutodetector._build_migration_listc C s� t | j�� �D ]=\}}dd� |D �}|D ]'}|jD ]!}| �|�d }|d |kr:|D ]}| �||�r9|| �|� q*qqt||�| j|< qdS )z{
Reorder to make things possible. Reordering may be needed so FKs work
nicely inside the same app.
c S s i | ]}|t � �qS r )rW )r �opr r r r0 V r z:MigrationAutodetector._sort_migrations.<locals>.<dictcomp>r N)rG rP r8 r� r� r� ra r )r r� �ops�dependency_graphr� r� �op2r r r r{ O s
��
�z&MigrationAutodetector._sort_migrationsc C s� | j �� D ]\}}t||dd � �D ]
\}}|j�||jf� qq| j �� D ]}|D ]
}tt|j��|_q*q&| j �� D ]\}}|D ] }t � �
|j |�|_ qAq;d S )Nr3 ) r~ r8 �zipr� rI rL r� r5 rW r �optimizer )r r� r~ �m1�m2� migrationr r r r} d s ����z*MigrationAutodetector._optimize_migrationsc s � d du r� d du rt |tj�o|j� d �� kS � d durZ� d du rZt |tj�oA|j� d �� koAt� fdd�|jD ��pYt |tj�oY|j� d �� koY|j� d �� kS � d dur~� d du r~t |tj �o}|j� d �� ko}|j� d �� kS � d du r�� d du r�t |tj
�o�|j� d �� kS � d dur�� d d kr�t |tj �o�|j� d �� ko�|j� d �� kS � d dur� d d
kr�t |tj �o�|j� d �� ko�|j
p�d �� � d �� kS � d du�r� d d k�rt |tjtjf��o|j� d �� kS td
� f ��)zn
Return True if the given operation depends on the given dependency,
False otherwise.
rE N� Tr3 c 3 s � | ] \}}� d |kV qdS )rE Nr )r r� �y�r� r r r, � s � z9MigrationAutodetector.check_dependency.<locals>.<genexpr>F�alter�order_wrt_unset� �foo_together_changezCan't handle dependency %r)r4 r � CreateModel�
name_lowerr� �anyrJ �AddField�model_name_lower� RemoveField� DeleteModel�
AlterField�AlterOrderWithRespectTo�order_with_respect_to�AlterUniqueTogether�AlterIndexTogetherr� )r r� r� r r� r r� t sX � �� ��
�� � �� �� ��z&MigrationAutodetector.check_dependencyFc C s@ |pg |_ |r| j�|g ��d|� d S | j�|g ��|� d S )Nr )r� rP r� �insertrI )r r� r� r� � beginningr r r �
add_operation� s
z#MigrationAutodetector.add_operationc C s� zB| j �|d |d �}dd� |jD �}d|d |d f }|jjs3d|v s3d|v s3tj�� |�� kr@d|d d|d fW S W |S tyL Y |S w ) z|
Place potential swappable models first in lists of created models (only
real way to solve #22783).
r r3 c S s g | ]}|j �qS r )�__name__)r �baser r r r) � s z=MigrationAutodetector.swappable_first_key.<locals>.<listcomp>�%s.%s� AbstractUser�AbstractBaseUser�___) rV r^ � __bases__r_ � swappabler �AUTH_USER_MODELr� � LookupError)r �itemr �
base_names�string_versionr r r �swappable_first_key� s �� ��z)MigrationAutodetector.swappable_first_keyc C sL i | _ i | _| j| j }t|�D ]�\}}| jj||f }| �|j�}| j| j }|D ]x\}}||kr�| j j||f } | �| j�}
||
kr�| j
� | |�r�| j �
||�j} g } | �� D ]
}
|
jrf| �| �|
�� qY| j|tj| j|jd�| d� || j ||f< d| j| jf }d|j|jf | j|< | j�||f� | j�||f� nq*qdS )z�
Find any renamed models, generate the operations for them, and remove
the old entry from the model lists. Must be run before other
model-level generation.
)�old_name�new_name�r� r� N)r� �renamed_models_relr[ rX rG r r rO rJ r r �ask_rename_modelrV r^ r_ �
get_fields� is_relation�extend�!_get_dependencies_for_foreign_keyr� r � RenameModelrL r� r� �removera )r � added_modelsr� r� � model_state�model_fields_def�removed_models�
rem_app_label�rem_model_name�rem_model_state�rem_model_fields_def�
model_optsr� rM �renamed_models_rel_keyr r r rd � sR ���� ���z-MigrationAutodetector.generate_renamed_modelsc
s | j | jB }| j| }| j| }tt|| jdd�t|| jdd��}|D �]�\� �| jj� �f }| j �
� ��j }i �d}|j D ],}|j
rk|j
jrY|jrP|j
j}n |j
jsY|�|j< t|j
dd�rk|j
jj jsk|�|j< q?|jD ] }|j
jrz|�|j< t|j
dd�r�|j
jj js�|�|j< qo|j�d�} |j�d�}
|j�dd�} |j�dd�} |j�d d�}
� �dd
fg}|jD ]Q}t|t��r d |v �r |�d d �\}}|� ||ddf� | j j� ||f�}| jj� ||f�}|�r |�r t |j ��!|j ��"|j �}|D ] }|� |||d
f� q�q�|�r|� |j j#|j j$ddf� | j%� t&j'|j�fd
d�|j �(� D �|j|j|j)d�|dd� |j*�s>q#t��(� �D ]%\}}| �+|�}|� � �ddf� | j%� t&j,�||d�t-t |��d� �qD|
�r�| j%� t&j.�|
d�� �|
df� �ddfgd� � �fdd�t��D �}|� � �ddf� | D ]}| j%� t&j/�|d�|d� �q�|
D ]}| j%� t&j0�|d�|d� �q�| �r�| j%� t&j1�| d�|d� | �r�| j%� t&j2�| d�|d� � �f| j3v �r
|j4D ] }| j%|j5j j#t&j6|j5j j$|j7j|j7d�� �ddfgd� �q�q#dS )a�
Find all new models (both managed and unmanaged) and make create
operations for them as well as separate operations to create any
foreign key or M2M relationships (these are optimized later, if
possible).
Defer any model options that refer to collections of fields that might
be deferred (e.g. unique_together, index_together).
T)r/ �reverseNr� �indexes� constraints�unique_together�index_togetherr� Fr� r3 c s g | ]
}|d � vr|�qS )r r �r �d)�related_fieldsr r r) K s zAMigrationAutodetector.generate_created_models.<locals>.<listcomp>�rL rJ �options�bases�managers)r� r� )r� rL rM r� �rL r� c s g | ]}� �|d f�qS )Tr )r rL )r� r� r r r) t s
���r� �index�r� �
constraint�rL r �rL r )8rX rZ r[ r] r rG r� r r rV r^ r_ � local_fieldsrH r � primary_key� parent_linkrL r� r� r� �local_many_to_manyr �popr r4 �strr� rI r r� rW rJ �
difference� intersectionr� � object_namer� r r� r8 r r` r� r� r5 r� �AddIndex�
AddConstraintr� r� rY �related_objects�
related_modelr� rM )r �old_keysr� �added_unmanaged_models�all_added_modelsr� r� �primary_key_relrM r� r r r r� r� r� �base_app_label� base_name�old_base_model_state�new_base_model_state�removed_base_fields�removed_base_fieldrL �related_dependenciesr r �related_objectr )r� r� r r rh � s,
�
�
�
�
�
������
�
�
�
�� ��
��
�����
�
�� ��z-MigrationAutodetector.generate_created_modelsc
C s� | j | j }t|�D ]O\}}| jj||f }|j�d�s J �||ddfg}|jD ] }t|t �rDd|v rD|�
dd�\}}|� ||ddf� q(| j |t
j|jg |j|j|jd�|d� q
dS ) z�
Make CreateModel statements for proxy models. Use the same statements
as that way there's less code duplication, but for proxy models it's
safe to skip all the pointless field stuff and chuck out an operation.
rc NFr� r3 Tr r� )r\ rY rG r r r r� r r4 r r� rI r� r r� rL r ) r �addedr� r� r� r� r� r" r# r r r rj � s.
�
����z.MigrationAutodetector.generate_created_proxiesc C s8 | j | jB }| j| }| j| }tt|�t|��}|D ]�\}}| jj||f }| j� ||�}i } |j
j D ] }
|
j rT|
j j
rB|
| |
j< t|
j dd�rT|
j jj
jsT|
| |
j< q4|j
jD ] }
|
j j
rd|
| |
j< t|
j dd�rv|
j jj
jsv|
| |
j< qY|j�dd�} |j�dd�} | r�| �|tj|dd�� | r�| �|tj|dd�� t| �D ]
}
| �|tj||
d�� q�g }|j
jD ]%}|jj
j }|jj
j }|j j}|� |||df� |j s�|� |||d f� q�t| �D ] }
|� |||
df� q�| j!�"||j#f�}|�r|� |d
|d |d df� | j|tj$|jd
�t%t&|��d� qdS )a�
Find all deleted models (managed and unmanaged) and make delete
operations for them as well as separate operations to delete any
foreign key or M2M relationships (these are optimized later, if
possible).
Also bring forward removal of any model options that refer to
collections of fields - the inverse of generate_created_models().
r� Nr r r r �r� rL Fr� r r3 rE �rL r� )'r[ r] rX rZ r rG r r rT r^ r_ r rH r rL r� r� r� r r r r� r r� r� r� r r r� r rM rI � many_to_manyr� r� r� r� r5 rW )r �new_keys�deleted_models�deleted_unmanaged_models�all_deleted_modelsr� r� r� r r rM r r rL r� r) �related_object_app_labelr r� � through_userr r r rg � s�
�
�
����� ��
� �
��z-MigrationAutodetector.generate_deleted_modelsc C sX | j | j }t|�D ] \}}| jj||f }|j�d�s J �| �|tj |j
d�� q
dS )z*Make DeleteModel options for proxy models.rc r, N) rY r\ rG r r r r� r� r r� rL )r �deletedr� r� r� r r r ri % s ���z.MigrationAutodetector.generate_deleted_proxiesc
C s� i | _ t| j| j �D ]�\}}}| j�||f|�}| jj||f }| j� ||�j
� |�}| � |�}t| j| j �D ]�\}} }
||kr�| |kr�|j
|
} | � | �} |jrq|jjrqd| d v rq| d d }
|
| jv rq| j|
| d d< | �|
� | �� d }| |ks�| dd� |dd� kr�t| d |d�|d kr�| j�||
||�r�| �|tj||
|d�� | j�|| |
f� | j�|||f� |
| j |||f< nq9q dS )zWork out renamed fields.rF rE r3 r )� db_column)r� r� r� N)�renamed_fieldsrG r� r� r� r� r r rV r^ r_ r� r% rJ rH r r� �set_attributes_from_name�get_attname_columnr7 r �
ask_renamer� r � RenameFieldr� ra )r r� r� r� r� r� rM � field_decr� r� �rem_field_namer� �
old_field_dec�
old_rel_to�
old_db_columnr r r rq 2 sD
����z-MigrationAutodetector.generate_renamed_fieldsc C �. t | j| j �D ] \}}}| �|||� qdS )zMake AddField operations.N)rG r� r� �_generate_added_field�r r� r� r� r r r rs X � �z+MigrationAutodetector.generate_added_fieldsc C s� | j �||�j�|�}g }|jr |jjr |�| �|�� tj tj
tj f}|j p;|�
� p;|jp;|jo3|jp;t||�o;|j}|s[|�� }t||�rS|jrS| j�||�|_n| j�||�|_| j|tj||||d�|d� d S )N�r� rL rM �preserve_defaultr� ) rV r^ r_ r� rH r r� r� r � DateField�
DateTimeField� TimeField�null� has_defaultr- �blank�empty_strings_allowedr4 �auto_now�clone� auto_now_addr �ask_auto_now_add_addition�default�ask_not_null_additionr� r r� )r r� r� r� rM r� � time_fieldsrE r r r rA ] s2
���
�z+MigrationAutodetector._generate_added_fieldc C r@ )z Make RemoveField operations.N)rG r� r� �_generate_removed_fieldrB r r r rr | rC z-MigrationAutodetector.generate_removed_fieldsc C s2 | j |tj||d�|||df|||dfgd� d S )Nr+ r� r� r� )r� r r� rB r r r rT � s �
�
�z-MigrationAutodetector._generate_removed_fieldc sx t �j�j@ �D �]0\}}}�j�||f|�}�j�|||f|�}�j�||�j� |�}�j
�||�j� |�}g }t |d�r�t |j
dd�r�|j
jjj|j
jjjf���jv r\|j
j|j
_t |j
dd�} | r{�| f }
|
�jv r{|j
j|j
_|j
j|j
_t |dd�} | r�||f� t� �fdd�| D ��|_t��fdd�|jD ��|_|���|�� t |d�r�t |j
d d�r�|j
jjj|j
jjjf���jv r�|j
j|j
_��|�} ��|�}
| |
k�r9|jo�|j}|j o�|j }|s�|�r+d
}|j�r|j�s|�� �s|j�s|� � }�j � ||�}|t j u�r||_!d }n|}�j"|t#j$||||d �|d
� q��%|||� ��&|||� qdS )zp
Make AlterField operations, or possibly RemovedField/AddField if alter
isn's possible.
rH r Nr� � from_fieldsc � g | ] }�j �� |f |��qS r �r6 r� )r �
from_field)�from_rename_keyr r r r) � � ��zAMigrationAutodetector.generate_altered_fields.<locals>.<listcomp>c rV r rW )r �to_field)�
rename_keyr r r r) � rZ r� TFrD r� )'rG r� r� r� r� r6 rT r^ r_ r� rV r? r� rH r r� r� r� r6 rU � to_fieldsr� r� r� r% r- rI rJ rN r �ask_not_null_alterationr � NOT_PROVIDEDrQ r� r r� rT rA )r r� r� r� r� �old_field_namer� � new_fieldr� �remote_field_name�to_field_rename_keyrU r= �
new_field_dec�both_m2m� neither_m2mrE rM � new_defaultr )rY r\ r r rt � s�
�
�
�
�
� ��� ��z-MigrationAutodetector.generate_altered_fieldsc � t jj}t| j�D ]F\}}| j�||f|�}| jj||f }| j j||f }|j
| �|j
| � �fdd�� D �}� fdd��D �}| j � ||f||d�i� q d S )Nc � g | ]}|� vr|�qS r r �r �idx)� old_indexesr r r) � � z@MigrationAutodetector.create_altered_indexes.<locals>.<listcomp>c ri r r rj )� new_indexesr r r) � rm )�
added_indexes�removed_indexes)
r r � option_namerG r� r� r� r r r r rQ r� ) r rq r� r� r� r� �new_model_state�add_idx�rem_idxr )rn rl r rm � �
���z,MigrationAutodetector.create_altered_indexesc C �@ | j �� D ]\\}}}|d D ]
}| �|tj||d�� qqd S )Nro r )rQ r8 r� r r �r r� r� � alt_indexesr r r r rx � � ����z,MigrationAutodetector.generate_added_indexesc C �B | j �� D ]\\}}}|d D ]}| �|tj||jd�� qqd S )Nrp r+ )rQ r8 r� r � RemoveIndexrL rw r r r rp � ����z.MigrationAutodetector.generate_removed_indexesc rh )Nc ri r r �r �c)�old_constraintsr r r) rm zDMigrationAutodetector.create_altered_constraints.<locals>.<listcomp>c ri r r r} )�new_constraintsr r r) rm )�added_constraints�removed_constraints)
r r rq rG r� r� r� r r r r rR r� ) r rq r� r� r� r� rr �add_constraints�rem_constraintsr )r� r r rn ru z0MigrationAutodetector.create_altered_constraintsc C rv )Nr� r
)rR r8 r� r r �r r� r� �alt_constraintsr r r r ry ry z0MigrationAutodetector.generate_added_constraintsc C rz )Nr� r+ )rR r8 r� r �RemoveConstraintrL r� r r r ro ) r| z2MigrationAutodetector.generate_removed_constraintsc C s� t |dd �}|d urd}|}n |jjjj}|jjjj}||d dfg}t |jdd �r@|jjjjs@|�|jjjj|jjjjd df� |S )N�swappable_settingr� Tr� ) r� rH r r_ r� r r� r� rI )r rM r� �
dep_app_label�dep_object_namer� r r r r� 4 s
�z7MigrationAutodetector._get_dependencies_for_foreign_keyc s |j }t�j�D ]}\� ��j�� �f��}�jj� |f }�jj� �f }|j�|�}|r8� ��fdd�|D �nt � }|j�|�}|rGt |�nt � }||kr�g }|D ]!} | D ] }
�j
� � ��j �
|
�} | jrr| jjrr|���| �� qVqR�j� |dd�i||i��|d� qd S )Nc s& h | ]}t � ��fd d�|D ���qS )c 3 s$ � | ]
}�j �� �|f|�V qd S r+ rW )r �n�r� r� r r r r, Q s
� �
�zQMigrationAutodetector._generate_altered_foo_together.<locals>.<setcomp>.<genexpr>)r6 )r �uniquer� r r r P s ���zGMigrationAutodetector._generate_altered_foo_together.<locals>.<setcomp>rL r� r )rq rG r� r� r� r r r r rW rV r^ r_ r� rH r r� r� r� ) r r� rq r� r� rr � old_value� new_valuer� �
foo_togethersr� rM r r� r � _generate_altered_foo_togetherG sD ��� �������z4MigrationAutodetector._generate_altered_foo_togetherc C � | � tj� d S r+ )r� r r� r( r r r rv l � z6MigrationAutodetector.generate_altered_unique_togetherc C r� r+ )r� r r� r( r r r rw o r� z5MigrationAutodetector.generate_altered_index_togetherc C s� | j �| j| j�}t|�D ]8\}}| j�||f|�}| jj||f }| j j||f }|j
�d�}|j
�d�}||krE| � |t j
||d�� q
d S )N�db_table)rL �table)r� �unionr� r� rG r� r� r r r r r� r �AlterModelTable) r �models_to_checkr� r� r� r� rr �old_db_table_name�new_db_table_namer r r rz r s" ����z/MigrationAutodetector.generate_altered_db_tablec C s� | j �| j| j| j| j@ | j| j@ �}t|�D ]@\}}| j �
||f|�}| j j ||f }| j
j ||f }dd� |j�� D �}dd� |j�� D �}||krW| �|tj||d�� qdS )z�
Work out if any non-schema-affecting options have changed and make an
operation to represent them in state changes (in case Python code in
migrations needs them).
c S � i | ] \}}|t jv r||�qS r �r �ALTER_OPTION_KEYSr. r r r r0 � �
�zBMigrationAutodetector.generate_altered_options.<locals>.<dictcomp>c S r� r r� r. r r r r0 � r� )rL r N)r� r� r� r� rZ r[ rX r] rG r� r� r r r r r8 r� r r ) r r� r� r� r� r� rr � old_options� new_optionsr r r rk � s4
� ������z.MigrationAutodetector.generate_altered_optionsc C s� t | j�D ]N\}}| j�||f|�}| jj||f }| jj||f }|j�d�|j�d�krSg }|j�d�rB|�|||jd df� | j |t
j ||j�d�d�|d� qd S )Nr� Tr
r� ) rG r� r� r� r r r r rI r� r r� )r r� r� r� r� rr r� r r r ru � s2
� �
����z<MigrationAutodetector.generate_altered_order_with_respect_toc C sn t | j�D ]/\}}| j�||f|�}| jj||f }| jj||f }|j|jkr4| �|t j
||jd�� qd S )N)rL r ) rG r� r� r� r r r r r� r �AlterModelManagers)r r� r� r� r� rr r r r rl � s ����z/MigrationAutodetector.generate_altered_managersc st |� � }i � t|�� �D ]�\}}|sq d}|D ] }|d |kr#|} nq|du r@| j�|�s@|D ] } |df� || jf< q0||= q |du rGd}
n | �|d �pOdd }
t|�D ]I\} } | dkrf|rf| j� |� d|
g} |rs| � |� n| dkr|s| � d� n | � | �
� dd� � d� | �}
||
f� || jf< |
d7 }
|
| _qVq |� � D ]}|D ]
} � fd d
�| jD �| _q�q�|S ) z�
Take a result from changes() and a MigrationGraph, and fix the names
and dependencies of the changes so they extend the graph from the leaf
nodes for each app.
Nr r� r3 z%04ir� �d �_c s g | ]}� � ||��qS r �r� r ��name_mapr r r) � rm z;MigrationAutodetector.arrange_for_graph.<locals>.<listcomp>)
r� r5 r8 r � ask_initialrL � parse_number� enumerater� rI � suggest_name�joinr� )r r" r r! �leavesr� r~ �app_leaf�leafr� � next_number�i�new_name_partsr� r r� r r � sL �
� �z'MigrationAutodetector.arrange_for_graphc
s� i � |� � D ]\}}|D ]}|jD ]\}}� �|t� ��|� qq qt|�}d} | |kr@t|�} |j� fdd�|D �� | |ks,t|�D ] }||vrM||= qD|S )a1
Take changes from arrange_for_graph() and set of app labels, and return
a modified set of changes which trims out as many migrations that are
not in app_labels as possible. Note that some other migrations may
still be present as they may be required dependencies.
Nc s g | ]}� � |d ��qS )r r� )r r� ��app_dependenciesr r r) rm z7MigrationAutodetector._trim_to_apps.<locals>.<listcomp>)r8 r� r� rW ra r� r5 )
r r" �
app_labelsr� r~ r� r� rL �
required_apps�old_required_appsr r� r r s$ ��� �z#MigrationAutodetector._trim_to_appsc C s t �d|�}|rt|d �S dS )z�
Given a migration name, try to extract a number from the beginning of
it. If no number is found, return None.
z^\d+r N)�re�match�int)�clsrL r� r r r r� s z"MigrationAutodetector.parse_numberr+ )NNN)NN)NF)0r� �
__module__� __qualname__�__doc__r r" r% rO r re rf � staticmethodr� r| r{ r} r� r� r� rd rh rj rg ri rq rs rA rr rT rt rm rx rp rn ry ro r� r� rv rw rz rk ru rl r r � classmethodr� r r r r r
s^
(
a
W
?. /!Y
& S %$
2r
)r9 r� � itertoolsr � django.confr � django.dbr �django.db.migrationsr � django.db.migrations.migrationr �&django.db.migrations.operations.modelsr � django.db.migrations.optimizerr � django.db.migrations.questionerr �django.db.migrations.utilsr
r � django.utils.topological_sortr r
r r r r �<module> s