z i)FSrSSKJr SSKJr SSKJrJr "SS\5rg)zFCollect sequences of uninterrupted gates acting on a number of qubits.) AnalysisPass)Gate) DAGOpNode DAGInNodecB^\rSrSrSrSU4SjjrSrSrSrSr U=r $) CollectMultiQBlocksaCollect sequences of uninterrupted gates acting on groups of qubits. ``max_block_size`` specifies the maximum number of qubits that can be acted upon by any single group of gates Traverse the DAG and find blocks of gates that act consecutively on groups of qubits. Write the blocks to ``property_set`` as a list of blocks of the form:: [[g0, g1, g2], [g4, g5]] Blocks are reported in a valid topological order. Further, the gates within each block are also reported in topological order Some gates may not be present in any block (e.g. if the number of operands is greater than ``max_block_size``) By default, blocks are collected in the direction from the inputs towards the outputs of the DAG. The option ``collect_from_back`` allows to change this direction, that is to collect blocks from the outputs towards the inputs. Note that the blocks are still reported in a valid topological order. A Disjoint Set Union data structure (DSU) is used to maintain blocks as gates are processed. This data structure points each qubit to a set at all times and the sets correspond to current blocks. These change over time and the data structure allows these changes to be done quickly. cd>[TU]5 0Ul0Ul0UlXlX lg)N)super__init__parent bit_groups gate_groupsmax_block_sizecollect_from_back)selfrr __class__s y/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/transpiler/passes/optimization/collect_multiqubit_blocks.pyr CollectMultiQBlocks.__init__/s2  ,!2cXR;a-XRU'U/URU'/URU'URUU:XaU$URURU5URU'URU$)zDSU function for finding root of set of items If my parent is myself, I am the root. Otherwise we recursively find the root for my parent. After that, we assign my parent to be my root, saving recursion in the future. )r rrfind_set)rindexs rrCollectMultiQBlocks.find_set;s  #!&KK &+WDOOE "&(D  U # ;;u  &L!]]4;;u+=> E{{5!!rcURU5nURU5nX:Xag[URU5[URU5:aX!p!XRU'URUR URU5 UR UR UR U5 URUR 5 UR UR 5 g)zDSU function for unioning two sets together Find the roots of each set. Then assign one to have the other as its parent, thus liking the sets. Merges smaller set into larger set in order to have better runtime N)rlenrr extendrclear)rset1set2s r union_setCollectMultiQBlocks.union_setKs}}T"}}T" <  t% &T-=-=d-C)D D$ D %%d&6&6t&<= $$T__T%:; $$& ##%rc@ 0Ul0Ul0Ul/nSnURUS9nUR(a[ [ U55nUGHnSnSn[URSS5c>URR5(d[UR[5(dSnURVs1sHoRU5RiM n nU(aj[5n U H#nU R!UR#U55 M% Sn U Hn U [%URU 5- n M XR&:aSnU(dU HnUR#U5n[%URU5S:XaM2UR)URUSS5 [URU5n U H0nXRU'U/URU'/URU'M2 M U(Gac0nSn U H`nUR#U5nUU;a UUS- UU'M'[%URU5S- UU'U [%URU5- n Mb /nUR+5HunnUR)UU45 M UR-SS 9 XR&- nUHnUS:dM UUS- n[%URUS5S:a$UR)URUSSS5 [URUS5n U H0nXRU'U/URU'/URU'M2 M U(dGM([%U 5UR&:aGMDS nU HnUS :waUR/UU5 UnM URUR#U5R)U5 GM URR+5HMunnUU:XdM[%URU5S:wdM,UR)URUSS5 MO UR(aUSSS 2Vs/sH nUSSS 2PM nnX R0S 'U$s snfs snf) aRun the CollectMultiQBlocks pass on `dag`. The blocks contain "op" nodes in topological sort order such that all gates in a block act on the same set of qubits and are adjacent in the circuit. The blocks are built by examining predecessors and successors of "cx" gates in the circuit. u1, u2, u3, cx, id gates will be included. After the execution, ``property_set['block_list']`` is set to a list of tuples of ``DAGNode`` objects cd[U[5(ag[U[5(dg[UR[5(aeURR 5(d[ URSS5bgS[[S5[UR5-5-$g)aspecial key function for topological ordering. Heuristic for this is to push all gates involving measurement or barriers, etc. as far back as possible (because they force blocks to end). After that, we process gates in order of lowest number of qubits acted on to largest number of qubits acted on because these have less chance of increasing the size of blocks The key also processes all the non operation notes first so that input nodes do not mess with the top sort of op nodes ad _conditionNcb) isinstancerropris_parameterizedgetattrchrordrqargs)xs r collect_key,CollectMultiQBlocks.run..collect_keyrs!Y''a++!$$%%44((**gaddL$.O.[SSCL!8999r)keyTFr'Nr)reverse block_list)r rrtopological_op_nodesrreversedlistr-r+r,r*rr0find_bitrsetaddrrrappenditemssortr! property_set)rdagr8r2op_nodesnd can_process makes_too_bigbit cur_qubitsc_topstot_sizegroupcur_setvsavingstopslistitemvalue savings_needprevrblocks rrunCollectMultiQBlocks.run^sL   (++ +<  ! !X/HBK!M|T2>55))++!"%%..# =?XXFXc,,s+11XJF%CJJt}}S12&#EDOOE$: ;;H$111$(M%C--,C4++C01Q6 %%d&6&6s&;A&>?!$//#"67G$)* A./S*.0((+ %&%C--,Cg~'.s|a'7 '*4??3+?'@1'D  C(<$== &#*==?KD%LL%/$3 4 ('*=*== !D $a''3d1g'= t//Q89Q>&--d.>.>tAw.G.JK"%dood1g&>"?!(A-.KKN23DOOA.24D,,Q/")" {z?T%8%88 %CrztS1D&  t!45<res"M52^,^r