§
    ˆ7¹jb3  ã            	       ó°  — U d Z ddlmZ ddlZddlZddlmZ ed         Z e	h d£¦  «        Z
e	e         ed<   ej        dej        dej        d	ej        d
ej        fd„¦   «         Zdeddfd„Zdej        ddfd„Zdej        dej        fd„Zdej        dej        fd„Zdej        dedeej        ej        f         fd„Zddœdej        dedej        fd„ZdS )a,  Triton implementation of batched rectangular linear assignment.

Purpose:
    Provide the private CUDA implementation selected by ``assignment.py`` on
    supported Linux NVIDIA systems. The module owns no public dispatch policy;
    importing it is deliberately deferred until the caller has established that
    CUDA, the Torch version, and the GPU capability are eligible.

Scope:
    One Triton program solves one batch item. The program is intentionally
    correctness-first: outer augmenting-path steps remain sequential while each
    current set of candidate columns is processed as a masked lane vector.
    Per-search state remains program-local. The correctness launch currently
    keeps its loop-carried vectors within one warp; wider launch configurations
    remain gated on exact GPU parity. Its ordering reproduces the legacy CUDA
    and SciPy rectangular-LSAP algorithm.

Usage:
    ``batch_linear_assignment(cuda_cost)`` accepts a three-dimensional CUDA
    cost tensor and returns the stable public ``(B, W)`` long assignment shape.
    The optional validation setting is private benchmark instrumentation; normal
    dispatch always uses the default full validation.

Outputs:
    The kernel writes assignment and temporary Torch workspaces on the input
    device. The wrapper returns worker-to-task indices, using ``-1`` for an
    unmatched worker, and raises ordinary ``ValueError`` exceptions for invalid
    numeric values or infeasible matrices.

Failure:
    NaN and negative infinity are rejected by one host reduction before launch.
    The kernel records one infeasibility flag per batch item instead of asserting
    on device; the normal wrapper synchronizes once to turn any flag into an
    exception. Triton import, compilation, and GPU execution failures are not
    swallowed because they do not mean the optional dependency is merely absent.

Used by:
    ``torch_linear_assignment.assignment.batch_linear_assignment_cuda``. The
    module is private so its benchmark validation switch and workspace layout do
    not become part of the package API.
é    )ÚLiteralN)ÚfullÚoffÚnonfinite_onlyÚinfeasibility_flag_only>   r   r   r   r   Ú_VALIDATION_MODESÚNUM_ROWSÚNUM_COLUMNSÚBLOCK_NÚIS_FP64c
           
      ó  — t          j        d¦  «        }
t          j        d|¦  «        }||k     }||k     }| |
|z  |z  z   } ||
|z  z   }||
|z  z   }||
|z  z   }||
|z  z   }t          j        d|d¬¦  «        D �]}t          j        |ft           j        ¦  «        }t          j        |ft           j        ¦  «        }|}||z
  dz
  }t          j        |fdt           j        ¦  «        }|	rOt          j        |ft          d¦  «        t           j	        ¦  «        }t          j        |ft           j	        ¦  «        }nNt          j        |ft          d¦  «        t           j
        ¦  «        }t          j        |ft           j
        ¦  «        }d}t          j        ||z   ¦  «        }||z
  }|}|}d}|�r||||k    z  |z  z  }||z  }|}|t          j        ||z   ¦  «        z
  t          j        | ||z  z   |z   |t          d¦  «        ¬¦  «        z   t          j        ||z   |d¬¦  «        z
  }|||k     z  }t          j        |||¦  «        } | }t          j        |||¦  «        }t          j        t          j        || t          d¦  «        ¦  «        d¬	¦  «        }!|!t          d¦  «        k    }"||"z  }#|| |!k    z  }$t          j        ||z   |d¬¦  «        }%t          j        t          j        |$|%dk    z  |d¦  «        d¬	¦  «        }&t          j        t          j        |$||¦  «        d¬	¦  «        }'t          j        |&dk    |&|'¦  «        }(t          j        t          j        |||(k    z  |d¦  «        d¬	¦  «        })t          j        |#|)d¦  «        })t          j        ||)z   ¦  «        }*|#|*dk    z  }+t          j        |||*k    z  |+z  |!|¦  «        }t          j        |#|*dk    z  |)|¦  «        }t          j        |+|*|¦  «        }||||)k    z  |#z  z  }|dz
  },t          j        t          j        |||,k    z  |d¦  «        d¬	¦  «        }-t          j        |||-k    z  |#z  |(|¦  «        }|||)k    |#z   z  }t          j        |#|dz
  |¦  «        }t          j        |#|!|¦  «        }t          j        ||
