h8fSSKJrJrJrJrJrJr SSKJrJ r J r J r J r J r S(S\S\S\\\\\4S\\\\\44SjjrS)S\S\S\\\\4S \\\S \\\S \\S \\S \\S\\S\4SjjrS*S\ S\ S\\\\4S \\\S \\\S \\S \\S \\S\\S\\S\\S\\S\\S\ 4SjjrS+S\S\S\\S\\S\\S\\S\\S\\S\\S \\\\4S\4S!jjrS,S"\ S\S\\S\\S\\S\\S\\S\\S#\\S\\S\ 4S$jjrS-S\S%\S\\S\4S&jjrS-S"\ S%\S\\S\ 4S'jjrg).)DictListMutableMappingOptionalSetTuple) GraphProto ModelProto TensorProtocheckerhelperutilsNg1g2io_mapreturnc[U5[La [S5e[U5[La [S5eS[[S[[S[[4SjnSS[S[ [ [S[[4S jjn/nU(d/nUVs1sHofS iM nnU"U"U5U"XS 95nU(aURS U45 U"URV s/sHoRPM sn URV s/sHoRPM sn 5nU(aURS U45 U"URV s/sHoRPM sn URV s/sHoRPM sn 5nU(aURSU45 U"URV s/sHoRRPM sn URV s/sHoRRPM sn 5U"URV s/sHoRRPM sn URV s/sHoRRPM sn 5-nU(aURSU45 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 graphc1c2rcB[[U5[U5-5$N)listset)rrs F/var/www/fran/franai/venv/lib/python3.13/site-packages/onnx/compose.py _overlapping-check_overlapping_names.._overlappingsCGc"g%&&graphexcludecUc [5n/nURHinURH#nUS:wdM XA;dMURU5 M% URH#nUS:wdM XQ;dMURU5 M% Mk U$)N)rnodeinputappendoutput)r r!edgesnios r _edge_names,check_overlapping_names.._edge_namesst ?eGAWW7q/LLOXX7q/LLO  r)r!edge value_info initializersparse_initializerr)typer ValueErrorrstrrrr&r0namer1r2valuesindices) rrrrr,resultelem io_map_inputsoverlapes rcheck_overlapping_namesr> sH Bxz!;<< Bxz!;<<'c'S 'd3i' : S0B dSVi 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 7677s6$J1J#J( J-J2 J76J< +K K inputsoutputsprefix1prefix2r6 doc_stringc 2[U5[La [S5e[U5[La [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 nnnUR 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/USun n![S U S 3S R#U!5-S -S-5e[5n"U"R$R'UR$5 [U"R$5n#U"R$R'UR$5 [U"R$5n$[)U#U$5HKn%U"R$U%n&[+U&R5H un'n(U(U;dMUU(U&RU''M" MM 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)R0R U ;dMU)PM# sn)5 U"R2R'UR25 U"R2R'UR2V*s/sHn*U*R U ;dMU*PM sn*5 UbUO&SR#UR UR /5U"lUcZSUR SUR S 3UR -S-UR4-S-UR -S-UR4-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*f)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 undescore 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._zGraph combining  and z )r3r r4CopyFromadd_prefix_graphr'r6r%rlenr Extractorr make_model extract_modelr r>joinr$extendrange enumerater1r2r7r0rC)+rrrr?r@rArBr6rCg1_copyg2_copyioio_map_g1_outs io_map_g2_insout_namein_namereversed_io_mapr+g1_outsr*g2_ins g1_inputs g2_inputs input_set g1_outputs g2_outputs output_sete1e2 g1_out_name g2_in_nameoverlapping_namescategorynamesgg2_nodes_begin g2_nodes_endnode_idxr$indexname_initvis+ r merge_graphsrtPs+L Bxz!;<< Bxz!;<<'  lG   R B!"5B  lG   R B!"5B   $+Q%1#*Q%1   '--fefN-%+,VrUVM,BHI&->Xw(&OI!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.,7vvh%djj1LE5'$3E$: 5!28 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%T388RWWbgg4F+GAFrwwiuRWWIR 8gg  mm    gg     mm  AL HC .,I) ' 32J54 MZDCLGFN L  Us'0f%f*1f/f4%f: f?g-g g7g$g?g&g g>$g"&g"g'g'g,*g,g12g1g6 g6"g;:g;*hh3h hh h 2hh)hhm1m2 producer_nameproducer_versiondomain model_versionc [U5[La [S5e[U5[La [S5eURUR:wa&[SURSURS35eURn 0n[ UR 5[ UR 5-nUHrnUR U;aFUUR nURU: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 9n0nURHnURUUR 'M URHvnUR U;aJUUR nUUR:wa)[S UR SUSURS35eM]URUUR 'Mx [R""UU5 [ UR$Vs1sHnUR&iM snUR$Vs1sHnUR&iM sn-5nU(a[SSR)U5-5eUR$R+UR$5 UR$R+UR$5 [,R."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 undescore 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: rJrErr.)r?r@r6rC)rwrxryrz 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: rG)r3r r4r}r opset_importryversionrK add_prefixrtr r rOmetadata_propsvaluekeyset_model_props functionsr6rQ MergeFromr check_model)rurvrr?r@rArBr6rCrwrxryrzr}opset_import_mapr|entry found_versionm1_copym2_copyrWr model model_props meta_entryrffunction_overlaps r merge_modelsr sb Bxz!;<< Bxz!;<< }} %"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 ')Gs2N2'N7 N< r rF rename_nodes rename_edges rename_inputsrename_outputsrename_initializersrename_value_infosinplacename_mapc 6 [U5[La [S5eU(d[5n U RU5 OUn S[S[S[4Sjn U c0n U(aMU R H=n U R H n U "X5X'M U RH n U "X5X'M M? U(a1U R H!nU "XR5XR'M# U(a1U RH!nU "XR5XR'M# U(afU R HVn U "XR5U lU RH,nUR(dM[URUSU S9 M. MX U(aU RH#nU "UUR5U UR'M% U RHknU "UURR5U URR'U "UURR5U URR'Mm U(a1U R H!nU "XR5XR'M# U R Hn [#U R5H-unnU RUU ;dMU UU RU'M/ [#U R 5H-unnU R UU ;dMU UU R U'M/ M U R H)nURU ;dMU URUlM+ U RH)nURU ;dMU URUlM+ U RH)nURU ;dMU URUlM+ U RHnURRU ;a(U URRURlURRU ;dMaU URRURlM U R H)nURU ;dMU URUlM+ U $)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 graphrFr6rc,[U5S:aX-$U$)Nr)rM)rFr6s r _prefixed#add_prefix_graph.._prefixeds #D A v}747rT)rr)r3r r4rKr5r$r%r'r6 attributerlrLr1r2r7r8r0rT)r rFrrrrrrrrrlrr)r=rrrr sparse_initr*r'input_in_descout_descr1r2r0s rrLrLsD E{*$>??  L 5 8#8S8S8AWW'2 XX'2  WWE#,VZZ#@HZZ XXE#,VZZ#@HZZ Avvv.AF[[ ;;;$! VTH)MMD"+FDII">HTYY "//K09 **//1H['',, -2; ++002H[((-- . 0\\E#,VZZ#@HZZ "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# Hrrrename_functionsc T[U5[La [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) r3r r4rKrLr rr6r$op_type)rrFrrrrrrrrm f_name_mapr new_f_namer)s rrrsD E{*$>??  L 5 !!#%/-  A&&J!+qvv F! AVV99 * *99 5AI! !!AyyJ&&yy1 " Lrdim_idxcd[U5[La [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 RR$R&R(Vs/sHoR*PM nnUR-US5 URR[R."U R U RR$R0U55 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.)r6 data_typedimsvals)r?r@r6rr Unsqueezez unsqueeze-)r?r@r6)r3r r4rKr'r6r$rTr%r&r make_node make_tensorr INT64rSrMpop tensor_typeshapedim dim_valueinsertmake_tensor_value_info elem_type)r rrrlr'orig_out_namesr)r*outinp expand_dim_krIr+ prev_outputd new_shapes rexpand_out_dim_graphr\sJ( E{*$>??  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(J-c[U5[La [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)r3r r4rKrr )rrrrs rexpand_out_dimrsS( E{*$>??  L 5  Lrr)NNNNNN) NNNNNNzonnx.compose.merge_modelsz1.0r#r.)TTTTTTFN)TTTTTTTF)F)typingrrrrrronnxr r r r r rr5r>rtintrboolrLrrrrrrs DCLLOSBB"B,4T%S/5J,KB %T#Y  BR#'#'!! $x x x  sCx !x  T#Y  x d3i x c] x c]x  3-x  x x ~#'#'!! $#>&+#$OOO sCx !O T#Y  O d3i O c] Oc]O 3-O OC=OsmO SMOC=OOj$(#'$(%)*.)-#)-r r r 4.r 4. r D> r TN r "$r !r d^r tCH~&r r p$(#'$(%)*.)-'+#G G G4.G4. G D> G TN G"$G!GtnGd^GGZ$M M M d^M  M f$! ! !d^! !r