@stdlib/blas-ext-base-gsort2hp
Version:
Simultaneously sort two strided arrays based on the sort order of the first array using heapsort.
8 lines (7 loc) • 1.59 kB
JavaScript
;var m=function(c,w){return function(){return w||c((w={exports:{}}).exports,w),w.exports}};var z=m(function(M,R){
var o=require('@stdlib/math-base-assert-is-positive-zero/dist'),O=require('@stdlib/math-base-assert-is-nan/dist'),F=require('@stdlib/math-base-special-floor/dist');function G(c,w,r,v,i,e){var u,q,p,n,a,b,k,g,j,P,h,l,Z;if(c<=0||w===0)return r;for(w<0&&(v*=-1,e*=-1),v<0?u=(1-c)*v:u=0,e<0?q=(1-c)*e:q=0,h=c,p=F(c/2);;){if(p>0)p-=1,k=r[u+p*v],g=i[q+p*e];else{if(h-=1,h===0)return r;j=u+h*v,k=r[j],P=q+h*e,g=i[P],r[j]=r[u],i[P]=i[q]}for(l=p,n=l*2+1;n<h&&(Z=n+1,Z<h&&(a=r[u+Z*v],b=r[u+n*v],(a>b||O(a)||a===b&&o(a))&&(n+=1)),a=r[u+n*v],a>k||O(a)||a===k&&o(a));)r[u+l*v]=a,i[q+l*e]=i[q+n*e],l=n,n=l*2+1;r[u+l*v]=k,i[q+l*e]=g}}R.exports=G
});var D=m(function(Q,C){
var A=require('@stdlib/math-base-assert-is-positive-zero/dist'),B=require('@stdlib/math-base-assert-is-nan/dist'),H=require('@stdlib/math-base-special-floor/dist');function I(c,w,r,v,i,e,u,q){var p,n,a,b,k,g,j,P,h,l,Z;if(c<=0||w===0)return r;for(w<0&&(v*=-1,u*=-1,i-=(c-1)*v,q-=(c-1)*u),h=c,p=H(c/2);;){if(p>0)p-=1,k=r[i+p*v],g=e[q+p*u];else{if(h-=1,h===0)return r;j=i+h*v,k=r[j],P=q+h*u,g=e[P],r[j]=r[i],e[P]=e[q]}for(l=p,n=l*2+1;n<h&&(Z=n+1,Z<h&&(a=r[i+Z*v],b=r[i+n*v],(a>b||B(a)||a===b&&A(a))&&(n+=1)),a=r[i+n*v],a>k||B(a)||a===k&&A(a));)r[i+l*v]=a,e[q+l*u]=e[q+n*u],l=n,n=l*2+1;r[i+l*v]=k,e[q+l*u]=g}}C.exports=I
});var J=require('@stdlib/utils-define-nonenumerable-read-only-property/dist'),E=z(),K=D();J(E,"ndarray",K);module.exports=E;
/** @license Apache-2.0 */
//# sourceMappingURL=index.js.map