i?ddlmZmZmZmZddlmZddlmZddl m Z ddl m Z ddl mZmZddlmZmZddlmZdd lmZmZd d lmZmZd d lmZd d lmZd dlm Z m!Z!m"Z"dZ#dZ$GddeZ%Gdde%Z&y))ListOptionalSetTuple)selected_resources)Manifest)GraphMemberNode) PreviousState)NoNodesForSelectionCriteriaSelectorReportInvalidSelector)DbtInternalErrorInvalidSelectorError)NodeType) fire_event warn_or_error)GraphUniqueId) GraphQueue) MethodManager)IndirectSelectionSelectionCriteria SelectionSpeccbt|Dcgc]}|jddc}Scc}w)N.r)setsplit)nodesnodes S/var/www/html/strategist-ai/venv/lib/python3.12/site-packages/dbt/graph/selector.pyget_package_namesr!s( u5t 3"5 665s,c||jtjk(ry|jtjk(ryy)zIf a node is not selected itself, but its parent(s) are, it may qualify for indirect selection. Today, only Test nodes can be indirectly selected. In the future, other node types or invocation flags might qualify. TF) resource_typerTestUnit)rs r can_select_indirectlyr&s1  X]]*  x}} ,c *eZdZdZ d!dededeededdf fd Z d e e d e de e fd Z d e dee e e e ffd Zd e d e e de e fdZ d"d ededee e e e ffdZ d"d ededee e e e ffdZde defdZde defdZdedefdZde defdZd e e de e fdZej6fd e e dedee e e e ffdZeej6fde e de e dede e fdZd"d edede e fdZd"d edede fd Z!xZ"S)# NodeSelectorz4The node selector is aware of the graph and manifestNgraphmanifestprevious_stateinclude_empty_nodesreturnct|||||_||_|jj Dchc]}|j |s|}}|jj ||_ycc}wN)super__init__ full_graphr-r_is_graph_membersubgraphr*)selfr*r+r,r- unique_id graph_members __class__s r r2zNodeSelector.__init__'sw >2!&)< (,'<'<'> #$BWBWXaBbI  __--m<  s A:A:included_nodesspecc|j|j|j}t|j ||j S)zsSelect the explicitly included nodes, using the given spec. Return the selected set of unique IDs. ) get_methodmethodmethod_argumentsrsearchvalue)r6r:r;r>s r select_includedzNodeSelector.select_included9s8d.C.CD6==<==r'c|jj} |j||}|j||}||z}|jtjk(r |tfS|j||j\}}||fS#t$r]dj |j }t t||j|jttfcYSwxYw)zGet all nodes specified by the single selection criteria. - collect the directly included nodes - find their specified relatives - perform any selector-specific expansion z, )valid_selectors spec_methodraw_spec)selectedindirect_selection)r*rrBrjoinSELECTOR_METHODSrr r>rawrcollect_specified_neighborsrHrEmptyexpand_selection) r6r;r collectedrD neighborsrG direct_nodesindirect_nodess r get_nodes_from_criteriaz$NodeSelector.get_nodes_from_criteriaDs   " ,,UD9I44T9E y(  " "&7&=&= =SU? "+/+@+@!d6M6M,A, (L. / /'$ "ii(=(=>O -$3W[W_W_  5#%<  sBA#C87C8rGct}|jr*|j|jj ||j r7|j }|j|jj|||jr7|j}|j|jj|||S)a Given the set of models selected by the explicit part of the selector (like "tag:foo"), apply the modifiers on the spec ("+"/"@"). Return the set of additional nodes that should be collected (which may overlap with the selected set). ) rchildrens_parentsupdater*select_childrens_parentsparents parents_depthselect_parentschildrenchildren_depthselect_children)r6r;rG additionaldepths r rLz(NodeSelector.collect_specified_neighborsfs%(E  ! !   djjAA(K L <<&&E   djj77%H I ==''E   djj885I Jr'warn_on_no_nodesc$t|tr|j|\}}||fS|jDcgc]}|j ||}}g}g}|D]*\} } |j | |j | | z,|j |} |j |}|j| ||j}|jr8t|dk(r*|r(ttt|j||fScc}w)zIf the spec is a composite spec (a union, difference, or intersection), recurse into its selections and combine them. If the spec is a concrete selection criteria, resolve that using the given graph. r;r`r)spec_raw) isinstancerrS componentsselect_nodes_recursivelyappendcombinedincorporate_indirect_nodesrH expect_existslenrr strrK) r6r;r`rQrR componentbundles direct_sets indirect_setsdirectindirectinitial_directs r rfz%NodeSelector.select_nodes_recursively{s! d- .+/+G+G+M (L.0^++)"&--9O_-`G KM$+ 8 ""6*$$Vh%67 8"]];7N!]]=9N::0G0GL!!c,&71&>$**2K2KH2U#V#\#\ %%$ 55h? 6IDMM///9 @X@X3X 3 33==..y9D$--":"::==33I>D).)->-D-DD--IXI'%((3+/@/J/JJs--P12P3%((3+/@/F/FF&**95+ 6.^++r'rQrRct|t|k(r|St|}|tjk(rn|D]g}||jjvs|jj|}t|j t|ksW|j |i|S|tjk(r|j|jj|}|D]g}||jjvs|jj|}t|j t|ksW|j |i|Sr0) rrCautiousr+rrrrrr*rZ)r6rQrRrHrGr7rrs r riz'NodeSelector.incorporate_indirect_nodes1s$ | N 3 3 |$ !2!;!; ;+ 0  3 33==..y9D4001S]B Y/  0 #4#>#> >#+>>$**2K2KH2U#V + 0  3 33==..y9D4001S9M5NN Y/  0 r'cT|j||\}}|j|}|S)afget_selected runs through the node selection process: - node selection. Based on the include/exclude sets, the set of matched unique IDs is returned - includes direct + indirect selection (for tests) - filtering: - selectors can filter the nodes after all of them have been selected rb)rwr)r6r;r`selected_nodesrvfiltered_nodess r get_selectedzNodeSelector.get_selectedPs<)-(9(9(8):) % ..~>r'preserve_edgesc|j|}tj||jj |}t |j |j||S)z^Returns a queue over nodes in the graph that tracks progress of dependencies. )rrset_selected_resourcesr3get_subset_graphrr*r+)r6r;rr new_graphs r get_graph_queuezNodeSelector.get_graph_queueasO **4011.AOO44^D )//4==..YYr'r)T)#__name__ __module__ __qualname____doc__rrrr boolr2rrrrBrrSrLrrfrwr4rr rrrrrrNrrirrr __classcell__r9s@r r)r)$s[> 37$) ===!/ = " =  =$ >H  >  > X > 0% 0 s8}c(m+ , 0D%14X X,=A ,! ,59 , s8}c(m+ , ,F=A +! +59 + s8}c(m+ , +'('t'8T/d (8((,  X  3x=  1B0G0G9,h-9,.9, s8}c(m+ , 9,|),0A0G0G (mH .  X >$RUV^R_" ZM Z4 ZS] Zr'r)c NeZdZ d dededeedeede ddf fd Z d Z xZ S) ResourceTypeSelectorr*r+r,resource_typesr-r.NcLt|||||t||_y)N)r*r+r,r-)r1r2rr)r6r*r+r,rr-r9s r r2zResourceTypeSelector.__init__ps2 ) 3  .1-@r'c2|j|jvSr0)r#rrs r rz"ResourceTypeSelector.node_is_matchs!!T%8%888r')F) rrrrrrr rrrr2rrrs@r rros\%* AAA!/ A X A " A A 9r'rN)'typingrrrrdbtrdbt.contracts.graph.manifestrdbt.contracts.graph.nodesr dbt.contracts.stater dbt.events.typesr r dbt.exceptionsr rdbt.node_typesrdbt_common.events.functionsrrr*rrqueuerselector_methodsr selector_specrrrr!r&r)rrr'r rsY--"15-WA#A"+NN7 HZ=HZV 9<9r'