R jSrSSKrSSKrSSKrSSKrSSKJrJr SSKJ r J r SSK J r J r Jr SSKJr SSKJrJr SSKJrJrJr SS KJr SS KJr SS KJrJrJrJ r J!r!J"r"J#r#J$r$ SS K%J&r& SS K'J(r( SSK)J*r* SSK+J,r,J-r-J.r. SSK/J0r0J1r1J2r2J3r3 SSK4J5r5J6r6J7r7J8r8 SSK9J:r:J;r;Jr> SSK?J@r@ SSKAJBrB SSKCJDrD SS/rE\B"S5rF\B"S5rGSrHSrI\"SS5rJ"SS5rK\"SS 5rL"S!S\5rMS%S"jrN"S#S$5rOg)&aW Create SQL statements for QuerySets. The code in here encapsulates all of the SQL construction so that QuerySets themselves do not have to (and could be backed by things other than SQL databases). The abstraction barrier only works one way: this module has to know all about the internals of models in order to get the information it needs. N)Counter namedtuple)IteratorMapping)chaincountproduct)ascii_uppercase)FieldDoesNotExist FieldError)DEFAULT_DB_ALIASNotSupportedError connections)Count) LOOKUP_SEP)BaseExpressionColExistsFOuterRefRefResolvedOuterRefValue)Field)MultiColSource)Lookup)Qcheck_rel_lookup_compatibilityrefs_expression)INNERLOUTER ORDER_DIRSINGLE) BaseTableEmptyJoin MultiJoin)ANDOR ExtraWhere NothingNode WhereNode)cached_property)_lazy_re_compile)NodeQueryRawQueryz['`\"\]\[;\s]|--|/\*|\*/z[\w\-]+cUc [5$[[R"SUR5555$)Nc3# UH:oR(aURUR4O UR4v M< g7fN)concretenameattname.0fs FD:\diplom_project\venv\Lib\site-packages\django/db/models/sql/query.py ,get_field_names_from_opts..>s0 FW::QVVQYY AFF9 [URXRS9$)N)rT)r1rUrTras r;r`RawQuery.cloneds% <) __class____name__r\s r;__repr__RawQuery.__repr__ys!^^44d;;rCctURcg[UR[5(a[$[$r4)rTrFrdicttupler|s r; params_typeRawQuery.params_type|s* ;; !$++w77tBUBrCcURc UR$URURUR5-$r4)rrUrTr|s r;__str__RawQuery.__str__s5    #88Oxx$**4;;777rCc^[URnURnURRmU[ La [ U4SjUR 55nOSU[La6UR R5VVs0sHupEUT"U5_M nnnOUcSnO[SU-5eUR5Ul URRURU5 gs snnf)Nc34># UH nT"U5v M g7fr4)r9valadapters r;r<*RawQuery._execute_query..s?;C73<<;szUnexpected params type: %s) rrVropsadapt_unknown_valuerrTritems RuntimeErrorrWexecuterU)r\ connectionrrTkeyrrs @r;rgRawQuery._execute_querys , && ..44 % ?4;;??F D 8< 8I8I8KL8KHCc73<'8KFLF  F;kIJ J '')  DHHf-MsC/)r[rWrZrYrXrTrUrVN)r)r{ __module__ __qualname____firstlineno____doc__r]rr`rmrur}propertyrrrg__static_attributes__rrCr;r1r1RsD! $!=V <CC 8 .rC ExplainInfo)formatoptionsc\rSrSrSrSrSr\"\/5rSr \ r \ r SrSrSrSrSrSrSrSrS rSrSrSrSrSrSrSrSrSrSr S r!Sr"Sr#Sr$Sr%Sr&Sr'Sr(Sr)Sr*Sr+\"5S4r,Sr-SgS jr.\/S 5r0\1S 5r2Sr3Sr4Sr5ShSjr6Sr7Sr8SiSjr9Sr:Sr;SrSgSjr?Sr@SiSjrASrBSiSjrCSiSjrDS rESjS!jrFS"rGSkS#jrHS$rIS%rJS&rKS'rLSiS(jrMS)rNS*rOSlS+jrPS,rQS-rRSgS.jrSS/rTS0rUSiS1jrVS2rWS3rXSmS4jrYS5rZS6r[S7r\S8r]S9r^SnS:jr_S;r`S<raS=rbS>rcSoS?jrdSpS@jreSArfSqSBjrgSrSCjrhSDri\jSsSEj5rk\jSF5rlStSGjrmSHrnSIroSJrpSuSKjrqSLrr\/SM5rsSNrtSOruSPrvSQrwSRrxSSrySTrzSgSUjr{SVr|SsSWjr}SgSXjr~SYrSZrS[rS\rS]rS^rS_rS`rSar\/Sb5r\/Sc5rSdrSerSfrg)vr0zA single SQL query.TN SQLCompilerTFrrcXl0Ul0UlX l0Ul0Ul[ 5Ul[5Ul 0Ul 0Ul 0Ul gr4) modelalias_refcount alias_map alias_colsexternal_aliases table_mapr> used_aliasesr,where annotationsextra_filtered_relations)r\rrs r;r]Query.__init__sZ   $ !#E[  #% rCc2[UR5S:Xa/URSn[USS5=(d UR$[UR5S:Xa6[ [ URR555R$g)Nrtarget) lenselectgetattrfieldr[nextrsvalues output_field)r\rs r;rQuery.output_fieldsu t{{ q [[^F68T2Bfll B '' (A -T33::<=>KK K.rCc.URHnUs $ gr4)rr\aliass r; base_tableQuery.base_table s^^EL$rCc.UR5upX-$)a Return the query as a string of SQL with the parameter values substituted in (use sql_with_params() to see the unsubstituted string). Parameter values won't necessarily be quoted correctly, since that is done by the database interface at execution time. )sql_with_params)r\rUrTs r;r Query.__str__s**, |rCcHUR[5R5$)z_ Return the query as an SQL string and the parameters that will be substituted into the query. ) get_compilerr as_sqlr|s r;rQuery.sql_with_paramss   !1299;;rCc@UR5nX![U5'U$)z4Limit the amount of work when a Query is deepcopied.)r`id)r\memorts r; __deepcopy__Query.__deepcopy__"sRX rCcUcUc [S5eU(a [UnURRUR5"XX5$)NzNeed either using or connection) ValueErrorrrcompiler)r\rVr elide_emptys r;rQuery.get_compiler(sJ =Z/>? ? $U+J~~&&t}}5 e  rCcRUR(aURR$g)z Return the Options instance (the model._meta) from which to start processing. Normally, this is self.model._meta, but it can be changed by subclasses. N)r_metar|s r;get_metaQuery.get_meta1s ::::## # rCcX[5nURUlURR5UlURR5UlUR R5UlUR R5UlURR5UlURR5UlURR5Ul URbURR5Ul UR(a8[URVs/sHo"R5PM sn5Ul SUlURR5UlUR bUR R5UlUR"bUR"R5UlUR$SLa%[R&"UR$5UlSUR;aUR(R5UlUR*R5UlUR,R5UlURR/SS5 U$s snf)zN Return a copy of the current Query. A lightweight alternative to deepcopy(). NF subq_aliasesr)r%rz__dict__copyrrrrrr`rannotation_select_maskcombined_queriesr_annotation_select_cacherextra_select_mask_extra_select_cacheselect_relateddeepcopyrrrpop)r\objquerys r;r` Query.clone:s g }}))+ !00557++- #4499;++- JJ$$& **//1  & & 2)-)D)D)I)I)KC &  #(,0,A,AB,A5,AB$C (,$JJOO%  ! ! -$($:$:$?$?$AC !  # # /&*&>&>&C&C&EC #   e +"&s/A/A!BC  T]] *#00557C ,,113"&":":"?"?"A t, /CsJ'cUR5nU(aURU:waXlUR(d[5UlSUl[ US5(aUR 5 U$)z Return a copy of the current Query that's ready for another operation. The klass argument changes the type of the Query, e.g. UpdateQuery. F _setup_query)r`rzfilter_is_stickyr>rhasattrr)r\klassrs r;r Query.chaings[ jjl S]]e+!M##"uC $ 3 ' '     rCcHUR5nURU5 U$r4)r`change_aliases)r\ change_mapr`s r;relabeled_cloneQuery.relabeled_clonevs   Z( rCcJUR(dSnURX25$r4rget_col)r\rrrs r;_get_colQuery._get_col{sE~~e++rCcf ^U(d0$SnSn0nTRnUR5HupxTRU5 URTSSSS9n U R(d[ SU-5eTR U/5 U[U4SjU R555-nU[U4SjU R555-nU RU5n U TRU'X[Xy5'M UVs0sHowTRRU5_M n nTRU5 TRR5upn [STRR!555=(d U n[#TR$[&5(dPTR((d?U(d8U(d1U(d*U (d#TR*(dTR,(GaS S KJn TR35nSUlU"TR6U5nSUlSUlURTR<5 UR?SS 9 UR*(Gd?UR@(aJU(aCTR6RBRDRGURI554UlSUl U (d[K5n[#TR$[&5(a&TR$HnUUR5-nM U R!5Hn UU R5-nM TR<R5H.unnURM5(dMUROU5 M0 URU5 0nU R5Hupy0nTRQU /SS 9HenURSU5=n(dE[UU5S -nSU3n[UU5nUUU'UURU'UR U/5 UUU'Mg U RU5URU'M URVS:XaeUR@(dTUR(dCTR6RBRDRGURI554Ul+OTnSTl+STl 0Tl,TR(atTRR5VVs0sHunn[UU5U_M nnnU R5VV s0sHupyXyRU5_M sn nTl OU Tl TRU 5 UR<R!5Vs/sHnURZPM nn[SU55(+nUR?SS 9 UR]5 SUlSUlUR_UUS9nURa[b5nUcUnOEUReUR<R!55n [gURiU4U 55n[k[mUR<U55$s snfs snnfs sn nfs snf)zE Return the dictionary with the values of the existing aggregations. FTN) allow_joinsreuse summarizez!%s is not an aggregate expressionc3X># UHn[TRUSS5v M! g7f)contains_subqueryFNrrr9refr\s r;r<(Query.get_aggregation..s0!/C((-/BEJJ/'*c3X># UHn[TRUSS5v M! g7f)contains_over_clauseTNrrs r;r<rs0/C((-/EtLL/rc3<# UHn[USS5v M g7f)contains_aggregateTN)r)r9 annotations r;r<rs$";J $8$??";sr)AggregateQueryforce) resolve_refsr__colrc30# UH o[Lv M g7fr4)NotImplemented)r9rts r;r<r$sVEU66EUs)r)7rr check_aliasresolve_expressionr TypeErrorappend_annotation_maskanyget_refsreplace_expressionsrrrset_annotation_maskrsplit_having_qualifyrrFgroup_byr is_sliceddistinct combinatordjango.db.models.sql.subqueriesrr`subqueryrselect_for_updaterr[clear_ordering default_colsrpkrget_initial_aliasr>get_group_by_colsadd _gen_colsgetrrrempty_result_set_value clear_limitsr execute_sqlr#get_convertersrapply_convertersrzip)!r\rVaggregate_exprs refs_subquery refs_window replacementsrraggregate_expr aggregate aggregates_havingqualifyhas_existing_aggregationr inner_query outer_queryannotation_maskexprannotation_aliasrcol_refscolcol_refindex col_alias expressionempty_set_resultrrrt converterss!` r;get_aggregationQuery.get_aggregations#I   !%!7 "&"2"2"9"9";   !$ t}}e , ,~~'}} F**,K#'K ([AK,1K )).K &  + +D,B,B C  & &U & 3''' ++0H ((++33K4Q4Q4ST,K(,1 ( '*eO!$--77$(MMD+t}}>O%2%/%6%6%8 '9+=+=+??&99=8N8N8T8T8V4(*%7799+//0@A9W 33ODH$.$4$4$6 ! >>9+E>JC'/||C'88G8 #H  1&+E7O "%i"5(/ =@ // :#::I;G(/L%K2;1N1N 2 ''.%7""b(#00#:: JJ$$''// 0M0M0OP& "KDK %D DJ .2-=-=-C-C-E -E)zz*J6-E  -7,<,<,>$,>(88FF,>$ $.  $ $Z 0*;;BBD D   - -D  VEUVVV """.  "(- %%* "++E{+K%%f- >%F!001N1N1U1U1WXJ(33VIzJKFC 55v>??]Wb $ s%Z'Z"Z(2Z.cbUR5nURUS[S505S$)z? Perform a COUNT() query using the current filter constraints. __count*)r`rAr)r\rVrs r; get_countQuery.get_count3s0jjl""59eCj*AB9MMrCcUR$r4)rr|s r; has_filtersQuery.has_filters:s zzrCc8UR5nUR(aUR(deURSLaFUR SUR R R5S5 URSS9 UR5 UR(a1URS:Xa![SUR55Ul URSS9 U(aURSS 9 UR[!S5S 5 U$) NTc38# UHoRv M g7fr4r7r8s r;r<Query.exists..BsI(H1YY(HF allow_aliasesunionc3@# UHnURSS9v M g7f)F)limitN)exists)r9combined_querys r;r<rNIs%'&8N%%E%2&8srr)higha)r`rrr add_fieldsrrconcrete_fields set_group_byclear_select_clauserrrr set_limitsadd_annotationr)r\rTrHs r;rU Query.exists=s JJL q{{zzT! I (8(8(H(HI5 U3 ! ! #  !,,'"9!&'&'&8&8'"A  t$  LLaL  q3'rCcbURU5nURUS9nUR5$)NrV)rUr has_results)r\rVrHrs r;rbQuery.has_resultsSs/ KK >>>.##%%rCc UR5nUH3n[RU5(aSU;dM%[SU<S35e [ X#5UlUR US9nSRUR55$)Nz--zInvalid option name: .ra ) r`EXPLAIN_OPTIONS_PATTERN fullmatchrr explain_inforjoin explain_query)r\rVrrrH option_namers r;explain Query.explainXs{ JJL"K+55kBB;& #8q!IJJ # %V5>>>.yy//122rCc^TRUR:wa [S5eTR(a [S5eTRUR:wa [S5eTRUR:wa [S5eTR 5nUR TU1S9 0nU[:HnU(a [5O[TR5n[USS5nURU4SjTR55 [5n[UR5S S n U Hn URU n U RU5n TRXS 9n U R[ :XaUR#U 5 UR%U 5 X:waXU 'UR&U (aMTR)U 5 M URU5 UR+T5 T=R,UR,-slUR.R15n U R3U5 TR.R#X5 UR4(a;TR7UR4Vs/sHoRU5PM sn5 OS TlU[8:Xa-TR:(aUR:(a [=S 5eTR:R?UR:5 [5nTR@bUR?TR@5 UR@bUR?UR@5 U(aTRCU5 T=RDURD- sl"URF=(d TRFTl#URH=(d TRHTl$g s snf)a Merge the 'rhs' query into the current one (with any 'rhs' effects being applied *after* (that is, "to the right of") anything in the current query. 'rhs' is not modified during a call to this function. The 'connector' parameter describes how to connect filters from the 'rhs' query. z4Cannot combine queries on two different base models.z3Cannot combine queries once a slice has been taken.z6Cannot combine a unique query with a non-unique query.z6Cannot combine queries with different distinct fields.)excludeFc3n># UH*nTRUR[:XdM&Uv M, g7fr4)r join_typer )r9jr\s r;r< Query.combine..s, %!):)D)D)MAA~s%5 5rN)rrzSWhen merging querysets using 'or', you cannot have extra(select=...) on both sides.)%rr rrdistinct_fieldsr bump_prefixr(r>r JoinPromoter add_votesrrrrjrsr r discardr unref_aliasupdate_join_typesrrr`relabel_aliasesr set_selectr)rrupdaterset_extra_mask extra_tablesorder_byextra_order_by)r\rhs connector initial_aliasr conjunctionr joinpromoter rhs_votes rhs_tablesrrj new_aliaswr:rs` r;combine Query.combineds :: "RS S >>QR R ==CLL (TU U   3#6#6 6TU U..0  }o6 3& %#dnn*=#Iq%8  ~~  E #--(, E=='D'' 3D $ 4I~~& i( MM) $!$-5!%%e,,   +' ( y)&&t, S--- IIOO  *% q$ :: OO S 00< S TDK ?zzcii 7 #))$E  ! ! -  $ $T%;%; <  ,  $ $S%:%: ;     1 2 S--- 5  !00GD4G4G5TsO!cUc0n0X1R'URHnURURS5nURURS5nUcUcUR U05 MUU(dM^UR (d[[[U555eUR U05nURRRRnURURXW5 M UR5HupUR R#U 5=n (a;UR%U R&5n UR X405nU R(nOBUR%U 5n [+U S5(dMU R(nUR U05nURRRnURURXW5 M U$)Nr)rrZrr6r7 setdefault is_relationr rrs remote_fieldrrconcrete_model_get_defer_select_maskrrr" get_field relation_namerr) r\rAmask select_maskr field_maskfield_att_maskfield_select_mask related_model field_namefiltered_relationrelation reverse_rels r;rQuery._get_defer_select_masks  K! GG ))E%**d3J!XXemmT:N!n&<&&ub1(($T$z*:%;<<$/$:$:5"$E! % 2 2 8 8 > > M M ++!''* '+jjl "J$($<$<$@$@$LL L>>*;*I*IJ$/$:$:J;QSU$V! "nnZ8 {G44#))$/$:$:5"$E!!KK--< > M M **!'''3 rCcURupU(d0$0nUH3nUnUR[5HnURU05nM M5 UR 5nU(aUR Xs5$UR Xs5$)a Convert the self.deferred_loading data structure to an alternate data structure, describing the field that *will* be loaded. This is used to compute the columns to select from the database and also by the QuerySet class to work out which fields are being initialized on each model. Models that have all their fields included aren't mentioned in the result, only those that have field restrictions in place. )deferred_loadingsplitrrrrr)r\ field_namesdeferrr part_maskpartrAs r;get_select_maskQuery.get_select_masks"22 I%JI"((4%00r: 5&}} ..t: :))$55rCc|URRU5nU(d'U(a USnURU==S- ss'US4$U(a9SUR[ UR 5S-4-nUR U5 O!Ub UROUnU/URU'SURU'US4$)z Return a table alias for the given table_name and whether this is a new alias or not. If 'create' is true, a new alias is always created. Otherwise, the most recently created alias for the table (if one exists) is reused. rrF%s%dT)rr"r alias_prefixrrappendr)r\ table_namecreater alias_listrs r; table_aliasQuery.table_alias2s^^'' 3 *qME    &! + &%<  d//T^^1Dq1HIIE   e $,=+H!''j +0DNN: &%&E"d{rCc2URU==S- ss'g)z-Increases the reference count for this alias.rNrrs r; ref_aliasQuery.ref_aliasMs E"a'"rCc2URU==U-ss'g)z-Decreases the reference count for this alias.Nr)r\ramounts r;r{Query.unref_aliasQs E"f,"rCc^^^[T5mT(Ga3TRS5mTRTRcM5TRTRceTRTRnU=(a TRUR[ :HnTRTR[ :HnTRTR (dU(aXU(dQTRTR5TRT'TRUUU4SjTR55 T(aGM2gg)a Promote recursively the join type of given aliases and its children to an outer join. If 'unconditional' is False, only promote the join if it is nullable or the parent join is an outer join. The children promotion is done to avoid join chains that contain a LOUTER b INNER c. So, if we have currently a INNER b INNER c and a->b is promoted, then we must also promote b->c automatically, or otherwise the promotion of a->b doesn't actually change anything in the query results. rNc3v># UH.nTRURT:XdM"UT;dM*Uv M0 g7fr4)r parent_alias)r9rjraliasesr\s r;r<&Query.promote_joins..ss@ .~~d+88EAG+D .s !99 9) rrrrrsrr!nullablepromoteextend)r\rr parent_louteralready_louterrs`` @r; promote_joinsQuery.promote_joinsUsw-KKNE~~e$..6>>%(22> >>>>%0==LQ !=!G!G6!Q "^^E2<<FNu%..-(,u(=(E(E(Gu% $%grCc[U5nU(aURS5nURUR[:XauURUR 5URU'URUR nURUR[:XaURU5 U(aMgg)a Change join type from LOUTER to INNER for all joins in aliases. Similarly to promote_joins(), this method must ensure no join chains containing first an outer, then an inner join are generated. If we are demoting b->c join in chain a LOUTER b LOUTER c then we must demote a->b automatically, or otherwise the demotion of b->c doesn't actually change anything in the query results. . rN) rrrrrsr!demoterr r)r\rrrs r; demote_joinsQuery.demote_joinszsw-KKNE~~e$..&8(,u(=(D(D(Fu%#~~e4AA >>,/99UBNN<0 grCcURR5R5H*up#X1RUS5- nUR X$5 M, g)zX Reset reference counts for aliases so that they match the value passed in `to_counts`. rN)rrrr"r{)r\ to_countsr cur_refcount unref_amounts r;reset_refcountsQuery.reset_refcountssK $(#6#6#;#;#=#C#C#E E'--q*AAL   U 1$FrCc[U5RUR55(deURR U5 [ UR [5(a9[UR Vs/sHo"RU5PM sn5Ul[URVs/sHo"RU5PM sn5Ul UR=(a> URR5VVs0sHup2X2RU5_M snnUl UR5HupEX@R;aMURURU5nX`RU'URUURU'URU URU URURn[!U5HupX:XdM XWU' M M UR"R5V V s0sH"upUR%X5U =(d X;_M$ sn n Ulgs snfs snfs snnfs sn n f)z Change the aliases in change_map (which maps old-alias -> new-alias), relabelling any references to them in select columns and the where clause. N)r> isdisjointrrr}rFrrrrrrrrrr enumeraterr") r\rr:r old_aliasr alias_data table_aliasesposraliaseds r;rQuery.change_aliasess:))**;*;*=>>>> "":. dmmU + +!<@MMJMS$$Z0MJDM T 00< TU ++  ,,2241 4 $$Z0 041  %/$4$4$6 I. 2BB:NJ(2NN9 %-1-@-@-KD   *##I.y) NN:+@+@AM' 6 %)2#&7%7"#'"7"7"="="?! #@ NN5 (7+Ie6I I"?! /KT1 (! s=I6I  I)Ic \^U4SjnTRUR:wag[R"5S-n[U"55H.upVUTR;a UTl OXT:dM%[ S5e TRR TR/5TlURR TR5UlUc0nTR[TR5VVs0sHupWXr;dM USTRU4-_M snn5 gs snnf)a Change the alias prefix to the next letter in the alphabet in a way that the other query's aliases and this query's aliases will not conflict. Even tables that previously had no alias will get an alias after this call. To prevent changing aliases use the exclude parameter. c3 ># [n[[TR5S-5nUv [ S5HDnU(aXR U5SOUn[ X2S9HnSRU5v M SnMF g7f)z Generate a sequence of characters in alphabetical order: -> 'A', 'B', 'C', ... When the alphabet is finished, the sequence will continue with the Cartesian product: -> 'AA', 'AB', 'AC', ... rN)repeat)r chrordrrr<r rj)alphabetprefixnseqsr\s r; prefix_gen%Query.bump_prefix..prefix_genst'HT../!34FL1X>OOE NN5 !  ZZIId33DMMO4L4LdSTE E rCc[URR5Vs/sH o(dM SPM sn5$s snf)z Return the number of tables in this query with a non-zero reference count. After execution, the reference counts are zeroed, so tables added in compiler will not be seen by this method. r)rrr)r\rs r;count_active_tablesQuery.count_active_tabless4 4#6#6#=#=#?I#?%5A#?IJJIs ==cU(aUU(aNURR5VVs/sH&upEXB;dM URU5(dM$UPM( nnnO?URR5VVs/sHupEUbXB;dMXQ:XdMUPM nnnU(a5URU;a URnOUSnUR U5 U$URUR SUR S9upUR(aOURURR[:XdUR(a[n O[n XlXlXRU'U$s snnfs snnf)aD Return an alias for the 'join', either reusing an existing alias for that join or creating a new one. 'join' is either a base_table_class or join_class. The 'reuse' parameter can be either None which means all joins are reusable, or it can be a set containing the aliases that can be reused. The 'reuse_with_filtered_relation' parameter is used when computing FilteredRelation instances. A join is always created as LOUTER if the lhs alias is LOUTER to make sure chains like t1 LOUTER t2 INNER t3 aren't generated. All new joins are created as LOUTER if the join is nullable. T)rr) rrequalsrrrrrsrr!rr ) r\rjrreuse_with_filtered_relationrXrt reuse_aliases reuse_aliasrr0rss r;rj Query.joinsN (E"nn2244da qxxPT~4 M !NN0022DAMQZ56Y2  =0".. ,B/ NN; ' ## OODD>~~d//0::fD " ! &N  $u ?s" E5E5E5:E; E;E;cX$;aXB$URU5nU(dU$UnUHnXt;aURnXGnMURU(dURnM<URU5nUR UR /Xc5n URnU R S=o4U'M U=(d US$)aM Make sure the given 'model' is joined in the query. If 'model' isn't a parent of 'opts' or if it is None this method is a no-op. The 'alias' is the root alias for starting the join, 'seen' is a dict of model -> alias of existing joins. It must also contain a mapping of None -> some alias. This will be returned in the no-op case. rN)get_base_chainrparentsget_ancestor_link setup_joinsr6rM) r\rArrseenr curr_opts int_model link_field join_infos r;join_parent_modelQuery.join_parent_modelBs =; ##E*L I %OO  $$Y/%OO "44Y?J((*//):IMI!I&/oob&9 9EO "T "rCcN[RU5(a [S5eg)NzbColumn aliases cannot contain whitespace characters, quotation marks, semicolons, or SQL comments.)FORBIDDEN_ALIAS_PATTERNsearchrrs r;r Query.check_aliascs* " ) )% 0 0/  1rCcURU5 URUSSS9nU(aURU/5 O4UR[ UR 5R U155 XRU'g)z0Add a single annotation expression to the Query.TN)rr)r r rrr>r[ differencer)r\rrrs r;r^Query.add_annotationjso 224TQU2V   ' ' 0  $ $S)?)?%@%K%KUG%T U",rCc UR5nURU5 SUlURR"U/UQ70UD6 UR (a?[ URVs/sHnUR"U/UQ70UD6PM sn5UlURR5H_upgUR"U/UQ70UD6n[US5(a%URRUR5 XRU'Ma URR5Hup[U [5=(a- U R R"R$R&U :g=(d0 [U [(5=(a U R*U R,:gURU 'M U$s snf)NTr)r`rwrrr rrrrrrrrrrFr& join_fieldrrrr$rr) r\rargskwargsr`rVrvalueresolvedrtables r;r Query.resolve_expressionts  %  &&u>t>v>   %*+0*@*@*@#55eMdMfM*@&E "  ++113JC//GGGHx!344))001G1GH%-  c " 4 "OO113LE5$'K$$2288AAUJ-5),V1A1AUEVEV1V  " "5 )4 %s- Gc[URR5URR5nUR USS9Vs/sH!nUR UR;dMUPM# sn$s snf)NT)include_external)rrrrrEr!rr)r\exprsr:s r;get_external_colsQuery.get_external_colssmd&&--/1D1DE~~ed~C CyyD111 C   s A6-A6clUR5n[SU55(a U=(d U/$U$)Nc38# UHoRv M g7fr4)possibly_multivalued)r9r:s r;r<*Query.get_group_by_cols..sA=C''=rO)rr)r\wrapper external_colss r;rQuery.get_group_by_colss6 ..0 A=A A AOt$ $rCc,UR(aLURR(d1URSS9 URHnURSS9 M UR US9R 5upEUR(aSU-nXE4$)NFr)rz(%s))rrp*ignores_unnecessary_order_by_in_subqueriesrrrr)r\rrrrUrTs r;r Query.as_sqls MM''RR   e  ,..$$5$1/'':'>EEG  ==3,C{rCc^^^[US5(aURTTTS9nU$[U[[45(a7UUU4SjU5n[ U5n[US5(aU"U6$U"U5$U$)Nr )rrc3J># UHnTRUTT5v M g7fr4)resolve_lookup_value)r9 sub_valuer can_reuser\s r;r<-Query.resolve_lookup_value..s*!&I)))Y LL!&s #_make)rr rFrrrtype)r\rr/rrtype_s` `` r;r-Query.resolve_lookup_values 5. / /,,'-E  e} - -!&FKEug&&f~%=  rCcUR[5nUR(aD[X0R5upEU(a&URUnU(a [ XF5nUSU4$UR X0R 55upxpyUS[U5[U 5- n [U 5S:a=U (d6[SU<SUR 5RR<S35eXS4$)zH Solve the lookup type from the lookup (e.g.: 'foobar__id__icontains'). rrrzInvalid lookup "z " for model ".F) rrrrr names_to_pathrrr rr{) r\lookuprlookup_splittedrexpression_lookupsr>r0r lookup_parts field_partss r;solve_lookup_typeQuery.solve_lookup_types!,,z2   -<!1!1. *J!--j9 !$Z!\AR*RS | q 4==?0099; %//rCc[US5(aD[URRX#5(d[ SU<SUR <S35egg)z Check whether the object passed while querying is of the correct type. If not, raise a ValueError specifying the wrong object. rzCannot query "z ": Must be "z " instance.N)rrrrr object_name)r\rrArs r;check_query_object_typeQuery.check_query_object_typesP 5' " "1%++2C2CTQQ d..0R #rCcUR(a[U[5(ahUR(dW[ UR X15(d<[ SUR RR<SUR<S35e[US5(aURX#U5 g[US5(aUHnURXCU5 M ggg)z3Check the type of object passed to query relations.zCannot use QuerySet for "z": Use a QuerySet for "r6rruN) rrFr0has_select_fieldsrrrrr@rrA)r\rrrAvs r;check_related_objectsQuery.check_related_objectss   5%((//6u{{DPP {{((44d6F6FH((,,U%@ ++A00%@,# rCc[US5(a4[USS5(d"[URRS-5e[US5(a)UR 5HnUR U5 M gg)z>Raise an error if expression cannot be used in a WHERE clause.r  filterableTz$ is disallowed in the filter clause.get_source_expressionsN)rrrrzr{rJcheck_filterable)r\r>r7s r;rKQuery.check_filterables :3 4 4W  d> > $$$--1  :7 8 8"99;%%d+< 9rCc$U=(d S/GtpEUHnURX&5nM URU5nU(d,URX%5nSnURU5nU(dgU"X#5nURc:UR(d)US;a [ S5eURS5"US5$US:XaNURS:Xa>[ [ RR(aURS5"US5$U$)a Try to extract transforms and lookup from given lhs. The lhs value is something that works like SQLExpression. The rhs value is what the lookup is going to compare against. The lookups is a list of names to extract using get_lookup() and get_transform(). exactN)rNiexactz Cannot use None as a query valueisnullTr) try_transform get_lookuprcan_use_none_as_rhsrrr rp!interprets_empty_strings_as_nulls) r\lookupslhsr transforms lookup_namer6 lookup_classr8s r; build_lookupQuery.build_lookup s$+#7wi D$$S/C~~k2 $$S6C!K>>+6Lc' :: f&@&@"55 !CDD>>(+C6 6 7 " b ,-66XX>>(+C6 6 rCcHURU5nU(aU"U5$URRn[R"X!RR 55nU(aSSR U5-nOSn[SU<SUR<SU<35e)zh Helper method for build_lookup(). Try to fetch and initialize a transform for name parameter from lhs. z, perhaps you meant %s?z or rezUnsupported lookup 'z' for z# or join on the field not permitted) get_transformrrzdifflibget_close_matches get_lookupsrjr r{)r\rVr6transform_classrsuggested_lookups suggestions r;rQQuery.try_transform;s ++D1 "3' '++55L ' 9 9&&224! !6EV9WW  !%|'<'a&nURAXURB5sSnA$SnAff=f)a Build a WhereNode for a single filter clause but don't add it to this Query. Query.add_q() will then add this filter to the where Node. The 'branch_negated' tells us if the current branch contains any negations. This will be used to determine if subqueries are needed. The 'current_negated' is used to determine if the current filter is negated or not and this will be used to determine if IS NULL filtering is needed. The difference between current_negated and branch_negated is that branch_negated is set on first negation, but current_negated is flipped for each negation. Note that add_filter will not do any negating itself, that is done upper in the code by add_q(). The 'can_reuse' is a set of reusable joins for multijoins. If 'reuse_with_filtered_relation' is True, then only joins in can_reuse will be reused. The method will create a filter clause that can be added to the current query. However, if the filter isn't added to the query then the caller is responsible for unreffing the joins used. z"Cannot parse keyword query as dict)branch_negatedcurrent_negatedrr split_subqrKrr  conditionalFz3Cannot filter against a non-conditional expression.)rrrNT)rzCannot parse keyword query %rr7Joined field references are not permitted in this queryr)r/ allow_manyrNrPrr)3rFrr r_add_qrrr r rrZr,r(r=rKrrrr-rr"rrrrrrrFrKrArM _lookup_joinsr' split_excludenames_with_pathr trim_joinsrLrNrrrrXr is_nullablerrsr!rRr rr) r\ filter_exprrfrgr/rrhrrKr conditionargrrUpartsreffed_expression pre_joinskrE used_joinsrArrkr erL join_listr: lookup_typeclause require_outerrYs r; build_filterQuery.build_filterQsP k4 ( (AB B k1 % %;;- /&'%!1#   ; 4 5 5; u== UVV#667Ii00 --wiDI i[C8"< <   Q((#%-I )I%**U   & &y'<'>&H#*1:#8#8#BL-- I4E4Ea4H%PCJJ|C7=eS))d.>.>u||.L.L#(<<#:#:8#DLJJ|E593?z>>B>>u B Q%%ka>O>OP P Qs+3T T A,T T?T:4T?:T?c:UR[X455 gr4)add_qr)r\ filter_lhs filter_rhss r; add_filterQuery.add_filters 1j-./rCc4URVs1sH'o RUR[:XdM%UiM) nnURXR5upEU(a UR R U[5 URU5 gs snf)zW A preprocessor for the internal _add_q(). Responsible for doing final join promotion. N) rrsr rlrrr r(r)r\q_objectrXexisting_innerr}r0s r;r Query.add_qsx~~ %!):)D)D)MA~  KK*;*;<   JJNN63 ' .)  s $BBc(URUSS9S$)NF)rr)r)r\rrs r; build_whereQuery.build_wheres  % @CCrCc"[5Ulgr4)r,rr|s r; clear_whereQuery.clear_wheres [ rCc URn XAR-nU=(d URn[XRS9n [UR[ UR 5U5n UR HFn UR U UUUUUUUS9upU RU5 U (dM5U RX5 MH U RU5nX4$)z%Add a Q-object to the current filter.rnegated)r/rfrgrrhrKr) rrr,rxrrErryr r|)r\rrrfrgrrhrKrr target_clauserrI child_clause needed_inners r;rl Query._add_qs&& +++';8+;+;!I?O?OP #   H$5$5 6 &&E)-):):&- /'%!1#*; * &L  " "< 0|!!,:'$55d; **rCc PURnXAR-nU=(d URn[XQRS9nURHSn[ U[ 5(aUR UUUUS9nOURUUUUSSSS9upURX5 MU U$)z4Add a FilteredRelation object to the current filter.r)rrfrgTF)r/rfrgrrhr) rrr,rErFr/build_filtered_relation_qrr ) r\rrrfrgrrrIrr0s r;rQuery.build_filtered_relation_q8s&& +++';8+;+;!I?O?OP &&E%&&#==#1$3 >  #'"3"3##1$3 $$15#4#    l 6%'&rCc 2X!l[[UR55nUR UR 5upEnU(a[ SUR -5e[U5HnUR U5upnU(dSOSn U SU *n [U 5HXup[U5U :a(X\U :wa[ SUR <SU<S35eM<[ SU<SUR <S35e M XRUR'g) NzAFilteredRelation's relation_name cannot contain lookups (got %r).rqrzCFilteredRelation's condition doesn't support relations outside the z (got z).zaFilteredRelation's condition doesn't support nested relations deeper than the relation_name (got z for ) rrrGrsr=rrrrrr)r\rrrUrelation_lookup_partsrelation_field_partsr0r8r;lookup_field_partsshiftlookup_field_pathidxlookup_field_parts r;add_filtered_relationQuery.add_filtered_relationUs/"'*+<+F+FGH9=9O9O  + +: 6Q !/==> GnF262H2H2P /La)AqE 27UF ; *34E*F&+,s2+04EE( 1>>HF%#)*;*I*IK+G %$=N  !2!8!89rCc B//pe[U5GHupxU/4n US:XaURRnSn Sn Uc[eUR U5n U bRU R(aU R(d[SU-5eU R R"R$nOeUS-nUS:XdU(aP[)/[+U5QUR QURQ5n[SU<SS R-U5<35e GOUbZXR LaLUR/U5nU(a4URU5 U SRU5 USR0n[3U S 5(aU (aU R5U 5nO U R6nU(d`[U5HQunnUR8(dMU SRUSUS-5 UR;U 5 [=US-U5e USnURU5 UR>nUR0nUR@nU SRU5 UR;U 5 GM[U nU 4nU(a+US-[CU5:wa[S XS-<S U<S 35e O UWWUWS-S4$![a XR ;aUR UR n GNXR;aUS:XaURUn [U R;aNU RR[5n URU UUU5up nURU SS5 GNUR U R5n GN6f=f![&a SnGNf=f)a Walk the list of names and turns them into PathInfo tuples. A single name in 'names' can generate multiple PathInfos (m2m, for example). 'names' is the path of names to travel, 'opts' is the model Options we start the name resolving from, 'allow_many' is as for setup_joins(). If fail_on_missing is set to True, then a name that can't be resolved will generate a FieldError. Return a list of PathInfo tuples. In addition return the final field (the last used join field) and target (which is a field guaranteed to contain the same value as the final field). Finally, return those names that weren't found (which are likely transforms and the final lookup). rNrrzField %r does not generate an automatic reverse relation and therefore cannot be used for reverse querying. If it is a GenericForeignKey, consider adding a GenericRelation.rzCannot resolve keyword 'z' into field. Choices are: , path_infosCannot resolve keyword z into field. Join on 'z' not permitted.)"rrr6r rr[rrrrrr7rrrr rrrAttributeErrorsortedrBrjget_path_to_parentto_optsr get_path_inform2mrr'r target_fieldsr)r\namesrArkfail_on_missingrNrorr6cur_names_with_pathrrrufiltered_relation_pathr0r availablepath_to_parent pathinfos inner_posplastrKrLs r;r7Query.names_to_pathts!#Bo"5)IC#'* t|ww||E $  P<++t," $$U-@-@$47;; !!KK--<B>P>P! &+ ?;.q!  $:3B$?@ $/@/N/N O P:&!!E!s0J1 N12N &BN ,N  N  NNc J^^^U/nU4SjnSm[[U5SS5H!n TRUSU UUSS9un mpXSn O W H'nUUU4Sjn[R "UXS 9nSUlM) W HnUR(a'URR5nURnOSnSnURnUR(aTRUR5nOSnTRURUU[ URUUS 9nUR"(dU(aUOSnTR%UUUS 9nUR'U5 U(dMUSSUlM [+TW X'X5$![anU S:XaeUmSnAGMxSnAff=f) aR Compute the necessary table joins for the passage through the fields given in 'names'. 'opts' is the Options class for the current model (which gives the table we are starting from), 'alias' is the alias for the table to start the joining from. The 'can_reuse' defines the reverse foreign key joins we can reuse. It can be None in which case all joins are reusable or a set of aliases that can be reused. Note that non-reverse foreign keys are always reusable when using setup_joins(). The 'reuse_with_filtered_relation' can be used to force 'can_reuse' parameter and force the relation on the given connections. If 'allow_many' is False, then any reverse foreign key seen will generate a MultiJoin exception. Return the final field involved in the joins, the target field (used for any 'where' constraint), the final 'opts' value, the joins, the field path traveled to generate the joins, and a transform function that takes a field and alias and is equivalent to `field.get_col(alias)` in the simple case but wraps field transforms if they were included in names. The target field is the field containing the concrete value. Final field can be something different, for example foreign key pointing to that value. Final field is needed for example in some value conversions (convert 'obj' in fk__id=obj to pk val using the foreign key field for example). cL>TR(dSnURU5$r4r)rrr\s r;final_transformer,Query.setup_joins..final_transformers??==' 'rCNrrT)rrc>U"X5nTRXB5$![a [T[5(a T(aTeef=fr4)rQr rFr)rrr6previouswrappedrKlast_field_exceptionr\s r; transform$Query.setup_joins..transform3sK&u4G--g<<!!+u55:N22 s *A)r6r)r)rr)rangerr7r functoolspartialhas_transformsrr`rrdirectrqr join_classrr rrjrrNrJ)r\rrArr/rkrrMrpivotrNrLrestrWexcr6rrjrrrrrrKrs` @@r;rQuery.setup_joinssN  ( $3u:q"-E 373E3E&5M$( 4F40k7 #6] '.(D !* 1 1! 04  ,!(D%%$($:$:$@$@$B!/55 $(!" <# UHnTURv M g7fr4)column)r9t targets_dicts r;r<#Query.trim_joins..sDGqL2Gsr) rreversedrrrrforeign_related_fieldsrissubsetrelated_fieldsrr{r) r\rLrMrNrinfor join_targets cur_targetsrrs @r;rpQuery.trim_joinses a"8D>2IC5zQdkk%%.2oo.T.TU.THH.TLU-45W88WK5'' 55777AQ4;;+-"! QqT!7L DGDDG   UYY[ )3 b 5((V5s.E E E+Ec## UHn[U[5(aUv MU(a5[[USS55(aUR 5ShvN MZ[ US5(dMmU(d[U[ 5(aMURUR5UUS9ShvN M gNcN 7f)NrrJ)rr) rFrcallablerrrrr!rJ)clsrrrr7s r;r!Query._gen_colssD$$$ !h148'' 11333788# 4(=(===//1%5!-) 4s+ACB<C2AC2B>3 C>Cc#P# SURU55ShvN gN7f)Nc38# UHoRv M g7fr4)r)r9r7s r;r<)Query._gen_col_aliases..s@+?4JJ+?rO)r!)rrs r;_gen_col_aliasesQuery._gen_col_aliasess@3==+?@@@s &$&cURRU5nUbU(dFURU/5H0n[URU[ 5(dM'[ S5e U(a5XR;a[ SU-5e[XRU5$U$UR[5nURRUS5nUbUSSHnURXX5nM U$URXpR5UR5US9n URU R U R"U R$5upn U(d['U 5S:a [ S5e['U 5S:a [ S5eU R)U SU 5nUbUR+U 5 U$)NrjzCCannot aggregate over the '%s' alias. Use annotate() to promote it.rr)r/z?Referencing multicolumn fields with F() objects isn't supported)rr"rrFrr&r r[rrrrQrrrrprLrMrNrrOr) r\r6rrrrr field_listrr rL final_aliasr{s r; resolve_refQuery.resolve_refs%%))$/  !!22J<@E!$.."7>>(UA  555$)+/04!7!7!=>>!!J/J))--jmA#5 M7|a U "44WQZMI  Y' rCcJURUR5nURUlUupV[U[5(a [ U5nO*[U[ 5(a[ UR 5nURXV5 URSS9 URU5upxURSn U Rn U Rn X;aU RRRn URU5 U R!S5n U "U R#URSR5U R#U 55nUR$R'U[(5 SUR*U 'U R!S5n U "U [-U55nUR$R'U[(5 UR/[1U55unnU(a0UR/SU-S4SSUS9unnUR'U[25 UU4$)aL When doing an exclude against any kind of N-to-many relation, we need to use a subquery. This method constructs the nested query, given the original exclude filter (filter_expr) and the portion up to the first N-to-many relation field. For example, if the origin filter is ~Q(child__name='foo'), filter_expr is ('child__name', 'foo') and can_reuse is a set of joins usable for filters in the original query. We will turn this into equivalent of: WHERE NOT EXISTS( SELECT 1 FROM child WHERE name = 'foo' AND child.parent_id = parent.id LIMIT 1 ) TrrrNz %s__isnull)rgrfr/)rzrrrFrrr6rr trim_startrrrrrrwrRrrr r(rrrrr))r\rrr/rorrrtrimmed_prefixcontains_louterr: select_fieldrrrYr8rsror_null_conditionr0s r;rnQuery.split_excludes(tzz*$($<$<!!, j( + +!*-J  A & &!*//2J 0 4(+0*:*:?*K'll1ozz    ##)),,B   d #'227;L""**U\\!_-B-B"CRZZPUEVWF KKOOFC (,0E " "5 )#..w7 c#3N#CD $"&"3"3F5M"B < #'#4#4.5 $## $5$ q MM+R 0,&&rCcURR[5[5 URHnUR 5 M gr4)rr r+r(r set_empty)r\rs r;rQuery.set_emptys0 {}c***E OO +rCcN[SURR55$)Nc3B# UHn[U[5v M g7fr4)rFr+)r9cs r;r<!Query.is_empty..sK7J!:a--7Js)rrrEr|s r;is_emptyQuery.is_emptysKtzz7J7JKKKrCcUbJURb)[URURU-5UlOURU-UlUbJURb)[URURU-5UlOURU-UlURUR:XaUR5 gg)aW Adjust the limits on the rows retrieved. Use low/high to set these, as it makes it more Pythonic to read and write. When the SQL query is created, convert them to the appropriate offset and limit values. Apply any limits passed in here to the existing constraints. Add low to the current low value and clamp both to any existing high value. N)rYminrXr)r\lowrWs r;r]Query.set_limitss  ~~)!$T^^T]]T5I!J!%!5 ?~~) #DNNDMMC4G H $  3 ==DNN * NN  +rCc"SuUlUlg)zClear any existing limits.rSNrXrYr|s r;r$Query.clear_limits1s(/% t~rCcJURS:g=(d URSL$rfrr|s r;rQuery.is_sliced5s}}!?T^^4%??rCcdURSL=(a URUR- S:H$)Nr)rYrXr|s r; has_limit_oneQuery.has_limit_one9s)~~T)St~~ /MRS.SSrCc$UR(+$)z Return True if adding filters to this instance is still possible. Typically, this means no limits or offsets have been put on the results. )rr|s r; can_filterQuery.can_filter<s >>!!rCcrSUlSUlSUlURS5 UR S5 g)z%Remove all fields from SELECT clause.rFN)rrrrrr|s r;r\Query.clear_select_clauseDs5 !# B   $rCc SUlSUlg)z Clear the list of fields to select (but not extra_select columns). Some queryset types completely replace any existing list of select columns. rNr values_selectr|s r;clear_select_fieldsQuery.clear_select_fieldsLs  rCc\U=RU4- slU=RU4- slgr4r)r\r:r6s r;add_select_colQuery.add_select_colUs% v  tg%rCc2SUl[U5UlgNF)rrr)r\colss r;r~Query.set_selectYs!Dk rCcXlSUlg)zG Add and resolve the given fields to the query's "distinct on" clause. TN)rvr)r\rs r;add_distinct_fieldsQuery.add_distinct_fields]s + rCc UR5nUR5n/nUHnURUR[5XCUS9nUR UR URUR5upn UH#n URURX55 M% M U(aURU5 gg![a [SW-5e[a [W;aeX`R;a[SU-5e[/[!U5QUR"QUR$QUR&Q5n [SU<SSR)U 5<35ef=f)z] Add the given (model) fields to the select set. Add the field names in the order specified. )rkzInvalid field name: '%s'z;Cannot select the '%s' alias. Use annotate() to promote it.rz into field. Choices are: rN)rrrrrrprLrMrNrrOr~r'r rrrBrr[rrj) r\r allow_m2mrrArr6r rLrrMrrs r;rYQuery.add_fieldsds &&(}}) D#!,,JJz*DI- /3oo%%OONN/+e &FKK < ? ? T!)))  ! 248//11 !)-tyy/?A' s B$CB&E.cZ/nUHn[U[5(aUS:XaM URS5(aUSSnX0R;aMLUR(aX0R;aMnUR UR [5URR5 O"[US5(dURU5 [USS5(dM[SU-5e U(a[S U-5eU(aU=RU- slgSUlg) a Add items from the 'ordering' sequence to the query's "order by" clause. These items are either field names (not column names) -- possibly with a direction prefix ('-' or '?') -- or OrderBy expressions. If 'ordering' is empty, clear all ordering from the query. ?-rNr rFz[Using an aggregate in order_by() without also including it in annotate() is not allowed: %szInvalid order_by arguments: %s)rFstr startswithrrr7rrrrrrrr rdefault_ordering)r\orderingerrorsitems r; add_orderingQuery.add_orderingsD$$$3;??3''8D+++::$**"4""4::j#94::;K;KLT#788 d#t1599 :<@A!( =FG G  MMX %M$)D !rCcU(d4UR(d"UR(dUR(agSUlSUlU(aSUlgg)z Remove any ordering settings if the current query allows it without side effects, set 'force' to True to clear the ordering regardless. If 'clear_default' is True, there will be no ordering in the resulting query (not even the model's default). NrF)rrvrrrr$)r\r clear_defaults r;rQuery.clear_orderings@ NNd22d6L6L    $)D ! rCcU(aUR(a0n0n[URUR5H$upE[U[5(aXSU'M XRU'M& 0UEUR EUlUR U5 [UR55Ul[U5Ul[UR5nURR5HcupGUR5=n(dMU(a-UR(dUR[XG55 MRUR!U5 Me [U5Ulg)a Expand the GROUP BY clause required by the query. This will usually be the set of all non-aggregate fields in the return data. If the database backend supports grouping by the primary key, and the query would be equivalent, the optimization will be made automatically. N)rr(rrFrrrrrrrr[rrrrrrr) r\rQgroup_by_annotationsrrr7rr group_by_colss r;r[Query.set_group_bys T//$& M"4#5#5t{{C dC((+/%(26/ D L"6K$:J:JKD   ' '(< = 4 4 67DK!&}!5D  $!%!7!7!=!=!? E%/%A%A%CCMCZ%B%BE 67 . "@h rCc[UR[5(a0nO URnUH3nUnUR[5HnUR U05nM M5 X lg)z Set up the select_related data structure so that we only select certain related models (as opposed to all models, when self.select_related=True). N)rFrboolrrr)r\fields field_dictrdrs r;add_select_relatedQuery.add_select_relatedsa d))4 0 0J,,JEA J/LLr*0)rCcU(a0nU(a [U5nO [/5nUR5HupURU 5 [U 5n /n U R S5n U S:waHU S:Xd XS- S:waU R [ U55 U R SU S-5n U S:waMHX4Xy'M URRU5 U(dU(a)URR[X45[5 U(aU=R[U5- sl U(aX`lgg)zU Add data to the various extra_* attributes for user-created additions to the query. z%srrr%rqN)rsrr r"findrrrrrr r*r(rrr) r\r select_paramsrrTtablesr select_pairs param_iterr6entry entry_paramsrs r; add_extraQuery.add_extras  L!-0 !"X %||~   &E ! jj&Riax5q>S#8$++D,<=**T373CRi',%: " . JJ  l + F JJNN:e4c :    v .  "*  rCc&[5S4Ulg)z0Remove any fields from the deferred loading set.TN) frozensetrr|s r;clear_deferred_loadingQuery.clear_deferred_loading s!*d 3rCcURup#U(aURU5S4UlgURU5=n(a US4UlgUR5 [ U5RU5=n(a US4Ulgg)a: Add the given list of model field names to the set of fields to exclude from loading from the database when automatic column selection is done. Add the new field names to any existing field names that are deferred (or removed from any existing field names that are marked as the only ones for immediate loading). TFN)rrRrrEr>)r\rexistingr new_existingnew_onlys r;add_deferred_loadingQuery.add_deferred_loading" s// $,NN;$?$ED ! (22;??|?(4e(;%++-";/::8DD8D,4dND)ErCc.URup#[U5nSU;aDURS5 URUR 5R R 5 U(aURU5S4Ulg[U5S4Ulg)a Add the given list of model field names to the set of fields to retrieve when the SQL is executed ("immediate loading" fields). The field names replace any existing immediate loading field names. If there are field names already specified for deferred loading, remove those names from the new field_names before storing the new names for immediate loading. (That is, immediate loading overrides any existing immediate values, but respects existing deferrals.) rFN) rr>remover rrr6rrD)r\rrHrs r;add_immediate_loadingQuery.add_immediate_loading; s//+& ;    t $ OODMMO..33 4 %0$:$:8$De$KD !%.k$:E$AD !rCcHUcSUlO[U5UlSUlg)z@Set the mask of annotations that will be returned by the SELECT.N)rr>rr\rs r;rQuery.set_annotation_maskS s# =*.D '*-e*D '(,%rCctURb+URURRU55 ggr4)rrrRrRs r;rQuery.append_annotation_mask[ s2  & & 2  $ $T%@%@%F%Fu%M N 3rCcHUcSUlO[U5UlSUlg)z Set the mask of extra select items that will be returned by SELECT. Don't remove them from the Query since they might be used later. N)rr>rrRs r;rQuery.set_extra_mask_ s% =%)D "%(ZD "#' rCcSUlUR5 UR5 SUlU(a/n/n/nUR(dUR (d [ U5nOeSUlUHXnXPR;aURU5 M%XPR;aURU5 MGURU5 MZ URU5 URU5 [X#-U-5nODURRR Vs/sHoUR"PM nn[U5nUR$SLaWUR'SURRR 5S5 UR)SS9 UR5 OUR$(at/nUR$HRn[+U[,5(a)UR.U;aUR UR.nURU5 MT [1U5Ul[1U5UlUR'US5 gs snf)NFTc38# UHoRv M g7fr4rMr8s r;r<#Query.set_values.. sE$Dq$DrOrP)rrErrDrrrrrrZrr[rrrDrrrZr7rrYr[rFrrefsrr) r\r3r extra_namesannotation_namesr:selectedrr7s r; set_valuesQuery.set_valuesj s# ##%   "!% KK! ::d&6&6#6l $)!A---#**1-444(//2#**1-      ,  $ $%5 6 !:=M!MNH.2jj.>.>.N.NO.N99.NKO -H ==D OOEDJJ$4$4$D$DEu    E  2  $ $ & ]]H dC((TYYh-F++DII6D%&"(ODM";/  T*/Ps$Ic:URb UR$UR(d0$URbQURR5VVs0sHupXR;dMX_M snnUlUR$UR$s snnf)z Return the dictionary of aggregate columns that are not masked and should be used in the SELECT clause. Cache this result for performance. )rrrrr\rxrEs r;r[Query.annotation_select s  ( ( 400 0!!I  ( ( 4!,,224-4DA3334-D ) 00 0## #- B0Bc:URb UR$UR(d0$URbQURR5VVs0sHupXR;dMX_M snnUlUR$UR$s snnfr4)rrrrrbs r;rZQuery.extra_select s  # # /++ +zzI  # # /!%!1!1!3(!3q?IIVS"&!0E   U # $8__** ')JDT*Q.  ! !$ ' s4y (O * j??BGGH#8^^M!2C$DE   6 )*2N2N+5+D+DE+DaQqT+DME():;L   ]9 : * @ @mA$56! ! 0#6 ,6+D+DE+DaQqT+DME(7L^^E""5)A-(,(=(=NN5)44)u% $ -H-Q<0-HI..o <FFIs"J=J=KKK cUR=(d4 UR=(a! [[RR $)z Check if the given field should be treated as nullable. Some backends treat '' as null and Django treats such fields as nullable for those backends. In such situations field.null can be False even if we should treat the field as nullable. )nullempty_strings_allowedrr rprT)r\rs r;rqQuery.is_nullable s9zz  ' ' Y,-66XX rC) rrrrmrrrrrrrr$rrrvrrrrrrDrYrXrrrrrrrrr)T)NNTr4)FN)rr)F)FFNTTFTF)FFTTTF)FF)TF)NTF)FT)TNF)NN)r{rrrrrr#rDrrr$rr&rrr$standard_orderingrrrrrrXrYrrvrselect_for_update_nowaitselect_for_update_skip_lockedselect_for_update_ofselect_for_no_key_updaterrD max_depthrrrrcombinator_allrrrrrrrir]rrr-rrrrrrr`rrrrArFrIrUrbrmrrrrrrr{rrrrrwrrrjr r r^r rrrr-r=rArFrKrZrQrrrrrrlrrr7rrp classmethodr!rrrnrrr]r$rrr r\rrr~rrYr(rr[r6rArErKrOrrrr_r[rZrrqrrrCr;r0r0sL!l^,LH JLHFHHHIHO$$)!$NIM"#JNLN" T*L&8LL <  $+Z  , q@fN,& 3qHf,\.6,6(-#J1&2+ Z5 n K0d#B-:  (0. A. ,,\2%*e?N0*&D!"+JFK:N>rrCc0\rSrSrSrSrSrSrSrSr g) rxi. zQ A class to abstract away join promotion problems for complex filter conditions. cXlX0lUR(a"U[:Xa [UlO[UlOURUlX l[ 5Ulgr4)rrr(r)effective_connector num_childrenrvotes)r\rrrs r;r]JoinPromoter.__init__4 sH" <<C+-(+.('+~~D $(Y rCcURRSUR<SUR<SUR<S3$)Nz (connector=z, num_children=z , negated=))rzrrrrr|s r;r}JoinPromoter.__repr__C sG~~**+;t~~6HI --0 4<<:J! M rCc:URRU5 g)zH Add single vote per item to self.votes. Parameter can be any iterable. N)rr)r\rs r;ryJoinPromoter.add_votesI s % rCc[5n[5nURR5HupEUR[:Xa XPR :aUR U5 UR[:Xd'UR[:XdMcXPR :XdMtUR U5 M URU5 URU5 U$)z Change join types so that the generated query is as efficient as possible, but still correct. So, change as many joins as possible to INNER, but don't make OUTER joins INNER if that could remove results from the query. ) r>rrrr)rr r(rr)r\r to_promote to_demoterrs r;r|JoinPromoter.update_join_typesP sU E !JJ,,.LE''2-%:K:K2Ku%''3.((B.5rs  +-++"@FF-1   *B+ LKQQRR36" J ++FG+:6 M  F.F.R(=> % N% DL YYrC