z   d||" z  ¬
¦  «         |+}|�°|dk    }.t          j        ||
z   d|. ¬
¦  «         t          j        ||z   ||z   |.¬
¦  «         |}/|.|z  |/z  ||k    z  }0t          j        ||z   t          j        ||z   |d¬¦  «        |z   |z
  |0¬
¦  «         |.|z  |z  }1t          j        ||z   t          j        ||z   |d¬¦  «        |z
  |z   |1¬
¦  «         |.}2|}3d}4|2|4|k     z  rÕt          j        |2|3d¦  «        }5t          j        t          j        |||5k    z  |d¦  «        d¬	¦  «        }6t          j        |2|6d¦  «        }7t          j        ||7z   ¦  «        }8t          j        ||5z   |6|2¬
¦  «         t          j        ||7z   |3|2¬
¦  «         |2|6|k    z  }2t          j        |2|8|3¦  «        }3|4dz  }4|2|4|k     z  °Õt          j        ¦   «          �Œ	dS )zDSolve one rectangular assignment problem in a single Triton program.r   é   )Ú
num_stageséÿÿÿÿÚinfT)ÚmaskÚotherg        )Úaxis)r   N)ÚtlÚ
program_idÚarangeÚrangeÚzerosÚint1r   Úint32ÚfloatÚfloat64Úfloat32ÚloadÚwhereÚminÚmaxÚstoreÚdebug_barrier)9ÚcostÚuÚvÚcol4rowÚrow4colÚ
infeasibler	   r
   r   r   Úbatch_indexÚlaneÚcolumn_maskÚrow_maskÚcurrent_rowÚscanned_rowsÚscanned_columnsÚactive_columnsÚscan_positionsÚpathÚshortest_path_costsÚscanned_row_costsÚsinkÚcurrent_potentialÚ	min_valueÚ
