Si7jSSKJr SSKJr SSKJrJrJrJrJ r J r J r \(aSSK J r S SSjjrSSSjjrSSSjjrSSS jjrSSS jjrSSS jjrSSS jjrg)) annotations) TYPE_CHECKING)AttributeProto GraphProto ModelProto TensorProtocheckerhelperutils)MutableMappingNc[U[5(d [S5e[U[5(d [S5eS SjnS S Sjjn/nU(d/nUVs1sHofSiM nnU"U"U5U"XS95nU(aURSU45 U"URV s/sHoR PM sn URV s/sHoR PM sn 5nU(aURSU45 U"UR V s/sHoR PM sn UR V s/sHoR PM sn 5nU(aURS U45 U"URV s/sHoRR PM sn URV s/sHoRR PM sn 5U"URV s/sHoRR PM sn URV s/sHoRR PM sn 5-nU(aURS U45 U$s snfs sn fs sn fs sn fs sn fs sn fs sn fs sn fs sn f)aChecks whether there are name collisions between two graphs Returns a list of tuples where the first element represents the member containing overlapping names (One of: "node", "edge", "value_info", "initializer", "sparse_initializer"), and the second element contains a list of names that appear in both graphs on that category. Optionally, it takes an io_map, representing the output/inputs to be connected. It provided, overlapping present in the io_map argument will be ignored. g1 argument is not an ONNX graph g2 argument is not an ONNX graphcB[[U5[U5-5$N)listset)c1c2s K/var/www/html/ai-image-ml/venv/lib/python3.13/site-packages/onnx/compose.py _overlapping-check_overlapping_names.._overlapping'sCGc"g%&&cUc [5n/nURHinURH#nUS:wdM XA;dMURU5 M% URH#nUS:wdM XQ;dMURU5 M% Mk U$)N)rnodeinputappendoutput)graphexcludeedgesnios r _edge_names,check_overlapping_names.._edge_names*st ?eGAWW7q/LLOXX7q/LLO  r)r!edge value_info initializersparse_initializer)r list[str]rr-returnr-r)r rr!zset[str] | Noner.r-) isinstancer TypeErrorrr*namer+r,valuesindices) g1g2io_maprr&resultelem io_map_inputsoverlapes rcheck_overlapping_namesr<s b* % %:;; b* % %:;;' F )/0!WM0;r?K,RSG vw'('A'"--)H-Q&&-)HG |W-.(A(2>>*J>a66>*JG }g./ " 5 56 51 56 " 5 56 51 56 !#!6!67!6A!67!#!6!67!6A!67 G +W56 M;1 ()H )*J 7677s6I)II I%9I* ?I/.I4 #I9 I> c B^(^)[U[5(d [S5e[U[5(d [S5eU(dU(aU(a&[5n U RU5 U n[ XS9nU(a&[5n U RU5 U n[ XS9nUV s/sH)n U(aX[S-OU SU(aXkS-OU S4PM+ nn UV s1sHoSiM n n UV s1sHoSiM n n UVVs0sHupX_M snnm)UR Vs1sHnUR iM nnURVs1sHnUR iM nnU(dU(GaU(dMURVs/sHnUR PM nnURVs/sHnUR PM nnO[U5nURVs/sH!nUR U;dMUR PM# nnURVs/sH1nUR U;dUR U ;dM%UR PM3 nnU(dMUR Vs/sHnUR PM nnUR Vs/sHnUR PM nnO[U5nUR Vs/sH1nUR U;dUR U ;dM%UR PM3 nnUR Vs/sH!nUR U;dMUR PM# nn[U5[UR5:d"[U5[UR 5:aF[R"[R"U55nURUU5Rn[U5[UR5:d"[U5[UR 5:aF[R"[R"U55nURUU5RnUH0unnUU;a[!SUS35eUU;dM#[!SUS 35e [#XU5n[U5S:a/USunn [!S US 3S R%U 5-S -S-5e[5n!U!R&R)UR&5 [U!R&5n"U!R&R)UR&5 [U!R&5n#SU(U)4Sjjm(T("U!U"U#5 U(a[U5nU!RR)URVs/sHnUR U;dMUPM sn5 U!RR)URVs/sHnUR U;dMUPM sn5 OmU!RR)UR5 U!RR)URVs/sHnUR U ;dMUPM sn5 U(a[U5nU!R R)UR Vs/sHnUR U;dMUPM sn5 U!R R)UR Vs/sHnUR U;dMUPM sn5 OmU!R R)UR Vs/sHnUR U ;dMUPM sn5 U!R R)UR 5 U!R*R)UR*5 U!R*R)UR*V$s/sHn$U$R U ;dMU$PM sn$5 U!R,R)UR,5 U!R,R)UR,V$s/sH!n$U$R.R U ;dMU$PM# sn$5 U!R0R)UR05 U!R0R)UR0V%s/sHn%U%R U ;dMU%PM sn%5 U!R0V%s1sHn%U%R iM n&n%U!R Vs1sHnUR iM n'nU!R0R)UR Vs/sH;nUR U ;dMUR U&;dM'UR U';dM9UPM= sn5 UbUO&SR%UR UR /5U!lUcZSUR SUR S 3UR -S-UR2-S-UR -S-UR2-nUU!lU!$s sn fs sn fs sn fs snnfs snfs snfs snfs snfs snfs snfs snfs snfs snfs snfs snfs snfs snfs snfs snfs snfs sn$fs sn$fs sn%fs sn%fs snfs snf)a%Combines two ONNX graphs into a single one. The combined graph is defined by connecting the specified set of outputs/inputs. Those inputs/outputs not specified in the io_map argument will remain as inputs/outputs of the combined graph. Arguments: g1 (GraphProto): First graph g2 (GraphProto): Second graph io_map (list of pairs of string): The pairs of names [(out0, in0), (out1, in1), ...] representing outputs of the first graph and inputs of the second to be connected inputs (list of string): Optional list of inputs to be included in the combined graph By default, all inputs not present in the ``io_map`` argument will be included in the combined model outputs (list of string): Optional list of outputs to be included in the combined graph By default, all outputs not present in the ``io_map`` argument will be included in the combined model prefix1 (string): Optional prefix to be added to all names in g1 prefix2 (string): Optional prefix to be added to all names in g2 name (string): Optional name for the combined graph By default, the name is g1.name and g2.name concatenated with an underscore delimiter doc_string (string): Optional docstring for the combined graph If not provided, a default docstring with the concatenation of g1 and g2 docstrings is used Returns: GraphProto rrprefixrr(zOutput z is not present in g1zInput z is not present in g2z=Cant merge two graphs with overlapping names. Found repeated z names: ,  zYConsider using ``onnx.compose.add_prefix`` to add a prefix to names in one of the graphs.c >[X5HnURUnURHTnUR[R :XdM#T"UR S[UR R55 MV [UR5HupgUT ;dM T UURU'M! M gNr) ranger attributetyperGRAPHglen enumerater) sub_graphstartendnode_idxrattrindexname_ connect_ioreversed_io_maps rrR merge_graphs..connect_iose)H>>(+D99 4 44tvvq#dffkk*:;'!*$** 5 O+(7(>DJJu%!6 *r_zGraph combining  and z )rKrrLintrMrWr.None)r/rr0CopyFromadd_prefix_graphrr1rrrIr Extractorr make_model extract_modelr ValueErrorr<joinrextendr+r,r2r* doc_string)*r4r5r6inputsoutputsprefix1prefix2r1rag1_copyg2_copyioio_map_g1_outs io_map_g2_insout_namein_namer%g1_outsr$g2_ins g1_inputs g2_inputs input_set g1_outputs g2_outputs output_sete1e2 g1_out_name g2_in_nameoverlapping_namescategorynamesrHg2_nodes_begin g2_nodes_endinitvivalue_info_names output_namesrRrSs* @@r merge_graphsr[sL b* % %:;; b* % %:;;'  lG   R B!"5B  lG   R B!"5B   $+Q%1#*Q%1   '--fefN-%+,VrUVM,BHI&->Xw(&IO!yy)y!qvvyG) hh 'haffhF ')+2AI2)+2AI2IF I)+IAQVVy5HII!A66Y&!&&M*A!  *,))4)Q!&&)J4*,))4)Q!&&)J4JWJ"A66Z'166^+C"  +-))L)Qqvv7K&!&&)JL y>CM )S_s299~-M!2!22!67B!!)Z8>>B y>CM )S_s299~-M!2!22!67B!!)Z8>>B$* Z g %w{m3HIJ J V #vj\1FGH H $*0? !+A.% &Zx 1ii  j  j    AFFMM"''[NFFMM"''qvv;L ? ?q.,/ K  288C8aqvv/B8CD 288C8aqvv/B8CD rxx  288K8aqvv]/J8KL\  BIIFIq:1EIFG BIIFIq:1EIFG BIINIq~1MINO  "MM(MM..K.$DII],J.K 5 56-- -{{}4 - LL &LLbmmTmrwwm7SmTU*+,,7,B,7$%HH-HqAFFHL-LLYY vv' .. l*  %T388RWWbgg4F+GAFrwwiuRWWIR 8gg  mm    gg     mm  AL Hi .,I) ' 32J54 MjDCLGFN L  U7- s/0h%h#9h(h-.h3h8h=6i(ii $i i /ii$i/ii 'i i%+i%i*3i* i/!i/#i4;i4+i9i94i> i>jj3jj*j j jj>jj(j:jc [U[5(d [S5e[U[5(d [S5eURUR:wa&[ SURSURS35eURn 0n[ UR 5[ UR 5-nUHrnURU;aFUURnURU:wa%[ SUR SUR 35eMYURUUR'Mt U(dU(aU(a&[5nURU5 Un[XS9nU(a&[5nURU5 Un[XS9nUVs/sH+nU(aUUS -OUS U(aUUS -OUS 4PM- nn[URURUUUUUS 9n[R"UU U U U UU S 9n0nURHnUR UUR"'M URHvnUR"U;aJUUR"nUUR :wa)[ S UR"SUSUR S35eM]UR UUR"'Mx [R$"UU5 [ UR&Vs1sHnUR(iM snUR&Vs1sHnUR(iM sn-5nU(a[ SSR+U5-5eUR&R-UR&5 UR&R-UR&5 [.R0"U5 U$s snfs snfs snf)aCombines two ONNX models into a single one. The combined model is defined by connecting the specified set of outputs/inputs. Those inputs/outputs not specified in the io_map argument will remain as inputs/outputs of the combined model. Both models should have the same IR version, and same operator sets imported. Arguments: m1 (ModelProto): First model m2 (ModelProto): Second model io_map (list of pairs of string): The pairs of names [(out0, in0), (out1, in1), ...] representing outputs of the first graph and inputs of the second to be connected inputs (list of string): Optional list of inputs to be included in the combined graph By default, all inputs not present in the ``io_map`` argument will be included in the combined model outputs (list of string): Optional list of outputs to be included in the combined graph By default, all outputs not present in the ``io_map`` argument will be included in the combined model prefix1 (string): Optional prefix to be added to all names in m1 prefix2 (string): Optional prefix to be added to all names in m2 name (string): Optional name for the combined graph By default, the name is g1.name and g2.name concatenated with an underscore delimiter doc_string (string): Optional docstring for the combined graph If not provided, a default docstring with the concatenation of g1 and g2 docstrings is used producer_name (string): Optional producer name for the combined model. Default: 'onnx.compose' producer_version (string): Optional producer version for the combined model. Default: "1.0" domain (string): Optional domain of the combined model. Default: "" model_version (int): Optional version of the graph encoded. Default: 1 Returns: ModelProto z m1 argument is not an ONNX modelz m2 argument is not an ONNX modelzIR version mismatch z != z-. Both models should have the same IR versionzPCan't merge two models with different operator set ids for a given domain. Got: rVr>rr()rbrcr1ra) producer_nameproducer_versiondomain model_version opset_imports ir_versionzaCan't merge models with different values for the same model metadata property. Found: property = z, with values .zPCan't merge models with overlapping local function names. Found in both graphs: r@)r/rr0rr^r opset_importrversionrY add_prefixrr r r\metadata_propsvaluekeyset_model_props functionsr1r_ MergeFromr check_model)m1m2r6rbrcrdrer1rarrrrropset_import_maprentry found_versionm1_copym2_copyrhr model model_props meta_entryrffunction_overlaps r merge_modelsr)sb b* % %:;; b* % %:;; }} %"2==/bmm_E; ;  J13)D,AAM <<+ +,U\\:M}} - OO,E"//1BD. .3]] U\\ *'  lG   R BB/B  lG   R BB/B   $+"Q%1#*"Q%1        E    #)## EK'' &0&6&6 JNN#('' >>[ ( /E ((( **4..)9weT^TdTdSeefh) +5*:*:K  '( 5+.&A&",,)G,Q!&&,)GG &(, 2B(C D   OObll+ OObll+  Lq Z ')Gs2N8-N=O c L [U[5(d [S5eU(d[5n U RU5 OUn SSjn U c0n U(a\U RV s1sHoR iM n n U R H'nURHnX;dM U "X5X'M M) U(a3U RH#nU "UUR 5U UR 'M% U(a3U RH#nU "UUR 5U UR 'M% U(afU R HVnU "XR 5UlURH,nUR(dM[URUSU S9 M. MX U(aU RH#nU "UUR 5U UR 'M% U RHknU "UURR 5U URR 'U "UURR 5U URR 'Mm U(a3U RH#nU "UUR 5U UR 'M% U R Hn[!UR5H-unnURUU ;dMU UURU'M/ [!UR5H-unnURUU ;dMU UURU'M/ M U RH)nUR U ;dMU UR UlM+ U RH)nUR U ;dMU UR UlM+ U RH)nUR U ;dMU UR UlM+ U RHnURR U ;a(U URR URlURR U ;dMaU URR URlM U RH)nUR U ;dMU UR UlM+ U $s sn f)aAdds a prefix to names of elements in a graph: nodes, edges, inputs, outputs, initializers, sparse initializer, value infos. It can be used as a utility before merging graphs that have overlapping names. Empty names are not prefixed. Arguments: graph (GraphProto): Graph prefix (str): Prefix to be added to each name in the graph rename_nodes (bool): Whether to prefix node names rename_edges (bool): Whether to prefix node edge names rename_inputs (bool): Whether to prefix input names rename_outputs (bool): Whether to prefix output names rename_initializers (bool): Whether to prefix initializer and sparse initializer names rename_value_infos (bool): Whether to prefix value info names inplace (bool): If True, mutates the graph directly. Otherwise, a copy will be created name_map: (Dict): shared name_map in subgraph Returns: GraphProto #graph argument is not an ONNX graphc,[U5S:aX-$U$rC)rI)r?r1s r _prefixed#add_prefix_graph.._prefixeds #D A v}747rT)inplacename_map)r?strr1rr.r)r/rr0rYrr1rrrErHrZr+r,r2r3r*rJ)r r? rename_nodes rename_edges rename_inputsrename_outputsrename_initializersrename_value_infosrrrHrr%graph_output_namesr#r;rrEr~ sparse_initr$rinput_in_descout_descr+r,r*s rrZrZsD eZ ( (=>>  L 5 8/0hh7hffh7AXX."+F"6HK WWE#,VUZZ#@HUZZ XXE#,VUZZ#@HUZZ Avvv.AF[[ ;;;$! VTH)MMD"+FDII">HTYY "//K09 **//1H['',, -2; ++002H[((-- . 0\\E#,VUZZ#@HUZZ "VV"188,IAvxx{h&&v. -#177+IAvwwqzX%%f- , 77 <<8 ##GLL1GLHH ==H $$X]]3HM}}   x '' (8(89K % 22  $ $ ) )X 5-56H6O6O6T6T-U  % % *  % % * *h 6.67I7Q7Q7V7V.W  & & + 3 ll ??h &&z7JO# HC8s%R!c Z[U[5(d [S5eU (d[5n U RU5 U n[ UR UUUUUUUSS9 U(a0n UR H%n XR-n XU R'XlM' UR H;n U RH(nURU ;dMXRUl M* M= UR RH(nURU ;dMXRUl M* U$)aAdds a prefix to names of elements in a graph: nodes, edges, inputs, outputs, initializers, sparse initializer, value infos, and local functions. It can be used as a utility before merging graphs that have overlapping names. Empty names are not _prefixed. Arguments: model (ModelProto): Model prefix (str): Prefix to be added to each name in the graph rename_nodes (bool): Whether to prefix node names rename_edges (bool): Whether to prefix node edge names rename_inputs (bool): Whether to prefix input names rename_outputs (bool): Whether to prefix output names rename_initializers (bool): Whether to prefix initializer and sparse initializer names rename_value_infos (bool): Whether to prefix value info nanes rename_functions (bool): Whether to prefix local function names inplace (bool): If True, mutates the model directly. Otherwise, a copy will be created Returns: ModelProto #model argument is not an ONNX modelT)rrrrrrr) r/rr0rYrZr rr1rop_type)rr?rrrrrrrename_functionsrm f_name_mapr new_f_namer#s rrr4sD eZ ( (=>>  L 5 !!#%/-  A&&J!+qvv F! AVV99 * *99 5AI! !!AyyJ&&yy1 " Lrcj[U[5(d [S5eU(d[5nURU5 OUnURVs/sHoDR PM nnUR Hwn[UR5H!upxX;dM USU3-URU'M# [UR5H!upyX;dM U SU3-URU'M# My UR S-n UR R[R"S/U /U S3[R"U S3[RS/U/S9S 95 [[!UR55GH(n URR#S 5n U R SU3-n UR R[R"S X/U R /S U R 3S 95 U R$R&R(R*Vs/sHoR,PM nnUR/US5 URR[R0"U R U R$R&R2U55 GM+ U$s snfs snf)aInserts an extra dimension with extent 1 to each output in the graph. Inserts an Unsqueeze node for each output. It can be used as a utility before merging graphs, for example when the second one expects a batch dimension. Arguments: graph (GraphProto): Graph dim_idx (int): Index of the dimension to be inserted. A negative value means counting dimensions from the back. inplace (bool): If True, mutates the model directly. Otherwise, a copy will be created Returns: GraphProto r_collapsed_dim__expand_out_dim_idxConstantz -constantz-valuer()r1 data_typedimsvals)rbrcr1rr Unsqueezez unsqueeze-)rbrcr1)r/rr0rYrr1rrJrrr make_node make_tensorrINT64rDrIpoprF tensor_typeshapedim dim_valueinsertmake_tensor_value_info elem_type)r dim_idxrrHrorig_out_namesr#r$outinp expand_dim_krUr% prev_outputd new_shapes rexpand_out_dim_graphr~sK( eZ ( (=>>  L 5 019fkkN9 VV)FA$!ogY$?? * (FA$ _WI#>> ) 6611LFFMM !N >+$$$~V,%++   &3qxx= ! HHLLOff ::     #2!!&&*   +,&&*<*<*B*B*F*FG*FQ[[*F G!$   ) )**44i  "$ Ha:RHs J+"J0c[U[5(d [S5eU(d[5nURU5 Un[ UR USS9 U$)aInserts an extra dimension with extent 1 to each output in the graph. Inserts an Unsqueeze node for each output. It can be used as a utility before merging graphs, for example when the second one expects a batch dimension. Arguments: model (ModelProto): Model dim_idx (int): Index of the dimension to be inserted. A negative value means counting dimensions from the back. inplace (bool): If True, mutates the model directly. Otherwise, a copy will be created Returns: ModelProto rT)r)r/rr0rYrr )rrrrs rexpand_out_dimrsT( eZ ( (=>>  L 5  Lrr)r4rr5rr6zlist[tuple[str, str]] | Noner.zlist[tuple[str, list[str]]])NNNNNN)r4rr5rr6list[tuple[str, str]]rblist[str] | Nonercrrd str | Nonererr1rrarr.r) NNNNNNzonnx.compose.merge_modelsz1.0rr()rrrrr6rrbrrcrrdrrerr1rrarrrrrrrrz int | Noner.r)TTTTTTFN)r rr?rr bool | Nonerrrrrrrrrrrrrzdict[str, str] | Noner.r)TTTTTTTF)rrr?rrrrrrrrrrrrrrrrrr.r)F)r rrrWrrr.r)rrrrWrrr.r) __future__rtypingronnxrrrrr r r collections.abcr r<rrrZrrrrrrs&# .LPBB"B,HB BR $ $!K K K  "K   K  K  K K  K K K d $ $! ;#( !OOO "O  O  O  OO OOO!O OOOj!% $!%"&'+&* &*v v v v  v  v  v %v $v v $v v x!% $!%"&'+&*$( G G GG G  G  G%G$G"GGGZ!M M M M  M f!! ! !! !r