:QgddlZddlmZddlmZddlmZmZmZmZm Z m Z m Z m Z m Z mZddlmZej"eZdZddd Zhd Zd ZGd d eZGddeZGddeZGddeZGddeZGddZGddZGddeZ GddeZ!Gdde Z"Gd d!eZ#Gd"d#e#Z$Gd$d%e#Z%Gd&d'eZ&y)(N)Mapping)copy) RemapDictstrings short_repr notpresentget_type numpy_numbersnpliteral_eval_extendeddict_ SetOrdered)stringify_elementfakedownup)rr> unprocessed type_changesset_item_addedvalues_changedattribute_addedset_item_removedattribute_removedrepetition_changeiterable_item_addediterable_item_moveddictionary_item_addediterable_item_removeddictionary_item_removedz__internal:custom:extra_infoc eZdZy) DoesNotExistN__name__ __module__ __qualname__K/var/www/html/answerous/venv/lib/python3.12/site-packages/deepdiff/model.pyr!r!!r'r!ceZdZdZy) ResultDictcn|jDcgc] \}}|r | }}}|D]}||=ycc}}w)zy Remove empty keys from this object. Should always be called after the result is final. :return: N)items)selfkv empty_keyss r(remove_empty_keyszResultDict.remove_empty_keys's> %)JJL:DAqa: : AQ ;s 11N)r#r$r%r2r&r'r(r+r+%sr'r+c$eZdZdZdZdZdZy) TreeResultc4tD]}t||<yN) REPORT_KEYSr)r.keys r(__init__zTreeResult.__init__3s %C" DI %r'c2|jdr|jdr|dDcic]}|j|}}|dDcic]}|j|}}t|t|z}|rd|vr t|d<|D]`}||}|dj |||}|dj ||j |_|dj |d|_bd|vr|ds|d=d|vr |ds|d=yyycc}wcc}w)ap There might be the same paths reported in the results as removed and added. In such cases they should be reported as value_changes. Note that this function mutates the tree in ways that causes issues when report_repetition=True and should be avoided in that case. This function should only be run on the Tree Result. rrrN)getpathsetrremovet2add report_type)r.i added_paths removed_paths mutual_pathsr< level_before level_afters r(*mutual_add_removes_to_become_value_changesz5TreeResult.mutual_add_removes_to_become_value_changes7sG 88) *txx8O/P045J0KL11668Q;LKL267N2OPQQVVXq[PMP{+c-.@@L 0 <)3%&$ <,T2 ,-44\B)$/ *+22;?"-.. %&**<8+; ( < #d *48O3P,- D (6K1L*+2M (!MPs D DcF||vr t||<|j|Sr6)rr;)r.items r( __getitem__zTreeResult.__getitem__Us# t #DJxx~r'c t|jDcgc]}t|tst | c}Scc}wr6)sumvalues isinstancerlen)r.rBs r(__len__zTreeResult.__len__Zs.DKKMOqZ:5NCFOPPOs A AN)r#r$r%r9rHrKrQr&r'r(r4r42s%,< Qr'r4cheZdZdZddZdZdZddZdZdZ d Z d Z d Z d Z d ZdZdZdZy) TextResultTNch||_|jt|j|jtgttt|j|jt t td |r|j |yy)N) rrrrrrrrrrrrr) verbose_levelupdater _TextResult__set_or_dictr_from_tree_results)r. tree_resultsrUs r(r9zTextResult.__init__as* !G%)%7%7%9'+'9'9';#g#(7%*W#(7#113!%!3!3!5 * (l!&    # #L 1 r'c8|jdk\riStS)N)rUrr.s r( __set_or_dictzTextResult.__set_or_dictws''1,r>*,>r'c|j||j|d|j|d|j||j||j|d|j|d|j ||j|d|j|d|j ||j ||j||j||j|y) Populate this object by parsing an existing reference-style result dictionary. :param tree: A TreeResult :return: rrrrrrN) _from_tree_type_changes_from_tree_default_from_tree_value_changed_from_tree_unprocessed_from_tree_iterable_item_moved_from_tree_set_item_removed_from_tree_set_item_added_from_tree_repetition_change_from_tree_deep_distance_from_tree_custom_resultsr.trees r(rXzTextResult._from_tree_resultszs $$T* &=> &?@ %%d+ ##D) &;< &=> ++D1 &78 &9: ((. &&t, ))$/ %%d+ &&t,r'c<||vr||D] }|r*|dvr&|jjt|dvr0|jtur |j}n |j }||}t |tr&|j|jtt |tr|||jt<t |tr&|j|jttdj|yy)N>rrforce_iterable_opcodesz'Cannot handle {} report container type.)rr< FORCE_DEFAULTr?rt1rOrr@dictlistappend TypeErrorformat)r.rkrAignore_if_in_iterable_opcodeschangerJreports r(razTextResult._from_tree_defaults $ {+ 42#'WW ];tDW?XX99J.!99D!99Dk*fj1JJv{{{?@-?CF6;;];;<-MM&++M+"BC$$M$*F6N447 4 r'cd|vr|dD]}|jt}t|jturd}|j}|j}n,d}t |j}t |j}t ||d}|jdkDr!|jdt}||k7r||d<||d|<|js|s|j|j|j yy) NrrmFTold_typenew_typeuse_t2rnnew_path old_value new_value) r<rptyperqr?r rrUrV) r.rkrxr<include_valuesr|r} remap_dictrs r(r`z"TextResult._from_tree_type_changess T !~. P{{{7 ?d*%*N%yyH%yyH%)N' 2H' 2H& ( (( %%)%{{$m{LHx'19 :.-7^$T*%%.%% VYY%O) P "r'cnd|vr|jdkDr|dD]}|jt}|j|jd}|jdkDr!|jdt}||k7r||d<||d|<d |j vsy|j d |j d iyyy) Nrrrmrrr~Trrdiff)rUr<rpr?rq additionalrV)r.rkrxr< the_changedrs r(rbz#TextResult._from_tree_value_changeds t #(:(:Q(>/0 L{{{7,2IIFIIN %%)%{{$m{LHx'2: J//:%&t,V...&&0A0A&0I'JK L)? #r'cd|vrV|jdkDrF|dD]=}|jd|jd}||d|jt<?yyy)Nrr~Trrvaluerm)rUr<r?rpr.rkrxrs r(rdz)TextResult._from_tree_iterable_item_movedst D (T-?-?!-C45 8+1;;d;+CfiiX ,7*+FKK'-8-)* 8.D (r'cd|vrX|dD]O}|djdj|jt|j|j Qyy)Nrz {}: {} and {}rm)rtrvr<rprqr?)r.rkrxs r(rcz!TextResult._from_tree_unprocessedsj D }- A]#**?+A+A&++'CNC)*0))VYY,@A A !r'c ||vr||}t|t}||D]}|jj}|dk(r |jn |j }|j rt|trd|z}|r&||vr t||<||j||jdj|t|yy)Nrz'%s'z{}[{}]) rOrrr<r?rqADD_QUOTES_TO_STRINGSrr=r@rvstr)r.rkr8 set_item_infois_dictrxr<rJs r($_from_tree_set_item_added_or_removedz/TextResult._from_tree_set_item_added_or_removeds $; IM 8Gs) Hyy~~$'+;$;vyy--*T72K!D=D=0.1e d+!$'++D1!%%hoodCI&FG H r'c*|j|dy)Nrr8rrjs r(rfz$TextResult._from_tree_set_item_addeds 11$ &?@ %%d+     : :+>_ ; a  : :-@c ; e  # #D*?_c # d  # #D*Aae # f  / / 5 &78 &9: ((. &&t, ))$/r'c ||vr_||D]V}|jtur |j}n |j}|jtd\}}} |||} || |<Xyy#t $rt x} |||<Y&wxYw)NT)rnget_parent_too)r?rrqr<rpKeyErrorr ) r.rkrArrxrJr<param_rs r(rz5DeltaResult._from_tree_iterable_item_added_or_removedPs $ {+ >99J.!99D!99D"(=QU!VeQ]6:;K6LT6R3:>/6 >  ]UZU\\3d;K6LT6R]sA%%BBcd|vr\|dD]R}d}t|jturd}|j}|j}nt|j}t|j}d} |tvr=|jj |}t j||j }n!||j}||jk7}|jt}|jdt}t||d} ||k7r|| d<| |d|<|s|js,| j|j|jUyy#t$rYwxYw) NrFTrmrr{rr)rrqr?r r astyper array_equal Exceptionr<rprrrV) r.rkrxrr|r}new_t1r<rrs r(r`z#DeltaResult._from_tree_type_changescs_ T !~. P!% ?d*%*N%yyH%yyH' 2H' 2H%)N #}4%+YY%5%5h%?F13 1R-RN%-fii%8F.4vyy-@N{{{7!;;d-;H& ( (( 8#-5Jz*-7^$T*!T%?%?%% VYY%OA P "(%s4A&E## E/.E/cd|vrc|dD]Z}|jt}|jdt}|j|jd}||k7r||d<||d|<\yy)NrrmTrrr)r<rpr?rq)r.rkrxr<rrs r(rbz$DeltaResult._from_tree_value_changedsz t #/0 ;{{{7!;;d-;H,2IIFIIN 8#.6K +/:%&t,  ; $r'cd|vr]|dD]T}|jd\}}}t|jd}|j} |d|}|dD]}|||< Vyy#t$rt x}|d|<Y0wxYw)NrT)rrr new_indexes)r<rrrqrr ) r.rkrxr<rrrrindexs r(rgz(DeltaResult._from_tree_repetition_changes $ &23 C#[[[= a&v'8'8'FG  n6:;\6]^b6c3( 6CE=B3E:C C ' nfkfmm3d;\6]^b6cnsA##BBcd|vrl|dD]c}|jjt|dvs)|jd|jd}||d|jt<eyy)NrrmroTrr)rr<rpr?rs r(rdz*DeltaResult._from_tree_iterable_item_moveds D (45 <IINNN7tDW?XX/5{{${/GRXR[R["\K0;./ +1<1-.  < )r')NNFN) r#r$r%rr9rXrr`rbrgrdr&r'r(rrs.!2002>&"PH; C>> t1 = {2: 2, 4: 44} >>> t2 = {2: "b", 5: 55} >>> ddiff = DeepDiff(t1, t2, view='tree') >>> ddiff {'dictionary_item_added': {}, 'dictionary_item_removed': {}, 'type_changes': {}} Graph: ↑up ↑up | | | ChildRelationship | ChildRelationship | | ↓down ↓down .path() = 'root[5]' .path() = 'root[4]' Note that the 2 top level DiffLevel objects are 2 different objects even though they are essentially talking about the same diff operation. A ChildRelationship object describing the relationship between t1 and it's child object, where t1's child object equals down.t1. Think about it like a graph: +---------------------------------------------------------------+ | | | parent difflevel parent | | + ^ + | +------|--------------------------|---------------------|-------+ | | | up | | Child | | | ChildRelationship | Relationship | | | | down | | | +------|----------------------|-------------------------|-------+ | v v v | | child difflevel child | | | +---------------------------------------------------------------+ The child_rel example: # dictionary_item_removed is a set so in order to get an item from it: >>> (difflevel,) = ddiff['dictionary_item_removed']) >>> difflevel.up.t1_child_rel >>> (difflevel,) = ddiff['dictionary_item_added']) >>> difflevel >>> difflevel.up >>> >>> difflevel.up # t1 didn't exist >>> difflevel.up.t1_child_rel # t2 is added >>> difflevel.up.t2_child_rel Nc ||_||_||_||_||_| t n||_||_||_t |_ | |_ y)a :param child_rel1: Either: - An existing ChildRelationship object describing the "down" relationship for t1; or - A ChildRelationship subclass. In this case, we will create the ChildRelationship objects for both t1 and t2. Alternatives for child_rel1 and child_rel2 must be used consistently. :param child_rel2: Either: - An existing ChildRelationship object describing the "down" relationship for t2; or - The param argument for a ChildRelationship class we shall create. Alternatives for child_rel1 and child_rel2 must be used consistently. N) rqr?rrrAr r t1_child_rel t2_child_rel_pathrU) r.rqr?rrrA child_rel1 child_rel2rrUs r(r9zDiffLevel.__init__sg. & &0%7%'Z''W *r'c|jr|jr9t|jd}dj|j |}|St|j }t|j }dj|j ||}|Sdj|j }|S)N#) max_lengthz<{} {}>z<{} t1:{}, t2:{}>z<{}>)rUrrrvr<rqr?)r.additional_reprresultt1_reprt2_reprs r(__repr__zDiffLevel.__repr__?s   ",T__"L"))$))+G %TWW-$TWW-,33DIIK'R ]]499;/F r'c|tvr*|(||j|<t|}||j|<y||j|<yr6)UP_DOWN__dict__)r.r8r opposite_keys r( __setattr__zDiffLevel.__setattr__LsA '>e/!&DMM# "3WYdf fr'c|j}t|}|Ht|j|_|jt|j|_|jdt j |jj|j|jj|jj|_|jdt j |jj|j|jj|jj|_ |j}|j |j}|H|S)zv Get a deep copy of this comparision line. :return: The leaf ("downmost") object of the copy. r) rrrrrrr __class__rqrrr?)r.origrs r(rzDiffLevel.copys {{d $T__ 5F yy$"499o $$0*;*B*B"//99%yy$kknn"//55 +C+7F' $$0*;*B*B"//99%yy$kknn"//55 +C+7F'99D{{&/0 r')NNNNNNr~r6r)rNFFr)NNN)r#r$r%__doc__r9rrrpropertyrrrr staticmethodrrr<rrrr&r'r(rrsMd!    ?+B '--l     GG Rp0404"& 00404"& f" r'rcHeZdZdZdZdZeddZddZdZ ddZ ddZ y) rzt Describes the relationship between a container object (the "parent") and the contained "child" object. NcBt|tst||||Sr6) issubclassrrurs r(rzChildRelationship.createCs!%!23OVUE**r'c.||_||_||_yr6)rrr)r.rrrs r(r9zChildRelationship.__init__Is   r'cd}t|j}t|j}t|j}|j |j j |||S)Nz"<{} parent:{}, child:{}, param:{}>)rrrrrvrr#)r.namerrrs r(rzChildRelationship.__repr__SsP3DKK(4::&4::&{{4>>22FE5IIr'c$|j|S)a Returns a formatted param python parsable string describing this relationship, or None if the relationship is not representable as a string. This string can be appended to the parent Name. Subclasses representing a relationship that cannot be expressed as a string override this method to return None. Examples: "[2]", ".attribute", "['mykey']" :param force: Bends the meaning of "no string representation". If None: Will strictly return partials of Python-parsable expressions. The result those yield will compare equal to the objects in question. If 'yes': Will return a formatted param including '(unrepresentable)' instead of the non string-representable part. )stringify_param)r.rns r(rz ChildRelationship.get_param_reprZs##E**r'c|j}t|trt||j}nt|t r dj tt|}nt|dri|jDcgc]}|t||fc}Dcgc] \}}|d|}}}|jjddj |d}n t|} t|} | |k(r|nd}|r)|j&d n|j&j)|}|Scc}wcc}}w#tt f$r'} t"j%d |d | d}Yd} ~ id} ~ wwxYw) a Convert param to a string. Return None if there is no string representation. This is called by get_param_repr() :param force: Bends the meaning of "no string representation". If None: Will strictly return Python-parsable expressions. The result those yield will compare equal to the objects in question. If 'yes': Will return '(unrepresentable)' instead of None if there is no string representation TODO: stringify_param has issues with params that when converted to string via repr, it is not straight forward to turn them back into the original object. Although repr is meant to be able to reconstruct the original object but for complex objects, repr often does not recreate the original object. Perhaps we should log that the repr reconstruction failed so the user is aware. ) quote_strz][__dataclass_fields__=(,)Nz7stringify_param was not able to get a proper repr for "z". This object will be reported as None. Add instructions for this object to DeepDiff's helper.literal_eval_extended to make it work properly: :)rrOrrr tuplejoinmapreprhasattrrgetattrrr#r SyntaxError ValueErrorloggererrorparam_repr_formatrv) r.rnrrrBr8rattrs_to_values candidate resurrectederrs r(r z!ChildRelationship.stringify_paramks\"  eW %&uGF u %YYs4/0F U2 3chc}c}B~^_AwuVWGXCYB~JC#aw/O001388O3L2MQOFU I E3I> '2U&:  22:S@V@V@]@]^d@eF )C ,  MeWUNNQUTU  s$?D'D,& D22E(E##E(r6) r#r$r%rrr rrr9rrr r&r'r(rr4s= I++ J+"+r'rceZdZdZdZy)DictRelationship[{}]z'{}'Nr#r$r%rr r&r'r(r$r$s Ir'r$ceZdZdZdZy)NumpyArrayRelationshipr%Nr&r&r'r(r(r(s Ir'r(c eZdZy)!SubscriptableIterableRelationshipNr"r&r'r(r*r*r)r'r*c eZdZy)InaccessibleRelationshipNr"r&r'r(r,r,r)r'r,c eZdZy)SetRelationshipNr"r&r'r(r.r.r)r'r.ceZdZdZddZy)$NonSubscriptableIterableRelationshipr%Ncb|dk(rd}|S|dk(r|jr|j}|Sd}|S)Nyesz(unrepresentable)r)rr )r.rnrs r(rz3NonSubscriptableIterableRelationship.get_param_reprsE E>(F  f_))+F F r'r6)r#r$r%rrr&r'r(r0r0s r'r0ceZdZdZy)AttributeRelationshipz.{}N)r#r$r%rr&r'r(r4r4sr'r4)'loggingcollections.abcrrdeepdiff.helperrrrrr r r r r r deepdiff.pathr getLoggerr#rrprr7rrr!r+r4rSrrrr$r(r*r,r.r0r4r&r'r(r:s #,   8 $  & .  9   )Q)QX{'{'|O<*O