search_rowÚnum_remainingÚ	searchingÚcandidate_maskÚprevious_costÚreduced_costÚimprovedÚcandidate_costÚlowestÚhas_candidateÚ
step_validÚtiedÚmatched_rowsÚlast_unmatched_positionÚfirst_tied_positionÚselected_positionÚselected_columnÚselected_rowÚmatched_stepÚ
last_indexÚlast_columnÚsolvedÚvisited_rowsÚ
update_rowÚupdate_columnÚ
augmentingÚaugmenting_columnÚaugmentation_stepsÚsafe_columnÚaugmenting_rowÚsafe_rowÚprevious_columns9                                                            úo/root/private/project/pallet_detection_v2/.venv/lib/python3.11/site-packages/torch_linear_assignment/_triton.pyÚ_linear_assignment_kernelr[   5   s•  € õ ”- Ñ"Ô"€KÝŒ9�Q˜Ñ Ô €DØ˜Ò$€KØ�hŠ€Hà�+ Ñ(¨;Ñ6Ñ6€DØ	ˆK˜(Ñ"Ñ"€AØ	ˆK˜+Ñ%Ñ%€AØ˜ hÑ.Ñ.€GØ˜ kÑ1Ñ1€Gå”x  8¸Ð:Ñ:Ô:ð Oñ OˆÝ”x  
­B¬GÑ4Ô4ˆÝœ( G :­r¬wÑ7Ô7ˆØ$ˆØ$ tÑ+¨aÑ/ˆÝŒw˜�z 2¥r¤xÑ0Ô0ˆØð 	AÝ"$¤'¨7¨*µe¸E±l´lÅBÄJÑ"OÔ"OÐÝ "¤¨'¨µR´ZÑ @Ô @ÐÐå"$¤'¨7¨*µe¸E±l´lÅBÄJÑ"OÔ"OÐÝ "¤¨'¨µR´ZÑ @Ô @ÐàˆÝœG A¨¡OÑ4Ô4Ðà%Ð(9Ñ9ˆ	Ø ˆ
Ø#ˆð ˆ	Øñ P	%Ø'¨8°t¸zÒ7IÑ+JÈYÑ+VÑWˆLØ+¨iÑ7ˆNØ/ˆMàÝ”'˜!˜j™.Ñ)Ô)ñ*å”'Ø˜:¨Ñ3Ñ3°dÑ:Ø'Ý ™,œ,ðñ ô ñõ ”'˜!˜d™(¨¸sÐCÑCÔCñDð ð &¨¸Ò)EÑFˆHÝœX h°¸mÑLÔLˆNØ"0ÐÝ”8˜H j°$Ñ7Ô7ˆDõ
 ”VÝ”˜¨½¸u¹¼ÑFÔFØðñ ô ˆFð #¥e¨E¡l¤lÒ2ˆMØ" ]Ñ2ˆJØ! ^°vÒ%=Ñ>ˆDÝœ7 7¨T¡>¸ÈaÐPÑPÔPˆLÝ&(¤fÝ”˜ °Ò!3Ñ4°nÀbÑIÔIØð'ñ 'ô 'Ð#õ #%¤&Ý”˜˜~¨{Ñ;Ô;Øð#ñ #ô #Ðõ !#¤Ø'¨1Ò,Ø'Ø#ñ!ô !Ðõ
 !œfÝ”˜¨>Ð=NÒ+NÑOÐQUÐWYÑZÔZØðñ ô ˆOõ !œh z°?ÀAÑFÔFˆOÝœ7 7¨_Ñ#<Ñ=Ô=ˆLð
 &¨¸Ò);Ñ<ˆLÝ "¤Ø˜D LÒ0Ñ1°LÑ@ØØ!ñ!ô !Ðõ
 ”8˜J¨,¸"Ò*<Ñ=¸ÐPTÑUÔUˆDÝœØØØñô ˆJð
 .°ÀÈÒ@WÑ1XÐ[eÑ1eÑfˆOØ&¨Ñ*ˆJÝœ&Ý”˜¨>¸ZÒ+GÑHÈ$ÐPRÑSÔSØðñ ô ˆKõ  œXØ $¨+Ò"5Ñ6¸ÑCØ!Øñô ˆNð
 ,°¸Ò1HÈJÑ0VÐ.WÑWˆNÝœH Z°ÀÑ1BÀMÑRÔRˆMÝœ ¨V°YÑ?Ô?ˆIÝŒH�Z +Ñ-¨q°yÀMÀ>Ñ7QÐRÑRÔRÐRØ$ˆIða ñ P	%ðd ˜’ˆÝ
Œ�˜kÑ)¨1°F°7Ð;Ñ;Ô;Ð;å
Œ��[‘Ð"3°iÑ"?ÀfÐMÑMÔMÐMØ#ˆØ˜hÑ&¨Ñ5¸ÀÒ9LÑMˆ
Ý
ŒØ�‰HÝŒG�A˜‘H 8°3Ð7Ñ7Ô7¸)ÑCÐFWÑWØð	
ñ 	
ô 	
ð 	
ð  Ñ,¨Ñ>ˆÝ
ŒØ�‰HÝŒG�A˜‘H ;°cÐ:Ñ:Ô:¸YÑFÐI\Ñ\Øð	
ñ 	
ô 	
ð 	
ð ˆ
Ø ÐØÐàÐ.°Ò9Ñ:ð 	$Ýœ( :Ð/@À!ÑDÔDˆKÝœVÝ”˜¨°Ò(;Ñ<¸dÀBÑGÔGØðñ ô ˆNõ ”x 
¨N¸AÑ>Ô>ˆHÝ œg g°Ñ&8Ñ9Ô9ˆOÝŒH�W˜{Ñ*¨NÀÐLÑLÔLÐLÝŒH�W˜xÑ'Ð):ÀÐLÑLÔLÐLØ# ~¸Ò'DÑEˆJÝ "¤¨°_ÐFWÑ XÔ XÐØ !Ñ#Ðð Ð.°Ò9Ñ:ð 	$õ 	ÔÑÔÐÑð_Oð Oó    Ú
validationÚreturnc                 ó>   — | t           vrt          d| ›d�¦  «        ‚dS )z7Reject an unsupported private validation configuration.z Unknown Triton validation mode: ú.N)r   Ú
ValueError©r]   s    rZ   Ú_validate_moderc   à   s0   € àÕ*Ð*Ð*ÝÐK¸JÐKÐKÐKÑLÔLÐLð +Ð*r\   r%   c                 ó(  — |                       ¦   «         sdS t          j        t          j        | ¦  «        t          j        | ¦  «        ¦  «                             ¦   «         }t          |                     ¦   «         ¦  «        rt          d¦  «        ‚dS )zDRaise the SciPy-compatible error for NaN or negative-infinite costs.Nz'matrix contains invalid numeric entries)	Úis_floating_pointÚtorchÚ
logical_orÚisnanÚisneginfÚanyÚboolÚitemra   )r%   Úinvalids     rZ   Ú_reject_invalid_numeric_entriesrn   æ   s�   € à×!Ò!Ñ#Ô#ð ØˆÝÔ�uœ{¨4Ñ0Ô0µ%´.ÀÑ2FÔ2FÑGÔG×KÒKÑMÔM€GÝˆG�LŠL‰NŒNÑÔð DÝÐBÑCÔCÐCðDð Dr\   c                 ón   — | j         t          j        k    r| S |                      t          j        ¦  «        S )zGPreserve float64 costs and promote every other solver input to float32.)Údtyperf   r   Útor   )r%   s    rZ   Ú_solver_cost_dtyperr   ï   s*   € à„z•U”]Ò"Ð"ØˆØ�7Š7•5”=Ñ!Ô!Ð!r\   c                 ój   — | j         \  }}}t          j        ||fdt          j        | j        ¬¦  «        S )zHReturn the public assignment shape without launching a zero-size kernel.r   )rp   Údevice)Úshaperf   r   Úlongrt   )r%   Ú
batch_sizeÚworkersÚ_s       rZ   Ú_empty_assignmentrz   ö   s2   € à!œZÑ€J�˜ÝŒ:�z 7Ð+¨Rµu´zÈ$Ì+ÐVÑVÔVÐVr\   c                 óV  — | j         \  }}}t          j        |¦  «        }d| j        i}i |¥d| j        i¥}i |¥dt
          j        i¥}t          j        ||ffi |¤Ž}	t          j        ||ffi |¤Ž}
