bIgDddlmZddlZddlmZdZGddeZGddeZGd d eZ Gd d eZ y) ) annotationsN)OpRunct|tjr#|jdk7rt d|d|d}t |}t |jdk(r|dk(rtj|jddddf}|dk(rFtj|||dz }|ddd|f}||tj|||ff}nGtj| ||dz }|ddd|f}||tj|||f f}|||f}||fStj||}tj||}|r.tj||}tj||}tj|}tj|||} tj|||} | | fS) zSee function `_kneighbors_reduce_func `_. zk must be an integer not .rN)axiskthr ) isinstancenpndarraysize RuntimeErrorintlenshapearange argpartitionargsortsortfliptake) Xkr largest sample_rangesorted_indicessorted_distances sorted_valuesarktopk_sorted_indicestopk_sorted_valuess W/var/www/html/answerous/venv/lib/python3.12/site-packages/onnx/reference/ops/op_topk.pytopk_sorted_implementationr% s !RZZ 66Q;!:1%qAB B aD AA 177|qTQYyy,QW5 a<__QTq1uEN+ArrE2N+bjj<+G)HIIN __aRdAFN+ArrE2N+bjj!L.,H*I)IJJN\>9://ZZ-NGGAD)Md; D9 ))A,C''.#DA$? 2 22ceZdZddZy) _CommonTopKc|d}|dk\r|n|t|jz}t||||\}}||jtj fS)Runtime for operator *TopK*. The implementation is not the most efficient as it sorts everything then extracts the top *k* values. .. warning:: ONNX specifications may be imprecise in case of negative value for axis. The implementation follows what `onnxruntime` does in `top_k.cc `_. r)rrr%astyper int64)selfdatainkr rrrsortis r$ _common_runz_CommonTopK._common_run5sS Fqyttc$**o'=0q$H eell288,--r&N)r)__name__ __module__ __qualname__r1r&r$r(r(4s.r&r(ceZdZddZy)TopK_1Nc6tj|||g|Sr*r r(r1)r-r.rr s r$_runz TopK_1._runHs &&tTA3T&BBr&)NNr2r3r4r;r5r&r$r7r7G Cr&r7ceZdZddZy)TopK_10Nc4tj||||Sr9r:)r-r.r/r s r$r;z TopK_10._runXs&&tT3T&BBr&)Nr<r5r&r$r?r?Wr=r&r?ceZdZ ddZy)TopK_11NcT|dvr tdtj|||||S)aRuntime for operator *TopK*. The implementation is not the most efficient as it sorts everything then extracts the top *k* values. .. warning:: ONNX specifications may be imprecise in case of negative value for axis. The implementation follows what `onnxruntime` does in `top_k.cc `_. )Trz.TopK does not implement anything for sorted=0.)r r)rr(r1)r-r.r/r rsorteds r$r;z TopK_11._runhs4(  "OP P&&tT3T7&SSr&)NNNr<r5r&r$rBrBgs  Tr&rB) __future__rnumpyr onnx.reference.op_runrr%r(r7r?rBr5r&r$rHsL#'&3R.%.& C[ C Ck C TkTr&