t          j        ||fdfi |¤Ž}t          j        ||fdfi |¤Ž}t          j        |ffi |¤Ž}t          |f         | |	|
||||||| j        t
          j
        k    d¬¦  «         |dv rBt          |                     ¦   «                              ¦   «         ¦  «        rt          d¦  «        ‚||fS )zILaunch the one-program-per-batch kernel and return both assignment views.rt   rp   r   r   )r	   r
   r   r   Ú	num_warps>   r   r   zcost matrix is infeasible)ru   ÚtritonÚnext_power_of_2rt   rp   rf   r   r   r   r[   r   rk   rj   rl   ra   )r%   r]   rw   ÚrowsÚcolumnsÚblock_nÚworkspace_optionsÚscalar_optionsÚinteger_optionsr&   r'   r(   r)   r*   s                 rZ   Ú_solver…   ü   s}  € à $¤
Ñ€J��gÝÔ$ WÑ-Ô-€GØ! 4¤;Ð/ÐØ?Ð)Ð?¨7°D´JÐ?Ð?€NØAÐ*ÐA¨GµU´[ÐAÐA€OÝŒ�Z Ð&Ð9Ð9¨.Ð9Ð9€AÝŒ�Z Ð)Ð<Ð<¨^Ð<Ð<€AÝŒj˜* dÐ+¨RÐCÐC°?ÐCÐC€GÝŒj˜* gÐ.°ÐFÐF°oÐFÐF€GÝ”˜j˜]Ð>Ð>¨oÐ>Ð>€Jå˜z˜mÔ,ØØ	Ø	ØØØØØØØ”
�eœmÒ+ð ðñ ô ð ð Ð8Ð8Ð8½TÀ*Ç.Â.ÑBRÔBR×BWÒBWÑBYÔBYÑ=ZÔ=ZÐ8ÝÐ4Ñ5Ô5Ð5Ø�GÐÐr\   r   rb   c                óî  — t          |¦  «         | j        dk    rt          d¦  «        ‚| j        st          d¦  «        ‚|dv rt	          | ¦  «         t          | ¦  «        } | j        \  }}}|dk    s|dk    s|dk    rt          | ¦  «        S t          j	         
                    dd¬¦  «        5  ||k     rdt          |                      d	d
¦  «                             ¦   «         |¦  «        \  }}|                     t          j        ¦  «        cddd¦  «         S t          |                      ¦   «         |¦  «        \  }}|                     t          j        ¦  «        cddd¦  «         S # 1 swxY w Y   dS )zJSolve a CUDA batch with full validation unless private benchmarks opt out.é   z/Need 3-dimensional tensor with shape (B, W, T).z0Triton linear assignment requires a CUDA tensor.>   r   r   r   ÚcudaF)Úenabledr   é   N)rc   Úndimra   Úis_cudarn   rr   ru   rz   rf   ÚampÚautocastr…   Ú	transposeÚ
contiguousrq   rv   )r%   r]   rw   rx   Útasksry   r)   r(   s           rZ   Úbatch_linear_assignmentr’     sÀ  € õ �:ÑÔÐØ„y�A‚~€~ÝÐJÑKÔKÐKØŒ<ð MÝÐKÑLÔLÐLØÐ/Ð/Ð/Ý'¨Ñ-Ô-Ð-å˜dÑ#Ô#€DØ!%¤Ñ€J�˜Ø�Q‚€˜' Qš,˜,¨%°1ª*¨*Ý  Ñ&Ô&Ð&å	Œ×	Ò	˜F¨EÐ	Ñ	2Ô	2ð &ð &Ø�7Š?ˆ?Ý §¢¨q°!Ñ 4Ô 4× ?Ò ?Ñ AÔ AÀ:ÑNÔN‰JˆAˆwØ—:’:�eœjÑ)Ô)ð&ð &ð &ð &ñ &ô &ð &ð &õ ˜DŸOšOÑ-Ô-¨zÑ:Ô:‰
ˆ�Ø�zŠz�%œ*Ñ%Ô%ð&ð &ð &ð &ñ &ô &ð &ð &ð &ð &ð &ð &øøøð &ð &ð &ð &ð &ð &s   Â/AE*ÄAE*Å*E.Å1E.)Ú__doc__Útypingr   rf   r}   Útriton.languageÚlanguager   ÚValidationModeÚ	frozensetr   ÚstrÚ__annotations__ÚjitÚ	constexprr[   rc   ÚTensorrn   rr   rz   Útupler…   r’   © r\   rZ   ú<module>r       s  ðð(ð (ð (ðT Ð Ð Ð Ð Ð à €€€Ø €€€Ø Ð Ð Ð Ð Ð àÐSÔT€Ø$- IÐ.jÐ.jÐ.jÑ$kÔ$kÐ �9˜S”>Ð kÐ kÑ kð „ðgð Œlðgð ”ðgð Œ\ðgð Œ\ðgð gð gñ „ðgðTM˜~ð M°$ð Mð Mð Mð MðD¨%¬,ð D¸4ð Dð Dð Dð Dð"˜Uœ\ð "¨e¬lð "ð "ð "ð "ðW˜EœLð W¨U¬\ð Wð Wð Wð Wð�”ð ¨>ð ¸eÀEÄLÐRWÔR^ÐD^Ô>_ð ð ð ð ðH "(ð&ð &ð &Ø
Œ,ð&ð ð&ð „\ð	&ð &ð &ð &ð &ð &r\   