diff --git a/README.md b/README.md
index 35588ac9..bac98e35 100644
--- a/README.md
+++ b/README.md
@@ -311,8 +311,8 @@ Copyright © 2016-2024. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/array.svg
 [npm-url]: https://npmjs.org/package/@stdlib/array
 
-[test-image]: https://github.com/stdlib-js/array/actions/workflows/test.yml/badge.svg?branch=v0.2.1
-[test-url]: https://github.com/stdlib-js/array/actions/workflows/test.yml?query=branch:v0.2.1
+[test-image]: https://github.com/stdlib-js/array/actions/workflows/test.yml/badge.svg?branch=main
+[test-url]: https://github.com/stdlib-js/array/actions/workflows/test.yml?query=branch:main
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/array/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/array?branch=main
diff --git a/dist/index.d.ts b/dist/index.d.ts
deleted file mode 100644
index 15e948f0..00000000
--- a/dist/index.d.ts
+++ /dev/null
@@ -1,3 +0,0 @@
-/// <reference path="../docs/types/index.d.ts" />
-import ns from '../docs/types/index';
-export = ns;
\ No newline at end of file
diff --git a/dist/index.js b/dist/index.js
deleted file mode 100644
index 1ad2beb6..00000000
--- a/dist/index.js
+++ /dev/null
@@ -1,121 +0,0 @@
-"use strict";var f=function(r,e){return function(){return e||r((e={exports:{}}).exports,e),e.exports}};var Ii=f(function(kU,Mi){"use strict";var Ni="function";function e3(r){return typeof r.get===Ni&&typeof r.set===Ni}Mi.exports=e3});var rr=f(function(CU,Ui){"use strict";var t3=Ii();Ui.exports=t3});var Yi=f(function(FU,Gi){"use strict";var Di={float64:i3,float32:a3,int32:n3,int16:u3,int8:o3,uint32:s3,uint16:v3,uint8:f3,uint8c:l3,generic:c3,default:p3};function i3(r,e){return r[e]}function a3(r,e){return r[e]}function n3(r,e){return r[e]}function u3(r,e){return r[e]}function o3(r,e){return r[e]}function s3(r,e){return r[e]}function v3(r,e){return r[e]}function f3(r,e){return r[e]}function l3(r,e){return r[e]}function c3(r,e){return r[e]}function p3(r,e){return r[e]}function m3(r){var e=Di[r];return typeof e=="function"?e:Di.default}Gi.exports=m3});var ur=f(function(LU,Wi){"use strict";var g3=Yi();Wi.exports=g3});var Hi=f(function(zU,Xi){"use strict";var Zi={float64:y3,float32:d3,int32:h3,int16:q3,int8:w3,uint32:x3,uint16:b3,uint8:E3,uint8c:T3,generic:S3,default:A3};function y3(r,e,t){r[e]=t}function d3(r,e,t){r[e]=t}function h3(r,e,t){r[e]=t}function q3(r,e,t){r[e]=t}function w3(r,e,t){r[e]=t}function x3(r,e,t){r[e]=t}function b3(r,e,t){r[e]=t}function E3(r,e,t){r[e]=t}function T3(r,e,t){r[e]=t}function S3(r,e,t){r[e]=t}function A3(r,e,t){r[e]=t}function _3(r){var e=Zi[r];return typeof e=="function"?e:Zi.default}Xi.exports=_3});var ue=f(function(OU,Ki){"use strict";var j3=Hi();Ki.exports=j3});var Qi=f(function(RU,Ji){"use strict";var $i={complex128:V3,complex64:k3,default:C3};function V3(r,e){return r.get(e)}function k3(r,e){return r.get(e)}function C3(r,e){return r.get(e)}function F3(r){var e=$i[r];return typeof e=="function"?e:$i.default}Ji.exports=F3});var er=f(function(BU,ra){"use strict";var L3=Qi();ra.exports=L3});var ia=f(function(PU,ta){"use strict";var ea={complex128:z3,complex64:O3,default:R3};function z3(r,e,t){r.set(t,e)}function O3(r,e,t){r.set(t,e)}function R3(r,e,t){r.set(t,e)}function B3(r){var e=ea[r];return typeof e=="function"?e:ea.default}ta.exports=B3});var oe=f(function(NU,aa){"use strict";var P3=ia();aa.exports=P3});var ua=f(function(MU,na){"use strict";var N3={Float32Array:"float32",Float64Array:"float64",Array:"generic",Int16Array:"int16",Int32Array:"int32",Int8Array:"int8",Uint16Array:"uint16",Uint32Array:"uint32",Uint8Array:"uint8",Uint8ClampedArray:"uint8c",Complex64Array:"complex64",Complex128Array:"complex128"};na.exports=N3});var sa=f(function(IU,oa){"use strict";var M3=typeof Float64Array=="function"?Float64Array:void 0;oa.exports=M3});var fa=f(function(UU,va){"use strict";function I3(){throw new Error("not implemented")}va.exports=I3});var Er=f(function(DU,la){"use strict";var U3=require("@stdlib/assert/has-float64array-support"),D3=sa(),G3=fa(),rt;U3()?rt=D3:rt=G3;la.exports=rt});var pa=f(function(GU,ca){"use strict";var Y3=typeof Float32Array=="function"?Float32Array:void 0;ca.exports=Y3});var ga=f(function(YU,ma){"use strict";function W3(){throw new Error("not implemented")}ma.exports=W3});var Tr=f(function(WU,ya){"use strict";var Z3=require("@stdlib/assert/has-float32array-support"),X3=pa(),H3=ga(),et;Z3()?et=X3:et=H3;ya.exports=et});var ha=f(function(ZU,da){"use strict";var K3=typeof Uint32Array=="function"?Uint32Array:void 0;da.exports=K3});var wa=f(function(XU,qa){"use strict";function $3(){throw new Error("not implemented")}qa.exports=$3});var Ar=f(function(HU,xa){"use strict";var J3=require("@stdlib/assert/has-uint32array-support"),Q3=ha(),rE=wa(),tt;J3()?tt=Q3:tt=rE;xa.exports=tt});var Ea=f(function(KU,ba){"use strict";var eE=typeof Int32Array=="function"?Int32Array:void 0;ba.exports=eE});var Sa=f(function($U,Ta){"use strict";function tE(){throw new Error("not implemented")}Ta.exports=tE});var _r=f(function(JU,Aa){"use strict";var iE=require("@stdlib/assert/has-int32array-support"),aE=Ea(),nE=Sa(),it;iE()?it=aE:it=nE;Aa.exports=it});var ja=f(function(QU,_a){"use strict";var uE=typeof Uint16Array=="function"?Uint16Array:void 0;_a.exports=uE});var ka=f(function(rD,Va){"use strict";function oE(){throw new Error("not implemented")}Va.exports=oE});var jr=f(function(eD,Ca){"use strict";var sE=require("@stdlib/assert/has-uint16array-support"),vE=ja(),fE=ka(),at;sE()?at=vE:at=fE;Ca.exports=at});var La=f(function(tD,Fa){"use strict";var lE=typeof Int16Array=="function"?Int16Array:void 0;Fa.exports=lE});var Oa=f(function(iD,za){"use strict";function cE(){throw new Error("not implemented")}za.exports=cE});var Vr=f(function(aD,Ra){"use strict";var pE=require("@stdlib/assert/has-int16array-support"),mE=La(),gE=Oa(),nt;pE()?nt=mE:nt=gE;Ra.exports=nt});var Pa=f(function(nD,Ba){"use strict";var yE=typeof Uint8Array=="function"?Uint8Array:void 0;Ba.exports=yE});var Ma=f(function(uD,Na){"use strict";function dE(){throw new Error("not implemented")}Na.exports=dE});var kr=f(function(oD,Ia){"use strict";var hE=require("@stdlib/assert/has-uint8array-support"),qE=Pa(),wE=Ma(),ut;hE()?ut=qE:ut=wE;Ia.exports=ut});var Da=f(function(sD,Ua){"use strict";var xE=typeof Uint8ClampedArray=="function"?Uint8ClampedArray:void 0;Ua.exports=xE});var Ya=f(function(vD,Ga){"use strict";function bE(){throw new Error("not implemented")}Ga.exports=bE});var Cr=f(function(fD,Wa){"use strict";var EE=require("@stdlib/assert/has-uint8clampedarray-support"),TE=Da(),SE=Ya(),ot;EE()?ot=TE:ot=SE;Wa.exports=ot});var Xa=f(function(lD,Za){"use strict";var AE=typeof Int8Array=="function"?Int8Array:void 0;Za.exports=AE});var Ka=f(function(cD,Ha){"use strict";function _E(){throw new Error("not implemented")}Ha.exports=_E});var Fr=f(function(pD,$a){"use strict";var jE=require("@stdlib/assert/has-int8array-support"),VE=Xa(),kE=Ka(),st;jE()?st=VE:st=kE;$a.exports=st});var Qa=f(function(mD,Ja){"use strict";var CE=8;function FE(r){return typeof r=="object"&&r!==null&&r.constructor.name==="Complex64Array"&&r.BYTES_PER_ELEMENT===CE}Ja.exports=FE});var Lr=f(function(gD,rn){"use strict";var LE=Qa();rn.exports=LE});var tn=f(function(yD,en){"use strict";var zE=16;function OE(r){return typeof r=="object"&&r!==null&&r.constructor.name==="Complex128Array"&&r.BYTES_PER_ELEMENT===zE}en.exports=OE});var zr=f(function(dD,an){"use strict";var RE=tn();an.exports=RE});var un=f(function(hD,nn){"use strict";var BE=require("@stdlib/assert/is-array-like-object"),PE=require("@stdlib/assert/is-complex-like"),NE=require("@stdlib/complex/realf"),ME=require("@stdlib/complex/imagf"),IE=require("@stdlib/string/format");function UE(r){var e,t,i;for(e=[];t=r.next(),!t.done;)if(i=t.value,BE(i)&&i.length>=2)e.push(i[0],i[1]);else if(PE(i))e.push(NE(i),ME(i));else return new TypeError(IE("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));return e}nn.exports=UE});var sn=f(function(qD,on){"use strict";var DE=require("@stdlib/assert/is-array-like-object"),GE=require("@stdlib/assert/is-complex-like"),YE=require("@stdlib/complex/realf"),WE=require("@stdlib/complex/imagf"),ZE=require("@stdlib/string/format");function XE(r,e,t){var i,a,n,u;for(i=[],u=-1;a=r.next(),!a.done;)if(u+=1,n=e.call(t,a.value,u),DE(n)&&n.length>=2)i.push(n[0],n[1]);else if(GE(n))i.push(YE(n),WE(n));else return new TypeError(ZE("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));return i}on.exports=XE});var fn=f(function(wD,vn){"use strict";var HE=require("@stdlib/assert/is-complex-like"),KE=require("@stdlib/complex/realf"),$E=require("@stdlib/complex/imagf");function JE(r,e){var t,i,a,n;for(t=e.length,n=0,a=0;a<t;a++){if(i=e[a],!HE(i))return null;r[n]=KE(i),r[n+1]=$E(i),n+=2}return r}vn.exports=JE});var hn=f(function(xD,dn){"use strict";var se=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,vt=require("@stdlib/assert/is-array-like-object"),ft=require("@stdlib/assert/is-collection"),ln=require("@stdlib/assert/is-arraybuffer"),cn=require("@stdlib/assert/is-object"),QE=require("@stdlib/assert/is-array"),rT=require("@stdlib/assert/is-string").isPrimitive,tr=require("@stdlib/assert/is-function"),gr=require("@stdlib/assert/is-complex-like"),qe=require("@stdlib/math/base/assert/is-even"),or=require("@stdlib/math/base/assert/is-integer"),eT=Lr(),tT=zr(),iT=require("@stdlib/assert/has-iterator-symbol-support"),$r=require("@stdlib/symbol/iterator"),U=require("@stdlib/utils/define-nonenumerable-read-only-property"),we=require("@stdlib/utils/define-nonenumerable-read-only-accessor"),mr=Tr(),pn=require("@stdlib/complex/float32"),z=require("@stdlib/string/format"),Or=require("@stdlib/complex/realf"),Rr=require("@stdlib/complex/imagf"),aT=require("@stdlib/math/base/special/floor"),nT=require("@stdlib/strided/base/reinterpret-complex64"),uT=require("@stdlib/strided/base/reinterpret-complex128"),oT=ur(),sT=er(),mn=un(),vT=sn(),fT=fn(),sr=mr.BYTES_PER_ELEMENT*2,gn=iT();function X(r){return r instanceof P||typeof r=="object"&&r!==null&&(r.constructor.name==="Complex64Array"||r.constructor.name==="Complex128Array")&&typeof r._length=="number"&&typeof r._buffer=="object"}function yn(r){return r===P||r.name==="Complex128Array"}function vr(r,e){return e*=2,new pn(r[e],r[e+1])}function P(){var r,e,t,i;if(e=arguments.length,!(this instanceof P))return e===0?new P:e===1?new P(arguments[0]):e===2?new P(arguments[0],arguments[1]):new P(arguments[0],arguments[1],arguments[2]);if(e===0)t=new mr(0);else if(e===1)if(se(arguments[0]))t=new mr(arguments[0]*2);else if(ft(arguments[0]))if(t=arguments[0],i=t.length,i&&QE(t)&&gr(t[0])){if(t=fT(new mr(i*2),t),t===null){if(!qe(i))throw new RangeError(z("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",i));t=new mr(arguments[0])}}else{if(eT(t))t=nT(t,0);else if(tT(t))t=uT(t,0);else if(!qe(i))throw new RangeError(z("invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.",i));t=new mr(t)}else if(ln(arguments[0])){if(t=arguments[0],!or(t.byteLength/sr))throw new RangeError(z("invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.",sr,t.byteLength));t=new mr(t)}else if(cn(arguments[0])){if(t=arguments[0],gn===!1)throw new TypeError(z("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",t));if(!tr(t[$r]))throw new TypeError(z("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",t));if(t=t[$r](),!tr(t.next))throw new TypeError(z("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",t));if(t=mn(t),t instanceof Error)throw t;t=new mr(t)}else throw new TypeError(z("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",arguments[0]));else{if(t=arguments[0],!ln(t))throw new TypeError(z("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",t));if(r=arguments[1],!se(r))throw new TypeError(z("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",r));if(!or(r/sr))throw new RangeError(z("invalid argument. Byte offset must be a multiple of %u. Value: `%u`.",sr,r));if(e===2){if(i=t.byteLength-r,!or(i/sr))throw new RangeError(z("invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",sr,i));t=new mr(t,r)}else{if(i=arguments[2],!se(i))throw new TypeError(z("invalid argument. Length must be a nonnegative integer. Value: `%s`.",i));if(i*sr>t.byteLength-r)throw new RangeError(z("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",i*sr));t=new mr(t,r,i*2)}}return U(this,"_buffer",t),U(this,"_length",t.length/2),this}U(P,"BYTES_PER_ELEMENT",sr);U(P,"name","Complex64Array");U(P,"from",function(e){var t,i,a,n,u,o,s,v,l,c,p,m;if(!tr(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!yn(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(i=arguments.length,i>1){if(a=arguments[1],!tr(a))throw new TypeError(z("invalid argument. Second argument must be a function. Value: `%s`.",a));i>2&&(t=arguments[2])}if(X(e)){if(v=e.length,a){for(n=new this(v),u=n._buffer,m=0,p=0;p<v;p++){if(c=a.call(t,e.get(p),p),gr(c))u[m]=Or(c),u[m+1]=Rr(c);else if(vt(c)&&c.length>=2)u[m]=c[0],u[m+1]=c[1];else throw new TypeError(z("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",c));m+=2}return n}return new this(e)}if(ft(e)){if(a){for(v=e.length,e.get&&e.set?s=sT("default"):s=oT("default"),p=0;p<v;p++)if(!gr(s(e,p))){l=!0;break}if(l){if(!qe(v))throw new RangeError(z("invalid argument. First argument must have a length which is a multiple of %u. Length: `%u`.",2,v));for(n=new this(v/2),u=n._buffer,p=0;p<v;p++)u[p]=a.call(t,s(e,p),p);return n}for(n=new this(v),u=n._buffer,m=0,p=0;p<v;p++){if(c=a.call(t,s(e,p),p),gr(c))u[m]=Or(c),u[m+1]=Rr(c);else if(vt(c)&&c.length>=2)u[m]=c[0],u[m+1]=c[1];else throw new TypeError(z("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",c));m+=2}return n}return new this(e)}if(cn(e)&&gn&&tr(e[$r])){if(u=e[$r](),!tr(u.next))throw new TypeError(z("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",e));if(a?o=vT(u,a,t):o=mn(u),o instanceof Error)throw o;for(v=o.length/2,n=new this(v),u=n._buffer,p=0;p<v;p++)u[p]=o[p];return n}throw new TypeError(z("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",e))});U(P,"of",function(){var e,t;if(!tr(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!yn(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=[],t=0;t<arguments.length;t++)e.push(arguments[t]);return new this(e)});U(P.prototype,"at",function(e){if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!or(e))throw new TypeError(z("invalid argument. Must provide an integer. Value: `%s`.",e));if(e<0&&(e+=this._length),!(e<0||e>=this._length))return vr(this._buffer,e)});we(P.prototype,"buffer",function(){return this._buffer.buffer});we(P.prototype,"byteLength",function(){return this._buffer.byteLength});we(P.prototype,"byteOffset",function(){return this._buffer.byteOffset});U(P.prototype,"BYTES_PER_ELEMENT",P.BYTES_PER_ELEMENT);U(P.prototype,"copyWithin",function(e,t){if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return arguments.length===2?this._buffer.copyWithin(e*2,t*2):this._buffer.copyWithin(e*2,t*2,arguments[2]*2),this});U(P.prototype,"entries",function(){var e,t,i,a,n,u,o;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,e=this._buffer,a=this._length,u=-1,o=-2,i={},U(i,"next",s),U(i,"return",v),$r&&U(i,$r,l),i;function s(){var c;return u+=1,n||u>=a?{done:!0}:(o+=2,c=new pn(e[o],e[o+1]),{value:[u,c],done:!1})}function v(c){return n=!0,arguments.length?{value:c,done:!0}:{done:!0}}function l(){return t.entries()}});U(P.prototype,"every",function(e,t){var i,a;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)if(!e.call(t,vr(i,a),a,this))return!1;return!0});U(P.prototype,"fill",function(e,t,i){var a,n,u,o,s,v;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!gr(e))throw new TypeError(z("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(a=this._buffer,n=this._length,arguments.length>1){if(!or(t))throw new TypeError(z("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=n,t<0&&(t=0)),arguments.length>2){if(!or(i))throw new TypeError(z("invalid argument. Third argument must be an integer. Value: `%s`.",i));i<0&&(i+=n,i<0&&(i=0)),i>n&&(i=n)}else i=n}else t=0,i=n;for(o=Or(e),s=Rr(e),v=t;v<i;v++)u=2*v,a[u]=o,a[u+1]=s;return this});U(P.prototype,"filter",function(e,t){var i,a,n,u;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=[],n=0;n<this._length;n++)u=vr(i,n),e.call(t,u,n,this)&&a.push(u);return new this.constructor(a)});U(P.prototype,"find",function(e,t){var i,a,n;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)if(n=vr(i,a),e.call(t,n,a,this))return n});U(P.prototype,"findIndex",function(e,t){var i,a,n;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)if(n=vr(i,a),e.call(t,n,a,this))return a;return-1});U(P.prototype,"findLast",function(e,t){var i,a,n;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=this._length-1;a>=0;a--)if(n=vr(i,a),e.call(t,n,a,this))return n});U(P.prototype,"findLastIndex",function(e,t){var i,a,n;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=this._length-1;a>=0;a--)if(n=vr(i,a),e.call(t,n,a,this))return a;return-1});U(P.prototype,"forEach",function(e,t){var i,a,n;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)n=vr(i,a),e.call(t,n,a,this)});U(P.prototype,"get",function(e){if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!se(e))throw new TypeError(z("invalid argument. Must provide a nonnegative integer. Value: `%s`.",e));if(!(e>=this._length))return vr(this._buffer,e)});U(P.prototype,"includes",function(e,t){var i,a,n,u,o;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!gr(e))throw new TypeError(z("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(arguments.length>1){if(!or(t))throw new TypeError(z("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length,t<0&&(t=0))}else t=0;for(n=Or(e),u=Rr(e),i=this._buffer,o=t;o<this._length;o++)if(a=2*o,n===i[a]&&u===i[a+1])return!0;return!1});U(P.prototype,"indexOf",function(e,t){var i,a,n,u,o;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!gr(e))throw new TypeError(z("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(arguments.length>1){if(!or(t))throw new TypeError(z("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length,t<0&&(t=0))}else t=0;for(n=Or(e),u=Rr(e),i=this._buffer,o=t;o<this._length;o++)if(a=2*o,n===i[a]&&u===i[a+1])return o;return-1});U(P.prototype,"join",function(e){var t,i,a,n;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(arguments.length===0)a=",";else if(rT(e))a=e;else throw new TypeError(z("invalid argument. First argument must be a string. Value: `%s`.",e));for(t=[],i=this._buffer,n=0;n<this._length;n++)t.push(vr(i,n).toString());return t.join(a)});U(P.prototype,"lastIndexOf",function(e,t){var i,a,n,u,o;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!gr(e))throw new TypeError(z("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(arguments.length>1){if(!or(t))throw new TypeError(z("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(n=Or(e),u=Rr(e),i=this._buffer,o=t;o>=0;o--)if(a=2*o,n===i[a]&&u===i[a+1])return o;return-1});we(P.prototype,"length",function(){return this._length});U(P.prototype,"map",function(e,t){var i,a,n,u,o;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(a=this._buffer,n=new this.constructor(this._length),i=n._buffer,u=0;u<this._length;u++)if(o=e.call(t,vr(a,u),u,this),gr(o))i[2*u]=Or(o),i[2*u+1]=Rr(o);else if(vt(o)&&o.length===2)i[2*u]=o[0],i[2*u+1]=o[1];else throw new TypeError(z("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",o));return n});U(P.prototype,"reverse",function(){var e,t,i,a,n,u;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(i=this._length,e=this._buffer,a=aT(i/2),n=0;n<a;n++)u=i-n-1,t=e[2*n],e[2*n]=e[2*u],e[2*u]=t,t=e[2*n+1],e[2*n+1]=e[2*u+1],e[2*u+1]=t;return this});U(P.prototype,"set",function(e){var t,i,a,n,u,o,s,v,l;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(a=this._buffer,arguments.length>1){if(i=arguments[1],!se(i))throw new TypeError(z("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",i))}else i=0;if(gr(e)){if(i>=this._length)throw new RangeError(z("invalid argument. Index argument is out-of-bounds. Value: `%u`.",i));i*=2,a[i]=Or(e),a[i+1]=Rr(e);return}if(X(e)){if(o=e._length,i+o>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=e._buffer,l=a.byteOffset+i*sr,t.buffer===a.buffer&&t.byteOffset<l&&t.byteOffset+t.byteLength>l){for(n=new mr(t.length),v=0;v<t.length;v++)n[v]=t[v];t=n}for(i*=2,l=0,v=0;v<o;v++)a[i]=t[l],a[i+1]=t[l+1],i+=2,l+=2;return}if(ft(e)){for(o=e.length,v=0;v<o;v++)if(!gr(e[v])){u=!0;break}if(u){if(!qe(o))throw new RangeError(z("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",o));if(i+o/2>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=e,l=a.byteOffset+i*sr,t.buffer===a.buffer&&t.byteOffset<l&&t.byteOffset+t.byteLength>l){for(n=new mr(o),v=0;v<o;v++)n[v]=t[v];t=n}for(i*=2,o/=2,l=0,v=0;v<o;v++)a[i]=t[l],a[i+1]=t[l+1],i+=2,l+=2;return}if(i+o>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(i*=2,v=0;v<o;v++)s=e[v],a[i]=Or(s),a[i+1]=Rr(s),i+=2;return}throw new TypeError(z("invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.",e))});U(P.prototype,"slice",function(e,t){var i,a,n,u,o,s,v;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(o=this._buffer,s=this._length,arguments.length===0)e=0,t=s;else{if(!or(e))throw new TypeError(z("invalid argument. First argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=s,e<0&&(e=0)),arguments.length===1)t=s;else{if(!or(t))throw new TypeError(z("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=s,t<0&&(t=0)):t>s&&(t=s)}}for(e<t?i=t-e:i=0,n=new this.constructor(i),a=n._buffer,v=0;v<i;v++)u=2*(v+e),a[2*v]=o[u],a[2*v+1]=o[u+1];return n});U(P.prototype,"some",function(e,t){var i,a;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!tr(e))throw new TypeError(z("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)if(e.call(t,vr(i,a),a,this))return!0;return!1});U(P.prototype,"subarray",function(e,t){var i,a,n;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(a=this._buffer,n=this._length,arguments.length===0)e=0,t=n;else{if(!or(e))throw new TypeError(z("invalid argument. First argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=n,e<0&&(e=0)),arguments.length===1)t=n;else{if(!or(t))throw new TypeError(z("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=n,t<0&&(t=0)):t>n&&(t=n)}}return e>=n?(n=0,i=a.byteLength):e>=t?(n=0,i=a.byteOffset+e*sr):(n=t-e,i=a.byteOffset+e*sr),new this.constructor(a.buffer,i,n<0?0:n)});U(P.prototype,"toReversed",function(){var e,t,i,a,n,u;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(i=this._length,t=new this.constructor(i),a=this._buffer,e=t._buffer,n=0;n<i;n++)u=i-n-1,e[2*n]=a[2*u],e[2*n+1]=a[2*u+1];return t});U(P.prototype,"toString",function(){var e,t,i;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=[],t=this._buffer,i=0;i<this._length;i++)e.push(vr(t,i).toString());return e.join(",")});U(P.prototype,"with",function(e,t){var i,a,n;if(!X(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!or(e))throw new TypeError(z("invalid argument. First argument must be an integer. Value: `%s`.",e));if(n=this._length,e<0&&(e+=n),e<0||e>=n)throw new RangeError(z("invalid argument. Index argument is out-of-bounds. Value: `%s`.",e));if(!gr(t))throw new TypeError(z("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return a=new this.constructor(this._buffer),i=a._buffer,i[2*e]=Or(t),i[2*e+1]=Rr(t),a});dn.exports=P});var Mr=f(function(bD,qn){"use strict";var lT=hn();qn.exports=lT});var xn=f(function(ED,wn){"use strict";var cT=require("@stdlib/assert/is-array-like-object"),pT=require("@stdlib/assert/is-complex-like"),mT=require("@stdlib/string/format"),gT=require("@stdlib/complex/real"),yT=require("@stdlib/complex/imag");function dT(r){var e,t,i;for(e=[];t=r.next(),!t.done;)if(i=t.value,cT(i)&&i.length>=2)e.push(i[0],i[1]);else if(pT(i))e.push(gT(i),yT(i));else return new TypeError(mT("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",i));return e}wn.exports=dT});var En=f(function(TD,bn){"use strict";var hT=require("@stdlib/assert/is-array-like-object"),qT=require("@stdlib/assert/is-complex-like"),wT=require("@stdlib/string/format"),xT=require("@stdlib/complex/real"),bT=require("@stdlib/complex/imag");function ET(r,e,t){var i,a,n,u;for(i=[],u=-1;a=r.next(),!a.done;)if(u+=1,n=e.call(t,a.value,u),hT(n)&&n.length>=2)i.push(n[0],n[1]);else if(qT(n))i.push(xT(n),bT(n));else return new TypeError(wT("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",n));return i}bn.exports=ET});var Sn=f(function(SD,Tn){"use strict";var TT=require("@stdlib/assert/is-complex-like"),ST=require("@stdlib/complex/real"),AT=require("@stdlib/complex/imag");function _T(r,e){var t,i,a,n;for(t=e.length,n=0,a=0;a<t;a++){if(i=e[a],!TT(i))return null;r[n]=ST(i),r[n+1]=AT(i),n+=2}return r}Tn.exports=_T});var Ln=f(function(AD,Fn){"use strict";var ve=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,lt=require("@stdlib/assert/is-array-like-object"),ct=require("@stdlib/assert/is-collection"),An=require("@stdlib/assert/is-arraybuffer"),_n=require("@stdlib/assert/is-object"),jT=require("@stdlib/assert/is-array"),VT=require("@stdlib/assert/is-string"),ir=require("@stdlib/assert/is-function"),dr=require("@stdlib/assert/is-complex-like"),xe=require("@stdlib/math/base/assert/is-even"),hr=require("@stdlib/math/base/assert/is-integer"),kT=Lr(),CT=zr(),FT=require("@stdlib/assert/has-iterator-symbol-support"),Jr=require("@stdlib/symbol/iterator"),G=require("@stdlib/utils/define-nonenumerable-read-only-property"),be=require("@stdlib/utils/define-nonenumerable-read-only-accessor"),yr=Er(),jn=require("@stdlib/complex/float64"),Br=require("@stdlib/complex/real"),Pr=require("@stdlib/complex/imag"),LT=require("@stdlib/math/base/special/floor"),zT=require("@stdlib/strided/base/reinterpret-complex64"),OT=require("@stdlib/strided/base/reinterpret-complex128"),RT=ur(),BT=er(),R=require("@stdlib/string/format"),Vn=xn(),PT=En(),NT=Sn(),fr=yr.BYTES_PER_ELEMENT*2,kn=FT();function K(r){return r instanceof N||typeof r=="object"&&r!==null&&(r.constructor.name==="Complex64Array"||r.constructor.name==="Complex128Array")&&typeof r._length=="number"&&typeof r._buffer=="object"}function Cn(r){return r===N||r.name==="Complex64Array"}function lr(r,e){return e*=2,new jn(r[e],r[e+1])}function N(){var r,e,t,i;if(e=arguments.length,!(this instanceof N))return e===0?new N:e===1?new N(arguments[0]):e===2?new N(arguments[0],arguments[1]):new N(arguments[0],arguments[1],arguments[2]);if(e===0)t=new yr(0);else if(e===1)if(ve(arguments[0]))t=new yr(arguments[0]*2);else if(ct(arguments[0]))if(t=arguments[0],i=t.length,i&&jT(t)&&dr(t[0])){if(t=NT(new yr(i*2),t),t===null){if(!xe(i))throw new RangeError(R("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",i));t=new yr(arguments[0])}}else{if(kT(t))t=zT(t,0);else if(CT(t))t=OT(t,0);else if(!xe(i))throw new RangeError(R("invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.",i));t=new yr(t)}else if(An(arguments[0])){if(t=arguments[0],!hr(t.byteLength/fr))throw new RangeError(R("invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.",fr,t.byteLength));t=new yr(t)}else if(_n(arguments[0])){if(t=arguments[0],kn===!1)throw new TypeError(R("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",t));if(!ir(t[Jr]))throw new TypeError(R("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",t));if(t=t[Jr](),!ir(t.next))throw new TypeError(R("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",t));if(t=Vn(t),t instanceof Error)throw t;t=new yr(t)}else throw new TypeError(R("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",arguments[0]));else{if(t=arguments[0],!An(t))throw new TypeError(R("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",t));if(r=arguments[1],!ve(r))throw new TypeError(R("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",r));if(!hr(r/fr))throw new RangeError(R("invalid argument. Byte offset must be a multiple of %u. Value: `%u`.",fr,r));if(e===2){if(i=t.byteLength-r,!hr(i/fr))throw new RangeError(R("invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",fr,i));t=new yr(t,r)}else{if(i=arguments[2],!ve(i))throw new TypeError(R("invalid argument. Length must be a nonnegative integer. Value: `%s`.",i));if(i*fr>t.byteLength-r)throw new RangeError(R("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",i*fr));t=new yr(t,r,i*2)}}return G(this,"_buffer",t),G(this,"_length",t.length/2),this}G(N,"BYTES_PER_ELEMENT",fr);G(N,"name","Complex128Array");G(N,"from",function(e){var t,i,a,n,u,o,s,v,l,c,p,m;if(!ir(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Cn(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(i=arguments.length,i>1){if(a=arguments[1],!ir(a))throw new TypeError(R("invalid argument. Second argument must be a function. Value: `%s`.",a));i>2&&(t=arguments[2])}if(K(e)){if(v=e.length,a){for(n=new this(v),u=n._buffer,m=0,p=0;p<v;p++){if(c=a.call(t,e.get(p),p),dr(c))u[m]=Br(c),u[m+1]=Pr(c);else if(lt(c)&&c.length>=2)u[m]=c[0],u[m+1]=c[1];else throw new TypeError(R("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",c));m+=2}return n}return new this(e)}if(ct(e)){if(a){for(v=e.length,e.get&&e.set?s=BT("default"):s=RT("default"),p=0;p<v;p++)if(!dr(s(e,p))){l=!0;break}if(l){if(!xe(v))throw new RangeError(R("invalid argument. First argument must have a length which is a multiple of two. Length: `%u`.",v));for(n=new this(v/2),u=n._buffer,p=0;p<v;p++)u[p]=a.call(t,s(e,p),p);return n}for(n=new this(v),u=n._buffer,m=0,p=0;p<v;p++){if(c=a.call(t,s(e,p),p),dr(c))u[m]=Br(c),u[m+1]=Pr(c);else if(lt(c)&&c.length>=2)u[m]=c[0],u[m+1]=c[1];else throw new TypeError(R("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",c));m+=2}return n}return new this(e)}if(_n(e)&&kn&&ir(e[Jr])){if(u=e[Jr](),!ir(u.next))throw new TypeError(R("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",e));if(a?o=PT(u,a,t):o=Vn(u),o instanceof Error)throw o;for(v=o.length/2,n=new this(v),u=n._buffer,p=0;p<v;p++)u[p]=o[p];return n}throw new TypeError(R("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",e))});G(N,"of",function(){var e,t;if(!ir(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!Cn(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=[],t=0;t<arguments.length;t++)e.push(arguments[t]);return new this(e)});G(N.prototype,"at",function(e){if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!hr(e))throw new TypeError(R("invalid argument. Must provide an integer. Value: `%s`.",e));if(e<0&&(e+=this._length),!(e<0||e>=this._length))return lr(this._buffer,e)});be(N.prototype,"buffer",function(){return this._buffer.buffer});be(N.prototype,"byteLength",function(){return this._buffer.byteLength});be(N.prototype,"byteOffset",function(){return this._buffer.byteOffset});G(N.prototype,"BYTES_PER_ELEMENT",N.BYTES_PER_ELEMENT);G(N.prototype,"copyWithin",function(e,t){if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return arguments.length===2?this._buffer.copyWithin(e*2,t*2):this._buffer.copyWithin(e*2,t*2,arguments[2]*2),this});G(N.prototype,"entries",function(){var e,t,i,a,n,u,o;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,e=this._buffer,a=this._length,u=-1,o=-2,i={},G(i,"next",s),G(i,"return",v),Jr&&G(i,Jr,l),i;function s(){var c;return u+=1,n||u>=a?{done:!0}:(o+=2,c=new jn(e[o],e[o+1]),{value:[u,c],done:!1})}function v(c){return n=!0,arguments.length?{value:c,done:!0}:{done:!0}}function l(){return t.entries()}});G(N.prototype,"every",function(e,t){var i,a;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)if(!e.call(t,lr(i,a),a,this))return!1;return!0});G(N.prototype,"fill",function(e,t,i){var a,n,u,o,s,v;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!dr(e))throw new TypeError(R("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(a=this._buffer,n=this._length,arguments.length>1){if(!hr(t))throw new TypeError(R("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=n,t<0&&(t=0)),arguments.length>2){if(!hr(i))throw new TypeError(R("invalid argument. Third argument must be an integer. Value: `%s`.",i));i<0&&(i+=n,i<0&&(i=0)),i>n&&(i=n)}else i=n}else t=0,i=n;for(o=Br(e),s=Pr(e),v=t;v<i;v++)u=2*v,a[u]=o,a[u+1]=s;return this});G(N.prototype,"filter",function(e,t){var i,a,n,u;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=[],n=0;n<this._length;n++)u=lr(i,n),e.call(t,u,n,this)&&a.push(u);return new this.constructor(a)});G(N.prototype,"find",function(e,t){var i,a,n;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)if(n=lr(i,a),e.call(t,n,a,this))return n});G(N.prototype,"findIndex",function(e,t){var i,a,n;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)if(n=lr(i,a),e.call(t,n,a,this))return a;return-1});G(N.prototype,"findLast",function(e,t){var i,a,n;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=this._length-1;a>=0;a--)if(n=lr(i,a),e.call(t,n,a,this))return n});G(N.prototype,"findLastIndex",function(e,t){var i,a,n;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=this._length-1;a>=0;a--)if(n=lr(i,a),e.call(t,n,a,this))return a;return-1});G(N.prototype,"forEach",function(e,t){var i,a,n;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)n=lr(i,a),e.call(t,n,a,this)});G(N.prototype,"get",function(e){if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ve(e))throw new TypeError(R("invalid argument. Must provide a nonnegative integer. Value: `%s`.",e));if(!(e>=this._length))return lr(this._buffer,e)});be(N.prototype,"length",function(){return this._length});G(N.prototype,"includes",function(e,t){var i,a,n,u,o;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!dr(e))throw new TypeError(R("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(arguments.length>1){if(!hr(t))throw new TypeError(R("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length,t<0&&(t=0))}else t=0;for(n=Br(e),u=Pr(e),i=this._buffer,o=t;o<this._length;o++)if(a=2*o,n===i[a]&&u===i[a+1])return!0;return!1});G(N.prototype,"indexOf",function(e,t){var i,a,n,u,o;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!dr(e))throw new TypeError(R("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(arguments.length>1){if(!hr(t))throw new TypeError(R("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length,t<0&&(t=0))}else t=0;for(n=Br(e),u=Pr(e),i=this._buffer,o=t;o<this._length;o++)if(a=2*o,n===i[a]&&u===i[a+1])return o;return-1});G(N.prototype,"join",function(e){var t,i,a,n;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(arguments.length===0)a=",";else if(VT(e))a=e;else throw new TypeError(R("invalid argument. First argument must be a string. Value: `%s`.",e));for(t=[],i=this._buffer,n=0;n<this._length;n++)t.push(lr(i,n).toString());return t.join(a)});G(N.prototype,"lastIndexOf",function(e,t){var i,a,n,u,o;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!dr(e))throw new TypeError(R("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(arguments.length>1){if(!hr(t))throw new TypeError(R("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(n=Br(e),u=Pr(e),i=this._buffer,o=t;o>=0;o--)if(a=2*o,n===i[a]&&u===i[a+1])return o;return-1});G(N.prototype,"map",function(e,t){var i,a,n,u,o;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(a=this._buffer,n=new this.constructor(this._length),i=n._buffer,u=0;u<this._length;u++)if(o=e.call(t,lr(a,u),u,this),dr(o))i[2*u]=Br(o),i[2*u+1]=Pr(o);else if(lt(o)&&o.length===2)i[2*u]=o[0],i[2*u+1]=o[1];else throw new TypeError(R("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",o));return n});G(N.prototype,"reverse",function(){var e,t,i,a,n,u;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(i=this._length,e=this._buffer,a=LT(i/2),n=0;n<a;n++)u=i-n-1,t=e[2*n],e[2*n]=e[2*u],e[2*u]=t,t=e[2*n+1],e[2*n+1]=e[2*u+1],e[2*u+1]=t;return this});G(N.prototype,"set",function(e){var t,i,a,n,u,o,s,v,l;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(a=this._buffer,arguments.length>1){if(i=arguments[1],!ve(i))throw new TypeError(R("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",i))}else i=0;if(dr(e)){if(i>=this._length)throw new RangeError(R("invalid argument. Index argument is out-of-bounds. Value: `%u`.",i));i*=2,a[i]=Br(e),a[i+1]=Pr(e);return}if(K(e)){if(o=e._length,i+o>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=e._buffer,l=a.byteOffset+i*fr,t.buffer===a.buffer&&t.byteOffset<l&&t.byteOffset+t.byteLength>l){for(n=new yr(t.length),v=0;v<t.length;v++)n[v]=t[v];t=n}for(i*=2,l=0,v=0;v<o;v++)a[i]=t[l],a[i+1]=t[l+1],i+=2,l+=2;return}if(ct(e)){for(o=e.length,v=0;v<o;v++)if(!dr(e[v])){u=!0;break}if(u){if(!xe(o))throw new RangeError(R("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",o));if(i+o/2>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=e,l=a.byteOffset+i*fr,t.buffer===a.buffer&&t.byteOffset<l&&t.byteOffset+t.byteLength>l){for(n=new yr(o),v=0;v<o;v++)n[v]=t[v];t=n}for(i*=2,o/=2,l=0,v=0;v<o;v++)a[i]=t[l],a[i+1]=t[l+1],i+=2,l+=2;return}if(i+o>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(i*=2,v=0;v<o;v++)s=e[v],a[i]=Br(s),a[i+1]=Pr(s),i+=2;return}throw new TypeError(R("invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.",e))});G(N.prototype,"some",function(e,t){var i,a;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!ir(e))throw new TypeError(R("invalid argument. First argument must be a function. Value: `%s`.",e));for(i=this._buffer,a=0;a<this._length;a++)if(e.call(t,lr(i,a),a,this))return!0;return!1});G(N.prototype,"subarray",function(e,t){var i,a,n;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(a=this._buffer,n=this._length,arguments.length===0)e=0,t=n;else{if(!hr(e))throw new TypeError(R("invalid argument. First argument must be an integer. Value: `%s`.",e));if(e<0&&(e+=n,e<0&&(e=0)),arguments.length===1)t=n;else{if(!hr(t))throw new TypeError(R("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0?(t+=n,t<0&&(t=0)):t>n&&(t=n)}}return e>=n?(n=0,i=a.byteLength):e>=t?(n=0,i=a.byteOffset+e*fr):(n=t-e,i=a.byteOffset+e*fr),new this.constructor(a.buffer,i,n<0?0:n)});G(N.prototype,"toReversed",function(){var e,t,i,a,n,u;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(i=this._length,t=new this.constructor(i),a=this._buffer,e=t._buffer,n=0;n<i;n++)u=i-n-1,e[2*n]=a[2*u],e[2*n+1]=a[2*u+1];return t});G(N.prototype,"toString",function(){var e,t,i;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(e=[],t=this._buffer,i=0;i<this._length;i++)e.push(lr(t,i).toString());return e.join(",")});G(N.prototype,"with",function(e,t){var i,a,n;if(!K(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!hr(e))throw new TypeError(R("invalid argument. First argument must be an integer. Value: `%s`.",e));if(n=this._length,e<0&&(e+=n),e<0||e>=n)throw new RangeError(R("invalid argument. Index argument is out-of-bounds. Value: `%s`.",e));if(!dr(t))throw new TypeError(R("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return a=new this.constructor(this._buffer),i=a._buffer,i[2*e]=Br(t),i[2*e+1]=Pr(t),a});Fn.exports=N});var Ir=f(function(_D,zn){"use strict";var MT=Ln();zn.exports=MT});var Rn=f(function(jD,On){"use strict";var IT=Er(),UT=Tr(),DT=Ar(),GT=_r(),YT=jr(),WT=Vr(),ZT=kr(),XT=Cr(),HT=Fr(),KT=Mr(),$T=Ir(),JT=[IT,UT,GT,DT,WT,YT,HT,ZT,XT,KT,$T];On.exports=JT});var Pn=f(function(VD,Bn){"use strict";var QT=["float64","float32","int32","uint32","int16","uint16","int8","uint8","uint8c","complex64","complex128"];Bn.exports=QT});var In=f(function(kD,Mn){"use strict";var r6=require("@stdlib/assert/is-buffer"),e6=require("@stdlib/assert/is-array"),t6=require("@stdlib/utils/constructor-name"),i6=ua(),a6=Rn(),Nn=Pn(),n6=Nn.length;function u6(r){var e;if(e6(r))return"generic";if(r6(r))return null;for(e=0;e<n6;e++)if(r instanceof a6[e])return Nn[e];return i6[t6(r)]||null}Mn.exports=u6});var H=f(function(CD,Un){"use strict";var o6=In();Un.exports=o6});var Gn=f(function(FD,Dn){"use strict";var s6=rr(),v6=ur(),f6=ue(),l6=er(),c6=oe(),p6=H();function m6(r){var e=p6(r);return s6(r)?{accessorProtocol:!0,accessors:[l6(e),c6(e)]}:{accessorProtocol:!1,accessors:[v6(e),f6(e)]}}Dn.exports=m6});var fe=f(function(LD,Yn){"use strict";var g6=Gn();Yn.exports=g6});var Zn=f(function(zD,Wn){"use strict";var y6=require("@stdlib/utils/define-nonenumerable-read-write-accessor"),pt=require("@stdlib/utils/define-nonenumerable-read-only-property"),d6=fe(),h6=require("@stdlib/assert/is-collection"),q6=require("@stdlib/string/format");function w6(r){this._buffer.length=r}function x6(){return this._buffer.length}function Yr(r){var e;if(!(this instanceof Yr))return new Yr(r);if(!h6(r))throw new TypeError(q6("invalid argument. Must provide an array-like object. Value: `%s`.",r));return e=d6(r),this._buffer=r,this._getter=e.accessors[0],this._setter=e.accessors[1],this}pt(Yr,"name","AccessorArray");y6(Yr.prototype,"length",x6,w6);pt(Yr.prototype,"get",function(e){return this._getter(this._buffer,e)});pt(Yr.prototype,"set",function(e,t){if(arguments.length<2){this._setter(this._buffer,0,e);return}this._setter(this._buffer,t,e)});Wn.exports=Yr});var mt=f(function(OD,Xn){"use strict";var b6=Zn();Xn.exports=b6});var Kn=f(function(RD,Hn){"use strict";var E6=fe();function T6(r){var e=E6(r);return{data:r,accessorProtocol:e.accessorProtocol,accessors:e.accessors}}Hn.exports=T6});var J=f(function(BD,$n){"use strict";var S6=Kn();$n.exports=S6});var Qn=f(function(PD,Jn){"use strict";var A6=zr(),_6=Lr(),j6=J(),V6=require("@stdlib/strided/base/reinterpret-complex128"),k6=require("@stdlib/strided/base/reinterpret-complex64");function gt(r){var e;for(e=0;e<r.length;e++)if(r[e])return!0;return!1}function C6(r){var e,t,i;for(e=r.data,t=r.accessors[0],i=0;i<e.length;i++)if(t(e,i))return!0;return!1}function F6(r){var e=j6(r);return e.accessorProtocol?A6(r)?gt(V6(r,0)):_6(r)?gt(k6(r,0)):C6(e):gt(r)}Jn.exports=F6});var eu=f(function(ND,ru){"use strict";var L6=Qn();ru.exports=L6});var iu=f(function(MD,tu){"use strict";var z6=J();function O6(r,e){return typeof r[e]=="function"}function R6(r,e,t){var i;for(i=0;i<r.length;i++)if(e.call(t,r[i],i,r))return!0;return!1}function B6(r,e,t){var i,a,n;for(i=r.data,a=r.accessors[0],n=0;n<i.length;n++)if(e.call(t,a(i,n),n,i))return!0;return!1}function P6(r,e,t){var i;return O6(r,"some")?r.some(e,t):(i=z6(r),i.accessorProtocol?B6(i,e,t):R6(r,e,t))}tu.exports=P6});var nu=f(function(ID,au){"use strict";var N6=iu();au.exports=N6});var ou=f(function(UD,uu){"use strict";var M6=J();function I6(r,e,t){var i;for(i=r.length-1;i>=0;i--)if(e.call(t,r[i],i,r))return!0;return!1}function U6(r,e,t){var i,a,n;for(i=r.data,a=r.accessors[0],n=i.length-1;n>=0;n--)if(e.call(t,a(i,n),n,i))return!0;return!1}function D6(r,e,t){var i=M6(r);return i.accessorProtocol?U6(i,e,t):I6(r,e,t)}uu.exports=D6});var vu=f(function(DD,su){"use strict";var G6=ou();su.exports=G6});var lu=f(function(GD,fu){"use strict";var Y6=rr(),W6=er(),Z6=ur(),X6=H();function H6(r,e){var t,i,a,n;for(a=X6(r),Y6(r)?i=W6(a):i=Z6(a),t=r.length,n=0;n<t;n++)if(i(r,n)===e)return!0;return!1}fu.exports=H6});var pu=f(function(YD,cu){"use strict";var K6=require("@stdlib/assert/is-collection"),$6=rr(),J6=er(),Q6=H(),rS=require("@stdlib/string/format");function eS(r){var e,t,i;if(!K6(r))throw new TypeError(rS("invalid argument. Must provide an array-like object. Value: `%s`.",r));return i=Q6(r),$6(r)&&(e=J6(i)),t=r.length,e===void 0?a:n;function a(u){var o;for(o=0;o<t;o++)if(r[o]===u)return!0;return!1}function n(u){var o;for(o=0;o<t;o++)if(e(r,o)===u)return!0;return!1}}cu.exports=eS});var yt=f(function(WD,gu){"use strict";var tS=require("@stdlib/utils/define-nonenumerable-read-only-property"),mu=lu(),iS=pu();tS(mu,"factory",iS);gu.exports=mu});var Tu=f(function(ZD,Eu){"use strict";var yu=zr(),du=Lr(),hu=J(),qu=require("@stdlib/strided/base/reinterpret-complex128"),wu=require("@stdlib/strided/base/reinterpret-complex64"),bu=require("@stdlib/assert/is-same-value");function xu(r,e){var t;for(t=0;t<r.length;t++)if(!bu(r[t],e[t]))return!1;return!0}function aS(r,e){var t,i,a,n,u;for(t=r.data,i=e.data,a=r.accessors[0],n=e.accessors[0],u=0;u<t.length;u++)if(!bu(a(t,u),n(i,u)))return!1;return!0}function nS(r,e){var t,i,a,n,u;return r.length!==e.length?!1:(i=hu(r),a=hu(e),i.accessorProtocol||a.accessorProtocol?(t=2,yu(r)?(n=qu(r,0),t-=1):du(r)&&(n=wu(r,0),t-=1),yu(e)?(u=qu(e,0),t-=1):du(e)&&(u=wu(e,0),t-=1),t===0?xu(n,u):aS(i,a)):xu(r,e))}Eu.exports=nS});var Au=f(function(XD,Su){"use strict";var uS=Tu();Su.exports=uS});var ju=f(function(HD,_u){"use strict";var le=require("@stdlib/utils/define-read-only-property"),Qr={};le(Qr,"contains",yt());le(Qr,"hasSameValues",Au());le(Qr,"isAccessorArray",rr());le(Qr,"isComplex64Array",Lr());le(Qr,"isComplex128Array",zr());_u.exports=Qr});var ku=f(function(KD,Vu){"use strict";var oS=rr(),sS=er(),vS=ur(),fS=H();function lS(r){var e=fS(r);return oS(r)?sS(e):vS(e)}Vu.exports=lS});var Z=f(function($D,Cu){"use strict";var cS=ku();Cu.exports=cS});var Lu=f(function(JD,Fu){"use strict";var pS=Z();function mS(r,e){return typeof r[e]=="function"}function gS(r,e){var t;if(mS(r,"at"))return r.at(e);if(e<0){if(e+=r.length,e<0)return}else if(e>=r.length)return;return t=pS(r),t(r,e)}Fu.exports=gS});var Ou=f(function(QD,zu){"use strict";var yS=Lu();zu.exports=yS});var Bu=f(function(rG,Ru){"use strict";function dS(r,e,t){var i,a;if(a=r.length,e<0&&(e+=a),!(e<0||e>=a)&&(i=r[e],a=i.length,t<0&&(t+=a),!(t<0||t>=a)))return i[t]}Ru.exports=dS});var Nu=f(function(eG,Pu){"use strict";var hS=Bu();Pu.exports=hS});var Iu=f(function(tG,Mu){"use strict";function qS(r,e,t,i){var a,n,u;if(u=r.length,e<0&&(e+=u),!(e<0||e>=u)&&(a=r[e],u=a.length,t<0&&(t+=u),!(t<0||t>=u)&&(n=a[t],u=n.length,i<0&&(i+=u),!(i<0||i>=u))))return n[i]}Mu.exports=qS});var Du=f(function(iG,Uu){"use strict";var wS=Iu();Uu.exports=wS});var Yu=f(function(aG,Gu){"use strict";function xS(r,e,t,i,a){var n,u,o,s,v;for(u=[e,t,i,a],n=r,s=0;s<u.length;s++){if(v=u[s],o=n.length,v<0&&(v+=o),v<0||v>=o)return;n=n[v]}return n}Gu.exports=xS});var Zu=f(function(nG,Wu){"use strict";var bS=Yu();Wu.exports=bS});var Hu=f(function(uG,Xu){"use strict";function ES(r,e,t,i,a,n){var u,o,s,v,l;for(o=[e,t,i,a,n],u=r,v=0;v<o.length;v++){if(l=o[v],s=u.length,l<0&&(l+=s),l<0||l>=s)return;u=u[l]}return u}Xu.exports=ES});var $u=f(function(oG,Ku){"use strict";var TS=Hu();Ku.exports=TS});var Qu=f(function(sG,Ju){"use strict";function SS(r,e){var t,i,a,n,u;for(i=[e],n=2;n<arguments.length;n++)i.push(arguments[n]);for(t=r,n=0;n<i.length;n++){if(u=i[n],a=t.length,u<0&&(u+=a),u<0||u>=a)return;t=t[u]}return t}Ju.exports=SS});var eo=f(function(vG,ro){"use strict";var AS=Qu();ro.exports=AS});var ao=f(function(fG,io){"use strict";var to=Z();function _S(r,e){var t,i,a,n,u,o,s;if(a=r.length,e.length!==a)throw new RangeError("invalid argument. The first and second arguments must have the same length.");if(a===0)return[];for(t=to(r),i=to(e),n=[[],[]],s=0;s<a;s++)o=t(r,s),u=i(e,s),u?n[0].push([s,o]):n[1].push([s,o]);return n}io.exports=_S});var uo=f(function(lG,no){"use strict";var jS=ao();no.exports=jS});var so=f(function(cG,oo){"use strict";var VS=Z();function kS(r,e,t){var i,a,n,u,o;if(a=r.length,a===0)return[];for(i=VS(r),n=[[],[]],o=0;o<a;o++)u=i(r,o),e.call(t,u,o,r)?n[0].push([o,u]):n[1].push([o,u]);return n}oo.exports=kS});var fo=f(function(pG,vo){"use strict";var CS=so();vo.exports=CS});var co=f(function(mG,lo){"use strict";var FS=Z();function LS(r,e){var t,i,a,n,u;if(i=r.length,e.length!==i)throw new RangeError("invalid argument. The first and second arguments must have the same length.");if(i===0)return[];for(t=FS(e),a=[[],[]],u=0;u<i;u++)n=t(e,u),n?a[0].push(u):a[1].push(u);return a}lo.exports=LS});var mo=f(function(gG,po){"use strict";var zS=co();po.exports=zS});var yo=f(function(yG,go){"use strict";var OS=Z();function RS(r,e,t){var i,a,n,u;if(a=r.length,a===0)return[];for(i=OS(r),n=[[],[]],u=0;u<a;u++)e.call(t,i(r,u),u,r)?n[0].push(u):n[1].push(u);return n}go.exports=RS});var qo=f(function(dG,ho){"use strict";var BS=yo();ho.exports=BS});var bo=f(function(hG,xo){"use strict";var wo=Z();function PS(r,e){var t,i,a,n,u,o,s;if(a=r.length,e.length!==a)throw new RangeError("invalid argument. The first and second arguments must have the same length.");if(a===0)return[];for(t=wo(r),i=wo(e),n=[[],[]],s=0;s<a;s++)o=t(r,s),u=i(e,s),u?n[0].push(o):n[1].push(o);return n}xo.exports=PS});var To=f(function(qG,Eo){"use strict";var NS=bo();Eo.exports=NS});var Ao=f(function(wG,So){"use strict";var MS=Z();function IS(r,e,t){var i,a,n,u,o;if(a=r.length,a===0)return[];for(i=MS(r),n=[[],[]],o=0;o<a;o++)u=i(r,o),e.call(t,u,o,r)?n[0].push(u):n[1].push(u);return n}So.exports=IS});var jo=f(function(xG,_o){"use strict";var US=Ao();_o.exports=US});var ko=f(function(bG,Vo){"use strict";function DS(r,e,t){var i,a,n,u,o,s,v,l,c,p;if(i=e[1],a=e[0],!(i<=0||a<=0))for(l=r[0],c=r[1],p=r[2],u=0;u<a;u++)for(o=l[u],s=c[u],v=p[u],n=0;n<i;n++)v[n]=t(o[n],s[n])}Vo.exports=DS});var Fo=f(function(EG,Co){"use strict";var GS=ko();Co.exports=GS});var zo=f(function(TG,Lo){"use strict";function YS(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h;if(i=e[2],a=e[1],n=e[0],!(i<=0||a<=0||n<=0))for(y=r[0],d=r[1],h=r[2],s=0;s<n;s++)for(l=y[s],p=d[s],g=h[s],o=0;o<a;o++)for(v=l[o],c=p[o],m=g[o],u=0;u<i;u++)m[u]=t(v[u],c[u])}Lo.exports=YS});var Ro=f(function(SG,Oo){"use strict";var WS=zo();Oo.exports=WS});var Po=f(function(AG,Bo){"use strict";function ZS(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T;if(i=e[3],a=e[2],n=e[1],u=e[0],!(i<=0||a<=0||n<=0||u<=0))for(E=r[0],S=r[1],T=r[2],l=0;l<u;l++)for(m=E[l],d=S[l],b=T[l],v=0;v<n;v++)for(p=m[v],y=d[v],x=b[v],s=0;s<a;s++)for(c=p[s],g=y[s],h=x[s],o=0;o<i;o++)h[o]=t(c[o],g[o])}Bo.exports=ZS});var Mo=f(function(_G,No){"use strict";var XS=Po();No.exports=XS});var Uo=f(function(jG,Io){"use strict";function HS(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O;if(i=e[4],a=e[3],n=e[2],u=e[1],o=e[0],!(i<=0||a<=0||n<=0||u<=0||o<=0))for(V=r[0],C=r[1],O=r[2],p=0;p<o;p++)for(d=V[p],E=C[p],k=O[p],c=0;c<u;c++)for(y=d[c],b=E[c],j=k[c],l=0;l<n;l++)for(g=y[l],x=b[l],T=j[l],v=0;v<a;v++)for(m=g[v],h=x[v],S=T[v],s=0;s<i;s++)S[s]=t(m[s],h[s])}Io.exports=HS});var Go=f(function(VG,Do){"use strict";var KS=Uo();Do.exports=KS});var Zo=f(function(kG,Wo){"use strict";function Yo(r,e,t,i,a,n,u){var o,s,v;if(o=a[n],s=n+1,s===i){for(v=0;v<o;v++)t[v]=u(r[v],e[v]);return}for(v=0;v<o;v++)Yo(r[v],e[v],t[v],i,a,s,u)}function $S(r,e,t){return Yo(r[0],r[1],r[2],e.length,e,0,t)}Wo.exports=$S});var Ho=f(function(CG,Xo){"use strict";var JS=Zo();Xo.exports=JS});var $o=f(function(FG,Ko){"use strict";function QS(r){var e,t,i;for(t=r.length,e=[],i=0;i<t;i++)e.push(r[i]);return e}Ko.exports=QS});var Ee=f(function(LG,Jo){"use strict";var r8=$o();Jo.exports=r8});var rs=f(function(zG,Qo){"use strict";function e8(r,e){var t,i;for(t=[],i=0;i<e;i++)t.push(r);return t}Qo.exports=e8});var Sr=f(function(OG,es){"use strict";var t8=rs();es.exports=t8});var is=f(function(RG,ts){"use strict";var i8=Sr();function a8(r){return i8(0,r)}ts.exports=a8});var Ur=f(function(BG,as){"use strict";var n8=is();as.exports=n8});var os=f(function(PG,us){"use strict";var ce=Ee(),u8=Ur(),ns=require("@stdlib/string/format");function o8(r,e,t){var i,a,n,u,o,s,v,l;if(u=t.length,o=e.length,u<o)throw new Error("invalid argument. Cannot broadcast an array to a shape having fewer dimensions. Arrays can only be broadcasted to shapes having the same or more dimensions.");for(i=r,v=o;v<u;v++)i=[i];for(n=u8(u),v=u-1;v>=0;v--)if(l=o-u+v,!(l<0)){if(s=e[l],a=t[v],a!==0&&a<s)throw new Error(ns("invalid argument. Input array cannot be broadcast to the specified shape, as the specified shape has a dimension whose size is less than the size of the corresponding dimension in the input array. Array shape: (%s). Desired shape: (%s). Dimension: %u.",ce(e).join(", "),ce(t).join(", "),v));if(s===a)n[v]=1;else if(s===1)n[v]=0;else throw new Error(ns("invalid argument. Input array and the specified shape are broadcast incompatible. Array shape: (%s). Desired shape: (%s). Dimension: %u.",ce(e).join(", "),ce(t).join(", "),v))}return{ref:r,data:i,shape:ce(t),strides:n}}us.exports=o8});var cr=f(function(NG,ss){"use strict";var s8=os();ss.exports=s8});var ls=f(function(MG,fs){"use strict";var vs=cr();function v8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j;if(x=e[2],o=x[1],s=x[0],!(o<=0||s<=0))for(E=vs(r[0],e[0],x),S=E.data,b=E.strides,i=b[1],a=b[0],E=vs(r[1],e[1],x),T=E.data,b=E.strides,n=b[1],u=b[0],j=r[2],p=0,g=0,l=0;l<s;l++){for(c=0,m=0,y=S[p],d=T[g],h=j[l],v=0;v<o;v++)h[v]=t(y[c],d[m]),c+=i,m+=n;p+=a,g+=u}}fs.exports=v8});var ps=f(function(IG,cs){"use strict";var f8=ls();cs.exports=f8});var ys=f(function(UG,gs){"use strict";var ms=cr();function l8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D;if(O=e[2],v=O[2],l=O[1],c=O[0],!(v<=0||l<=0||c<=0))for(L=ms(r[0],e[0],O),B=L.data,F=L.strides,i=F[2],a=F[1],n=F[0],L=ms(r[1],e[1],O),I=L.data,F=L.strides,u=F[2],o=F[1],s=F[0],D=r[2],h=0,E=0,g=0;g<c;g++){for(d=0,b=0,T=B[h],k=I[E],C=D[g],m=0;m<l;m++){for(y=0,x=0,S=T[d],j=k[b],V=C[m],p=0;p<v;p++)V[p]=t(S[y],j[x]),y+=i,x+=u;d+=a,b+=o}h+=n,E+=s}}gs.exports=l8});var hs=f(function(DG,ds){"use strict";var c8=ys();ds.exports=c8});var xs=f(function(GG,ws){"use strict";var qs=cr();function p8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D,W,M,Y,Q,$,nr,wr,xr,br;if(Q=e[2],c=Q[3],p=Q[2],m=Q[1],g=Q[0],!(c<=0||p<=0||m<=0||g<=0))for(nr=qs(r[0],e[0],Q),wr=nr.data,$=nr.strides,i=$[3],a=$[2],n=$[1],u=$[0],nr=qs(r[1],e[1],Q),xr=nr.data,$=nr.strides,o=$[3],s=$[2],v=$[1],l=$[0],br=r[2],T=0,C=0,x=0;x<g;x++){for(S=0,V=0,L=wr[T],D=xr[C],Y=br[x],h=0;h<m;h++){for(E=0,k=0,F=L[S],I=D[V],M=Y[h],d=0;d<p;d++){for(b=0,j=0,O=F[E],B=I[k],W=M[d],y=0;y<c;y++)W[y]=t(O[b],B[j]),b+=i,j+=o;E+=a,k+=s}S+=n,V+=v}T+=u,C+=l}}ws.exports=p8});var Es=f(function(YG,bs){"use strict";var m8=xs();bs.exports=m8});var As=f(function(WG,Ss){"use strict";var Ts=cr();function g8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D,W,M,Y,Q,$,nr,wr,xr,br,ne,zi,Oi,Gr,pr,Kr,Ri,Bi,Pi;if(Gr=e[2],m=Gr[4],g=Gr[3],y=Gr[2],d=Gr[1],h=Gr[0],!(m<=0||g<=0||y<=0||d<=0||h<=0))for(Kr=Ts(r[0],e[0],Gr),Ri=Kr.data,pr=Kr.strides,i=pr[4],a=pr[3],n=pr[2],u=pr[1],o=pr[0],Kr=Ts(r[1],e[1],Gr),Bi=Kr.data,pr=Kr.strides,s=pr[4],v=pr[3],l=pr[2],c=pr[1],p=pr[0],Pi=r[2],O=0,D=0,T=0;T<h;T++){for(C=0,I=0,Q=Ri[O],xr=Bi[D],Oi=Pi[T],S=0;S<d;S++){for(V=0,B=0,Y=Q[C],wr=xr[I],zi=Oi[S],E=0;E<y;E++){for(k=0,L=0,M=Y[V],nr=wr[B],ne=zi[E],b=0;b<g;b++){for(j=0,F=0,W=M[k],$=nr[L],br=ne[b],x=0;x<m;x++)br[x]=t(W[j],$[F]),j+=i,F+=s;k+=a,L+=v}V+=n,B+=l}C+=u,I+=c}O+=o,D+=p}}Ss.exports=g8});var js=f(function(ZG,_s){"use strict";var y8=As();_s.exports=y8});var ks=f(function(XG,Vs){"use strict";var Te=cr();function d8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D,W,M,Y;if(F=e[4],c=F[1],p=F[0],!(c<=0||p<=0))for(B=Te(r[0],e[0],F),I=B.data,L=B.strides,i=L[1],a=L[0],B=Te(r[1],e[1],F),D=B.data,L=B.strides,n=L[1],u=L[0],B=Te(r[2],e[2],F),W=B.data,L=B.strides,o=L[1],s=L[0],B=Te(r[3],e[3],F),M=B.data,L=B.strides,v=L[1],l=L[0],Y=r[4],d=0,x=0,E=0,T=0,g=0;g<p;g++){for(y=0,h=0,b=0,S=0,j=I[d],k=D[x],V=W[E],C=M[T],O=Y[g],m=0;m<c;m++)O[m]=t(j[y],k[h],V[b],C[S]),y+=i,h+=n,b+=o,S+=v;d+=a,x+=u,E+=s,T+=l}}Vs.exports=d8});var Fs=f(function(HG,Cs){"use strict";var h8=ks();Cs.exports=h8});var zs=f(function(KG,Ls){"use strict";var pe=cr();function q8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D,W,M,Y,Q,$,nr,wr,xr,br;if(W=e[5],m=W[1],g=W[0],!(m<=0||g<=0))for(Y=pe(r[0],e[0],W),Q=Y.data,M=Y.strides,i=M[1],a=M[0],Y=pe(r[1],e[1],W),$=Y.data,M=Y.strides,n=M[1],u=M[0],Y=pe(r[2],e[2],W),nr=Y.data,M=Y.strides,o=M[1],s=M[0],Y=pe(r[3],e[3],W),wr=Y.data,M=Y.strides,v=M[1],l=M[0],Y=pe(r[4],e[4],W),xr=Y.data,M=Y.strides,c=M[1],p=M[0],br=r[5],x=0,E=0,T=0,k=0,C=0,d=0;d<g;d++){for(h=0,b=0,S=0,j=0,V=0,O=Q[x],F=$[E],L=nr[T],B=wr[k],I=xr[C],D=br[d],y=0;y<m;y++)D[y]=t(O[h],F[b],L[S],B[j],I[V]),h+=i,b+=n,S+=o,j+=v,V+=c;x+=a,E+=u,T+=s,k+=l,C+=p}}Ls.exports=q8});var Rs=f(function($G,Os){"use strict";var w8=zs();Os.exports=w8});var Ps=f(function(JG,Bs){"use strict";var dt=cr();function x8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L;if(j=e[3],v=j[1],l=j[0],!(v<=0||l<=0))for(V=dt(r[0],e[0],j),C=V.data,k=V.strides,i=k[1],a=k[0],V=dt(r[1],e[1],j),O=V.data,k=V.strides,n=k[1],u=k[0],V=dt(r[2],e[2],j),F=V.data,k=V.strides,o=k[1],s=k[0],L=r[3],g=0,d=0,x=0,p=0;p<l;p++){for(m=0,y=0,h=0,b=C[g],E=O[d],S=F[x],T=L[p],c=0;c<v;c++)T[c]=t(b[m],E[y],S[h]),m+=i,y+=n,h+=o;g+=a,d+=u,x+=s}}Bs.exports=x8});var Ms=f(function(QG,Ns){"use strict";var b8=Ps();Ns.exports=b8});var Us=f(function(rY,Is){"use strict";var E8=cr();function T8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h;if(m=e[1],n=m[1],u=m[0],!(n<=0||u<=0))for(y=E8(r[0],e[0],m),d=y.data,g=y.strides,i=g[1],a=g[0],h=r[1],l=0,s=0;s<u;s++){for(v=0,c=d[l],p=h[s],o=0;o<n;o++)p[o]=t(c[v]),v+=i;l+=a}}Is.exports=T8});var Gs=f(function(eY,Ds){"use strict";var S8=Us();Ds.exports=S8});var Ws=f(function(tY,Ys){"use strict";var A8=cr();function _8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j;if(b=e[1],u=b[2],o=b[1],s=b[0],!(u<=0||o<=0||s<=0))for(S=A8(r[0],e[0],b),T=S.data,E=S.strides,i=E[2],a=E[1],n=E[0],j=r[1],g=0,c=0;c<s;c++){for(m=0,d=T[g],x=j[c],l=0;l<o;l++){for(p=0,y=d[m],h=x[l],v=0;v<u;v++)h[v]=t(y[p]),p+=i;m+=a}g+=n}}Ys.exports=_8});var Xs=f(function(iY,Zs){"use strict";var j8=Ws();Zs.exports=j8});var Ks=f(function(aY,Hs){"use strict";var V8=cr();function k8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L;if(V=e[1],o=V[3],s=V[2],v=V[1],l=V[0],!(o<=0||s<=0||v<=0||l<=0))for(O=V8(r[0],e[0],V),F=O.data,C=O.strides,i=C[3],a=C[2],n=C[1],u=C[0],L=r[1],x=0,g=0;g<l;g++){for(h=0,S=F[x],k=L[g],m=0;m<v;m++){for(d=0,E=S[h],j=k[m],p=0;p<s;p++){for(y=0,b=E[d],T=j[p],c=0;c<o;c++)T[c]=t(b[y]),y+=i;d+=a}h+=n}x+=u}}Hs.exports=k8});var Js=f(function(nY,$s){"use strict";var C8=Ks();$s.exports=C8});var rv=f(function(uY,Qs){"use strict";var F8=cr();function L8(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D,W,M,Y;if(I=e[1],s=I[4],v=I[3],l=I[2],c=I[1],p=I[0],!(s<=0||v<=0||l<=0||c<=0||p<=0))for(W=F8(r[0],e[0],I),M=W.data,D=W.strides,i=D[4],a=D[3],n=D[2],u=D[1],o=D[0],Y=r[1],T=0,h=0;h<p;h++){for(S=0,C=M[T],B=Y[h],d=0;d<c;d++){for(E=0,V=C[S],L=B[d],y=0;y<l;y++){for(b=0,k=V[E],F=L[y],g=0;g<v;g++){for(x=0,j=k[b],O=F[g],m=0;m<s;m++)O[m]=t(j[x]),x+=i;b+=a}E+=n}S+=u}T+=o}}Qs.exports=L8});var tv=f(function(oY,ev){"use strict";var z8=rv();ev.exports=z8});var av=f(function(sY,iv){"use strict";var O8=Z(),R8=require("@stdlib/math/base/special/pow");function B8(r,e){var t,i,a,n,u,o,s,v,l,c;if(o=r.length,o<=0||e<=0)return[];for(t=O8(r),u=R8(o,e),n=[],v=0;v<e;v++)n.push(0);for(i=[],v=0;v<u;v++){for(c=v,l=e-1;l>=0;l--)s=c%o,c-=s,c/=o,n[l]=s;for(a=[],l=0;l<e;l++)a.push(t(r,n[l]));i.push(a)}return i}iv.exports=B8});var ht=f(function(vY,nv){"use strict";var P8=av();nv.exports=P8});var sv=f(function(fY,ov){"use strict";var uv=Z();function N8(r,e){var t,i,a,n,u,o,s,v;for(t=uv(r),i=uv(e),n=r.length,u=e.length,a=[],s=0;s<n;s++)for(o=t(r,s),v=0;v<u;v++)a.push([o,i(e,v)]);return a}ov.exports=N8});var qt=f(function(lY,vv){"use strict";var M8=sv();vv.exports=M8});var lv=f(function(cY,fv){"use strict";var I8=Z();function U8(r){var e,t,i,a,n,u;for(e=I8(r),i=r.length,t=[],n=0;n<i;n++)for(a=e(r,n),u=0;u<i;u++)t.push([a,e(r,u)]);return t}fv.exports=U8});var wt=f(function(pY,cv){"use strict";var D8=lv();cv.exports=D8});var mv=f(function(mY,pv){"use strict";var G8=Z();function Y8(r){var e,t,i,a;for(i=G8(r),t=r.length,e=[],a=0;a<t;a++)e.push(i(r,a));return e}pv.exports=Y8});var xt=f(function(gY,gv){"use strict";var W8=mv();gv.exports=W8});var dv=f(function(yY,yv){"use strict";var bt=require("@stdlib/math/base/assert/is-nan");function Z8(r,e){var t,i,a,n,u,o;if(a=r.length,a===0)return r;for(i=r[0],t=1,n=1,o=1;o<a;o++)u=r[o],u===i?(t+=1,t<=e&&(r[n]=i,n+=1)):(i=u,t=1,r[n]=i,n+=1);return r.length=n,r}function X8(r,e){var t,i,a,n,u,o,s;if(a=r.length,a===0)return r;for(u=!1,i=r[0],bt(i)&&(u=!0),t=1,n=1,s=1;s<a;s++)o=r[s],o===i||u&&bt(o)?(t+=1,t<=e&&(r[n]=i,n+=1)):(i=o,t=1,r[n]=i,n+=1,u=!1,bt(i)&&(u=!0));return r.length=n,r}function H8(r,e,t){return t?X8(r,e):Z8(r,e)}yv.exports=H8});var qv=f(function(dY,hv){"use strict";var K8=dv();hv.exports=K8});var bv=f(function(hY,xv){"use strict";var $8=zr(),J8=Lr(),Q8=J(),r4=require("@stdlib/strided/base/reinterpret-complex128"),e4=require("@stdlib/strided/base/reinterpret-complex64");function t4(r){var e;for(e=0;e<r.length;e++)if(!r[e])return!1;return!0}function wv(r){var e;for(e=0;e<r.length;e+=2)if(!(r[e]||r[e+1]))return!1;return!0}function i4(r){var e,t,i;for(e=r.data,t=r.accessors[0],i=0;i<e.length;i++)if(!t(e,i))return!1;return!0}function a4(r){var e=Q8(r);return e.accessorProtocol?$8(r)?wv(r4(r,0)):J8(r)?wv(e4(r,0)):i4(e):t4(r)}xv.exports=a4});var Tv=f(function(qY,Ev){"use strict";var n4=bv();Ev.exports=n4});var Av=f(function(wY,Sv){"use strict";var u4=J();function o4(r,e){return typeof r[e]=="function"}function s4(r,e,t){var i;for(i=0;i<r.length;i++)if(!e.call(t,r[i],i,r))return!1;return!0}function v4(r,e,t){var i,a,n;for(i=r.data,a=r.accessors[0],n=0;n<i.length;n++)if(!e.call(t,a(i,n),n,i))return!1;return!0}function f4(r,e,t){var i;return o4(r,"every")?r.every(e,t):(i=u4(r),i.accessorProtocol?v4(i,e,t):s4(r,e,t))}Sv.exports=f4});var jv=f(function(xY,_v){"use strict";var l4=Av();_v.exports=l4});var kv=f(function(bY,Vv){"use strict";var c4=J();function p4(r,e,t){var i;for(i=r.length-1;i>=0;i--)if(!e.call(t,r[i],i,r))return!1;return!0}function m4(r,e,t){var i,a,n;for(i=r.data,a=r.accessors[0],n=i.length-1;n>=0;n--)if(!e.call(t,a(i,n),n,i))return!1;return!0}function g4(r,e,t){var i=c4(r);return i.accessorProtocol?m4(i,e,t):p4(r,e,t)}Vv.exports=g4});var Fv=f(function(EY,Cv){"use strict";var y4=kv();Cv.exports=y4});var zv=f(function(TY,Lv){"use strict";function d4(r,e,t){var i,a;for(i=[],a=0;a<r;a++)i.push(e.call(t,a));return i}Lv.exports=d4});var Et=f(function(SY,Ov){"use strict";var h4=zv();Ov.exports=h4});var Bv=f(function(AY,Rv){"use strict";var q4=Sr();function w4(r,e){var t,i,a,n;for(i=e[1],a=e[0],t=[],n=0;n<a;n++)t.push(q4(r,i));return t}Rv.exports=w4});var Se=f(function(_Y,Pv){"use strict";var x4=Bv();Pv.exports=x4});var Mv=f(function(jY,Nv){"use strict";function b4(r,e,t){var i,a,n,u,o,s;for(n=r[1],u=r[0],i=[],o=0;o<u;o++){for(a=[],s=0;s<n;s++)a.push(e.call(t,[o,s]));i.push(a)}return i}Nv.exports=b4});var Uv=f(function(VY,Iv){"use strict";var E4=Mv();Iv.exports=E4});var Gv=f(function(kY,Dv){"use strict";var T4=Sr();function S4(r,e){var t,i,a,n,u,o,s;for(a=e[2],n=e[1],u=e[0],t=[],o=0;o<u;o++){for(i=[],s=0;s<n;s++)i.push(T4(r,a));t.push(i)}return t}Dv.exports=S4});var Ae=f(function(CY,Yv){"use strict";var A4=Gv();Yv.exports=A4});var Zv=f(function(FY,Wv){"use strict";function _4(r,e,t){var i,a,n,u,o,s,v,l,c;for(u=r[2],o=r[1],s=r[0],i=[],c=0;c<s;c++){for(n=[],l=0;l<o;l++){for(a=[],v=0;v<u;v++)a.push(e.call(t,[c,l,v]));n.push(a)}i.push(n)}return i}Wv.exports=_4});var Hv=f(function(LY,Xv){"use strict";var j4=Zv();Xv.exports=j4});var $v=f(function(zY,Kv){"use strict";var V4=Sr();function k4(r,e){var t,i,a,n,u,o,s,v,l,c;for(n=e[3],u=e[2],o=e[1],s=e[0],t=[],c=0;c<s;c++){for(a=[],l=0;l<o;l++){for(i=[],v=0;v<u;v++)i.push(V4(r,n));a.push(i)}t.push(a)}return t}Kv.exports=k4});var _e=f(function(OY,Jv){"use strict";var C4=$v();Jv.exports=C4});var rf=f(function(RY,Qv){"use strict";function F4(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g;for(o=r[3],s=r[2],v=r[1],l=r[0],i=[],g=0;g<l;g++){for(u=[],m=0;m<v;m++){for(n=[],p=0;p<s;p++){for(a=[],c=0;c<o;c++)a.push(e.call(t,[g,m,p,c]));n.push(a)}u.push(n)}i.push(u)}return i}Qv.exports=F4});var tf=f(function(BY,ef){"use strict";var L4=rf();ef.exports=L4});var nf=f(function(PY,af){"use strict";var z4=Sr();function O4(r,e){var t,i,a,n,u,o,s,v,l,c,p,m,g;for(u=e[4],o=e[3],s=e[2],v=e[1],l=e[0],t=[],g=0;g<l;g++){for(n=[],m=0;m<v;m++){for(a=[],p=0;p<s;p++){for(i=[],c=0;c<o;c++)i.push(z4(r,u));a.push(i)}n.push(a)}t.push(n)}return t}af.exports=O4});var je=f(function(NY,uf){"use strict";var R4=nf();uf.exports=R4});var sf=f(function(MY,of){"use strict";function B4(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h;for(s=r[4],v=r[3],l=r[2],c=r[1],p=r[0],i=[],h=0;h<p;h++){for(o=[],d=0;d<c;d++){for(u=[],y=0;y<l;y++){for(n=[],g=0;g<v;g++){for(a=[],m=0;m<s;m++)a.push(e.call(t,[h,d,y,g,m]));n.push(a)}u.push(n)}o.push(u)}i.push(o)}return i}of.exports=B4});var ff=f(function(IY,vf){"use strict";var P4=sf();vf.exports=P4});var pf=f(function(UY,cf){"use strict";var N4=Sr();function lf(r,e,t,i,a){var n,u,o;if(n=t[i],u=i+1,u===e)return N4(r,n);for(o=0;o<n;o++)a.push(lf(r,e,t,u,[]));return a}function M4(r,e){return lf(r,e.length,e,0,[])}cf.exports=M4});var Ve=f(function(DY,mf){"use strict";var I4=pf();mf.exports=I4});var df=f(function(GY,yf){"use strict";function gf(r,e,t,i,a,n,u){var o,s,v,l,c;for(l=t+1,s=l===r,v=e[t],c=0;c<v;c++)o=i.slice(),o.push(c),s?a.push(n.call(u,o)):a.push(gf(r,e,l,o,[],n,u));return a}function U4(r,e,t){return gf(r.length,r,0,[],[],e,t)}yf.exports=U4});var qf=f(function(YY,hf){"use strict";var D4=df();hf.exports=D4});var xf=f(function(WY,wf){"use strict";var G4=J();function Y4(r,e){return typeof r[e]=="function"}function W4(r,e,t){var i,a,n;for(i=[],n=0;n<r.length;n++)a=r[n],e.call(t,a,n,r)&&i.push(a);return i}function Z4(r,e,t){var i,a,n,u,o;for(i=r.data,a=r.accessors[0],n=[],o=0;o<i.length;o++)u=a(i,o),e.call(t,u,o,i)&&n.push(u);return n}function X4(r,e,t){var i;return Y4(r,"filter")?r.filter(e,t):(i=G4(r),i.accessorProtocol?Z4(i,e,t):W4(r,e,t))}wf.exports=X4});var Ef=f(function(ZY,bf){"use strict";var H4=xf();bf.exports=H4});var Sf=f(function(XY,Tf){"use strict";var K4=Z();function $4(r){var e;if(r.length!==0)return e=K4(r),e(r,0)}Tf.exports=$4});var _f=f(function(HY,Af){"use strict";var J4=Sf();Af.exports=J4});var St=f(function(KY,Cf){"use strict";var Q4=require("@stdlib/ndarray/base/shape2strides"),rA=require("@stdlib/ndarray/base/vind2bind"),eA=require("@stdlib/ndarray/base/numel"),jf=require("@stdlib/blas/ext/base/grev"),Vf=Ur(),tA="throw";function kf(r,e,t,i,a){var n;for(n=0;n<e;n++)t[a]=r[n],a+=i}function Tt(r,e,t,i,a,n,u){var o,s,v,l;for(v=i+1,o=v===e,s=t[i],l=0;l<s;l++)o?(a[u]=r[l],u+=n):u=Tt(r[l],e,t,v,a,n,u);return u}function iA(r,e,t,i,a,n){var u,o,s,v,l,c,p;for(u=eA(t),o=Vf(u),Tt(r,e,t,0,o,1,0),s="row-major",l=Q4(t,s),v=Vf(e),kf(t,e,v,1,0),jf(e,v,1),jf(e,l,1),p=0;p<u;p++)c=rA(v,l,0,s,p,tA),i[n]=o[c],n+=a}function aA(r,e,t,i,a,n){var u=e.length;return u===0?i:u===1?(kf(r,e[0],i,a,n),i):t?(iA(r,u,e,i,a,n),i):(Tt(r,u,e,0,i,a,n),i)}Cf.exports=aA});var Lf=f(function($Y,Ff){"use strict";var nA=require("@stdlib/ndarray/base/numel"),uA=Ur(),oA=St();function sA(r,e,t){var i=uA(nA(e));return oA(r,e,t,i,1,0)}Ff.exports=sA});var Rf=f(function(JY,Of){"use strict";var vA=require("@stdlib/utils/define-nonenumerable-read-only-property"),zf=Lf(),fA=St();vA(zf,"assign",fA);Of.exports=zf});var _t=f(function(QY,Pf){"use strict";var lA=require("@stdlib/ndarray/base/shape2strides"),cA=require("@stdlib/ndarray/base/vind2bind"),pA=require("@stdlib/ndarray/base/numel"),Bf=require("@stdlib/blas/ext/base/grev"),mA=Ur(),gA=Ee(),yA="throw";function dA(r,e,t,i,a,n,u){var o;for(o=0;o<e;o++)t[a]=n.call(u,r[o],[o],r),a+=i}function At(r,e,t,i,a,n,u,o,s,v,l){var c,p,m,g,y;for(g=a+1,c=g===t,m=i[a],y=0;y<m;y++)p=n.slice(),p.push(y),c?(u[s]=v.call(l,e[y],p,r),s+=o):s=At(r,e[y],t,i,g,p,u,o,s,v,l);return s}function hA(r,e,t,i,a,n,u,o){var s,v,l,c,p,m,g;for(s=pA(t),v=mA(s),At(r,r,e,t,0,[],v,1,0,u,o),l="row-major",p=lA(t,l),c=gA(t),Bf(e,c,1),Bf(e,p,1),g=0;g<s;g++)m=cA(c,p,0,l,g,yA),i[n]=v[m],n+=a}function qA(r,e,t,i,a,n,u,o){var s=e.length;return s===0?i:s===1?(dA(r,e[0],i,a,n,u,o),i):t?(hA(r,s,e,i,a,n,u,o),i):(At(r,r,s,e,0,[],i,a,n,u,o),i)}Pf.exports=qA});var Mf=f(function(r5,Nf){"use strict";var wA=require("@stdlib/ndarray/base/numel"),xA=Ur(),bA=_t();function EA(r,e,t,i,a){var n=xA(wA(e));return bA(r,e,t,n,1,0,i,a)}Nf.exports=EA});var Df=f(function(e5,Uf){"use strict";var TA=require("@stdlib/utils/define-nonenumerable-read-only-property"),If=Mf(),SA=_t();TA(If,"assign",SA);Uf.exports=If});var Yf=f(function(t5,Gf){"use strict";function AA(r,e,t){var i,a,n,u,o,s;if(a=e[1],n=e[0],i=[],t){for(u=0;u<a;u++)for(o=0;o<n;o++)i.push(r[o][u]);return i}for(o=0;o<n;o++)for(s=r[o],u=0;u<a;u++)i.push(s[u]);return i}Gf.exports=AA});var Zf=f(function(i5,Wf){"use strict";function _A(r,e,t,i,a,n){var u,o,s,v,l,c;if(u=e[1],o=e[0],c=n,t){for(s=0;s<u;s++)for(v=0;v<o;v++)i[c]=r[v][s],c+=a;return i}for(v=0;v<o;v++)for(l=r[v],s=0;s<u;s++)i[c]=l[s],c+=a;return i}Wf.exports=_A});var Kf=f(function(a5,Hf){"use strict";var jA=require("@stdlib/utils/define-nonenumerable-read-only-property"),Xf=Yf(),VA=Zf();jA(Xf,"assign",VA);Hf.exports=Xf});var Jf=f(function(n5,$f){"use strict";function kA(r,e,t,i,a){var n,u,o,s,v,l;if(u=e[1],o=e[0],n=[],t){for(s=0;s<u;s++)for(v=0;v<o;v++)n.push(i.call(a,r[v][s],[v,s],r));return n}for(v=0;v<o;v++)for(l=r[v],s=0;s<u;s++)n.push(i.call(a,l[s],[v,s],r));return n}$f.exports=kA});var rl=f(function(u5,Qf){"use strict";function CA(r,e,t,i,a,n,u,o){var s,v,l,c,p,m;if(s=e[1],v=e[0],m=n,t){for(l=0;l<s;l++)for(c=0;c<v;c++)i[m]=u.call(o,r[c][l],[c,l],r),m+=a;return i}for(c=0;c<v;c++)for(p=r[c],l=0;l<s;l++)i[m]=u.call(o,p[l],[c,l],r),m+=a;return i}Qf.exports=CA});var il=f(function(o5,tl){"use strict";var FA=require("@stdlib/utils/define-nonenumerable-read-only-property"),el=Jf(),LA=rl();FA(el,"assign",LA);tl.exports=el});var nl=f(function(s5,al){"use strict";function zA(r,e,t){var i,a,n,u,o,s,v,l,c;if(a=e[2],n=e[1],u=e[0],i=[],t){for(o=0;o<a;o++)for(s=0;s<n;s++)for(v=0;v<u;v++)i.push(r[v][s][o]);return i}for(v=0;v<u;v++)for(c=r[v],s=0;s<n;s++)for(l=c[s],o=0;o<a;o++)i.push(l[o]);return i}al.exports=zA});var ol=f(function(v5,ul){"use strict";function OA(r,e,t,i,a,n){var u,o,s,v,l,c,p,m,g;if(u=e[2],o=e[1],s=e[0],g=n,t){for(v=0;v<u;v++)for(l=0;l<o;l++)for(c=0;c<s;c++)i[g]=r[c][l][v],g+=a;return i}for(c=0;c<s;c++)for(m=r[c],l=0;l<o;l++)for(p=m[l],v=0;v<u;v++)i[g]=p[v],g+=a;return i}ul.exports=OA});var fl=f(function(f5,vl){"use strict";var RA=require("@stdlib/utils/define-nonenumerable-read-only-property"),sl=nl(),BA=ol();RA(sl,"assign",BA);vl.exports=sl});var cl=f(function(l5,ll){"use strict";function PA(r,e,t,i,a){var n,u,o,s,v,l,c,p,m;if(u=e[2],o=e[1],s=e[0],n=[],t){for(v=0;v<u;v++)for(l=0;l<o;l++)for(c=0;c<s;c++)n.push(i.call(a,r[c][l][v],[c,l,v],r));return n}for(c=0;c<s;c++)for(m=r[c],l=0;l<o;l++)for(p=m[l],v=0;v<u;v++)n.push(i.call(a,p[v],[c,l,v],r));return n}ll.exports=PA});var ml=f(function(c5,pl){"use strict";function NA(r,e,t,i,a,n,u,o){var s,v,l,c,p,m,g,y,d;if(s=e[2],v=e[1],l=e[0],d=n,t){for(c=0;c<s;c++)for(p=0;p<v;p++)for(m=0;m<l;m++)i[d]=u.call(o,r[m][p][c],[m,p,c],r),d+=a;return i}for(m=0;m<l;m++)for(y=r[m],p=0;p<v;p++)for(g=y[p],c=0;c<s;c++)i[d]=u.call(o,g[c],[m,p,c],r),d+=a;return i}pl.exports=NA});var dl=f(function(p5,yl){"use strict";var MA=require("@stdlib/utils/define-nonenumerable-read-only-property"),gl=cl(),IA=ml();MA(gl,"assign",IA);yl.exports=gl});var ql=f(function(m5,hl){"use strict";function UA(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g;if(a=e[3],n=e[2],u=e[1],o=e[0],i=[],t){for(s=0;s<a;s++)for(v=0;v<n;v++)for(l=0;l<u;l++)for(c=0;c<o;c++)i.push(r[c][l][v][s]);return i}for(c=0;c<o;c++)for(g=r[c],l=0;l<u;l++)for(m=g[l],v=0;v<n;v++)for(p=m[v],s=0;s<a;s++)i.push(p[s]);return i}hl.exports=UA});var xl=f(function(g5,wl){"use strict";function DA(r,e,t,i,a,n){var u,o,s,v,l,c,p,m,g,y,d,h;if(u=e[3],o=e[2],s=e[1],v=e[0],h=n,t){for(l=0;l<u;l++)for(c=0;c<o;c++)for(p=0;p<s;p++)for(m=0;m<v;m++)i[h]=r[m][p][c][l],h+=a;return i}for(m=0;m<v;m++)for(d=r[m],p=0;p<s;p++)for(y=d[p],c=0;c<o;c++)for(g=y[c],l=0;l<u;l++)i[h]=g[l],h+=a;return i}wl.exports=DA});var Tl=f(function(y5,El){"use strict";var GA=require("@stdlib/utils/define-nonenumerable-read-only-property"),bl=ql(),YA=xl();GA(bl,"assign",YA);El.exports=bl});var Al=f(function(d5,Sl){"use strict";function WA(r,e,t,i,a){var n,u,o,s,v,l,c,p,m,g,y,d;if(u=e[3],o=e[2],s=e[1],v=e[0],n=[],t){for(l=0;l<u;l++)for(c=0;c<o;c++)for(p=0;p<s;p++)for(m=0;m<v;m++)n.push(i.call(a,r[m][p][c][l],[m,p,c,l],r));return n}for(m=0;m<v;m++)for(d=r[m],p=0;p<s;p++)for(y=d[p],c=0;c<o;c++)for(g=y[c],l=0;l<u;l++)n.push(i.call(a,g[l],[m,p,c,l],r));return n}Sl.exports=WA});var jl=f(function(h5,_l){"use strict";function ZA(r,e,t,i,a,n,u,o){var s,v,l,c,p,m,g,y,d,h,x,b;if(s=e[3],v=e[2],l=e[1],c=e[0],b=n,t){for(p=0;p<s;p++)for(m=0;m<v;m++)for(g=0;g<l;g++)for(y=0;y<c;y++)i[b]=u.call(o,r[y][g][m][p],[y,g,m,p],r),b+=a;return i}for(y=0;y<c;y++)for(x=r[y],g=0;g<l;g++)for(h=x[g],m=0;m<v;m++)for(d=h[m],p=0;p<s;p++)i[b]=u.call(o,d[p],[y,g,m,p],r),b+=a;return i}_l.exports=ZA});var Cl=f(function(q5,kl){"use strict";var XA=require("@stdlib/utils/define-nonenumerable-read-only-property"),Vl=Al(),HA=jl();XA(Vl,"assign",HA);kl.exports=Vl});var Ll=f(function(w5,Fl){"use strict";function KA(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h;if(a=e[4],n=e[3],u=e[2],o=e[1],s=e[0],i=[],t){for(v=0;v<a;v++)for(l=0;l<n;l++)for(c=0;c<u;c++)for(p=0;p<o;p++)for(m=0;m<s;m++)i.push(r[m][p][c][l][v]);return i}for(m=0;m<s;m++)for(h=r[m],p=0;p<o;p++)for(d=h[p],c=0;c<u;c++)for(y=d[c],l=0;l<n;l++)for(g=y[l],v=0;v<a;v++)i.push(g[v]);return i}Fl.exports=KA});var Ol=f(function(x5,zl){"use strict";function $A(r,e,t,i,a,n){var u,o,s,v,l,c,p,m,g,y,d,h,x,b,E;if(u=e[4],o=e[3],s=e[2],v=e[1],l=e[0],E=n,t){for(c=0;c<u;c++)for(p=0;p<o;p++)for(m=0;m<s;m++)for(g=0;g<v;g++)for(y=0;y<l;y++)i[E]=r[y][g][m][p][c],E+=a;return i}for(y=0;y<l;y++)for(b=r[y],g=0;g<v;g++)for(x=b[g],m=0;m<s;m++)for(h=x[m],p=0;p<o;p++)for(d=h[p],c=0;c<u;c++)i[E]=d[c],E+=a;return i}zl.exports=$A});var Pl=f(function(b5,Bl){"use strict";var JA=require("@stdlib/utils/define-nonenumerable-read-only-property"),Rl=Ll(),QA=Ol();JA(Rl,"assign",QA);Bl.exports=Rl});var Ml=f(function(E5,Nl){"use strict";function r_(r,e,t,i,a){var n,u,o,s,v,l,c,p,m,g,y,d,h,x,b;if(u=e[4],o=e[3],s=e[2],v=e[1],l=e[0],n=[],t){for(c=0;c<u;c++)for(p=0;p<o;p++)for(m=0;m<s;m++)for(g=0;g<v;g++)for(y=0;y<l;y++)n.push(i.call(a,r[y][g][m][p][c],[y,g,m,p,c],r));return n}for(y=0;y<l;y++)for(b=r[y],g=0;g<v;g++)for(x=b[g],m=0;m<s;m++)for(h=x[m],p=0;p<o;p++)for(d=h[p],c=0;c<u;c++)n.push(i.call(a,d[c],[y,g,m,p,c],r));return n}Nl.exports=r_});var Ul=f(function(T5,Il){"use strict";function e_(r,e,t,i,a,n,u,o){var s,v,l,c,p,m,g,y,d,h,x,b,E,S,T;if(s=e[4],v=e[3],l=e[2],c=e[1],p=e[0],T=n,t){for(m=0;m<s;m++)for(g=0;g<v;g++)for(y=0;y<l;y++)for(d=0;d<c;d++)for(h=0;h<p;h++)i[T]=u.call(o,r[h][d][y][g][m],[h,d,y,g,m],r),T+=a;return i}for(h=0;h<p;h++)for(S=r[h],d=0;d<c;d++)for(E=S[d],y=0;y<l;y++)for(b=E[y],g=0;g<v;g++)for(x=b[g],m=0;m<s;m++)i[T]=u.call(o,x[m],[h,d,y,g,m],r),T+=a;return i}Il.exports=e_});var Yl=f(function(S5,Gl){"use strict";var t_=require("@stdlib/utils/define-nonenumerable-read-only-property"),Dl=Ml(),i_=Ul();t_(Dl,"assign",i_);Gl.exports=Dl});var Zl=f(function(A5,Wl){"use strict";function a_(r){var e,t,i,a,n;for(e=[],a=0;a<r.length;a++){for(t=r[a],i=[],n=t.length-1;n>=0;n--)i.push(t[n]);e.push(i)}return e}Wl.exports=a_});var jt=f(function(_5,Xl){"use strict";var n_=Zl();Xl.exports=n_});var Kl=f(function(j5,Hl){"use strict";var u_=jt();function o_(r){var e,t;for(e=[],t=0;t<r.length;t++)e.push(u_(r[t]));return e}Hl.exports=o_});var Vt=f(function(V5,$l){"use strict";var s_=Kl();$l.exports=s_});var Ql=f(function(k5,Jl){"use strict";var v_=Vt();function f_(r){var e,t;for(e=[],t=0;t<r.length;t++)e.push(v_(r[t]));return e}Jl.exports=f_});var kt=f(function(C5,rc){"use strict";var l_=Ql();rc.exports=l_});var tc=f(function(F5,ec){"use strict";var c_=kt();function p_(r){var e,t;for(e=[],t=0;t<r.length;t++)e.push(c_(r[t]));return e}ec.exports=p_});var ac=f(function(L5,ic){"use strict";var m_=tc();ic.exports=m_});var uc=f(function(z5,nc){"use strict";function g_(r){var e,t;for(e=[],t=r.length-1;t>=0;t--)e.push(r[t]);return e}nc.exports=g_});var Ct=f(function(O5,oc){"use strict";var y_=uc();oc.exports=y_});var vc=f(function(R5,sc){"use strict";var d_=Ct();function h_(r){var e,t;for(e=[],t=0;t<r.length;t++)e.push(d_(r[t]));return e}sc.exports=h_});var Ft=f(function(B5,fc){"use strict";var q_=vc();fc.exports=q_});var cc=f(function(P5,lc){"use strict";var w_=Ft();function x_(r){var e,t;for(e=[],t=0;t<r.length;t++)e.push(w_(r[t]));return e}lc.exports=x_});var Lt=f(function(N5,pc){"use strict";var b_=cc();pc.exports=b_});var gc=f(function(M5,mc){"use strict";var E_=Lt();function T_(r){var e,t;for(e=[],t=0;t<r.length;t++)e.push(E_(r[t]));return e}mc.exports=T_});var dc=f(function(I5,yc){"use strict";var S_=gc();yc.exports=S_});var qc=f(function(U5,hc){"use strict";var A_=Z();function __(r,e,t,i){var a,n,u,o;for(n=A_(e),u=i,a=[],o=0;o<r;o++)a.push(n(e,u)),u+=t;return a}hc.exports=__});var xc=f(function(D5,wc){"use strict";var j_=qc();wc.exports=j_});var Tc=f(function(G5,Ec){"use strict";var V_=require("@stdlib/assert/is-array"),bc=Z();function k_(r,e){var t,i,a,n,u,o,s,v;if(a=r.length,e.length!==a)throw new RangeError("invalid argument. The first and second arguments must have the same length.");for(t=bc(r),i=bc(e),n={},v=0;v<a;v++)s=t(r,v),u=i(e,v).toString(),o=n[u],V_(o)?o.push([v,s]):n[u]=[[v,s]];return n}Ec.exports=k_});var Ac=f(function(Y5,Sc){"use strict";var C_=Tc();Sc.exports=C_});var jc=f(function(W5,_c){"use strict";var F_=require("@stdlib/assert/is-array"),L_=Z();function z_(r,e,t){var i,a,n,u,o,s,v;for(a=r.length,i=L_(r),n={},v=0;v<a;v++)s=i(r,v),u=e.call(t,s,v,r),o=n[u],F_(o)?o.push([v,s]):n[u]=[[v,s]];return n}_c.exports=z_});var kc=f(function(Z5,Vc){"use strict";var O_=jc();Vc.exports=O_});var Fc=f(function(X5,Cc){"use strict";var R_=require("@stdlib/assert/is-array"),B_=Z();function P_(r,e){var t,i,a,n,u,o;if(i=r.length,e.length!==i)throw new RangeError("invalid argument. The first and second arguments must have the same length.");for(t=B_(e),a={},o=0;o<i;o++)n=t(e,o).toString(),u=a[n],R_(u)?u.push(o):a[n]=[o];return a}Cc.exports=P_});var zc=f(function(H5,Lc){"use strict";var N_=Fc();Lc.exports=N_});var Rc=f(function(K5,Oc){"use strict";var M_=require("@stdlib/assert/is-array"),I_=Z();function U_(r,e,t){var i,a,n,u,o,s;for(a=r.length,i=I_(r),n={},s=0;s<a;s++)u=e.call(t,i(r,s),s,r),o=n[u],M_(o)?o.push(s):n[u]=[s];return n}Oc.exports=U_});var Pc=f(function($5,Bc){"use strict";var D_=Rc();Bc.exports=D_});var Ic=f(function(J5,Mc){"use strict";var G_=require("@stdlib/assert/is-array"),Nc=Z();function Y_(r,e){var t,i,a,n,u,o,s,v;if(a=r.length,e.length!==a)throw new RangeError("invalid argument. The first and second arguments must have the same length.");for(t=Nc(r),i=Nc(e),n={},v=0;v<a;v++)s=t(r,v),u=i(e,v).toString(),o=n[u],G_(o)?o.push(s):n[u]=[s];return n}Mc.exports=Y_});var Dc=f(function(Q5,Uc){"use strict";var W_=Ic();Uc.exports=W_});var Yc=f(function(rW,Gc){"use strict";var Z_=require("@stdlib/assert/is-array"),X_=Z();function H_(r,e,t){var i,a,n,u,o,s,v;for(a=r.length,i=X_(r),n={},v=0;v<a;v++)s=i(r,v),u=e.call(t,s,v,r),o=n[u],Z_(o)?o.push(s):n[u]=[s];return n}Gc.exports=H_});var Zc=f(function(eW,Wc){"use strict";var K_=Yc();Wc.exports=K_});var Hc=f(function(tW,Xc){"use strict";var $_=require("@stdlib/math/base/special/ceil");function J_(r,e,t){var i,a,n;if(a=$_((e-r)/t),a<=1)return[r];for(i=[r],n=1;n<a;n++)i.push(r+t*n);return i}Xc.exports=J_});var zt=f(function(iW,Kc){"use strict";var Q_=Hc();Kc.exports=Q_});var Jc=f(function(aW,$c){"use strict";var rj=J(),ke=require("@stdlib/math/base/assert/is-nan");function ej(r,e){return typeof r[e]=="function"}function tj(r,e,t,i){var a;if(i&&ke(e)){for(a=t;a<r.length;a++)if(ke(r[a]))return a;return-1}for(a=t;a<r.length;a++)if(e===r[a])return a;return-1}function ij(r,e,t,i){var a,n,u;if(a=r.data,n=r.accessors[0],i&&ke(e)){for(u=t;u<a.length;u++)if(ke(n(a,u)))return u;return-1}for(u=t;u<a.length;u++)if(e===n(a,u))return u;return-1}function aj(r,e,t,i){var a;return ej(r,"indexOf")&&i===!1?r.indexOf(e,t):(t<0&&(t+=r.length,t<0&&(t=0)),a=rj(r),a.accessorProtocol?ij(a,e,t,i):tj(r,e,t,i))}$c.exports=aj});var rp=f(function(nW,Qc){"use strict";var nj=Jc();Qc.exports=nj});var tp=f(function(uW,ep){"use strict";var uj=Z();function oj(r){var e,t;if(e=uj(r),t=r.length-1,!(t<0))return e(r,t)}ep.exports=oj});var ap=f(function(oW,ip){"use strict";var sj=tp();ip.exports=sj});var up=f(function(sW,np){"use strict";var vj=J(),Ce=require("@stdlib/math/base/assert/is-nan");function fj(r,e){return typeof r[e]=="function"}function lj(r,e,t,i){var a;if(i&&Ce(e)){for(a=t;a>=0;a--)if(Ce(r[a]))return a;return-1}for(a=t;a>=0;a--)if(e===r[a])return a;return-1}function cj(r,e,t,i){var a,n,u;if(a=r.data,n=r.accessors[0],i&&Ce(e)){for(u=t;u>=0;u--)if(Ce(n(a,u)))return u;return-1}for(u=t;u>=0;u--)if(e===n(a,u))return u;return-1}function pj(r,e,t,i){var a;if(fj(r,"lastIndexOf")&&i===!1)return r.lastIndexOf(e,t);if(t<0){if(t+=r.length,t<0)return-1}else t>r.length&&(t=r.length-1);return a=vj(r),a.accessorProtocol?cj(a,e,t,i):lj(r,e,t,i)}np.exports=pj});var sp=f(function(vW,op){"use strict";var mj=up();op.exports=mj});var fp=f(function(fW,vp){"use strict";function gj(r,e,t){var i,a,n,u;if(t===0)return[];for(a=t-1,n=(e-r)/a,i=[r],u=1;u<a;u++)i.push(r+n*u);return i.push(e),i}vp.exports=gj});var cp=f(function(lW,lp){"use strict";var yj=fp();lp.exports=yj});var mp=f(function(cW,pp){"use strict";var Ot=require("@stdlib/math/base/special/pow");function dj(r,e,t){var i,a,n,u;if(t===0)return[];for(a=t-1,n=(e-r)/a,i=[Ot(10,r)],u=1;u<a;u++)i.push(Ot(10,r+n*u));return i.push(Ot(10,e)),i}pp.exports=dj});var Rt=f(function(pW,gp){"use strict";var hj=mp();gp.exports=hj});var dp=f(function(mW,yp){"use strict";function qj(r,e,t,i){var a,n,u,o,s,v,l;for(a=e[1],n=e[0],l=[],o=0;o<n;o++){for(s=r[o],v=[],u=0;u<a;u++)v.push(t.call(i,s[u],[o,u],r));l.push(v)}return l}yp.exports=qj});var qp=f(function(gW,hp){"use strict";function wj(r,e,t,i,a){var n,u,o,s,v,l;if(n=t[1],u=t[0],n<=0||u<=0)return e;for(s=0;s<u;s++)for(v=r[s],l=e[s],o=0;o<n;o++)l[o]=i.call(a,v[o],[s,o],r);return e}hp.exports=wj});var bp=f(function(yW,xp){"use strict";var xj=require("@stdlib/utils/define-nonenumerable-read-only-property"),wp=dp(),bj=qp();xj(wp,"assign",bj);xp.exports=wp});var Tp=f(function(dW,Ep){"use strict";function Ej(r,e,t,i){var a,n,u,o,s,v,l,c,p,m,g;for(a=e[2],n=e[1],u=e[0],g=[],v=0;v<u;v++){for(p=r[v],m=[],s=0;s<n;s++){for(l=p[s],c=[],o=0;o<a;o++)c.push(t.call(i,l[o],[v,s,o],r));m.push(c)}g.push(m)}return g}Ep.exports=Ej});var Ap=f(function(hW,Sp){"use strict";function Tj(r,e,t,i,a){var n,u,o,s,v,l,c,p,m,g;if(n=t[2],u=t[1],o=t[0],n<=0||u<=0||o<=0)return e;for(l=0;l<o;l++)for(m=r[l],g=e[l],v=0;v<u;v++)for(c=m[v],p=g[v],s=0;s<n;s++)p[s]=i.call(a,c[s],[l,v,s],r);return e}Sp.exports=Tj});var Vp=f(function(qW,jp){"use strict";var Sj=require("@stdlib/utils/define-nonenumerable-read-only-property"),_p=Tp(),Aj=Ap();Sj(_p,"assign",Aj);jp.exports=_p});var Cp=f(function(wW,kp){"use strict";function _j(r,e,t,i){var a,n,u,o,s,v,l,c,p,m,g,y,d,h,x;for(a=e[3],n=e[2],u=e[1],o=e[0],x=[],c=0;c<o;c++){for(d=r[c],h=[],l=0;l<u;l++){for(g=d[l],y=[],v=0;v<n;v++){for(p=g[v],m=[],s=0;s<a;s++)m.push(t.call(i,p[s],[c,l,v,s],r));y.push(m)}h.push(y)}x.push(h)}return x}kp.exports=_j});var Lp=f(function(xW,Fp){"use strict";function jj(r,e,t,i,a){var n,u,o,s,v,l,c,p,m,g,y,d,h,x;if(n=t[3],u=t[2],o=t[1],s=t[0],n<=0||u<=0||o<=0||s<=0)return e;for(p=0;p<s;p++)for(h=r[p],x=e[p],c=0;c<o;c++)for(y=h[c],d=x[c],l=0;l<u;l++)for(m=y[l],g=d[l],v=0;v<n;v++)g[v]=i.call(a,m[v],[p,c,l,v],r);return e}Fp.exports=jj});var Rp=f(function(bW,Op){"use strict";var Vj=require("@stdlib/utils/define-nonenumerable-read-only-property"),zp=Cp(),kj=Lp();Vj(zp,"assign",kj);Op.exports=zp});var Pp=f(function(EW,Bp){"use strict";function Cj(r,e,t,i){var a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T;for(a=e[4],n=e[3],u=e[2],o=e[1],s=e[0],T=[],m=0;m<s;m++){for(E=r[m],S=[],p=0;p<o;p++){for(x=E[p],b=[],c=0;c<u;c++){for(d=x[c],h=[],l=0;l<n;l++){for(g=d[l],y=[],v=0;v<a;v++)y.push(t.call(i,g[v],[m,p,c,l,v],r));h.push(y)}b.push(h)}S.push(b)}T.push(S)}return T}Bp.exports=Cj});var Mp=f(function(TW,Np){"use strict";function Fj(r,e,t,i,a){var n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T;if(n=t[4],u=t[3],o=t[2],s=t[1],v=t[0],n<=0||u<=0||o<=0||s<=0||v<=0)return e;for(g=0;g<v;g++)for(S=r[g],T=e[g],m=0;m<s;m++)for(b=S[m],E=T[m],p=0;p<o;p++)for(h=b[p],x=E[p],c=0;c<u;c++)for(y=h[c],d=x[c],l=0;l<n;l++)d[l]=i.call(a,y[l],[g,m,p,c,l],r);return e}Np.exports=Fj});var Dp=f(function(SW,Up){"use strict";var Lj=require("@stdlib/utils/define-nonenumerable-read-only-property"),Ip=Pp(),zj=Mp();Lj(Ip,"assign",zj);Up.exports=Ip});var Yp=f(function(AW,Gp){"use strict";function Oj(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g;if(i=e[1],a=e[0],!(i<=0||a<=0))for(c=r[0],p=r[1],m=r[3],g=r[2],u=0;u<a;u++)for(o=c[u],s=p[u],v=m[u],l=g[u],n=0;n<i;n++)l[n]===0&&(v[n]=t(o[n],s[n]))}Gp.exports=Oj});var Zp=f(function(_W,Wp){"use strict";var Rj=Yp();Wp.exports=Rj});var Kp=f(function(jW,Hp){"use strict";var Xp=Z();function Bj(r,e){var t,i,a,n;for(t=Xp(r),i=Xp(e),a=[],n=0;n<r.length;n++)i(e,n)&&a.push(t(r,n));return a}Hp.exports=Bj});var Jp=f(function(VW,$p){"use strict";var Pj=Kp();$p.exports=Pj});var em=f(function(kW,rm){"use strict";var Qp=Z();function Nj(r,e){var t,i,a,n;for(t=Qp(r),i=Qp(e),a=[],n=0;n<r.length;n++)i(e,n)||a.push(t(r,n));return a}rm.exports=Nj});var im=f(function(CW,tm){"use strict";var Mj=em();tm.exports=Mj});var nm=f(function(FW,am){"use strict";function Ij(r,e,t){var i,a,n,u,o,s,v,l,c,p;if(i=e[1],a=e[0],!(i<=0||a<=0))for(l=r[0],c=r[2],p=r[1],u=0;u<a;u++)for(o=l[u],s=c[u],v=p[u],n=0;n<i;n++)v[n]===0&&(s[n]=t(o[n]))}am.exports=Ij});var om=f(function(LW,um){"use strict";var Uj=nm();um.exports=Uj});var vm=f(function(zW,sm){"use strict";function Dj(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h;if(i=e[2],a=e[1],n=e[0],!(i<=0||a<=0||n<=0))for(y=r[0],d=r[2],h=r[1],s=0;s<n;s++)for(l=y[s],p=d[s],g=h[s],o=0;o<a;o++)for(v=l[o],c=p[o],m=g[o],u=0;u<i;u++)m[u]===0&&(c[u]=t(v[u]))}sm.exports=Dj});var lm=f(function(OW,fm){"use strict";var Gj=vm();fm.exports=Gj});var pm=f(function(RW,cm){"use strict";function Yj(r,e){var t,i,a,n,u,o,s,v,l,c,p,m;for(t=arguments.length,a=[r,e],i=[r.length,e.length],s=[0,0],v=i[0]*i[1],c=2;c<t;c++)o=arguments[c],a.push(o),i.push(o.length),s.push(0),v*=i[c];for(n=[],c=0;c<v;c++){for(m=c,p=t-1;p>=0;p--)l=m%i[p],m-=l,m/=i[p],s[p]=l;for(u=[],p=0;p<t;p++)u.push(a[p][s[p]]);n.push(u)}return n}cm.exports=Yj});var gm=f(function(BW,mm){"use strict";var Wj=pm();mm.exports=Wj});var dm=f(function(PW,ym){"use strict";var Zj=zr(),Xj=Lr(),Hj=J(),Kj=require("@stdlib/strided/base/reinterpret-complex128"),$j=require("@stdlib/strided/base/reinterpret-complex64");function Bt(r){var e;for(e=0;e<r.length;e++)if(r[e])return!1;return!0}function Jj(r){var e,t,i;for(e=r.data,t=r.accessors[0],i=0;i<e.length;i++)if(t(e,i))return!1;return!0}function Qj(r){var e=Hj(r);return e.accessorProtocol?Zj(r)?Bt(Kj(r,0)):Xj(r)?Bt($j(r,0)):Jj(e):Bt(r)}ym.exports=Qj});var qm=f(function(NW,hm){"use strict";var rV=dm();hm.exports=rV});var xm=f(function(MW,wm){"use strict";var eV=J();function tV(r,e,t){var i;for(i=0;i<r.length;i++)if(e.call(t,r[i],i,r))return!1;return!0}function iV(r,e,t){var i,a,n;for(i=r.data,a=r.accessors[0],n=0;n<i.length;n++)if(e.call(t,a(i,n),n,i))return!1;return!0}function aV(r,e,t){var i=eV(r);return i.accessorProtocol?iV(i,e,t):tV(r,e,t)}wm.exports=aV});var Em=f(function(IW,bm){"use strict";var nV=xm();bm.exports=nV});var Sm=f(function(UW,Tm){"use strict";var uV=J();function oV(r,e,t){var i;for(i=r.length-1;i>=0;i--)if(e.call(t,r[i],i,r))return!1;return!0}function sV(r,e,t){var i,a,n;for(i=r.data,a=r.accessors[0],n=i.length-1;n>=0;n--)if(e.call(t,a(i,n),n,i))return!1;return!0}function vV(r,e,t){var i=uV(r);return i.accessorProtocol?sV(i,e,t):oV(r,e,t)}Tm.exports=vV});var _m=f(function(DW,Am){"use strict";var fV=Sm();Am.exports=fV});var Vm=f(function(GW,jm){"use strict";function lV(r){var e,t;if(e=[],r<=0)return e;for(t=1;t<r+1;t++)e.push(t);return e}jm.exports=lV});var Fm=f(function(YW,Cm){"use strict";var cV=zr(),pV=Lr(),mV=J(),gV=require("@stdlib/strided/base/reinterpret-complex128"),yV=require("@stdlib/strided/base/reinterpret-complex64");function dV(r,e,t){var i,a;for(a=t,i=1;a>=0&&a<r.length;)r[a]=i,a+=e,i+=1;return r}function km(r,e,t,i){var a,n,u;for(n=t*2,u=i*2,a=1;u>=0&&u<e.length;)e[u]=a,e[u+1]=0,u+=n,a+=1;return r}function hV(r,e,t){var i,a,n,u;for(i=r.data,a=r.accessors[1],u=t,n=1;u>=0&&u<i.length;)a(i,u,n),u+=e,n+=1;return i}function qV(r,e,t){var i=mV(r);return i.accessorProtocol?cV(r)?km(r,gV(r,0),e,t):pV(r)?km(r,yV(r,0),e,t):hV(i,e,t):dV(r,e,t)}Cm.exports=qV});var Pt=f(function(WW,zm){"use strict";var wV=require("@stdlib/utils/define-nonenumerable-read-only-property"),Lm=Vm(),xV=Fm();wV(Lm,"assign",xV);zm.exports=Lm});var Rm=f(function(ZW,Om){"use strict";var bV=Sr();function EV(r){return bV(1,r)}Om.exports=EV});var Pm=f(function(XW,Bm){"use strict";var TV=Rm();Bm.exports=TV});var Mm=f(function(HW,Nm){"use strict";var SV=Se();function AV(r){return SV(1,r)}Nm.exports=AV});var Um=f(function(KW,Im){"use strict";var _V=Mm();Im.exports=_V});var Gm=f(function($W,Dm){"use strict";var jV=Ae();function VV(r){return jV(1,r)}Dm.exports=VV});var Wm=f(function(JW,Ym){"use strict";var kV=Gm();Ym.exports=kV});var Xm=f(function(QW,Zm){"use strict";var CV=_e();function FV(r){return CV(1,r)}Zm.exports=FV});var Km=f(function(rZ,Hm){"use strict";var LV=Xm();Hm.exports=LV});var Jm=f(function(eZ,$m){"use strict";var zV=je();function OV(r){return zV(1,r)}$m.exports=OV});var r0=f(function(tZ,Qm){"use strict";var RV=Jm();Qm.exports=RV});var t0=f(function(iZ,e0){"use strict";var BV=Ve();function PV(r){return BV(1,r)}e0.exports=PV});var a0=f(function(aZ,i0){"use strict";var NV=t0();i0.exports=NV});var u0=f(function(nZ,n0){"use strict";function MV(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d;if(i=e[1],a=e[0],!(i<=0||a<=0))for(p=r[0],m=r[1],g=r[2],y=r[3],d=r[4],u=0;u<a;u++)for(o=p[u],s=m[u],v=g[u],l=y[u],c=d[u],n=0;n<i;n++)c[n]=t(o[n],s[n],v[n],l[n])}n0.exports=MV});var s0=f(function(uZ,o0){"use strict";var IV=u0();o0.exports=IV});var f0=f(function(oZ,v0){"use strict";function UV(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j;if(i=e[2],a=e[1],n=e[0],!(i<=0||a<=0||n<=0))for(b=r[0],E=r[1],S=r[2],T=r[3],j=r[4],s=0;s<n;s++)for(g=b[s],y=E[s],d=S[s],h=T[s],x=j[s],o=0;o<a;o++)for(v=g[o],l=y[o],c=d[o],p=h[o],m=x[o],u=0;u<i;u++)m[u]=t(v[u],l[u],c[u],p[u])}v0.exports=UV});var c0=f(function(sZ,l0){"use strict";var DV=f0();l0.exports=DV});var m0=f(function(vZ,p0){"use strict";function GV(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B;if(i=e[3],a=e[2],n=e[1],u=e[0],!(i<=0||a<=0||n<=0||u<=0))for(C=r[0],O=r[1],F=r[2],L=r[3],B=r[4],l=0;l<u;l++)for(S=C[l],T=O[l],j=F[l],k=L[l],V=B[l],v=0;v<n;v++)for(d=S[v],h=T[v],x=j[v],b=k[v],E=V[v],s=0;s<a;s++)for(c=d[s],p=h[s],m=x[s],g=b[s],y=E[s],o=0;o<i;o++)y[o]=t(c[o],p[o],m[o],g[o])}p0.exports=GV});var y0=f(function(fZ,g0){"use strict";var YV=m0();g0.exports=YV});var h0=f(function(lZ,d0){"use strict";function WV(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D,W,M,Y,Q,$;if(i=e[4],a=e[3],n=e[2],u=e[1],o=e[0],!(i<=0||a<=0||n<=0||u<=0||o<=0))for(W=r[0],M=r[1],Y=r[2],Q=r[3],$=r[4],p=0;p<o;p++)for(F=W[p],L=M[p],B=Y[p],I=Q[p],D=$[p],c=0;c<u;c++)for(j=F[c],k=L[c],V=B[c],C=I[c],O=D[c],l=0;l<n;l++)for(x=j[l],b=k[l],E=V[l],S=C[l],T=O[l],v=0;v<a;v++)for(m=x[v],g=b[v],y=E[v],d=S[v],h=T[v],s=0;s<i;s++)h[s]=t(m[s],g[s],y[s],d[s])}d0.exports=WV});var w0=f(function(cZ,q0){"use strict";var ZV=h0();q0.exports=ZV});var b0=f(function(pZ,x0){"use strict";function XV(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x;if(i=e[1],a=e[0],!(i<=0||a<=0))for(m=r[0],g=r[1],y=r[2],d=r[3],h=r[4],x=r[5],u=0;u<a;u++)for(o=m[u],s=g[u],v=y[u],l=d[u],c=h[u],p=x[u],n=0;n<i;n++)p[n]=t(o[n],s[n],v[n],l[n],c[n])}x0.exports=XV});var T0=f(function(mZ,E0){"use strict";var HV=b0();E0.exports=HV});var A0=f(function(gZ,S0){"use strict";function KV(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C;if(i=e[2],a=e[1],n=e[0],!(i<=0||a<=0||n<=0))for(S=r[0],T=r[1],j=r[2],k=r[3],V=r[4],C=r[5],s=0;s<n;s++)for(y=S[s],d=T[s],h=j[s],x=k[s],b=V[s],E=C[s],o=0;o<a;o++)for(v=y[o],l=d[o],c=h[o],p=x[o],m=b[o],g=E[o],u=0;u<i;u++)g[u]=t(v[u],l[u],c[u],p[u],m[u])}S0.exports=KV});var j0=f(function(yZ,_0){"use strict";var $V=A0();_0.exports=$V});var k0=f(function(dZ,V0){"use strict";function JV(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D,W,M;if(i=e[3],a=e[2],n=e[1],u=e[0],!(i<=0||a<=0||n<=0||u<=0))for(L=r[0],B=r[1],I=r[2],D=r[3],W=r[4],M=r[5],l=0;l<u;l++)for(j=L[l],k=B[l],V=I[l],C=D[l],O=W[l],F=M[l],v=0;v<n;v++)for(h=j[v],x=k[v],b=V[v],E=C[v],S=O[v],T=F[v],s=0;s<a;s++)for(c=h[s],p=x[s],m=b[s],g=E[s],y=S[s],d=T[s],o=0;o<i;o++)d[o]=t(c[o],p[o],m[o],g[o],y[o])}V0.exports=JV});var F0=f(function(hZ,C0){"use strict";var QV=k0();C0.exports=QV});var z0=f(function(qZ,L0){"use strict";function rk(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D,W,M,Y,Q,$,nr,wr,xr,br,ne;if(i=e[4],a=e[3],n=e[2],u=e[1],o=e[0],!(i<=0||a<=0||n<=0||u<=0||o<=0))for($=r[0],nr=r[1],wr=r[2],xr=r[3],br=r[4],ne=r[5],p=0;p<o;p++)for(I=$[p],D=nr[p],W=wr[p],M=xr[p],Y=br[p],Q=ne[p],c=0;c<u;c++)for(V=I[c],C=D[c],O=W[c],F=M[c],L=Y[c],B=Q[c],l=0;l<n;l++)for(b=V[l],E=C[l],S=O[l],T=F[l],j=L[l],k=B[l],v=0;v<a;v++)for(m=b[v],g=E[v],y=S[v],d=T[v],h=j[v],x=k[v],s=0;s<i;s++)x[s]=t(m[s],g[s],y[s],d[s],h[s])}L0.exports=rk});var R0=f(function(wZ,O0){"use strict";var ek=z0();O0.exports=ek});var P0=f(function(xZ,B0){"use strict";var tk=J();function ik(r,e,t){var i,a,n;for(i=[],n=0;n<r.length;n++)a=r[n],e.call(t,a,n,r)||i.push(a);return i}function ak(r,e,t){var i,a,n,u,o;for(i=r.data,a=r.accessors[0],n=[],o=0;o<i.length;o++)u=a(i,o),e.call(t,u,o,i)||n.push(u);return n}function nk(r,e,t){var i=tk(r);return i.accessorProtocol?ak(i,e,t):ik(r,e,t)}B0.exports=nk});var M0=f(function(bZ,N0){"use strict";var uk=P0();N0.exports=uk});var U0=f(function(EZ,I0){"use strict";var ok=rr(),sk=oe(),vk=ue(),fk=H();function lk(r){var e=fk(r);return ok(r)?sk(e):vk(e)}I0.exports=lk});var G0=f(function(TZ,D0){"use strict";var ck=U0();D0.exports=ck});var Z0=f(function(SZ,W0){"use strict";var pk=J(),Y0=require("@stdlib/math/base/special/floor");function mk(r,e){return typeof r[e]=="function"}function gk(r){var e,t,i,a,n;for(t=Y0(r.length/2),i=r.length-1,a=0;a<t;a++)n=i-a,e=r[a],r[a]=r[n],r[n]=e;return r}function yk(r){var e,t,i,a,n,u,o,s;for(e=r.data,t=r.accessors[0],i=r.accessors[1],n=Y0(e.length/2),u=e.length-1,o=0;o<n;o++)s=u-o,a=t(e,o),i(e,o,t(e,s)),i(e,s,a);return e}function dk(r){var e;return mk(r,"reverse")?r.reverse():(e=pk(r),e.accessorProtocol?yk(e):gk(r))}W0.exports=dk});var H0=f(function(AZ,X0){"use strict";var hk=Z0();X0.exports=hk});var $0=f(function(_Z,K0){"use strict";var qk=J(),wk=Array.prototype.slice;function xk(r,e){return typeof r[e]=="function"}function bk(r,e,t){return wk.call(r,e,t)}function Ek(r,e,t){var i,a,n,u;for(i=r.data,a=r.accessors[0],n=[],u=e;u<t;u++)n.push(a(i,u));return n}function Tk(r,e,t){var i;return xk(r,"slice")?r.slice(e,t):(i=qk(r),i.accessorProtocol?Ek(i,e,t):bk(r,e,t))}K0.exports=Tk});var Nt=f(function(jZ,J0){"use strict";var Sk=$0();J0.exports=Sk});var rg=f(function(VZ,Q0){"use strict";var Ak=Z();function _k(r,e,t,i){var a,n,u,o,s,v,l,c,p,m;for(a=Ak(r),l=e[0],v=e[1],s=t[0],o=t[1],n=[],p=0;p<l;p++){for(u=[],m=i+s*p,c=0;c<v;c++)u.push(a(r,m)),m+=o;n.push(u)}return n}Q0.exports=_k});var tg=f(function(kZ,eg){"use strict";var jk=rg();eg.exports=jk});var ag=f(function(CZ,ig){"use strict";var Vk=Z();function kk(r,e,t,i){var a,n,u,o,s,v,l,c,p,m,g,y,d,h,x;for(a=Vk(r),m=e[0],p=e[1],c=e[2],s=t[0],o=t[1],u=t[2],n=[],d=0;d<m;d++){for(h=[],v=i+s*d,y=0;y<p;y++){for(x=[],l=v+o*y,g=0;g<c;g++)x.push(a(r,l)),l+=u;h.push(x)}n.push(h)}return n}ig.exports=kk});var ug=f(function(FZ,ng){"use strict";var Ck=ag();ng.exports=Ck});var sg=f(function(LZ,og){"use strict";var Fk=Z();function Lk(r,e,t,i){var a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j;for(a=Fk(r),d=e[0],y=e[1],g=e[2],m=e[3],v=t[0],s=t[1],o=t[2],u=t[3],n=[],E=0;E<d;E++){for(S=[],l=i+v*E,b=0;b<y;b++){for(T=[],c=l+s*b,x=0;x<g;x++){for(j=[],p=c+o*x,h=0;h<m;h++)j.push(a(r,p)),p+=u;T.push(j)}S.push(T)}n.push(S)}return n}og.exports=Lk});var fg=f(function(zZ,vg){"use strict";var zk=sg();vg.exports=zk});var cg=f(function(OZ,lg){"use strict";var Ok=Z();function Rk(r,e,t,i){var a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F;for(a=Ok(r),b=e[0],x=e[1],h=e[2],d=e[3],y=e[4],l=t[0],v=t[1],s=t[2],o=t[3],u=t[4],n=[],k=0;k<b;k++){for(V=[],c=i+l*k,j=0;j<x;j++){for(C=[],p=c+v*j,T=0;T<h;T++){for(O=[],m=p+s*T,S=0;S<d;S++){for(F=[],g=m+o*S,E=0;E<y;E++)F.push(a(r,g)),g+=u;O.push(F)}C.push(O)}V.push(C)}n.push(V)}return n}lg.exports=Rk});var mg=f(function(RZ,pg){"use strict";var Bk=cg();pg.exports=Bk});var yg=f(function(BZ,gg){"use strict";var Pk=Z();function Nk(r,e){var t,i,a;for(t=Pk(r),i=[],a=0;a<e.length;a++)i.push(t(r,e[a]));return i}gg.exports=Nk});var hg=f(function(PZ,dg){"use strict";var Mk=yg();dg.exports=Mk});var wg=f(function(NZ,qg){"use strict";function Ik(r,e){var t,i;for(t=[],i=0;i<e.length;i++)t.push(r[e[i]]);return t}qg.exports=Ik});var bg=f(function(MZ,xg){"use strict";var Uk=wg();xg.exports=Uk});var Sg=f(function(IZ,Tg){"use strict";var Dk=require("@stdlib/ndarray/base/normalize-index"),Gk=require("@stdlib/ndarray/base/ind").factory,Yk=require("@stdlib/string/format"),Eg=2;function Wk(r,e,t,i){var a,n,u,o,s,v,l,c,p;if(u=Dk(t,Eg-1),u===-1)throw new RangeError(Yk("invalid argument. Third argument exceeds the number of dimensions. Number of dimensions: %d. Value: `%d`.",Eg,t));if(o=Gk(i),n=[],u===0){for(a=r.length-1,l=0;l<e.length;l++)s=o(e[l],a),n.push(r[s]);return n}for(l=0;l<r.length;l++){for(c=r[l],p=[],a=c.length-1,v=0;v<e.length;v++)s=o(e[v],a),p.push(c[s]);n.push(p)}return n}Tg.exports=Wk});var Mt=f(function(UZ,Ag){"use strict";var Zk=Sg();Ag.exports=Zk});var Vg=f(function(DZ,jg){"use strict";var Xk=require("@stdlib/ndarray/base/normalize-index"),Hk=require("@stdlib/ndarray/base/ind").factory,Kk=Mt(),$k=require("@stdlib/string/format"),_g=3;function Jk(r,e,t,i){var a,n,u,o,s,v;if(u=Xk(t,_g-1),u===-1)throw new RangeError($k("invalid argument. Third argument exceeds the number of dimensions. Number of dimensions: %d. Value: `%d`.",_g,t));if(n=[],u===0){for(o=Hk(i),a=r.length-1,v=0;v<e.length;v++)s=o(e[v],a),n.push(r[s]);return n}for(u=t-1,v=0;v<r.length;v++)n.push(Kk(r[v],e,u,i));return n}jg.exports=Jk});var Cg=f(function(GZ,kg){"use strict";var Qk=Vg();kg.exports=Qk});var Lg=f(function(YZ,Fg){"use strict";function rC(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g;if(i=e[1],a=e[0],!(i<=0||a<=0))for(c=r[0],p=r[1],m=r[2],g=r[3],u=0;u<a;u++)for(o=c[u],s=p[u],v=m[u],l=g[u],n=0;n<i;n++)l[n]=t(o[n],s[n],v[n])}Fg.exports=rC});var Og=f(function(WZ,zg){"use strict";var eC=Lg();zg.exports=eC});var Bg=f(function(ZZ,Rg){"use strict";function tC(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E;if(i=e[2],a=e[1],n=e[0],!(i<=0||a<=0||n<=0))for(h=r[0],x=r[1],b=r[2],E=r[3],s=0;s<n;s++)for(m=h[s],g=x[s],y=b[s],d=E[s],o=0;o<a;o++)for(v=m[o],l=g[o],c=y[o],p=d[o],u=0;u<i;u++)p[u]=t(v[u],l[u],c[u])}Rg.exports=tC});var Ng=f(function(XZ,Pg){"use strict";var iC=Bg();Pg.exports=iC});var Ig=f(function(HZ,Mg){"use strict";function aC(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C;if(i=e[3],a=e[2],n=e[1],u=e[0],!(i<=0||a<=0||n<=0||u<=0))for(j=r[0],k=r[1],V=r[2],C=r[3],l=0;l<u;l++)for(b=j[l],E=k[l],S=V[l],T=C[l],v=0;v<n;v++)for(y=b[v],d=E[v],h=S[v],x=T[v],s=0;s<a;s++)for(c=y[s],p=d[s],m=h[s],g=x[s],o=0;o<i;o++)g[o]=t(c[o],p[o],m[o])}Mg.exports=aC});var Dg=f(function(KZ,Ug){"use strict";var nC=Ig();Ug.exports=nC});var Yg=f(function($Z,Gg){"use strict";function uC(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T,j,k,V,C,O,F,L,B,I,D;if(i=e[4],a=e[3],n=e[2],u=e[1],o=e[0],!(i<=0||a<=0||n<=0||u<=0))for(L=r[0],B=r[1],I=r[2],D=r[3],p=0;p<o;p++)for(V=L[p],C=B[p],O=I[p],F=D[p],c=0;c<u;c++)for(S=V[c],T=C[c],j=O[c],k=F[c],l=0;l<n;l++)for(h=S[l],x=T[l],b=j[l],E=k[l],v=0;v<a;v++)for(m=h[v],g=x[v],y=b[v],d=E[v],s=0;s<i;s++)d[s]=t(m[s],g[s],y[s])}Gg.exports=uC});var Zg=f(function(JZ,Wg){"use strict";var oC=Yg();Wg.exports=oC});var Hg=f(function(QZ,Xg){"use strict";var sC=rr(),vC=mt();function fC(r){return r&&typeof r=="object"&&sC(r)?r:new vC(r)}Xg.exports=fC});var $g=f(function(rX,Kg){"use strict";var lC=Hg();Kg.exports=lC});var ry=f(function(eX,Qg){"use strict";var Jg=require("@stdlib/math/base/assert/is-nan");function cC(r,e){var t,i,a,n,u,o;if(n=[],a=r.length,a===0)return n;for(i=NaN,t=0,o=0;o<a;o++)u=r[o],u===i?(t+=1,t<=e&&n.push(i)):(i=u,t=1,n.push(i));return n}function pC(r,e){var t,i,a,n,u,o,s;if(n=[],a=r.length,a===0)return n;for(u=!1,i=NaN,t=0,s=0;s<a;s++)o=r[s],o===i||u&&Jg(o)?(t+=1,t<=e&&n.push(i)):(i=o,t=1,n.push(i),u=!1,Jg(i)&&(u=!0));return n}function mC(r,e,t){return t?pC(r,e):cC(r,e)}Qg.exports=mC});var ty=f(function(tX,ey){"use strict";var gC=ry();ey.exports=gC});var ay=f(function(iX,iy){"use strict";var yC=J();function dC(r,e){return typeof r[e]=="function"}function hC(r){var e,t;for(e=[],t=r.length-1;t>=0;t--)e.push(r[t]);return e}function qC(r){var e,t,i,a;for(e=r.data,t=r.accessors[0],i=[],a=e.length-1;a>=0;a--)i.push(t(e,a));return i}function wC(r){var e;return dC(r,"toReversed")?r.toReversed():(e=yC(r),e.accessorProtocol?qC(e):hC(r))}iy.exports=wC});var uy=f(function(aX,ny){"use strict";var xC=ay();ny.exports=xC});var sy=f(function(nX,oy){"use strict";function bC(r,e,t){var i,a,n,u,o,s,v,l;if(i=e[1],a=e[0],!(i<=0||a<=0))for(v=r[0],l=r[1],u=0;u<a;u++)for(o=v[u],s=l[u],n=0;n<i;n++)s[n]=t(o[n])}oy.exports=bC});var fy=f(function(uX,vy){"use strict";var EC=sy();vy.exports=EC});var cy=f(function(oX,ly){"use strict";function TC(r,e,t,i){var a,n,u,o,s,v,l,c,p,m;if(n=e[1],u=e[0],!(n<=0||u<=0))for(arguments.length>4&&(a=arguments[4]),c=r[0],p=r[1],s=0;s<u;s++)for(v=c[s],l=p[s],o=0;o<n;o++)m=i.call(a,v[o],[s,o],[c,p]),m!==void 0&&(l[o]=t(m))}ly.exports=TC});var my=f(function(sX,py){"use strict";var SC=cy();py.exports=SC});var yy=f(function(vX,gy){"use strict";function AC(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g;if(i=e[2],a=e[1],n=e[0],!(i<=0||a<=0||n<=0))for(m=r[0],g=r[1],s=0;s<n;s++)for(l=m[s],p=g[s],o=0;o<a;o++)for(v=l[o],c=p[o],u=0;u<i;u++)c[u]=t(v[u])}gy.exports=AC});var hy=f(function(fX,dy){"use strict";var _C=yy();dy.exports=_C});var wy=f(function(lX,qy){"use strict";function jC(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x;if(i=e[3],a=e[2],n=e[1],u=e[0],!(i<=0||a<=0||n<=0||u<=0))for(h=r[0],x=r[1],l=0;l<u;l++)for(m=h[l],d=x[l],v=0;v<n;v++)for(p=m[v],y=d[v],s=0;s<a;s++)for(c=p[s],g=y[s],o=0;o<i;o++)g[o]=t(c[o])}qy.exports=jC});var by=f(function(cX,xy){"use strict";var VC=wy();xy.exports=VC});var Ty=f(function(pX,Ey){"use strict";function kC(r,e,t){var i,a,n,u,o,s,v,l,c,p,m,g,y,d,h,x,b,E,S,T;if(i=e[4],a=e[3],n=e[2],u=e[1],o=e[0],!(i<=0||a<=0||n<=0||u<=0||o<=0))for(S=r[0],T=r[1],p=0;p<o;p++)for(d=S[p],E=T[p],c=0;c<u;c++)for(y=d[c],b=E[c],l=0;l<n;l++)for(g=y[l],x=b[l],v=0;v<a;v++)for(m=g[v],h=x[v],s=0;s<i;s++)h[s]=t(m[s])}Ey.exports=kC});var Ay=f(function(mX,Sy){"use strict";var CC=Ty();Sy.exports=CC});var Vy=f(function(gX,jy){"use strict";function _y(r,e,t,i,a,n){var u,o,s;if(u=i[a],o=a+1,o===t){for(s=0;s<u;s++)e[s]=n(r[s]);return}for(s=0;s<u;s++)_y(r[s],e[s],t,i,o,n)}function FC(r,e,t){return _y(r[0],r[1],e.length,e,0,t)}jy.exports=FC});var Cy=f(function(yX,ky){"use strict";var LC=Vy();ky.exports=LC});var Ly=f(function(dX,Fy){"use strict";function zC(r,e){var t,i,a;if(i=e-r,i<=1)return[r];for(t=[r],a=1;a<i;a++)t.push(r+a);return t}Fy.exports=zC});var Oy=f(function(hX,zy){"use strict";var OC=Ly();zy.exports=OC});var By=f(function(qX,Ry){"use strict";function RC(r){var e,t;if(e=[],r<=0)return e;for(t=0;t<r;t++)e.push(t);return e}Ry.exports=RC});var My=f(function(wX,Ny){"use strict";var BC=zr(),PC=Lr(),NC=J(),MC=require("@stdlib/strided/base/reinterpret-complex128"),IC=require("@stdlib/strided/base/reinterpret-complex64");function UC(r,e,t){var i,a;for(a=t,i=0;a>=0&&a<r.length;)r[a]=i,a+=e,i+=1;return r}function Py(r,e,t,i){var a,n,u;for(n=t*2,u=i*2,a=0;u>=0&&u<e.length;)e[u]=a,e[u+1]=0,u+=n,a+=1;return r}function DC(r,e,t){var i,a,n,u;for(i=r.data,a=r.accessors[1],u=t,n=0;u>=0&&u<i.length;)a(i,u,n),u+=e,n+=1;return i}function GC(r,e,t){var i=NC(r);return i.accessorProtocol?BC(r)?Py(r,MC(r,0),e,t):PC(r)?Py(r,IC(r,0),e,t):DC(i,e,t):UC(r,e,t)}Ny.exports=GC});var It=f(function(xX,Uy){"use strict";var YC=require("@stdlib/utils/define-nonenumerable-read-only-property"),Iy=By(),WC=My();YC(Iy,"assign",WC);Uy.exports=Iy});var Gy=f(function(bX,Dy){"use strict";var ZC=Se();function XC(r){return ZC(0,r)}Dy.exports=XC});var Wy=f(function(EX,Yy){"use strict";var HC=Gy();Yy.exports=HC});var Xy=f(function(TX,Zy){"use strict";var KC=Ae();function $C(r){return KC(0,r)}Zy.exports=$C});var Ky=f(function(SX,Hy){"use strict";var JC=Xy();Hy.exports=JC});var Jy=f(function(AX,$y){"use strict";var QC=_e();function rF(r){return QC(0,r)}$y.exports=rF});var r1=f(function(_X,Qy){"use strict";var eF=Jy();Qy.exports=eF});var t1=f(function(jX,e1){"use strict";var tF=je();function iF(r){return tF(0,r)}e1.exports=iF});var a1=f(function(VX,i1){"use strict";var aF=t1();i1.exports=aF});var u1=f(function(kX,n1){"use strict";var nF=Ve();function uF(r){return nF(0,r)}n1.exports=uF});var s1=f(function(CX,o1){"use strict";var oF=u1();o1.exports=oF});var f1=f(function(FX,v1){"use strict";var w=require("@stdlib/utils/define-read-only-property"),q={};w(q,"AccessorArray",mt());w(q,"accessorGetter",er());w(q,"accessorSetter",oe());w(q,"accessors",fe());w(q,"any",eu());w(q,"anyBy",nu());w(q,"anyByRight",vu());w(q,"arraylike2object",J());w(q,"assert",ju());w(q,"at",Ou());w(q,"at2d",Nu());w(q,"at3d",Du());w(q,"at4d",Zu());w(q,"at5d",$u());w(q,"atnd",eo());w(q,"bifurcateEntries",uo());w(q,"bifurcateEntriesBy",fo());w(q,"bifurcateIndices",mo());w(q,"bifurcateIndicesBy",qo());w(q,"bifurcateValues",To());w(q,"bifurcateValuesBy",jo());w(q,"binary2d",Fo());w(q,"binary3d",Ro());w(q,"binary4d",Mo());w(q,"binary5d",Go());w(q,"binarynd",Ho());w(q,"broadcastArray",cr());w(q,"bbinary2d",ps());w(q,"bbinary3d",hs());w(q,"bbinary4d",Es());w(q,"bbinary5d",js());w(q,"bquaternary2d",Fs());w(q,"bquinary2d",Rs());w(q,"bternary2d",Ms());w(q,"bunary2d",Gs());w(q,"bunary3d",Xs());w(q,"bunary4d",Js());w(q,"bunary5d",tv());w(q,"cartesianPower",ht());w(q,"cartesianProduct",qt());w(q,"cartesianSquare",wt());w(q,"copy",xt());w(q,"copyIndexed",Ee());w(q,"dedupe",qv());w(q,"every",Tv());w(q,"everyBy",jv());w(q,"everyByRight",Fv());w(q,"filled",Sr());w(q,"filledBy",Et());w(q,"filled2d",Se());w(q,"filled2dBy",Uv());w(q,"filled3d",Ae());w(q,"filled3dBy",Hv());w(q,"filled4d",_e());w(q,"filled4dBy",tf());w(q,"filled5d",je());w(q,"filled5dBy",ff());w(q,"fillednd",Ve());w(q,"filledndBy",qf());w(q,"filter",Ef());w(q,"first",_f());w(q,"flatten",Rf());w(q,"flattenBy",Df());w(q,"flatten2d",Kf());w(q,"flatten2dBy",il());w(q,"flatten3d",fl());w(q,"flatten3dBy",dl());w(q,"flatten4d",Tl());w(q,"flatten4dBy",Cl());w(q,"flatten5d",Pl());w(q,"flatten5dBy",Yl());w(q,"fliplr2d",jt());w(q,"fliplr3d",Vt());w(q,"fliplr4d",kt());w(q,"fliplr5d",ac());w(q,"flipud2d",Ct());w(q,"flipud3d",Ft());w(q,"flipud4d",Lt());w(q,"flipud5d",dc());w(q,"strided2array",xc());w(q,"getter",ur());w(q,"groupEntries",Ac());w(q,"groupEntriesBy",kc());w(q,"groupIndices",zc());w(q,"groupIndicesBy",Pc());w(q,"groupValues",Dc());w(q,"groupValuesBy",Zc());w(q,"incrspace",zt());w(q,"indexOf",rp());w(q,"last",ap());w(q,"lastIndexOf",sp());w(q,"linspace",cp());w(q,"logspace",Rt());w(q,"map2d",bp());w(q,"map3d",Vp());w(q,"map4d",Rp());w(q,"map5d",Dp());w(q,"mskbinary2d",Zp());w(q,"mskfilter",Jp());w(q,"mskreject",im());w(q,"mskunary2d",om());w(q,"mskunary3d",lm());w(q,"nCartesianProduct",gm());w(q,"none",qm());w(q,"noneBy",Em());w(q,"noneByRight",_m());w(q,"oneTo",Pt());w(q,"ones",Pm());w(q,"ones2d",Um());w(q,"ones3d",Wm());w(q,"ones4d",Km());w(q,"ones5d",r0());w(q,"onesnd",a0());w(q,"quaternary2d",s0());w(q,"quaternary3d",c0());w(q,"quaternary4d",y0());w(q,"quaternary5d",w0());w(q,"quinary2d",T0());w(q,"quinary3d",j0());w(q,"quinary4d",F0());w(q,"quinary5d",R0());w(q,"reject",M0());w(q,"resolveGetter",Z());w(q,"resolveSetter",G0());w(q,"reverse",H0());w(q,"setter",ue());w(q,"slice",Nt());w(q,"strided2array2d",tg());w(q,"strided2array3d",ug());w(q,"strided2array4d",fg());w(q,"strided2array5d",mg());w(q,"take",hg());w(q,"takeIndexed",bg());w(q,"take2d",Mt());w(q,"take3d",Cg());w(q,"ternary2d",Og());w(q,"ternary3d",Ng());w(q,"ternary4d",Dg());w(q,"ternary5d",Zg());w(q,"toAccessorArray",$g());w(q,"toDeduped",ty());w(q,"toReversed",uy());w(q,"unary2d",fy());w(q,"unary2dBy",my());w(q,"unary3d",hy());w(q,"unary4d",by());w(q,"unary5d",Ay());w(q,"unarynd",Cy());w(q,"unitspace",Oy());w(q,"zeroTo",It());w(q,"zeros",Ur());w(q,"zeros2d",Wy());w(q,"zeros3d",Ky());w(q,"zeros4d",r1());w(q,"zeros5d",a1());w(q,"zerosnd",s1());v1.exports=q});var c1=f(function(LX,l1){"use strict";var sF=typeof ArrayBuffer=="function"?ArrayBuffer:void 0;l1.exports=sF});var m1=f(function(zX,p1){"use strict";function vF(){throw new Error("not implemented")}p1.exports=vF});var Dt=f(function(OX,g1){"use strict";var fF=require("@stdlib/assert/has-arraybuffer-support"),lF=c1(),cF=m1(),Ut;fF()?Ut=lF:Ut=cF;g1.exports=Ut});var h1=f(function(RX,d1){"use strict";var pF=require("@stdlib/assert/is-collection"),mF=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,gF=ht(),y1=require("@stdlib/string/format");function yF(r,e){if(!pF(r))throw new TypeError(y1("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(!mF(e))throw new TypeError(y1("invalid argument. Second argument must be a nonnegative integer. Value: `%s`.",e));return gF(r,e)}d1.exports=yF});var w1=f(function(BX,q1){"use strict";var dF=h1();q1.exports=dF});var T1=f(function(PX,E1){"use strict";var x1=require("@stdlib/assert/is-collection"),hF=qt(),b1=require("@stdlib/string/format");function qF(r,e){if(!x1(r))throw new TypeError(b1("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(!x1(e))throw new TypeError(b1("invalid argument. Second argument must be an array-like object. Value: `%s`.",e));return hF(r,e)}E1.exports=qF});var A1=f(function(NX,S1){"use strict";var wF=T1();S1.exports=wF});var j1=f(function(MX,_1){"use strict";var xF=require("@stdlib/assert/is-collection"),bF=wt(),EF=require("@stdlib/string/format");function TF(r){if(!xF(r))throw new TypeError(EF("invalid argument. First argument must be an array-like object. Value: `%s`.",r));return bF(r)}_1.exports=TF});var k1=f(function(IX,V1){"use strict";var SF=j1();V1.exports=SF});var F1=f(function(UX,C1){"use strict";var AF=Er(),_F=Tr(),jF=Vr(),VF=_r(),kF=Fr(),CF=jr(),FF=Ar(),LF=kr(),zF=Cr(),OF=Mr(),RF=Ir(),BF={float64:AF,float32:_F,generic:Array,int16:jF,int32:VF,int8:kF,uint16:CF,uint32:FF,uint8:LF,uint8c:zF,complex64:OF,complex128:RF};C1.exports=BF});var z1=f(function(DX,L1){"use strict";var PF=F1();function NF(r){return PF[r]||null}L1.exports=NF});var Wr=f(function(GX,O1){"use strict";var MF=z1();O1.exports=MF});var P1=f(function(YX,B1){"use strict";var IF=require("@stdlib/assert/is-collection"),UF=H(),DF=Wr(),Gt=require("@stdlib/strided/base/reinterpret-complex128"),Yt=require("@stdlib/strided/base/reinterpret-complex64"),R1=require("@stdlib/string/format"),me=require("@stdlib/blas/base/gcopy"),GF=xt();function Wt(r){return r==="complex64"}function Zt(r){return r==="complex128"}function YF(r,e){var t,i,a,n,u,o,s;if(!IF(r))throw new TypeError(R1("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(e==="generic")return GF(r);if(i=DF(e),i===null)throw new TypeError(R1("invalid argument. Second argument must be a recognized array data type. Value: `%s`.",e));return o=r.length,s=UF(r),t=Wt(s),u=new i(o),t||Zt(s)?(t?a=Yt(r,0):a=Gt(r,0),Wt(e)?(n=Yt(u,0),me(o*2,a,1,n,1),u):Zt(e)?(n=Gt(u,0),me(o*2,a,1,n,1),u):(me(o,a,2,u,1),u)):(t=Wt(e),t||Zt(e)?(t?n=Yt(u,0):n=Gt(u,0),me(o,r,1,n,2),u):(me(o,r,1,u,1),u))}B1.exports=YF});var Xt=f(function(WX,N1){"use strict";var WF=P1();N1.exports=WF});var I1=f(function(ZX,M1){"use strict";var ZF=H(),XF=Xt(),HF=require("@stdlib/string/format");function KF(r,e){var t=ZF(e);if(t===null)throw new TypeError(HF("invalid argument. Second argument must have a recognized/supported data type. Type: `%s`. Value: `%s`.",t,e));return XF(r,t)}M1.exports=KF});var D1=f(function(XX,U1){"use strict";var $F=I1();U1.exports=$F});var Y1=f(function(HX,G1){"use strict";var JF=typeof DataView=="function"?DataView:void 0;G1.exports=JF});var Z1=f(function(KX,W1){"use strict";function QF(){throw new Error("not implemented")}W1.exports=QF});var H1=f(function($X,X1){"use strict";var rL=require("@stdlib/assert/has-dataview-support"),eL=Y1(),tL=Z1(),Ht;rL()?Ht=eL:Ht=tL;X1.exports=Ht});var rd=f(function(JX,Q1){"use strict";var iL=require("@stdlib/assert/has-own-property"),aL=require("@stdlib/assert/is-integer"),nL=require("@stdlib/assert/is-string").isPrimitive,K1=require("@stdlib/assert/is-object"),Zr=require("@stdlib/string/format"),uL=require("@stdlib/math/base/special/floor"),oL=require("@stdlib/math/base/special/round"),sL=require("@stdlib/math/base/special/ceil"),vL=/^\d{10}$|^\d{13}$/,$1=["floor","ceil","round"];function J1(r,e){var t;if(t=typeof r,t==="string"){if(r=Date.parse(r),r!==r)throw new Error(Zr("invalid argument. Unable to parse %s date.",e.toLowerCase()));r=new Date(r)}if(t==="number"){if(!vL.test(r))throw new Error(Zr("invalid argument. Numeric %s date must be either a Unix or JavaScript timestamp.",e.toLowerCase()));r.toString().length===10&&(r*=1e3),r=new Date(r)}if(!(r instanceof Date))throw new TypeError(Zr("invalid argument. %s date must either be a date string, Date object, Unix timestamp, or JavaScript timestamp.",e));return r}function fL(r,e,t,i){var a,n,u,o,s,v,l,c,p;if(n=100,u=!0,a={round:"floor"},r=J1(r,"Start"),e=J1(e,"Stop"),arguments.length>2){if(arguments.length===3?K1(t)?a=t:(n=t,u=!1):(a=i,n=t),n===0)return[];if(!aL(n)||n<0)throw new TypeError(Zr("invalid argument. Length must be a positive integer. Value: `%s`.",n));if(u){if(!K1(a))throw new TypeError(Zr("invalid argument. Options argument must be an object. Value: `%s`.",a));if(iL(a,"round")){if(!nL(a.round))throw new TypeError(Zr("invalid option. `%s` option must be a string. Option: `%s`.","round",a.round));if($1.indexOf(a.round)===-1)throw new Error(Zr('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.',"round",$1.join('", "'),a.round))}}}switch(a.round){case"round":v=oL;break;case"ceil":v=sL;break;case"floor":default:v=uL;break}for(s=n-1,c=(e.getTime()-r.getTime())/s,o=new Array(n),l=r,o[0]=l,l=l.getTime(),p=1;p<s;p++)l+=c,o[p]=new Date(v(l));return o[s]=e,o}Q1.exports=fL});var td=f(function(QX,ed){"use strict";var lL=rd();ed.exports=lL});var Kt=f(function(rH,id){"use strict";function cL(){return{dtypes:{default:"float64",numeric:"float64",real:"float64",floating_point:"float64",real_floating_point:"float64",complex_floating_point:"complex128",integer:"int32",signed_integer:"int32",unsigned_integer:"uint32"}}}id.exports=cL});var nd=f(function(eH,ad){"use strict";var pL=Kt(),Dr=pL(),mL={"dtypes.default":Dr.dtypes.default,"dtypes.numeric":Dr.dtypes.numeric,"dtypes.real":Dr.dtypes.real,"dtypes.floating_point":Dr.dtypes.floating_point,"dtypes.real_floating_point":Dr.dtypes.real_floating_point,"dtypes.complex_floating_point":Dr.dtypes.complex_floating_point,"dtypes.integer":Dr.dtypes.integer,"dtypes.signed_integer":Dr.dtypes.signed_integer,"dtypes.unsigned_integer":Dr.dtypes.unsigned_integer};function gL(r){var e=mL[r];return e===void 0?null:e}ad.exports=gL});var ar=f(function(tH,od){"use strict";var yL=require("@stdlib/utils/define-nonenumerable-read-only-property"),ud=Kt(),dL=nd();yL(ud,"get",dL);od.exports=ud});var sd=f(function(iH,hL){hL.exports={all:["complex64","complex128","float32","float64","generic","int16","int32","int8","uint16","uint32","uint8","uint8c"],floating_point:["complex64","complex128","float32","float64"],real_floating_point:["float32","float64"],complex_floating_point:["complex64","complex128"],integer:["int16","int32","int8","uint16","uint32","uint8","uint8c"],signed_integer:["int16","int32","int8"],unsigned_integer:["uint16","uint32","uint8","uint8c"],real:["float32","float64","int16","int32","int8","uint16","uint32","uint8","uint8c"],numeric:["complex64","complex128","float32","float64","int16","int32","int8","uint16","uint32","uint8","uint8c"]}});var cd=f(function(aH,ld){"use strict";var qL=require("@stdlib/string/base/replace"),vd=sd(),fd=/_and_generic$/;function wL(){var r,e,t;return arguments.length===0?vd.all.slice():(t=!1,r=arguments[0],fd.test(r)&&(r=qL(r,fd,""),r!=="all"&&(t=!0)),e=vd[r],e=e?e.slice():[],t&&e.length>0&&e.push("generic"),e)}ld.exports=wL});var $t=f(function(nH,pd){"use strict";var xL=cd();pd.exports=xL});var gd=f(function(uH,md){"use strict";var bL=require("@stdlib/buffer/alloc-unsafe"),EL=require("@stdlib/assert/is-uint8array");function TL(){var r=bL(1);return EL(r)}md.exports=TL});var dd=f(function(oH,yd){"use strict";var SL=Er(),AL=Tr(),_L=Vr(),jL=_r(),VL=Fr(),kL=jr(),CL=Ar(),FL=kr(),LL=Cr(),zL=Mr(),OL=Ir(),RL={float64:SL,float32:AL,int16:_L,int32:jL,int8:VL,uint16:kL,uint32:CL,uint8:FL,uint8c:LL,complex64:zL,complex128:OL};yd.exports=RL});var qd=f(function(sH,hd){"use strict";var BL=dd();function PL(r){return BL[r]||null}hd.exports=PL});var re=f(function(vH,wd){"use strict";var NL=qd();wd.exports=NL});var Td=f(function(fH,Ed){"use strict";var xd=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,ML=require("@stdlib/buffer/alloc-unsafe"),IL=re(),UL=Ur(),DL=require("@stdlib/ndarray/base/bytes-per-element"),GL=ar(),bd=require("@stdlib/string/format"),YL=GL.get("dtypes.default");function WL(r){var e,t,i,a,n,u,o;if(!xd(r))throw new TypeError(bd("invalid argument. First argument must be a nonnegative integer. Value: `%s`.",r));if(arguments.length>1?i=arguments[1]:i=YL,i==="generic")return UL(r);if(e=DL(i),e===null)throw new TypeError(bd("invalid argument. Second argument must be a supported data type. Value: `%s`.",i));return a=IL(i),o=e*r,i==="complex128"&&(o+=8),n=ML(o),t=n.byteOffset,i==="complex128"&&(xd(t/e)||(t+=8)),u=new a(n.buffer,t,r),u}Ed.exports=WL});var _d=f(function(lH,Ad){"use strict";var ZL=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,XL=Wr(),HL=Ur(),KL=ar(),Sd=require("@stdlib/string/format"),$L=KL.get("dtypes.default");function JL(r){var e,t;if(!ZL(r))throw new TypeError(Sd("invalid argument. First argument must be a nonnegative integer. Value: `%s`.",r));if(arguments.length>1?e=arguments[1]:e=$L,e==="generic")return HL(r);if(t=XL(e),t===null)throw new TypeError(Sd("invalid argument. Second argument must be a recognized data type. Value: `%s`.",e));return new t(r)}Ad.exports=JL});var ee=f(function(cH,jd){"use strict";var QL=_d();jd.exports=QL});var Cd=f(function(pH,kd){"use strict";var Vd=ee();function rz(r){return arguments.length>1?Vd(r,arguments[1]):Vd(r)}kd.exports=rz});var Qt=f(function(mH,Fd){"use strict";var ez=gd(),tz=Td(),iz=Cd(),Jt;ez()?Jt=tz:Jt=iz;Fd.exports=Jt});var zd=f(function(gH,Ld){"use strict";var az=H(),nz=Qt(),uz=require("@stdlib/string/format");function oz(r){var e=az(r);if(e===null)throw new TypeError(uz("invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.",r));return arguments.length>1&&(e=arguments[1]),nz(r.length,e)}Ld.exports=oz});var Rd=f(function(yH,Od){"use strict";var sz=zd();Od.exports=sz});var Ud=f(function(dH,Id){"use strict";var vz=require("@stdlib/assert/is-string").isPrimitive,Bd=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,Pd=require("@stdlib/assert/is-collection"),ri=require("@stdlib/assert/is-arraybuffer"),Nd=require("@stdlib/assert/is-object"),Fe=require("@stdlib/assert/is-function"),fz=Wr(),lz=require("@stdlib/blas/ext/base/gfill"),cz=Sr(),pz=require("@stdlib/assert/has-iterator-symbol-support"),Le=require("@stdlib/symbol/iterator"),mz=require("@stdlib/iter/length"),gz=ar(),Nr=require("@stdlib/string/format"),Md=pz(),yz=gz.get("dtypes.default");function dz(r,e){var t,i;for(t=[];i=r.next(),!i.done;)t.push(e);return t}function hz(r,e){var t;for(t=0;t<r.length;t++)r.set(e,t);return r}function qz(){var r,e,t,i,a,n,u;if(e=arguments.length,e-=1,e>=0&&vz(arguments[e])?(t=arguments[e],e-=1):t=yz,i=fz(t),i===null)throw new TypeError(Nr("invalid argument. Must provide a recognized data type. Value: `%s`.",t));if(t==="generic"){if(e<=0)return[];if(r=arguments[0],u=arguments[1],e===1){if(Bd(u)?n=u:Pd(u)&&(n=u.length),n!==void 0)return cz(r,n);if(ri(u))throw new Error("invalid arguments. Creating a generic array from an ArrayBuffer is not supported.");if(Nd(u)){if(Md===!1)throw new TypeError(Nr("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, typed array, or array-like object. Value: `%s`.",u));if(!Fe(u[Le]))throw new TypeError(Nr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",u));if(u=u[Le](),!Fe(u.next))throw new TypeError(Nr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",u));return dz(u,r)}throw new TypeError(Nr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",u))}else if(ri(u))throw new Error("invalid arguments. Creating a generic array from an ArrayBuffer is not supported.");throw new TypeError(Nr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",u))}if(e<=0)return new i(0);if(e===1)if(u=arguments[1],Pd(u))a=new i(u.length);else if(ri(u))a=new i(u);else if(Bd(u))a=new i(u);else if(Nd(u)){if(Md===!1)throw new TypeError(Nr("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, typed array, or array-like object. Value: `%s`.",u));if(!Fe(u[Le]))throw new TypeError(Nr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",u));if(u=u[Le](),!Fe(u.next))throw new TypeError(Nr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",u));a=new i(mz(u))}else throw new TypeError(Nr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",u));else e===2?a=new i(arguments[1],arguments[2]):a=new i(arguments[1],arguments[2],arguments[3]);return a.length>0&&(/^complex/.test(t)?hz(a,arguments[0]):lz(a.length,arguments[0],a,1)),a}Id.exports=qz});var Gd=f(function(hH,Dd){"use strict";var wz=Ud();Dd.exports=wz});var Jd=f(function(qH,$d){"use strict";var Yd=require("@stdlib/assert/is-string").isPrimitive,Wd=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,Zd=require("@stdlib/assert/is-collection"),ei=require("@stdlib/assert/is-arraybuffer"),Xd=require("@stdlib/assert/is-object"),Xr=require("@stdlib/assert/is-function"),ti=Wr(),xz=require("@stdlib/blas/ext/base/gfill-by"),bz=Et(),Ez=require("@stdlib/assert/has-iterator-symbol-support"),ze=require("@stdlib/symbol/iterator"),Tz=require("@stdlib/iter/length"),Sz=ar(),qr=require("@stdlib/string/format"),Hd=Ez(),Kd=Sz.get("dtypes.default");function Az(r,e,t){var i,a,n;for(i=[],a=-1;n=r.next(),!n.done;)a+=1,i.push(e.call(t,a));return i}function _z(r,e,t){var i;for(i=0;i<r.length;i++)r.set(e.call(t,i),i);return r}function jz(){var r,e,t,i,a,n,u,o;if(e=arguments.length,e===0)return a=ti(Kd),new a(0);if(t=arguments[0],Yd(t)){if(e>1)throw new TypeError("invalid arguments. Must provide a length, typed array, array-like object, or an iterable.");if(a=ti(t),a===null)throw new TypeError(qr("invalid argument. Must provide a recognized data type. Value: `%s`.",t));return new a(0)}if(e<2)throw new TypeError("invalid arguments. Must provide a length, typed array, array-like object, or an iterable.");if(e-=1,Xr(arguments[e]))if(Xr(arguments[e-1])){if(r=arguments[e],e-=1,i=arguments[e],e===0)throw new TypeError("invalid arguments. Must provide a length, typed array, array-like object, or an iterable.")}else i=arguments[e];else if(e>=2){if(r=arguments[e],e-=1,i=arguments[e],!Xr(i))throw new TypeError(qr("invalid argument. Callback argument must be a function. Value: `%s`.",i))}else throw new TypeError("invalid arguments. Must provide a length, typed array, array-like object, or an iterable.");if(e-=1,e>=0&&Yd(arguments[e])?(t=arguments[e],e-=1):t=Kd,a=ti(t),a===null)throw new TypeError(qr("invalid argument. Must provide a recognized data type. Value: `%s`.",t));if(t==="generic"){if(o=arguments[0],e===0){if(Wd(o)?u=o:Zd(o)&&(u=o.length),u!==void 0)return bz(u,i,r);if(ei(o))throw new Error("invalid arguments. Creating a generic array from an ArrayBuffer is not supported.");if(Xd(o)){if(Hd===!1)throw new TypeError(qr("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, typed array, or array-like object. Value: `%s`.",o));if(!Xr(o[ze]))throw new TypeError(qr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",o));if(o=o[ze](),!Xr(o.next))throw new TypeError(qr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",o));return Az(o,i,r)}throw new TypeError(qr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",o))}else if(ei(o))throw new Error("invalid arguments. Creating a generic array from an ArrayBuffer is not supported.");throw new TypeError(qr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",o))}if(e===0)if(o=arguments[0],Zd(o))n=new a(o.length);else if(ei(o))n=new a(o);else if(Wd(o))n=new a(o);else if(Xd(o)){if(Hd===!1)throw new TypeError(qr("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, typed array, or array-like object. Value: `%s`.",o));if(!Xr(o[ze]))throw new TypeError(qr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",o));if(o=o[ze](),!Xr(o.next))throw new TypeError(qr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",o));n=new a(Tz(o))}else throw new TypeError(qr("invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.",o));else e===1?n=new a(arguments[0],arguments[1]):n=new a(arguments[0],arguments[1],arguments[2]);return n.length>0&&(/^complex/.test(t)?_z(n,i,r):xz(n.length,n,1,s)),n;function s(v,l){return i.call(r,l)}}$d.exports=jz});var rh=f(function(wH,Qd){"use strict";var Vz=Jd();Qd.exports=Vz});var ih=f(function(xH,th){"use strict";var eh=require("@stdlib/assert/is-function"),kz=require("@stdlib/assert/is-collection"),Cz=require("@stdlib/assert/is-iterator-like"),Fz=rr(),Lz=oe(),zz=ue(),Oz=H(),ii=require("@stdlib/string/format");function Rz(){var r,e,t,i,a,n,u,o,s;if(r=arguments[0],arguments.length>1)if(kz(arguments[1])){if(i=arguments[1],arguments.length>2){if(t=arguments[2],!eh(t))throw new TypeError(ii("invalid argument. Callback argument must be a function. Value: `%s`.",t));e=arguments[3]}}else{if(t=arguments[1],!eh(t))throw new TypeError(ii("invalid argument. Callback argument must be a function. Value: `%s`.",t));e=arguments[2]}if(!Cz(r))throw new TypeError(ii("invalid argument. Iterator argument must be an iterator protocol-compliant object. Value: `%s`.",r));if(o=-1,i===void 0){if(i=[],t){for(;o+=1,s=r.next(),!s.done;)i.push(t.call(e,s.value,o));return i}for(;s=r.next(),!s.done;)i.push(s.value);return i}if(a=i.length,u=Oz(i),Fz(i)?n=Lz(u):n=zz(u),t){for(;o<a-1&&(o+=1,s=r.next(),!s.done);)n(i,o,t.call(e,s.value,o));return i}for(;o<a-1&&(o+=1,s=r.next(),!s.done);)n(i,o,s.value);return i}th.exports=Rz});var nh=f(function(bH,ah){"use strict";var Bz=ih();ah.exports=Bz});var sh=f(function(EH,oh){"use strict";var Pz=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,Nz=Wr(),Mz=Sr(),Iz=require("@stdlib/blas/ext/base/gfill"),Uz=ar(),uh=require("@stdlib/string/format"),Dz=Uz.get("dtypes.default");function Gz(r,e){var t,i,a;if(!Pz(r))throw new TypeError(uh("invalid argument. First argument must be a nonnegative integer. Value: `%s`.",r));if(arguments.length>2?t=arguments[2]:t=Dz,t==="generic")return Mz(e,r);if(i=Nz(t),i===null)throw new TypeError(uh("invalid argument. Third argument must be a recognized data type. Value: `%s`.",t));return a=new i(r),Iz(r,e,a,1),a}oh.exports=Gz});var Hr=f(function(TH,vh){"use strict";var Yz=sh();vh.exports=Yz});var lh=f(function(SH,fh){"use strict";var Wz=require("@stdlib/string/format"),Zz=H(),Xz=Hr(),Hz=require("@stdlib/complex/float64"),Kz=require("@stdlib/complex/float32");function $z(r,e){var t,i;if(t=Zz(r),t===null)throw new TypeError(Wz("invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.",r));return arguments.length>2&&(t=arguments[2]),typeof e=="number"?t==="complex128"?i=new Hz(e,0):t==="complex64"?i=new Kz(e,0):i=e:i=e,Xz(r.length,i,t)}fh.exports=$z});var ph=f(function(AH,ch){"use strict";var Jz=lh();ch.exports=Jz});var gh=f(function(_H,mh){"use strict";var Qz=require("@stdlib/math/base/special/ceil"),ai=require("@stdlib/assert/is-number").isPrimitive,ni=require("@stdlib/math/base/assert/is-nan"),ui=require("@stdlib/string/format"),rO=require("@stdlib/constants/uint32/max"),eO=zt();function tO(r,e,t){var i,a;if(!ai(r)||ni(r))throw new TypeError(ui("invalid argument. Start must be numeric. Value: `%s`.",r));if(!ai(e)||ni(e))throw new TypeError(ui("invalid argument. Stop must be numeric. Value: `%s`.",e));if(arguments.length<3)a=1;else if(a=t,!ai(a)||ni(a))throw new TypeError(ui("invalid argument. Increment must be numeric. Value: `%s`.",a));if(i=Qz((e-r)/a),i>rO)throw new RangeError("invalid arguments. Generated array exceeds maximum array length.");return eO(r,e,a)}mh.exports=tO});var dh=f(function(jH,yh){"use strict";var iO=gh();yh.exports=iO});var qh=f(function(VH,hh){"use strict";var aO=Er(),nO=Tr(),uO=Ir(),oO=Mr(),sO={float64:aO,float32:nO,complex128:uO,complex64:oO};hh.exports=sO});var xh=f(function(kH,wh){"use strict";var vO=qh();function fO(r){return vO[r]||null}wh.exports=fO});var oi=f(function(CH,bh){"use strict";var lO=xh();bh.exports=lO});var Th=f(function(FH,Eh){"use strict";function cO(r,e,t,i){var a,n,u,o;if(t===0)return[];if(t===1)return i?[e]:[r];for(a=[r],i?n=t-1:n=t,u=(e-r)/n,o=1;o<n;o++)a.push(r+u*o);return i&&a.push(e),a}Eh.exports=cO});var kh=f(function(LH,Vh){"use strict";var pO=require("@stdlib/complex/float32"),mO=require("@stdlib/complex/float64"),Sh=require("@stdlib/complex/real"),Ah=require("@stdlib/complex/imag"),_h=require("@stdlib/complex/realf"),jh=require("@stdlib/complex/imagf");function gO(r,e,t,i,a,n){var u,o,s,v,l,c,p,m,g,y,d,h,x;if(a===0)return[];if(o=0,r==="float64"?(v=e,c=0):r==="complex64"?(o+=1,v=_h(e),c=jh(e)):(v=Sh(e),c=Ah(e)),t==="float64"?(l=i,p=0):t==="complex64"?(o+=1,l=_h(i),p=jh(i)):(l=Sh(i),p=Ah(i)),o===2?u=pO:u=mO,a===1)return n?[new u(l,p)]:[new u(v,c)];for(s=[new u(v,c)],n?h=a-1:h=a,y=(l-v)/h,d=(p-c)/h,x=1;x<h;x++)m=v+y*x,g=c+d*x,s.push(new u(m,g));return n&&s.push(new u(l,p)),s}Vh.exports=gO});var si=f(function(zH,Ch){"use strict";function yO(r,e,t,i,a){var n,u,o;if(i===0)return r;if(i===1)return a?r[0]=t:r[0]=e,r;for(r[0]=e,a?n=i-1:n=i,u=(t-e)/n,o=1;o<n;o++)r[o]=e+u*o;return a&&(r[n]=t),r}Ch.exports=yO});var vi=f(function(OH,Rh){"use strict";var Fh=require("@stdlib/complex/real"),Lh=require("@stdlib/complex/imag"),zh=require("@stdlib/complex/realf"),Oh=require("@stdlib/complex/imagf");function dO(r,e,t,i,a,n,u){var o,s,v,l,c,p,m,g,y;if(n===0)return r;if(e==="float64"?(o=t,v=0):e==="complex64"?(o=zh(t),v=Oh(t)):(o=Fh(t),v=Lh(t)),i==="float64"?(s=a,l=0):i==="complex64"?(s=zh(a),l=Oh(a)):(s=Fh(a),l=Lh(a)),n===1)return u?(r[0]=s,r[1]=l):(r[0]=o,r[1]=v),r;for(r[0]=o,r[1]=v,u?m=n-1:m=n,c=(s-o)/m,p=(l-v)/m,y=2,g=1;g<m;g++)r[y]=o+c*g,r[y+1]=v+p*g,y+=2;return u&&(r[y]=s,r[y+1]=l),r}Rh.exports=dO});var li=f(function(RH,Ph){"use strict";var hO=require("@stdlib/assert/is-plain-object"),Bh=require("@stdlib/assert/has-own-property"),qO=require("@stdlib/assert/is-string").isPrimitive,wO=require("@stdlib/assert/is-boolean").isPrimitive,fi=require("@stdlib/string/format");function xO(r,e){return hO(e)?Bh(e,"dtype")&&(r.dtype=e.dtype,!qO(r.dtype))?new TypeError(fi("invalid option. `%s` option must be a string. Option: `%s`.","dtype",r.dtype)):Bh(e,"endpoint")&&(r.endpoint=e.endpoint,!wO(r.endpoint))?new TypeError(fi("invalid option. `%s` option must be a boolean. Option: `%s`.","endpoint",r.endpoint)):null:new TypeError(fi("invalid argument. Options argument must be an object. Value: `%s`.",e))}Ph.exports=xO});var ci=f(function(BH,bO){bO.exports={endpoint:!0}});var Yh=f(function(PH,Gh){"use strict";var Nh=require("@stdlib/assert/is-complex-like"),Mh=require("@stdlib/assert/is-number").isPrimitive,EO=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,Ih=require("@stdlib/math/base/assert/is-nan"),Uh=require("@stdlib/complex/dtype"),TO=oi(),SO=require("@stdlib/strided/base/reinterpret-complex64"),AO=require("@stdlib/strided/base/reinterpret-complex128"),_O=ar(),te=require("@stdlib/string/format"),jO=Th(),VO=kh(),kO=si(),Dh=vi(),CO=li(),FO=ci(),LO=_O.get("dtypes.complex_floating_point");function zO(r,e,t){var i,a,n,u,o,s,v;if(typeof r=="object"){if(o=Uh(r),o===null){if(!Nh(r))throw new TypeError(te("invalid argument. First argument must be either a real or complex number. Value: `%s`.",r));o="complex128"}v=!0}else{if(!Mh(r)||Ih(r))throw new TypeError(te("invalid argument. First argument must be either a real or complex number. Value: `%s`.",r));o="float64"}if(typeof e=="object"){if(s=Uh(e),s===null){if(!Nh(e))throw new TypeError(te("invalid argument. Second argument must be either a real or complex number. Value: `%s`.",e));s="complex128"}v=!0}else{if(!Mh(e)||Ih(e))throw new TypeError(te("invalid argument. Second argument must be either a real or complex number. Value: `%s`.",e));s="float64"}if(!EO(t))throw new TypeError(te("invalid argument. Third argument must be a nonnegative integer. Value: `%s`.",t));if(i={endpoint:FO.endpoint},o===s?i.dtype=o:i.dtype=LO,arguments.length>3&&(n=CO(i,arguments[3]),n))throw n;if(i.dtype==="generic")return v?VO(o,r,s,e,t,i.endpoint):jO(r,e,t,i.endpoint);if(a=TO(i.dtype),a===null)throw new TypeError(te('invalid option. `%s` option must be a real or complex floating-point data type or "generic". Option: `%s`.',"dtype",i.dtype));if(u=new a(t),i.dtype==="complex64")return Dh(SO(u,0),o,r,s,e,t,i.endpoint),u;if(i.dtype==="complex128")return Dh(AO(u,0),o,r,s,e,t,i.endpoint),u;if(v)throw new TypeError('invalid arguments. If either of the first two arguments are complex numbers, the output array data type must be a complex number data type or "generic".');return kO(u,r,e,t,i.endpoint)}Gh.exports=zO});var $h=f(function(NH,Kh){"use strict";var OO=require("@stdlib/complex/float32"),RO=require("@stdlib/complex/float64"),Wh=require("@stdlib/complex/real"),Zh=require("@stdlib/complex/imag"),Xh=require("@stdlib/complex/realf"),Hh=require("@stdlib/complex/imagf");function BO(r,e,t,i,a,n,u){var o,s,v,l,c,p,m,g,y,d,h,x,b,E;if(n===0)return r;if(s=0,e==="float64"?(v=t,c=0):e==="complex64"?(s+=1,v=Xh(t),c=Hh(t)):(v=Wh(t),c=Zh(t)),i==="float64"?(l=a,p=0):i==="complex64"?(s+=1,l=Xh(a),p=Hh(a)):(l=Wh(a),p=Zh(a)),s===2?o=OO:o=RO,g=r.data,m=r.accessors[1],n===1)return u?m(g,0,new o(l,p)):m(g,0,new o(v,c)),r;for(m(g,0,new o(v,c)),u?b=n-1:b=n,h=(l-v)/b,x=(p-c)/b,E=1;E<b;E++)y=v+h*E,d=c+x*E,m(g,E,new o(y,d));return u&&m(g,b,new o(l,p)),r}Kh.exports=BO});var Qh=f(function(MH,Jh){"use strict";function PO(r,e,t,i,a){var n,u,o,s,v;if(i===0)return r;if(n=r.data,u=r.accessors[1],i===1)return a?u(n,0,t):u(n,0,e),r;for(u(n,0,e),a?o=i-1:o=i,s=(t-e)/o,v=1;v<o;v++)u(n,v,e+s*v);return a&&u(n,o,t),r}Jh.exports=PO});var oq=f(function(IH,uq){"use strict";var rq=require("@stdlib/assert/is-complex-like"),eq=require("@stdlib/assert/is-number").isPrimitive,NO=require("@stdlib/assert/is-collection"),ge=require("@stdlib/string/format"),tq=require("@stdlib/math/base/assert/is-nan"),iq=require("@stdlib/complex/dtype"),MO=H(),IO=require("@stdlib/strided/base/reinterpret-complex64"),UO=require("@stdlib/strided/base/reinterpret-complex128"),aq=J(),DO=$h(),GO=Qh(),nq=vi(),YO=si(),WO=li(),ZO=ci();function XO(r,e,t){var i,a,n,u,o,s,v;if(typeof r=="object"){if(n=iq(r),n===null){if(!rq(r))throw new TypeError(ge("invalid argument. First argument must be either a real or complex number. Value: `%s`.",r));n="complex128"}o=!0}else{if(!eq(r)||tq(r))throw new TypeError(ge("invalid argument. First argument must be either a real or complex number. Value: `%s`.",r));n="float64"}if(typeof e=="object"){if(u=iq(e),u===null){if(!rq(e))throw new TypeError(ge("invalid argument. Second argument must be either a real or complex number. Value: `%s`.",e));u="complex128"}o=!0}else{if(!eq(e)||tq(e))throw new TypeError(ge("invalid argument. Second argument must be either a real or complex number. Value: `%s`.",e));u="float64"}if(!NO(t))throw new TypeError(ge("invalid argument. Third argument must be an array-like object. Value: `%s`.",t));if(i={endpoint:ZO.endpoint},arguments.length>3&&(a=WO(i,arguments[3]),a))throw a;if(s=MO(t),s===null&&(s="generic"),s==="complex64")return nq(IO(t,0),n,r,u,e,t.length,i.endpoint),t;if(s==="complex128")return nq(UO(t,0),n,r,u,e,t.length,i.endpoint),t;if(o){if(s==="generic")return v=aq(t),DO(v,n,r,u,e,t.length,i.endpoint),t;throw new TypeError('invalid arguments. If either of the first two arguments are complex numbers, the output array must be a complex number array or a "generic" array-like object.')}return v=aq(t),v.accessorProtocol?(GO(v,r,e,t.length,i.endpoint),t):(YO(t,r,e,t.length,i.endpoint),t)}uq.exports=XO});var fq=f(function(UH,vq){"use strict";var HO=require("@stdlib/utils/define-nonenumerable-read-only-property"),sq=Yh(),KO=oq();HO(sq,"assign",KO);vq.exports=sq});var mq=f(function(DH,pq){"use strict";var lq=require("@stdlib/assert/is-number").isPrimitive,$O=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,pi=require("@stdlib/string/format"),cq=require("@stdlib/math/base/assert/is-nan"),JO=Rt();function QO(r,e,t){if(!lq(r)||cq(r))throw new TypeError(pi("invalid argument. Exponent of start value must be numeric. Value: `%s`.",r));if(!lq(e)||cq(e))throw new TypeError(pi("invalid argument. Exponent of stop value must be numeric. Value: `%s`.",e));if(arguments.length<3)t=10;else if(!$O(t))throw new TypeError(pi("invalid argument. Length must be a nonnegative integer. Value: `%s`.",t));return JO(r,e,t)}pq.exports=QO});var yq=f(function(GH,gq){"use strict";var rR=mq();gq.exports=rR});var bq=f(function(YH,xq){"use strict";var hq=require("@stdlib/math/base/assert/is-integer"),eR=require("@stdlib/math/base/assert/is-negative-zero"),tR=require("@stdlib/assert/is-complex-like"),qq=require("@stdlib/constants/float64/pinf"),wq=require("@stdlib/constants/float64/ninf"),Oe=require("@stdlib/constants/float32/smallest-subnormal"),iR=require("@stdlib/constants/float32/max-safe-integer"),aR=require("@stdlib/constants/float32/min-safe-integer"),nR=require("@stdlib/constants/int8/min"),uR=require("@stdlib/constants/int16/min"),oR=require("@stdlib/constants/int32/min"),sR=require("@stdlib/constants/uint8/max"),vR=require("@stdlib/constants/uint16/max"),fR=require("@stdlib/constants/uint32/max");function dq(r){return r!==r||r===qq||r===wq?"float32":hq(r)?r>=aR&&r<=iR?"float32":"float64":r>-Oe&&r<Oe?"float64":"float32"}function lR(r){return typeof r!="number"?tR(r)?dq(r.re)==="float64"||dq(r.im)==="float64"?"complex128":"complex64":"generic":r!==r||r===qq||r===wq?"float32":hq(r)?r===0&&eR(r)?"float32":r<0?r>=nR?"int8":r>=uR?"int16":r>=oR?"int32":"float64":r<=sR?"uint8":r<=vR?"uint16":r<=fR?"uint32":"float64":r>-Oe&&r<Oe?"float64":"float32"}xq.exports=lR});var Tq=f(function(WH,Eq){"use strict";var cR=bq();Eq.exports=cR});var _q=f(function(ZH,Aq){"use strict";var pR=yt().factory,mR=require("@stdlib/complex/float64"),gR=require("@stdlib/complex/float32"),yR=Hr(),dR=ar(),hR=$t(),qR=require("@stdlib/string/format"),wR=new mR(NaN,NaN),xR=new gR(NaN,NaN),Sq=hR("floating_point_and_generic"),bR=pR(Sq),ER=dR.get("dtypes.real_floating_point");function TR(r){var e,t;if(arguments.length>1){if(e=arguments[1],!bR(e))throw new TypeError(qR('invalid argument. Second argument must be one of the following: "%s". Value: `%s`.',Sq.join('", "'),e))}else e=ER;return e==="complex128"?t=wR:e==="complex64"?t=xR:t=NaN,yR(r,t,e)}Aq.exports=TR});var Vq=f(function(XH,jq){"use strict";var SR=_q();jq.exports=SR});var Cq=f(function(HH,kq){"use strict";var AR=H(),_R=Hr(),jR=require("@stdlib/complex/float64"),VR=require("@stdlib/complex/float32"),mi=require("@stdlib/string/format"),kR=new jR(NaN,NaN),CR=new VR(NaN,NaN),Re=["float64","float32","complex128","complex64","generic"];function FR(r){var e,t;if(e=AR(r),e===null)throw new TypeError(mi("invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.",r));if(arguments.length>1){if(e=arguments[1],Re.indexOf(e)===-1)throw new TypeError(mi('invalid argument. Second argument must be one of the following: "%s". Value: `%s`.',Re.join('", "'),e))}else if(Re.indexOf(e)===-1)throw new TypeError(mi('invalid argument. First argument must be one of the following data types: "%s". Value: `%s`.',Re.join('", "'),e));return e==="complex128"?t=kR:e==="complex64"?t=CR:t=NaN,_R(r.length,t,e)}kq.exports=FR});var Lq=f(function(KH,Fq){"use strict";var LR=Cq();Fq.exports=LR});var zq=f(function($H,zR){zR.exports={float64:-1,float32:"float64",int32:-1,int16:"int32",int8:"int16",uint32:-1,uint16:"uint32",uint8:"uint16",uint8c:"uint16",generic:-1,complex64:"complex128",complex128:-1}});var Rq=f(function(JH,Oq){"use strict";var OR=require("@stdlib/utils/keys"),RR=require("@stdlib/assert/has-own-property"),Be=zq();function BR(){var r,e,t,i;for(t={},r=OR(Be),e=r.length,i=0;i<e;i++)t[r[i]]=Be[r[i]];return t}function PR(r){return arguments.length===0?BR():RR(Be,r)?Be[r]:null}Oq.exports=PR});var Pq=f(function(QH,Bq){"use strict";var NR=Rq();Bq.exports=NR});var Iq=f(function(rK,Mq){"use strict";var MR=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,Nq=Pt(),IR=ee(),UR=ar(),DR=require("@stdlib/string/format"),GR=UR.get("dtypes.default");function YR(r){var e;if(!MR(r))throw new TypeError(DR("invalid argument. First argument must be a nonnegative integer. Value: `%s`.",r));if(arguments.length>1){if(e=arguments[1],e==="generic")return Nq(r)}else e=GR;return Nq.assign(IR(r,e),1,0)}Mq.exports=YR});var gi=f(function(eK,Uq){"use strict";var WR=Iq();Uq.exports=WR});var Gq=f(function(tK,Dq){"use strict";var ZR=gi(),XR=H(),HR=require("@stdlib/string/format");function KR(r){var e=XR(r);if(e===null)throw new TypeError(HR("invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.",r));return arguments.length>1&&(e=arguments[1]),ZR(r.length,e)}Dq.exports=KR});var Wq=f(function(iK,Yq){"use strict";var $R=Gq();Yq.exports=$R});var Xq=f(function(aK,Zq){"use strict";var JR=require("@stdlib/complex/float64"),QR=require("@stdlib/complex/float32"),rB=Hr(),eB=ar(),tB=new JR(1,0),iB=new QR(1,0),aB=eB.get("dtypes.default");function nB(r){var e,t;return arguments.length>1?e=arguments[1]:e=aB,e==="complex128"?t=tB:e==="complex64"?t=iB:t=1,rB(r,t,e)}Zq.exports=nB});var Kq=f(function(nK,Hq){"use strict";var uB=Xq();Hq.exports=uB});var Jq=f(function(uK,$q){"use strict";var oB=H(),sB=Hr(),vB=require("@stdlib/complex/float64"),fB=require("@stdlib/complex/float32"),lB=require("@stdlib/string/format"),cB=new vB(1,0),pB=new fB(1,0);function mB(r){var e,t;if(e=oB(r),e===null)throw new TypeError(lB("invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.",r));return arguments.length>1&&(e=arguments[1]),e==="complex128"?t=cB:e==="complex64"?t=pB:t=1,sB(r.length,t,e)}$q.exports=mB});var r2=f(function(oK,Qq){"use strict";var gB=Jq();Qq.exports=gB});var t2=f(function(sK,e2){"use strict";function yB(){return{highWaterMark:9007199254740992}}e2.exports=yB});var n2=f(function(vK,a2){"use strict";var dB=require("@stdlib/assert/is-plain-object"),hB=require("@stdlib/assert/has-own-property"),qB=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,i2=require("@stdlib/string/format");function wB(r,e){return dB(e)?hB(e,"highWaterMark")&&(r.highWaterMark=e.highWaterMark,!qB(r.highWaterMark))?new TypeError(i2("invalid option. `%s` option must be a nonnegative integer. Option: `%s`.","highWaterMark",r.highWaterMark)):null:new TypeError(i2("invalid argument. Options argument must be an object. Value: `%s`.",e))}a2.exports=wB});var o2=f(function(fK,u2){"use strict";function xB(r){var e,t;for(e=[],t=0;t<r+1;t++)e.push([]);return e}u2.exports=xB});var s2=f(function(lK,bB){bB.exports={float64:8,float32:4,int16:2,int32:4,int8:1,uint16:2,uint32:4,uint8:1,uint8c:1,complex64:8,complex128:16}});var qi=f(function(cK,m2){"use strict";var EB=require("@stdlib/assert/is-string").isPrimitive,TB=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,SB=require("@stdlib/assert/is-collection"),AB=require("@stdlib/assert/is-typed-array-like"),_B=require("@stdlib/assert/is-arraybuffer"),jB=require("@stdlib/assert/is-complex64array"),VB=require("@stdlib/assert/is-complex128array"),ye=require("@stdlib/utils/define-nonenumerable-read-only-property"),kB=require("@stdlib/utils/define-nonenumerable-read-only-accessor"),hi=re(),v2=require("@stdlib/strided/base/reinterpret-complex64"),f2=require("@stdlib/strided/base/reinterpret-complex128"),l2=fe(),CB=H(),FB=ar(),yi=require("@stdlib/string/format"),LB=Dt(),zB=require("@stdlib/math/base/special/ceil"),OB=require("@stdlib/math/base/special/floor"),RB=require("@stdlib/math/base/special/ceil2"),di=require("@stdlib/math/base/special/log2"),BB=require("@stdlib/math/base/special/min"),PB=t2(),NB=n2(),MB=o2(),IB=s2(),UB=FB.get("dtypes.default"),DB=hi("complex64"),GB=hi("complex128");function c2(r){return r instanceof DB}function p2(r){return r instanceof GB}function YB(r){var e,t,i,a;if(i=PB(),arguments.length&&(a=NB(i,r),a))throw a;return t=MB(zB(di(i.highWaterMark))),e=0,ye(s,"malloc",s),ye(s,"calloc",v),ye(s,"free",l),ye(s,"clear",c),ye(s,"highWaterMark",i.highWaterMark),kB(s,"nbytes",n),s;function n(){return e}function u(p){var m,g;return g=di(p),g<t.length&&t[g].length?t[g].pop():e+p>i.highWaterMark?null:(m=new LB(p),e+=p,m)}function o(p,m,g){var y;return m===0?new p(0):(y=u(RB(m)*IB[g]),y===null?y:new p(y,0,m))}function s(){var p,m,g,y,d,h,x,b,E;if(p=arguments.length,p&&EB(arguments[p-1])?(p-=1,m=arguments[p]):m=UB,g=hi(m),g===null)throw new TypeError(yi("invalid argument. Must provide a recognized data type. Value: `%s`.",m));if(p<=0)return new g(0);if(TB(arguments[0]))return o(g,arguments[0],m);if(SB(arguments[0])){if(y=arguments[0],b=y.length,VB(y)?y=f2(y,0):jB(y)?y=v2(y,0):/^complex/.test(m)&&(b/=2),d=o(g,b,m),d===null)return d;if(p2(d)||c2(d))return d.set(y),d;for(x=l2(CB(y)).accessors[0],h=l2(m).accessors[1],E=0;E<b;E++)h(d,E,x(y,E));return d}throw new TypeError(yi("invalid argument. First argument must be either an array length or an array-like object. Value: `%s`.",arguments[0]))}function v(){var p,m,g,y;if(p=arguments.length,p===0?m=s():p===1?m=s(arguments[0]):m=s(arguments[0],arguments[1]),m!==null)for(p2(m)?g=f2(m,0):c2(m)?g=v2(m,0):g=m,y=0;y<g.length;y++)g[y]=0;return m}function l(p){var m,g,y;if(AB(p)&&p.buffer)p=p.buffer;else if(!_B(p))throw new TypeError(yi("invalid argument. Must provide a typed array or ArrayBuffer. Value: `%s`.",p));if(p.byteLength>0){for(m=OB(di(p.byteLength)),m=BB(t.length-1,m),g=t[m],y=0;y<g.length;y++)if(g[y]===p)return!1;g.push(p)}return!0}function c(){var p;for(p=0;p<t.length;p++)t[p].length=0;e=0}}m2.exports=YB});var y2=f(function(pK,g2){"use strict";var WB=qi(),ZB=WB();g2.exports=ZB});var q2=f(function(mK,h2){"use strict";var XB=require("@stdlib/utils/define-nonenumerable-read-only-property"),d2=y2(),HB=qi();XB(d2,"factory",HB);h2.exports=d2});var w2=f(function(gK,KB){KB.exports={float64:{float64:"float64",float32:"float64",int32:"float64",int16:"float64",int8:"float64",uint32:"float64",uint16:"float64",uint8:"float64",uint8c:"float64",complex64:"complex128",complex128:"complex128",generic:"generic"},float32:{float64:"float64",float32:"float32",int32:"float64",int16:"float32",int8:"float32",uint32:"float64",uint16:"float32",uint8:"float32",uint8c:"float32",complex64:"complex64",complex128:"complex128",generic:"generic"},int32:{float64:"float64",float32:"float64",int32:"int32",int16:"int32",int8:"int32",uint32:"float64",uint16:"int32",uint8:"int32",uint8c:"int32",complex64:"complex128",complex128:"complex128",generic:"generic"},int16:{float64:"float64",float32:"float32",int32:"int32",int16:"int16",int8:"int16",uint32:"float64",uint16:"int32",uint8:"int16",uint8c:"int16",complex64:"complex64",complex128:"complex128",generic:"generic"},int8:{float64:"float64",float32:"float32",int32:"int32",int16:"int16",int8:"int8",uint32:"float64",uint16:"int32",uint8:"int16",uint8c:"int16",complex64:"complex64",complex128:"complex128",generic:"generic"},uint32:{float64:"float64",float32:"float64",int32:"float64",int16:"float64",int8:"float64",uint32:"uint32",uint16:"uint32",uint8:"uint32",uint8c:"uint32",complex64:"complex128",complex128:"complex128",generic:"generic"},uint16:{float64:"float64",float32:"float32",int32:"int32",int16:"int32",int8:"int32",uint32:"uint32",uint16:"uint16",uint8:"uint16",uint8c:"uint16",complex64:"complex64",complex128:"complex128",generic:"generic"},uint8:{float64:"float64",float32:"float32",int32:"int32",int16:"int16",int8:"int16",uint32:"uint32",uint16:"uint16",uint8:"uint8",uint8c:"uint8",complex64:"complex64",complex128:"complex128",generic:"generic"},uint8c:{float64:"float64",float32:"float32",int32:"int32",int16:"int16",int8:"int16",uint32:"uint32",uint16:"uint16",uint8:"uint8",uint8c:"uint8",complex64:"complex64",complex128:"complex128",generic:"generic"},complex128:{float64:"complex128",float32:"complex128",int32:"complex128",int16:"complex128",int8:"complex128",uint32:"complex128",uint16:"complex128",uint8:"complex128",uint8c:"complex128",complex64:"complex128",complex128:"complex128",generic:"generic"},complex64:{float64:"complex128",float32:"complex64",int32:"complex128",int16:"complex64",int8:"complex64",uint32:"complex128",uint16:"complex64",uint8:"complex64",uint8c:"complex64",complex64:"complex64",complex128:"complex128",generic:"generic"},generic:{float64:"generic",float32:"generic",int32:"generic",int16:"generic",int8:"generic",uint32:"generic",uint16:"generic",uint8:"generic",uint8c:"generic",complex64:"generic",complex128:"generic",generic:"generic"}}});var E2=f(function(yK,b2){"use strict";var $B=require("@stdlib/utils/keys"),x2=require("@stdlib/assert/has-own-property"),Pe=w2();function JB(){var r,e,t,i,a,n,u,o,s;for(t={},r=$B(Pe),e=r.length,s=0;s<e;s++){for(a=r[s],u=Pe[a],i={},o=0;o<e;o++)n=r[o],i[n]=u[n];t[a]=i}return t}function QB(r,e){var t;return arguments.length===0?JB():x2(Pe,r)&&(t=Pe[r],x2(t,e))?t[e]:null}b2.exports=QB});var S2=f(function(dK,T2){"use strict";var rP=E2();T2.exports=rP});var _2=f(function(hK,A2){"use strict";var eP=Er(),tP=Tr(),iP=Vr(),aP=_r(),nP=Fr(),uP=jr(),oP=Ar(),sP=kr(),vP=Cr(),fP=Mr(),lP=Ir(),cP={Float64Array:eP,Float32Array:tP,Int32Array:aP,Uint32Array:oP,Int16Array:iP,Uint16Array:uP,Int8Array:nP,Uint8Array:sP,Uint8ClampedArray:vP,Complex64Array:fP,Complex128Array:lP};A2.exports=cP});var V2=f(function(qK,j2){"use strict";var pP=require("@stdlib/assert/is-array"),mP=_2();function gP(r,e){var t;return e&&e.type&&pP(e.data)&&(t=mP[e.type],t)?new t(e.data):e}j2.exports=gP});var C2=f(function(wK,k2){"use strict";var yP=V2();k2.exports=yP});var F2=f(function(xK,dP){dP.exports={float64:{float64:1,float32:0,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,generic:1},float32:{float64:1,float32:1,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:1},int32:{float64:1,float32:0,int32:1,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,generic:1},int16:{float64:1,float32:1,int32:1,int16:1,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:1},int8:{float64:1,float32:1,int32:1,int16:1,int8:1,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:1},uint32:{float64:1,float32:0,int32:0,int16:0,int8:0,uint32:1,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,generic:1},uint16:{float64:1,float32:1,int32:1,int16:0,int8:0,uint32:1,uint16:1,uint8:0,uint8c:0,complex128:1,complex64:1,generic:1},uint8:{float64:1,float32:1,int32:1,int16:1,int8:0,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,generic:1},uint8c:{float64:1,float32:1,int32:1,int16:1,int8:0,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,generic:1},complex128:{float64:0,float32:0,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,generic:1},complex64:{float64:0,float32:0,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:1},generic:{float64:0,float32:0,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,generic:1}}});var O2=f(function(bK,z2){"use strict";var L2=require("@stdlib/utils/keys"),hP=require("@stdlib/assert/has-own-property"),Me=F2(),Ne;function qP(){var r,e,t,i,a,n,u,o,s;for(t={},r=L2(Me),e=r.length,s=0;s<e;s++){for(a=r[s],u=Me[a],i={},o=0;o<e;o++)n=r[o],i[n]=u[n];t[a]=i}return t}function wP(){var r,e,t,i,a,n,u,o,s;for(t={},r=L2(Me),e=r.length,s=0;s<e;s++){for(a=r[s],u=Me[a],i=[],o=0;o<e;o++)n=r[o],u[n]===1&&i.push(n);t[a]=i}return t}function xP(r){return arguments.length===0?qP():(Ne===void 0&&(Ne=wP()),hP(Ne,r)?Ne[r].slice():null)}z2.exports=xP});var B2=f(function(EK,R2){"use strict";var bP=O2();R2.exports=bP});var P2=f(function(TK,EP){EP.exports={float64:{float64:1,float32:1,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,generic:1},float32:{float64:1,float32:1,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:1},int32:{float64:1,float32:0,int32:1,int16:1,int8:1,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:0,generic:1},int16:{float64:1,float32:1,int32:1,int16:1,int8:1,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:1},int8:{float64:1,float32:1,int32:1,int16:1,int8:1,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:1},uint32:{float64:1,float32:0,int32:0,int16:0,int8:0,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:0,generic:1},uint16:{float64:1,float32:1,int32:1,int16:0,int8:0,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,generic:1},uint8:{float64:1,float32:1,int32:1,int16:1,int8:0,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,generic:1},uint8c:{float64:1,float32:1,int32:1,int16:1,int8:0,uint32:1,uint16:1,uint8:1,uint8c:1,complex128:1,complex64:1,generic:1},complex128:{float64:0,float32:0,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:0},complex64:{float64:0,float32:0,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:1,complex64:1,generic:0},generic:{float64:0,float32:0,int32:0,int16:0,int8:0,uint32:0,uint16:0,uint8:0,uint8c:0,complex128:0,complex64:0,generic:1}}});var I2=f(function(SK,M2){"use strict";var N2=require("@stdlib/utils/keys"),TP=require("@stdlib/assert/has-own-property"),Ue=P2(),Ie;function SP(){var r,e,t,i,a,n,u,o,s;for(t={},r=N2(Ue),e=r.length,s=0;s<e;s++){for(a=r[s],u=Ue[a],i={},o=0;o<e;o++)n=r[o],i[n]=u[n];t[a]=i}return t}function AP(){var r,e,t,i,a,n,u,o,s;for(t={},r=N2(Ue),e=r.length,s=0;s<e;s++){for(a=r[s],u=Ue[a],i=[],o=0;o<e;o++)n=r[o],u[n]===1&&i.push(n);t[a]=i}return t}function _P(r){return arguments.length===0?SP():(Ie===void 0&&(Ie=AP()),TP(Ie,r)?Ie[r].slice():null)}M2.exports=_P});var D2=f(function(AK,U2){"use strict";var jP=I2();U2.exports=jP});var Z2=f(function(_K,W2){"use strict";var wi=require("@stdlib/assert/is-array-like-object"),VP=require("@stdlib/string/format");function G2(r,e){var t=e[0];return wi(t)&&(r.push(t.length),G2(r,t)),r}function Y2(r,e,t,i,a){var n,u,o;for(n=e[t],o=0;o<i.length;o++){if(u=i[o],!wi(u)||u.length!==n)return t;if(a&&(u=Y2(r,e,t+1,u,t+1<r-1),u<r))return u}return r}function kP(r){var e,t;if(!wi(r))throw new TypeError(VP("invalid argument. Must provide an array-like object. Value: `%s`.",r));return e=[r.length],G2(e,r),t=e.length,t>1&&(e.length=Y2(t,e,1,r,t>2)),e}W2.exports=kP});var H2=f(function(jK,X2){"use strict";var CP=Z2();X2.exports=CP});var $2=f(function(VK,K2){"use strict";var FP=typeof SharedArrayBuffer=="function"?SharedArrayBuffer:null;K2.exports=FP});var Q2=f(function(kK,J2){"use strict";function LP(r){throw new Error("not supported. The current environment does not support SharedArrayBuffers, and, unfortunately, SharedArrayBuffers cannot be polyfilled. For shared memory applications, upgrade your runtime environment to one which supports SharedArrayBuffers.")}J2.exports=LP});var ew=f(function(CK,rw){"use strict";var zP=require("@stdlib/assert/has-sharedarraybuffer-support"),OP=$2(),RP=Q2(),xi;zP()?xi=OP:xi=RP;rw.exports=xi});var aw=f(function(FK,iw){"use strict";var BP=require("@stdlib/assert/is-collection"),tw=require("@stdlib/assert/is-integer").isPrimitive,PP=Nt(),bi=require("@stdlib/string/format");function NP(r){var e,t;if(!BP(r))throw new TypeError(bi("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(arguments.length>1){if(e=arguments[1],!tw(e))throw new TypeError(bi("invalid argument. Second argument must be an integer. Value: `%s`.",e));if(arguments.length>2){if(t=arguments[2],!tw(t))throw new TypeError(bi("invalid argument. Third argument must be an integer. Value: `%s`.",t))}else t=r.length}else e=0,t=r.length;return PP(r,e,t)}iw.exports=NP});var uw=f(function(LK,nw){"use strict";var MP=aw();nw.exports=MP});var lw=f(function(zK,fw){"use strict";var ie=require("@stdlib/utils/define-nonenumerable-read-only-property"),ow=require("@stdlib/assert/has-own-property"),sw=require("@stdlib/assert/is-function"),IP=require("@stdlib/assert/is-collection"),UP=require("@stdlib/assert/is-plain-object"),DP=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,GP=rr(),vw=require("@stdlib/symbol/iterator"),YP=er(),WP=ur(),ZP=H(),de=require("@stdlib/string/format");function Ei(r){var e,t,i,a,n,u,o,s,v,l;if(!IP(r))throw new TypeError(de("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(a={iter:1e308,dir:1},arguments.length>1)if(UP(arguments[1])){if(t=arguments[1],arguments.length>2){if(o=arguments[2],!sw(o))throw new TypeError(de("invalid argument. Callback argument must be a function. Value: `%s`.",o));e=arguments[3]}if(ow(t,"iter")&&(a.iter=t.iter,!DP(t.iter)))throw new TypeError(de("invalid option. `%s` option must be a nonnegative integer. Option: `%s`.","iter",t.iter));if(ow(t,"dir")&&(a.dir=t.dir,t.dir!==1&&t.dir!==-1))throw new TypeError(de("invalid option. `%s` option must be either `1` or `-1`. Option: `%s`.","dir",t.dir))}else{if(o=arguments[1],!sw(o))throw new TypeError(de("invalid argument. Second argument must be either a function or an options object. Value: `%s`.",o));e=arguments[2]}return i=0,n={},o?a.dir===1?(l=-1,ie(n,"next",c)):(l=r.length,ie(n,"next",p)):a.dir===1?(l=-1,ie(n,"next",m)):(l=r.length,ie(n,"next",g)),ie(n,"return",y),vw&&ie(n,vw,d),v=ZP(r),GP(r)?s=YP(v):s=WP(v),n;function c(){return l=(l+1)%r.length,i+=1,u||i>a.iter||r.length===0?{done:!0}:{value:o.call(e,s(r,l),l,i,r),done:!1}}function p(){return l-=1,l<0&&(l+=r.length),i+=1,u||i>a.iter||r.length===0?{done:!0}:{value:o.call(e,s(r,l),l,i,r),done:!1}}function m(){return l=(l+1)%r.length,i+=1,u||i>a.iter||r.length===0?{done:!0}:{value:s(r,l),done:!1}}function g(){return l-=1,l<0&&(l+=r.length),i+=1,u||i>a.iter||r.length===0?{done:!0}:{value:s(r,l),done:!1}}function y(h){return u=!0,arguments.length?{value:h,done:!0}:{done:!0}}function d(){return o?Ei(r,a,o,e):Ei(r,a)}}fw.exports=Ei});var pw=f(function(OK,cw){"use strict";var XP=lw();cw.exports=XP});var dw=f(function(RK,yw){"use strict";var De=require("@stdlib/utils/define-nonenumerable-read-only-property"),HP=require("@stdlib/assert/is-function"),KP=require("@stdlib/assert/is-collection"),$P=rr(),mw=require("@stdlib/symbol/iterator"),JP=er(),QP=ur(),rN=H(),gw=require("@stdlib/string/format");function Ti(r){var e,t,i,a,n,u,o;if(!KP(r))throw new TypeError(gw("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(arguments.length>1){if(a=arguments[1],!HP(a))throw new TypeError(gw("invalid argument. Second argument must be a function. Value: `%s`.",a));e=arguments[2]}return o=-1,t={},a?De(t,"next",s):De(t,"next",v),De(t,"return",l),mw&&De(t,mw,c),u=rN(r),$P(r)?n=JP(u):n=QP(u),t;function s(){return o+=1,i||o>=r.length?{done:!0}:{value:a.call(e,n(r,o),o,r),done:!1}}function v(){return o+=1,i||o>=r.length?{done:!0}:{value:n(r,o),done:!1}}function l(p){return i=!0,arguments.length?{value:p,done:!0}:{done:!0}}function c(){return a?Ti(r,a,e):Ti(r)}}yw.exports=Ti});var qw=f(function(BK,hw){"use strict";var eN=dw();hw.exports=eN});var Ew=f(function(PK,bw){"use strict";var Ge=require("@stdlib/utils/define-nonenumerable-read-only-property"),tN=require("@stdlib/assert/is-function"),iN=require("@stdlib/assert/is-collection"),aN=rr(),ww=require("@stdlib/symbol/iterator"),nN=er(),uN=ur(),oN=H(),xw=require("@stdlib/string/format");function Si(r){var e,t,i,a,n,u,o,s;if(!iN(r))throw new TypeError(xw("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(arguments.length>1){if(a=arguments[1],!tN(a))throw new TypeError(xw("invalid argument. Second argument must be a function. Value: `%s`.",a));e=arguments[2]}return n=r.length,s=n,t={},a?Ge(t,"next",v):Ge(t,"next",l),Ge(t,"return",c),ww&&Ge(t,ww,p),o=oN(r),aN(r)?u=nN(o):u=uN(o),t;function v(){return s+=r.length-n-1,n=r.length,i||s<0?(i=!0,{done:!0}):{value:a.call(e,u(r,s),s,r),done:!1}}function l(){return s+=r.length-n-1,n=r.length,i||s<0?(i=!0,{done:!0}):{value:u(r,s),done:!1}}function c(m){return i=!0,arguments.length?{value:m,done:!0}:{done:!0}}function p(){return a?Si(r,a,e):Si(r)}}bw.exports=Si});var Sw=f(function(NK,Tw){"use strict";var sN=Ew();Tw.exports=sN});var _w=f(function(MK,Aw){"use strict";var vN=Fr(),fN=kr(),lN=Cr(),cN=Vr(),pN=jr(),mN=_r(),gN=Ar(),yN=Tr(),dN=Er(),hN=Mr(),qN=Ir(),wN=[[dN,"Float64Array"],[yN,"Float32Array"],[mN,"Int32Array"],[gN,"Uint32Array"],[cN,"Int16Array"],[pN,"Uint16Array"],[vN,"Int8Array"],[fN,"Uint8Array"],[lN,"Uint8ClampedArray"],[hN,"Complex64Array"],[qN,"Complex128Array"]];Aw.exports=wN});var Vw=f(function(IK,jw){"use strict";var xN=require("@stdlib/assert/instance-of"),bN=require("@stdlib/utils/constructor-name"),EN=require("@stdlib/utils/get-prototype-of"),ae=_w();function TN(r){var e,t;for(t=0;t<ae.length;t++)if(xN(r,ae[t][0]))return ae[t][1];for(;r;){for(e=bN(r),t=0;t<ae.length;t++)if(e===ae[t][1])return ae[t][1];r=EN(r)}}jw.exports=TN});var Cw=f(function(UK,kw){"use strict";var SN=require("@stdlib/assert/is-typed-array"),AN=require("@stdlib/assert/is-complex-typed-array"),_N=require("@stdlib/strided/base/reinterpret-complex64"),jN=require("@stdlib/strided/base/reinterpret-complex128"),VN=require("@stdlib/string/format"),kN=Vw();function CN(r){var e,t,i;if(SN(r))e=r;else if(AN(r))r.BYTES_PER_ELEMENT===8?e=_N(r,0):e=jN(r,0);else throw new TypeError(VN("invalid argument. Must provide a typed array. Value: `%s`.",r));for(t={type:kN(r),data:[]},i=0;i<e.length;i++)t.data.push(e[i]);return t}kw.exports=CN});var Lw=f(function(DK,Fw){"use strict";var FN=Cw();Fw.exports=FN});var Bw=f(function(GK,Rw){"use strict";var Ye=require("@stdlib/utils/define-nonenumerable-read-only-property"),LN=require("@stdlib/assert/is-function"),zN=require("@stdlib/assert/is-collection"),ON=rr(),zw=require("@stdlib/symbol/iterator"),RN=er(),BN=ur(),PN=H(),Ow=require("@stdlib/string/format");function Ai(r){var e,t,i,a,n,u,o;if(!zN(r))throw new TypeError(Ow("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(arguments.length>1){if(a=arguments[1],!LN(a))throw new TypeError(Ow("invalid argument. Second argument must be a function. Value: `%s`.",a));e=arguments[2]}return o=-1,t={},a?Ye(t,"next",s):Ye(t,"next",v),Ye(t,"return",l),zw&&Ye(t,zw,c),u=PN(r),ON(r)?n=RN(u):n=BN(u),t;function s(){var p;if(i)return{done:!0};for(p=r.length,o+=1;o<p&&n(r,o)===void 0;)o+=1;return o>=p?(i=!0,{done:!0}):{value:a.call(e,n(r,o),o,r),done:!1}}function v(){var p;if(i)return{done:!0};for(p=r.length,o+=1;o<p&&n(r,o)===void 0;)o+=1;return o>=p?(i=!0,{done:!0}):{value:n(r,o),done:!1}}function l(p){return i=!0,arguments.length?{value:p,done:!0}:{done:!0}}function c(){return a?Ai(r,a,e):Ai(r)}}Rw.exports=Ai});var Nw=f(function(YK,Pw){"use strict";var NN=Bw();Pw.exports=NN});var Dw=f(function(WK,Uw){"use strict";var We=require("@stdlib/utils/define-nonenumerable-read-only-property"),MN=require("@stdlib/assert/is-function"),IN=require("@stdlib/assert/is-collection"),UN=rr(),Mw=require("@stdlib/symbol/iterator"),DN=er(),GN=ur(),YN=H(),Iw=require("@stdlib/string/format");function _i(r){var e,t,i,a,n,u,o,s;if(!IN(r))throw new TypeError(Iw("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(arguments.length>1){if(a=arguments[1],!MN(a))throw new TypeError(Iw("invalid argument. Second argument must be a function. Value: `%s`.",a));e=arguments[2]}return n=r.length,s=n,t={},a?We(t,"next",v):We(t,"next",l),We(t,"return",c),Mw&&We(t,Mw,p),o=YN(r),UN(r)?u=DN(o):u=GN(o),t;function v(){if(i)return{done:!0};for(s+=r.length-n-1,n=r.length;s>=0&&u(r,s)===void 0;)s-=1;return s<0?(i=!0,{done:!0}):{value:a.call(e,u(r,s),s,r),done:!1}}function l(){if(i)return{done:!0};for(s+=r.length-n-1,n=r.length;s>=0&&u(r,s)===void 0;)s-=1;return s<0?(i=!0,{done:!0}):{value:u(r,s),done:!1}}function c(m){return i=!0,arguments.length?{value:m,done:!0}:{done:!0}}function p(){return a?_i(r,a,e):_i(r)}}Uw.exports=_i});var Yw=f(function(ZK,Gw){"use strict";var WN=Dw();Gw.exports=WN});var Hw=f(function(XK,Xw){"use strict";var Ze=require("@stdlib/utils/define-nonenumerable-read-only-property"),ZN=require("@stdlib/assert/is-function"),XN=require("@stdlib/assert/is-collection"),Ww=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,HN=require("@stdlib/assert/is-integer").isPrimitive,KN=rr(),Zw=require("@stdlib/symbol/iterator"),$N=er(),JN=ur(),QN=H(),he=require("@stdlib/string/format");function ji(r,e,t,i){var a,n,u,o,s,v,l,c;if(!Ww(r))throw new TypeError(he("invalid argument. First argument must be a nonnegative integer. Value: `%s`.",r));if(!XN(e))throw new TypeError(he("invalid argument. Second argument must be an array-like object. Value: `%s`.",e));if(!HN(t))throw new TypeError(he("invalid argument. Third argument must be an integer. Value: `%s`.",t));if(!Ww(i))throw new TypeError(he("invalid argument. Fourth argument must be a nonnegative integer. Value: `%s`.",i));if(arguments.length>4){if(o=arguments[4],!ZN(o))throw new TypeError(he("invalid argument. Fifth argument must be a function. Value: `%s`.",o));a=arguments[5]}return s=i,c=-1,n={},o?Ze(n,"next",p):Ze(n,"next",m),Ze(n,"return",g),Zw&&Ze(n,Zw,y),l=QN(e),KN(e)?v=$N(l):v=JN(l),n;function p(){var d;return c+=1,u||c>=r?{done:!0}:(d=o.call(a,v(e,s),s,c,e),s+=t,{value:d,done:!1})}function m(){var d;return c+=1,u||c>=r?{done:!0}:(d=v(e,s),s+=t,{value:d,done:!1})}function g(d){return u=!0,arguments.length?{value:d,done:!0}:{done:!0}}function y(){return o?ji(r,e,t,i,o,a):ji(r,e,t,i)}}Xw.exports=ji});var $w=f(function(HK,Kw){"use strict";var rM=Hw();Kw.exports=rM});var ex=f(function(KK,rx){"use strict";var Xe=require("@stdlib/utils/define-nonenumerable-read-only-property"),He=require("@stdlib/assert/is-function"),eM=require("@stdlib/assert/is-collection"),Jw=require("@stdlib/assert/is-integer").isPrimitive,tM=rr(),Qw=require("@stdlib/symbol/iterator"),iM=er(),aM=ur(),nM=H(),Ke=require("@stdlib/string/format");function Vi(r){var e,t,i,a,n,u,o,s,v,l;if(!eM(r))throw new TypeError(Ke("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(i=arguments.length,i===1)t=0,o=r.length;else if(i===2)He(arguments[1])?(t=0,u=arguments[1]):t=arguments[1],o=r.length;else if(i===3)He(arguments[1])?(t=0,o=r.length,u=arguments[1],e=arguments[2]):He(arguments[2])?(t=arguments[1],o=r.length,u=arguments[2]):(t=arguments[1],o=arguments[2]);else{if(t=arguments[1],o=arguments[2],u=arguments[3],!He(u))throw new TypeError(Ke("invalid argument. Fourth argument must be a function. Value: `%s`.",u));e=arguments[4]}if(!Jw(t))throw new TypeError(Ke("invalid argument. Second argument must be either an integer (starting index) or a function. Value: `%s`.",t));if(!Jw(o))throw new TypeError(Ke("invalid argument. Third argument must be either an integer (ending index) or a function. Value: `%s`.",o));return o<0?(o=r.length+o,o<0&&(o=0)):o>r.length&&(o=r.length),t<0&&(t=r.length+t,t<0&&(t=0)),l=t-1,a={},u?Xe(a,"next",c):Xe(a,"next",p),Xe(a,"return",m),Qw&&Xe(a,Qw,g),v=nM(r),tM(r)?s=iM(v):s=aM(v),a;function c(){return l+=1,n||l>=o?{done:!0}:{value:u.call(e,s(r,l),l,l-t,r),done:!1}}function p(){return l+=1,n||l>=o?{done:!0}:{value:s(r,l),done:!1}}function m(y){return n=!0,arguments.length?{value:y,done:!0}:{done:!0}}function g(){return u?Vi(r,t,o,u,e):Vi(r,t,o)}}rx.exports=Vi});var ix=f(function($K,tx){"use strict";var uM=ex();tx.exports=uM});var ox=f(function(JK,ux){"use strict";var $e=require("@stdlib/utils/define-nonenumerable-read-only-property"),Je=require("@stdlib/assert/is-function"),oM=require("@stdlib/assert/is-collection"),ax=require("@stdlib/assert/is-integer").isPrimitive,sM=rr(),nx=require("@stdlib/symbol/iterator"),vM=er(),fM=ur(),lM=H(),Qe=require("@stdlib/string/format");function ki(r){var e,t,i,a,n,u,o,s,v,l;if(!oM(r))throw new TypeError(Qe("invalid argument. First argument must be an array-like object. Value: `%s`.",r));if(i=arguments.length,i===1)t=0,o=r.length;else if(i===2)Je(arguments[1])?(t=0,u=arguments[1]):t=arguments[1],o=r.length;else if(i===3)Je(arguments[1])?(t=0,o=r.length,u=arguments[1],e=arguments[2]):Je(arguments[2])?(t=arguments[1],o=r.length,u=arguments[2]):(t=arguments[1],o=arguments[2]);else{if(t=arguments[1],o=arguments[2],u=arguments[3],!Je(u))throw new TypeError(Qe("invalid argument. Fourth argument must be a function. Value: `%s`.",u));e=arguments[4]}if(!ax(t))throw new TypeError(Qe("invalid argument. Second argument must be either an integer (starting view index) or a function. Value: `%s`.",t));if(!ax(o))throw new TypeError(Qe("invalid argument. Third argument must be either an integer (ending view index) or a function. Value: `%s`.",o));return o<0?(o=r.length+o,o<0&&(o=0)):o>r.length&&(o=r.length),t<0&&(t=r.length+t,t<0&&(t=0)),l=o,a={},u?$e(a,"next",c):$e(a,"next",p),$e(a,"return",m),nx&&$e(a,nx,g),v=lM(r),sM(r)?s=vM(v):s=fM(v),a;function c(){return l-=1,n||l<t?{done:!0}:{value:u.call(e,s(r,l),l,o-l-1,r),done:!1}}function p(){return l-=1,n||l<t?{done:!0}:{value:s(r,l),done:!1}}function m(y){return n=!0,arguments.length?{value:y,done:!0}:{done:!0}}function g(){return u?ki(r,t,o,u,e):ki(r,t,o)}}ux.exports=ki});var vx=f(function(QK,sx){"use strict";var cM=ox();sx.exports=cM});var lx=f(function(r9,fx){"use strict";var pM=require("@stdlib/assert/is-string").isPrimitive,Ci=re(),mM=require("@stdlib/strided/base/reinterpret-complex128"),gM=require("@stdlib/strided/base/reinterpret-complex64"),yM=ar(),dM=require("@stdlib/string/format"),hM=yM.get("dtypes.default"),qM=Ci("complex64"),wM=Ci("complex128");function xM(){var r,e,t,i;if(r=arguments.length,r&&pM(arguments[r-1])?(r-=1,e=arguments[r]):e=hM,t=Ci(e),t===null)throw new TypeError(dM("invalid argument. Must provide a recognized data type. Value: `%s`.",e));return r<=0?new t(0):r===1?(i=arguments[0],i instanceof qM?i=gM(i,0):i instanceof wM&&(i=mM(i,0)),new t(i)):r===2?new t(arguments[0],arguments[1]):new t(arguments[0],arguments[1],arguments[2])}fx.exports=xM});var px=f(function(e9,cx){"use strict";var bM=lx();cx.exports=bM});var gx=f(function(t9,mx){"use strict";var EM=Ir(),TM=Mr(),SM={complex128:EM,complex64:TM};mx.exports=SM});var dx=f(function(i9,yx){"use strict";var AM=gx();function _M(r){return AM[r]||null}yx.exports=_M});var Fi=f(function(a9,hx){"use strict";var jM=dx();hx.exports=jM});var wx=f(function(n9,qx){"use strict";var VM=require("@stdlib/assert/is-string").isPrimitive,kM=Fi(),CM=ar(),FM=require("@stdlib/string/format"),LM=CM.get("dtypes.complex_floating_point");function zM(){var r,e,t;if(r=arguments.length,r&&VM(arguments[r-1])?(r-=1,e=arguments[r]):e=LM,t=kM(e),t===null)throw new TypeError(FM("invalid argument. Must provide a recognized data type. Value: `%s`.",e));return r<=0?new t(0):r===1?new t(arguments[0]):r===2?new t(arguments[0],arguments[1]):new t(arguments[0],arguments[1],arguments[2])}qx.exports=zM});var bx=f(function(u9,xx){"use strict";var OM=wx();xx.exports=OM});var Ex=f(function(o9,RM){RM.exports=["complex64","complex128"]});var Sx=f(function(s9,Tx){"use strict";var BM=Ex();function PM(){return BM.slice()}Tx.exports=PM});var _x=f(function(v9,Ax){"use strict";var NM=Sx();Ax.exports=NM});var jx=f(function(f9,MM){MM.exports=["float32","float64","int16","int32","int8","uint16","uint32","uint8","uint8c","complex64","complex128"]});var kx=f(function(l9,Vx){"use strict";var IM=jx();function UM(){return IM.slice()}Vx.exports=UM});var Fx=f(function(c9,Cx){"use strict";var DM=kx();Cx.exports=DM});var Lx=f(function(p9,GM){GM.exports=["float32","float64","complex64","complex128"]});var Ox=f(function(m9,zx){"use strict";var YM=Lx();function WM(){return YM.slice()}zx.exports=WM});var Bx=f(function(g9,Rx){"use strict";var ZM=Ox();Rx.exports=ZM});var Nx=f(function(y9,Px){"use strict";var XM=Vr(),HM=_r(),KM=Fr(),$M=jr(),JM=Ar(),QM=kr(),rI=Cr(),eI={int16:XM,int32:HM,int8:KM,uint16:$M,uint32:JM,uint8:QM,uint8c:rI};Px.exports=eI});var Ix=f(function(d9,Mx){"use strict";var tI=Nx();function iI(r){return tI[r]||null}Mx.exports=iI});var Dx=f(function(h9,Ux){"use strict";var aI=Ix();Ux.exports=aI});var Gx=f(function(q9,nI){nI.exports=["int16","int32","int8","uint16","uint32","uint8","uint8c"]});var Wx=f(function(w9,Yx){"use strict";var uI=Gx();function oI(){return uI.slice()}Yx.exports=oI});var Xx=f(function(x9,Zx){"use strict";var sI=Wx();Zx.exports=sI});var Kx=f(function(b9,Hx){"use strict";var vI=require("@stdlib/assert/is-string").isPrimitive,fI=re(),lI=ar(),cI=require("@stdlib/string/format"),pI=lI.get("dtypes.real");function mI(){var r,e,t;if(r=arguments.length,r&&vI(arguments[r-1])?(r-=1,e=arguments[r]):e=pI,t=fI(e),t===null)throw new TypeError(cI("invalid argument. Must provide a recognized data type. Value: `%s`.",e));return r<=0?new t(0):r===1?new t(arguments[0]):r===2?new t(arguments[0],arguments[1]):new t(arguments[0],arguments[1],arguments[2])}Hx.exports=mI});var Jx=f(function(E9,$x){"use strict";var gI=Kx();$x.exports=gI});var rb=f(function(T9,Qx){"use strict";var yI=Er(),dI=Tr(),hI=Vr(),qI=_r(),wI=Fr(),xI=jr(),bI=Ar(),EI=kr(),TI=Cr(),SI={float64:yI,float32:dI,int16:hI,int32:qI,int8:wI,uint16:xI,uint32:bI,uint8:EI,uint8c:TI};Qx.exports=SI});var tb=f(function(S9,eb){"use strict";var AI=rb();function _I(r){return AI[r]||null}eb.exports=_I});var ab=f(function(A9,ib){"use strict";var jI=tb();ib.exports=jI});var nb=f(function(_9,VI){VI.exports=["float32","float64","int16","int32","int8","uint16","uint32","uint8","uint8c"]});var ob=f(function(j9,ub){"use strict";var kI=nb();function CI(){return kI.slice()}ub.exports=CI});var vb=f(function(V9,sb){"use strict";var FI=ob();sb.exports=FI});var lb=f(function(k9,fb){"use strict";var LI=Er(),zI=Tr(),OI={float64:LI,float32:zI};fb.exports=OI});var pb=f(function(C9,cb){"use strict";var RI=lb();function BI(r){return RI[r]||null}cb.exports=BI});var gb=f(function(F9,mb){"use strict";var PI=pb();mb.exports=PI});var yb=f(function(L9,NI){NI.exports=["float32","float64"]});var hb=f(function(z9,db){"use strict";var MI=yb();function II(){return MI.slice()}db.exports=II});var wb=f(function(O9,qb){"use strict";var UI=hb();qb.exports=UI});var bb=f(function(R9,xb){"use strict";var DI=Vr(),GI=_r(),YI=Fr(),WI={int16:DI,int32:GI,int8:YI};xb.exports=WI});var Tb=f(function(B9,Eb){"use strict";var ZI=bb();function XI(r){return ZI[r]||null}Eb.exports=XI});var Ab=f(function(P9,Sb){"use strict";var HI=Tb();Sb.exports=HI});var _b=f(function(N9,KI){KI.exports=["int16","int32","int8"]});var Vb=f(function(M9,jb){"use strict";var $I=_b();function JI(){return $I.slice()}jb.exports=JI});var Cb=f(function(I9,kb){"use strict";var QI=Vb();kb.exports=QI});var Lb=f(function(U9,Fb){"use strict";var rU=jr(),eU=Ar(),tU=kr(),iU=Cr(),aU={uint16:rU,uint32:eU,uint8:tU,uint8c:iU};Fb.exports=aU});var Ob=f(function(D9,zb){"use strict";var nU=Lb();function uU(r){return nU[r]||null}zb.exports=uU});var Bb=f(function(G9,Rb){"use strict";var oU=Ob();Rb.exports=oU});var Pb=f(function(Y9,sU){sU.exports=["uint16","uint32","uint8","uint8c"]});var Mb=f(function(W9,Nb){"use strict";var vU=Pb();function fU(){return vU.slice()}Nb.exports=fU});var Ub=f(function(Z9,Ib){"use strict";var lU=Mb();Ib.exports=lU});var Yb=f(function(X9,Gb){"use strict";var cU=require("@stdlib/assert/is-nonnegative-integer").isPrimitive,Db=It(),pU=ee(),mU=ar(),gU=require("@stdlib/string/format"),yU=mU.get("dtypes.default");function dU(r){var e;if(!cU(r))throw new TypeError(gU("invalid argument. First argument must be a nonnegative integer. Value: `%s`.",r));if(arguments.length>1){if(e=arguments[1],e==="generic")return Db(r)}else e=yU;return Db.assign(pU(r,e),1,0)}Gb.exports=dU});var Li=f(function(H9,Wb){"use strict";var hU=Yb();Wb.exports=hU});var Xb=f(function(K9,Zb){"use strict";var qU=Li(),wU=H(),xU=require("@stdlib/string/format");function bU(r){var e=wU(r);if(e===null)throw new TypeError(xU("invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.",r));return arguments.length>1&&(e=arguments[1]),qU(r.length,e)}Zb.exports=bU});var Kb=f(function($9,Hb){"use strict";var EU=Xb();Hb.exports=EU});var Jb=f(function(J9,$b){"use strict";var TU=require("@stdlib/string/format"),SU=H(),AU=ee();function _U(r){var e=SU(r);if(e===null)throw new TypeError(TU("invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.",r));return arguments.length>1&&(e=arguments[1]),AU(r.length,e)}$b.exports=_U});var r3=f(function(Q9,Qb){"use strict";var jU=Jb();Qb.exports=jU});var _=require("@stdlib/utils/define-read-only-property"),A={};_(A,"base",f1());_(A,"ArrayBuffer",Dt());_(A,"acartesianPower",w1());_(A,"acartesianProduct",A1());_(A,"acartesianSquare",k1());_(A,"Complex64Array",Mr());_(A,"Complex128Array",Ir());_(A,"convertArray",Xt());_(A,"convertArraySame",D1());_(A,"arrayCtors",Wr());_(A,"DataView",H1());_(A,"datespace",td());_(A,"arrayDefaults",ar());_(A,"arrayDataType",H());_(A,"arrayDataTypes",$t());_(A,"aempty",Qt());_(A,"aemptyLike",Rd());_(A,"filledarray",Gd());_(A,"filledarrayBy",rh());_(A,"Float32Array",Tr());_(A,"Float64Array",Er());_(A,"iterator2array",nh());_(A,"afull",Hr());_(A,"afullLike",ph());_(A,"incrspace",dh());_(A,"Int8Array",Fr());_(A,"Int16Array",Vr());_(A,"Int32Array",_r());_(A,"linspace",fq());_(A,"logspace",yq());_(A,"arrayMinDataType",Tq());_(A,"anans",Vq());_(A,"anansLike",Lq());_(A,"arrayNextDataType",Pq());_(A,"aoneTo",gi());_(A,"aoneToLike",Wq());_(A,"aones",Kq());_(A,"aonesLike",r2());_(A,"typedarraypool",q2());_(A,"arrayPromotionRules",S2());_(A,"reviveTypedArray",C2());_(A,"arraySafeCasts",B2());_(A,"arraySameKindCasts",D2());_(A,"arrayShape",H2());_(A,"SharedArrayBuffer",ew());_(A,"aslice",uw());_(A,"circarray2iterator",pw());_(A,"array2iterator",qw());_(A,"array2iteratorRight",Sw());_(A,"typedarray2json",Lw());_(A,"sparsearray2iterator",Nw());_(A,"sparsearray2iteratorRight",Yw());_(A,"stridedarray2iterator",$w());_(A,"arrayview2iterator",ix());_(A,"arrayview2iteratorRight",vx());_(A,"typedarray",px());_(A,"complexarray",bx());_(A,"complexarrayCtors",Fi());_(A,"complexarrayDataTypes",_x());_(A,"typedarrayCtors",re());_(A,"typedarrayDataTypes",Fx());_(A,"floatarrayCtors",oi());_(A,"floatarrayDataTypes",Bx());_(A,"intarrayCtors",Dx());_(A,"intarrayDataTypes",Xx());_(A,"realarray",Jx());_(A,"realarrayCtors",ab());_(A,"realarrayDataTypes",vb());_(A,"realarrayFloatCtors",gb());_(A,"realarrayFloatDataTypes",wb());_(A,"intarraySignedCtors",Ab());_(A,"intarraySignedDataTypes",Cb());_(A,"intarrayUnsignedCtors",Bb());_(A,"intarrayUnsignedDataTypes",Ub());_(A,"Uint8Array",kr());_(A,"Uint8ClampedArray",Cr());_(A,"Uint16Array",jr());_(A,"Uint32Array",Ar());_(A,"azeroTo",Li());_(A,"azeroToLike",Kb());_(A,"azeros",ee());_(A,"azerosLike",r3());_(A,"constants",require("@stdlib/constants/array"));module.exports=A;
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2024 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2023 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2021 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2020 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2019 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-//# sourceMappingURL=index.js.map
diff --git a/dist/index.js.map b/dist/index.js.map
deleted file mode 100644
index 114535bb..00000000
--- a/dist/index.js.map
+++ /dev/null
@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../base/assert/is-accessor-array/lib/main.js", "../base/assert/is-accessor-array/lib/index.js", "../base/getter/lib/main.js", "../base/getter/lib/index.js", "../base/setter/lib/main.js", "../base/setter/lib/index.js", "../base/accessor-getter/lib/main.js", "../base/accessor-getter/lib/index.js", "../base/accessor-setter/lib/main.js", "../base/accessor-setter/lib/index.js", "../dtype/lib/ctor2dtype.js", "../float64/lib/main.js", "../float64/lib/polyfill.js", "../float64/lib/index.js", "../float32/lib/main.js", "../float32/lib/polyfill.js", "../float32/lib/index.js", "../uint32/lib/main.js", "../uint32/lib/polyfill.js", "../uint32/lib/index.js", "../int32/lib/main.js", "../int32/lib/polyfill.js", "../int32/lib/index.js", "../uint16/lib/main.js", "../uint16/lib/polyfill.js", "../uint16/lib/index.js", "../int16/lib/main.js", "../int16/lib/polyfill.js", "../int16/lib/index.js", "../uint8/lib/main.js", "../uint8/lib/polyfill.js", "../uint8/lib/index.js", "../uint8c/lib/main.js", "../uint8c/lib/polyfill.js", "../uint8c/lib/index.js", "../int8/lib/main.js", "../int8/lib/polyfill.js", "../int8/lib/index.js", "../base/assert/is-complex64array/lib/main.js", "../base/assert/is-complex64array/lib/index.js", "../base/assert/is-complex128array/lib/main.js", "../base/assert/is-complex128array/lib/index.js", "../complex64/lib/from_iterator.js", "../complex64/lib/from_iterator_map.js", "../complex64/lib/from_array.js", "../complex64/lib/main.js", "../complex64/lib/index.js", "../complex128/lib/from_iterator.js", "../complex128/lib/from_iterator_map.js", "../complex128/lib/from_array.js", "../complex128/lib/main.js", "../complex128/lib/index.js", "../dtype/lib/ctors.js", "../dtype/lib/dtypes.js", "../dtype/lib/main.js", "../dtype/lib/index.js", "../base/accessors/lib/main.js", "../base/accessors/lib/index.js", "../base/accessor/lib/main.js", "../base/accessor/lib/index.js", "../base/arraylike2object/lib/main.js", "../base/arraylike2object/lib/index.js", "../base/any/lib/main.js", "../base/any/lib/index.js", "../base/any-by/lib/main.js", "../base/any-by/lib/index.js", "../base/any-by-right/lib/main.js", "../base/any-by-right/lib/index.js", "../base/assert/contains/lib/main.js", "../base/assert/contains/lib/factory.js", "../base/assert/contains/lib/index.js", "../base/assert/has-same-values/lib/main.js", "../base/assert/has-same-values/lib/index.js", "../base/assert/lib/index.js", "../base/resolve-getter/lib/main.js", "../base/resolve-getter/lib/index.js", "../base/at/lib/main.js", "../base/at/lib/index.js", "../base/at2d/lib/main.js", "../base/at2d/lib/index.js", "../base/at3d/lib/main.js", "../base/at3d/lib/index.js", "../base/at4d/lib/main.js", "../base/at4d/lib/index.js", "../base/at5d/lib/main.js", "../base/at5d/lib/index.js", "../base/atnd/lib/main.js", "../base/atnd/lib/index.js", "../base/bifurcate-entries/lib/main.js", "../base/bifurcate-entries/lib/index.js", "../base/bifurcate-entries-by/lib/main.js", "../base/bifurcate-entries-by/lib/index.js", "../base/bifurcate-indices/lib/main.js", "../base/bifurcate-indices/lib/index.js", "../base/bifurcate-indices-by/lib/main.js", "../base/bifurcate-indices-by/lib/index.js", "../base/bifurcate-values/lib/main.js", "../base/bifurcate-values/lib/index.js", "../base/bifurcate-values-by/lib/main.js", "../base/bifurcate-values-by/lib/index.js", "../base/binary2d/lib/main.js", "../base/binary2d/lib/index.js", "../base/binary3d/lib/main.js", "../base/binary3d/lib/index.js", "../base/binary4d/lib/main.js", "../base/binary4d/lib/index.js", "../base/binary5d/lib/main.js", "../base/binary5d/lib/index.js", "../base/binarynd/lib/main.js", "../base/binarynd/lib/index.js", "../base/copy-indexed/lib/main.js", "../base/copy-indexed/lib/index.js", "../base/filled/lib/main.js", "../base/filled/lib/index.js", "../base/zeros/lib/main.js", "../base/zeros/lib/index.js", "../base/broadcast-array/lib/main.js", "../base/broadcast-array/lib/index.js", "../base/broadcasted-binary2d/lib/main.js", "../base/broadcasted-binary2d/lib/index.js", "../base/broadcasted-binary3d/lib/main.js", "../base/broadcasted-binary3d/lib/index.js", "../base/broadcasted-binary4d/lib/main.js", "../base/broadcasted-binary4d/lib/index.js", "../base/broadcasted-binary5d/lib/main.js", "../base/broadcasted-binary5d/lib/index.js", "../base/broadcasted-quaternary2d/lib/main.js", "../base/broadcasted-quaternary2d/lib/index.js", "../base/broadcasted-quinary2d/lib/main.js", "../base/broadcasted-quinary2d/lib/index.js", "../base/broadcasted-ternary2d/lib/main.js", "../base/broadcasted-ternary2d/lib/index.js", "../base/broadcasted-unary2d/lib/main.js", "../base/broadcasted-unary2d/lib/index.js", "../base/broadcasted-unary3d/lib/main.js", "../base/broadcasted-unary3d/lib/index.js", "../base/broadcasted-unary4d/lib/main.js", "../base/broadcasted-unary4d/lib/index.js", "../base/broadcasted-unary5d/lib/main.js", "../base/broadcasted-unary5d/lib/index.js", "../base/cartesian-power/lib/main.js", "../base/cartesian-power/lib/index.js", "../base/cartesian-product/lib/main.js", "../base/cartesian-product/lib/index.js", "../base/cartesian-square/lib/main.js", "../base/cartesian-square/lib/index.js", "../base/copy/lib/main.js", "../base/copy/lib/index.js", "../base/dedupe/lib/main.js", "../base/dedupe/lib/index.js", "../base/every/lib/main.js", "../base/every/lib/index.js", "../base/every-by/lib/main.js", "../base/every-by/lib/index.js", "../base/every-by-right/lib/main.js", "../base/every-by-right/lib/index.js", "../base/filled-by/lib/main.js", "../base/filled-by/lib/index.js", "../base/filled2d/lib/main.js", "../base/filled2d/lib/index.js", "../base/filled2d-by/lib/main.js", "../base/filled2d-by/lib/index.js", "../base/filled3d/lib/main.js", "../base/filled3d/lib/index.js", "../base/filled3d-by/lib/main.js", "../base/filled3d-by/lib/index.js", "../base/filled4d/lib/main.js", "../base/filled4d/lib/index.js", "../base/filled4d-by/lib/main.js", "../base/filled4d-by/lib/index.js", "../base/filled5d/lib/main.js", "../base/filled5d/lib/index.js", "../base/filled5d-by/lib/main.js", "../base/filled5d-by/lib/index.js", "../base/fillednd/lib/main.js", "../base/fillednd/lib/index.js", "../base/fillednd-by/lib/main.js", "../base/fillednd-by/lib/index.js", "../base/filter/lib/main.js", "../base/filter/lib/index.js", "../base/first/lib/main.js", "../base/first/lib/index.js", "../base/flatten/lib/assign.js", "../base/flatten/lib/main.js", "../base/flatten/lib/index.js", "../base/flatten-by/lib/assign.js", "../base/flatten-by/lib/main.js", "../base/flatten-by/lib/index.js", "../base/flatten2d/lib/main.js", "../base/flatten2d/lib/assign.js", "../base/flatten2d/lib/index.js", "../base/flatten2d-by/lib/main.js", "../base/flatten2d-by/lib/assign.js", "../base/flatten2d-by/lib/index.js", "../base/flatten3d/lib/main.js", "../base/flatten3d/lib/assign.js", "../base/flatten3d/lib/index.js", "../base/flatten3d-by/lib/main.js", "../base/flatten3d-by/lib/assign.js", "../base/flatten3d-by/lib/index.js", "../base/flatten4d/lib/main.js", "../base/flatten4d/lib/assign.js", "../base/flatten4d/lib/index.js", "../base/flatten4d-by/lib/main.js", "../base/flatten4d-by/lib/assign.js", "../base/flatten4d-by/lib/index.js", "../base/flatten5d/lib/main.js", "../base/flatten5d/lib/assign.js", "../base/flatten5d/lib/index.js", "../base/flatten5d-by/lib/main.js", "../base/flatten5d-by/lib/assign.js", "../base/flatten5d-by/lib/index.js", "../base/fliplr2d/lib/main.js", "../base/fliplr2d/lib/index.js", "../base/fliplr3d/lib/main.js", "../base/fliplr3d/lib/index.js", "../base/fliplr4d/lib/main.js", "../base/fliplr4d/lib/index.js", "../base/fliplr5d/lib/main.js", "../base/fliplr5d/lib/index.js", "../base/flipud2d/lib/main.js", "../base/flipud2d/lib/index.js", "../base/flipud3d/lib/main.js", "../base/flipud3d/lib/index.js", "../base/flipud4d/lib/main.js", "../base/flipud4d/lib/index.js", "../base/flipud5d/lib/main.js", "../base/flipud5d/lib/index.js", "../base/from-strided/lib/main.js", "../base/from-strided/lib/index.js", "../base/group-entries/lib/main.js", "../base/group-entries/lib/index.js", "../base/group-entries-by/lib/main.js", "../base/group-entries-by/lib/index.js", "../base/group-indices/lib/main.js", "../base/group-indices/lib/index.js", "../base/group-indices-by/lib/main.js", "../base/group-indices-by/lib/index.js", "../base/group-values/lib/main.js", "../base/group-values/lib/index.js", "../base/group-values-by/lib/main.js", "../base/group-values-by/lib/index.js", "../base/incrspace/lib/main.js", "../base/incrspace/lib/index.js", "../base/index-of/lib/main.js", "../base/index-of/lib/index.js", "../base/last/lib/main.js", "../base/last/lib/index.js", "../base/last-index-of/lib/main.js", "../base/last-index-of/lib/index.js", "../base/linspace/lib/main.js", "../base/linspace/lib/index.js", "../base/logspace/lib/main.js", "../base/logspace/lib/index.js", "../base/map2d/lib/main.js", "../base/map2d/lib/assign.js", "../base/map2d/lib/index.js", "../base/map3d/lib/main.js", "../base/map3d/lib/assign.js", "../base/map3d/lib/index.js", "../base/map4d/lib/main.js", "../base/map4d/lib/assign.js", "../base/map4d/lib/index.js", "../base/map5d/lib/main.js", "../base/map5d/lib/assign.js", "../base/map5d/lib/index.js", "../base/mskbinary2d/lib/main.js", "../base/mskbinary2d/lib/index.js", "../base/mskfilter/lib/main.js", "../base/mskfilter/lib/index.js", "../base/mskreject/lib/main.js", "../base/mskreject/lib/index.js", "../base/mskunary2d/lib/main.js", "../base/mskunary2d/lib/index.js", "../base/mskunary3d/lib/main.js", "../base/mskunary3d/lib/index.js", "../base/n-cartesian-product/lib/main.js", "../base/n-cartesian-product/lib/index.js", "../base/none/lib/main.js", "../base/none/lib/index.js", "../base/none-by/lib/main.js", "../base/none-by/lib/index.js", "../base/none-by-right/lib/main.js", "../base/none-by-right/lib/index.js", "../base/one-to/lib/main.js", "../base/one-to/lib/assign.js", "../base/one-to/lib/index.js", "../base/ones/lib/main.js", "../base/ones/lib/index.js", "../base/ones2d/lib/main.js", "../base/ones2d/lib/index.js", "../base/ones3d/lib/main.js", "../base/ones3d/lib/index.js", "../base/ones4d/lib/main.js", "../base/ones4d/lib/index.js", "../base/ones5d/lib/main.js", "../base/ones5d/lib/index.js", "../base/onesnd/lib/main.js", "../base/onesnd/lib/index.js", "../base/quaternary2d/lib/main.js", "../base/quaternary2d/lib/index.js", "../base/quaternary3d/lib/main.js", "../base/quaternary3d/lib/index.js", "../base/quaternary4d/lib/main.js", "../base/quaternary4d/lib/index.js", "../base/quaternary5d/lib/main.js", "../base/quaternary5d/lib/index.js", "../base/quinary2d/lib/main.js", "../base/quinary2d/lib/index.js", "../base/quinary3d/lib/main.js", "../base/quinary3d/lib/index.js", "../base/quinary4d/lib/main.js", "../base/quinary4d/lib/index.js", "../base/quinary5d/lib/main.js", "../base/quinary5d/lib/index.js", "../base/reject/lib/main.js", "../base/reject/lib/index.js", "../base/resolve-setter/lib/main.js", "../base/resolve-setter/lib/index.js", "../base/reverse/lib/main.js", "../base/reverse/lib/index.js", "../base/slice/lib/main.js", "../base/slice/lib/index.js", "../base/strided2array2d/lib/main.js", "../base/strided2array2d/lib/index.js", "../base/strided2array3d/lib/main.js", "../base/strided2array3d/lib/index.js", "../base/strided2array4d/lib/main.js", "../base/strided2array4d/lib/index.js", "../base/strided2array5d/lib/main.js", "../base/strided2array5d/lib/index.js", "../base/take/lib/main.js", "../base/take/lib/index.js", "../base/take-indexed/lib/main.js", "../base/take-indexed/lib/index.js", "../base/take2d/lib/main.js", "../base/take2d/lib/index.js", "../base/take3d/lib/main.js", "../base/take3d/lib/index.js", "../base/ternary2d/lib/main.js", "../base/ternary2d/lib/index.js", "../base/ternary3d/lib/main.js", "../base/ternary3d/lib/index.js", "../base/ternary4d/lib/main.js", "../base/ternary4d/lib/index.js", "../base/ternary5d/lib/main.js", "../base/ternary5d/lib/index.js", "../base/to-accessor-array/lib/main.js", "../base/to-accessor-array/lib/index.js", "../base/to-deduped/lib/main.js", "../base/to-deduped/lib/index.js", "../base/to-reversed/lib/main.js", "../base/to-reversed/lib/index.js", "../base/unary2d/lib/main.js", "../base/unary2d/lib/index.js", "../base/unary2d-by/lib/main.js", "../base/unary2d-by/lib/index.js", "../base/unary3d/lib/main.js", "../base/unary3d/lib/index.js", "../base/unary4d/lib/main.js", "../base/unary4d/lib/index.js", "../base/unary5d/lib/main.js", "../base/unary5d/lib/index.js", "../base/unarynd/lib/main.js", "../base/unarynd/lib/index.js", "../base/unitspace/lib/main.js", "../base/unitspace/lib/index.js", "../base/zero-to/lib/main.js", "../base/zero-to/lib/assign.js", "../base/zero-to/lib/index.js", "../base/zeros2d/lib/main.js", "../base/zeros2d/lib/index.js", "../base/zeros3d/lib/main.js", "../base/zeros3d/lib/index.js", "../base/zeros4d/lib/main.js", "../base/zeros4d/lib/index.js", "../base/zeros5d/lib/main.js", "../base/zeros5d/lib/index.js", "../base/zerosnd/lib/main.js", "../base/zerosnd/lib/index.js", "../base/lib/index.js", "../buffer/lib/main.js", "../buffer/lib/polyfill.js", "../buffer/lib/index.js", "../cartesian-power/lib/main.js", "../cartesian-power/lib/index.js", "../cartesian-product/lib/main.js", "../cartesian-product/lib/index.js", "../cartesian-square/lib/main.js", "../cartesian-square/lib/index.js", "../ctors/lib/ctors.js", "../ctors/lib/main.js", "../ctors/lib/index.js", "../convert/lib/main.js", "../convert/lib/index.js", "../convert-same/lib/main.js", "../convert-same/lib/index.js", "../dataview/lib/main.js", "../dataview/lib/polyfill.js", "../dataview/lib/index.js", "../datespace/lib/main.js", "../datespace/lib/index.js", "../defaults/lib/main.js", "../defaults/lib/get.js", "../defaults/lib/index.js", "../dtypes/lib/dtypes.json", "../dtypes/lib/main.js", "../dtypes/lib/index.js", "../empty/lib/is_buffer_uint8array.js", "../typed-ctors/lib/ctors.js", "../typed-ctors/lib/main.js", "../typed-ctors/lib/index.js", "../empty/lib/main.js", "../zeros/lib/main.js", "../zeros/lib/index.js", "../empty/lib/polyfill.js", "../empty/lib/index.js", "../empty-like/lib/main.js", "../empty-like/lib/index.js", "../filled/lib/main.js", "../filled/lib/index.js", "../filled-by/lib/main.js", "../filled-by/lib/index.js", "../from-iterator/lib/main.js", "../from-iterator/lib/index.js", "../full/lib/main.js", "../full/lib/index.js", "../full-like/lib/main.js", "../full-like/lib/index.js", "../incrspace/lib/main.js", "../incrspace/lib/index.js", "../typed-float-ctors/lib/ctors.js", "../typed-float-ctors/lib/main.js", "../typed-float-ctors/lib/index.js", "../linspace/lib/generic_real.js", "../linspace/lib/generic_complex.js", "../linspace/lib/typed_real.js", "../linspace/lib/typed_complex.js", "../linspace/lib/validate.js", "../linspace/lib/defaults.json", "../linspace/lib/main.js", "../linspace/lib/accessors_complex.js", "../linspace/lib/accessors_real.js", "../linspace/lib/assign.js", "../linspace/lib/index.js", "../logspace/lib/main.js", "../logspace/lib/index.js", "../min-dtype/lib/main.js", "../min-dtype/lib/index.js", "../nans/lib/main.js", "../nans/lib/index.js", "../nans-like/lib/main.js", "../nans-like/lib/index.js", "../next-dtype/lib/next_dtypes.json", "../next-dtype/lib/main.js", "../next-dtype/lib/index.js", "../one-to/lib/main.js", "../one-to/lib/index.js", "../one-to-like/lib/main.js", "../one-to-like/lib/index.js", "../ones/lib/main.js", "../ones/lib/index.js", "../ones-like/lib/main.js", "../ones-like/lib/index.js", "../pool/lib/defaults.js", "../pool/lib/validate.js", "../pool/lib/pool.js", "../pool/lib/bytes_per_element.json", "../pool/lib/factory.js", "../pool/lib/main.js", "../pool/lib/index.js", "../promotion-rules/lib/promotion_rules.json", "../promotion-rules/lib/main.js", "../promotion-rules/lib/index.js", "../reviver/lib/ctors.js", "../reviver/lib/main.js", "../reviver/lib/index.js", "../safe-casts/lib/safe_casts.json", "../safe-casts/lib/main.js", "../safe-casts/lib/index.js", "../same-kind-casts/lib/same_kind_casts.json", "../same-kind-casts/lib/main.js", "../same-kind-casts/lib/index.js", "../shape/lib/main.js", "../shape/lib/index.js", "../shared-buffer/lib/main.js", "../shared-buffer/lib/polyfill.js", "../shared-buffer/lib/index.js", "../slice/lib/main.js", "../slice/lib/index.js", "../to-circular-iterator/lib/main.js", "../to-circular-iterator/lib/index.js", "../to-iterator/lib/main.js", "../to-iterator/lib/index.js", "../to-iterator-right/lib/main.js", "../to-iterator-right/lib/index.js", "../to-json/lib/ctors.js", "../to-json/lib/type.js", "../to-json/lib/main.js", "../to-json/lib/index.js", "../to-sparse-iterator/lib/main.js", "../to-sparse-iterator/lib/index.js", "../to-sparse-iterator-right/lib/main.js", "../to-sparse-iterator-right/lib/index.js", "../to-strided-iterator/lib/main.js", "../to-strided-iterator/lib/index.js", "../to-view-iterator/lib/main.js", "../to-view-iterator/lib/index.js", "../to-view-iterator-right/lib/main.js", "../to-view-iterator-right/lib/index.js", "../typed/lib/main.js", "../typed/lib/index.js", "../typed-complex-ctors/lib/ctors.js", "../typed-complex-ctors/lib/main.js", "../typed-complex-ctors/lib/index.js", "../typed-complex/lib/main.js", "../typed-complex/lib/index.js", "../typed-complex-dtypes/lib/dtypes.json", "../typed-complex-dtypes/lib/main.js", "../typed-complex-dtypes/lib/index.js", "../typed-dtypes/lib/dtypes.json", "../typed-dtypes/lib/main.js", "../typed-dtypes/lib/index.js", "../typed-float-dtypes/lib/dtypes.json", "../typed-float-dtypes/lib/main.js", "../typed-float-dtypes/lib/index.js", "../typed-integer-ctors/lib/ctors.js", "../typed-integer-ctors/lib/main.js", "../typed-integer-ctors/lib/index.js", "../typed-integer-dtypes/lib/dtypes.json", "../typed-integer-dtypes/lib/main.js", "../typed-integer-dtypes/lib/index.js", "../typed-real/lib/main.js", "../typed-real/lib/index.js", "../typed-real-ctors/lib/ctors.js", "../typed-real-ctors/lib/main.js", "../typed-real-ctors/lib/index.js", "../typed-real-dtypes/lib/dtypes.json", "../typed-real-dtypes/lib/main.js", "../typed-real-dtypes/lib/index.js", "../typed-real-float-ctors/lib/ctors.js", "../typed-real-float-ctors/lib/main.js", "../typed-real-float-ctors/lib/index.js", "../typed-real-float-dtypes/lib/dtypes.json", "../typed-real-float-dtypes/lib/main.js", "../typed-real-float-dtypes/lib/index.js", "../typed-signed-integer-ctors/lib/ctors.js", "../typed-signed-integer-ctors/lib/main.js", "../typed-signed-integer-ctors/lib/index.js", "../typed-signed-integer-dtypes/lib/dtypes.json", "../typed-signed-integer-dtypes/lib/main.js", "../typed-signed-integer-dtypes/lib/index.js", "../typed-unsigned-integer-ctors/lib/ctors.js", "../typed-unsigned-integer-ctors/lib/main.js", "../typed-unsigned-integer-ctors/lib/index.js", "../typed-unsigned-integer-dtypes/lib/dtypes.json", "../typed-unsigned-integer-dtypes/lib/main.js", "../typed-unsigned-integer-dtypes/lib/index.js", "../zero-to/lib/main.js", "../zero-to/lib/index.js", "../zero-to-like/lib/main.js", "../zero-to-like/lib/index.js", "../zeros-like/lib/main.js", "../zeros-like/lib/index.js", "../lib/index.js"],
-  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar TYPE = 'function';\n\n\n// MAIN //\n\n/**\n* Tests if an array-like object supports the accessor (get/set) protocol.\n*\n* @param {Object} value - value to test\n* @returns {boolean} boolean indicating whether a value is an accessor array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n*\n* var bool = isAccessorArray( new Complex128Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isAccessorArray( [] );\n* // returns false\n*/\nfunction isAccessorArray( value ) {\n\treturn ( typeof value.get === TYPE && typeof value.set === TYPE ); // eslint-disable-line valid-typeof\n}\n\n\n// EXPORTS //\n\nmodule.exports = isAccessorArray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if an array-like object supports the accessor (get/set) protocol.\n*\n* @module @stdlib/array/base/assert/is-accessor-array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128array' );\n* var isAccessorArray = require( '@stdlib/array/base/assert/is-accessor-array' );\n*\n* var bool = isAccessorArray( new Complex128Array( 10 ) );\n* // returns true\n*\n* bool = isAccessorArray( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'float64': getFloat64,\n\t'float32': getFloat32,\n\t'int32': getInt32,\n\t'int16': getInt16,\n\t'int8': getInt8,\n\t'uint32': getUint32,\n\t'uint16': getUint16,\n\t'uint8': getUint8,\n\t'uint8c': getUint8c,\n\t'generic': getGeneric,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var arr = new Float64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat64( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat64( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Float32Array = require( '@stdlib/array/float32' );\n*\n* var arr = new Float32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat32( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat32( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Int32Array = require( '@stdlib/array/int32' );\n*\n* var arr = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt32( arr, 2 );\n* // returns 3\n*/\nfunction getInt32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Int16Array = require( '@stdlib/array/int16' );\n*\n* var arr = new Int16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt16( arr, 2 );\n* // returns 3\n*/\nfunction getInt16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Int8Array = require( '@stdlib/array/int8' );\n*\n* var arr = new Int8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt8( arr, 2 );\n* // returns 3\n*/\nfunction getInt8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Uint32Array = require( '@stdlib/array/uint32' );\n*\n* var arr = new Uint32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint32( arr, 2 );\n* // returns 3\n*/\nfunction getUint32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Uint16Array = require( '@stdlib/array/uint16' );\n*\n* var arr = new Uint16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint16( arr, 2 );\n* // returns 3\n*/\nfunction getUint16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Uint8Array = require( '@stdlib/array/uint8' );\n*\n* var arr = new Uint8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8( arr, 2 );\n* // returns 3\n*/\nfunction getUint8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Uint8ClampedArray = require( '@stdlib/array/uint8c' );\n*\n* var arr = new Uint8ClampedArray( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8c( arr, 2 );\n* // returns 3\n*/\nfunction getUint8c( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getGeneric( arr, 2 );\n* // returns 3\n*/\nfunction getGeneric( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* var dtype = require( '@stdlib/array/dtype' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nmodule.exports = getter;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for retrieving an element from an indexed array-like object.\n*\n* @module @stdlib/array/base/getter\n*\n* @example\n* var dtype = require( '@stdlib/array/dtype' );\n* var getter = require( '@stdlib/array/base/getter' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 2 );\n* // returns 3\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'float64': setFloat64,\n\t'float32': setFloat32,\n\t'int32': setInt32,\n\t'int16': setInt16,\n\t'int8': setInt8,\n\t'uint32': setUint32,\n\t'uint16': setUint16,\n\t'uint8': setUint8,\n\t'uint8c': setUint8c,\n\t'generic': setGeneric,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var arr = new Float64Array( 4 );\n*\n* setFloat64( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat64( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Float32Array = require( '@stdlib/array/float32' );\n*\n* var arr = new Float32Array( 4 );\n*\n* setFloat32( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Int32Array = require( '@stdlib/array/int32' );\n*\n* var arr = new Int32Array( 4 );\n*\n* setInt32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Int16Array = require( '@stdlib/array/int16' );\n*\n* var arr = new Int16Array( 4 );\n*\n* setInt16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Int8Array = require( '@stdlib/array/int8' );\n*\n* var arr = new Int8Array( 4 );\n*\n* setInt8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Uint32Array = require( '@stdlib/array/uint32' );\n*\n* var arr = new Uint32Array( 4 );\n*\n* setUint32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Uint16Array = require( '@stdlib/array/uint16' );\n*\n* var arr = new Uint16Array( 4 );\n*\n* setUint16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Uint8Array = require( '@stdlib/array/uint8' );\n*\n* var arr = new Uint8Array( 4 );\n*\n* setUint8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Uint8ClampedArray = require( '@stdlib/array/uint8c' );\n*\n* var arr = new Uint8ClampedArray( 4 );\n*\n* setUint8c( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8c( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setGeneric( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setGeneric( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setArrayLike( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* var dtype = require( '@stdlib/array/dtype' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nmodule.exports = setter;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for setting an element in an indexed array-like object.\n*\n* @module @stdlib/array/base/setter\n*\n* @example\n* var dtype = require( '@stdlib/array/dtype' );\n* var set = require( '@stdlib/array/base/setter' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 2, 10 );\n*\n* var v = arr[ 2 ];\n* // returns 10\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'complex128': getComplex128,\n\t'complex64': getComplex64,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex128( arr, 1 );\n* // returns <Complex128>\n*\n* var re = real( v );\n* // returns 3.0\n*\n* var im = imag( v );\n* // returns 4.0\n*/\nfunction getComplex128( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n/**\n* Returns an element from a `Complex64Array`.\n*\n* @private\n* @param {Complex64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex64( arr, 1 );\n* // returns <Complex64>\n*\n* var re = realf( v );\n* // returns 3.0\n*\n* var im = imagf( v );\n* // returns 4.0\n*/\nfunction getComplex64( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n/**\n* Returns an element from an array-like object supporting the get/set protocol.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* function get( idx ) {\n*    return arr[ idx ];\n* }\n*\n* function set( value, idx ) {\n*    arr[ idx ] = value;\n* }\n*\n* arr.get = get;\n* arr.set = set;\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an array-like object supporting the get/set protocol.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n* var dtype = require( '@stdlib/array/dtype' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 1 );\n* // returns <Complex64>\n*\n* var re = realf( v );\n* // returns 3.0\n*\n* var im = imagf( v );\n* // returns 4.0\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nmodule.exports = getter;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for retrieving an element from an array-like object supporting the get/set protocol.\n*\n* @module @stdlib/array/base/accessor-getter\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n* var dtype = require( '@stdlib/array/dtype' );\n* var getter = require( '@stdlib/array/base/accessor-getter' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 1 );\n* // returns <Complex64>\n*\n* var re = realf( v );\n* // returns 3.0\n*\n* var im = imagf( v );\n* // returns 4.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'complex128': setComplex128,\n\t'complex64': setComplex64,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n* var Complex128 = require( '@stdlib/complex/float64' );\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* setComplex128( arr, 1, new Complex128( 10.0, 11.0 ) );\n* var v = arr.get( 1 );\n* // returns <Complex128>\n*\n* var re = real( v );\n* // returns 10.0\n*\n* var im = imag( v );\n* // returns 11.0\n*/\nfunction setComplex128( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n/**\n* Sets an element in a `Complex64Array`.\n*\n* @private\n* @param {Complex64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n* var Complex64 = require( '@stdlib/complex/float32' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* setComplex64( arr, 1, new Complex64( 10.0, 11.0 ) );\n* var v = arr.get( 1 );\n* // returns <Complex64>\n*\n* var re = realf( v );\n* // returns 10.0\n*\n* var im = imagf( v );\n* // returns 11.0\n*/\nfunction setComplex64( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n/**\n* Sets an element in an array-like object supporting the get/set protocol.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* function get( idx ) {\n*    return arr[ idx ];\n* }\n*\n* function set( value, idx ) {\n*    arr[ idx ] = value;\n* }\n*\n* arr.get = get;\n* arr.set = set;\n*\n* setArrayLike( arr, 2, 10 );\n*\n* var v = arr[ 2 ];\n* // returns 10\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an array-like object supporting the get/set protocol.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n* var Complex64 = require( '@stdlib/complex/float32' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n* var dtype = require( '@stdlib/array/dtype' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 1, new Complex64( 10.0, 11.0 ) );\n*\n* var v = arr.get( 1 );\n* // returns <Complex64>\n*\n* var re = realf( v );\n* // returns 10.0\n*\n* var im = imagf( v );\n* // returns 11.0\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nmodule.exports = setter;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for setting an element in an array-like object supporting the get/set protocol.\n*\n* @module @stdlib/array/base/accessor-setter\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n* var Complex64 = require( '@stdlib/complex/float32' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n* var dtype = require( '@stdlib/array/dtype' );\n* var setter = require( '@stdlib/array/base/accessor-setter' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 1, new Complex64( 10.0, 11.0 ) );\n*\n* var v = arr.get( 1 );\n* // returns <Complex64>\n*\n* var re = realf( v );\n* // returns 10.0\n*\n* var im = imagf( v );\n* // returns 11.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Mapping from array constructors to data types...\nvar ctor2dtypes = {\n\t'Float32Array': 'float32',\n\t'Float64Array': 'float64',\n\t'Array': 'generic',\n\t'Int16Array': 'int16',\n\t'Int32Array': 'int32',\n\t'Int8Array': 'int8',\n\t'Uint16Array': 'uint16',\n\t'Uint32Array': 'uint32',\n\t'Uint8Array': 'uint8',\n\t'Uint8ClampedArray': 'uint8c',\n\t'Complex64Array': 'complex64',\n\t'Complex128Array': 'complex128'\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctor2dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float64Array === 'function' ) ? Float64Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of double-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of double-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array/float64\n*\n* @example\n* var ctor = require( '@stdlib/array/float64' );\n*\n* var arr = new ctor( 10 );\n* // returns <Float64Array>\n*/\n\n// MODULES //\n\nvar hasFloat64ArraySupport = require( '@stdlib/assert/has-float64array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat64ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float32Array === 'function' ) ? Float32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of single-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of single-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array/float32\n*\n* @example\n* var ctor = require( '@stdlib/array/float32' );\n*\n* var arr = new ctor( 10 );\n* // returns <Float32Array>\n*/\n\n// MODULES //\n\nvar hasFloat32ArraySupport = require( '@stdlib/assert/has-float32array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint32Array === 'function' ) ? Uint32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 32-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 32-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array/uint32\n*\n* @example\n* var ctor = require( '@stdlib/array/uint32' );\n*\n* var arr = new ctor( 10 );\n* // returns <Uint32Array>\n*/\n\n// MODULES //\n\nvar hasUint32ArraySupport = require( '@stdlib/assert/has-uint32array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int32Array === 'function' ) ? Int32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array/int32\n*\n* @example\n* var ctor = require( '@stdlib/array/int32' );\n*\n* var arr = new ctor( 10 );\n* // returns <Int32Array>\n*/\n\n// MODULES //\n\nvar hasInt32ArraySupport = require( '@stdlib/assert/has-int32array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint16Array === 'function' ) ? Uint16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 16-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 16-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array/uint16\n*\n* @example\n* var ctor = require( '@stdlib/array/uint16' );\n*\n* var arr = new ctor( 10 );\n* // returns <Uint16Array>\n*/\n\n// MODULES //\n\nvar hasUint16ArraySupport = require( '@stdlib/assert/has-uint16array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int16Array === 'function' ) ? Int16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array/int16\n*\n* @example\n* var ctor = require( '@stdlib/array/int16' );\n*\n* var arr = new ctor( 10 );\n* // returns <Int16Array>\n*/\n\n// MODULES //\n\nvar hasInt16ArraySupport = require( '@stdlib/assert/has-int16array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8Array === 'function' ) ? Uint8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array/uint8\n*\n* @example\n* var ctor = require( '@stdlib/array/uint8' );\n*\n* var arr = new ctor( 10 );\n* // returns <Uint8Array>\n*/\n\n// MODULES //\n\nvar hasUint8ArraySupport = require( '@stdlib/assert/has-uint8array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @module @stdlib/array/uint8c\n*\n* @example\n* var ctor = require( '@stdlib/array/uint8c' );\n*\n* var arr = new ctor( 10 );\n* // returns <Uint8ClampedArray>\n*/\n\n// MODULES //\n\nvar hasUint8ClampedArraySupport = require( '@stdlib/assert/has-uint8clampedarray-support' ); // eslint-disable-line id-length\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ClampedArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int8Array === 'function' ) ? Int8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array/int8\n*\n* @example\n* var ctor = require( '@stdlib/array/int8' );\n*\n* var arr = new ctor( 10 );\n* // returns <Int8Array>\n*/\n\n// MODULES //\n\nvar hasInt8ArraySupport = require( '@stdlib/assert/has-int8array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = 8; // 4 bytes per float32 x (1 real + 1 imag component)\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `Complex64Array`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `Complex64Array`\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n*\n* var bool = isComplex64Array( new Complex64Array( 10 ) );\n* // returns true\n*\n* bool = isComplex64Array( [] );\n* // returns false\n*/\nfunction isComplex64Array( value ) {\n\t// Note: the following is not robust and that is intentional. In this case, we are seeking a lower cost way to reasonably determine whether an input value is a `Complex64Array` in order to avoid walking the prototype chain and resolving constructors, which is necessary for robust identification of cross-realm instances. For more robust validation, see `@stdlib/assert/is-complex64array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'Complex64Array' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isComplex64Array;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a `Complex64Array`.\n*\n* @module @stdlib/array/base/assert/is-complex64array\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n* var isComplex64Array = require( '@stdlib/array/base/assert/is-complex64array' );\n*\n* var bool = isComplex64Array( new Complex64Array( 10 ) );\n* // returns true\n*\n* bool = isComplex64Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = 16; // 8 bytes per float64 x (1 real + 1 imag component)\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `Complex128Array`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `Complex128Array`\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n*\n* var bool = isComplex128Array( new Complex128Array( 10 ) );\n* // returns true\n*\n* bool = isComplex128Array( [] );\n* // returns false\n*/\nfunction isComplex128Array( value ) {\n\t// Note: the following is not robust and that is intentional. In this case, we are seeking a lower cost way to reasonably determine whether an input value is a `Complex128Array` in order to avoid walking the prototype chain and resolving constructors, which is necessary for robust identification of cross-realm instances. For more robust validation, see `@stdlib/assert/is-complex128array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'Complex128Array' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isComplex128Array;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a `Complex128Array`.\n*\n* @module @stdlib/array/base/assert/is-complex128array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n* var isComplex128Array = require( '@stdlib/array/base/assert/is-complex128array' );\n*\n* var bool = isComplex128Array( new Complex128Array( 10 ) );\n* // returns true\n*\n* bool = isComplex128Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert/is-array-like-object' );\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar realf = require( '@stdlib/complex/realf' );\nvar imagf = require( '@stdlib/complex/imagf' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tz = v.value;\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( realf( z ), imagf( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromIterator;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert/is-array-like-object' );\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar realf = require( '@stdlib/complex/realf' );\nvar imagf = require( '@stdlib/complex/imagf' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tz = clbk.call( thisArg, v.value, i );\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( realf( z ), imagf( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromIteratorMap;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar realf = require( '@stdlib/complex/realf' );\nvar imagf = require( '@stdlib/complex/imagf' );\n\n\n// MAIN //\n\n/**\n* Returns a strided array of real and imaginary components.\n*\n* @private\n* @param {Float32Array} buf - output array\n* @param {Array} arr - array containing complex numbers\n* @returns {(Float32Array|null)} output array or null\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tlen = arr.length;\n\tj = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = arr[ i ];\n\t\tif ( !isComplexLike( v ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf[ j ] = realf( v );\n\t\tbuf[ j+1 ] = imagf( v );\n\t\tj += 2; // stride\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromArray;\n", "/* eslint-disable no-restricted-syntax, max-lines, no-invalid-this */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar isArrayLikeObject = require( '@stdlib/assert/is-array-like-object' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isArrayBuffer = require( '@stdlib/assert/is-arraybuffer' );\nvar isObject = require( '@stdlib/assert/is-object' );\nvar isArray = require( '@stdlib/assert/is-array' );\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar isEven = require( '@stdlib/math/base/assert/is-even' );\nvar isInteger = require( '@stdlib/math/base/assert/is-integer' );\nvar isComplex64Array = require( './../../base/assert/is-complex64array' );\nvar isComplex128Array = require( './../../base/assert/is-complex128array' );\nvar hasIteratorSymbolSupport = require( '@stdlib/assert/has-iterator-symbol-support' );\nvar ITERATOR_SYMBOL = require( '@stdlib/symbol/iterator' );\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils/define-nonenumerable-read-only-accessor' );\nvar Float32Array = require( './../../float32' );\nvar Complex64 = require( '@stdlib/complex/float32' );\nvar format = require( '@stdlib/string/format' );\nvar realf = require( '@stdlib/complex/realf' );\nvar imagf = require( '@stdlib/complex/imagf' );\nvar floor = require( '@stdlib/math/base/special/floor' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar getter = require( './../../base/getter' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar fromIterator = require( './from_iterator.js' );\nvar fromIteratorMap = require( './from_iterator_map.js' );\nvar fromArray = require( './from_array.js' );\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Float32Array.BYTES_PER_ELEMENT * 2;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a complex typed array.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*/\nfunction isComplexArray( value ) {\n\treturn (\n\t\tvalue instanceof Complex64Array ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' ||\n\t\t\t\tvalue.constructor.name === 'Complex128Array'\n\t\t\t) &&\n\t\t\ttypeof value._length === 'number' && // eslint-disable-line no-underscore-dangle\n\n\t\t\t// NOTE: we don't perform a more rigorous test here for a typed array for performance reasons, as robustly checking for a typed array instance could require walking the prototype tree and performing relatively expensive constructor checks...\n\t\t\ttypeof value._buffer === 'object' // eslint-disable-line no-underscore-dangle\n\t\t)\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a complex typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array constructor\n*/\nfunction isComplexArrayConstructor( value ) {\n\treturn (\n\t\tvalue === Complex64Array ||\n\n\t\t// NOTE: weaker test in order to avoid a circular dependency with Complex128Array...\n\t\tvalue.name === 'Complex128Array'\n\t);\n}\n\n/**\n* Retrieves a complex number from a complex number array buffer.\n*\n* @private\n* @param {Float32Array} buf - array buffer\n* @param {NonNegativeInteger} idx - element index\n* @returns {Complex64} complex number\n*/\nfunction getComplex64( buf, idx ) {\n\tidx *= 2;\n\treturn new Complex64( buf[ idx ], buf[ idx+1 ] );\n}\n\n\n// MAIN //\n\n/**\n* 64-bit complex number array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {RangeError} ArrayBuffer byte length must be a multiple of `8`\n* @throws {RangeError} array-like object and typed array input arguments must have a length which is a multiple of two\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} byte offset must be a multiple of `8`\n* @throws {TypeError} view length must be a positive multiple of `8`\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var arr = new Complex64Array();\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex64Array( 2 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex64Array( [ 1.0, -1.0 ] );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf, 8 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex64Array( buf, 8, 2 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction Complex64Array() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof Complex64Array) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new Complex64Array();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new Complex64Array( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new Complex64Array( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new Complex64Array( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Float32Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\tif ( isNonNegativeInteger( arguments[0] ) ) {\n\t\t\tbuf = new Float32Array( arguments[0]*2 );\n\t\t} else if ( isCollection( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tlen = buf.length;\n\n\t\t\t// If provided a \"generic\" array, peak at the first value, and, if the value is a complex number, try to process as an array of complex numbers, falling back to \"normal\" typed array initialization if we fail and ensuring consistency if the first value had not been a complex number...\n\t\t\tif ( len && isArray( buf ) && isComplexLike( buf[0] ) ) {\n\t\t\t\tbuf = fromArray( new Float32Array( len*2 ), buf );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\t// We failed and we are now forced to allocate a new array :-(\n\t\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t\t}\n\t\t\t\t\t// We failed, so fall back to directly setting values...\n\t\t\t\t\tbuf = new Float32Array( arguments[0] );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ( isComplex64Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret64( buf, 0 );\n\t\t\t\t} else if ( isComplex128Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret128( buf, 0 );\n\t\t\t\t} else if ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tbuf = new Float32Array( buf );\n\t\t\t}\n\t\t} else if ( isArrayBuffer( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isInteger( buf.byteLength/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf );\n\t\t} else if ( isObject( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tif ( !isFunction( buf[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = buf[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) ); // FIXME: `buf` is what is returned from above, NOT the original value\n\t\t\t}\n\t\t\tbuf = fromIterator( buf );\n\t\t\tif ( buf instanceof Error ) {\n\t\t\t\tthrow buf;\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arguments[0] ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Byte offset must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tlen = buf.byteLength - byteOffset;\n\t\t\tif ( !isInteger( len/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, len ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf, byteOffset, len*2 );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length/2 );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64Array\n* @readonly\n* @type {PositiveInteger}\n* @default 8\n*\n* @example\n* var nbytes = Complex64Array.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex64Array, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex64Array\n* @readonly\n* @type {string}\n* @default 'Complex64Array'\n*\n* @example\n* var str = Complex64Array.name;\n* // returns 'Complex64Array'\n*/\nsetReadOnly( Complex64Array, 'name', 'Complex64Array' );\n\n/**\n* Creates a new 64-bit complex number array from an array-like object or an iterable.\n*\n* @name from\n* @memberof Complex64Array\n* @type {Function}\n* @param {(Collection|Iterable)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @throws {TypeError} when provided an iterator, a callback must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex64Array} 64-bit complex number array\n*\n* @example\n* var arr = Complex64Array.from( [ 1.0, -1.0 ] );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* var arr = Complex64Array.from( [ new Complex64( 1.0, 1.0 ) ] );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* function clbk( v ) {\n*     return new Complex64( realf(v)*2.0, imagf(v)*2.0 );\n* }\n*\n* var arr = Complex64Array.from( [ new Complex64( 1.0, 1.0 ) ], clbk );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 1\n*/\nsetReadOnly( Complex64Array, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar flg;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isComplexArray( src ) ) {\n\t\tlen = src.length;\n\t\tif ( clbk ) {\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, src.get( i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = realf( v );\n\t\t\t\t\tbuf[ j+1 ] = imagf( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\t// Note: array contents affect how we iterate over a provided data source. If only complex number objects, we can extract real and imaginary components. Otherwise, for non-complex number arrays (e.g., `Float64Array`, etc), we assume a strided array where real and imaginary components are interleaved. In the former case, we expect a callback to return real and imaginary components (possibly as a complex number). In the latter case, we expect a callback to return *either* a real or imaginary component.\n\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\t// Detect whether we've been provided an array which returns complex number objects...\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( !isComplexLike( get( src, i ) ) ) {\n\t\t\t\t\tflg = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If an array does not contain only complex number objects, then we assume interleaved real and imaginary components...\n\t\t\tif ( flg ) {\n\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. First argument must have a length which is a multiple of %u. Length: `%u`.', 2, len ) );\n\t\t\t\t}\n\t\t\t\tout = new this( len/2 );\n\t\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\t\tbuf[ i ] = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// If an array contains only complex number objects, then we need to extract real and imaginary components...\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = realf( v );\n\t\t\t\t\tbuf[ j+1 ] = imagf( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tif ( tmp instanceof Error ) {\n\t\t\tthrow tmp;\n\t\t}\n\t\tlen = tmp.length / 2;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new 64-bit complex number array from a variable number of arguments.\n*\n* @name of\n* @memberof Complex64Array\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} 64-bit complex number array\n*\n* @example\n* var arr = Complex64Array.of( 1.0, 1.0, 1.0, 1.0 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( Complex64Array, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide an integer\n* @returns {(Complex64|void)} array element\n*\n* @example\n* var arr = new Complex64Array( 10 );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var z = arr.at( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 9.0, -9.0 ], 9 );\n*\n* z = arr.at( 0 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*\n* z = arr.at( -1 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 9.0\n*\n* im = imagf( z );\n* // returns -9.0\n*\n* z = arr.at( 100 );\n* // returns undefined\n*\n* z = arr.at( -100 );\n* // returns undefined\n*/\nsetReadOnly( Complex64Array.prototype, 'at', function at( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx < 0 ) {\n\t\tidx += this._length;\n\t}\n\tif ( idx < 0 || idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex64( this._buffer, idx );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var buf = arr.buffer;\n* // returns <ArrayBuffer>\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 80\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 8\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex64Array.prototype, 'BYTES_PER_ELEMENT', Complex64Array.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} modified array\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( 4 );\n*\n* // Set the array elements:\n* arr.set( new Complex64( 1.0, 1.0 ), 0 );\n* arr.set( new Complex64( 2.0, 2.0 ), 1 );\n* arr.set( new Complex64( 3.0, 3.0 ), 2 );\n* arr.set( new Complex64( 4.0, 4.0 ), 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* // Get the last array element:\n* var z = arr.get( 3 );\n*\n* var re = realf( z );\n* // returns 2.0\n*\n* var im = imagf( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex64Array.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target*2, start*2 );\n\t} else {\n\t\tthis._buffer.copyWithin( target*2, start*2, arguments[2]*2 );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* var arr = [\n*     new Complex64( 1.0, 1.0 ),\n*     new Complex64( 2.0, 2.0 ),\n*     new Complex64( 3.0, 3.0 )\n* ];\n* arr = new Complex64Array( arr );\n*\n* // Create an iterator:\n* var it = arr.entries();\n*\n* // Iterate over the key-value pairs...\n* var v = it.next().value;\n* // returns [ 0, <Complex64> ]\n*\n* v = it.next().value;\n* // returns [ 1, <Complex64> ]\n*\n* v = it.next().value;\n* // returns [ 2, <Complex64> ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'entries', function entries() {\n\tvar buffer;\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuffer = this._buffer;\n\tlen = this._length;\n\n\t// Initialize the iteration indices:\n\ti = -1;\n\tj = -2;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\tvar z;\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tj += 2;\n\t\tz = new Complex64( buffer[ j ], buffer[ j+1 ] );\n\t\treturn {\n\t\t\t'value': [ i, z ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* function predicate( v ) {\n*     return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, getComplex64( buf, i ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.fill( new Complex64( 1.0, 1.0 ), 1 );\n*\n* var z = arr.get( 1 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns 1.0\n*\n* z = arr.get( 1 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tre = realf( value );\n\tim = imagf( value );\n\tfor ( i = start; i < end; i++ ) {\n\t\tidx = 2*i;\n\t\tbuf[ idx ] = re;\n\t\tbuf[ idx+1 ] = im;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* function predicate( v ) {\n*     return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.filter( predicate );\n* // returns <Complex64Array>\n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 2.0\n*\n* var im = imagf( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex64Array.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\tout.push( z );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex64|void)} array element or undefined\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* function predicate( v ) {\n*     return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.find( predicate );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* function predicate( v ) {\n*     return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var idx = arr.findIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( Complex64Array.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex64|void)} array element or undefined\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* function predicate( v ) {\n*     return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.findLast( predicate );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* function predicate( v ) {\n*     return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var idx = arr.findLastIndex( predicate );\n* // returns 1\n*/\nsetReadOnly( Complex64Array.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* function log( v, i ) {\n*     console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( Complex64Array.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tfcn.call( thisArg, z, i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(Complex64|void)} array element\n*\n* @example\n* var arr = new Complex64Array( 10 );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var z = arr.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*\n* z = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( Complex64Array.prototype, 'get', function get( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex64( this._buffer, idx );\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a provided value\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var bool = arr.includes( new Complex64( 3.0, -3.0 ) );\n* // returns true\n*\n* bool = arr.includes( new Complex64( 3.0, -3.0 ), 3 );\n* // returns false\n*\n* bool = arr.includes( new Complex64( 4.0, -4.0 ), -3 );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* var arr = new Complex64Array( 10 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var idx = arr.indexOf( new Complex64( 3.0, -3.0 ) );\n* // returns 2\n*\n* idx = arr.indexOf( new Complex64( 3.0, -3.0 ), 3 );\n* // returns -1\n*\n* idx = arr.indexOf( new Complex64( 4.0, -4.0 ), -3 );\n* // returns -1\n*/\nsetReadOnly( Complex64Array.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.join();\n* // returns '1 + 1i,2 + 2i'\n*\n* str = arr.join( '/' );\n* // returns '1 + 1i/2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'join', function join( separator ) {\n\tvar out;\n\tvar buf;\n\tvar sep;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tsep = ',';\n\t} else if ( isString( separator ) ) {\n\t\tsep = separator;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toString() );\n\t}\n\treturn out.join( sep );\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex] - index at which to start searching backward (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 3.0, -3.0 ], 4 );\n*\n* var idx = arr.lastIndexOf( new Complex64( 3.0, -3.0 ) );\n* // returns 4\n*\n* idx = arr.lastIndexOf( new Complex64( 3.0, -3.0 ), 3 );\n* // returns 2\n*\n* idx = arr.lastIndexOf( new Complex64( 5.0, -5.0 ), 3 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( new Complex64( 2.0, -2.0 ), -3 );\n* // returns 1\n*/\nsetReadOnly( Complex64Array.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var Complex64 = require( '@stdlib/complex/float32' );\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* function scale( v, i ) {\n*     return new Complex64( 2.0*realf( v ), 2.0*imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.map( scale );\n* // returns <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 2\n*\n* var im = imagf( z );\n* // returns -2\n*/\nsetReadOnly( Complex64Array.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = fcn.call( thisArg, getComplex64( buf, i ), i, this );\n\t\tif ( isComplexLike( v ) ) {\n\t\t\toutbuf[ 2*i ] = realf( v );\n\t\t\toutbuf[ (2*i)+1 ] = imagf( v );\n\t\t} else if ( isArrayLikeObject( v ) && v.length === 2 ) {\n\t\t\toutbuf[ 2*i ] = v[ 0 ];\n\t\t\toutbuf[ (2*i)+1 ] = v[ 1 ];\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t}\n\t}\n\treturn out;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} reversed array\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.reverse();\n* // returns <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ (2*i) ];\n\t\tbuf[ (2*i) ] = buf[ (2*j) ];\n\t\tbuf[ (2*j) ] = tmp;\n\t\ttmp = buf[ (2*i)+1 ];\n\t\tbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t\tbuf[ (2*j)+1 ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* -   When provided a typed array, real or complex, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n*     ```text\n*     buf:                ---------------------\n*     src: ---------------------\n*     ```\n*\n*     In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n*     In the other overlapping scenario,\n*\n*     ```text\n*     buf: ---------------------\n*     src:                ---------------------\n*     ```\n*\n*     by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values, as intended.\n*\n* @name set\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be either a complex number, an array-like object, or a complex number array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( 10 );\n*\n* var z = arr.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'set', function set( value ) {\n\t/* eslint-disable no-underscore-dangle */\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar flg;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isComplexLike( value ) ) {\n\t\tif ( idx >= this._length ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t\t}\n\t\tidx *= 2;\n\t\tbuf[ idx ] = realf( value );\n\t\tbuf[ idx+1 ] = imagf( value );\n\t\treturn;\n\t}\n\tif ( isComplexArray( value ) ) {\n\t\tN = value._length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tsbuf = value._buffer;\n\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Float32Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tidx *= 2;\n\t\tj = 0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\tidx += 2; // stride\n\t\t\tj += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tif ( isCollection( value ) ) {\n\t\t// Detect whether we've been provided an array of complex numbers...\n\t\tN = value.length;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tif ( !isComplexLike( value[ i ] ) ) {\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// If an array does not contain only complex numbers, then we assume interleaved real and imaginary components...\n\t\tif ( flg ) {\n\t\t\tif ( !isEven( N ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', N ) );\n\t\t\t}\n\t\t\tif ( idx+(N/2) > this._length ) {\n\t\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t\t}\n\t\t\tsbuf = value;\n\n\t\t\t// Check for overlapping memory...\n\t\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t\t(\n\t\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = new Float32Array( N );\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp[ i ] = sbuf[ i ]; // TODO: handle accessor arrays\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t}\n\t\t\tidx *= 2;\n\t\t\tN /= 2;\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\t\tidx += 2; // stride\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// If an array contains only complex numbers, then we need to extract real and imaginary components...\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tidx *= 2;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tv = value[ i ];\n\t\t\tbuf[ idx ] = realf( v );\n\t\t\tbuf[ idx+1 ] = imagf( v );\n\t\t\tidx += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.', value ) );\n\n\t/* eslint-enable no-underscore-dangle */\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var out = arr.slice();\n* // returns <Complex64Array>\n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = out.get( len-1 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 5.0\n*\n* im = imagf( z );\n* // returns -5.0\n*\n* out = arr.slice( 1, -2 );\n* // returns <Complex64Array>\n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = out.get( len-1 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'slice', function slice( start, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar idx;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tstart = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( start < end ) {\n\t\toutlen = end - start;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\tidx = 2*(i+start);\n\t\toutbuf[ 2*i ] = buf[ idx ];\n\t\toutbuf[ (2*i)+1 ] = buf[ idx+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* function predicate( v ) {\n*     return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, getComplex64( buf, i ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} subarray\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var subarr = arr.subarray();\n* // returns <Complex64Array>\n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = subarr.get( len-1 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 5.0\n*\n* im = imagf( z );\n* // returns -5.0\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns <Complex64Array>\n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = subarr.get( len-1 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + (begin*BYTES_PER_ELEMENT);\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} reversed array\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.toReversed();\n* // returns <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns <Complex64>\n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = len - i - 1;\n\t\toutbuf[ (2*i) ] = buf[ (2*j) ];\n\t\toutbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toString() );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {ComplexLike} value - new value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a complex number\n* @returns {Complex64Array} new typed array\n*\n* @example\n* var realf = require( '@stdlib/complex/realf' );\n* var imagf = require( '@stdlib/complex/imagf' );\n* var Complex64 = require( '@stdlib/complex/float32' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.with( 0, new Complex64( 4.0, 4.0 ) );\n* // returns <Complex64Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex64>\n*\n* var re = realf( z );\n* // returns 4.0\n*\n* var im = imagf( z );\n* // returns 4.0\n*/\nsetReadOnly( Complex64Array.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tbuf[ 2*index ] = realf( value );\n\tbuf[ (2*index)+1 ] = imagf( value );\n\treturn out;\n});\n\n\n// EXPORTS //\n\nmodule.exports = Complex64Array;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* 64-bit complex number array.\n*\n* @module @stdlib/array/complex64\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n*\n* var arr = new Complex64Array();\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n*\n* var arr = new Complex64Array( 2 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var Complex64Array = require( '@stdlib/array/complex64' );\n*\n* var arr = new Complex64Array( [ 1.0, -1.0 ] );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var Complex64Array = require( '@stdlib/array/complex64' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var Complex64Array = require( '@stdlib/array/complex64' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf, 8 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var Complex64Array = require( '@stdlib/array/complex64' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex64Array( buf, 8, 2 );\n* // returns <Complex64Array>\n*\n* var len = arr.length;\n* // returns 2\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert/is-array-like-object' );\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar format = require( '@stdlib/string/format' );\nvar real = require( '@stdlib/complex/real' );\nvar imag = require( '@stdlib/complex/imag' );\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tz = v.value;\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( real( z ), imag( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromIterator;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert/is-array-like-object' );\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar format = require( '@stdlib/string/format' );\nvar real = require( '@stdlib/complex/real' );\nvar imag = require( '@stdlib/complex/imag' );\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tz = clbk.call( thisArg, v.value, i );\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( real( z ), imag( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromIteratorMap;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar real = require( '@stdlib/complex/real' );\nvar imag = require( '@stdlib/complex/imag' );\n\n\n// MAIN //\n\n/**\n* Returns a strided array of real and imaginary components.\n*\n* @private\n* @param {Float64Array} buf - output array\n* @param {Array} arr - array containing complex numbers\n* @returns {(Float64Array|null)} output array or null\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tlen = arr.length;\n\tj = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = arr[ i ];\n\t\tif ( !isComplexLike( v ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf[ j ] = real( v );\n\t\tbuf[ j+1 ] = imag( v );\n\t\tj += 2; // stride\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromArray;\n", "/* eslint-disable no-restricted-syntax, max-lines, no-invalid-this */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar isArrayLikeObject = require( '@stdlib/assert/is-array-like-object' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isArrayBuffer = require( '@stdlib/assert/is-arraybuffer' );\nvar isObject = require( '@stdlib/assert/is-object' );\nvar isArray = require( '@stdlib/assert/is-array' );\nvar isString = require( '@stdlib/assert/is-string' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar isEven = require( '@stdlib/math/base/assert/is-even' );\nvar isInteger = require( '@stdlib/math/base/assert/is-integer' );\nvar isComplex64Array = require( './../../base/assert/is-complex64array' );\nvar isComplex128Array = require( './../../base/assert/is-complex128array' );\nvar hasIteratorSymbolSupport = require( '@stdlib/assert/has-iterator-symbol-support' );\nvar ITERATOR_SYMBOL = require( '@stdlib/symbol/iterator' );\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils/define-nonenumerable-read-only-accessor' );\nvar Float64Array = require( './../../float64' );\nvar Complex128 = require( '@stdlib/complex/float64' );\nvar real = require( '@stdlib/complex/real' );\nvar imag = require( '@stdlib/complex/imag' );\nvar floor = require( '@stdlib/math/base/special/floor' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar getter = require( './../../base/getter' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar format = require( '@stdlib/string/format' );\nvar fromIterator = require( './from_iterator.js' );\nvar fromIteratorMap = require( './from_iterator_map.js' );\nvar fromArray = require( './from_array.js' );\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Float64Array.BYTES_PER_ELEMENT * 2;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a complex typed array.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*/\nfunction isComplexArray( value ) {\n\treturn (\n\t\tvalue instanceof Complex128Array ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' ||\n\t\t\t\tvalue.constructor.name === 'Complex128Array'\n\t\t\t) &&\n\t\t\ttypeof value._length === 'number' && // eslint-disable-line no-underscore-dangle\n\n\t\t\t// NOTE: we don't perform a more rigorous test here for a typed array for performance reasons, as robustly checking for a typed array instance could require walking the prototype tree and performing relatively expensive constructor checks...\n\t\t\ttypeof value._buffer === 'object' // eslint-disable-line no-underscore-dangle\n\t\t)\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a complex typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array constructor\n*/\nfunction isComplexArrayConstructor( value ) {\n\treturn (\n\t\tvalue === Complex128Array ||\n\n\t\t// NOTE: weaker test in order to avoid a circular dependency with Complex64Array...\n\t\tvalue.name === 'Complex64Array'\n\t);\n}\n\n/**\n* Retrieves a complex number from a complex number array buffer.\n*\n* @private\n* @param {Float64Array} buf - array buffer\n* @param {NonNegativeInteger} idx - element index\n* @returns {Complex128} complex number\n*/\nfunction getComplex128( buf, idx ) {\n\tidx *= 2;\n\treturn new Complex128( buf[ idx ], buf[ idx+1 ] );\n}\n\n\n// MAIN //\n\n/**\n* 128-bit complex number array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {RangeError} ArrayBuffer byte length must be a multiple of `16`\n* @throws {RangeError} array-like object and typed array input arguments must have a length which is a multiple of two\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} byte offset must be a multiple of `16`\n* @throws {TypeError} view length must be a positive multiple of `16`\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var arr = new Complex128Array();\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex128Array( 2 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex128Array( [ 1.0, -1.0 ] );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf, 16 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = new Complex128Array( buf, 16, 2 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction Complex128Array() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof Complex128Array) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new Complex128Array();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new Complex128Array( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new Complex128Array( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new Complex128Array( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Float64Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\tif ( isNonNegativeInteger( arguments[0] ) ) {\n\t\t\tbuf = new Float64Array( arguments[0]*2 );\n\t\t} else if ( isCollection( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tlen = buf.length;\n\n\t\t\t// If provided a \"generic\" array, peak at the first value, and, if the value is a complex number, try to process as an array of complex numbers, falling back to \"normal\" typed array initialization if we fail and ensuring consistency if the first value had not been a complex number...\n\t\t\tif ( len && isArray( buf ) && isComplexLike( buf[0] ) ) {\n\t\t\t\tbuf = fromArray( new Float64Array( len*2 ), buf );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\t// We failed and we are now forced to allocate a new array :-(\n\t\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t\t}\n\t\t\t\t\t// We failed, so fall back to directly setting values...\n\t\t\t\t\tbuf = new Float64Array( arguments[0] );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ( isComplex64Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret64( buf, 0 );\n\t\t\t\t} else if ( isComplex128Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret128( buf, 0 );\n\t\t\t\t} else if ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tbuf = new Float64Array( buf );\n\t\t\t}\n\t\t} else if ( isArrayBuffer( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isInteger( buf.byteLength/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf );\n\t\t} else if ( isObject( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tif ( !isFunction( buf[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = buf[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = fromIterator( buf );\n\t\t\tif ( buf instanceof Error ) {\n\t\t\t\tthrow buf;\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arguments[0] ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Byte offset must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tlen = buf.byteLength - byteOffset;\n\t\t\tif ( !isInteger( len/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, len ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf, byteOffset, len*2 );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length/2 );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128Array\n* @readonly\n* @type {PositiveInteger}\n* @default 16\n*\n* @example\n* var nbytes = Complex128Array.BYTES_PER_ELEMENT;\n* // returns 16\n*/\nsetReadOnly( Complex128Array, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex128Array\n* @readonly\n* @type {string}\n* @default 'Complex128Array'\n*\n* @example\n* var name = Complex128Array.name;\n* // returns 'Complex128Array'\n*/\nsetReadOnly( Complex128Array, 'name', 'Complex128Array' );\n\n/**\n* Creates a new 128-bit complex number array from an array-like object or an iterable.\n*\n* @name from\n* @memberof Complex128Array\n* @type {Function}\n* @param {(Collection|Object)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @throws {TypeError} when provided an iterator, a callback must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex128Array} 128-bit complex number array\n*\n* @example\n* var arr = Complex128Array.from( [ 1.0, -1.0 ] );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n*\n* var arr = Complex128Array.from( [ new Complex128( 1.0, 1.0 ) ] );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function clbk( v ) {\n*     return new Complex128( real(v)*2.0, imag(v)*2.0 );\n* }\n*\n* var arr = Complex128Array.from( [ new Complex128( 1.0, 1.0 ) ], clbk );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 1\n*/\nsetReadOnly( Complex128Array, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar flg;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isComplexArray( src ) ) {\n\t\tlen = src.length;\n\t\tif ( clbk ) {\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, src.get( i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = real( v );\n\t\t\t\t\tbuf[ j+1 ] = imag( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\t// Note: array contents affect how we iterate over a provided data source. If only complex number objects, we can extract real and imaginary components. Otherwise, for non-complex number arrays (e.g., `Float64Array`, etc), we assume a strided array where real and imaginary components are interleaved. In the former case, we expect a callback to return real and imaginary components (possibly as a complex number). In the latter case, we expect a callback to return *either* a real or imaginary component.\n\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\t// Detect whether we've been provided an array which returns complex number objects...\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( !isComplexLike( get( src, i ) ) ) {\n\t\t\t\t\tflg = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If an array does not contain only complex number objects, then we assume interleaved real and imaginary components...\n\t\t\tif ( flg ) {\n\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. First argument must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tout = new this( len/2 );\n\t\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\t\tbuf[ i ] = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// If an array contains only complex number objects, then we need to extract real and imaginary components...\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = real( v );\n\t\t\t\t\tbuf[ j+1 ] = imag( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tif ( tmp instanceof Error ) {\n\t\t\tthrow tmp;\n\t\t}\n\t\tlen = tmp.length / 2;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new 128-bit complex number array from a variable number of arguments.\n*\n* @name of\n* @memberof Complex128Array\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} 128-bit complex number array\n*\n* @example\n* var arr = Complex128Array.of( 1.0, 1.0, 1.0, 1.0 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( Complex128Array, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide an integer\n* @returns {(Complex128|void)} array element\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( 10 );\n*\n* var z = arr.at( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 9.0, -9.0 ], 9 );\n*\n* z = arr.at( 0 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*\n* z = arr.at( -1 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 9.0\n*\n* im = imag( z );\n* // returns -9.0\n*\n* z = arr.at( 100 );\n* // returns undefined\n*\n* z = arr.at( -100 );\n* // returns undefined\n*/\nsetReadOnly( Complex128Array.prototype, 'at', function at( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx < 0 ) {\n\t\tidx += this._length;\n\t}\n\tif ( idx < 0 || idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex128( this._buffer, idx );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var buf = arr.buffer;\n* // returns <ArrayBuffer>\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 160\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 16\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 16\n*/\nsetReadOnly( Complex128Array.prototype, 'BYTES_PER_ELEMENT', Complex128Array.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} modified array\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( 4 );\n*\n* // Set the array elements:\n* arr.set( new Complex128( 1.0, 1.0 ), 0 );\n* arr.set( new Complex128( 2.0, 2.0 ), 1 );\n* arr.set( new Complex128( 3.0, 3.0 ), 2 );\n* arr.set( new Complex128( 4.0, 4.0 ), 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* // Get the last array element:\n* var z = arr.get( 3 );\n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target*2, start*2 );\n\t} else {\n\t\tthis._buffer.copyWithin( target*2, start*2, arguments[2]*2 );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n*\n* var arr = [\n*     new Complex128( 1.0, 1.0 ),\n*     new Complex128( 2.0, 2.0 ),\n*     new Complex128( 3.0, 3.0 )\n* ];\n* arr = new Complex128Array( arr );\n*\n* // Create an iterator:\n* var it = arr.entries();\n*\n* // Iterate over the key-value pairs...\n* var v = it.next().value;\n* // returns [ 0, <Complex128> ]\n*\n* v = it.next().value;\n* // returns [ 1, <Complex128> ]\n*\n* v = it.next().value;\n* // returns [ 2, <Complex128> ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'entries', function entries() {\n\tvar buffer;\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuffer = this._buffer;\n\tlen = this._length;\n\n\t// Initialize the iteration indices:\n\ti = -1;\n\tj = -2;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\tvar z;\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tj += 2;\n\t\tz = new Complex128( buffer[ j ], buffer[ j+1 ] );\n\t\treturn {\n\t\t\t'value': [ i, z ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function predicate( v ) {\n*     return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, getComplex128( buf, i ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.fill( new Complex128( 1.0, 1.0 ), 1 );\n*\n* var z = arr.get( 1 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns 1.0\n*\n* z = arr.get( 1 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tre = real( value );\n\tim = imag( value );\n\tfor ( i = start; i < end; i++ ) {\n\t\tidx = 2*i;\n\t\tbuf[ idx ] = re;\n\t\tbuf[ idx+1 ] = im;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function predicate( v ) {\n*     return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.filter( predicate );\n* // returns <Complex128Array>\n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\tout.push( z );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex128|void)} array element or undefined\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function predicate( v ) {\n*     return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.find( predicate );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function predicate( v ) {\n*     return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var idx = arr.findIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( Complex128Array.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex128|void)} array element or undefined\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function predicate( v ) {\n*     return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.findLast( predicate );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function predicate( v ) {\n*     return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var idx = arr.findLastIndex( predicate );\n* // returns 1\n*/\nsetReadOnly( Complex128Array.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n*\n* function log( v, i ) {\n*     console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( Complex128Array.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tfcn.call( thisArg, z, i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(Complex128|void)} array element\n*\n* @example\n* var arr = new Complex128Array( 10 );\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var z = arr.get( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*\n* z = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( Complex128Array.prototype, 'get', function get( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex128( this._buffer, idx );\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a provided value\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var bool = arr.includes( new Complex128( 3.0, -3.0 ) );\n* // returns true\n*\n* bool = arr.includes( new Complex128( 3.0, -3.0 ), 3 );\n* // returns false\n*\n* bool = arr.includes( new Complex128( 4.0, -4.0 ), -3 );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var idx = arr.indexOf( new Complex128( 3.0, -3.0 ) );\n* // returns 2\n*\n* idx = arr.indexOf( new Complex128( 3.0, -3.0 ), 3 );\n* // returns -1\n*\n* idx = arr.indexOf( new Complex128( 4.0, -4.0 ), -3 );\n* // returns 3\n*/\nsetReadOnly( Complex128Array.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.join();\n* // returns '1 + 1i,2 + 2i'\n*\n* str = arr.join( '/' );\n* // returns '1 + 1i/2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'join', function join( separator ) {\n\tvar out;\n\tvar buf;\n\tvar sep;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tsep = ',';\n\t} else if ( isString( separator ) ) {\n\t\tsep = separator;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toString() );\n\t}\n\treturn out.join( sep );\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex] - index at which to start searching backward (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 3.0, -3.0 ], 4 );\n*\n* var idx = arr.lastIndexOf( new Complex128( 3.0, -3.0 ) );\n* // returns 4\n*\n* idx = arr.lastIndexOf( new Complex128( 3.0, -3.0 ), 3 );\n* // returns 2\n*\n* idx = arr.lastIndexOf( new Complex128( 5.0, -5.0 ), 3 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( new Complex128( 2.0, -2.0 ), -3 );\n* // returns 1\n*/\nsetReadOnly( Complex128Array.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var Complex128 = require( '@stdlib/complex/float64' );\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function scale( v, i ) {\n*     return new Complex128( 2.0*real( v ), 2.0*imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.map( scale );\n* // returns <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns -2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = fcn.call( thisArg, getComplex128( buf, i ), i, this );\n\t\tif ( isComplexLike( v ) ) {\n\t\t\toutbuf[ 2*i ] = real( v );\n\t\t\toutbuf[ (2*i)+1 ] = imag( v );\n\t\t} else if ( isArrayLikeObject( v ) && v.length === 2 ) {\n\t\t\toutbuf[ 2*i ] = v[ 0 ];\n\t\t\toutbuf[ (2*i)+1 ] = v[ 1 ];\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t}\n\t}\n\treturn out;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} reversed array\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.reverse();\n* // returns <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ (2*i) ];\n\t\tbuf[ (2*i) ] = buf[ (2*j) ];\n\t\tbuf[ (2*j) ] = tmp;\n\t\ttmp = buf[ (2*i)+1 ];\n\t\tbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t\tbuf[ (2*j)+1 ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* -   When provided a typed array, real or complex, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n*     ```text\n*     buf:                ---------------------\n*     src: ---------------------\n*     ```\n*\n*     In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n*     In the other overlapping scenario,\n*\n*     ```text\n*     buf: ---------------------\n*     src:                ---------------------\n*     ```\n*\n*     by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values as intended.\n*\n* @name set\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be either a complex number, an array-like object, or a complex number array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( 10 );\n*\n* var z = arr.get( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'set', function set( value ) {\n\t/* eslint-disable no-underscore-dangle */\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar flg;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isComplexLike( value ) ) {\n\t\tif ( idx >= this._length ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t\t}\n\t\tidx *= 2;\n\t\tbuf[ idx ] = real( value );\n\t\tbuf[ idx+1 ] = imag( value );\n\t\treturn;\n\t}\n\tif ( isComplexArray( value ) ) {\n\t\tN = value._length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tsbuf = value._buffer;\n\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Float64Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tidx *= 2;\n\t\tj = 0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\tidx += 2; // stride\n\t\t\tj += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tif ( isCollection( value ) ) {\n\t\t// Detect whether we've been provided an array of complex numbers...\n\t\tN = value.length;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tif ( !isComplexLike( value[ i ] ) ) {\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// If an array does not contain only complex numbers, then we assume interleaved real and imaginary components...\n\t\tif ( flg ) {\n\t\t\tif ( !isEven( N ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', N ) );\n\t\t\t}\n\t\t\tif ( idx+(N/2) > this._length ) {\n\t\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t\t}\n\t\t\tsbuf = value;\n\n\t\t\t// Check for overlapping memory...\n\t\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t\t(\n\t\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = new Float64Array( N );\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t}\n\t\t\tidx *= 2;\n\t\t\tN /= 2;\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\t\tidx += 2; // stride\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// If an array contains only complex numbers, then we need to extract real and imaginary components...\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tidx *= 2;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tv = value[ i ];\n\t\t\tbuf[ idx ] = real( v );\n\t\t\tbuf[ idx+1 ] = imag( v );\n\t\t\tidx += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.', value ) );\n\n\t/* eslint-enable no-underscore-dangle */\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* function predicate( v ) {\n*     return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, getComplex128( buf, i ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} subarray\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var subarr = arr.subarray();\n* // returns <Complex128Array>\n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = subarr.get( len-1 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 5.0\n*\n* im = imag( z );\n* // returns -5.0\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns <Complex128Array>\n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = subarr.get( len-1 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} reversed array\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.toReversed();\n* // returns <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns <Complex128>\n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = len - i - 1;\n\t\toutbuf[ (2*i) ] = buf[ (2*j) ];\n\t\toutbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toString() );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {ComplexLike} value - new value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a complex number\n* @returns {Complex128Array} new typed array\n*\n* @example\n* var real = require( '@stdlib/complex/real' );\n* var imag = require( '@stdlib/complex/imag' );\n* var Complex128 = require( '@stdlib/complex/float64' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.with( 0, new Complex128( 4.0, 4.0 ) );\n* // returns <Complex128Array>\n*\n* var z = out.get( 0 );\n* // returns <Complex128>\n*\n* var re = real( z );\n* // returns 4.0\n*\n* var im = imag( z );\n* // returns 4.0\n*/\nsetReadOnly( Complex128Array.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tbuf[ 2*index ] = real( value );\n\tbuf[ (2*index)+1 ] = imag( value );\n\treturn out;\n});\n\n\n// EXPORTS //\n\nmodule.exports = Complex128Array;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* 128-bit complex number array.\n*\n* @module @stdlib/array/complex128\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n*\n* var arr = new Complex128Array();\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n*\n* var arr = new Complex128Array( 2 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n*\n* var arr = new Complex128Array( [ 1.0, -1.0 ] );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var Complex128Array = require( '@stdlib/array/complex128' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var Complex128Array = require( '@stdlib/array/complex128' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf, 16 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var Complex128Array = require( '@stdlib/array/complex128' );\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = new Complex128Array( buf, 16, 2 );\n* // returns <Complex128Array>\n*\n* var len = arr.length;\n* // returns 2\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( './../../float64' );\nvar Float32Array = require( './../../float32' );\nvar Uint32Array = require( './../../uint32' );\nvar Int32Array = require( './../../int32' );\nvar Uint16Array = require( './../../uint16' );\nvar Int16Array = require( './../../int16' );\nvar Uint8Array = require( './../../uint8' );\nvar Uint8ClampedArray = require( './../../uint8c' );\nvar Int8Array = require( './../../int8' );\nvar Complex64Array = require( './../../complex64' );\nvar Complex128Array = require( './../../complex128' );\n\n\n// MAIN //\n\n// Note: order should match `dtypes` order\nvar CTORS = [\n\tFloat64Array,\n\tFloat32Array,\n\tInt32Array,\n\tUint32Array,\n\tInt16Array,\n\tUint16Array,\n\tInt8Array,\n\tUint8Array,\n\tUint8ClampedArray,\n\tComplex64Array,\n\tComplex128Array\n];\n\n\n// EXPORTS //\n\nmodule.exports = CTORS;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Note: order should match `ctors` order\nvar DTYPES = [\n\t'float64',\n\t'float32',\n\t'int32',\n\t'uint32',\n\t'int16',\n\t'uint16',\n\t'int8',\n\t'uint8',\n\t'uint8c',\n\t'complex64',\n\t'complex128'\n];\n\n\n// EXPORTS //\n\nmodule.exports = DTYPES;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isBuffer = require( '@stdlib/assert/is-buffer' );\nvar isArray = require( '@stdlib/assert/is-array' );\nvar constructorName = require( '@stdlib/utils/constructor-name' );\nvar ctor2dtype = require( './ctor2dtype.js' );\nvar CTORS = require( './ctors.js' );\nvar DTYPES = require( './dtypes.js' );\n\n\n// VARIABLES //\n\nvar NTYPES = DTYPES.length;\n\n\n// MAIN //\n\n/**\n* Returns the data type of an array.\n*\n* @param {*} value - input value\n* @returns {(string|null)} data type\n*\n* @example\n* var dt = dtype( [ 1, 2, 3 ] );\n* // returns 'generic'\n*\n* var dt = dtype( 'beep' );\n* // returns null\n*/\nfunction dtype( value ) {\n\tvar i;\n\tif ( isArray( value ) ) {\n\t\treturn 'generic';\n\t}\n\tif ( isBuffer( value ) ) {\n\t\treturn null;\n\t}\n\tfor ( i = 0; i < NTYPES; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn DTYPES[ i ];\n\t\t}\n\t}\n\t// If the above failed, fall back to a more robust (and significantly slower) means for resolving underlying data types:\n\treturn ctor2dtype[ constructorName( value ) ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtype;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the data type of an array.\n*\n* @module @stdlib/array/dtype\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var dtype = require( '@stdlib/array/dtype' );\n*\n* var arr = new Float64Array( 10 );\n*\n* var dt = dtype( arr );\n* // returns 'float64'\n*\n* dt = dtype( {} );\n* // returns null\n*\n* dt = dtype( 'beep' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isAccessorArray = require( './../../../base/assert/is-accessor-array' );\nvar getter = require( './../../../base/getter' );\nvar setter = require( './../../../base/setter' );\nvar accessorGetter = require( './../../../base/accessor-getter' );\nvar accessorSetter = require( './../../../base/accessor-setter' );\nvar dtype = require( './../../../dtype' );\n\n\n// MAIN //\n\n/**\n* Returns element accessors for a provided array-like object.\n*\n* ## Notes\n*\n* -   The returned object has the following properties:\n*\n*     -   **accessorProtocol**: `boolean` indicating whether the provided array-like object supports the get/set protocol (i.e., uses accessors for getting and setting elements).\n*     -   **accessors**: a two-element array whose first element is an accessor for retrieving an array element and whose second element is an accessor for setting an array element.\n*\n* @param {Collection} x - array-like object\n* @returns {Object} object containing accessor data\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n* var obj = accessors( x );\n* // returns {...}\n*\n* var bool = obj.accessorProtocol;\n* // returns false\n*\n* var fcns = obj.accessors;\n* // returns [ <Function>, <Function> ]\n*\n* var v = fcns[ 0 ]( x, 2 );\n* // returns 3\n*/\nfunction accessors( x ) {\n\tvar dt = dtype( x );\n\tif ( isAccessorArray( x ) ) {\n\t\treturn {\n\t\t\t'accessorProtocol': true,\n\t\t\t'accessors': [\n\t\t\t\taccessorGetter( dt ),\n\t\t\t\taccessorSetter( dt )\n\t\t\t]\n\t\t};\n\t}\n\treturn {\n\t\t'accessorProtocol': false,\n\t\t'accessors': [\n\t\t\tgetter( dt ),\n\t\t\tsetter( dt )\n\t\t]\n\t};\n}\n\n\n// EXPORTS //\n\nmodule.exports = accessors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return element accessors for a provided array-like object.\n*\n* @module @stdlib/array/base/accessors\n*\n* @example\n* var accessors = require( '@stdlib/array/base/accessors' );\n*\n* var x = [ 1, 2, 3, 4 ];\n* var obj = accessors( x );\n* // returns {...}\n*\n* var bool = obj.accessorProtocol;\n* // returns false\n*\n* var fcns = obj.accessors;\n* // returns [ <Function>, <Function> ]\n*\n* var v = fcns[ 0 ]( x, 2 );\n* // returns 3\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable no-restricted-syntax, no-invalid-this */\n\n'use strict';\n\n// MODULES //\n\nvar setReadWriteAccessor = require( '@stdlib/utils/define-nonenumerable-read-write-accessor' );\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar accessors = require( './../../../base/accessors' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar format = require( '@stdlib/string/format' );\n\n\n// FUNCTIONS //\n\n/**\n* Sets the length of an array-like object.\n*\n* @private\n* @param {NonNegativeInteger} len - length\n*/\nfunction setLength( len ) {\n\tthis._buffer.length = len;\n}\n\n/**\n* Returns the length of an array-like object.\n*\n* @private\n* @returns {NonNegativeInteger} length\n*/\nfunction getLength() {\n\treturn this._buffer.length;\n}\n\n\n// MAIN //\n\n/**\n* Creates a minimal array-like object supporting the accessor protocol from another array-like object.\n*\n* @constructor\n* @param {Collection} arr - input array\n* @throws {TypeError} must provide an array-like object\n* @returns {AccessorArray} accessor array instance\n*\n* @example\n* var arr = new AccessorArray( [ 1, 2, 3 ] );\n* // returns <AccessorArray>\n*\n* var v = arr.get( 0 );\n* // returns 1\n*/\nfunction AccessorArray( arr ) {\n\tvar o;\n\tif ( !(this instanceof AccessorArray) ) {\n\t\treturn new AccessorArray( arr );\n\t}\n\tif ( !isCollection( arr ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an array-like object. Value: `%s`.', arr ) );\n\t}\n\to = accessors( arr );\n\tthis._buffer = arr;\n\tthis._getter = o.accessors[ 0 ];\n\tthis._setter = o.accessors[ 1 ];\n\treturn this;\n}\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof AccessorArray\n* @readonly\n* @type {string}\n* @default 'AccessorArray'\n*\n* @example\n* var name = AccessorArray.name;\n* // returns 'AccessorArray'\n*/\nsetReadOnly( AccessorArray, 'name', 'AccessorArray' );\n\n/**\n* Read/write accessor for getting/setting the number of elements.\n*\n* @name length\n* @memberof AccessorArray.prototype\n* @type {NonNegativeInteger}\n*/\nsetReadWriteAccessor( AccessorArray.prototype, 'length', getLength, setLength );\n\n/**\n* Returns an element.\n*\n* @name get\n* @memberof AccessorArray.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @returns {*} element\n*\n* @example\n* var arr = new AccessorArray( [ 1, 2, 3 ] );\n* // returns <AccessorArray>\n*\n* var v = arr.get( 0 );\n* // returns 1\n*/\nsetReadOnly( AccessorArray.prototype, 'get', function get( idx ) {\n\treturn this._getter( this._buffer, idx );\n});\n\n/**\n* Sets one or more elements.\n*\n* @name set\n* @memberof AccessorArray.prototype\n* @type {Function}\n* @param {*} value - value to set\n* @param {integer} [idx] - element index\n* @returns {void}\n*\n* @example\n* var arr = new AccessorArray( [ 1, 2, 3 ] );\n* // returns <AccessorArray>\n*\n* var v = arr.get( 0 );\n* // returns 1\n*\n* arr.set( 5, 0 );\n*\n* v = arr.get( 0 );\n* // returns 5\n*/\nsetReadOnly( AccessorArray.prototype, 'set', function set( value, idx ) {\n\tif ( arguments.length < 2 ) {\n\t\tthis._setter( this._buffer, 0, value );\n\t\treturn;\n\t}\n\tthis._setter( this._buffer, idx, value );\n});\n\n\n// EXPORTS //\n\nmodule.exports = AccessorArray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a minimal array-like object supporting the accessor protocol from another array-like object.\n*\n* @module @stdlib/array/base/accessor\n*\n* @example\n* var AccessorArray = require( '@stdlib/array/base/accessor' );\n*\n* var arr = new AccessorArray( [ 1, 2, 3 ] );\n* // returns <AccessorArray>\n*\n* var v = arr.get( 0 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar accessors = require( './../../../base/accessors' );\n\n\n// MAIN //\n\n/**\n* Converts an array-like to an object likely to have the same \"shape\".\n*\n* ## Notes\n*\n* -   This function is intended as a potential performance optimization. In V8, for example, even if two objects share common properties, if those properties were added in different orders or if one object has additional properties not shared by the other object, then those objects will have different \"hidden\" classes. If a function is provided many objects having different \"shapes\", some JavaScript VMs (e.g., V8) will consider the function \"megamorphic\" and fail to perform various runtime optimizations. Accordingly, the intent of this function is to standardize the \"shape\" of the object holding array meta data to ensure that internal functions operating on arrays are provided consistent argument \"shapes\".\n*\n* -   The returned object has the following properties:\n*\n*     -   **data**: reference to the input array.\n*     -   **accessorProtocol**: `boolean` indicating whether the input array uses accessors for getting and setting elements.\n*     -   **accessors**: a two-element array whose first element is an accessor for retrieving an array element and whose second element is an accessor for setting an array element.\n*\n* @param {Collection} x - array-like object\n* @returns {Object} object containing array meta data\n*\n* @example\n* var obj = arraylike2object( [ 1, 2, 3, 4 ] );\n* // returns {...}\n*/\nfunction arraylike2object( x ) {\n\tvar o = accessors( x );\n\treturn {\n\t\t'data': x,\n\t\t'accessorProtocol': o.accessorProtocol,\n\t\t'accessors': o.accessors\n\t};\n}\n\n\n// EXPORTS //\n\nmodule.exports = arraylike2object;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert an array-like object to an object likely to have the same \"shape\".\n*\n* @module @stdlib/array/base/arraylike2object\n*\n* @example\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var obj = arraylike2object( [ 1, 2, 3, 4 ] );\n* // returns {...}\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplex128Array = require( './../../../base/assert/is-complex128array' );\nvar isComplex64Array = require( './../../../base/assert/is-complex64array' );\nvar arraylike2object = require( './../../../base/arraylike2object' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether at least one element in an array is truthy.\n*\n* @private\n* @param {Collection} x - input array\n* @returns {boolean} boolean indicating whether at least one element is truthy\n*\n* @example\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = internal( x );\n* // returns true\n*\n* @example\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = internal( x );\n* // returns false\n*/\nfunction internal( x ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( x[ i ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n/**\n* Tests whether at least one element in an array is truthy.\n*\n* @private\n* @param {Object} x - input array object\n* @returns {boolean} boolean indicating whether at least one element is truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 1, 0 ] ) );\n*\n* var out = accessors( x );\n* // returns true\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 0, 0 ] ) );\n*\n* var out = accessors( x );\n* // returns false\n*/\nfunction accessors( x ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tif ( get( data, i ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether at least one element in an array is truthy.\n*\n* @param {Collection} x - input array\n* @returns {boolean} boolean indicating whether at least one element is truthy\n*\n* @example\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = any( x );\n* // returns true\n*\n* @example\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = any( x );\n* // returns false\n*/\nfunction any( x ) {\n\tvar obj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\t// If provided a complex number array, reinterpret as a real typed array and test interleaved real and imaginary components, where we consider a complex number to be truthy if at least one component is non-zero...\n\t\tif ( isComplex128Array( x ) ) {\n\t\t\treturn internal( reinterpret128( x, 0 ) );\n\t\t}\n\t\tif ( isComplex64Array( x ) ) {\n\t\t\treturn internal( reinterpret64( x, 0 ) );\n\t\t}\n\t\treturn accessors( obj );\n\t}\n\treturn internal( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = any;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether at least one element in an array is truthy.\n*\n* @module @stdlib/array/base/any\n*\n* @example\n* var any = require( '@stdlib/array/base/any' );\n*\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = any( x );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'some' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = internal( x, isPositive );\n* // returns true\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( predicate.call( thisArg, x[ i ], i, x ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 1, 0 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns true\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tif ( predicate.call( thisArg, get( data, i ), i, data ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = anyBy( x, isPositive );\n* // returns true\n*/\nfunction anyBy( x, predicate, thisArg ) {\n\tvar obj;\n\tif ( hasMethod( x, 'some' ) ) {\n\t\treturn x.some( predicate, thisArg );\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = anyBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @module @stdlib/array/base/any-by\n*\n* @example\n* var anyBy = require( '@stdlib/array/base/any-by' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = anyBy( x, isPositive );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = internal( x, isPositive );\n* // returns true\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar i;\n\tfor ( i = x.length-1; i >= 0; i-- ) {\n\t\tif ( predicate.call( thisArg, x[ i ], i, x ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 1, 0 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns true\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = data.length-1; i >= 0; i-- ) {\n\t\tif ( predicate.call( thisArg, get( data, i ), i, data ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function, while iterating from right to left.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = anyByRight( x, isPositive );\n* // returns true\n*/\nfunction anyByRight( x, predicate, thisArg ) {\n\tvar obj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = anyByRight;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether at least one element in an array passes a test implemented by a predicate function, while iterating from right to left.\n*\n* @module @stdlib/array/base/any-by-right\n*\n* @example\n* var anyByRight = require( '@stdlib/array/base/any-by-right' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 1, 0 ];\n*\n* var out = anyByRight( x, isPositive );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isAccessorArray = require( './../../../../base/assert/is-accessor-array' );\nvar accessorGetter = require( './../../../../base/accessor-getter' );\nvar getter = require( './../../../../base/getter' );\nvar dtype = require( './../../../../dtype' );\n\n\n// MAIN //\n\n/**\n* Tests if an array contains a provided search value.\n*\n* @param {Collection} x - input array\n* @param {*} value - search value\n* @returns {boolean} boolean indicating if an array contains a search value\n*\n* @example\n* var out = contains( [ 1, 2, 3 ], 2 );\n* // returns true\n*/\nfunction contains( x, value ) {\n\tvar len;\n\tvar get;\n\tvar dt;\n\tvar i;\n\n\t// Resolve the input array data type:\n\tdt = dtype( x );\n\n\t// Resolve an accessor for retrieving input array elements:\n\tif ( isAccessorArray( x ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\t// Get the number of elements over which to iterate:\n\tlen = x.length;\n\n\t// Loop over the elements...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tif ( get( x, i ) === value ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = contains;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isAccessorArray = require( './../../../../base/assert/is-accessor-array' );\nvar accessorGetter = require( './../../../../base/accessor-getter' );\nvar dtype = require( './../../../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns a function to tests if an array contains a provided search value.\n*\n* @param {Collection} x - input array\n* @throws {TypeError} must provide an array-like object\n* @returns {Function} function to test if an array contains a search value\n*\n* @example\n* var contains = factory( [ 1, 2, 3 ] );\n* // returns <Function>\n*\n* var bool = contains( 2 );\n* // returns true\n*/\nfunction factory( x ) {\n\tvar get;\n\tvar len;\n\tvar dt;\n\n\tif ( !isCollection( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an array-like object. Value: `%s`.', x ) );\n\t}\n\t// Resolve the input array data type:\n\tdt = dtype( x );\n\n\t// Resolve an accessor for retrieving input array elements:\n\tif ( isAccessorArray( x ) ) {\n\t\tget = accessorGetter( dt );\n\t}\n\t// Get the number of elements over which to iterate:\n\tlen = x.length;\n\n\treturn ( get === void 0 ) ? contains : accessors;\n\t/**\n\t* Tests if an array contains a provided search value.\n\t*\n\t* @private\n\t* @param {*} value - search value\n\t* @returns {boolean} boolean indicating if an array contains a search value\n\t*\n\t* @example\n\t* var out = contains( [ 1, 2, 3 ], 2 );\n\t* // returns true\n\t*/\n\tfunction contains( value ) {\n\t\tvar i;\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( x[ i ] === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\t/**\n\t* Tests if an array contains a provided search value.\n\t*\n\t* @private\n\t* @param {*} value - search value\n\t* @returns {boolean} boolean indicating if an array contains a search value\n\t*/\n\tfunction accessors( value ) {\n\t\tvar i;\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( get( x, i ) === value ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = factory;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if an array contains a provided search value.\n*\n* @module @stdlib/array/base/assert/contains\n*\n* @example\n* var contains = require( '@stdlib/array/base/assert/contains' );\n*\n* var out = contains( [ 1, 2, 3 ], 2 );\n* // returns true\n*/\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n\n// exports: { \"factory\": \"main.factory\" }\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplex128Array = require( './../../../../base/assert/is-complex128array' );\nvar isComplex64Array = require( './../../../../base/assert/is-complex64array' );\nvar arraylike2object = require( './../../../../base/arraylike2object' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar isSameValue = require( '@stdlib/assert/is-same-value' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests if two arrays have the same values.\n*\n* @private\n* @param {Collection} x - first input array\n* @param {Collection} y - second input array\n* @returns {boolean} boolean indicating if both arrays have the same values\n*\n* @example\n* var x = [ 0, 0, 1, 0 ];\n* var y = [ 0, 0, 1, 0 ];\n*\n* var out = internal( x, y );\n* // returns true\n*\n* @example\n* var x = [ 0, 0, 0, 0 ];\n* var y = [ 0, 0, 1, 0 ];\n*\n* var out = internal( x, y );\n* // returns false\n*/\nfunction internal( x, y ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( !isSameValue( x[ i ], y[ i ] ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests if two arrays have the same values.\n*\n* @private\n* @param {Object} x - first input array object\n* @param {Object} y - second input array object\n* @returns {boolean} boolean indicating if both arrays have the same values\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 1, 0 ] ) );\n* var y = arraylike2object( toAccessorArray( [ 0, 0, 1, 0 ] ) );\n*\n* var out = accessors( x, y );\n* // returns true\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 0, 0 ] ) );\n* var y = arraylike2object( toAccessorArray( [ 0, 0, 1, 0 ] ) );\n*\n* var out = accessors( x, y );\n* // returns false\n*/\nfunction accessors( x, y ) {\n\tvar xdata;\n\tvar ydata;\n\tvar xget;\n\tvar yget;\n\tvar i;\n\n\txdata = x.data;\n\tydata = y.data;\n\n\txget = x.accessors[ 0 ];\n\tyget = y.accessors[ 0 ];\n\n\tfor ( i = 0; i < xdata.length; i++ ) {\n\t\tif ( !isSameValue( xget( xdata, i ), yget( ydata, i ) ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests if two arrays have the same values.\n*\n* @param {Collection} x - first input array\n* @param {Collection} y - second input array\n* @returns {boolean} boolean indicating if both arrays have the same values\n*\n* @example\n* var x = [ 0, 0, 1, 0 ];\n* var y = [ 0, 0, 1, 0 ];\n*\n* var out = hasSameValues( x, y );\n* // returns true\n*\n* @example\n* var x = [ 0, 0, 0, 0 ];\n* var y = [ 0, 0, 1, 0 ];\n*\n* var out = hasSameValues( x, y );\n* // returns false\n*/\nfunction hasSameValues( x, y ) {\n\tvar FLG;\n\tvar xo;\n\tvar yo;\n\tvar xr;\n\tvar yr;\n\n\tif ( x.length !== y.length ) {\n\t\treturn false;\n\t}\n\txo = arraylike2object( x );\n\tyo = arraylike2object( y );\n\tif ( xo.accessorProtocol || yo.accessorProtocol ) {\n\t\tFLG = 2;\n\n\t\t// If provided a complex number array, reinterpret as a real typed array and test interleaved real and imaginary components...\n\t\tif ( isComplex128Array( x ) ) {\n\t\t\txr = reinterpret128( x, 0 );\n\t\t\tFLG -= 1;\n\t\t} else if ( isComplex64Array( x ) ) {\n\t\t\txr = reinterpret64( x, 0 );\n\t\t\tFLG -= 1;\n\t\t}\n\t\tif ( isComplex128Array( y ) ) {\n\t\t\tyr = reinterpret128( y, 0 );\n\t\t\tFLG -= 1;\n\t\t} else if ( isComplex64Array( y ) ) {\n\t\t\tyr = reinterpret64( y, 0 );\n\t\t\tFLG -= 1;\n\t\t}\n\t\tif ( FLG === 0 ) {\n\t\t\treturn internal( xr, yr );\n\t\t}\n\t\treturn accessors( xo, yo );\n\t}\n\treturn internal( x, y );\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasSameValues;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if two arrays have the same values.\n*\n* @module @stdlib/array/base/assert/has-same-values\n*\n* @example\n* var hasSameValues = require( '@stdlib/array/base/assert/has-same-values' );\n*\n* var x = [ 0, 0, 1, 0 ];\n* var y = [ 0, 0, 1, 0 ];\n*\n* var out = hasSameValues( x, y );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/*\n* When adding modules to the namespace, ensure that they are added in alphabetical order according to module name.\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-read-only-property' );\n\n\n// MAIN //\n\n/**\n* Namespace.\n*\n* @namespace ns\n*/\nvar ns = {};\n\n/**\n* @name contains\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/assert/contains}\n*/\nsetReadOnly( ns, 'contains', require( './../../../base/assert/contains' ) );\n\n/**\n* @name hasSameValues\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/assert/has-same-values}\n*/\nsetReadOnly( ns, 'hasSameValues', require( './../../../base/assert/has-same-values' ) );\n\n/**\n* @name isAccessorArray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/assert/is-accessor-array}\n*/\nsetReadOnly( ns, 'isAccessorArray', require( './../../../base/assert/is-accessor-array' ) );\n\n/**\n* @name isComplex64Array\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/assert/is-complex64array}\n*/\nsetReadOnly( ns, 'isComplex64Array', require( './../../../base/assert/is-complex64array' ) );\n\n/**\n* @name isComplex128Array\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/assert/is-complex128array}\n*/\nsetReadOnly( ns, 'isComplex128Array', require( './../../../base/assert/is-complex128array' ) );\n\n\n// EXPORTS //\n\nmodule.exports = ns;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isAccessorArray = require( './../../../base/assert/is-accessor-array' );\nvar accessorGetter = require( './../../../base/accessor-getter' );\nvar getter = require( './../../../base/getter' );\nvar dtype = require( './../../../dtype' );\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an array-like object.\n*\n* @param {Collection} x - input array\n* @returns {Function} accessor\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = resolveGetter( arr );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction resolveGetter( x ) {\n\tvar dt = dtype( x );\n\tif ( isAccessorArray( x ) ) {\n\t\treturn accessorGetter( dt );\n\t}\n\treturn getter( dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = resolveGetter;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for retrieving an element from an array-like object.\n*\n* @module @stdlib/array/base/resolve-getter\n*\n* @example\n* var resolveGetter = require( '@stdlib/array/base/resolve-getter' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = resolveGetter( arr );\n* var v = get( arr, 2 );\n* // returns 3\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'map' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n\n// MAIN //\n\n/**\n* Returns an element from an array.\n*\n* @param {Collection} x - input array\n* @param {integer} index - element index\n* @returns {*} array element\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var v = at( x, 0 );\n* // returns 1\n*\n* v = at( x, 1 );\n* // returns 2\n*\n* v = at( x, -2 );\n* // returns 3\n*/\nfunction at( x, index ) {\n\tvar get;\n\tif ( hasMethod( x, 'at' ) ) {\n\t\treturn x.at( index );\n\t}\n\tif ( index < 0 ) {\n\t\tindex += x.length;\n\t\tif ( index < 0 ) {\n\t\t\treturn;\n\t\t}\n\t} else if ( index >= x.length ) {\n\t\treturn;\n\t}\n\tget = resolveGetter( x );\n\treturn get( x, index );\n}\n\n\n// EXPORTS //\n\nmodule.exports = at;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an element from an array.\n*\n* @module @stdlib/array/base/at\n*\n* @example\n* var at = require( '@stdlib/array/base/at' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var v = at( x, 0 );\n* // returns 1\n*\n* v = at( x, 1 );\n* // returns 2\n*\n* v = at( x, -2 );\n* // returns 3\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an element from a two-dimensional nested array.\n*\n* @param {ArrayLikeObject<Collection>} x - input array\n* @param {integer} i0 - first dimension index\n* @param {integer} i1 - second dimension index\n* @returns {*} nested array element\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var v = at2d( x, 0, 1 );\n* // returns 2\n*\n* v = at2d( x, 1, 0 );\n* // returns 3\n*\n* v = at2d( x, -2, -2 );\n* // returns 1\n*/\nfunction at2d( x, i0, i1 ) {\n\tvar x0;\n\tvar N;\n\n\tN = x.length;\n\tif ( i0 < 0 ) {\n\t\ti0 += N;\n\t}\n\tif ( i0 < 0 || i0 >= N ) {\n\t\treturn;\n\t}\n\tx0 = x[ i0 ];\n\tN = x0.length;\n\tif ( i1 < 0 ) {\n\t\ti1 += N;\n\t}\n\tif ( i1 < 0 || i1 >= N ) {\n\t\treturn;\n\t}\n\treturn x0[ i1 ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = at2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an element from a two-dimensional nested array.\n*\n* @module @stdlib/array/base/at2d\n*\n* @example\n* var at2d = require( '@stdlib/array/base/at2d' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var v = at2d( x, 0, 1 );\n* // returns 2\n*\n* v = at2d( x, 1, 0 );\n* // returns 3\n*\n* v = at2d( x, -2, -2 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an element from a three-dimensional nested array.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<Collection>>} x - input array\n* @param {integer} i0 - first dimension index\n* @param {integer} i1 - second dimension index\n* @param {integer} i2 - third dimension index\n* @returns {*} nested array element\n*\n* @example\n* var x = [ [ [ 1, 2 ], [ 3, 4 ] ] ];\n*\n* var v = at3d( x, 0, 0, 1 );\n* // returns 2\n*\n* v = at3d( x, 0, 1, 0 );\n* // returns 3\n*\n* v = at3d( x, 0, -2, -2 );\n* // returns 1\n*/\nfunction at3d( x, i0, i1, i2 ) {\n\tvar x0;\n\tvar x1;\n\tvar N;\n\n\tN = x.length;\n\tif ( i0 < 0 ) {\n\t\ti0 += N;\n\t}\n\tif ( i0 < 0 || i0 >= N ) {\n\t\treturn;\n\t}\n\tx0 = x[ i0 ];\n\tN = x0.length;\n\tif ( i1 < 0 ) {\n\t\ti1 += N;\n\t}\n\tif ( i1 < 0 || i1 >= N ) {\n\t\treturn;\n\t}\n\tx1 = x0[ i1 ];\n\tN = x1.length;\n\tif ( i2 < 0 ) {\n\t\ti2 += N;\n\t}\n\tif ( i2 < 0 || i2 >= N ) {\n\t\treturn;\n\t}\n\treturn x1[ i2 ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = at3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an element from a three-dimensional nested array.\n*\n* @module @stdlib/array/base/at3d\n*\n* @example\n* var at3d = require( '@stdlib/array/base/at3d' );\n*\n* var x = [ [ [ 1, 2 ], [ 3, 4 ] ] ];\n*\n* var v = at3d( x, 0, 0, 1 );\n* // returns 2\n*\n* v = at3d( x, 0, 1, 0 );\n* // returns 3\n*\n* v = at3d( x, 0, -2, -2 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an element from a four-dimensional nested array.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<Collection>>>} x - input array\n* @param {integer} i0 - first dimension index\n* @param {integer} i1 - second dimension index\n* @param {integer} i2 - third dimension index\n* @param {integer} i3 - fourth dimension index\n* @returns {*} nested array element\n*\n* @example\n* var x = [ [ [ [ 1, 2 ], [ 3, 4 ] ] ] ];\n*\n* var v = at4d( x, 0, 0, 0, 1 );\n* // returns 2\n*\n* v = at4d( x, 0, 0, 1, 0 );\n* // returns 3\n*\n* v = at4d( x, 0, 0, -2, -2 );\n* // returns 1\n*/\nfunction at4d( x, i0, i1, i2, i3 ) {\n\tvar value;\n\tvar idx;\n\tvar N;\n\tvar i;\n\tvar j;\n\n\tidx = [ i0, i1, i2, i3 ];\n\tvalue = x;\n\tfor ( i = 0; i < idx.length; i++ ) {\n\t\tj = idx[ i ];\n\t\tN = value.length;\n\t\tif ( j < 0 ) {\n\t\t\tj += N;\n\t\t}\n\t\tif ( j < 0 || j >= N ) {\n\t\t\treturn;\n\t\t}\n\t\tvalue = value[ j ];\n\t}\n\treturn value;\n}\n\n\n// EXPORTS //\n\nmodule.exports = at4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an element from a four-dimensional nested array.\n*\n* @module @stdlib/array/base/at4d\n*\n* @example\n* var at4d = require( '@stdlib/array/base/at4d' );\n*\n* var x = [ [ [ [ 1, 2 ], [ 3, 4 ] ] ] ];\n*\n* var v = at4d( x, 0, 0, 0, 1 );\n* // returns 2\n*\n* v = at4d( x, 0, 0, 1, 0 );\n* // returns 3\n*\n* v = at4d( x, 0, 0, -2, -2 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an element from a five-dimensional nested array.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<Collection>>>>} x - input array\n* @param {integer} i0 - first dimension index\n* @param {integer} i1 - second dimension index\n* @param {integer} i2 - third dimension index\n* @param {integer} i3 - fourth dimension index\n* @param {integer} i4 - fifth dimension index\n* @returns {*} nested array element\n*\n* @example\n* var x = [ [ [ [ [ 1, 2 ], [ 3, 4 ] ] ] ] ];\n*\n* var v = at5d( x, 0, 0, 0, 0, 1 );\n* // returns 2\n*\n* v = at5d( x, 0, 0, 0, 1, 0 );\n* // returns 3\n*\n* v = at5d( x, 0, 0, 0, -2, -2 );\n* // returns 1\n*/\nfunction at5d( x, i0, i1, i2, i3, i4 ) {\n\tvar value;\n\tvar idx;\n\tvar N;\n\tvar i;\n\tvar j;\n\n\tidx = [ i0, i1, i2, i3, i4 ];\n\tvalue = x;\n\tfor ( i = 0; i < idx.length; i++ ) {\n\t\tj = idx[ i ];\n\t\tN = value.length;\n\t\tif ( j < 0 ) {\n\t\t\tj += N;\n\t\t}\n\t\tif ( j < 0 || j >= N ) {\n\t\t\treturn;\n\t\t}\n\t\tvalue = value[ j ];\n\t}\n\treturn value;\n}\n\n\n// EXPORTS //\n\nmodule.exports = at5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an element from a five-dimensional nested array.\n*\n* @module @stdlib/array/base/at5d\n*\n* @example\n* var at5d = require( '@stdlib/array/base/at5d' );\n*\n* var x = [ [ [ [ [ 1, 2 ], [ 3, 4 ] ] ] ] ];\n*\n* var v = at5d( x, 0, 0, 0, 0, 1 );\n* // returns 2\n*\n* v = at5d( x, 0, 0, 0, 1, 0 );\n* // returns 3\n*\n* v = at5d( x, 0, 0, 0, -2, -2 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an element from an n-dimensional nested array.\n*\n* @param {ArrayLikeObject} x - input array\n* @param {integer} i0 - first dimension index\n* @param {...integer} indices - dimension indices\n* @returns {*} nested array element\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var v = atnd( x, 0, 1 );\n* // returns 2\n*\n* v = atnd( x, 1, 0 );\n* // returns 3\n*\n* v = atnd( x, -2, -2 );\n* // returns 1\n*/\nfunction atnd( x, i0 ) {\n\tvar value;\n\tvar idx;\n\tvar N;\n\tvar i;\n\tvar j;\n\n\tidx = [ i0 ];\n\tfor ( i = 2; i < arguments.length; i++ ) {\n\t\tidx.push( arguments[ i ] );\n\t}\n\tvalue = x;\n\tfor ( i = 0; i < idx.length; i++ ) {\n\t\tj = idx[ i ];\n\t\tN = value.length;\n\t\tif ( j < 0 ) {\n\t\t\tj += N;\n\t\t}\n\t\tif ( j < 0 || j >= N ) {\n\t\t\treturn;\n\t\t}\n\t\tvalue = value[ j ];\n\t}\n\treturn value;\n}\n\n\n// EXPORTS //\n\nmodule.exports = atnd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an element from an n-dimensional nested array.\n*\n* @module @stdlib/array/base/atnd\n*\n* @example\n* var atnd = require( '@stdlib/array/base/atnd' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var v = atnd( x, 0, 1 );\n* // returns 2\n*\n* v = atnd( x, 1, 0 );\n* // returns 3\n*\n* v = atnd( x, -2, -2 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Splits array element entries into two groups.\n*\n* @param {Collection} x - input array\n* @param {Collection} filter - array indicating which group an element in the input array belongs to\n* @throws {RangeError} must provide arrays having the same length\n* @returns {ArrayArray} results\n*\n* @example\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var filter = [ true, true, false, true ];\n*\n* var out = bifurcateEntries( x, filter );\n* // returns [ [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], [ [ 2, 'foo' ] ] ]\n*/\nfunction bifurcateEntries( x, filter ) {\n\tvar xget;\n\tvar gget;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar v;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( filter.length !== len ) {\n\t\tthrow new RangeError( 'invalid argument. The first and second arguments must have the same length.' );\n\t}\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Resolve accessors for retrieving array elements:\n\txget = resolveGetter( x );\n\tgget = resolveGetter( filter );\n\n\t// Loop over the elements and assign each to a group...\n\tout = [ [], [] ];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = xget( x, i );\n\t\tg = gget( filter, i );\n\t\tif ( g ) {\n\t\t\tout[ 0 ].push( [ i, v ] );\n\t\t} else {\n\t\t\tout[ 1 ].push( [ i, v ] );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = bifurcateEntries;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Split array element entries into two groups.\n*\n* @module @stdlib/array/base/bifurcate-entries\n*\n* @example\n* var bifurcateEntries = require( '@stdlib/array/base/bifurcate-entries' );\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var filter = [ true, true, false, true ];\n*\n* var out = bifurcateEntries( x, filter );\n* // returns [ [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], [ [ 2, 'foo' ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Splits element entries into two groups according to a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - predicate function specifying which group an element in the input collection belongs to\n* @param {*} [thisArg] - predicate function execution context\n* @returns {Object} group results\n*\n* @example\n* function predicate( v ) {\n*     return v[ 0 ] === 'b';\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = bifurcateEntriesBy( x, predicate );\n* // returns [ [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], [ [ 2, 'foo' ] ] ]\n*/\nfunction bifurcateEntriesBy( x, predicate, thisArg ) {\n\tvar get;\n\tvar len;\n\tvar out;\n\tvar v;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Resolve an accessor for retrieving array elements:\n\tget = resolveGetter( x );\n\n\t// Loop over the elements and assign each to a group...\n\tout = [ [], [] ];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = get( x, i );\n\t\tif ( predicate.call( thisArg, v, i, x ) ) {\n\t\t\tout[ 0 ].push( [ i, v ] );\n\t\t} else {\n\t\t\tout[ 1 ].push( [ i, v ] );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = bifurcateEntriesBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Split element entries into two groups according to a predicate function.\n*\n* @module @stdlib/array/base/bifurcate-entries-by\n*\n* @example\n* var bifurcateEntriesBy = require( '@stdlib/array/base/bifurcate-entries-by' );\n*\n* function predicate( v ) {\n*     return v[ 0 ] === 'b';\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = bifurcateEntriesBy( x, predicate );\n* // returns [ [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], [ [ 2, 'foo' ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Splits array element indices into two groups.\n*\n* @param {Collection} x - input array\n* @param {Collection} filter - array indicating which group an element in the input array belongs to\n* @throws {RangeError} must provide arrays having the same length\n* @returns {ArrayArray} results\n*\n* @example\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var filter = [ true, true, false, true ];\n*\n* var out = bifurcateIndices( x, filter );\n* // returns [ [ 0, 1, 3 ], [ 2 ] ]\n*/\nfunction bifurcateIndices( x, filter ) {\n\tvar gget;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( filter.length !== len ) {\n\t\tthrow new RangeError( 'invalid argument. The first and second arguments must have the same length.' );\n\t}\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Resolve accessors for retrieving array elements:\n\tgget = resolveGetter( filter );\n\n\t// Loop over the elements and assign each to a group...\n\tout = [ [], [] ];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tg = gget( filter, i );\n\t\tif ( g ) {\n\t\t\tout[ 0 ].push( i );\n\t\t} else {\n\t\t\tout[ 1 ].push( i );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = bifurcateIndices;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Split array element indices into two groups.\n*\n* @module @stdlib/array/base/bifurcate-indices\n*\n* @example\n* var bifurcateIndices = require( '@stdlib/array/base/bifurcate-indices' );\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var filter = [ true, true, false, true ];\n*\n* var out = bifurcateIndices( x, filter );\n* // returns [ [ 0, 1, 3 ], [ 2 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Splits element indices into two groups according to a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - predicate function specifying which group an element in the input collection belongs to\n* @param {*} [thisArg] - predicate function execution context\n* @returns {Object} group results\n*\n* @example\n* function predicate( v ) {\n*     return v[ 0 ] === 'b';\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = bifurcateIndicesBy( x, predicate );\n* // returns [ [ 0, 1, 3 ], [ 2 ] ]\n*/\nfunction bifurcateIndicesBy( x, predicate, thisArg ) {\n\tvar get;\n\tvar len;\n\tvar out;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Resolve an accessor for retrieving array elements:\n\tget = resolveGetter( x );\n\n\t// Loop over the elements and assign each to a group...\n\tout = [ [], [] ];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tif ( predicate.call( thisArg, get( x, i ), i, x ) ) {\n\t\t\tout[ 0 ].push( i );\n\t\t} else {\n\t\t\tout[ 1 ].push( i );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = bifurcateIndicesBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Split element indices into two groups according to a predicate function.\n*\n* @module @stdlib/array/base/bifurcate-indices-by\n*\n* @example\n* var bifurcateIndicesBy = require( '@stdlib/array/base/bifurcate-indices-by' );\n*\n* function predicate( v ) {\n*     return v[ 0 ] === 'b';\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = bifurcateIndicesBy( x, predicate );\n* // returns [ [ 0, 1, 3 ], [ 2 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Splits array element values into two groups.\n*\n* @param {Collection} x - input array\n* @param {Collection} filter - array indicating which group an element in the input array belongs to\n* @throws {RangeError} must provide arrays having the same length\n* @returns {ArrayArray} results\n*\n* @example\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var filter = [ true, true, false, true ];\n*\n* var out = bifurcateValues( x, filter );\n* // returns [ [ 'beep', 'boop', 'bar' ], [ 'foo' ] ]\n*/\nfunction bifurcateValues( x, filter ) {\n\tvar xget;\n\tvar gget;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar v;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( filter.length !== len ) {\n\t\tthrow new RangeError( 'invalid argument. The first and second arguments must have the same length.' );\n\t}\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Resolve accessors for retrieving array elements:\n\txget = resolveGetter( x );\n\tgget = resolveGetter( filter );\n\n\t// Loop over the elements and assign each to a group...\n\tout = [ [], [] ];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = xget( x, i );\n\t\tg = gget( filter, i );\n\t\tif ( g ) {\n\t\t\tout[ 0 ].push( v );\n\t\t} else {\n\t\t\tout[ 1 ].push( v );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = bifurcateValues;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Split array element values into two groups.\n*\n* @module @stdlib/array/base/bifurcate-values\n*\n* @example\n* var bifurcateValues = require( '@stdlib/array/base/bifurcate-values' );\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var filter = [ true, true, false, true ];\n*\n* var out = bifurcateValues( x, filter );\n* // returns [ [ 'beep', 'boop', 'bar' ], [ 'foo' ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Splits element values into two groups according to a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - predicate function specifying which group an element in the input collection belongs to\n* @param {*} [thisArg] - predicate function execution context\n* @returns {Object} group results\n*\n* @example\n* function predicate( v ) {\n*     return v[ 0 ] === 'b';\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = bifurcateValuesBy( x, predicate );\n* // returns [ [ 'beep', 'boop', 'bar' ], [ 'foo' ] ]\n*/\nfunction bifurcateValuesBy( x, predicate, thisArg ) {\n\tvar get;\n\tvar len;\n\tvar out;\n\tvar v;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Resolve an accessor for retrieving array elements:\n\tget = resolveGetter( x );\n\n\t// Loop over the elements and assign each to a group...\n\tout = [ [], [] ];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = get( x, i );\n\t\tif ( predicate.call( thisArg, v, i, x ) ) {\n\t\t\tout[ 0 ].push( v );\n\t\t} else {\n\t\t\tout[ 1 ].push( v );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = bifurcateValuesBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Split element values into two groups according to a predicate function.\n*\n* @module @stdlib/array/base/bifurcate-values-by\n*\n* @example\n* var bifurcateValuesBy = require( '@stdlib/array/base/bifurcate-values-by' );\n*\n* function predicate( v ) {\n*     return v[ 0 ] === 'b';\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = bifurcateValuesBy( x, predicate );\n* // returns [ [ 'beep', 'boop', 'bar' ], [ 'foo' ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two two-dimensional nested input arrays and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = zeros2d( shape );\n*\n* binary2d( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ]\n*/\nfunction binary2d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar x;\n\tvar y;\n\tvar z;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tz0 = z[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tz0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ] );\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two two-dimensional nested input arrays and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/binary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var binary2d = require( '@stdlib/array/base/binary2d' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = zeros2d( shape );\n*\n* binary2d( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two three-dimensional nested input arrays and assigns results to elements in a three-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array>} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shape = [ 2, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = ones3d( shape );\n* var z = zeros3d( shape );\n*\n* binary3d( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ]\n*/\nfunction binary3d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar x0;\n\tvar x1;\n\tvar y0;\n\tvar y1;\n\tvar z0;\n\tvar z1;\n\tvar x;\n\tvar y;\n\tvar z;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tx1 = x[ i2 ];\n\t\ty1 = y[ i2 ];\n\t\tz1 = z[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tx0 = x1[ i1 ];\n\t\t\ty0 = y1[ i1 ];\n\t\t\tz0 = z1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tz0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ] );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two three-dimensional nested input arrays and assign results to elements in a three-dimensional nested output array.\n*\n* @module @stdlib/array/base/binary3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var binary3d = require( '@stdlib/array/base/binary3d' );\n*\n* var shape = [ 2, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = ones3d( shape );\n* var z = zeros3d( shape );\n*\n* binary3d( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two four-dimensional nested input arrays and assigns results to elements in a four-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shape = [ 1, 2, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = ones4d( shape );\n* var z = zeros4d( shape );\n*\n* binary4d( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ] ]\n*/\nfunction binary4d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar x0;\n\tvar x1;\n\tvar x2;\n\tvar y0;\n\tvar y1;\n\tvar y2;\n\tvar z0;\n\tvar z1;\n\tvar z2;\n\tvar x;\n\tvar y;\n\tvar z;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tx2 = x[ i3 ];\n\t\ty2 = y[ i3 ];\n\t\tz2 = z[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tx1 = x2[ i2 ];\n\t\t\ty1 = y2[ i2 ];\n\t\t\tz1 = z2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tz0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ] );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two four-dimensional nested input arrays and assign results to elements in a four-dimensional nested output array.\n*\n* @module @stdlib/array/base/binary4d\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var binary4d = require( '@stdlib/array/base/binary4d' );\n*\n* var shape = [ 1, 2, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = ones4d( shape );\n* var z = zeros4d( shape );\n*\n* binary4d( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two five-dimensional nested input arrays and assigns results to elements in a five-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shape = [ 1, 1, 2, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = ones5d( shape );\n* var z = zeros5d( shape );\n*\n* binary5d( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ] ] ]\n*/\nfunction binary5d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar x0;\n\tvar x1;\n\tvar x2;\n\tvar x3;\n\tvar y0;\n\tvar y1;\n\tvar y2;\n\tvar y3;\n\tvar z0;\n\tvar z1;\n\tvar z2;\n\tvar z3;\n\tvar x;\n\tvar y;\n\tvar z;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 || S4 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tx3 = x[ i4 ];\n\t\ty3 = y[ i4 ];\n\t\tz3 = z[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tx2 = x3[ i3 ];\n\t\t\ty2 = y3[ i3 ];\n\t\t\tz2 = z3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tx1 = x2[ i2 ];\n\t\t\t\ty1 = y2[ i2 ];\n\t\t\t\tz1 = z2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tz0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ] );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two five-dimensional nested input arrays and assign results to elements in a five-dimensional nested output array.\n*\n* @module @stdlib/array/base/binary5d\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var binary5d = require( '@stdlib/array/base/binary5d' );\n*\n* var shape = [ 1, 1, 2, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = ones5d( shape );\n* var z = zeros5d( shape );\n*\n* binary5d( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\n/**\n* Recursively applies a binary callback.\n*\n* @private\n* @param {ArrayLikeObject} x - input array\n* @param {ArrayLikeObject} y - input array\n* @param {ArrayLikeObject} z - output array\n* @param {NonNegativeInteger} ndims - number of dimensions\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {NonNegativeInteger} dim - dimension index\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*/\nfunction recurse( x, y, z, ndims, shape, dim, fcn ) {\n\tvar S;\n\tvar d;\n\tvar i;\n\n\tS = shape[ dim ];\n\n\t// Check whether we've reached the innermost dimension:\n\td = dim + 1;\n\n\tif ( d === ndims ) {\n\t\t// Apply the provided callback...\n\t\tfor ( i = 0; i < S; i++ ) {\n\t\t\tz[ i ] = fcn( x[ i ], y[ i ] );\n\t\t}\n\t\treturn;\n\t}\n\t// Continue recursing into the nested arrays...\n\tfor ( i = 0; i < S; i++ ) {\n\t\trecurse( x[ i ], y[ i ], z[ i ], ndims, shape, d, fcn );\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two n-dimensional nested input arrays and assigns results to elements in an n-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add' );\n* var onesnd = require( '@stdlib/array/base/onesnd' );\n* var zerosnd = require( '@stdlib/array/base/zerosnd' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = onesnd( shape );\n* var y = onesnd( shape );\n* var z = zerosnd( shape );\n*\n* binarynd( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ]\n*/\nfunction binarynd( arrays, shape, fcn ) {\n\treturn recurse( arrays[ 0 ], arrays[ 1 ], arrays[ 2 ], shape.length, shape, 0, fcn ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = binarynd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in an n-dimensional nested input array and assign results to elements in an n-dimensional nested output array.\n*\n* @module @stdlib/array/base/binarynd\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add' );\n* var onesnd = require( '@stdlib/array/base/onesnd' );\n* var zerosnd = require( '@stdlib/array/base/zerosnd' );\n* var binarynd = require( '@stdlib/array/base/binarynd' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = onesnd( shape );\n* var y = onesnd( shape );\n* var z = zerosnd( shape );\n*\n* binarynd( [ x, y, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies the elements of an indexed array-like object to a new \"generic\" array.\n*\n* @param {Collection} x - input array\n* @returns {Array} output array\n*\n* @example\n* var out = copy( [ 1, 2, 3 ] );\n* // returns [ 1, 2, 3 ]\n*/\nfunction copy( x ) {\n\tvar out;\n\tvar len;\n\tvar i;\n\n\tlen = x.length;\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( x[ i ] ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = copy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Copy the elements of an indexed array-like object to a new \"generic\" array.\n*\n* @module @stdlib/array/base/copy-indexed\n*\n* @example\n* var copy = require( '@stdlib/array/base/copy-indexed' );\n*\n* var out = copy( [ 1, 2, 3 ] );\n* // returns [ 1, 2, 3 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a filled \"generic\" array.\n*\n* @param {*} value - fill value\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} filled array\n*\n* @example\n* var out = filled( 0.0, 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*\n* @example\n* var out = filled( 'beep', 3 );\n* // returns [ 'beep', 'beep', 'beep' ]\n*/\nfunction filled( value, len ) {\n\tvar arr;\n\tvar i;\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tarr.push( value );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled \"generic\" array.\n*\n* @module @stdlib/array/base/filled\n*\n* @example\n* var filled = require( '@stdlib/array/base/filled' );\n*\n* var out = filled( 0.0, 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*\n* @example\n* var filled = require( '@stdlib/array/base/filled' );\n*\n* var out = filled( 'beep', 3 );\n* // returns [ 'beep', 'beep', 'beep' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled = require( './../../../base/filled' );\n\n\n// MAIN //\n\n/**\n* Returns a zero-filled \"generic\" array.\n*\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} output array\n*\n* @example\n* var out = zeros( 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*/\nfunction zeros( len ) {\n\treturn filled( 0.0, len );\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeros;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a zero-filled \"generic\" array.\n*\n* @module @stdlib/array/base/zeros\n*\n* @example\n* var zeros = require( '@stdlib/array/base/zeros' );\n*\n* var out = zeros( 3 );\n* // returns [ 0.0, 0.0, 0.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar copy = require( './../../../base/copy-indexed' );\nvar zeros = require( './../../../base/zeros' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Broadcasts an array to a specified shape.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} inShape - input array shape\n* @param {NonNegativeIntegerArray} outShape - output array shape\n* @throws {Error} input array cannot have more dimensions than the desired shape\n* @throws {Error} input array dimension sizes must be `1` or equal to the corresponding dimension in the provided output shape\n* @throws {Error} input array and desired shape must be broadcast compatible\n* @returns {Object} broadcast object\n*\n* @example\n* var x = [ 1, 2 ];\n*\n* var out = broadcastArray( x, [ 2 ], [ 2, 2 ] );\n* // returns {...}\n*\n* var shape = out.shape;\n* // returns [ 2, 2 ]\n*\n* var strides = out.strides;\n* // returns [ 0, 1 ]\n*\n* var ref = out.ref;\n* // returns [ 1, 2 ]\n*\n* var bool = ( x === ref );\n* // returns true\n*\n* var data = out.data;\n* // returns [ [ 1, 2 ] ]\n*\n* @example\n* var x = [ 1, 2 ];\n*\n* var out = broadcastArray( x, [ 2 ], [ 2, 1, 2 ] );\n* // returns {...}\n*\n* var data = out.data;\n* // returns [ [ [ 1, 2 ] ] ]\n*\n* var strides = out.strides;\n* // returns [ 0, 0, 1 ]\n*\n* @example\n* var x = [ [ 1 ], [ 2 ] ];\n*\n* var out = broadcastArray( x, [ 2, 1 ], [ 3, 2, 2 ] );\n* // returns {...}\n*\n* var data = out.data;\n* // returns [ [ [ 1 ], [ 2 ] ] ]\n*\n* var strides = out.strides;\n* // returns [ 0, 1, 0 ]\n*/\nfunction broadcastArray( x, inShape, outShape ) {\n\tvar data;\n\tvar dim;\n\tvar st;\n\tvar N;\n\tvar M;\n\tvar d;\n\tvar i;\n\tvar j;\n\n\tN = outShape.length;\n\tM = inShape.length;\n\tif ( N < M ) {\n\t\tthrow new Error( 'invalid argument. Cannot broadcast an array to a shape having fewer dimensions. Arrays can only be broadcasted to shapes having the same or more dimensions.' );\n\t}\n\t// Prepend additional dimensions...\n\tdata = x;\n\tfor ( i = M; i < N; i++ ) {\n\t\tdata = [ data ];\n\t}\n\n\t// Initialize a strides array:\n\tst = zeros( N );\n\n\t// Determine the output array strides...\n\tfor ( i = N-1; i >= 0; i-- ) {\n\t\tj = M - N + i;\n\t\tif ( j < 0 ) {\n\t\t\t// Prepended singleton dimension; stride is zero...\n\t\t\tcontinue;\n\t\t}\n\t\td = inShape[ j ];\n\t\tdim = outShape[ i ];\n\t\tif ( dim !== 0 && dim < d ) {\n\t\t\tthrow new Error( format( 'invalid argument. Input array cannot be broadcast to the specified shape, as the specified shape has a dimension whose size is less than the size of the corresponding dimension in the input array. Array shape: (%s). Desired shape: (%s). Dimension: %u.', copy( inShape ).join( ', ' ), copy( outShape ).join( ', ' ), i ) );\n\t\t}\n\t\tif ( d === dim ) {\n\t\t\t// As the dimension sizes are equal, the stride is one, meaning that each element in the array should be iterated over as normal...\n\t\t\tst[ i ] = 1;\n\t\t} else if ( d === 1 ) {\n\t\t\t// In order to broadcast a dimension, we set the stride for that dimension to zero...\n\t\t\tst[ i ] = 0;\n\t\t} else {\n\t\t\t// At this point, we know that `dim > d` and that `d` does not equal `1` (e.g., `dim=3` and `d=2`); in which case, the shapes are considered incompatible (even for desired shapes which are multiples of array dimensions, as might be desired when \"tiling\" an array; e.g., `dim=4` and `d=2`)...\n\t\t\tthrow new Error( format( 'invalid argument. Input array and the specified shape are broadcast incompatible. Array shape: (%s). Desired shape: (%s). Dimension: %u.', copy( inShape ).join( ', ' ), copy( outShape ).join( ', ' ), i ) );\n\t\t}\n\t}\n\t// Return broadcast results:\n\treturn {\n\t\t'ref': x,                  // reference to the original input array\n\t\t'data': data,              // broadcasted array\n\t\t'shape': copy( outShape ), // copy in order to prevent mutation\n\t\t'strides': st\n\t};\n}\n\n\n// EXPORTS //\n\nmodule.exports = broadcastArray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Broadcast an array to a specified shape.\n*\n* @module @stdlib/array/base/broadcast-array\n*\n* @example\n* var broadcastArray = require( '@stdlib/array/base/broadcast-array' );\n*\n* var x = [ 1, 2 ];\n*\n* var out = broadcastArray( x, [ 2 ], [ 2, 2 ] );\n* // returns {...}\n*\n* var shape = out.shape;\n* // returns [ 2, 2 ]\n*\n* var strides = out.strides;\n* // returns [ 0, 1 ]\n*\n* var ref = out.ref;\n* // returns [ 1, 2 ]\n*\n* var bool = ( x === ref );\n* // returns true\n*\n* var data = out.data;\n* // returns [ [ 1, 2 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two broadcasted input arrays and assigns results to elements in a two-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 1 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = ones2d( shapes[ 1 ] );\n* var z = zeros2d( shapes[ 2 ] );\n*\n* bbinary2d( [ x, y, z ], shapes, add );\n*\n* console.log( z );\n* // => [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ]\n*/\nfunction bbinary2d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar k0;\n\tvar k1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\n\tsh = shapes[ 2 ];\n\tS0 = sh[ 1 ];\n\tS1 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 1 ];\n\tdx1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 1 ], shapes[ 1 ], sh );\n\ty = o.data;\n\tst = o.strides;\n\tdy0 = st[ 1 ];\n\tdy1 = st[ 0 ];\n\n\tz = arrays[ 2 ];\n\n\tj1 = 0;\n\tk1 = 0;\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tj0 = 0;\n\t\tk0 = 0;\n\t\tx0 = x[ j1 ];\n\t\ty0 = y[ k1 ];\n\t\tz0 = z[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tz0[ i0 ] = fcn( x0[ j0 ], y0[ k0 ] );\n\t\t\tj0 += dx0;\n\t\t\tk0 += dy0;\n\t\t}\n\t\tj1 += dx1;\n\t\tk1 += dy1;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bbinary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two broadcasted input arrays and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-binary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var bbinary2d = require( '@stdlib/array/base/broadcasted-binary2d' );\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 1 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = ones2d( shapes[ 1 ] );\n* var z = zeros2d( shapes[ 2 ] );\n*\n* bbinary2d( [ x, y, z ], shapes, add );\n*\n* console.log( z );\n* // => [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two broadcasted input arrays and assigns results to elements in a three-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array>} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shapes = [\n*     [ 1, 1, 2 ],\n*     [ 2, 1, 1 ],\n*     [ 2, 2, 2 ]\n* ];\n*\n* var x = ones3d( shapes[ 0 ] );\n* var y = ones3d( shapes[ 1 ] );\n* var z = zeros3d( shapes[ 2 ] );\n*\n* bbinary3d( [ x, y, z ], shapes, add );\n*\n* console.log( z );\n* // => [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ]\n*/\nfunction bbinary3d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar k0;\n\tvar k1;\n\tvar k2;\n\tvar x0;\n\tvar x1;\n\tvar y0;\n\tvar y1;\n\tvar z0;\n\tvar z1;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\n\tsh = shapes[ 2 ];\n\tS0 = sh[ 2 ];\n\tS1 = sh[ 1 ];\n\tS2 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 2 ];\n\tdx1 = st[ 1 ];\n\tdx2 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 1 ], shapes[ 1 ], sh );\n\ty = o.data;\n\tst = o.strides;\n\tdy0 = st[ 2 ];\n\tdy1 = st[ 1 ];\n\tdy2 = st[ 0 ];\n\n\tz = arrays[ 2 ];\n\n\tj2 = 0;\n\tk2 = 0;\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tj1 = 0;\n\t\tk1 = 0;\n\t\tx1 = x[ j2 ];\n\t\ty1 = y[ k2 ];\n\t\tz1 = z[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tj0 = 0;\n\t\t\tk0 = 0;\n\t\t\tx0 = x1[ j1 ];\n\t\t\ty0 = y1[ k1 ];\n\t\t\tz0 = z1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tz0[ i0 ] = fcn( x0[ j0 ], y0[ k0 ] );\n\t\t\t\tj0 += dx0;\n\t\t\t\tk0 += dy0;\n\t\t\t}\n\t\t\tj1 += dx1;\n\t\t\tk1 += dy1;\n\t\t}\n\t\tj2 += dx2;\n\t\tk2 += dy2;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bbinary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two broadcasted input arrays and assign results to elements in a three-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-binary3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var bbinary3d = require( '@stdlib/array/base/broadcasted-binary3d' );\n*\n* var shapes = [\n*     [ 1, 1, 2 ],\n*     [ 2, 1, 1 ],\n*     [ 2, 2, 2 ]\n* ];\n*\n* var x = ones3d( shapes[ 0 ] );\n* var y = ones3d( shapes[ 1 ] );\n* var z = zeros3d( shapes[ 2 ] );\n*\n* bbinary3d( [ x, y, z ], shapes, add );\n*\n* console.log( z );\n* // => [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two broadcasted input arrays and assigns results to elements in a four-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array>} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shapes = [\n*     [ 1, 1, 1, 2 ],\n*     [ 1, 2, 1, 1 ],\n*     [ 1, 2, 2, 2 ]\n* ];\n*\n* var x = ones4d( shapes[ 0 ] );\n* var y = ones4d( shapes[ 1 ] );\n* var z = zeros4d( shapes[ 2 ] );\n*\n* bbinary4d( [ x, y, z ], shapes, add );\n*\n* console.log( z );\n* // => [ [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ] ]\n*/\nfunction bbinary4d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar k0;\n\tvar k1;\n\tvar k2;\n\tvar k3;\n\tvar x0;\n\tvar x1;\n\tvar x2;\n\tvar y0;\n\tvar y1;\n\tvar y2;\n\tvar z0;\n\tvar z1;\n\tvar z2;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\n\tsh = shapes[ 2 ];\n\tS0 = sh[ 3 ];\n\tS1 = sh[ 2 ];\n\tS2 = sh[ 1 ];\n\tS3 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 3 ];\n\tdx1 = st[ 2 ];\n\tdx2 = st[ 1 ];\n\tdx3 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 1 ], shapes[ 1 ], sh );\n\ty = o.data;\n\tst = o.strides;\n\tdy0 = st[ 3 ];\n\tdy1 = st[ 2 ];\n\tdy2 = st[ 1 ];\n\tdy3 = st[ 0 ];\n\n\tz = arrays[ 2 ];\n\n\tj3 = 0;\n\tk3 = 0;\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tj2 = 0;\n\t\tk2 = 0;\n\t\tx2 = x[ j3 ];\n\t\ty2 = y[ k3 ];\n\t\tz2 = z[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tj1 = 0;\n\t\t\tk1 = 0;\n\t\t\tx1 = x2[ j2 ];\n\t\t\ty1 = y2[ k2 ];\n\t\t\tz1 = z2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tj0 = 0;\n\t\t\t\tk0 = 0;\n\t\t\t\tx0 = x1[ j1 ];\n\t\t\t\ty0 = y1[ k1 ];\n\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tz0[ i0 ] = fcn( x0[ j0 ], y0[ k0 ] );\n\t\t\t\t\tj0 += dx0;\n\t\t\t\t\tk0 += dy0;\n\t\t\t\t}\n\t\t\t\tj1 += dx1;\n\t\t\t\tk1 += dy1;\n\t\t\t}\n\t\t\tj2 += dx2;\n\t\t\tk2 += dy2;\n\t\t}\n\t\tj3 += dx3;\n\t\tk3 += dy3;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bbinary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two broadcasted input arrays and assign results to elements in a four-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-binary4d\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var bbinary4d = require( '@stdlib/array/base/broadcasted-binary4d' );\n*\n* var shapes = [\n*     [ 1, 1, 1, 2 ],\n*     [ 1, 2, 1, 1 ],\n*     [ 1, 2, 2, 2 ]\n* ];\n*\n* var x = ones4d( shapes[ 0 ] );\n* var y = ones4d( shapes[ 1 ] );\n* var z = zeros4d( shapes[ 2 ] );\n*\n* bbinary4d( [ x, y, z ], shapes, add );\n*\n* console.log( z );\n* // => [ [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two broadcasted input arrays and assigns results to elements in a five-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array>} arrays - array-like object containing two input nested arrays and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - binary callback\n* @returns {void}\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shapes = [\n*     [ 1, 1, 1, 1, 2 ],\n*     [ 1, 1, 2, 1, 1 ],\n*     [ 1, 1, 2, 2, 2 ]\n* ];\n*\n* var x = ones5d( shapes[ 0 ] );\n* var y = ones5d( shapes[ 1 ] );\n* var z = zeros5d( shapes[ 2 ] );\n*\n* bbinary5d( [ x, y, z ], shapes, add );\n*\n* console.log( z );\n* // => [ [ [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ] ] ]\n*/\nfunction bbinary5d( arrays, shapes, fcn ) { // eslint-disable-line max-statements\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar dy0;\n\tvar dy1;\n\tvar dy2;\n\tvar dy3;\n\tvar dy4;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar k0;\n\tvar k1;\n\tvar k2;\n\tvar k3;\n\tvar k4;\n\tvar x0;\n\tvar x1;\n\tvar x2;\n\tvar x3;\n\tvar y0;\n\tvar y1;\n\tvar y2;\n\tvar y3;\n\tvar z0;\n\tvar z1;\n\tvar z2;\n\tvar z3;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\n\tsh = shapes[ 2 ];\n\tS0 = sh[ 4 ];\n\tS1 = sh[ 3 ];\n\tS2 = sh[ 2 ];\n\tS3 = sh[ 1 ];\n\tS4 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 || S4 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 4 ];\n\tdx1 = st[ 3 ];\n\tdx2 = st[ 2 ];\n\tdx3 = st[ 1 ];\n\tdx4 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 1 ], shapes[ 1 ], sh );\n\ty = o.data;\n\tst = o.strides;\n\tdy0 = st[ 4 ];\n\tdy1 = st[ 3 ];\n\tdy2 = st[ 2 ];\n\tdy3 = st[ 1 ];\n\tdy4 = st[ 0 ];\n\n\tz = arrays[ 2 ];\n\n\tj4 = 0;\n\tk4 = 0;\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tj3 = 0;\n\t\tk3 = 0;\n\t\tx3 = x[ j4 ];\n\t\ty3 = y[ k4 ];\n\t\tz3 = z[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tj2 = 0;\n\t\t\tk2 = 0;\n\t\t\tx2 = x3[ j3 ];\n\t\t\ty2 = y3[ k3 ];\n\t\t\tz2 = z3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tj1 = 0;\n\t\t\t\tk1 = 0;\n\t\t\t\tx1 = x2[ j2 ];\n\t\t\t\ty1 = y2[ k2 ];\n\t\t\t\tz1 = z2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tj0 = 0;\n\t\t\t\t\tk0 = 0;\n\t\t\t\t\tx0 = x1[ j1 ];\n\t\t\t\t\ty0 = y1[ k1 ];\n\t\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tz0[ i0 ] = fcn( x0[ j0 ], y0[ k0 ] );\n\t\t\t\t\t\tj0 += dx0;\n\t\t\t\t\t\tk0 += dy0;\n\t\t\t\t\t}\n\t\t\t\t\tj1 += dx1;\n\t\t\t\t\tk1 += dy1;\n\t\t\t\t}\n\t\t\t\tj2 += dx2;\n\t\t\t\tk2 += dy2;\n\t\t\t}\n\t\t\tj3 += dx3;\n\t\t\tk3 += dy3;\n\t\t}\n\t\tj4 += dx4;\n\t\tk4 += dy4;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bbinary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two broadcasted input arrays and assign results to elements in a five-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-binary5d\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var bbinary5d = require( '@stdlib/array/base/broadcasted-binary5d' );\n*\n* var shapes = [\n*     [ 1, 1, 1, 1, 2 ],\n*     [ 1, 1, 2, 1, 1 ],\n*     [ 1, 1, 2, 2, 2 ]\n* ];\n*\n* var x = ones5d( shapes[ 0 ] );\n* var y = ones5d( shapes[ 1 ] );\n* var z = zeros5d( shapes[ 2 ] );\n*\n* bbinary5d( [ x, y, z ], shapes, add );\n*\n* console.log( z );\n* // => [ [ [ [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ], [ [ 2.0, 2.0 ], [ 2.0, 2.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a quaternary callback to elements in four broadcasted input arrays and assigns results to elements in a two-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing four input nested arrays and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - quaternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 1 ],\n*     [ 1, 1 ],\n*     [ 2, 2 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = ones2d( shapes[ 1 ] );\n* var z = ones2d( shapes[ 2 ] );\n* var w = ones2d( shapes[ 3 ] );\n* var out = zeros2d( shapes[ 4 ] );\n*\n* bquaternary2d( [ x, y, z, w, out ], shapes, add );\n*\n* console.log( out );\n* // => [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ]\n*/\nfunction bquaternary2d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar dw0;\n\tvar dw1;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar k0;\n\tvar k1;\n\tvar m0;\n\tvar m1;\n\tvar n0;\n\tvar n1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar u0;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar u;\n\n\tsh = shapes[ 4 ];\n\tS0 = sh[ 1 ];\n\tS1 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 1 ];\n\tdx1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 1 ], shapes[ 1 ], sh );\n\ty = o.data;\n\tst = o.strides;\n\tdy0 = st[ 1 ];\n\tdy1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 2 ], shapes[ 2 ], sh );\n\tz = o.data;\n\tst = o.strides;\n\tdz0 = st[ 1 ];\n\tdz1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 3 ], shapes[ 3 ], sh );\n\tw = o.data;\n\tst = o.strides;\n\tdw0 = st[ 1 ];\n\tdw1 = st[ 0 ];\n\n\tu = arrays[ 4 ];\n\n\tj1 = 0;\n\tk1 = 0;\n\tm1 = 0;\n\tn1 = 0;\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tj0 = 0;\n\t\tk0 = 0;\n\t\tm0 = 0;\n\t\tn0 = 0;\n\t\tx0 = x[ j1 ];\n\t\ty0 = y[ k1 ];\n\t\tz0 = z[ m1 ];\n\t\tw0 = w[ n1 ];\n\t\tu0 = u[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tu0[ i0 ] = fcn( x0[ j0 ], y0[ k0 ], z0[ m0 ], w0[ n0 ] );\n\t\t\tj0 += dx0;\n\t\t\tk0 += dy0;\n\t\t\tm0 += dz0;\n\t\t\tn0 += dw0;\n\t\t}\n\t\tj1 += dx1;\n\t\tk1 += dy1;\n\t\tm1 += dz1;\n\t\tn1 += dw1;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bquaternary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quaternary callback to elements in four broadcasted input arrays and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-quaternary2d\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var bquaternary2d = require( '@stdlib/array/base/broadcasted-quaternary2d' );\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 1 ],\n*     [ 1, 1 ],\n*     [ 2, 2 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = ones2d( shapes[ 1 ] );\n* var z = ones2d( shapes[ 2 ] );\n* var w = ones2d( shapes[ 3 ] );\n* var out = zeros2d( shapes[ 4 ] );\n*\n* bquaternary2d( [ x, y, z, w, out ], shapes, add );\n*\n* console.log( out );\n* // => [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a quinary callback to elements in five broadcasted input arrays and assigns results to elements in a two-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing five input nested arrays and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - quinary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* function add( x, y, z, w, v ) {\n*     return x + y + z + w + v;\n* }\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 1 ],\n*     [ 1, 1 ],\n*     [ 2, 2 ],\n*     [ 1, 1 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = ones2d( shapes[ 1 ] );\n* var z = ones2d( shapes[ 2 ] );\n* var w = ones2d( shapes[ 3 ] );\n* var v = ones2d( shapes[ 4 ] );\n* var out = zeros2d( shapes[ 5 ] );\n*\n* bquinary2d( [ x, y, z, w, v, out ], shapes, add );\n*\n* console.log( out );\n* // => [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ]\n*/\nfunction bquinary2d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar dw0;\n\tvar dw1;\n\tvar du0;\n\tvar du1;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar k0;\n\tvar k1;\n\tvar m0;\n\tvar m1;\n\tvar n0;\n\tvar n1;\n\tvar p0;\n\tvar p1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar u0;\n\tvar v0;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar u;\n\tvar v;\n\n\tsh = shapes[ 5 ];\n\tS0 = sh[ 1 ];\n\tS1 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 1 ];\n\tdx1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 1 ], shapes[ 1 ], sh );\n\ty = o.data;\n\tst = o.strides;\n\tdy0 = st[ 1 ];\n\tdy1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 2 ], shapes[ 2 ], sh );\n\tz = o.data;\n\tst = o.strides;\n\tdz0 = st[ 1 ];\n\tdz1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 3 ], shapes[ 3 ], sh );\n\tw = o.data;\n\tst = o.strides;\n\tdw0 = st[ 1 ];\n\tdw1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 4 ], shapes[ 4 ], sh );\n\tu = o.data;\n\tst = o.strides;\n\tdu0 = st[ 1 ];\n\tdu1 = st[ 0 ];\n\n\tv = arrays[ 5 ];\n\n\tj1 = 0;\n\tk1 = 0;\n\tm1 = 0;\n\tn1 = 0;\n\tp1 = 0;\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tj0 = 0;\n\t\tk0 = 0;\n\t\tm0 = 0;\n\t\tn0 = 0;\n\t\tp0 = 0;\n\t\tx0 = x[ j1 ];\n\t\ty0 = y[ k1 ];\n\t\tz0 = z[ m1 ];\n\t\tw0 = w[ n1 ];\n\t\tu0 = u[ p1 ];\n\t\tv0 = v[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tv0[ i0 ] = fcn( x0[ j0 ], y0[ k0 ], z0[ m0 ], w0[ n0 ], u0[ p0 ] );\n\t\t\tj0 += dx0;\n\t\t\tk0 += dy0;\n\t\t\tm0 += dz0;\n\t\t\tn0 += dw0;\n\t\t\tp0 += du0;\n\t\t}\n\t\tj1 += dx1;\n\t\tk1 += dy1;\n\t\tm1 += dz1;\n\t\tn1 += dw1;\n\t\tp1 += du1;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bquinary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quinary callback to elements in five broadcasted input arrays and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-quinary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var bquinary2d = require( '@stdlib/array/base/broadcasted-quinary2d' );\n*\n* function add( x, y, z, w, v ) {\n*     return x + y + z + w + v;\n* }\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 1 ],\n*     [ 1, 1 ],\n*     [ 2, 2 ],\n*     [ 1, 1 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = ones2d( shapes[ 1 ] );\n* var z = ones2d( shapes[ 2 ] );\n* var w = ones2d( shapes[ 3 ] );\n* var v = ones2d( shapes[ 4 ] );\n* var out = zeros2d( shapes[ 5 ] );\n*\n* bquinary2d( [ x, y, z, w, v, out ], shapes, add );\n*\n* console.log( out );\n* // => [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a ternary callback to elements in three broadcasted input arrays and assigns results to elements in a two-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing three input nested arrays and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - ternary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add3' );\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 1 ],\n*     [ 1, 1 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = ones2d( shapes[ 1 ] );\n* var z = ones2d( shapes[ 2 ] );\n* var out = zeros2d( shapes[ 3 ] );\n*\n* bternary2d( [ x, y, z, out ], shapes, add );\n*\n* console.log( out );\n* // => [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ]\n*/\nfunction bternary2d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dy0;\n\tvar dy1;\n\tvar dz0;\n\tvar dz1;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar k0;\n\tvar k1;\n\tvar m0;\n\tvar m1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\n\tsh = shapes[ 3 ];\n\tS0 = sh[ 1 ];\n\tS1 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 1 ];\n\tdx1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 1 ], shapes[ 1 ], sh );\n\ty = o.data;\n\tst = o.strides;\n\tdy0 = st[ 1 ];\n\tdy1 = st[ 0 ];\n\n\to = broadcastArray( arrays[ 2 ], shapes[ 2 ], sh );\n\tz = o.data;\n\tst = o.strides;\n\tdz0 = st[ 1 ];\n\tdz1 = st[ 0 ];\n\n\tw = arrays[ 3 ];\n\n\tj1 = 0;\n\tk1 = 0;\n\tm1 = 0;\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tj0 = 0;\n\t\tk0 = 0;\n\t\tm0 = 0;\n\t\tx0 = x[ j1 ];\n\t\ty0 = y[ k1 ];\n\t\tz0 = z[ m1 ];\n\t\tw0 = w[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tw0[ i0 ] = fcn( x0[ j0 ], y0[ k0 ], z0[ m0 ] );\n\t\t\tj0 += dx0;\n\t\t\tk0 += dy0;\n\t\t\tm0 += dz0;\n\t\t}\n\t\tj1 += dx1;\n\t\tk1 += dy1;\n\t\tm1 += dz1;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bternary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a ternary callback to elements in three broadcasted input arrays and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-ternary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var bternary2d = require( '@stdlib/array/base/broadcasted-ternary2d' );\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 1 ],\n*     [ 1, 1 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = ones2d( shapes[ 1 ] );\n* var z = ones2d( shapes[ 2 ] );\n* var out = zeros2d( shapes[ 3 ] );\n*\n* bternary2d( [ x, y, z, out ], shapes, add );\n*\n* console.log( out );\n* // => [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a broadcasted nested input array and assigns results to elements in a two-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = zeros2d( shapes[ 1 ] );\n*\n* bunary2d( [ x, y ], shapes, scale );\n*\n* console.log( y );\n* // => [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*/\nfunction bunary2d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar x0;\n\tvar y0;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\n\tsh = shapes[ 1 ];\n\tS0 = sh[ 1 ];\n\tS1 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 1 ];\n\tdx1 = st[ 0 ];\n\n\ty = arrays[ 1 ];\n\n\tj1 = 0;\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tj0 = 0;\n\t\tx0 = x[ j1 ];\n\t\ty0 = y[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\ty0[ i0 ] = fcn( x0[ j0 ] );\n\t\t\tj0 += dx0;\n\t\t}\n\t\tj1 += dx1;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bunary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a broadcasted nested input array and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-unary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var bunary2d = require( '@stdlib/array/base/broadcasted-unary2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shapes = [\n*     [ 1, 2 ],\n*     [ 2, 2 ]\n* ];\n*\n* var x = ones2d( shapes[ 0 ] );\n* var y = zeros2d( shapes[ 1 ] );\n*\n* bunary2d( [ x, y ], shapes, scale );\n*\n* console.log( y );\n* // => [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a broadcasted nested input array and assigns results to elements in a three-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shapes = [\n*     [ 1, 1, 2 ],\n*     [ 1, 2, 2 ]\n* ];\n*\n* var x = ones3d( shapes[ 0 ] );\n* var y = zeros3d( shapes[ 1 ] );\n*\n* bunary3d( [ x, y ], shapes, scale );\n*\n* console.log( y );\n* // => [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ]\n*/\nfunction bunary3d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar x0;\n\tvar x1;\n\tvar y0;\n\tvar y1;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\n\tsh = shapes[ 1 ];\n\tS0 = sh[ 2 ];\n\tS1 = sh[ 1 ];\n\tS2 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 2 ];\n\tdx1 = st[ 1 ];\n\tdx2 = st[ 0 ];\n\n\ty = arrays[ 1 ];\n\tj2 = 0;\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tj1 = 0;\n\t\tx1 = x[ j2 ];\n\t\ty1 = y[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tj0 = 0;\n\t\t\tx0 = x1[ j1 ];\n\t\t\ty0 = y1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\ty0[ i0 ] = fcn( x0[ j0 ] );\n\t\t\t\tj0 += dx0;\n\t\t\t}\n\t\t\tj1 += dx1;\n\t\t}\n\t\tj2 += dx2;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bunary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a broadcasted nested input array and assign results to elements in a three-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-unary3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var bunary3d = require( '@stdlib/array/base/broadcasted-unary3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shapes = [\n*     [ 1, 1, 2 ],\n*     [ 1, 2, 2 ]\n* ];\n*\n* var x = ones3d( shapes[ 0 ] );\n* var y = zeros3d( shapes[ 1 ] );\n*\n* bunary3d( [ x, y ], shapes, scale );\n*\n* console.log( y );\n* // => [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a broadcasted nested input array and assigns results to elements in a four-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shapes = [\n*     [ 1, 1, 1, 2 ],\n*     [ 1, 1, 2, 2 ]\n* ];\n*\n* var x = ones4d( shapes[ 0 ] );\n* var y = zeros4d( shapes[ 1 ] );\n*\n* bunary4d( [ x, y ], shapes, scale );\n*\n* console.log( y );\n* // => [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ]\n*/\nfunction bunary4d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar x0;\n\tvar x1;\n\tvar x2;\n\tvar y0;\n\tvar y1;\n\tvar y2;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\n\tsh = shapes[ 1 ];\n\tS0 = sh[ 3 ];\n\tS1 = sh[ 2 ];\n\tS2 = sh[ 1 ];\n\tS3 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 3 ];\n\tdx1 = st[ 2 ];\n\tdx2 = st[ 1 ];\n\tdx3 = st[ 0 ];\n\n\ty = arrays[ 1 ];\n\tj3 = 0;\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tj2 = 0;\n\t\tx2 = x[ j3 ];\n\t\ty2 = y[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tj1 = 0;\n\t\t\tx1 = x2[ j2 ];\n\t\t\ty1 = y2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tj0 = 0;\n\t\t\t\tx0 = x1[ j1 ];\n\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\ty0[ i0 ] = fcn( x0[ j0 ] );\n\t\t\t\t\tj0 += dx0;\n\t\t\t\t}\n\t\t\t\tj1 += dx1;\n\t\t\t}\n\t\t\tj2 += dx2;\n\t\t}\n\t\tj3 += dx3;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bunary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a broadcasted nested input array and assign results to elements in a four-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-unary4d\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var bunary4d = require( '@stdlib/array/base/broadcasted-unary4d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shapes = [\n*     [ 1, 1, 1, 2 ],\n*     [ 1, 1, 2, 2 ]\n* ];\n*\n* var x = ones4d( shapes[ 0 ] );\n* var y = zeros4d( shapes[ 1 ] );\n*\n* bunary4d( [ x, y ], shapes, scale );\n*\n* console.log( y );\n* // => [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar broadcastArray = require( './../../../base/broadcast-array' );\n\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a broadcasted nested input array and assigns results to elements in a five-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {ArrayLikeObject<NonNegativeIntegerArray>} shapes - array shapes\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shapes = [\n*     [ 1, 1, 1, 1, 2 ],\n*     [ 1, 1, 1, 2, 2 ]\n* ];\n*\n* var x = ones5d( shapes[ 0 ] );\n* var y = zeros5d( shapes[ 1 ] );\n*\n* bunary5d( [ x, y ], shapes, scale );\n*\n* console.log( y );\n* // => [ [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ] ]\n*/\nfunction bunary5d( arrays, shapes, fcn ) {\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar x0;\n\tvar x1;\n\tvar x2;\n\tvar x3;\n\tvar y0;\n\tvar y1;\n\tvar y2;\n\tvar y3;\n\tvar sh;\n\tvar st;\n\tvar o;\n\tvar x;\n\tvar y;\n\n\tsh = shapes[ 1 ];\n\tS0 = sh[ 4 ];\n\tS1 = sh[ 3 ];\n\tS2 = sh[ 2 ];\n\tS3 = sh[ 1 ];\n\tS4 = sh[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 || S4 <= 0 ) {\n\t\treturn;\n\t}\n\to = broadcastArray( arrays[ 0 ], shapes[ 0 ], sh );\n\tx = o.data;\n\tst = o.strides;\n\tdx0 = st[ 4 ];\n\tdx1 = st[ 3 ];\n\tdx2 = st[ 2 ];\n\tdx3 = st[ 1 ];\n\tdx4 = st[ 0 ];\n\n\ty = arrays[ 1 ];\n\tj4 = 0;\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tj3 = 0;\n\t\tx3 = x[ j4 ];\n\t\ty3 = y[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tj2 = 0;\n\t\t\tx2 = x3[ j3 ];\n\t\t\ty2 = y3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tj1 = 0;\n\t\t\t\tx1 = x2[ j2 ];\n\t\t\t\ty1 = y2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tj0 = 0;\n\t\t\t\t\tx0 = x1[ j1 ];\n\t\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\ty0[ i0 ] = fcn( x0[ j0 ] );\n\t\t\t\t\t\tj0 += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tj1 += dx1;\n\t\t\t\t}\n\t\t\t\tj2 += dx2;\n\t\t\t}\n\t\t\tj3 += dx3;\n\t\t}\n\t\tj4 += dx4;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = bunary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a broadcasted nested input array and assign results to elements in a five-dimensional nested output array.\n*\n* @module @stdlib/array/base/broadcasted-unary5d\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var bunary5d = require( '@stdlib/array/base/broadcasted-unary5d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shapes = [\n*     [ 1, 1, 1, 1, 2 ],\n*     [ 1, 1, 1, 2, 2 ]\n* ];\n*\n* var x = ones5d( shapes[ 0 ] );\n* var y = zeros5d( shapes[ 1 ] );\n*\n* bunary5d( [ x, y ], shapes, scale );\n*\n* console.log( y );\n* // => [ [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\nvar pow = require( '@stdlib/math/base/special/pow' );\n\n\n// MAIN //\n\n/**\n* Returns the Cartesian power.\n*\n* ## Notes\n*\n* -   The Cartesian power is an n-fold Cartesian product involving a single array. The main insight of this implementation is that the n-fold Cartesian product can be represented as an n-dimensional array stored in row-major order. As such, we can\n*\n*     -   Compute the total number of tuples, which is simply the size of the provided array (set) raised to the specified power `n`. For n-dimensional arrays, this is the equivalent of computing the product of array dimensions to determine the total number of elements.\n*     -   Initialize an array for storing indices for indexing into the provided array. For n-dimensional arrays, the index array is equivalent to an array of subscripts for indexing into each dimension.\n*     -   For the outermost loop, treat the loop index as a linear index into an n-dimensional array and resolve the corresponding subscripts.\n*     -   Continue iterating until all tuples have been generated.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeInteger} n - power\n* @returns {Array<Array>} list of ordered tuples comprising the Cartesian product\n*\n* @example\n* var x = [ 1, 2 ];\n*\n* var out = cartesianPower( x, 2 );\n* // returns [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ]\n*/\nfunction cartesianPower( x, n ) {\n\tvar get;\n\tvar out;\n\tvar tmp;\n\tvar idx;\n\tvar len;\n\tvar N;\n\tvar s;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\tN = x.length;\n\tif ( N <= 0 || n <= 0 ) {\n\t\treturn [];\n\t}\n\t// Resolve an array element accessor:\n\tget = resolveGetter( x );\n\n\t// Compute the total number of ordered tuples:\n\tlen = pow( N, n );\n\n\t// Initialize a list of indices for indexing into the array (equivalent to ndarray subscripts):\n\tidx = [];\n\tfor ( i = 0; i < n; i++ ) {\n\t\tidx.push( 0 );\n\t}\n\t// Compute the n-fold Cartesian product...\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\t// Resolve a linear index to array indices (logic is equivalent to what is found in ndarray/base/ind2sub for an ndarray stored in row-major order; see https://github.com/stdlib-js/stdlib/blob/215ca5355f3404f15996fd0ced58a98e46f22be6/lib/node_modules/%40stdlib/ndarray/base/ind2sub/lib/assign.js)...\n\t\tk = i;\n\t\tfor ( j = n-1; j >= 0; j-- ) {\n\t\t\ts = k % N;\n\t\t\tk -= s;\n\t\t\tk /= N;\n\t\t\tidx[ j ] = s;\n\t\t}\n\t\t// Generate the next ordered tuple...\n\t\ttmp = [];\n\t\tfor ( j = 0; j < n; j++ ) {\n\t\t\ttmp.push( get( x, idx[ j ] ) );\n\t\t}\n\t\tout.push( tmp );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = cartesianPower;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the Cartesian power.\n*\n* @module @stdlib/array/base/cartesian-power\n*\n* @example\n* var cartesianPower = require( '@stdlib/array/base/cartesian-power' );\n*\n* var x = [ 1, 2 ];\n*\n* var out = cartesianPower( x, 2 );\n* // returns [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ]\n*/\n\n// MAIN //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Returns the Cartesian product.\n*\n* @param {Collection} x1 - first input array\n* @param {Collection} x2 - second input array\n* @returns {Array<Array>} list of ordered tuples comprising the Cartesian product\n*\n* @example\n* var x1 = [ 1, 2, 3 ];\n* var x2 = [ 4, 5 ];\n*\n* var out = cartesianProduct( x1, x2 );\n* // returns [ [ 1, 4 ], [ 1, 5 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 3, 5 ] ]\n*/\nfunction cartesianProduct( x1, x2 ) {\n\tvar get1;\n\tvar get2;\n\tvar out;\n\tvar M;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tget1 = resolveGetter( x1 );\n\tget2 = resolveGetter( x2 );\n\n\tM = x1.length;\n\tN = x2.length;\n\tout = [];\n\tfor ( i = 0; i < M; i++ ) {\n\t\tv = get1( x1, i );\n\t\tfor ( j = 0; j < N; j++ ) {\n\t\t\tout.push( [ v, get2( x2, j ) ] );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = cartesianProduct;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the Cartesian product.\n*\n* @module @stdlib/array/base/cartesian-product\n*\n* @example\n* var cartesianProduct = require( '@stdlib/array/base/cartesian-product' );\n*\n* var x1 = [ 1, 2, 3 ];\n* var x2 = [ 4, 5 ];\n*\n* var out = cartesianProduct( x1, x2 );\n* // returns [ [ 1, 4 ], [ 1, 5 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 3, 5 ] ]\n*/\n\n// MAIN //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Returns the Cartesian square.\n*\n* @param {Collection} x - input array\n* @returns {Array<Array>} list of ordered tuples comprising the Cartesian product\n*\n* @example\n* var x = [ 1, 2 ];\n*\n* var out = cartesianSquare( x );\n* // returns [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ]\n*/\nfunction cartesianSquare( x ) {\n\tvar get;\n\tvar out;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tget = resolveGetter( x );\n\tN = x.length;\n\tout = [];\n\tfor ( i = 0; i < N; i++ ) {\n\t\tv = get( x, i );\n\t\tfor ( j = 0; j < N; j++ ) {\n\t\t\tout.push( [ v, get( x, j ) ] );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = cartesianSquare;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the Cartesian square.\n*\n* @module @stdlib/array/base/cartesian-square\n*\n* @example\n* var cartesianSquare = require( '@stdlib/array/base/cartesian-square' );\n*\n* var x = [ 1, 2 ];\n*\n* var out = cartesianSquare( x );\n* // returns [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ]\n*/\n\n// MAIN //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Copies the elements of an array-like object to a new \"generic\" array.\n*\n* @param {Collection} x - input array\n* @returns {Array} output array\n*\n* @example\n* var out = copy( [ 1, 2, 3 ] );\n* // returns [ 1, 2, 3 ]\n*/\nfunction copy( x ) {\n\tvar out;\n\tvar len;\n\tvar get;\n\tvar i;\n\n\t// Resolve an accessor for retrieving input array elements:\n\tget = resolveGetter( x );\n\n\t// Get the number of elements to copy:\n\tlen = x.length;\n\n\t// Loop over the elements...\n\tout = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tout.push( get( x, i ) ); // ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = copy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Copy the elements of an array-like object to a new \"generic\" array.\n*\n* @module @stdlib/array/base/copy\n*\n* @example\n* var copy = require( '@stdlib/array/base/copy' );\n*\n* var out = copy( [ 1, 2, 3 ] );\n* // returns [ 1, 2, 3 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math/base/assert/is-nan' );\n\n\n// FUNCTIONS //\n\n/**\n* De-duplicates values in-place.\n*\n* @private\n* @param {Array} x - input array\n* @param {PositiveInteger} limit - number of allowed consecutive duplicates\n* @returns {Array} input array\n*\n* @example\n* var x = [ 1, 1, 2, 3, 3 ];\n*\n* var y = dedupeInPlace( x, 1 );\n* // returns [ 1, 2, 3 ]\n*\n* var bool = ( x === y );\n* // returns true\n*\n* @example\n* var x = [ 1, 1, 1, 2, 1, 1, 3, 3 ];\n*\n* var y = dedupeInPlace( x, 2 );\n* // returns [ 1, 1, 2, 1, 1, 3, 3 ]\n*\n* var bool = ( x === y );\n* // returns true\n*/\nfunction dedupeInPlace( x, limit ) {\n\tvar count;\n\tvar prev;\n\tvar len;\n\tvar ptr;\n\tvar v;\n\tvar i;\n\n\tlen = x.length;\n\tif ( len === 0 ) {\n\t\treturn x;\n\t}\n\tprev = x[ 0 ];\n\tcount = 1;\n\tptr = 1;\n\tfor ( i = 1; i < len; i++ ) {\n\t\tv = x[ i ];\n\t\tif ( v === prev ) {\n\t\t\tcount += 1;\n\t\t\tif ( count <= limit ) {\n\t\t\t\tx[ ptr ] = prev;\n\t\t\t\tptr += 1;\n\t\t\t}\n\t\t} else {\n\t\t\tprev = v;\n\t\t\tcount = 1;\n\t\t\tx[ ptr ] = prev;\n\t\t\tptr += 1;\n\t\t}\n\t}\n\tx.length = ptr;\n\treturn x;\n}\n\n/**\n* De-duplicates values in-place, treating `NaN` values as equal.\n*\n* @private\n* @param {Array} x - input array\n* @param {PositiveInteger} limit - number of allowed consecutive duplicates\n* @returns {Array} input array\n*\n* @example\n* var x = [ 1, 1, 2, NaN, NaN, 3, 3 ];\n*\n* var y = dedupeEqualNaNs( x, 1 );\n* // returns [ 1, 2, NaN, 3 ]\n*\n* var bool = ( x === y );\n* // returns true\n*\n* @example\n* var x = [ 1, 1, 1, 2, 1, 1, NaN, NaN, NaN, 3, 3 ];\n*\n* var y = dedupeEqualNaNs( x, 2 );\n* // returns [ 1, 1, 2, 1, 1, NaN, NaN, 3, 3 ]\n*\n* var bool = ( x === y );\n* // returns true\n*/\nfunction dedupeEqualNaNs( x, limit ) {\n\tvar count;\n\tvar prev;\n\tvar len;\n\tvar ptr;\n\tvar FLG;\n\tvar v;\n\tvar i;\n\n\tlen = x.length;\n\tif ( len === 0 ) {\n\t\treturn x;\n\t}\n\tFLG = false;\n\tprev = x[ 0 ];\n\tif ( isnan( prev ) ) {\n\t\tFLG = true;\n\t}\n\tcount = 1;\n\tptr = 1;\n\tfor ( i = 1; i < len; i++ ) {\n\t\tv = x[ i ];\n\t\tif ( v === prev || ( FLG && isnan( v ) ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count <= limit ) {\n\t\t\t\tx[ ptr ] = prev;\n\t\t\t\tptr += 1;\n\t\t\t}\n\t\t} else {\n\t\t\tprev = v;\n\t\t\tcount = 1;\n\t\t\tx[ ptr ] = prev;\n\t\t\tptr += 1;\n\t\t\tFLG = false;\n\t\t\tif ( isnan( prev ) ) {\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t}\n\t}\n\tx.length = ptr;\n\treturn x;\n}\n\n\n// MAIN //\n\n/**\n* Removes consecutive duplicated values.\n*\n* @param {Array} x - input array\n* @param {PositiveInteger} limit - number of allowed consecutive duplicates\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {Array} de-duplicated values\n*\n* @example\n* var x = [ 1, 1, 2, 3, 3 ];\n*\n* var y = dedupe( x, 1, false );\n* // returns [ 1, 2, 3 ]\n*\n* var bool = ( x === y );\n* // returns true\n*\n* @example\n* var x = [ 1, 1, 1, 2, 1, 1, 3, 3 ];\n*\n* var y = dedupe( x, 2, false );\n* // returns [ 1, 1, 2, 1, 1, 3, 3 ]\n*\n* var bool = ( x === y );\n* // returns true\n*/\nfunction dedupe( x, limit, equalNaNs ) {\n\tif ( equalNaNs ) {\n\t\treturn dedupeEqualNaNs( x, limit );\n\t}\n\treturn dedupeInPlace( x, limit );\n}\n\n\n// EXPORTS //\n\nmodule.exports = dedupe;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Remove consecutive duplicated values.\n*\n* @module @stdlib/array/base/dedupe\n*\n* @example\n* var dedupe = require( '@stdlib/array/base/dedupe' );\n*\n* var x = [ 1, 1, 2, 3, 3 ];\n*\n* var y = dedupe( x, 1, false );\n* // returns [ 1, 2, 3 ]\n*\n* var bool = ( x === y );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplex128Array = require( './../../../base/assert/is-complex128array' );\nvar isComplex64Array = require( './../../../base/assert/is-complex64array' );\nvar arraylike2object = require( './../../../base/arraylike2object' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether all elements in an array are truthy.\n*\n* @private\n* @param {Collection} x - input array\n* @returns {boolean} boolean indicating whether all elements are truthy\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = internal( x );\n* // returns true\n*\n* @example\n* var x = [ 1, 2, 0, 4 ];\n*\n* var out = internal( x );\n* // returns false\n*/\nfunction internal( x ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( !x[ i ] ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in a complex number array are truthy.\n*\n* @private\n* @param {Collection} x - underlying data buffer\n* @returns {boolean} boolean indicating whether all elements are truthy\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = internalComplex( x );\n* // returns true\n*\n* @example\n* var x = [ 1, 2, 0, 4 ];\n*\n* var out = internalComplex( x );\n* // returns true\n*\n* @example\n* var x = [ 1, 2, 0, 0 ];\n*\n* var out = internalComplex( x );\n* // returns false\n*/\nfunction internalComplex( x ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i += 2 ) {\n\t\tif ( !( x[ i ] || x[ i+1 ] ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in an array are truthy.\n*\n* @private\n* @param {Object} x - input array object\n* @returns {boolean} boolean indicating whether all elements are truthy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var out = accessors( x );\n* // returns true\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 0, 4 ] ) );\n*\n* var out = accessors( x );\n* // returns false\n*/\nfunction accessors( x ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tif ( !get( data, i ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether all elements in an array are truthy.\n*\n* @param {Collection} x - input array\n* @returns {boolean} boolean indicating whether all elements are truthy\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = every( x );\n* // returns true\n*\n* @example\n* var x = [ 1, 2, 0, 4 ];\n*\n* var out = every( x );\n* // returns false\n*/\nfunction every( x ) {\n\tvar obj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\t// If provided a complex number array, reinterpret as a real typed array and test interleaved real and imaginary components, where we consider a complex number to be truthy if at least one component is non-zero...\n\t\tif ( isComplex128Array( x ) ) {\n\t\t\treturn internalComplex( reinterpret128( x, 0 ) );\n\t\t}\n\t\tif ( isComplex64Array( x ) ) {\n\t\t\treturn internalComplex( reinterpret64( x, 0 ) );\n\t\t}\n\t\treturn accessors( obj );\n\t}\n\treturn internal( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = every;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether all elements in an array are truthy.\n*\n* @module @stdlib/array/base/every\n*\n* @example\n* var every = require( '@stdlib/array/base/every' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = every( x );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'every' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = internal( x, isPositive );\n* // returns true\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( !predicate.call( thisArg, x[ i ], i, x ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns true\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tif ( !predicate.call( thisArg, get( data, i ), i, data ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = everyBy( x, isPositive );\n* // returns true\n*/\nfunction everyBy( x, predicate, thisArg ) {\n\tvar obj;\n\tif ( hasMethod( x, 'every' ) ) {\n\t\treturn x.every( predicate, thisArg );\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = everyBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether all elements in an array pass a test implemented by a predicate function.\n*\n* @module @stdlib/array/base/every-by\n*\n* @example\n* var everyBy = require( '@stdlib/array/base/every-by' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = everyBy( x, isPositive );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = internal( x, isPositive );\n* // returns true\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar i;\n\tfor ( i = x.length-1; i >= 0; i-- ) {\n\t\tif ( !predicate.call( thisArg, x[ i ], i, x ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns true\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = data.length-1; i >= 0; i-- ) {\n\t\tif ( !predicate.call( thisArg, get( data, i ), i, data ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function, iterating from right to left.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = everyByRight( x, isPositive );\n* // returns true\n*/\nfunction everyByRight( x, predicate, thisArg ) {\n\tvar obj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = everyByRight;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether all elements in an array pass a test implemented by a predicate function, iterating from right to left.\n*\n* @module @stdlib/array/base/every-by-right\n*\n* @example\n* var everyByRight = require( '@stdlib/array/base/every-by-right' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = everyByRight( x, isPositive );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a filled \"generic\" array according to a provided callback function.\n*\n* @param {NonNegativeInteger} len - array length\n* @param {Callback} clbk - callback function\n* @param {*} [thisArg] - callback function execution context\n* @returns {Array} filled array\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n*\n* var out = filledBy( 3, constantFunction( 'beep' ) );\n* // returns [ 'beep', 'beep', 'beep' ]\n*/\nfunction filledBy( len, clbk, thisArg ) {\n\tvar arr;\n\tvar i;\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i = 0; i < len; i++ ) {\n\t\tarr.push( clbk.call( thisArg, i ) );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filledBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled \"generic\" array according to a provided callback function.\n*\n* @module @stdlib/array/base/filled-by\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n* var filledBy = require( '@stdlib/array/base/filled-by' );\n*\n* var out = filledBy( 3, constantFunction( 'beep' ) );\n* // returns [ 'beep', 'beep', 'beep' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled = require( './../../../base/filled' );\n\n\n// MAIN //\n\n/**\n* Returns a filled two-dimensional nested array.\n*\n* @param {*} value - fill value\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = filled2d( 0.0, [ 1, 3 ] );\n* // returns [ [ 0.0, 0.0, 0.0 ] ]\n*\n* @example\n* var out = filled2d( 'beep', [ 3, 1 ] );\n* // returns [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ]\n*/\nfunction filled2d( value, shape ) {\n\tvar arr;\n\tvar S0;\n\tvar S1;\n\tvar i;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i = 0; i < S1; i++ ) {\n\t\tarr.push( filled( value, S0 ) );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled two-dimensional nested array.\n*\n* @module @stdlib/array/base/filled2d\n*\n* @example\n* var filled2d = require( '@stdlib/array/base/filled2d' );\n*\n* var out = filled2d( 0.0, [ 1, 3 ] );\n* // returns [ [ 0.0, 0.0, 0.0 ] ]\n*\n* @example\n* var filled2d = require( '@stdlib/array/base/filled2d' );\n*\n* var out = filled2d( 'beep', [ 3, 1 ] );\n* // returns [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a filled two-dimensional nested array according to a provided callback function.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} clbk - callback function\n* @param {*} [thisArg] - callback function execution context\n* @returns {Array} filled array\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n*\n* var out = filled2dBy( [ 1, 3 ], constantFunction( 'beep' ) );\n* // returns [ [ 'beep', 'beep', 'beep' ] ]\n*/\nfunction filled2dBy( shape, clbk, thisArg ) {\n\tvar arr;\n\tvar a0;\n\tvar S0;\n\tvar S1;\n\tvar i;\n\tvar j;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i = 0; i < S1; i++ ) {\n\t\ta0 = [];\n\t\tfor ( j = 0; j < S0; j++ ) {\n\t\t\ta0.push( clbk.call( thisArg, [ i, j ] ) );\n\t\t}\n\t\tarr.push( a0 );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled2dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled two-dimensional nested array according to a provided callback function.\n*\n* @module @stdlib/array/base/filled2d-by\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n* var filled2dBy = require( '@stdlib/array/base/filled2d-by' );\n*\n* var out = filled2dBy( [ 1, 3 ], constantFunction( 'beep' ) );\n* // returns [ [ 'beep', 'beep', 'beep' ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled = require( './../../../base/filled' );\n\n\n// MAIN //\n\n/**\n* Returns a filled three-dimensional nested array.\n*\n* @param {*} value - fill value\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = filled3d( 0.0, [ 1, 1, 3 ] );\n* // returns [ [ [ 0.0, 0.0, 0.0 ] ] ]\n*\n* @example\n* var out = filled3d( 'beep', [ 1, 3, 1 ] );\n* // returns [ [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ] ]\n*/\nfunction filled3d( value, shape ) {\n\tvar out;\n\tvar a1;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i2;\n\tvar i1;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tout = [];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\ta1 = [];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\ta1.push( filled( value, S0 ) );\n\t\t}\n\t\tout.push( a1 );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled three-dimensional nested array.\n*\n* @module @stdlib/array/base/filled3d\n*\n* @example\n* var filled3d = require( '@stdlib/array/base/filled3d' );\n*\n* var out = filled3d( 0.0, [ 1, 1, 3 ] );\n* // returns [ [ [ 0.0, 0.0, 0.0 ] ] ]\n*\n* @example\n* var filled3d = require( '@stdlib/array/base/filled3d' );\n*\n* var out = filled3d( 'beep', [ 1, 3, 1 ] );\n* // returns [ [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a filled three-dimensional nested array according to a provided callback function.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} clbk - callback function\n* @param {*} [thisArg] - callback function execution context\n* @returns {Array} filled array\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n*\n* var out = filled3dBy( [ 1, 1, 3 ], constantFunction( 'beep' ) );\n* // returns [ [ [ 'beep', 'beep', 'beep' ] ] ]\n*/\nfunction filled3dBy( shape, clbk, thisArg ) {\n\tvar arr;\n\tvar a0;\n\tvar a1;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\ta1 = [];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\ta0 = [];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\ta0.push( clbk.call( thisArg, [ i2, i1, i0 ] ) );\n\t\t\t}\n\t\t\ta1.push( a0 );\n\t\t}\n\t\tarr.push( a1 );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled3dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled three-dimensional nested array according to a provided callback function.\n*\n* @module @stdlib/array/base/filled3d-by\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n* var filled3dBy = require( '@stdlib/array/base/filled3d-by' );\n*\n* var out = filled3dBy( [ 1, 1, 3 ], constantFunction( 'beep' ) );\n* // returns [ [ [ 'beep', 'beep', 'beep' ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled = require( './../../../base/filled' );\n\n\n// MAIN //\n\n/**\n* Returns a filled four-dimensional nested array.\n*\n* @param {*} value - fill value\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = filled4d( 0.0, [ 1, 1, 1, 3 ] );\n* // returns [ [ [ [ 0.0, 0.0, 0.0 ] ] ] ]\n*\n* @example\n* var out = filled4d( 'beep', [ 1, 1, 3, 1 ] );\n* // returns [ [ [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ] ] ]\n*/\nfunction filled4d( value, shape ) {\n\tvar out;\n\tvar a1;\n\tvar a2;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tout = [];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\ta2 = [];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\ta1 = [];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\ta1.push( filled( value, S0 ) );\n\t\t\t}\n\t\t\ta2.push( a1 );\n\t\t}\n\t\tout.push( a2 );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled four-dimensional nested array.\n*\n* @module @stdlib/array/base/filled4d\n*\n* @example\n* var filled4d = require( '@stdlib/array/base/filled4d' );\n*\n* var out = filled4d( 0.0, [ 1, 1, 1, 3 ] );\n* // returns [ [ [ [ 0.0, 0.0, 0.0 ] ] ] ]\n*\n* @example\n* var filled4d = require( '@stdlib/array/base/filled4d' );\n*\n* var out = filled4d( 'beep', [ 1, 1, 3, 1 ] );\n* // returns [ [ [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a filled four-dimensional nested array according to a provided callback function.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} clbk - callback function\n* @param {*} [thisArg] - callback function execution context\n* @returns {Array} filled array\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n*\n* var out = filled4dBy( [ 1, 1, 1, 3 ], constantFunction( 'beep' ) );\n* // returns [ [ [ [ 'beep', 'beep', 'beep' ] ] ] ]\n*/\nfunction filled4dBy( shape, clbk, thisArg ) {\n\tvar arr;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\ta2 = [];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\ta1 = [];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\ta0 = [];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\ta0.push( clbk.call( thisArg, [ i3, i2, i1, i0 ] ) );\n\t\t\t\t}\n\t\t\t\ta1.push( a0 );\n\t\t\t}\n\t\t\ta2.push( a1 );\n\t\t}\n\t\tarr.push( a2 );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled4dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled four-dimensional nested array according to a provided callback function.\n*\n* @module @stdlib/array/base/filled4d-by\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n* var filled4dBy = require( '@stdlib/array/base/filled4d-by' );\n*\n* var out = filled4dBy( [ 1, 1, 1, 3 ], constantFunction( 'beep' ) );\n* // returns [ [ [ [ 'beep', 'beep', 'beep' ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled = require( './../../../base/filled' );\n\n\n// MAIN //\n\n/**\n* Returns a filled five-dimensional nested array.\n*\n* @param {*} value - fill value\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = filled5d( 0.0, [ 1, 1, 1, 1, 3 ] );\n* // returns [ [ [ [ [ 0.0, 0.0, 0.0 ] ] ] ] ]\n*\n* @example\n* var out = filled5d( 'beep', [ 1, 1, 1, 3, 1 ] );\n* // returns [ [ [ [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ] ] ] ]\n*/\nfunction filled5d( value, shape ) {\n\tvar out;\n\tvar a1;\n\tvar a2;\n\tvar a3;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tout = [];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\ta3 = [];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\ta2 = [];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\ta1 = [];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\ta1.push( filled( value, S0 ) );\n\t\t\t\t}\n\t\t\t\ta2.push( a1 );\n\t\t\t}\n\t\t\ta3.push( a2 );\n\t\t}\n\t\tout.push( a3 );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled five-dimensional nested array.\n*\n* @module @stdlib/array/base/filled5d\n*\n* @example\n* var filled5d = require( '@stdlib/array/base/filled5d' );\n*\n* var out = filled5d( 0.0, [ 1, 1, 1, 1, 3 ] );\n* // returns [ [ [ [ [ 0.0, 0.0, 0.0 ] ] ] ] ]\n*\n* @example\n* var filled5d = require( '@stdlib/array/base/filled5d' );\n*\n* var out = filled5d( 'beep', [ 1, 1, 1, 3, 1 ] );\n* // returns [ [ [ [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a filled five-dimensional nested array according to a provided callback function.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} clbk - callback function\n* @param {*} [thisArg] - callback function execution context\n* @returns {Array} filled array\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n*\n* var out = filled5dBy( [ 1, 1, 1, 1, 3 ], constantFunction( 'beep' ) );\n* // returns [ [ [ [ [ 'beep', 'beep', 'beep' ] ] ] ] ]\n*/\nfunction filled5dBy( shape, clbk, thisArg ) {\n\tvar arr;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\tvar a3;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\n\t// Manually push elements in order to ensure \"fast\" elements...\n\tarr = [];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\ta3 = [];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\ta2 = [];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\ta1 = [];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\ta0 = [];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\ta0.push( clbk.call( thisArg, [ i4, i3, i2, i1, i0 ] ) );\n\t\t\t\t\t}\n\t\t\t\t\ta1.push( a0 );\n\t\t\t\t}\n\t\t\t\ta2.push( a1 );\n\t\t\t}\n\t\t\ta3.push( a2 );\n\t\t}\n\t\tarr.push( a3 );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filled5dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled five-dimensional nested array according to a provided callback function.\n*\n* @module @stdlib/array/base/filled5d-by\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n* var filled5dBy = require( '@stdlib/array/base/filled5d-by' );\n*\n* var out = filled5dBy( [ 1, 1, 1, 1, 3 ], constantFunction( 'beep' ) );\n* // returns [ [ [ [ [ 'beep', 'beep', 'beep' ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled = require( './../../../base/filled' );\n\n\n// FUNCTIONS //\n\n/**\n* Recursive fills an array.\n*\n* @private\n* @param {*} value - fill value\n* @param {NonNegativeInteger} ndims - number of dimensions\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {NonNegativeInteger} dim - dimension index\n* @param {Array} out - output array\n* @returns {Array} output array\n*/\nfunction recurse( value, ndims, shape, dim, out ) {\n\tvar S;\n\tvar d;\n\tvar i;\n\n\tS = shape[ dim ];\n\n\t// Check whether we're filling the last dimension:\n\td = dim + 1;\n\tif ( d === ndims ) {\n\t\treturn filled( value, S );\n\t}\n\n\t// Fill nested dimensions...\n\tfor ( i = 0; i < S; i++ ) {\n\t\tout.push( recurse( value, ndims, shape, d, [] ) );\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a filled two-dimensional nested array.\n*\n* @param {*} value - fill value\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = fillednd( 0.0, [ 3 ] );\n* // returns [ 0.0, 0.0, 0.0 ]\n*\n* @example\n* var out = fillednd( 0.0, [ 1, 3 ] );\n* // returns [ [ 0.0, 0.0, 0.0 ] ]\n*\n* @example\n* var out = fillednd( 'beep', [ 3, 1 ] );\n* // returns [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ]\n*/\nfunction fillednd( value, shape ) {\n\treturn recurse( value, shape.length, shape, 0, [] );\n}\n\n\n// EXPORTS //\n\nmodule.exports = fillednd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled n-dimensional nested array.\n*\n* @module @stdlib/array/base/fillednd\n*\n* @example\n* var fillednd = require( '@stdlib/array/base/fillednd' );\n*\n* var out = fillednd( 0.0, [ 1, 3 ] );\n* // returns [ [ 0.0, 0.0, 0.0 ] ]\n*\n* @example\n* var fillednd = require( '@stdlib/array/base/fillednd' );\n*\n* var out = fillednd( 'beep', [ 3, 1 ] );\n* // returns [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\n/**\n* Recursive fills an array.\n*\n* @private\n* @param {NonNegativeInteger} ndims - number of dimensions\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {NonNegativeInteger} dim - dimension index\n* @param {NonNegativeIntegerArray} indices - outer array element indices\n* @param {Array} out - output array\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Array} output array\n*/\nfunction recurse( ndims, shape, dim, indices, out, clbk, thisArg ) {\n\tvar idx;\n\tvar FLG;\n\tvar S;\n\tvar d;\n\tvar i;\n\n\t// Check whether we're filling the last dimension:\n\td = dim + 1;\n\tFLG = ( d === ndims );\n\n\tS = shape[ dim ];\n\tfor ( i = 0; i < S; i++ ) {\n\t\tidx = indices.slice(); // we explicitly copy in order to avoid potential mutation when calling `clbk`\n\t\tidx.push( i );\n\t\tif ( FLG ) {\n\t\t\tout.push( clbk.call( thisArg, idx ) );\n\t\t} else {\n\t\t\tout.push( recurse( ndims, shape, d, idx, [], clbk, thisArg ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a filled two-dimensional nested array according to a provided callback function.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Array} filled array\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n*\n* var out = filledndBy( [ 3, 1 ], constantFunction( 'beep' ) );\n* // returns [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ]\n*/\nfunction filledndBy( shape, clbk, thisArg ) {\n\treturn recurse( shape.length, shape, 0, [], [], clbk, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = filledndBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled n-dimensional nested array according to a callback function.\n*\n* @module @stdlib/array/base/fillednd-by\n*\n* @example\n* var constantFunction = require( '@stdlib/utils/constant-function' );\n* var filledndBy = require( '@stdlib/array/base/fillednd-by' );\n*\n* var out = filledndBy( [ 3, 1 ], constantFunction( 'beep' ) );\n* // returns [ [ 'beep' ], [ 'beep' ], [ 'beep' ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'filter' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns a shallow copy of an array containing only those elements which pass a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {Array} output array\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, -2, -3, 4 ];\n*\n* var out = internal( x, isPositive );\n* // returns [ 1, 4 ]\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tv = x[ i ];\n\t\tif ( predicate.call( thisArg, v, i, x ) ) {\n\t\t\tout.push( v );\n\t\t}\n\t}\n\treturn out;\n}\n\n/**\n* Returns a shallow copy of an array containing only those elements which pass a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {Array} output array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 1, -2, -3, 4 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns [ 1, 4 ]\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar out;\n\tvar v;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tout = [];\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tv = get( data, i );\n\t\tif ( predicate.call( thisArg, v, i, data ) ) {\n\t\t\tout.push( v );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a shallow copy of an array containing only those elements which pass a test implemented by a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {Collection} output array\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, -2, -3, 4 ];\n*\n* var out = filter( x, isPositive );\n* // returns [ 1, 4 ]\n*/\nfunction filter( x, predicate, thisArg ) {\n\tvar obj;\n\tif ( hasMethod( x, 'filter' ) ) {\n\t\treturn x.filter( predicate, thisArg );\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = filter;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a shallow copy of an array containing only those elements which pass a test implemented by a predicate function.\n*\n* @module @stdlib/array/base/filter\n*\n* @example\n* var filter = require( '@stdlib/array/base/filter' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, -2, -3, 4 ];\n*\n* var out = filter( x, isPositive );\n* // returns [ 1, 4 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Returns the first element of an array-like object.\n*\n* @param {Collection} arr - input array\n* @returns {*} - first element\n*\n* @example\n* var out = first( [ 1, 2, 3 ] );\n* // returns 1\n*/\nfunction first( arr ) {\n\tvar get;\n\n\tif ( arr.length === 0 ) {\n\t\treturn;\n\t}\n\t// Resolve an accessor for retrieving input array elements:\n\tget = resolveGetter( arr );\n\n\t// Return the first element:\n\treturn get( arr, 0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = first;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the first element of an array-like object.\n*\n* @module @stdlib/array/base/first\n*\n* @example\n* var first = require( '@stdlib/array/base/first' );\n*\n* var out = first( [ 1, 2, 3 ] );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar shape2strides = require( '@stdlib/ndarray/base/shape2strides' );\nvar vind2bind = require( '@stdlib/ndarray/base/vind2bind' );\nvar numel = require( '@stdlib/ndarray/base/numel' );\nvar grev = require( '@stdlib/blas/ext/base/grev' );\nvar zeros = require( './../../../base/zeros' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// FUNCTIONS //\n\n/**\n* Copies a specified number of array elements to a provided array.\n*\n* @private\n* @param {Array} x - input array\n* @param {NonNegativeInteger} N - number of elements to copy\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = [ 0, 0, 0 ];\n* copy( x, 3, out, 1, 0 );\n*\n* var o = out;\n* // returns [ 1, 2, 3 ]\n*/\nfunction copy( x, N, out, stride, offset ) {\n\tvar i;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tout[ offset ] = x[ i ];\n\t\toffset += stride;\n\t}\n}\n\n/**\n* Recursively flattens an array in lexicographic order.\n*\n* @private\n* @param {Array} x - array to flatten\n* @param {NonNegativeInteger} ndims - number of dimensions in the input array\n* @param {NonNegativeIntegerArray} shape - shape of the input array\n* @param {NonNegativeInteger} dim - dimension index\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n* @returns {NonNegativeInteger} offset for next output array element\n*/\nfunction recurseLexicographic( x, ndims, shape, dim, out, stride, offset ) {\n\tvar FLG;\n\tvar S;\n\tvar d;\n\tvar i;\n\n\t// Check whether we've reached the last dimension:\n\td = dim + 1;\n\tFLG = ( d === ndims );\n\n\tS = shape[ dim ];\n\tfor ( i = 0; i < S; i++ ) {\n\t\tif ( FLG ) {\n\t\t\tout[ offset ] = x[ i ];\n\t\t\toffset += stride;\n\t\t} else {\n\t\t\toffset = recurseLexicographic( x[ i ], ndims, shape, d, out, stride, offset ); // eslint-disable-line max-len\n\t\t}\n\t}\n\treturn offset;\n}\n\n/**\n* Flattens an array in colexicographic order.\n*\n* @private\n* @param {Array} x - array to flatten\n* @param {NonNegativeInteger} ndims - number of dimensions in the input array\n* @param {NonNegativeIntegerArray} shape - shape of the input array\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n*/\nfunction flattenColexicographic( x, ndims, shape, out, stride, offset ) {\n\tvar len;\n\tvar tmp;\n\tvar ord;\n\tvar sh;\n\tvar sx;\n\tvar j;\n\tvar i;\n\n\t// Note that, in contrast to lexicographic iteration, we cannot readily define a straightforward recursive definition for colexicographic iteration. Accordingly, we have to perform a workaround in which we first flatten in lexicographic order and then perform an out-of-place transposition to return an array in colexicographic order.\n\n\t// Determine how many elements will be in the output array:\n\tlen = numel( shape );\n\n\t// For input arrays having an arbitrary number of dimensions, first flatten in lexicographic order:\n\ttmp = zeros( len );\n\trecurseLexicographic( x, ndims, shape, 0, tmp, 1, 0 );\n\n\t// Define the memory layout:\n\tord = 'row-major';\n\n\t// Generate a stride array for lexicographic order:\n\tsx = shape2strides( shape, ord );\n\n\t// Reverse the dimensions and strides (i.e., define the shape and strides of the transpose):\n\tsh = zeros( ndims );\n\tcopy( shape, ndims, sh, 1, 0 );\n\tgrev( ndims, sh, 1 );\n\tgrev( ndims, sx, 1 );\n\n\t// Iterate over each element based on the linear **view** index (note: this has negative performance implications due to lack of data locality)...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = vind2bind( sh, sx, 0, ord, i, MODE );\n\t\tout[ offset ] = tmp[ j ];\n\t\toffset += stride;\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Flattens an n-dimensional nested array and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten( x, [ 2, 2 ], false, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 2, 3, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten( x, [ 2, 2 ], true, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*/\nfunction flatten( x, shape, colexicographic, out, stride, offset ) {\n\tvar ndims = shape.length;\n\tif ( ndims === 0 ) { // 0-dimensional array\n\t\treturn out;\n\t}\n\tif ( ndims === 1 ) { // 1-dimensional array\n\t\t// For 1-dimensional arrays, we can perform a simple copy:\n\t\tcopy( x, shape[ 0 ], out, stride, offset );\n\t\treturn out;\n\t}\n\tif ( colexicographic ) {\n\t\tflattenColexicographic( x, ndims, shape, out, stride, offset );\n\t\treturn out;\n\t}\n\trecurseLexicographic( x, ndims, shape, 0, out, stride, offset );\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar numel = require( '@stdlib/ndarray/base/numel' );\nvar zeros = require( './../../../base/zeros' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\n/**\n* Flattens an n-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @returns {Array} flattened array\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten( x, [ 2, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten( x, [ 2, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*/\nfunction flatten( x, shape, colexicographic ) {\n\tvar out = zeros( numel( shape ) );\n\treturn assign( x, shape, colexicographic, out, 1, 0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten an n-dimensional nested array.\n*\n* @module @stdlib/array/base/flatten\n*\n* @example\n* var flatten = require( '@stdlib/array/base/flatten' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten( x, [ 2, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var flatten = require( '@stdlib/array/base/flatten' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten( x, [ 2, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten = require( '@stdlib/array/base/flatten' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten.assign( x, [ 2, 2 ], true, out, 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar shape2strides = require( '@stdlib/ndarray/base/shape2strides' );\nvar vind2bind = require( '@stdlib/ndarray/base/vind2bind' );\nvar numel = require( '@stdlib/ndarray/base/numel' );\nvar grev = require( '@stdlib/blas/ext/base/grev' );\nvar zeros = require( './../../../base/zeros' );\nvar copy = require( './../../../base/copy-indexed' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// FUNCTIONS //\n\n/**\n* Copies a specified number of array elements to a provided array according to a callback function.\n*\n* @private\n* @param {Array} x - input array\n* @param {NonNegativeInteger} N - number of elements to copy\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = [ 0, 0, 0 ];\n* copyBy( x, 3, out, 1, 0, scale );\n*\n* var o = out;\n* // returns [ 2, 4, 6 ]\n*/\nfunction copyBy( x, N, out, stride, offset, clbk, thisArg ) {\n\tvar i;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tout[ offset ] = clbk.call( thisArg, x[ i ], [ i ], x );\n\t\toffset += stride;\n\t}\n}\n\n/**\n* Recursively flattens an array in lexicographic order.\n*\n* @private\n* @param {Array} orig - original input array\n* @param {Array} x - array to flatten\n* @param {NonNegativeInteger} ndims - number of dimensions in the input array\n* @param {NonNegativeIntegerArray} shape - shape of the input array\n* @param {NonNegativeInteger} dim - dimension index\n* @param {NonNegativeIntegerArray} indices - outer array element indices\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {NonNegativeInteger} offset for next output array element\n*/\nfunction recurseLexicographic( orig, x, ndims, shape, dim, indices, out, stride, offset, clbk, thisArg ) { // eslint-disable-line max-params\n\tvar FLG;\n\tvar idx;\n\tvar S;\n\tvar d;\n\tvar i;\n\n\t// Check whether we've reached the last dimension:\n\td = dim + 1;\n\tFLG = ( d === ndims );\n\n\tS = shape[ dim ];\n\tfor ( i = 0; i < S; i++ ) {\n\t\tidx = indices.slice(); // we explicitly copy in order to avoid potential mutation when calling `clbk`\n\t\tidx.push( i );\n\t\tif ( FLG ) {\n\t\t\tout[ offset ] = clbk.call( thisArg, x[ i ], idx, orig );\n\t\t\toffset += stride;\n\t\t} else {\n\t\t\toffset = recurseLexicographic( orig, x[ i ], ndims, shape, d, idx, out, stride, offset, clbk, thisArg );\n\t\t}\n\t}\n\treturn offset;\n}\n\n/**\n* Flattens an array in colexicographic order.\n*\n* @private\n* @param {Array} x - array to flatten\n* @param {NonNegativeInteger} ndims - number of dimensions in the input array\n* @param {NonNegativeIntegerArray} shape - shape of the input array\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array offset\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n*/\nfunction flattenColexicographic( x, ndims, shape, out, stride, offset, clbk, thisArg ) {\n\tvar len;\n\tvar tmp;\n\tvar ord;\n\tvar sh;\n\tvar sx;\n\tvar j;\n\tvar i;\n\n\t// Note that, in contrast to lexicographic iteration, we cannot readily define a straightforward recursive definition for colexicographic iteration. Accordingly, we have to perform a workaround in which we first flatten in lexicographic order and then perform an out-of-place transposition to return an array in colexicographic order.\n\n\t// Determine how many elements will be in the output array:\n\tlen = numel( shape );\n\n\t// For input arrays having an arbitrary number of dimensions, first flatten in lexicographic order:\n\ttmp = zeros( len );\n\trecurseLexicographic( x, x, ndims, shape, 0, [], tmp, 1, 0, clbk, thisArg );\n\n\t// Define the memory layout:\n\tord = 'row-major';\n\n\t// Generate a stride array for lexicographic order:\n\tsx = shape2strides( shape, ord );\n\n\t// Reverse the dimensions and strides (i.e., define the shape and strides of the transpose):\n\tsh = copy( shape );\n\tgrev( ndims, sh, 1 );\n\tgrev( ndims, sx, 1 );\n\n\t// Iterate over each element based on the linear **view** index (note: this has negative performance implications due to lack of data locality)...\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = vind2bind( sh, sx, 0, ord, i, MODE );\n\t\tout[ offset ] = tmp[ j ];\n\t\toffset += stride;\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Flattens an n-dimensional nested array according to a callback function and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flattenBy( x, [ 2, 2 ], false, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 4, 6, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flattenBy( x, [ 2, 2 ], true, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*/\nfunction flattenBy( x, shape, colexicographic, out, stride, offset, clbk, thisArg ) {\n\tvar ndims = shape.length;\n\tif ( ndims === 0 ) { // 0-dimensional array\n\t\treturn out;\n\t}\n\tif ( ndims === 1 ) { // 1-dimensional array\n\t\t// For 1-dimensional arrays, we can perform simple iteration:\n\t\tcopyBy( x, shape[ 0 ], out, stride, offset, clbk, thisArg );\n\t\treturn out;\n\t}\n\tif ( colexicographic ) {\n\t\tflattenColexicographic( x, ndims, shape, out, stride, offset, clbk, thisArg );\n\t\treturn out;\n\t}\n\trecurseLexicographic( x, x, ndims, shape, 0, [], out, stride, offset, clbk, thisArg );\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flattenBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar numel = require( '@stdlib/ndarray/base/numel' );\nvar zeros = require( './../../../base/zeros' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\n/**\n* Flattens an n-dimensional nested array according to a callback function.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Array} flattened array\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flattenBy( x, [ 2, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flattenBy( x, [ 2, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*/\nfunction flattenBy( x, shape, colexicographic, clbk, thisArg ) {\n\tvar out = zeros( numel( shape ) );\n\treturn assign( x, shape, colexicographic, out, 1, 0, clbk, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = flattenBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten an n-dimensional nested array according to a callback function.\n*\n* @module @stdlib/array/base/flatten-by\n*\n* @example\n* var flattenBy = require( '@stdlib/array/base/flatten-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flattenBy( x, [ 2, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* var flattenBy = require( '@stdlib/array/base/flatten-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flattenBy( x, [ 2, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flattenBy = require( '@stdlib/array/base/flatten-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flattenBy.assign( x, [ 2, 2 ], true, out, 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a two-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Collection>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @returns {Array} flattened array\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2d( x, [ 2, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2d( x, [ 2, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*/\nfunction flatten2d( x, shape, colexicographic ) {\n\tvar out;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar a0;\n\n\t// Extract loop variables:\n\tS0 = shape[ 1 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 0 ];\n\n\t// Initialize an output array:\n\tout = [];\n\n\t// Iterate over the array dimensions...\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tout.push( x[ i1 ][ i0 ] ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\ta0 = x[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tout.push( a0[ i0 ] ); // equivalent to storing in row-major (C-style) order\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a two-dimensional nested array and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Collection>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2d( x, [ 2, 2 ], false, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 2, 3, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2d( x, [ 2, 2 ], true, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*/\nfunction flatten2d( x, shape, colexicographic, out, stride, offset ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar a0;\n\tvar io;\n\n\t// Extract loop variables:\n\tS0 = shape[ 1 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 0 ];\n\n\t// Iterate over the array dimensions...\n\tio = offset;\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tout[ io ] = x[ i1 ][ i0 ]; // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\tio += stride;\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\ta0 = x[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tout[ io ] = a0[ i0 ]; // equivalent to storing in row-major (C-style) order\n\t\t\tio += stride;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten a two-dimensional nested array.\n*\n* @module @stdlib/array/base/flatten2d\n*\n* @example\n* var flatten2d = require( '@stdlib/array/base/flatten2d' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2d( x, [ 2, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var flatten2d = require( '@stdlib/array/base/flatten2d' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2d( x, [ 2, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten2d = require( '@stdlib/array/base/flatten2d' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten2d.assign( x, [ 2, 2 ], true, out, 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a two-dimensional nested array according to a callback function.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Collection>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Array} flattened array\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2dBy( x, [ 2, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2dBy( x, [ 2, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*/\nfunction flatten2dBy( x, shape, colexicographic, clbk, thisArg ) {\n\tvar out;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar a0;\n\n\t// Extract loop variables:\n\tS0 = shape[ 1 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 0 ];\n\n\t// Initialize an output array:\n\tout = [];\n\n\t// Iterate over the array dimensions...\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tout.push( clbk.call( thisArg, x[ i1 ][ i0 ], [ i1, i0 ], x ) ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\ta0 = x[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tout.push( clbk.call( thisArg, a0[ i0 ], [ i1, i0 ], x ) ); // equivalent to storing in row-major (C-style) order\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten2dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a two-dimensional nested array according to a callback function and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Collection>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2dBy( x, [ 2, 2 ], false, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 4, 6, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2dBy( x, [ 2, 2 ], true, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*/\nfunction flatten2dBy( x, shape, colexicographic, out, stride, offset, clbk, thisArg ) { // eslint-disable-line max-len\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar a0;\n\tvar io;\n\n\t// Extract loop variables:\n\tS0 = shape[ 1 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 0 ];\n\n\t// Iterate over the array dimensions...\n\tio = offset;\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tout[ io ] = clbk.call( thisArg, x[ i1 ][ i0 ], [ i1, i0 ], x ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\tio += stride;\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\ta0 = x[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tout[ io ] = clbk.call( thisArg, a0[ i0 ], [ i1, i0 ], x ); // equivalent to storing in row-major (C-style) order\n\t\t\tio += stride;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten2dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten a two-dimensional nested array according to a callback function.\n*\n* @module @stdlib/array/base/flatten2d-by\n*\n* @example\n* var flatten2dBy = require( '@stdlib/array/base/flatten2d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2dBy( x, [ 2, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* var flatten2dBy = require( '@stdlib/array/base/flatten2d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = flatten2dBy( x, [ 2, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten2dBy = require( '@stdlib/array/base/flatten2d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten2dBy( x, [ 2, 2 ], true, out, 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a three-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Collection>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @returns {Array} flattened array\n*\n* @example\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3d( x, [ 2, 1, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3d( x, [ 2, 1, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*/\nfunction flatten3d( x, shape, colexicographic ) {\n\tvar out;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar a0;\n\tvar a1;\n\n\t// Extract loop variables:\n\tS0 = shape[ 2 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\n\t// Initialize an output array:\n\tout = [];\n\n\t// Iterate over the array dimensions...\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tout.push( x[ i2 ][ i1 ][ i0 ] ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\ta1 = x[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\ta0 = a1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tout.push( a0[ i0 ] ); // equivalent to storing in row-major (C-style) order\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a three-dimensional nested array and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Collection>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3d( x, [ 2, 1, 2 ], false, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 2, 3, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3d( x, [ 2, 1, 2 ], true, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*/\nfunction flatten3d( x, shape, colexicographic, out, stride, offset ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar a0;\n\tvar a1;\n\tvar io;\n\n\t// Extract loop variables:\n\tS0 = shape[ 2 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\n\t// Iterate over the array dimensions...\n\tio = offset;\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tout[ io ] = x[ i2 ][ i1 ][ i0 ]; // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\tio += stride;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\ta1 = x[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\ta0 = a1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tout[ io ] = a0[ i0 ]; // equivalent to storing in row-major (C-style) order\n\t\t\t\tio += stride;\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten a three-dimensional nested array.\n*\n* @module @stdlib/array/base/flatten3d\n*\n* @example\n* var flatten3d = require( '@stdlib/array/base/flatten3d' );\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3d( x, [ 2, 1, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var flatten3d = require( '@stdlib/array/base/flatten3d' );\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3d( x, [ 2, 1, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten3d = require( '@stdlib/array/base/flatten3d' );\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten3d.assign( x, [ 2, 1, 2 ], true, out, 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*\n* var bool = ( y === out );\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a three-dimensional nested array according to a callback function.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Collection>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Array} flattened array\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3dBy( x, [ 2, 1, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3dBy( x, [ 2, 1, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*/\nfunction flatten3dBy( x, shape, colexicographic, clbk, thisArg ) {\n\tvar out;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar a0;\n\tvar a1;\n\n\t// Extract loop variables:\n\tS0 = shape[ 2 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\n\t// Initialize an output array:\n\tout = [];\n\n\t// Iterate over the array dimensions...\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tout.push( clbk.call( thisArg, x[ i2 ][ i1 ][ i0 ], [ i2, i1, i0 ], x ) ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\ta1 = x[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\ta0 = a1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tout.push( clbk.call( thisArg, a0[ i0 ], [ i2, i1, i0 ], x ) ); // equivalent to storing in row-major (C-style) order\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten3dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a three-dimensional nested array according to a callback function and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Collection>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3dBy( x, [ 2, 1, 2 ], false, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 4, 6, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3dBy( x, [ 2, 1, 2 ], true, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*/\nfunction flatten3dBy( x, shape, colexicographic, out, stride, offset, clbk, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar a0;\n\tvar a1;\n\tvar io;\n\n\t// Extract loop variables:\n\tS0 = shape[ 2 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\n\t// Iterate over the array dimensions...\n\tio = offset;\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tout[ io ] = clbk.call( thisArg, x[ i2 ][ i1 ][ i0 ], [ i2, i1, i0 ], x ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\tio += stride;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\ta1 = x[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\ta0 = a1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tout[ io ] = clbk.call( thisArg, a0[ i0 ], [ i2, i1, i0 ], x ); // equivalent to storing in row-major (C-style) order\n\t\t\t\tio += stride;\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten3dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten a three-dimensional nested array according to a callback function.\n*\n* @module @stdlib/array/base/flatten3d-by\n*\n* @example\n* var flatten3dBy = require( '@stdlib/array/base/flatten3d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3dBy( x, [ 2, 1, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* var flatten3dBy = require( '@stdlib/array/base/flatten3d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = flatten3dBy( x, [ 2, 1, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten3dBy = require( '@stdlib/array/base/flatten3d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ 1, 2 ] ], [ [ 3, 4 ] ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten3dBy.assign( x, [ 2, 1, 2 ], true, out, 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*\n* var bool = ( y === out );\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a four-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Array<Collection>>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @returns {Array} flattened array\n*\n* @example\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4d( x, [ 2, 1, 1, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4d( x, [ 2, 1, 1, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*/\nfunction flatten4d( x, shape, colexicographic ) {\n\tvar out;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\n\t// Extract loop variables:\n\tS0 = shape[ 3 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\n\t// Initialize an output array:\n\tout = [];\n\n\t// Iterate over the array dimensions...\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tout.push( x[ i3 ][ i2 ][ i1 ][ i0 ] ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\ta2 = x[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\ta1 = a2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\ta0 = a1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tout.push( a0[ i0 ] ); // equivalent to storing in row-major (C-style) order\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a four-dimensional nested array and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Array<Collection>>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4d( x, [ 2, 1, 1, 2 ], false, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 2, 3, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4d( x, [ 2, 1, 1, 2 ], true, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*/\nfunction flatten4d( x, shape, colexicographic, out, stride, offset ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\tvar io;\n\n\t// Extract loop variables:\n\tS0 = shape[ 3 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\n\t// Iterate over the array dimensions...\n\tio = offset;\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tout[ io ] = x[ i3 ][ i2 ][ i1 ][ i0 ]; // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\t\tio += stride;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\ta2 = x[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\ta1 = a2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\ta0 = a1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tout[ io ] = a0[ i0 ]; // equivalent to storing in row-major (C-style) order\n\t\t\t\t\tio += stride;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten a four-dimensional nested array.\n*\n* @module @stdlib/array/base/flatten4d\n*\n* @example\n* var flatten4d = require( '@stdlib/array/base/flatten4d' );\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4d( x, [ 2, 1, 1, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var flatten4d = require( '@stdlib/array/base/flatten4d' );\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4d( x, [ 2, 1, 1, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten4d = require( '@stdlib/array/base/flatten4d' );\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten4d.assign( x, [ 2, 1, 1, 2 ], true, out, 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a four-dimensional nested array according to a callback function.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Array<Collection>>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Array} flattened array\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4dBy( x, [ 2, 1, 1, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4dBy( x, [ 2, 1, 1, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*/\nfunction flatten4dBy( x, shape, colexicographic, clbk, thisArg ) {\n\tvar out;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\n\t// Extract loop variables:\n\tS0 = shape[ 3 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\n\t// Initialize an output array:\n\tout = [];\n\n\t// Iterate over the array dimensions...\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tout.push( clbk.call( thisArg, x[ i3 ][ i2 ][ i1 ][ i0 ], [ i3, i2, i1, i0 ], x ) ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\ta2 = x[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\ta1 = a2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\ta0 = a1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tout.push( clbk.call( thisArg, a0[ i0 ], [ i3, i2, i1, i0 ], x ) ); // equivalent to storing in row-major (C-style) order\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten4dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a four-dimensional nested array according to a callback function and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Array<Collection>>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4dBy( x, [ 2, 1, 1, 2 ], false, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 4, 6, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4dBy( x, [ 2, 1, 1, 2 ], true, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*/\nfunction flatten4dBy( x, shape, colexicographic, out, stride, offset, clbk, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\tvar io;\n\n\t// Extract loop variables:\n\tS0 = shape[ 3 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\n\t// Iterate over the array dimensions...\n\tio = offset;\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tout[ io ] = clbk.call( thisArg, x[ i3 ][ i2 ][ i1 ][ i0 ], [ i3, i2, i1, i0 ], x ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\t\tio += stride;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\ta2 = x[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\ta1 = a2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\ta0 = a1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tout[ io ] = clbk.call( thisArg, a0[ i0 ], [ i3, i2, i1, i0 ], x ); // equivalent to storing in row-major (C-style) order\n\t\t\t\t\tio += stride;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten4dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten a four-dimensional nested array according to a callback function.\n*\n* @module @stdlib/array/base/flatten4d-by\n*\n* @example\n* var flatten4dBy = require( '@stdlib/array/base/flatten4d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4dBy( x, [ 2, 1, 1, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* var flatten4dBy = require( '@stdlib/array/base/flatten4d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = flatten4dBy( x, [ 2, 1, 1, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten4dBy = require( '@stdlib/array/base/flatten4d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ 1, 2 ] ] ], [ [ [ 3, 4 ] ] ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten4dBy.assign( x, [ 2, 1, 1, 2 ], true, out, 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a five-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Array<Array<Collection>>>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @returns {Array} flattened array\n*\n* @example\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5d( x, [ 2, 1, 1, 1, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5d( x, [ 2, 1, 1, 1, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*/\nfunction flatten5d( x, shape, colexicographic ) {\n\tvar out;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\tvar a3;\n\n\t// Extract loop variables:\n\tS0 = shape[ 4 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\n\t// Initialize an output array:\n\tout = [];\n\n\t// Iterate over the array dimensions...\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tout.push( x[ i4 ][ i3 ][ i2 ][ i1 ][ i0 ] ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\ta3 = x[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\ta2 = a3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\ta1 = a2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\ta0 = a1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tout.push( a0[ i0 ] ); // equivalent to storing in row-major (C-style) order\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a five-dimensional nested array and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Array<Array<Collection>>>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5d( x, [ 2, 1, 1, 1, 2 ], false, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 2, 3, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5d( x, [ 2, 1, 1, 1, 2 ], true, new Float64Array( 4 ), 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*/\nfunction flatten5d( x, shape, colexicographic, out, stride, offset ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\tvar a3;\n\tvar io;\n\n\t// Extract loop variables:\n\tS0 = shape[ 4 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\n\t// Iterate over the array dimensions...\n\tio = offset;\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tout[ io ] = x[ i4 ][ i3 ][ i2 ][ i1 ][ i0 ]; // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\t\t\tio += stride;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\ta3 = x[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\ta2 = a3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\ta1 = a2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\ta0 = a1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tout[ io ] = a0[ i0 ]; // equivalent to storing in row-major (C-style) order\n\t\t\t\t\t\tio += stride;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten a five-dimensional nested array.\n*\n* @module @stdlib/array/base/flatten5d\n*\n* @example\n* var flatten5d = require( '@stdlib/array/base/flatten5d' );\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5d( x, [ 2, 1, 1, 1, 2 ], false );\n* // returns [ 1, 2, 3, 4 ]\n*\n* @example\n* var flatten5d = require( '@stdlib/array/base/flatten5d' );\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5d( x, [ 2, 1, 1, 1, 2 ], true );\n* // returns [ 1, 3, 2, 4 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten5d = require( '@stdlib/array/base/flatten5d' );\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten5d.assign( x, [ 2, 1, 1, 1, 2 ], true, out, 1, 0 );\n* // returns <Float64Array>[ 1, 3, 2, 4 ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a five-dimensional nested array according to a callback function.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Array<Array<Collection>>>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Array} flattened array\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5dBy( x, [ 2, 1, 1, 1, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5dBy( x, [ 2, 1, 1, 1, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*/\nfunction flatten5dBy( x, shape, colexicographic, clbk, thisArg ) {\n\tvar out;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\tvar a3;\n\n\t// Extract loop variables:\n\tS0 = shape[ 4 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\n\t// Initialize an output array:\n\tout = [];\n\n\t// Iterate over the array dimensions...\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tout.push( clbk.call( thisArg, x[ i4 ][ i3 ][ i2 ][ i1 ][ i0 ], [ i4, i3, i2, i1, i0 ], x ) ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\ta3 = x[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\ta2 = a3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\ta1 = a2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\ta0 = a1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tout.push( clbk.call( thisArg, a0[ i0 ], [ i4, i3, i2, i1, i0 ], x ) ); // equivalent to storing in row-major (C-style) order\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten5dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable max-depth, max-len */\n\n'use strict';\n\n// MAIN //\n\n/**\n* Flattens a five-dimensional nested array according to a callback function and assigns elements to a provided output array.\n*\n* ## Notes\n*\n* -   The function assumes that all nested arrays have the same length (i.e., the input array is **not** a ragged array).\n*\n* @param {Array<Array<Array<Array<Collection>>>>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {boolean} colexicographic - specifies whether to flatten array values in colexicographic order\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @param {Function} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5dBy( x, [ 2, 1, 1, 1, 2 ], false, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 4, 6, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5dBy( x, [ 2, 1, 1, 1, 2 ], true, new Float64Array( 4 ), 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*/\nfunction flatten5dBy( x, shape, colexicographic, out, stride, offset, clbk, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar a0;\n\tvar a1;\n\tvar a2;\n\tvar a3;\n\tvar io;\n\n\t// Extract loop variables:\n\tS0 = shape[ 4 ]; // for nested arrays, the last dimensions have the fastest changing indices\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\n\t// Iterate over the array dimensions...\n\tio = offset;\n\tif ( colexicographic ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tout[ io ] = clbk.call( thisArg, x[ i4 ][ i3 ][ i2 ][ i1 ][ i0 ], [ i4, i3, i2, i1, i0 ], x ); // equivalent to storing in column-major (Fortran-style) order\n\t\t\t\t\t\t\tio += stride;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\ta3 = x[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\ta2 = a3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\ta1 = a2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\ta0 = a1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tout[ io ] = clbk.call( thisArg, a0[ i0 ], [ i4, i3, i2, i1, i0 ], x ); // equivalent to storing in row-major (C-style) order\n\t\t\t\t\t\tio += stride;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flatten5dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Flatten a five-dimensional nested array according to a callback function.\n*\n* @module @stdlib/array/base/flatten5d-by\n*\n* @example\n* var flatten5dBy = require( '@stdlib/array/base/flatten5d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5dBy( x, [ 2, 1, 1, 1, 2 ], false, scale );\n* // returns [ 2, 4, 6, 8 ]\n*\n* @example\n* var flatten5dBy = require( '@stdlib/array/base/flatten5d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = flatten5dBy( x, [ 2, 1, 1, 1, 2 ], true, scale );\n* // returns [ 2, 6, 4, 8 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var flatten5dBy = require( '@stdlib/array/base/flatten5d-by' );\n*\n* function scale( v ) {\n*     return v * 2;\n* }\n*\n* var x = [ [ [ [ [ 1, 2 ] ] ] ], [ [ [ [ 3, 4 ] ] ] ] ];\n*\n* var out = new Float64Array( 4 );\n* var y = flatten5dBy.assign( x, [ 2, 1, 1, 1, 2 ], true, out, 1, 0, scale );\n* // returns <Float64Array>[ 2, 6, 4, 8 ]\n*\n* var bool = ( y === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Reverses the order of elements along the last dimension of a two-dimensional nested input array.\n*\n* ## Notes\n*\n* -   The function does **not** perform a deep copy of nested array elements.\n*\n* @param {ArrayLikeObject<Collection>} x - nested input array\n* @returns {Array<Collection>} output array\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ];\n*\n* var out = fliplr2d( x );\n* // returns [ [ 2, 1 ], [ 4, 3 ], [ 6, 5 ] ]\n*/\nfunction fliplr2d( x ) {\n\tvar out;\n\tvar x0;\n\tvar y0;\n\tvar i1;\n\tvar i0;\n\n\tout = [];\n\tfor ( i1 = 0; i1 < x.length; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = [];\n\t\tfor ( i0 = x0.length-1; i0 >= 0; i0-- ) {\n\t\t\ty0.push( x0[ i0 ] );\n\t\t}\n\t\tout.push( y0 );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fliplr2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse the order of elements along the last dimension of a two-dimensional nested input array.\n*\n* @module @stdlib/array/base/fliplr2d\n*\n* @example\n* var fliplr = require( '@stdlib/array/base/fliplr2d' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ];\n*\n* var out = fliplr2d( x );\n* // returns [ [ 2, 1 ], [ 4, 3 ], [ 6, 5 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar fliplr2d = require( './../../../base/fliplr2d' );\n\n\n// MAIN //\n\n/**\n* Reverses the order of elements along the last dimension of a three-dimensional nested input array.\n*\n* ## Notes\n*\n* -   The function does **not** perform a deep copy of nested array elements.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<Collection>>} x - nested input array\n* @returns {Array<Array<Collection>>} output array\n*\n* @example\n* var x = [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ];\n*\n* var out = fliplr3d( x );\n* // returns [ [ [ 2, 1 ], [ 4, 3 ], [ 6, 5 ] ] ]\n*/\nfunction fliplr3d( x ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tout.push( fliplr2d( x[ i ] ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fliplr3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse the order of elements along the last dimension of a three-dimensional nested input array.\n*\n* @module @stdlib/array/base/fliplr3d\n*\n* @example\n* var fliplr = require( '@stdlib/array/base/fliplr3d' );\n*\n* var x = [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ];\n*\n* var out = fliplr3d( x );\n* // returns [ [ [ 2, 1 ], [ 4, 3 ], [ 6, 5 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar fliplr3d = require( './../../../base/fliplr3d' );\n\n\n// MAIN //\n\n/**\n* Reverses the order of elements along the last dimension of a four-dimensional nested input array.\n*\n* ## Notes\n*\n* -   The function does **not** perform a deep copy of nested array elements.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<Collection>>>} x - nested input array\n* @returns {Array<Array<Array<Collection>>>} output array\n*\n* @example\n* var x = [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ];\n*\n* var out = fliplr4d( x );\n* // returns [ [ [ [ 2, 1 ], [ 4, 3 ], [ 6, 5 ] ] ] ]\n*/\nfunction fliplr4d( x ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tout.push( fliplr3d( x[ i ] ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fliplr4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse the order of elements along the last dimension of a four-dimensional nested input array.\n*\n* @module @stdlib/array/base/fliplr4d\n*\n* @example\n* var fliplr = require( '@stdlib/array/base/fliplr4d' );\n*\n* var x = [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ];\n*\n* var out = fliplr4d( x );\n* // returns [ [ [ [ 2, 1 ], [ 4, 3 ], [ 6, 5 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar fliplr4d = require( './../../../base/fliplr4d' );\n\n\n// MAIN //\n\n/**\n* Reverses the order of elements along the last dimension of a five-dimensional nested input array.\n*\n* ## Notes\n*\n* -   The function does **not** perform a deep copy of nested array elements.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<Collection>>>>} x - nested input array\n* @returns {Array<Array<Array<Array<Collection>>>>} output array\n*\n* @example\n* var x = [ [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ] ];\n*\n* var out = fliplr5d( x );\n* // returns [ [ [ [ [ 2, 1 ], [ 4, 3 ], [ 6, 5 ] ] ] ] ]\n*/\nfunction fliplr5d( x ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tout.push( fliplr4d( x[ i ] ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fliplr5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse the order of elements along the last dimension of a five-dimensional nested input array.\n*\n* @module @stdlib/array/base/fliplr5d\n*\n* @example\n* var fliplr = require( '@stdlib/array/base/fliplr5d' );\n*\n* var x = [ [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ] ];\n*\n* var out = fliplr5d( x );\n* // returns [ [ [ [ [ 2, 1 ], [ 4, 3 ], [ 6, 5 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Reverses the order of elements along the first dimension of a two-dimensional nested input array.\n*\n* ## Notes\n*\n* -   The function does **not** perform a deep copy of nested array elements.\n*\n* @param {ArrayLikeObject<Collection>} x - nested input array\n* @returns {Array<Collection>} output array\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ];\n*\n* var out = flipud2d( x );\n* // returns [ [ 5, 6 ], [ 3, 4 ], [ 1, 2 ] ]\n*/\nfunction flipud2d( x ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = x.length-1; i >= 0; i-- ) {\n\t\tout.push( x[ i ] );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flipud2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse the order of elements along the first dimension of a two-dimensional nested input array.\n*\n* @module @stdlib/array/base/flipud2d\n*\n* @example\n* var flipud = require( '@stdlib/array/base/flipud2d' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ];\n*\n* var out = flipud2d( x );\n* // returns [ [ 5, 6 ], [ 3, 4 ], [ 1, 2 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar flipud2d = require( './../../../base/flipud2d' );\n\n\n// MAIN //\n\n/**\n* Reverses the order of elements along the second-to-last dimension of a three-dimensional nested input array.\n*\n* ## Notes\n*\n* -   The function does **not** perform a deep copy of nested array elements.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<Collection>>} x - nested input array\n* @returns {Array<Array<Collection>>} output array\n*\n* @example\n* var x = [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ];\n*\n* var out = flipud3d( x );\n* // returns [ [ [ 5, 6 ], [ 3, 4 ], [ 1, 2 ] ] ]\n*/\nfunction flipud3d( x ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tout.push( flipud2d( x[ i ] ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flipud3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse the order of elements along the second-to-last dimension of a three-dimensional nested input array.\n*\n* @module @stdlib/array/base/flipud3d\n*\n* @example\n* var flipud = require( '@stdlib/array/base/flipud3d' );\n*\n* var x = [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ];\n*\n* var out = flipud3d( x );\n* // returns [ [ [ 5, 6 ], [ 3, 4 ], [ 1, 2 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar flipud3d = require( './../../../base/flipud3d' );\n\n\n// MAIN //\n\n/**\n* Reverses the order of elements along the second-to-last dimension of a four-dimensional nested input array.\n*\n* ## Notes\n*\n* -   The function does **not** perform a deep copy of nested array elements.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<Collection>>>} x - nested input array\n* @returns {Array<Array<Array<Collection>>>} output array\n*\n* @example\n* var x = [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ];\n*\n* var out = flipud4d( x );\n* // returns [ [ [ [ 5, 6 ], [ 3, 4 ], [ 1, 2 ] ] ] ]\n*/\nfunction flipud4d( x ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tout.push( flipud3d( x[ i ] ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flipud4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse the order of elements along the second-to-last dimension of a four-dimensional nested input array.\n*\n* @module @stdlib/array/base/flipud4d\n*\n* @example\n* var flipud = require( '@stdlib/array/base/flipud4d' );\n*\n* var x = [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ];\n*\n* var out = flipud4d( x );\n* // returns [ [ [ [ 5, 6 ], [ 3, 4 ], [ 1, 2 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar flipud4d = require( './../../../base/flipud4d' );\n\n\n// MAIN //\n\n/**\n* Reverses the order of elements along the second-to-last dimension of a five-dimensional nested input array.\n*\n* ## Notes\n*\n* -   The function does **not** perform a deep copy of nested array elements.\n*\n* @param {ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<ArrayLikeObject<Collection>>>>} x - nested input array\n* @returns {Array<Array<Array<Array<Collection>>>>} output array\n*\n* @example\n* var x = [ [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ] ];\n*\n* var out = flipud5d( x );\n* // returns [ [ [ [ [ 5, 6 ], [ 3, 4 ], [ 1, 2 ] ] ] ] ]\n*/\nfunction flipud5d( x ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tout.push( flipud4d( x[ i ] ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = flipud5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse the order of elements along the second-to-last dimension of a five-dimensional nested input array.\n*\n* @module @stdlib/array/base/flipud5d\n*\n* @example\n* var flipud = require( '@stdlib/array/base/flipud5d' );\n*\n* var x = [ [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ] ];\n*\n* var out = flipud5d( x );\n* // returns [ [ [ [ [ 5, 6 ], [ 3, 4 ], [ 1, 2 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Converts a strided array to a non-strided generic array.\n*\n* ## Notes\n*\n* -   The function assumes that the input array is compatible with the specified number of elements, index stride, and index offset.\n*\n* @param {NonNegativeInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} stride - index stride\n* @param {NonNegativeInteger} offset - index of the first indexed value in the input array\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array( 3, x, 2, 0 );\n* // returns [ 1, 3, 5 ]\n*/\nfunction strided2array( N, x, stride, offset ) {\n\tvar out;\n\tvar get;\n\tvar ix;\n\tvar i;\n\n\t// Resolve an accessor function for retrieving array elements:\n\tget = resolveGetter( x );\n\n\t// Copy strided elements to a dense non-strided array...\n\tix = offset;\n\tout = [];\n\tfor ( i = 0; i < N; i++ ) {\n\t\tout.push( get( x, ix ) );\n\t\tix += stride;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = strided2array;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert a strided array to a non-strided generic array.\n*\n* @module @stdlib/array/base/from-strided\n*\n* @example\n* var strided2array = require( '@stdlib/array/base/from-strided' );\n*\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array( 3, x, 2, 0 );\n* // returns [ 1, 3, 5 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert/is-array' );\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Groups element entries as arrays associated with distinct keys.\n*\n* @param {Collection} x - input array\n* @param {Collection} groups - array defining which group an element in the input array belongs to\n* @throws {RangeError} must provide arrays having the same length\n* @returns {Object} group results\n*\n* @example\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var groups = [ 'b', 'b', 'f', 'b' ];\n*\n* var out = groupEntries( x, groups );\n* // returns { 'b': [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], 'f': [ [ 2, 'foo' ] ] }\n*/\nfunction groupEntries( x, groups ) {\n\tvar xget;\n\tvar gget;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar o;\n\tvar v;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( groups.length !== len ) {\n\t\tthrow new RangeError( 'invalid argument. The first and second arguments must have the same length.' );\n\t}\n\t// Resolve accessors for retrieving array elements:\n\txget = resolveGetter( x );\n\tgget = resolveGetter( groups );\n\n\t// Loop over the elements and assign each to a group...\n\tout = {};\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = xget( x, i );\n\t\tg = gget( groups, i ).toString();\n\t\to = out[ g ];\n\t\tif ( isArray( o ) ) {\n\t\t\to.push( [ i, v ] );\n\t\t} else {\n\t\t\tout[ g ] = [ [ i, v ] ];\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = groupEntries;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Group element entries as arrays associated with distinct keys.\n*\n* @module @stdlib/array/base/group-entries\n*\n* @example\n* var groupEntries = require( '@stdlib/array/base/group-entries' );\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var groups = [ 'b', 'b', 'f', 'b' ];\n*\n* var out = groupEntries( x, groups );\n* // returns { 'b': [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], 'f': [ [ 2, 'foo' ] ] }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert/is-array' );\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Groups element entries according to an indicator function.\n*\n* @param {Collection} x - input array\n* @param {Function} indicator - indicator function specifying which group an element in the input collection belongs to\n* @param {*} [thisArg] - indicator function execution context\n* @returns {Object} group results\n*\n* @example\n* function indicator( v ) {\n*     return v[ 0 ];\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = groupEntriesBy( x, indicator );\n* // returns { 'b': [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], 'f': [ [ 2, 'foo' ] ] }\n*/\nfunction groupEntriesBy( x, indicator, thisArg ) {\n\tvar get;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar o;\n\tvar v;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\n\t// Resolve an accessor for retrieving array elements:\n\tget = resolveGetter( x );\n\n\t// Loop over the elements and assign each to a group...\n\tout = {};\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = get( x, i );\n\t\tg = indicator.call( thisArg, v, i, x );\n\t\to = out[ g ];\n\t\tif ( isArray( o ) ) {\n\t\t\to.push( [ i, v ] );\n\t\t} else {\n\t\t\tout[ g ] = [ [ i, v ] ];\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = groupEntriesBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Group element entries according to an indicator function.\n*\n* @module @stdlib/array/base/group-entries-by\n*\n* @example\n* var groupEntriesBy = require( '@stdlib/array/base/group-entries-by' );\n*\n* function indicator( v ) {\n*     return v[ 0 ];\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = groupEntriesBy( x, indicator );\n* // returns { 'b': [ [ 0, 'beep' ], [ 1, 'boop' ], [ 3, 'bar' ] ], 'f': [ [ 2, 'foo' ] ] }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert/is-array' );\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Groups element indices as arrays associated with distinct keys.\n*\n* @param {Collection} x - input array\n* @param {Collection} groups - array defining which group an element in the input array belongs to\n* @throws {RangeError} must provide arrays having the same length\n* @returns {Object} group results\n*\n* @example\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var groups = [ 'b', 'b', 'f', 'b' ];\n*\n* var out = groupIndices( x, groups );\n* // returns { 'b': [ 0, 1, 3 ], 'f': [ 2 ] }\n*/\nfunction groupIndices( x, groups ) {\n\tvar gget;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar o;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( groups.length !== len ) {\n\t\tthrow new RangeError( 'invalid argument. The first and second arguments must have the same length.' );\n\t}\n\t// Resolve accessors for retrieving array elements:\n\tgget = resolveGetter( groups );\n\n\t// Loop over the elements and assign each to a group...\n\tout = {};\n\tfor ( i = 0; i < len; i++ ) {\n\t\tg = gget( groups, i ).toString();\n\t\to = out[ g ];\n\t\tif ( isArray( o ) ) {\n\t\t\to.push( i );\n\t\t} else {\n\t\t\tout[ g ] = [ i ];\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = groupIndices;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Group element indices as arrays associated with distinct keys.\n*\n* @module @stdlib/array/base/group-indices\n*\n* @example\n* var groupIndices = require( '@stdlib/array/base/group-indices' );\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var groups = [ 'b', 'b', 'f', 'b' ];\n*\n* var out = groupIndices( x, groups );\n* // returns { 'b': [ 0, 1, 3 ], 'f': [ 2 ] }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert/is-array' );\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Groups element indices according to an indicator function.\n*\n* @param {Collection} x - input array\n* @param {Function} indicator - indicator function specifying which group an element in the input collection belongs to\n* @param {*} [thisArg] - indicator function execution context\n* @returns {Object} group results\n*\n* @example\n* function indicator( v ) {\n*     return v[ 0 ];\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = groupIndicesBy( x, indicator );\n* // returns { 'b': [ 0, 1, 3 ], 'f': [ 2 ] }\n*/\nfunction groupIndicesBy( x, indicator, thisArg ) {\n\tvar get;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar o;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\n\t// Resolve an accessor for retrieving array elements:\n\tget = resolveGetter( x );\n\n\t// Loop over the elements and assign each to a group...\n\tout = {};\n\tfor ( i = 0; i < len; i++ ) {\n\t\tg = indicator.call( thisArg, get( x, i ), i, x );\n\t\to = out[ g ];\n\t\tif ( isArray( o ) ) {\n\t\t\to.push( i );\n\t\t} else {\n\t\t\tout[ g ] = [ i ];\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = groupIndicesBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Group element indices according to an indicator function.\n*\n* @module @stdlib/array/base/group-indices-by\n*\n* @example\n* var groupIndicesBy = require( '@stdlib/array/base/group-indices-by' );\n*\n* function indicator( v ) {\n*     return v[ 0 ];\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = groupIndicesBy( x, indicator );\n* // returns { 'b': [ 0, 1, 3 ], 'f': [ 2 ] }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert/is-array' );\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Groups elements as arrays associated with distinct keys.\n*\n* @param {Collection} x - input array\n* @param {Collection} groups - array defining which group an element in the input array belongs to\n* @throws {RangeError} must provide arrays having the same length\n* @returns {Object} group results\n*\n* @example\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var groups = [ 'b', 'b', 'f', 'b' ];\n*\n* var out = groupValues( x, groups );\n* // returns { 'b': [ 'beep', 'boop', 'bar' ], 'f': [ 'foo' ] }\n*/\nfunction groupValues( x, groups ) {\n\tvar xget;\n\tvar gget;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar o;\n\tvar v;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\tif ( groups.length !== len ) {\n\t\tthrow new RangeError( 'invalid argument. The first and second arguments must have the same length.' );\n\t}\n\t// Resolve accessors for retrieving array elements:\n\txget = resolveGetter( x );\n\tgget = resolveGetter( groups );\n\n\t// Loop over the elements and assign each to a group...\n\tout = {};\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = xget( x, i );\n\t\tg = gget( groups, i ).toString();\n\t\to = out[ g ];\n\t\tif ( isArray( o ) ) {\n\t\t\to.push( v );\n\t\t} else {\n\t\t\tout[ g ] = [ v ];\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = groupValues;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Group elements as arrays associated with distinct keys.\n*\n* @module @stdlib/array/base/group-values\n*\n* @example\n* var groupValues = require( '@stdlib/array/base/group-values' );\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n* var groups = [ 'b', 'b', 'f', 'b' ];\n*\n* var out = groupValues( x, groups );\n* // returns { 'b': [ 'beep', 'boop', 'bar' ], 'f': [ 'foo' ] }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert/is-array' );\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Groups element values according to an indicator function.\n*\n* @param {Collection} x - input array\n* @param {Function} indicator - indicator function specifying which group an element in the input collection belongs to\n* @param {*} [thisArg] - indicator function execution context\n* @returns {Object} group results\n*\n* @example\n* function indicator( v ) {\n*     return v[ 0 ];\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = groupValuesBy( x, indicator );\n* // returns { 'b': [ 'beep', 'boop', 'bar' ], 'f': [ 'foo' ] }\n*/\nfunction groupValuesBy( x, indicator, thisArg ) {\n\tvar get;\n\tvar len;\n\tvar out;\n\tvar g;\n\tvar o;\n\tvar v;\n\tvar i;\n\n\t// Get the number of elements to group:\n\tlen = x.length;\n\n\t// Resolve an accessor for retrieving array elements:\n\tget = resolveGetter( x );\n\n\t// Loop over the elements and assign each to a group...\n\tout = {};\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = get( x, i );\n\t\tg = indicator.call( thisArg, v, i, x );\n\t\to = out[ g ];\n\t\tif ( isArray( o ) ) {\n\t\t\to.push( v );\n\t\t} else {\n\t\t\tout[ g ] = [ v ];\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = groupValuesBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Group element values according to an indicator function.\n*\n* @module @stdlib/array/base/group-values-by\n*\n* @example\n* var groupValuesBy = require( '@stdlib/array/base/group-values-by' );\n*\n* function indicator( v ) {\n*     return v[ 0 ];\n* }\n*\n* var x = [ 'beep', 'boop', 'foo', 'bar' ];\n*\n* var out = groupValuesBy( x, indicator );\n* // returns { 'b': [ 'beep', 'boop', 'bar' ], 'f': [ 'foo' ] }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ceil = require( '@stdlib/math/base/special/ceil' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array according to a provided increment.\n*\n* @param {number} x1 - first array value\n* @param {number} x2 - array element bound\n* @param {number} increment - increment\n* @returns {Array} linearly spaced numeric array\n*\n* @example\n* var arr = incrspace( 0, 11, 2 );\n* // returns [ 0, 2, 4, 6, 8, 10 ]\n*/\nfunction incrspace( x1, x2, increment ) {\n\tvar arr;\n\tvar len;\n\tvar i;\n\n\tlen = ceil( ( x2-x1 ) / increment );\n\tif ( len <= 1 ) {\n\t\treturn [ x1 ];\n\t}\n\tarr = [ x1 ];\n\tfor ( i = 1; i < len; i++ ) {\n\t\tarr.push( x1 + (increment*i) );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = incrspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array according to a provided increment.\n*\n* @module @stdlib/array/base/incrspace\n*\n* @example\n* var incrspace = require( '@stdlib/array/base/incrspace' );\n*\n* var arr = incrspace( 0, 11, 2 );\n* // returns [ 0, 2, 4, 6, 8, 10 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\nvar isnan = require( '@stdlib/math/base/assert/is-nan' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'indexOf' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = internal( x, 2, 0, false );\n* // returns 1\n*/\nfunction internal( x, searchElement, fromIndex, equalNaNs ) {\n\tvar i;\n\tif ( equalNaNs && isnan( searchElement ) ) {\n\t\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\t\tif ( isnan( x[ i ] ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\tfor ( i = fromIndex; i < x.length; i++ ) {\n\t\tif ( searchElement === x[ i ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* @private\n* @param {Object} x - input array object\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var idx = accessors( x, 2, 0, false );\n* // returns 1\n*/\nfunction accessors( x, searchElement, fromIndex, equalNaNs ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tif ( equalNaNs && isnan( searchElement ) ) {\n\t\tfor ( i = fromIndex; i < data.length; i++ ) {\n\t\t\tif ( isnan( get( data, i ) ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\tfor ( i = fromIndex; i < data.length; i++ ) {\n\t\tif ( searchElement === get( data, i ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// MAIN //\n\n/**\n* Returns the index of the first element which equals a provided search element.\n*\n* ## Notes\n*\n* -   If unable to find an element which equals a provided search element, the function returns `-1`.\n*\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {integer} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOf( x, 2, 0, false );\n* // returns 1\n*\n* @example\n* var Int32Array = require( '@stdlib/array/int32' );\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var idx = indexOf( x, 2, 0, false );\n* // returns 1\n*/\nfunction indexOf( x, searchElement, fromIndex, equalNaNs ) {\n\tvar obj;\n\tif ( hasMethod( x, 'indexOf' ) && equalNaNs === false ) {\n\t\treturn x.indexOf( searchElement, fromIndex );\n\t}\n\tif ( fromIndex < 0 ) {\n\t\tfromIndex += x.length;\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex = 0;\n\t\t}\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, searchElement, fromIndex, equalNaNs );\n\t}\n\treturn internal( x, searchElement, fromIndex, equalNaNs );\n}\n\n\n// EXPORTS //\n\nmodule.exports = indexOf;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the index of the first element which equals a provided search element.\n*\n* @module @stdlib/array/base/index-of\n*\n* @example\n* var indexOf = require( '@stdlib/array/base/index-of' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = indexOf( x, 2, 0, false );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Returns the last element of an array-like object.\n*\n* @param {Collection} arr - input array\n* @returns {*} - last element\n*\n* @example\n* var out = last( [ 1, 2, 3 ] );\n* // returns 3\n*/\nfunction last( arr ) {\n\tvar get;\n\tvar idx;\n\n\t// Resolve an accessor for retrieving input array elements:\n\tget = resolveGetter( arr );\n\n\t// Resolve the last index:\n\tidx = arr.length - 1;\n\n\t// Return the last element:\n\tif ( idx < 0 ) {\n\t\treturn;\n\t}\n\treturn get( arr, idx );\n}\n\n\n// EXPORTS //\n\nmodule.exports = last;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the last element of an array-like object.\n*\n* @module @stdlib/array/base/last\n*\n* @example\n* var last = require( '@stdlib/array/base/last' );\n*\n* var out = last( [ 1, 2, 3 ] );\n* // returns 3\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\nvar isnan = require( '@stdlib/math/base/assert/is-nan' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'lastIndexOf' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns the index of the last element which equals a provided search element.\n*\n* @private\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = internal( x, 2, 3, false );\n* // returns 1\n*/\nfunction internal( x, searchElement, fromIndex, equalNaNs ) {\n\tvar i;\n\tif ( equalNaNs && isnan( searchElement ) ) {\n\t\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\t\tif ( isnan( x[ i ] ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tif ( searchElement === x[ i ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n/**\n* Returns the index of the last element which equals a provided search element.\n*\n* @private\n* @param {Object} x - input array object\n* @param {*} searchElement - search element\n* @param {NonNegativeInteger} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var idx = accessors( x, 2, 3, false );\n* // returns 1\n*/\nfunction accessors( x, searchElement, fromIndex, equalNaNs ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tif ( equalNaNs && isnan( searchElement ) ) {\n\t\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\t\tif ( isnan( get( data, i ) ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tif ( searchElement === get( data, i ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// MAIN //\n\n/**\n* Returns the index of the last element which equals a provided search element.\n*\n* ## Notes\n*\n* -   If unable to find an element which equals a provided search element, the function returns `-1`.\n*\n* @param {Collection} x - input array\n* @param {*} searchElement - search element\n* @param {integer} fromIndex - starting index (inclusive)\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {integer} index\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = lastIndexOf( x, 2, 3, false );\n* // returns 1\n*\n* @example\n* var Int32Array = require( '@stdlib/array/int32' );\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var idx = lastIndexOf( x, 2, 3, false );\n* // returns 1\n*/\nfunction lastIndexOf( x, searchElement, fromIndex, equalNaNs ) {\n\tvar obj;\n\tif ( hasMethod( x, 'lastIndexOf' ) && equalNaNs === false ) {\n\t\treturn x.lastIndexOf( searchElement, fromIndex );\n\t}\n\tif ( fromIndex < 0 ) {\n\t\tfromIndex += x.length;\n\t\tif ( fromIndex < 0 ) {\n\t\t\treturn -1;\n\t\t}\n\t} else if ( fromIndex > x.length ) {\n\t\tfromIndex = x.length - 1;\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, searchElement, fromIndex, equalNaNs );\n\t}\n\treturn internal( x, searchElement, fromIndex, equalNaNs );\n}\n\n\n// EXPORTS //\n\nmodule.exports = lastIndexOf;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the index of the last element which equals a provided search element.\n*\n* @module @stdlib/array/base/last-index-of\n*\n* @example\n* var lastIndexOf = require( '@stdlib/array/base/last-index-of' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var idx = lastIndexOf( x, 2, 3, false );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array.\n*\n* @param {number} x1 - first array value\n* @param {number} x2 - last array value\n* @param {NonNegativeInteger} len - length of output array\n* @returns {Array} linearly spaced numeric array\n*\n* @example\n* var arr = linspace( 0, 100, 6 );\n* // returns [ 0, 20, 40, 60, 80, 100 ]\n*/\nfunction linspace( x1, x2, len ) {\n\tvar arr;\n\tvar N;\n\tvar d;\n\tvar i;\n\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Calculate the increment:\n\tN = len - 1;\n\td = ( x2-x1 ) / N;\n\n\t// Build the output array...\n\tarr = [ x1 ];\n\tfor ( i = 1; i < N; i++ ) {\n\t\tarr.push( x1 + (d*i) );\n\t}\n\tarr.push( x2 );\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array.\n*\n* @module @stdlib/array/base/linspace\n*\n* @example\n* var linspace = require( '@stdlib/array/base/linspace' );\n*\n* var arr = linspace( 0, 100, 6 );\n* // returns [ 0, 20, 40, 60, 80, 100 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar pow = require( '@stdlib/math/base/special/pow' );\n\n\n// MAIN //\n\n/**\n* Generates a logarithmically spaced numeric array.\n*\n* @param {number} a - exponent of start value\n* @param {number} b - exponent of end value\n* @param {NonNegativeInteger} len - length of output array\n* @returns {Array} logarithmically spaced numeric array\n*\n* @example\n* var arr = logspace( 0, 2, 6 );\n* // returns [ 1, ~2.5, ~6.31, ~15.85, ~39.81, 100 ]\n*/\nfunction logspace( a, b, len ) {\n\tvar arr;\n\tvar N;\n\tvar d;\n\tvar i;\n\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Calculate the increment:\n\tN = len - 1;\n\td = ( b-a ) / N;\n\n\t// Build the output array...\n\tarr = [ pow( 10, a ) ];\n\tfor ( i = 1; i < N; i++ ) {\n\t\tarr.push( pow( 10, a+(d*i) ) );\n\t}\n\tarr.push( pow( 10, b ) );\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = logspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a logarithmically spaced numeric array.\n*\n* @module @stdlib/array/base/logspace\n*\n* @example\n* var logspace = require( '@stdlib/array/base/logspace' );\n*\n* var arr = logspace( 0, 2, 6 );\n* // returns [ 1, ~2.5, ~6.31, ~15.85, ~39.81, 100 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a function to elements in a two-dimensional nested input array and assigns results to elements in a new two-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Collection>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - function to apply\n* @param {*} [thisArg] - function execution context\n* @returns {Array<Array>} output array\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = map2d( x, shape, scale );\n* // returns [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*/\nfunction map2d( x, shape, fcn, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar y;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\ty = [];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = [];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\ty0.push( fcn.call( thisArg, x0[ i0 ], [ i1, i0 ], x ) );\n\t\t}\n\t\ty.push( y0 );\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = map2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a function to elements in a two-dimensional nested input array and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Collection>} x - input nested array\n* @param {ArrayLikeObject<Collection>} y - output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - function to apply\n* @param {*} [thisArg] - function execution context\n* @returns {Array<Array>} output array\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = zeros2d( shape );\n*\n* var out = map2d( x, y, shape, scale );\n* // returns [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\nfunction map2d( x, y, shape, fcn, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn y;\n\t}\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\ty0[ i0 ] = fcn.call( thisArg, x0[ i0 ], [ i1, i0 ], x );\n\t\t}\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = map2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a function to elements in a two-dimensional nested input array and assign results to elements in a new two-dimensional nested output array.\n*\n* @module @stdlib/array/base/map2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var map2d = require( '@stdlib/array/base/map2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = map2d( x, shape, scale );\n* // returns [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var map2d = require( '@stdlib/array/base/map2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = zeros2d( shape );\n*\n* var out = map2d.assign( x, y, shape, scale );\n* // returns [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a function to elements in a three-dimensional nested input array and assigns results to elements in a new three-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Collection>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - function to apply\n* @param {*} [thisArg] - function execution context\n* @returns {Array<Array>} output array\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = map3d( x, shape, scale );\n* // returns [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ]\n*/\nfunction map3d( x, shape, fcn, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar x0;\n\tvar y0;\n\tvar x1;\n\tvar y1;\n\tvar y;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\ty = [];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tx1 = x[ i2 ];\n\t\ty1 = [];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tx0 = x1[ i1 ];\n\t\t\ty0 = [];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\ty0.push( fcn.call( thisArg, x0[ i0 ], [ i2, i1, i0 ], x ) );\n\t\t\t}\n\t\t\ty1.push( y0 );\n\t\t}\n\t\ty.push( y1 );\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = map3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a function to elements in a three-dimensional nested input array and assigns results to elements in a three-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Collection>} x - input nested array\n* @param {ArrayLikeObject<Collection>} y - output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - function to apply\n* @param {*} [thisArg] - function execution context\n* @returns {Array<Array>} output array\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = zeros3d( shape );\n*\n* var out = map3d( x, y, shape, scale );\n* // returns [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\nfunction map3d( x, y, shape, fcn, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar x0;\n\tvar y0;\n\tvar x1;\n\tvar y1;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn y;\n\t}\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tx1 = x[ i2 ];\n\t\ty1 = y[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tx0 = x1[ i1 ];\n\t\t\ty0 = y1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\ty0[ i0 ] = fcn.call( thisArg, x0[ i0 ], [ i2, i1, i0 ], x );\n\t\t\t}\n\t\t}\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = map3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a function to elements in a three-dimensional nested input array and assign results to elements in a new three-dimensional nested output array.\n*\n* @module @stdlib/array/base/map3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var map3d = require( '@stdlib/array/base/map3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = map3d( x, shape, scale );\n* // returns [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ]\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var map3d = require( '@stdlib/array/base/map3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = zeros3d( shape );\n*\n* var out = map3d.assign( x, y, shape, scale );\n* // returns [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a function to elements in a four-dimensional nested input array and assigns results to elements in a new four-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Collection>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - function to apply\n* @param {*} [thisArg] - function execution context\n* @returns {Array<Array>} output array\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = map4d( x, shape, scale );\n* // returns [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ]\n*/\nfunction map4d( x, shape, fcn, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar x0;\n\tvar y0;\n\tvar x1;\n\tvar y1;\n\tvar x2;\n\tvar y2;\n\tvar y;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\ty = [];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tx2 = x[ i3 ];\n\t\ty2 = [];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tx1 = x2[ i2 ];\n\t\t\ty1 = [];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\ty0 = [];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\ty0.push( fcn.call( thisArg, x0[ i0 ], [ i3, i2, i1, i0 ], x ) ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t\ty1.push( y0 );\n\t\t\t}\n\t\t\ty2.push( y1 );\n\t\t}\n\t\ty.push( y2 );\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = map4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a function to elements in a four-dimensional nested input array and assigns results to elements in a four-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Collection>} x - input nested array\n* @param {ArrayLikeObject<Collection>} y - output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - function to apply\n* @param {*} [thisArg] - function execution context\n* @returns {Array<Array>} output array\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = zeros4d( shape );\n*\n* var out = map4d( x, y, shape, scale );\n* // returns [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\nfunction map4d( x, y, shape, fcn, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar x0;\n\tvar y0;\n\tvar x1;\n\tvar y1;\n\tvar x2;\n\tvar y2;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn y;\n\t}\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tx2 = x[ i3 ];\n\t\ty2 = y[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tx1 = x2[ i2 ];\n\t\t\ty1 = y2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\ty0[ i0 ] = fcn.call( thisArg, x0[ i0 ], [ i3, i2, i1, i0 ], x ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = map4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a function to elements in a four-dimensional nested input array and assign results to elements in a new four-dimensional nested output array.\n*\n* @module @stdlib/array/base/map4d\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var map4d = require( '@stdlib/array/base/map4d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = map4d( x, shape, scale );\n* // returns [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ]\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var map4d = require( '@stdlib/array/base/map4d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = zeros4d( shape );\n*\n* var out = map4d.assign( x, y, shape, scale );\n* // returns [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a function to elements in a five-dimensional nested input array and assigns results to elements in a new five-dimensional nested output array.\n*\n* @param {ArrayLikeObject<Collection>} x - input nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - function to apply\n* @param {*} [thisArg] - function execution context\n* @returns {Array<Array>} output array\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = map5d( x, shape, scale );\n* // returns [ [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ] ]\n*/\nfunction map5d( x, shape, fcn, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar x0;\n\tvar y0;\n\tvar x1;\n\tvar y1;\n\tvar x2;\n\tvar y2;\n\tvar x3;\n\tvar y3;\n\tvar y;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\ty = [];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tx3 = x[ i4 ];\n\t\ty3 = [];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tx2 = x3[ i3 ];\n\t\t\ty2 = [];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tx1 = x2[ i2 ];\n\t\t\t\ty1 = [];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\t\ty0 = [];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\ty0.push( fcn.call( thisArg, x0[ i0 ], [ i4, i3, i2, i1, i0 ], x ) ); // eslint-disable-line max-len\n\t\t\t\t\t}\n\t\t\t\t\ty1.push( y0 );\n\t\t\t\t}\n\t\t\t\ty2.push( y1 );\n\t\t\t}\n\t\t\ty3.push( y2 );\n\t\t}\n\t\ty.push( y3 );\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = map5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a function to elements in a five-dimensional nested input array and assigns results to elements in a five-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Collection>} x - input nested array\n* @param {ArrayLikeObject<Collection>} y - output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - function to apply\n* @param {*} [thisArg] - function execution context\n* @returns {Array<Array>} output array\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = zeros5d( shape );\n*\n* var out = map5d( x, y, shape, scale );\n* // returns [ [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ] ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\nfunction map5d( x, y, shape, fcn, thisArg ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar x0;\n\tvar y0;\n\tvar x1;\n\tvar y1;\n\tvar x2;\n\tvar y2;\n\tvar x3;\n\tvar y3;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 || S4 <= 0 ) {\n\t\treturn y;\n\t}\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tx3 = x[ i4 ];\n\t\ty3 = y[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tx2 = x3[ i3 ];\n\t\t\ty2 = y3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tx1 = x2[ i2 ];\n\t\t\t\ty1 = y2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\ty0[ i0 ] = fcn.call( thisArg, x0[ i0 ], [ i4, i3, i2, i1, i0 ], x ); // eslint-disable-line max-len\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = map5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a function to elements in a five-dimensional nested input array and assign results to elements in a new five-dimensional nested output array.\n*\n* @module @stdlib/array/base/map5d\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var map5d = require( '@stdlib/array/base/map5d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = map5d( x, shape, scale );\n* // returns [ [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ] ]\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var map5d = require( '@stdlib/array/base/map5d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = zeros5d( shape );\n*\n* var out = map5d.assign( x, y, shape, scale );\n* // returns [ [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ] ]\n*\n* var bool = ( out === y );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a binary callback to elements in two two-dimensional nested input arrays according to elements in a two-dimensional nested mask array and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing two input nested arrays, an input nested mask array, and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = zeros2d( shape );\n*\n* var mask = [ [ 0, 1 ], [ 0, 0 ] ];\n*\n* mskbinary2d( [ x, y, mask, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ 2.0, 0.0 ], [ 2.0, 2.0 ] ]\n*/\nfunction mskbinary2d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar m0;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar m;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 3 ];\n\tm = arrays[ 2 ];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tz0 = z[ i1 ];\n\t\tm0 = m[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tif ( m0[ i0 ] === 0 ) {\n\t\t\t\tz0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ] );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = mskbinary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a binary callback to elements in two two-dimensional nested input arrays according to elements in a two-dimensional nested mask array and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/mskbinary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add' );\n* var mskbinary2d = require( '@stdlib/array/base/mskbinary2d' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = zeros2d( shape );\n*\n* var mask = [ [ 0, 1 ], [ 0, 0 ] ];\n*\n* mskbinary2d( [ x, y, mask, z ], shape, add );\n*\n* console.log( z );\n* // => [ [ 2.0, 0.0 ], [ 2.0, 2.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Returns a new array by applying a mask to a provided input array.\n*\n* @param {Collection} x - input array\n* @param {Collection} mask - mask array\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n* var mask = [ 0, 1, 0, 1 ];\n*\n* var y = mskfilter( x, mask );\n* // returns [ 2, 4 ]\n*/\nfunction mskfilter( x, mask ) {\n\tvar xget;\n\tvar mget;\n\tvar out;\n\tvar i;\n\n\t// Resolve accessors for retrieving array elements:\n\txget = resolveGetter( x );\n\tmget = resolveGetter( mask );\n\n\t// Extract each desired element from the provided array...\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( mget( mask, i ) ) {\n\t\t\tout.push( xget( x, i ) ); // use `Array#push` to ensure \"fast\" elements\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = mskfilter;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a new array by applying a mask to a provided input array.\n*\n* @module @stdlib/array/base/mskfilter\n*\n* @example\n* var mskfilter = require( '@stdlib/array/base/mskfilter' );\n*\n* var x = [ 1, 2, 3, 4 ];\n* var mask = [ 0, 1, 0, 1 ];\n*\n* var y = mskfilter( x, mask );\n* // returns [ 2, 4 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Returns a new array by applying a mask to a provided input array.\n*\n* @param {Collection} x - input array\n* @param {Collection} mask - mask array\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n* var mask = [ 0, 1, 0, 1 ];\n*\n* var y = mskreject( x, mask );\n* // returns [ 1, 3 ]\n*/\nfunction mskreject( x, mask ) {\n\tvar xget;\n\tvar mget;\n\tvar out;\n\tvar i;\n\n\t// Resolve accessors for retrieving array elements:\n\txget = resolveGetter( x );\n\tmget = resolveGetter( mask );\n\n\t// Extract each desired element from the provided array...\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( !mget( mask, i ) ) {\n\t\t\tout.push( xget( x, i ) ); // use `Array#push` to ensure \"fast\" elements\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = mskreject;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a new array by applying a mask to a provided input array.\n*\n* @module @stdlib/array/base/mskreject\n*\n* @example\n* var mskreject = require( '@stdlib/array/base/mskreject' );\n*\n* var x = [ 1, 2, 3, 4 ];\n* var mask = [ 0, 1, 0, 1 ];\n*\n* var y = mskreject( x, mask );\n* // returns [ 1, 3 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a two-dimensional nested input array according to elements in a two-dimensional nested mask array and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing one input nested array, an input nested mask array, and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = zeros2d( shape );\n*\n* var mask = [ [ 0, 1 ], [ 0, 0 ] ];\n*\n* mskunary2d( [ x, mask, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ 10.0, 0.0 ], [ 10.0, 10.0 ] ]\n*/\nfunction mskunary2d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar m0;\n\tvar x;\n\tvar y;\n\tvar m;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 2 ];\n\tm = arrays[ 1 ];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tm0 = m[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tif ( m0[ i0 ] === 0 ) {\n\t\t\t\ty0[ i0 ] = fcn( x0[ i0 ] );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = mskunary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a two-dimensional nested input array according to elements in a two-dimensional nested mask array and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/mskunary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var mskunary2d = require( '@stdlib/array/base/mskunary2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = zeros2d( shape );\n*\n* var mask = [ [ 0, 1 ], [ 0, 0 ] ];\n*\n* mskunary2d( [ x, mask, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ 10.0, 0.0 ], [ 10.0, 10.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a three-dimensional nested input array according to elements in a three-dimensional nested mask array and assigns results to elements in a three-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing one input nested array, an input nested mask array, and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = zeros3d( shape );\n*\n* var mask = [ [ [ 0, 1 ], [ 0, 0 ] ] ];\n*\n* mskunary3d( [ x, mask, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ [ 10.0, 0.0 ], [ 10.0, 10.0 ] ] ]\n*/\nfunction mskunary3d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar x0;\n\tvar x1;\n\tvar y0;\n\tvar y1;\n\tvar m0;\n\tvar m1;\n\tvar x;\n\tvar y;\n\tvar m;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 2 ];\n\tm = arrays[ 1 ];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tx1 = x[ i2 ];\n\t\ty1 = y[ i2 ];\n\t\tm1 = m[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tx0 = x1[ i1 ];\n\t\t\ty0 = y1[ i1 ];\n\t\t\tm0 = m1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tif ( m0[ i0 ] === 0 ) {\n\t\t\t\t\ty0[ i0 ] = fcn( x0[ i0 ] );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = mskunary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a three-dimensional nested input array according to elements in a three-dimensional nested mask array and assign results to elements in a three-dimensional nested output array.\n*\n* @module @stdlib/array/base/mskunary3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var mskunary3d = require( '@stdlib/array/base/mskunary3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = zeros3d( shape );\n*\n* var mask = [ [ [ 0, 1 ], [ 0, 0 ] ] ];\n*\n* mskunary3d( [ x, mask, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ [ 10.0, 0.0 ], [ 10.0, 10.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the n-fold Cartesian product.\n*\n* ## Notes\n*\n* -   The main insight of this implementation is that the n-fold Cartesian product can be presented as an n-dimensional array stored in row-major order. As such, we can\n*\n*     -   Compute the total number of tuples, which is simply the product of the size of each provided array (set). For n-dimensional arrays, this is the equivalent of computing the product of array dimensions to determine the total number of elements.\n*     -   Initialize an array for storing indices for indexing into each provided array. For n-dimensional arrays, the index array is equivalent to an array of subscripts for indexing into each dimension.\n*     -   For the outermost loop, treat the loop index as a linear index into an n-dimensional array and resolve the corresponding subscripts.\n*     -   Continue iterating until all tuples have been generated.\n*\n* @param {ArrayLikeObject} x1 - first input array\n* @param {ArrayLikeObject} x2 - second input array\n* @param {ArrayLikeObject} [...args] - additional input arrays\n* @returns {Array<Array>} list of ordered tuples comprising the n-fold Cartesian product\n*\n* @example\n* var x1 = [ 1, 2, 3 ];\n* var x2 = [ 4, 5 ];\n*\n* var out = nCartesianProduct( x1, x2 );\n* // returns [ [ 1, 4 ], [ 1, 5 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 3, 5 ] ]\n*/\nfunction nCartesianProduct( x1, x2 ) {\n\tvar nargs;\n\tvar dims;\n\tvar arr;\n\tvar out;\n\tvar tmp;\n\tvar arg;\n\tvar idx;\n\tvar N;\n\tvar s;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\tnargs = arguments.length;\n\n\t// Initialize the list of arrays:\n\tarr = [ x1, x2 ];\n\n\t// Initialize the list of array dimensions (equivalent to ndarray shape):\n\tdims = [ x1.length, x2.length ];\n\n\t// Initialize a list of indices for indexing into each array (equivalent to ndarray subscripts):\n\tidx = [ 0, 0 ];\n\n\t// Compute the total number of ordered tuples:\n\tN = dims[ 0 ] * dims[ 1 ];\n\n\t// Update loop variables for any additional arrays...\n\tfor ( i = 2; i < nargs; i++ ) {\n\t\targ = arguments[ i ];\n\t\tarr.push( arg );\n\t\tdims.push( arg.length );\n\t\tidx.push( 0 );\n\t\tN *= dims[ i ];\n\t}\n\t// Compute the n-fold Cartesian product...\n\tout = [];\n\tfor ( i = 0; i < N; i++ ) {\n\t\t// Resolve a linear index to array indices (logic is equivalent to what is found in ndarray/base/ind2sub for an ndarray stored in row-major order; see https://github.com/stdlib-js/stdlib/blob/215ca5355f3404f15996fd0ced58a98e46f22be6/lib/node_modules/%40stdlib/ndarray/base/ind2sub/lib/assign.js)...\n\t\tk = i;\n\t\tfor ( j = nargs-1; j >= 0; j-- ) {\n\t\t\ts = k % dims[ j ];\n\t\t\tk -= s;\n\t\t\tk /= dims[ j ];\n\t\t\tidx[ j ] = s;\n\t\t}\n\t\t// Generate the next ordered tuple...\n\t\ttmp = [];\n\t\tfor ( j = 0; j < nargs; j++ ) {\n\t\t\ttmp.push( arr[ j ][ idx[ j ] ] );\n\t\t}\n\t\tout.push( tmp );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = nCartesianProduct;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the n-fold Cartesian product.\n*\n* @module @stdlib/array/base/n-cartesian-product\n*\n* @example\n* var nCartesianProduct = require( '@stdlib/array/base/n-cartesian-product' );\n*\n* var x1 = [ 1, 2, 3 ];\n* var x2 = [ 4, 5 ];\n*\n* var out = nCartesianProduct( x1, x2 );\n* // returns [ [ 1, 4 ], [ 1, 5 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 3, 5 ] ]\n*/\n\n// MAIN //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplex128Array = require( './../../../base/assert/is-complex128array' );\nvar isComplex64Array = require( './../../../base/assert/is-complex64array' );\nvar arraylike2object = require( './../../../base/arraylike2object' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether all elements in an array are falsy.\n*\n* @private\n* @param {Collection} x - input array\n* @returns {boolean} boolean indicating whether all elements are falsy\n*\n* @example\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = internal( x );\n* // returns true\n*\n* @example\n* var x = [ 1, 2, 0, 4 ];\n*\n* var out = internal( x );\n* // returns false\n*/\nfunction internal( x ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( x[ i ] ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in an array are falsy.\n*\n* @private\n* @param {Object} x - input array object\n* @returns {boolean} boolean indicating whether all elements are falsy\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 0, 0 ] ) );\n*\n* var out = accessors( x );\n* // returns true\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 0, 4 ] ) );\n*\n* var out = accessors( x );\n* // returns false\n*/\nfunction accessors( x ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tif ( get( data, i ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether all elements in an array are falsy.\n*\n* @param {Collection} x - input array\n* @returns {boolean} boolean indicating whether all elements are falsy\n*\n* @example\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = none( x );\n* // returns true\n*\n* @example\n* var x = [ 1, 2, 0, 4 ];\n*\n* var out = none( x );\n* // returns false\n*/\nfunction none( x ) {\n\tvar obj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\t// If provided a complex number array, reinterpret as a real typed array and test interleaved real and imaginary components, where we consider a complex number to be falsy if both components are zero...\n\t\tif ( isComplex128Array( x ) ) {\n\t\t\treturn internal( reinterpret128( x, 0 ) );\n\t\t}\n\t\tif ( isComplex64Array( x ) ) {\n\t\t\treturn internal( reinterpret64( x, 0 ) );\n\t\t}\n\t\treturn accessors( obj );\n\t}\n\treturn internal( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = none;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether all elements in an array are falsy.\n*\n* @module @stdlib/array/base/none\n*\n* @example\n* var none = require( '@stdlib/array/base/none' );\n*\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = none( x );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether all elements in an array fail a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements fail a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = internal( x, isPositive );\n* // returns true\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar i;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tif ( predicate.call( thisArg, x[ i ], i, x ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in an array fail a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements fail a test\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 0, 0 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns true\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tif ( predicate.call( thisArg, get( data, i ), i, data ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether all elements in an array fail a test implemented by a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {boolean} boolean indicating whether all elements fail a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = noneBy( x, isPositive );\n* // returns true\n*/\nfunction noneBy( x, predicate, thisArg ) {\n\tvar obj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = noneBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether all elements in an array fail a test implemented by a predicate function.\n*\n* @module @stdlib/array/base/none-by\n*\n* @example\n* var noneBy = require( '@stdlib/array/base/none-by' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = noneBy( x, isPositive );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether all elements in an array fail a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements fail a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = internal( x, isPositive );\n* // returns true\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar i;\n\tfor ( i = x.length-1; i >= 0; i-- ) {\n\t\tif ( predicate.call( thisArg, x[ i ], i, x ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n/**\n* Tests whether all elements in an array fail a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {boolean} boolean indicating whether all elements fail a test\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 0, 0, 0, 0 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns true\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tfor ( i = data.length-1; i >= 0; i-- ) {\n\t\tif ( predicate.call( thisArg, get( data, i ), i, data ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether all elements in an array fail a test implemented by a predicate function, iterating from right to left.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {boolean} boolean indicating whether all elements fail a test\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = noneByRight( x, isPositive );\n* // returns true\n*/\nfunction noneByRight( x, predicate, thisArg ) {\n\tvar obj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = noneByRight;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether all elements in an array fail a test implemented by a predicate function, iterating from right to left.\n*\n* @module @stdlib/array/base/none-by-right\n*\n* @example\n* var noneByRight = require( '@stdlib/array/base/none-by-right' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 0, 0, 0, 0 ];\n*\n* var out = noneByRight( x, isPositive );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1 starting from one.\n*\n* @param {number} n - number of elements\n* @returns {Array<number>} linearly spaced numeric array\n*\n* @example\n* var arr = oneTo( 6 );\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*/\nfunction oneTo( n ) {\n\tvar arr;\n\tvar i;\n\n\tarr = [];\n\tif ( n <= 0 ) {\n\t\treturn arr;\n\t}\n\tfor ( i = 1; i < n+1; i++ ) {\n\t\tarr.push( i );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = oneTo;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplex128Array = require( './../../../base/assert/is-complex128array' );\nvar isComplex64Array = require( './../../../base/assert/is-complex64array' );\nvar arraylike2object = require( './../../../base/arraylike2object' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\n\n\n// FUNCTIONS //\n\n/**\n* Fills an indexed array with linearly spaced numeric elements which increment by 1 starting from one.\n*\n* @private\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = indexed( out, 1, 0 );\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = indexed( out, -1, out.length-1 );\n* // returns [ 6, 5, 4, 3, 2, 1 ]\n*/\nfunction indexed( out, stride, offset ) {\n\tvar v;\n\tvar i;\n\n\ti = offset;\n\tv = 1;\n\twhile ( i >= 0 && i < out.length ) {\n\t\tout[ i ] = v;\n\t\ti += stride;\n\t\tv += 1;\n\t}\n\treturn out;\n}\n\n/**\n* Fills a complex number array with linearly spaced numeric elements which increment by 1 starting from one.\n*\n* @private\n* @param {(Complex128Array|Complex64Array)} out - output complex number array\n* @param {(Float64Array|Float32Array)} data - output array data\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {(Complex128Array|Complex64Array)} output array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n* var reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\n*\n* var out = new Complex128Array( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n* // returns <Complex128Array>\n*\n* var data = reinterpret128( out, 0 );\n* // returns <Float64Array>[ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* var arr = complex( out, data, 1, 0 );\n* // returns <Complex128Array>\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* data = reinterpret128( out, 0 );\n* returns <Float64Array>[ 1.0, 0.0, 2.0, 0.0, 3.0, 0.0 ]\n*/\nfunction complex( out, data, stride, offset ) {\n\tvar v;\n\tvar s;\n\tvar i;\n\n\ts = stride * 2;\n\ti = offset * 2;\n\tv = 1.0;\n\twhile ( i >= 0 && i < data.length ) {\n\t\tdata[ i ] = v;     // real component\n\t\tdata[ i+1 ] = 0.0; // imaginary component\n\t\ti += s;\n\t\tv += 1.0;\n\t}\n\treturn out;\n}\n\n/**\n* Fills an accessor array with linearly spaced numeric elements which increment by 1 starting from one.\n*\n* @private\n* @param {Object} out - output array object\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n\n* var out = toAccessorArray( [ 0, 0, 0, 0, 0, 0 ] );\n* var arr = accessors( arraylike2object( out ), 1, 0 );\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* var v = out.get( 0 );\n* // returns 1\n*\n* v = out.get( out.length-1 );\n* // returns 6\n*/\nfunction accessors( out, stride, offset ) {\n\tvar data;\n\tvar set;\n\tvar v;\n\tvar i;\n\n\tdata = out.data;\n\tset = out.accessors[ 1 ];\n\n\ti = offset;\n\tv = 1;\n\twhile ( i >= 0 && i < data.length ) {\n\t\tset( data, i, v );\n\t\ti += stride;\n\t\tv += 1;\n\t}\n\treturn data;\n}\n\n\n// MAIN //\n\n/**\n* Fills an array with linearly spaced numeric elements which increment by 1 starting from one.\n*\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = assign( out, 1, 0 );\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = assign( out, -1, out.length-1 );\n* // returns [ 6, 5, 4, 3, 2, 1 ]\n*/\nfunction assign( out, stride, offset ) {\n\tvar obj = arraylike2object( out );\n\tif ( obj.accessorProtocol ) {\n\t\t// If provided a complex number array, reinterpret as a real typed array and only set the real components...\n\t\tif ( isComplex128Array( out ) ) {\n\t\t\treturn complex( out, reinterpret128( out, 0 ), stride, offset );\n\t\t}\n\t\tif ( isComplex64Array( out ) ) {\n\t\t\treturn complex( out, reinterpret64( out, 0 ), stride, offset );\n\t\t}\n\t\treturn accessors( obj, stride, offset );\n\t}\n\treturn indexed( out, stride, offset );\n}\n\n\n// EXPORTS //\n\nmodule.exports = assign;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1 starting from one.\n*\n* @module @stdlib/array/base/one-to\n*\n* @example\n* var oneTo = require( '@stdlib/array/base/one-to' );\n*\n* var arr = oneTo( 6 );\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*\n* @example\n* var oneTo = require( '@stdlib/array/base/one-to' );\n*\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n* var arr = oneTo.assign( out, 1, 0 );\n* // returns [ 1, 2, 3, 4, 5, 6 ]\n*\n* var bool = ( out === arr );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled = require( './../../../base/filled' );\n\n\n// MAIN //\n\n/**\n* Returns a \"generic\" array filled with ones.\n*\n* @param {NonNegativeInteger} len - array length\n* @returns {Array} output array\n*\n* @example\n* var out = ones( 3 );\n* // returns [ 1.0, 1.0, 1.0 ]\n*/\nfunction ones( len ) {\n\treturn filled( 1.0, len );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ones;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a \"generic\" array filled with ones.\n*\n* @module @stdlib/array/base/ones\n*\n* @example\n* var ones = require( '@stdlib/array/base/ones' );\n*\n* var out = ones( 3 );\n* // returns [ 1.0, 1.0, 1.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled2d = require( './../../../base/filled2d' );\n\n\n// MAIN //\n\n/**\n* Returns a two-dimensional nested array filled with ones.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {ArrayArray} filled array\n*\n* @example\n* var out = ones2d( [ 1, 3 ] );\n* // returns [ [ 1.0, 1.0, 1.0 ] ]\n*/\nfunction ones2d( shape ) {\n\treturn filled2d( 1.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ones2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a two-dimensional nested array filled with ones.\n*\n* @module @stdlib/array/base/ones2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n*\n* var out = ones2d( [ 1, 3 ] );\n* // returns [ [ 1.0, 1.0, 1.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled3d = require( './../../../base/filled3d' );\n\n\n// MAIN //\n\n/**\n* Returns a three-dimensional nested array filled with ones.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = ones3d( [ 1, 1, 3 ] );\n* // returns [ [ [ 1.0, 1.0, 1.0 ] ] ]\n*/\nfunction ones3d( shape ) {\n\treturn filled3d( 1.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ones3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a three-dimensional nested array filled with ones.\n*\n* @module @stdlib/array/base/ones3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n*\n* var out = ones3d( [ 1, 1, 3 ] );\n* // returns [ [ [ 1.0, 1.0, 1.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled4d = require( './../../../base/filled4d' );\n\n\n// MAIN //\n\n/**\n* Returns a four-dimensional nested array filled with ones.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = ones4d( [ 1, 1, 1, 3 ] );\n* // returns [ [ [ [ 1.0, 1.0, 1.0 ] ] ] ]\n*/\nfunction ones4d( shape ) {\n\treturn filled4d( 1.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ones4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a four-dimensional nested array filled with ones.\n*\n* @module @stdlib/array/base/ones4d\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n*\n* var out = ones4d( [ 1, 1, 1, 3 ] );\n* // returns [ [ [ [ 1.0, 1.0, 1.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled5d = require( './../../../base/filled5d' );\n\n\n// MAIN //\n\n/**\n* Returns a five-dimensional nested array filled with ones.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = ones5d( [ 1, 1, 1, 1, 3 ] );\n* // returns [ [ [ [ [ 1.0, 1.0, 1.0 ] ] ] ] ]\n*/\nfunction ones5d( shape ) {\n\treturn filled5d( 1.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ones5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a five-dimensional nested array filled with ones.\n*\n* @module @stdlib/array/base/ones5d\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n*\n* var out = ones5d( [ 1, 1, 1, 1, 3 ] );\n* // returns [ [ [ [ [ 1.0, 1.0, 1.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar fillednd = require( './../../../base/fillednd' );\n\n\n// MAIN //\n\n/**\n* Returns an n-dimensional nested array filled with ones.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = onesnd( [ 3 ] );\n* // returns [ 1.0, 1.0, 1.0 ]\n*\n* @example\n* var out = onesnd( [ 1, 3 ] );\n* // returns [ [ 1.0, 1.0, 1.0 ] ]\n*/\nfunction onesnd( shape ) {\n\treturn fillednd( 1.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = onesnd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an n-dimensional nested array filled with ones.\n*\n* @module @stdlib/array/base/onesnd\n*\n* @example\n* var onesnd = require( '@stdlib/array/base/onesnd' );\n*\n* var out = onesnd( [ 1, 3 ] );\n* // returns [ [ 1.0, 1.0, 1.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a quaternary callback to elements in four two-dimensional nested input arrays and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing four input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - quaternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = ones2d( shape );\n* var w = ones2d( shape );\n* var out = zeros2d( shape );\n*\n* quaternary2d( [ x, y, z, w, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ]\n*/\nfunction quaternary2d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar v0;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar v;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tv = arrays[ 4 ];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tz0 = z[ i1 ];\n\t\tw0 = w[ i1 ];\n\t\tv0 = v[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tv0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ], w0[ i0 ] );\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = quaternary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quaternary callback to elements in four two-dimensional nested input arrays and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/quaternary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var quaternary2d = require( '@stdlib/array/base/quaternary2d' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = ones2d( shape );\n* var w = ones2d( shape );\n* var out = zeros2d( shape );\n*\n* quaternary2d( [ x, y, z, w, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a quaternary callback to elements in four three-dimensional nested input arrays and assigns results to elements in a three-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Collection>>>} arrays - array-like object containing four input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - quaternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = ones3d( shape );\n* var z = ones3d( shape );\n* var w = ones3d( shape );\n* var out = zeros3d( shape );\n*\n* quaternary3d( [ x, y, z, w, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ] ]\n*/\nfunction quaternary3d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar v0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar v1;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar v;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tv = arrays[ 4 ];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tx1 = x[ i2 ];\n\t\ty1 = y[ i2 ];\n\t\tz1 = z[ i2 ];\n\t\tw1 = w[ i2 ];\n\t\tv1 = v[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tx0 = x1[ i1 ];\n\t\t\ty0 = y1[ i1 ];\n\t\t\tz0 = z1[ i1 ];\n\t\t\tw0 = w1[ i1 ];\n\t\t\tv0 = v1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tv0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ], w0[ i0 ] );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = quaternary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quaternary callback to elements in four three-dimensional nested input arrays and assign results to elements in a three-dimensional nested output array.\n*\n* @module @stdlib/array/base/quaternary3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var quaternary3d = require( '@stdlib/array/base/quaternary3d' );\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = ones3d( shape );\n* var z = ones3d( shape );\n* var w = ones3d( shape );\n* var out = zeros3d( shape );\n*\n* quaternary3d( [ x, y, z, w, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a quaternary callback to elements in four four-dimensional nested input arrays and assigns results to elements in a four-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Array<Collection>>>>} arrays - array-like object containing four input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - quaternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = ones4d( shape );\n* var z = ones4d( shape );\n* var w = ones4d( shape );\n* var out = zeros4d( shape );\n*\n* quaternary4d( [ x, y, z, w, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ] ] ]\n*/\nfunction quaternary4d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar v0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar v1;\n\tvar x2;\n\tvar y2;\n\tvar z2;\n\tvar w2;\n\tvar v2;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar v;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tv = arrays[ 4 ];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tx2 = x[ i3 ];\n\t\ty2 = y[ i3 ];\n\t\tz2 = z[ i3 ];\n\t\tw2 = w[ i3 ];\n\t\tv2 = v[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tx1 = x2[ i2 ];\n\t\t\ty1 = y2[ i2 ];\n\t\t\tz1 = z2[ i2 ];\n\t\t\tw1 = w2[ i2 ];\n\t\t\tv1 = v2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\tw0 = w1[ i1 ];\n\t\t\t\tv0 = v1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tv0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ], w0[ i0 ] );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = quaternary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quaternary callback to elements in four four-dimensional nested input arrays and assign results to elements in a four-dimensional nested output array.\n*\n* @module @stdlib/array/base/quaternary4d\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var quaternary4d = require( '@stdlib/array/base/quaternary4d' );\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = ones4d( shape );\n* var z = ones4d( shape );\n* var w = ones4d( shape );\n* var out = zeros4d( shape );\n*\n* quaternary4d( [ x, y, z, w, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a quaternary callback to elements in four five-dimensional nested input arrays and assigns results to elements in a five-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Array<Collection>>>>} arrays - array-like object containing four input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - quaternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = ones5d( shape );\n* var z = ones5d( shape );\n* var w = ones5d( shape );\n* var out = zeros5d( shape );\n*\n* quaternary5d( [ x, y, z, w, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ] ] ] ]\n*/\nfunction quaternary5d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar v0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar v1;\n\tvar x2;\n\tvar y2;\n\tvar z2;\n\tvar w2;\n\tvar v2;\n\tvar x3;\n\tvar y3;\n\tvar z3;\n\tvar w3;\n\tvar v3;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar v;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 || S4 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tv = arrays[ 4 ];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tx3 = x[ i4 ];\n\t\ty3 = y[ i4 ];\n\t\tz3 = z[ i4 ];\n\t\tw3 = w[ i4 ];\n\t\tv3 = v[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tx2 = x3[ i3 ];\n\t\t\ty2 = y3[ i3 ];\n\t\t\tz2 = z3[ i3 ];\n\t\t\tw2 = w3[ i3 ];\n\t\t\tv2 = v3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tx1 = x2[ i2 ];\n\t\t\t\ty1 = y2[ i2 ];\n\t\t\t\tz1 = z2[ i2 ];\n\t\t\t\tw1 = w2[ i2 ];\n\t\t\t\tv1 = v2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\t\tw0 = w1[ i1 ];\n\t\t\t\t\tv0 = v1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tv0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ], w0[ i0 ] ); // eslint-disable-line max-len\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = quaternary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quaternary callback to elements in four five-dimensional nested input arrays and assign results to elements in a five-dimensional nested output array.\n*\n* @module @stdlib/array/base/quaternary5d\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var add = require( '@stdlib/math/base/ops/add4' );\n* var quaternary5d = require( '@stdlib/array/base/quaternary5d' );\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = ones5d( shape );\n* var z = ones5d( shape );\n* var w = ones5d( shape );\n* var out = zeros5d( shape );\n*\n* quaternary5d( [ x, y, z, w, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ [ 4.0, 4.0 ], [ 4.0, 4.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a quinary callback to elements in five two-dimensional nested input arrays and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing five input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - quinary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add5' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = ones2d( shape );\n* var w = ones2d( shape );\n* var v = ones2d( shape );\n* var out = zeros2d( shape );\n*\n* quinary2d( [ x, y, z, w, v, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ]\n*/\nfunction quinary2d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar u0;\n\tvar v0;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar u;\n\tvar v;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tu = arrays[ 4 ];\n\tv = arrays[ 5 ];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tz0 = z[ i1 ];\n\t\tw0 = w[ i1 ];\n\t\tu0 = u[ i1 ];\n\t\tv0 = v[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tv0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ], w0[ i0 ], u0[ i0 ] );\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = quinary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quinary callback to elements in five two-dimensional nested input arrays and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/quinary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var add = require( '@stdlib/math/base/ops/add5' );\n* var quinary2d = require( '@stdlib/array/base/quinary2d' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = ones2d( shape );\n* var w = ones2d( shape );\n* var v = ones2d( shape );\n* var out = zeros2d( shape );\n*\n* quinary2d( [ x, y, z, w, v, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a quinary callback to elements in five three-dimensional nested input arrays and assigns results to elements in a three-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Collection>>>} arrays - array-like object containing five input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - quinary callback\n* @returns {void}\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var add = require( '@stdlib/math/base/ops/add5' );\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = ones3d( shape );\n* var z = ones3d( shape );\n* var w = ones3d( shape );\n* var v = ones3d( shape );\n* var out = zeros3d( shape );\n*\n* quinary3d( [ x, y, z, w, v, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ] ]\n*/\nfunction quinary3d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar u0;\n\tvar v0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar u1;\n\tvar v1;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar u;\n\tvar v;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tu = arrays[ 4 ];\n\tv = arrays[ 5 ];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tx1 = x[ i2 ];\n\t\ty1 = y[ i2 ];\n\t\tz1 = z[ i2 ];\n\t\tw1 = w[ i2 ];\n\t\tu1 = u[ i2 ];\n\t\tv1 = v[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tx0 = x1[ i1 ];\n\t\t\ty0 = y1[ i1 ];\n\t\t\tz0 = z1[ i1 ];\n\t\t\tw0 = w1[ i1 ];\n\t\t\tu0 = u1[ i1 ];\n\t\t\tv0 = v1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tv0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ], w0[ i0 ], u0[ i0 ] ); // eslint-disable-line max-len\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = quinary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quinary callback to elements in five three-dimensional nested input arrays and assign results to elements in a three-dimensional nested output array.\n*\n* @module @stdlib/array/base/quinary3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var add = require( '@stdlib/math/base/ops/add5' );\n* var quinary3d = require( '@stdlib/array/base/quinary3d' );\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = ones3d( shape );\n* var z = ones3d( shape );\n* var w = ones3d( shape );\n* var v = ones3d( shape );\n* var out = zeros3d( shape );\n*\n* quinary3d( [ x, y, z, w, v, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a quinary callback to elements in five four-dimensional nested input arrays and assigns results to elements in a four-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Array<Collection>>>>} arrays - array-like object containing five input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - quinary callback\n* @returns {void}\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var add = require( '@stdlib/math/base/ops/add5' );\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = ones4d( shape );\n* var z = ones4d( shape );\n* var w = ones4d( shape );\n* var v = ones4d( shape );\n* var out = zeros4d( shape );\n*\n* quinary4d( [ x, y, z, w, v, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ] ] ]\n*/\nfunction quinary4d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar u0;\n\tvar v0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar u1;\n\tvar v1;\n\tvar x2;\n\tvar y2;\n\tvar z2;\n\tvar w2;\n\tvar u2;\n\tvar v2;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar u;\n\tvar v;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tu = arrays[ 4 ];\n\tv = arrays[ 5 ];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tx2 = x[ i3 ];\n\t\ty2 = y[ i3 ];\n\t\tz2 = z[ i3 ];\n\t\tw2 = w[ i3 ];\n\t\tu2 = u[ i3 ];\n\t\tv2 = v[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tx1 = x2[ i2 ];\n\t\t\ty1 = y2[ i2 ];\n\t\t\tz1 = z2[ i2 ];\n\t\t\tw1 = w2[ i2 ];\n\t\t\tu1 = u2[ i2 ];\n\t\t\tv1 = v2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\tw0 = w1[ i1 ];\n\t\t\t\tu0 = u1[ i1 ];\n\t\t\t\tv0 = v1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tv0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ], w0[ i0 ], u0[ i0 ] ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = quinary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quinary callback to elements in five four-dimensional nested input arrays and assign results to elements in a four-dimensional nested output array.\n*\n* @module @stdlib/array/base/quinary4d\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var add = require( '@stdlib/math/base/ops/add5' );\n* var quinary4d = require( '@stdlib/array/base/quinary4d' );\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = ones4d( shape );\n* var z = ones4d( shape );\n* var w = ones4d( shape );\n* var v = ones4d( shape );\n* var out = zeros4d( shape );\n*\n* quinary4d( [ x, y, z, w, v, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a quinary callback to elements in five five-dimensional nested input arrays and assigns results to elements in a five-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Array<Array<Collection>>>>>} arrays - array-like object containing five input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - quinary callback\n* @returns {void}\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var add = require( '@stdlib/math/base/ops/add5' );\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = ones5d( shape );\n* var z = ones5d( shape );\n* var w = ones5d( shape );\n* var v = ones5d( shape );\n* var out = zeros5d( shape );\n*\n* quinary5d( [ x, y, z, w, v, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ] ] ] ]\n*/\nfunction quinary5d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar u0;\n\tvar v0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar u1;\n\tvar v1;\n\tvar x2;\n\tvar y2;\n\tvar z2;\n\tvar w2;\n\tvar u2;\n\tvar v2;\n\tvar x3;\n\tvar y3;\n\tvar z3;\n\tvar w3;\n\tvar u3;\n\tvar v3;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\tvar u;\n\tvar v;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 || S4 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tu = arrays[ 4 ];\n\tv = arrays[ 5 ];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tx3 = x[ i4 ];\n\t\ty3 = y[ i4 ];\n\t\tz3 = z[ i4 ];\n\t\tw3 = w[ i4 ];\n\t\tu3 = u[ i4 ];\n\t\tv3 = v[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tx2 = x3[ i3 ];\n\t\t\ty2 = y3[ i3 ];\n\t\t\tz2 = z3[ i3 ];\n\t\t\tw2 = w3[ i3 ];\n\t\t\tu2 = u3[ i3 ];\n\t\t\tv2 = v3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tx1 = x2[ i2 ];\n\t\t\t\ty1 = y2[ i2 ];\n\t\t\t\tz1 = z2[ i2 ];\n\t\t\t\tw1 = w2[ i2 ];\n\t\t\t\tu1 = u2[ i2 ];\n\t\t\t\tv1 = v2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\t\tw0 = w1[ i1 ];\n\t\t\t\t\tu0 = u1[ i1 ];\n\t\t\t\t\tv0 = v1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tv0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ], w0[ i0 ], u0[ i0 ] ); // eslint-disable-line max-len\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = quinary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a quinary callback to elements in five five-dimensional nested input arrays and assign results to elements in a five-dimensional nested output array.\n*\n* @module @stdlib/array/base/quinary5d\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var add = require( '@stdlib/math/base/ops/add5' );\n* var quinary5d = require( '@stdlib/array/base/quinary5d' );\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = ones5d( shape );\n* var z = ones5d( shape );\n* var w = ones5d( shape );\n* var v = ones5d( shape );\n* var out = zeros5d( shape );\n*\n* quinary5d( [ x, y, z, w, v, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ [ 5.0, 5.0 ], [ 5.0, 5.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Returns a shallow copy of an array containing only those elements which fail a test implemented by a predicate function.\n*\n* @private\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {Array} output array\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, -2, -3, 4 ];\n*\n* var out = internal( x, isPositive );\n* // returns [ -2, -3 ]\n*/\nfunction internal( x, predicate, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tv = x[ i ];\n\t\tif ( !predicate.call( thisArg, v, i, x ) ) {\n\t\t\tout.push( v );\n\t\t}\n\t}\n\treturn out;\n}\n\n/**\n* Returns a shallow copy of an array containing only those elements which fail a test implemented by a predicate function.\n*\n* @private\n* @param {Object} x - input array object\n* @param {Function} predicate - test function\n* @param {*} thisArg - execution context\n* @returns {Array} output array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = arraylike2object( toAccessorArray( [ 1, -2, -3, 4 ] ) );\n*\n* var out = accessors( x, isPositive );\n* // returns [ -2, -3 ]\n*/\nfunction accessors( x, predicate, thisArg ) {\n\tvar data;\n\tvar get;\n\tvar out;\n\tvar v;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tout = [];\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tv = get( data, i );\n\t\tif ( !predicate.call( thisArg, v, i, data ) ) {\n\t\t\tout.push( v );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a shallow copy of an array containing only those elements which fail a test implemented by a predicate function.\n*\n* @param {Collection} x - input array\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - execution context\n* @returns {Collection} output array\n*\n* @example\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, -2, -3, 4 ];\n*\n* var out = reject( x, isPositive );\n* // returns [ -2, -3 ]\n*/\nfunction reject( x, predicate, thisArg ) {\n\tvar obj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, predicate, thisArg );\n\t}\n\treturn internal( x, predicate, thisArg );\n}\n\n\n// EXPORTS //\n\nmodule.exports = reject;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a shallow copy of an array containing only those elements which fail a test implemented by a predicate function.\n*\n* @module @stdlib/array/base/reject\n*\n* @example\n* var reject = require( '@stdlib/array/base/reject' );\n*\n* function isPositive( v ) {\n*     return v > 0;\n* }\n*\n* var x = [ 1, -2, -3, 4 ];\n*\n* var out = reject( x, isPositive );\n* // returns [ -2, -3 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isAccessorArray = require( './../../../base/assert/is-accessor-array' );\nvar accessorSetter = require( './../../../base/accessor-setter' );\nvar setter = require( './../../../base/setter' );\nvar dtype = require( './../../../dtype' );\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an array-like object.\n*\n* @param {Collection} x - input array\n* @returns {Function} accessor\n*\n* @example\n* var resolveGetter = require( '@stdlib/array/base/resolve-getter' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = resolveSetter( arr );\n* // returns <Function>\n*\n* set( arr, 2, 10 );\n*\n* var get = resolveGetter( arr );\n* // returns <Function>\n*\n* var v = get( arr, 2 );\n* // returns 10\n*/\nfunction resolveSetter( x ) {\n\tvar dt = dtype( x );\n\tif ( isAccessorArray( x ) ) {\n\t\treturn accessorSetter( dt );\n\t}\n\treturn setter( dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = resolveSetter;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for setting an element in an array-like object.\n*\n* @module @stdlib/array/base/resolve-setter\n*\n* @example\n* var resolveGetter = require( '@stdlib/array/base/resolve-getter' );\n* var resolveSetter = require( '@stdlib/array/base/resolve-setter' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = resolveSetter( arr );\n* // returns <Function>\n*\n* set( arr, 2, 10 );\n*\n* var get = resolveGetter( arr );\n* // returns <Function>\n*\n* var v = get( arr, 2 );\n* // returns 10\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\nvar floor = require( '@stdlib/math/base/special/floor' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'reverse' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Reverses an array in-place.\n*\n* @private\n* @param {Collection} x - input array\n* @returns {Collection} input array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = internal( x );\n* // returns [ 4, 3, 2, 1 ]\n*/\nfunction internal( x ) {\n\tvar tmp;\n\tvar N;\n\tvar M;\n\tvar i;\n\tvar j;\n\n\tN = floor( x.length/2 );\n\tM = x.length - 1;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = M - i;\n\t\ttmp = x[ i ];\n\t\tx[ i ] = x[ j ];\n\t\tx[ j ] = tmp;\n\t}\n\treturn x;\n}\n\n/**\n* Reverses an array in-place.\n*\n* @private\n* @param {Object} x - input array object\n* @returns {Collection} input array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = toAccessorArray( [ 1, 2, 3, 4 ] );\n*\n* var v = x.get( 0 );\n* // returns 1\n*\n* var out = accessors( arraylike2object( x ) );\n*\n* v = x.get( 0 );\n* // returns 4\n*/\nfunction accessors( x ) {\n\tvar data;\n\tvar get;\n\tvar set;\n\tvar tmp;\n\tvar N;\n\tvar M;\n\tvar i;\n\tvar j;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\tset = x.accessors[ 1 ];\n\n\tN = floor( data.length/2 );\n\tM = data.length - 1;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = M - i;\n\t\ttmp = get( data, i );\n\t\tset( data, i, get( data, j ) );\n\t\tset( data, j, tmp );\n\t}\n\treturn data;\n}\n\n\n// MAIN //\n\n/**\n* Reverses an array in-place.\n*\n* @param {Collection} x - input array\n* @returns {Collection} input array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = reverse( x );\n* // returns [ 4, 3, 2, 1 ]\n*\n* var bool = ( out === x );\n* // returns true\n*\n* @example\n* var Int32Array = require( '@stdlib/array/int32' );\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var out = reverse( x );\n* // returns <Int32Array>[ 4, 3, 2, 1 ]\n*\n* var bool = ( out === x );\n* // returns true\n*/\nfunction reverse( x ) {\n\tvar obj;\n\tif ( hasMethod( x, 'reverse' ) ) {\n\t\treturn x.reverse();\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj );\n\t}\n\treturn internal( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = reverse;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reverse an array in-place.\n*\n* @module @stdlib/array/base/reverse\n*\n* @example\n* var reverse = require( '@stdlib/array/base/reverse' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = reverse( x );\n* // returns [ 4, 3, 2, 1 ]\n*\n* var bool = ( out === x );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// VARIABLES //\n\nvar arraySlice = Array.prototype.slice;\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'slice' );\n* // returns true\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns a shallow copy of a portion of an array using the `Array#slice` built-in.\n*\n* @private\n* @param {Collection} x - input array\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = builtin( x, 1, 3 );\n* // returns [ 2, 3 ]\n*/\nfunction builtin( x, start, end ) {\n\treturn arraySlice.call( x, start, end );\n}\n\n/**\n* Returns a shallow copy of a portion of an accessor array.\n*\n* @private\n* @param {Object} x - input array object\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Array} output array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = arraylike2object( toAccessorArray( [ 1, 2, 3, 4 ] ) );\n*\n* var out = accessors( x, 1, 3 );\n* // returns [ 2, 3 ]\n*/\nfunction accessors( x, start, end ) {\n\tvar data;\n\tvar get;\n\tvar out;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\tout = [];\n\tfor ( i = start; i < end; i++ ) {\n\t\tout.push( get( data, i ) );\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a shallow copy of a portion of an array.\n*\n* @param {Collection} x - input array\n* @param {integer} start - starting index (inclusive)\n* @param {integer} end - ending index (exclusive)\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = slice( x, 1, 3 );\n* // returns [ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*\n* @example\n* var Int32Array = require( '@stdlib/array/int32' );\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var out = slice( x, 1, 3 );\n* // returns <Int32Array>[ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*/\nfunction slice( x, start, end ) {\n\tvar obj;\n\tif ( hasMethod( x, 'slice' ) ) {\n\t\treturn x.slice( start, end );\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj, start, end );\n\t}\n\t// Assume we can use the built-in `Array#slice` method to copy elements to a generic array:\n\treturn builtin( x, start, end );\n}\n\n\n// EXPORTS //\n\nmodule.exports = slice;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a shallow copy of a portion of an array.\n*\n* @module @stdlib/array/base/slice\n*\n* @example\n* var slice = require( '@stdlib/array/base/slice' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = slice( x, 1, 3 );\n* // returns [ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Converts a strided array to a two-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that the input array is compatible with the specified array shape, dimension strides, and index offset.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - dimension strides\n* @param {NonNegativeInteger} offset - index of the first indexed value in the input array\n* @returns {Array<Array>} two-dimensional nested array\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array2d( x, [ 3, 2 ], [ 2, 1 ], 0 );\n* // returns [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ]\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array2d( x, [ 3, 2 ], [ 1, 3 ], 0 );\n* // returns [ [ 1, 4 ], [ 2, 5 ], [ 3, 6 ] ]\n*/\nfunction strided2array2d( x, shape, strides, offset ) {\n\tvar get;\n\tvar out;\n\tvar tmp;\n\tvar dx0;\n\tvar dx1;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar ix;\n\n\tget = resolveGetter( x );\n\n\tS1 = shape[ 0 ];\n\tS0 = shape[ 1 ];\n\n\tdx1 = strides[ 0 ];\n\tdx0 = strides[ 1 ];\n\n\tout = [];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\ttmp = [];\n\t\tix = offset + ( dx1*i1 );\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\ttmp.push( get( x, ix ) );\n\t\t\tix += dx0;\n\t\t}\n\t\tout.push( tmp );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = strided2array2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert a strided array to a two-dimensional nested array.\n*\n* @module @stdlib/array/base/strided2array2d\n*\n* @example\n* var strided2array2d = require( '@stdlib/array/base/strided2array2d' );\n*\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array2d( x, [ 3, 2 ], [ 2, 1 ], 0 );\n* // returns [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ]\n*\n* arr = strided2array2d( x, [ 3, 2 ], [ 1, 3 ], 0 );\n* // returns [ [ 1, 4 ], [ 2, 5 ], [ 3, 6 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Converts a strided array to a three-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that the input array is compatible with the specified array shape, dimension strides, and index offset.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - dimension strides\n* @param {NonNegativeInteger} offset - index of the first indexed value in the input array\n* @returns {Array<Array<Array>>} three-dimensional nested array\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array3d( x, [ 1, 3, 2 ], [ 6, 2, 1 ], 0 );\n* // returns [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ]\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array3d( x, [ 1, 3, 2 ], [ 1, 1, 3 ], 0 );\n* // returns [ [ [ 1, 4 ], [ 2, 5 ], [ 3, 6 ] ] ]\n*/\nfunction strided2array3d( x, shape, strides, offset ) {\n\tvar get;\n\tvar out;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar ix1;\n\tvar ix0;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar t2;\n\tvar t1;\n\n\tget = resolveGetter( x );\n\n\tS2 = shape[ 0 ];\n\tS1 = shape[ 1 ];\n\tS0 = shape[ 2 ];\n\n\tdx2 = strides[ 0 ];\n\tdx1 = strides[ 1 ];\n\tdx0 = strides[ 2 ];\n\n\tout = [];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tt2 = [];\n\t\tix1 = offset + ( dx2*i2 );\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tt1 = [];\n\t\t\tix0 = ix1 + ( dx1*i1 );\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tt1.push( get( x, ix0 ) );\n\t\t\t\tix0 += dx0;\n\t\t\t}\n\t\t\tt2.push( t1 );\n\t\t}\n\t\tout.push( t2 );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = strided2array3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert a strided array to a three-dimensional nested array.\n*\n* @module @stdlib/array/base/strided2array3d\n*\n* @example\n* var strided2array3d = require( '@stdlib/array/base/strided2array3d' );\n*\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array3d( x, [ 1, 3, 2 ], [ 6, 2, 1 ], 0 );\n* // returns [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ]\n*\n* arr = strided2array3d( x, [ 1, 3, 2 ], [ 1, 1, 3 ], 0 );\n* // returns [ [ [ 1, 4 ], [ 2, 5 ], [ 3, 6 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Converts a strided array to a four-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that the input array is compatible with the specified array shape, dimension strides, and index offset.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - dimension strides\n* @param {NonNegativeInteger} offset - index of the first indexed value in the input array\n* @returns {Array<Array<Array<Array>>>} four-dimensional nested array\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array4d( x, [ 1, 1, 3, 2 ], [ 6, 6, 2, 1 ], 0 );\n* // returns [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ]\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array4d( x, [ 1, 1, 3, 2 ], [ 1, 1, 1, 3 ], 0 );\n* // returns [ [ [ [ 1, 4 ], [ 2, 5 ], [ 3, 6 ] ] ] ]\n*/\nfunction strided2array4d( x, shape, strides, offset ) {\n\tvar get;\n\tvar out;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar ix2;\n\tvar ix1;\n\tvar ix0;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar t3;\n\tvar t2;\n\tvar t1;\n\n\tget = resolveGetter( x );\n\n\tS3 = shape[ 0 ];\n\tS2 = shape[ 1 ];\n\tS1 = shape[ 2 ];\n\tS0 = shape[ 3 ];\n\n\tdx3 = strides[ 0 ];\n\tdx2 = strides[ 1 ];\n\tdx1 = strides[ 2 ];\n\tdx0 = strides[ 3 ];\n\n\tout = [];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tt3 = [];\n\t\tix2 = offset + ( dx3*i3 );\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tt2 = [];\n\t\t\tix1 = ix2 + ( dx2*i2 );\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tt1 = [];\n\t\t\t\tix0 = ix1 + ( dx1*i1 );\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tt1.push( get( x, ix0 ) );\n\t\t\t\t\tix0 += dx0;\n\t\t\t\t}\n\t\t\t\tt2.push( t1 );\n\t\t\t}\n\t\t\tt3.push( t2 );\n\t\t}\n\t\tout.push( t3 );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = strided2array4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert a strided array to a four-dimensional nested array.\n*\n* @module @stdlib/array/base/strided2array4d\n*\n* @example\n* var strided2array4d = require( '@stdlib/array/base/strided2array4d' );\n*\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array4d( x, [ 1, 1, 3, 2 ], [ 6, 6, 2, 1 ], 0 );\n* // returns [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ]\n*\n* arr = strided2array4d( x, [ 1, 1, 3, 2 ], [ 1, 1, 1, 3 ], 0 );\n* // returns [ [ [ [ 1, 4 ], [ 2, 5 ], [ 3, 6 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Converts a strided array to a five-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function assumes that the input array is compatible with the specified array shape, dimension strides, and index offset.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {IntegerArray} strides - dimension strides\n* @param {NonNegativeInteger} offset - index of the first indexed value in the input array\n* @returns {Array<Array<Array<Array<Array>>>>} five-dimensional nested array\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array5d( x, [ 1, 1, 1, 3, 2 ], [ 6, 6, 6, 2, 1 ], 0 );\n* // returns [ [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ] ]\n*\n* @example\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array5d( x, [ 1, 1, 1, 3, 2 ], [ 1, 1, 1, 1, 3 ], 0 );\n* // returns [ [ [ [ [ 1, 4 ], [ 2, 5 ], [ 3, 6 ] ] ] ] ]\n*/\nfunction strided2array5d( x, shape, strides, offset ) {\n\tvar get;\n\tvar out;\n\tvar dx0;\n\tvar dx1;\n\tvar dx2;\n\tvar dx3;\n\tvar dx4;\n\tvar ix3;\n\tvar ix2;\n\tvar ix1;\n\tvar ix0;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar t4;\n\tvar t3;\n\tvar t2;\n\tvar t1;\n\n\tget = resolveGetter( x );\n\n\tS4 = shape[ 0 ];\n\tS3 = shape[ 1 ];\n\tS2 = shape[ 2 ];\n\tS1 = shape[ 3 ];\n\tS0 = shape[ 4 ];\n\n\tdx4 = strides[ 0 ];\n\tdx3 = strides[ 1 ];\n\tdx2 = strides[ 2 ];\n\tdx1 = strides[ 3 ];\n\tdx0 = strides[ 4 ];\n\n\tout = [];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tt4 = [];\n\t\tix3 = offset + ( dx4*i4 );\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tt3 = [];\n\t\t\tix2 = ix3 + ( dx3*i3 );\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tt2 = [];\n\t\t\t\tix1 = ix2 + ( dx2*i2 );\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tt1 = [];\n\t\t\t\t\tix0 = ix1 + ( dx1*i1 );\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tt1.push( get( x, ix0 ) );\n\t\t\t\t\t\tix0 += dx0;\n\t\t\t\t\t}\n\t\t\t\t\tt2.push( t1 );\n\t\t\t\t}\n\t\t\t\tt3.push( t2 );\n\t\t\t}\n\t\t\tt4.push( t3 );\n\t\t}\n\t\tout.push( t4 );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = strided2array5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert a strided array to a five-dimensional nested array.\n*\n* @module @stdlib/array/base/strided2array5d\n*\n* @example\n* var strided2array5d = require( '@stdlib/array/base/strided2array5d' );\n*\n* var x = [ 1, 2, 3, 4, 5, 6 ];\n*\n* var arr = strided2array5d( x, [ 1, 1, 1, 3, 2 ], [ 6, 6, 6, 2, 1 ], 0 );\n* // returns [ [ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ] ] ] ]\n*\n* arr = strided2array5d( x, [ 1, 1, 1, 3, 2 ], [ 1, 1, 1, 1, 3 ], 0 );\n* // returns [ [ [ [ [ 1, 4 ], [ 2, 5 ], [ 3, 6 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar resolveGetter = require( './../../../base/resolve-getter' );\n\n\n// MAIN //\n\n/**\n* Takes elements from an array.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} indices - list of indices\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n* var indices = [ 3, 1, 2, 0 ];\n*\n* var y = take( x, indices );\n* // returns [ 4, 2, 3, 1 ]\n*/\nfunction take( x, indices ) {\n\tvar get;\n\tvar out;\n\tvar i;\n\n\t// Resolve an accessor for retrieving input array elements:\n\tget = resolveGetter( x );\n\n\t// Extract each desired element from the provided array...\n\tout = [];\n\tfor ( i = 0; i < indices.length; i++ ) {\n\t\tout.push( get( x, indices[ i ] ) ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = take;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Take elements from an array.\n*\n* @module @stdlib/array/base/take\n*\n* @example\n* var take = require( '@stdlib/array/base/take' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var indices = [ 0, 0, 1, 1, 3, 3 ];\n* var y = take( x, indices );\n* // returns [ 1, 1, 2, 2, 4, 4 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Takes elements from an indexed array.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeIntegerArray} indices - list of indices\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n* var indices = [ 3, 1, 2, 0 ];\n*\n* var y = take( x, indices );\n* // returns [ 4, 2, 3, 1 ]\n*/\nfunction take( x, indices ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < indices.length; i++ ) {\n\t\tout.push( x[ indices[ i ] ] ); // use `Array#push` to ensure \"fast\" elements\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = take;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Take elements from an indexed array.\n*\n* @module @stdlib/array/base/take-indexed\n*\n* @example\n* var take = require( '@stdlib/array/base/take-indexed' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var indices = [ 0, 0, 1, 1, 3, 3 ];\n* var y = take( x, indices );\n* // returns [ 1, 1, 2, 2, 4, 4 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar normalizeIndex = require( '@stdlib/ndarray/base/normalize-index' );\nvar indexFunction = require( '@stdlib/ndarray/base/ind' ).factory;\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar NDIMS = 2;\n\n\n// MAIN //\n\n/**\n* Takes elements from a two-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function does **not** deep copy nested array elements.\n*\n* @param {ArrayLikeObject<Collection>} x - input array\n* @param {NonNegativeIntegerArray} indices - list of indices\n* @param {integer} dimension - dimension along which to take elements\n* @param {string} mode - index mode specifying how to handle an index which is out-of-bounds\n* @throws {RangeError} third argument exceeds the number of dimensions\n* @throws {TypeError} fourth argument must be a recognized index mode\n* @returns {(Array<Array>|Array<Collection>)} output array\n*\n* @example\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n* var indices = [ 1, 1, 0, 0, -1, -1 ];\n*\n* var y = take2d( x, indices, 1, 'normalize' );\n* // returns [ [ 2, 2, 1, 1, 2, 2 ], [ 4, 4, 3, 3, 4, 4 ] ]\n*/\nfunction take2d( x, indices, dimension, mode ) {\n\tvar lastIndex;\n\tvar out;\n\tvar dim;\n\tvar ind;\n\tvar idx;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\n\tdim = normalizeIndex( dimension, NDIMS-1 );\n\tif ( dim === -1 ) {\n\t\tthrow new RangeError( format( 'invalid argument. Third argument exceeds the number of dimensions. Number of dimensions: %d. Value: `%d`.', NDIMS, dimension ) );\n\t}\n\tind = indexFunction( mode );\n\tout = [];\n\tif ( dim === 0 ) {\n\t\tlastIndex = x.length - 1;\n\t\tfor ( i1 = 0; i1 < indices.length; i1++ ) {\n\t\t\tidx = ind( indices[ i1 ], lastIndex );\n\t\t\tout.push( x[ idx ] );\n\t\t}\n\t\treturn out;\n\t}\n\t// Case: dim === 1\n\tfor ( i1 = 0; i1 < x.length; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = [];\n\t\tlastIndex = x0.length - 1;\n\t\tfor ( i0 = 0; i0 < indices.length; i0++ ) {\n\t\t\tidx = ind( indices[ i0 ], lastIndex );\n\t\t\ty0.push( x0[ idx ] );\n\t\t}\n\t\tout.push( y0 );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = take2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Take elements from a two-dimensional nested array.\n*\n* @module @stdlib/array/base/take2d\n*\n* @example\n* var take2d = require( '@stdlib/array/base/take2d' );\n*\n* var x = [ [ 1, 2 ], [ 3, 4 ] ];\n* var indices = [ 1, 1, 0, 0, -1, -1 ];\n*\n* var y = take2d( x, indices, 1, 'normalize' );\n* // returns [ [ 2, 2, 1, 1, 2, 2 ], [ 4, 4, 3, 3, 4, 4 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar normalizeIndex = require( '@stdlib/ndarray/base/normalize-index' );\nvar indexFunction = require( '@stdlib/ndarray/base/ind' ).factory;\nvar take2d = require( './../../../base/take2d' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar NDIMS = 3;\n\n\n// MAIN //\n\n/**\n* Takes elements from a three-dimensional nested array.\n*\n* ## Notes\n*\n* -   The function does **not** deep copy nested array elements.\n*\n* @param {ArrayLikeObject<Collection>} x - input array\n* @param {NonNegativeIntegerArray} indices - list of indices\n* @param {integer} dimension - dimension along which to take elements\n* @param {string} mode - index mode specifying how to handle an index which is out-of-bounds\n* @throws {RangeError} third argument exceeds the number of dimensions\n* @throws {TypeError} fourth argument must be a recognized index mode\n* @returns {(Array<Array>|Array<Collection>)} output array\n*\n* @example\n* var x = [ [ [ 1, 2 ], [ 3, 4 ] ] ];\n* var indices = [ 1, 1, 0, 0, -1, -1 ];\n*\n* var y = take3d( x, indices, 2, 'normalize' );\n* // returns [ [ [ 2, 2, 1, 1, 2, 2 ], [ 4, 4, 3, 3, 4, 4 ] ] ]\n*/\nfunction take3d( x, indices, dimension, mode ) {\n\tvar lastIndex;\n\tvar out;\n\tvar dim;\n\tvar ind;\n\tvar idx;\n\tvar i;\n\n\tdim = normalizeIndex( dimension, NDIMS-1 );\n\tif ( dim === -1 ) {\n\t\tthrow new RangeError( format( 'invalid argument. Third argument exceeds the number of dimensions. Number of dimensions: %d. Value: `%d`.', NDIMS, dimension ) );\n\t}\n\tout = [];\n\tif ( dim === 0 ) {\n\t\tind = indexFunction( mode );\n\t\tlastIndex = x.length - 1;\n\t\tfor ( i = 0; i < indices.length; i++ ) {\n\t\t\tidx = ind( indices[ i ], lastIndex );\n\t\t\tout.push( x[ idx ] );\n\t\t}\n\t\treturn out;\n\t}\n\t// Case: dim > 0\n\tdim = dimension - 1;\n\tfor ( i = 0; i < x.length; i++ ) {\n\t\tout.push( take2d( x[ i ], indices, dim, mode ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = take3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Take elements from a three-dimensional nested array.\n*\n* @module @stdlib/array/base/take3d\n*\n* @example\n* var take3d = require( '@stdlib/array/base/take3d' );\n*\n* var x = [ [ [ 1, 2 ], [ 3, 4 ] ] ];\n* var indices = [ 1, 1, 0, 0, -1, -1 ];\n*\n* var y = take3d( x, indices, 2, 'normalize' );\n* // returns [ [ [ 2, 2, 1, 1, 2, 2 ], [ 4, 4, 3, 3, 4, 4 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a ternary callback to elements in three two-dimensional nested input arrays and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing three input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - ternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = ones2d( shape );\n* var out = zeros2d( shape );\n*\n* ternary2d( [ x, y, z, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ]\n*/\nfunction ternary2d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tz0 = z[ i1 ];\n\t\tw0 = w[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tw0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ] );\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = ternary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a ternary callback to elements in three two-dimensional nested input arrays and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/ternary2d\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var ternary2d = require( '@stdlib/array/base/ternary2d' );\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = ones2d( shape );\n* var z = ones2d( shape );\n* var out = zeros2d( shape );\n*\n* ternary2d( [ x, y, z, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a ternary callback to elements in three three-dimensional nested input arrays and assigns results to elements in a three-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Collection>>>} arrays - array-like object containing three input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - ternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = ones3d( shape );\n* var z = ones3d( shape );\n* var out = zeros3d( shape );\n*\n* ternary3d( [ x, y, z, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ] ]\n*/\nfunction ternary3d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tx1 = x[ i2 ];\n\t\ty1 = y[ i2 ];\n\t\tz1 = z[ i2 ];\n\t\tw1 = w[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tx0 = x1[ i1 ];\n\t\t\ty0 = y1[ i1 ];\n\t\t\tz0 = z1[ i1 ];\n\t\t\tw0 = w1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tw0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ] );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = ternary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a ternary callback to elements in three three-dimensional nested input arrays and assign results to elements in a three-dimensional nested output array.\n*\n* @module @stdlib/array/base/ternary3d\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var ternary3d = require( '@stdlib/array/base/ternary3d' );\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = ones3d( shape );\n* var z = ones3d( shape );\n* var out = zeros3d( shape );\n*\n* ternary3d( [ x, y, z, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a ternary callback to elements in three four-dimensional nested input arrays and assigns results to elements in a four-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Array<Collection>>>>} arrays - array-like object containing three input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - ternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = ones4d( shape );\n* var z = ones4d( shape );\n* var out = zeros4d( shape );\n*\n* ternary4d( [ x, y, z, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ] ] ]\n*/\nfunction ternary4d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar x2;\n\tvar y2;\n\tvar z2;\n\tvar w2;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tx2 = x[ i3 ];\n\t\ty2 = y[ i3 ];\n\t\tz2 = z[ i3 ];\n\t\tw2 = w[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tx1 = x2[ i2 ];\n\t\t\ty1 = y2[ i2 ];\n\t\t\tz1 = z2[ i2 ];\n\t\t\tw1 = w2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\tw0 = w1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tw0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ] );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = ternary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a ternary callback to elements in three four-dimensional nested input arrays and assign results to elements in a four-dimensional nested output array.\n*\n* @module @stdlib/array/base/ternary4d\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var ternary4d = require( '@stdlib/array/base/ternary4d' );\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = ones4d( shape );\n* var z = ones4d( shape );\n* var out = zeros4d( shape );\n*\n* ternary4d( [ x, y, z, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a ternary callback to elements in three five-dimensional nested input arrays and assigns results to elements in a five-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Array<Array<Collection>>>>>} arrays - array-like object containing three input nested arrays and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - ternary callback\n* @returns {void}\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = ones5d( shape );\n* var z = ones5d( shape );\n* var out = zeros5d( shape );\n*\n* ternary5d( [ x, y, z, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ] ] ] ]\n*/\nfunction ternary5d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar x0;\n\tvar y0;\n\tvar z0;\n\tvar w0;\n\tvar x1;\n\tvar y1;\n\tvar z1;\n\tvar w1;\n\tvar x2;\n\tvar y2;\n\tvar z2;\n\tvar w2;\n\tvar x3;\n\tvar y3;\n\tvar z3;\n\tvar w3;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar w;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\tw = arrays[ 3 ];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tx3 = x[ i4 ];\n\t\ty3 = y[ i4 ];\n\t\tz3 = z[ i4 ];\n\t\tw3 = w[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tx2 = x3[ i3 ];\n\t\t\ty2 = y3[ i3 ];\n\t\t\tz2 = z3[ i3 ];\n\t\t\tw2 = w3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tx1 = x2[ i2 ];\n\t\t\t\ty1 = y2[ i2 ];\n\t\t\t\tz1 = z2[ i2 ];\n\t\t\t\tw1 = w2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\t\tz0 = z1[ i1 ];\n\t\t\t\t\tw0 = w1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tw0[ i0 ] = fcn( x0[ i0 ], y0[ i0 ], z0[ i0 ] );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = ternary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a ternary callback to elements in three five-dimensional nested input arrays and assign results to elements in a five-dimensional nested output array.\n*\n* @module @stdlib/array/base/ternary5d\n*\n* @example\n* var add = require( '@stdlib/math/base/ops/add3' );\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var ternary5d = require( '@stdlib/array/base/ternary5d' );\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = ones5d( shape );\n* var z = ones5d( shape );\n* var out = zeros5d( shape );\n*\n* ternary5d( [ x, y, z, out ], shape, add );\n*\n* console.log( out );\n* // => [ [ [ [ [ 3.0, 3.0 ], [ 3.0, 3.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isAccessorArray = require( './../../../base/assert/is-accessor-array' );\nvar AccessorArray = require( './../../../base/accessor' );\n\n\n// MAIN //\n\n/**\n* Converts an array-like object to a minimal array-like object supporting the accessor protocol.\n*\n* ## Notes\n*\n* -   If a provided array-like object already supports the accessor protocol, the function returns the provided array-like object; otherwise, the function wraps the provided value in a object which uses accessors for getting and setting elements.\n*\n* @param {Collection} arr - input array\n* @throws {TypeError} must provide an array-like object\n* @returns {(Collection|AccessorArray)} array-like object supporting the accessor protocol\n*\n* @example\n* var o = toAccessorArray( [ 1, 2, 3 ] );\n* // returns <AccessorArray>\n*\n* var v = o.get( 0 );\n* // returns 1\n*/\nfunction toAccessorArray( arr ) {\n\tif ( arr && typeof arr === 'object' && isAccessorArray( arr ) ) {\n\t\treturn arr;\n\t}\n\treturn new AccessorArray( arr );\n}\n\n\n// EXPORTS //\n\nmodule.exports = toAccessorArray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert an array-like object to a minimal array-like object supporting the accessor protocol.\n*\n* @module @stdlib/array/base/to-accessor-array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n*\n* var o = toAccessorArray( [ 1, 2, 3 ] );\n* // returns <Object>\n*\n* var v = o.get( 0 );\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math/base/assert/is-nan' );\n\n\n// FUNCTIONS //\n\n/**\n* Copies de-duplicated values to a new array.\n*\n* @private\n* @param {Array} x - input array\n* @param {PositiveInteger} limit - number of allowed consecutive duplicates\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 1, 2, 3, 3 ];\n*\n* var y = dedupeCopy( x, 1 );\n* // returns [ 1, 2, 3 ]\n*\n* var bool = ( x === y );\n* // returns false\n*\n* @example\n* var x = [ 1, 1, 1, 2, 1, 1, 3, 3 ];\n*\n* var y = dedupeCopy( x, 2 );\n* // returns [ 1, 1, 2, 1, 1, 3, 3 ]\n*\n* var bool = ( x === y );\n* // returns false\n*/\nfunction dedupeCopy( x, limit ) {\n\tvar count;\n\tvar prev;\n\tvar len;\n\tvar out;\n\tvar v;\n\tvar i;\n\n\tout = [];\n\tlen = x.length;\n\tif ( len === 0 ) {\n\t\treturn out;\n\t}\n\tprev = NaN; // we leverage the fact that `NaN` is not equal to anything, including itself, to handle the initial condition\n\tcount = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = x[ i ];\n\t\tif ( v === prev ) {\n\t\t\tcount += 1;\n\t\t\tif ( count <= limit ) {\n\t\t\t\tout.push( prev );\n\t\t\t}\n\t\t} else {\n\t\t\tprev = v;\n\t\t\tcount = 1;\n\t\t\tout.push( prev );\n\t\t}\n\t}\n\treturn out;\n}\n\n/**\n* Copies de-duplicated values to a new array, treating `NaN` values as equal.\n*\n* @private\n* @param {Array} x - input array\n* @param {PositiveInteger} limit - number of allowed consecutive duplicates\n* @returns {Array} output array\n*\n* @example\n* var x = [ 1, 1, 2, NaN, NaN, 3, 3 ];\n*\n* var y = dedupeEqualNaNs( x, 1 );\n* // returns [ 1, 2, NaN, 3 ]\n*\n* var bool = ( x === y );\n* // returns false\n*\n* @example\n* var x = [ 1, 1, 1, 2, 1, 1, NaN, NaN, NaN, 3, 3 ];\n*\n* var y = dedupeEqualNaNs( x, 2 );\n* // returns [ 1, 1, 2, 1, 1, NaN, NaN, 3, 3 ]\n*\n* var bool = ( x === y );\n* // returns false\n*/\nfunction dedupeEqualNaNs( x, limit ) {\n\tvar count;\n\tvar prev;\n\tvar len;\n\tvar out;\n\tvar FLG;\n\tvar v;\n\tvar i;\n\n\tout = [];\n\tlen = x.length;\n\tif ( len === 0 ) {\n\t\treturn out;\n\t}\n\tFLG = false;\n\tprev = NaN; // we leverage the fact that `NaN` is not equal to anything, including itself, to handle the initial condition\n\tcount = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = x[ i ];\n\t\tif ( v === prev || ( FLG && isnan( v ) ) ) {\n\t\t\tcount += 1;\n\t\t\tif ( count <= limit ) {\n\t\t\t\tout.push( prev );\n\t\t\t}\n\t\t} else {\n\t\t\tprev = v;\n\t\t\tcount = 1;\n\t\t\tout.push( prev );\n\t\t\tFLG = false;\n\t\t\tif ( isnan( prev ) ) {\n\t\t\t\tFLG = true;\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Copies elements to a new \"generic\" array after removing consecutive duplicated values.\n*\n* @param {Array} x - input array\n* @param {PositiveInteger} limit - number of allowed consecutive duplicates\n* @param {boolean} equalNaNs - boolean indicating whether NaNs should be considered equal\n* @returns {Array} de-duplicated values\n*\n* @example\n* var x = [ 1, 1, 2, 3, 3 ];\n*\n* var y = dedupe( x, 1, false );\n* // returns [ 1, 2, 3 ]\n*\n* var bool = ( x === y );\n* // returns false\n*\n* @example\n* var x = [ 1, 1, 1, 2, 1, 1, 3, 3 ];\n*\n* var y = dedupe( x, 2, false );\n* // returns [ 1, 1, 2, 1, 1, 3, 3 ]\n*\n* var bool = ( x === y );\n* // returns false\n*/\nfunction dedupe( x, limit, equalNaNs ) {\n\tif ( equalNaNs ) {\n\t\treturn dedupeEqualNaNs( x, limit );\n\t}\n\treturn dedupeCopy( x, limit );\n}\n\n\n// EXPORTS //\n\nmodule.exports = dedupe;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Copy elements to a new \"generic\" array after removing consecutive duplicated values.\n*\n* @module @stdlib/array/base/to-deduped\n*\n* @example\n* var toDeduped = require( '@stdlib/array/base/to-deduped' );\n*\n* var x = [ 1, 1, 2, 3, 3 ];\n*\n* var y = toDeduped( x, 1, false );\n* // returns [ 1, 2, 3 ]\n*\n* var bool = ( x === y );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( './../../../base/arraylike2object' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an object has a specified method.\n*\n* @private\n* @param {Object} obj - input object\n* @param {string} method - method name\n* @returns {boolean} boolean indicating whether an object has a specified method\n*\n* @example\n* var bool = hasMethod( [], 'beep' );\n* // returns false\n*/\nfunction hasMethod( obj, method ) {\n\treturn ( typeof obj[ method ] === 'function' );\n}\n\n/**\n* Returns a new array with elements in reverse order.\n*\n* @private\n* @param {Collection} x - input array\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = internal( x );\n* // returns [ 4, 3, 2, 1 ]\n*/\nfunction internal( x ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = x.length-1; i >= 0; i-- ) {\n\t\tout.push( x[ i ] );\n\t}\n\treturn out;\n}\n\n/**\n* Returns a new array with elements in reverse order.\n*\n* @private\n* @param {Object} x - input array object\n* @returns {Array} output array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n*\n* var x = toAccessorArray( [ 1, 2, 3, 4 ] );\n*\n* var v = x.get( 0 );\n* // returns 1\n*\n* var out = accessors( arraylike2object( x ) );\n* // returns [ 4, 3, 2, 1 ]\n*/\nfunction accessors( x ) {\n\tvar data;\n\tvar get;\n\tvar out;\n\tvar i;\n\n\tdata = x.data;\n\tget = x.accessors[ 0 ];\n\n\tout = [];\n\tfor ( i = data.length-1; i >= 0; i-- ) {\n\t\tout.push( get( data, i ) );\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a new array with elements in reverse order.\n*\n* @param {Collection} x - input array\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = toReversed( x );\n* // returns [ 4, 3, 2, 1 ]\n*\n* var bool = ( out === x );\n* // returns false\n*/\nfunction toReversed( x ) {\n\tvar obj;\n\tif ( hasMethod( x, 'toReversed' ) ) {\n\t\treturn x.toReversed();\n\t}\n\tobj = arraylike2object( x );\n\tif ( obj.accessorProtocol ) {\n\t\treturn accessors( obj );\n\t}\n\treturn internal( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = toReversed;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a new array with elements in reverse order.\n*\n* @module @stdlib/array/base/to-reversed\n*\n* @example\n* var toReversed = require( '@stdlib/array/base/to-reversed' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = toReversed( x );\n* // returns [ 4, 3, 2, 1 ]\n*\n* var bool = ( out === x );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a two-dimensional nested input array and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = zeros2d( shape );\n*\n* unary2d( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*/\nfunction unary2d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar x;\n\tvar y;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\ty0[ i0 ] = fcn( x0[ i0 ] );\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = unary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a two-dimensional nested input array and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/unary2d\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var unary2d = require( '@stdlib/array/base/unary2d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = zeros2d( shape );\n*\n* unary2d( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a unary function to each element retrieved from a two-dimensional nested input array according to a callback function and assigns results to elements in a two-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Collection>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Function} fcn - unary function to apply to callback return values\n* @param {Callback} clbk - callback function\n* @param {*} [thisArg] - callback execution context\n* @returns {void}\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* function accessor( v ) {\n*     return v - 2.0;\n* }\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = zeros2d( shape );\n*\n* unary2dBy( [ x, y ], shape, scale, accessor );\n*\n* console.log( y );\n* // => [ [ -10.0, -10.0 ], [ -10.0, -10.0 ] ]\n*/\nfunction unary2dBy( arrays, shape, fcn, clbk ) {\n\tvar thisArg;\n\tvar S0;\n\tvar S1;\n\tvar i0;\n\tvar i1;\n\tvar x0;\n\tvar y0;\n\tvar x;\n\tvar y;\n\tvar v;\n\n\tS0 = shape[ 1 ];\n\tS1 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 ) {\n\t\treturn;\n\t}\n\tif ( arguments.length > 4 ) {\n\t\tthisArg = arguments[ 4 ];\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tx0 = x[ i1 ];\n\t\ty0 = y[ i1 ];\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tv = clbk.call( thisArg, x0[ i0 ], [ i1, i0 ], [ x, y ] );\n\t\t\tif ( v !== void 0 ) {\n\t\t\t\ty0[ i0 ] = fcn( v );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = unary2dBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary function to each element retrieved from a two-dimensional nested input array according to a callback function and assign results to elements in a two-dimensional nested output array.\n*\n* @module @stdlib/array/base/unary2d-by\n*\n* @example\n* var ones2d = require( '@stdlib/array/base/ones2d' );\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n* var unary2dBy = require( '@stdlib/array/base/unary2d-by' );\n*\n* function accessor( v ) {\n*     return v - 2.0;\n* }\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = ones2d( shape );\n* var y = zeros2d( shape );\n*\n* unary2dBy( [ x, y ], shape, scale, accessor );\n*\n* console.log( y );\n* // => [ [ -10.0, -10.0 ], [ -10.0, -10.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a three-dimensional nested input array and assigns results to elements in a three-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Collection>>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = zeros3d( shape );\n*\n* unary3d( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ]\n*/\nfunction unary3d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar x0;\n\tvar x1;\n\tvar y0;\n\tvar y1;\n\tvar x;\n\tvar y;\n\n\tS0 = shape[ 2 ];\n\tS1 = shape[ 1 ];\n\tS2 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tx1 = x[ i2 ];\n\t\ty1 = y[ i2 ];\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tx0 = x1[ i1 ];\n\t\t\ty0 = y1[ i1 ];\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\ty0[ i0 ] = fcn( x0[ i0 ] );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = unary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a three-dimensional nested input array and assign results to elements in a three-dimensional nested output array.\n*\n* @module @stdlib/array/base/unary3d\n*\n* @example\n* var ones3d = require( '@stdlib/array/base/ones3d' );\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n* var unary3d = require( '@stdlib/array/base/unary3d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 2, 2 ];\n*\n* var x = ones3d( shape );\n* var y = zeros3d( shape );\n*\n* unary3d( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a four-dimensional nested input array and assigns results to elements in a four-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Collection>>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = zeros4d( shape );\n*\n* unary4d( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ]\n*/\nfunction unary4d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar x0;\n\tvar x1;\n\tvar x2;\n\tvar y0;\n\tvar y1;\n\tvar y2;\n\tvar x;\n\tvar y;\n\n\tS0 = shape[ 3 ];\n\tS1 = shape[ 2 ];\n\tS2 = shape[ 1 ];\n\tS3 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tx2 = x[ i3 ];\n\t\ty2 = y[ i3 ];\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tx1 = x2[ i2 ];\n\t\t\ty1 = y2[ i2 ];\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\ty0[ i0 ] = fcn( x0[ i0 ] );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = unary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a four-dimensional nested input array and assign results to elements in a four-dimensional nested output array.\n*\n* @module @stdlib/array/base/unary4d\n*\n* @example\n* var ones4d = require( '@stdlib/array/base/ones4d' );\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n* var unary4d = require( '@stdlib/array/base/unary4d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 2, 2 ];\n*\n* var x = ones4d( shape );\n* var y = zeros4d( shape );\n*\n* unary4d( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in a five-dimensional nested input array and assigns results to elements in a five-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject<Array<Array<Collection>>>} arrays - array-like object containing one input nested array and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = zeros5d( shape );\n*\n* unary5d( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ] ]\n*/\nfunction unary5d( arrays, shape, fcn ) {\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar x0;\n\tvar x1;\n\tvar x2;\n\tvar x3;\n\tvar y0;\n\tvar y1;\n\tvar y2;\n\tvar y3;\n\tvar x;\n\tvar y;\n\n\tS0 = shape[ 4 ];\n\tS1 = shape[ 3 ];\n\tS2 = shape[ 2 ];\n\tS3 = shape[ 1 ];\n\tS4 = shape[ 0 ];\n\tif ( S0 <= 0 || S1 <= 0 || S2 <= 0 || S3 <= 0 || S4 <= 0 ) {\n\t\treturn;\n\t}\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tx3 = x[ i4 ];\n\t\ty3 = y[ i4 ];\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tx2 = x3[ i3 ];\n\t\t\ty2 = y3[ i3 ];\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tx1 = x2[ i2 ];\n\t\t\t\ty1 = y2[ i2 ];\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tx0 = x1[ i1 ];\n\t\t\t\t\ty0 = y1[ i1 ];\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\ty0[ i0 ] = fcn( x0[ i0 ] );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = unary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in a five-dimensional nested input array and assign results to elements in a five-dimensional nested output array.\n*\n* @module @stdlib/array/base/unary5d\n*\n* @example\n* var ones5d = require( '@stdlib/array/base/ones5d' );\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n* var unary5d = require( '@stdlib/array/base/unary5d' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 1, 1, 1, 2, 2 ];\n*\n* var x = ones5d( shape );\n* var y = zeros5d( shape );\n*\n* unary5d( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ [ [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\n/**\n* Recursively applies a unary callback.\n*\n* @private\n* @param {ArrayLikeObject} x - input array\n* @param {ArrayLikeObject} y - output array\n* @param {NonNegativeInteger} ndims - number of dimensions\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {NonNegativeInteger} dim - dimension index\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*/\nfunction recurse( x, y, ndims, shape, dim, fcn ) {\n\tvar S;\n\tvar d;\n\tvar i;\n\n\tS = shape[ dim ];\n\n\t// Check whether we've reached the innermost dimension:\n\td = dim + 1;\n\n\tif ( d === ndims ) {\n\t\t// Apply the provided callback...\n\t\tfor ( i = 0; i < S; i++ ) {\n\t\t\ty[ i ] = fcn( x[ i ] );\n\t\t}\n\t\treturn;\n\t}\n\t// Continue recursing into the nested arrays...\n\tfor ( i = 0; i < S; i++ ) {\n\t\trecurse( x[ i ], y[ i ], ndims, shape, d, fcn );\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Applies a unary callback to elements in an n-dimensional nested input array and assigns results to elements in an n-dimensional nested output array.\n*\n* ## Notes\n*\n* -   The function assumes that the input and output arrays have the same shape.\n*\n* @param {ArrayLikeObject} arrays - array-like object containing one input nested array and one output nested array\n* @param {NonNegativeIntegerArray} shape - array shape\n* @param {Callback} fcn - unary callback\n* @returns {void}\n*\n* @example\n* var onesnd = require( '@stdlib/array/base/onesnd' );\n* var zerosnd = require( '@stdlib/array/base/zerosnd' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = onesnd( shape );\n* var y = zerosnd( shape );\n*\n* unarynd( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*/\nfunction unarynd( arrays, shape, fcn ) {\n\treturn recurse( arrays[ 0 ], arrays[ 1 ], shape.length, shape, 0, fcn );\n}\n\n\n// EXPORTS //\n\nmodule.exports = unarynd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Apply a unary callback to elements in an n-dimensional nested input array and assign results to elements in an n-dimensional nested output array.\n*\n* @module @stdlib/array/base/unarynd\n*\n* @example\n* var onesnd = require( '@stdlib/array/base/onesnd' );\n* var zerosnd = require( '@stdlib/array/base/zerosnd' );\n* var unarynd = require( '@stdlib/array/base/unarynd' );\n*\n* function scale( x ) {\n*     return x * 10.0;\n* }\n*\n* var shape = [ 2, 2 ];\n*\n* var x = onesnd( shape );\n* var y = zerosnd( shape );\n*\n* unarynd( [ x, y ], shape, scale );\n*\n* console.log( y );\n* // => [ [ 10.0, 10.0 ], [ 10.0, 10.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1.\n*\n* @param {number} x1 - first array value\n* @param {number} x2 - array element bound\n* @returns {Array} linearly spaced numeric array\n*\n* @example\n* var arr = unitspace( 0, 6 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*/\nfunction unitspace( x1, x2 ) {\n\tvar arr;\n\tvar len;\n\tvar i;\n\n\tlen = x2 - x1;\n\tif ( len <= 1 ) {\n\t\treturn [ x1 ];\n\t}\n\tarr = [ x1 ];\n\tfor ( i = 1; i < len; i++ ) {\n\t\tarr.push( x1 + i );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = unitspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1.\n*\n* @module @stdlib/array/base/unitspace\n*\n* @example\n* var unitspace = require( '@stdlib/array/base/unitspace' );\n*\n* var arr = unitspace( 0, 6 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1 starting from zero.\n*\n* @param {number} n - number of elements\n* @returns {Array<number>} linearly spaced numeric array\n*\n* @example\n* var arr = zeroTo( 6 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*/\nfunction zeroTo( n ) {\n\tvar arr;\n\tvar i;\n\n\tarr = [];\n\tif ( n <= 0 ) {\n\t\treturn arr;\n\t}\n\tfor ( i = 0; i < n; i++ ) {\n\t\tarr.push( i );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeroTo;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplex128Array = require( './../../../base/assert/is-complex128array' );\nvar isComplex64Array = require( './../../../base/assert/is-complex64array' );\nvar arraylike2object = require( './../../../base/arraylike2object' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\n\n\n// FUNCTIONS //\n\n/**\n* Fills an indexed array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = indexed( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = indexed( out, -1, out.length-1 );\n* // returns [ 5, 4, 3, 2, 1, 0 ]\n*/\nfunction indexed( out, stride, offset ) {\n\tvar v;\n\tvar i;\n\n\ti = offset;\n\tv = 0;\n\twhile ( i >= 0 && i < out.length ) {\n\t\tout[ i ] = v;\n\t\ti += stride;\n\t\tv += 1;\n\t}\n\treturn out;\n}\n\n/**\n* Fills a complex number array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {(Complex128Array|Complex64Array)} out - output complex number array\n* @param {(Float64Array|Float32Array)} data - output array data\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {(Complex128Array|Complex64Array)} output array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array/complex128' );\n* var reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\n*\n* var out = new Complex128Array( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n* // returns <Complex128Array>\n*\n* var data = reinterpret128( out, 0 );\n* // returns <Float64Array>[ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* var arr = complex( out, data, 1, 0 );\n* // returns <Complex128Array>\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* data = reinterpret128( out, 0 );\n* returns <Float64Array>[ 0.0, 0.0, 1.0, 0.0, 2.0, 0.0 ]\n*/\nfunction complex( out, data, stride, offset ) {\n\tvar v;\n\tvar s;\n\tvar i;\n\n\ts = stride * 2;\n\ti = offset * 2;\n\tv = 0.0;\n\twhile ( i >= 0 && i < data.length ) {\n\t\tdata[ i ] = v;     // real component\n\t\tdata[ i+1 ] = 0.0; // imaginary component\n\t\ti += s;\n\t\tv += 1.0;\n\t}\n\treturn out;\n}\n\n/**\n* Fills an accessor array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @private\n* @param {Object} out - output array object\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );\n* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );\n\n* var out = toAccessorArray( [ 0, 0, 0, 0, 0, 0 ] );\n* var arr = accessors( arraylike2object( out ), 1, 0 );\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* var v = out.get( 0 );\n* // returns 0\n*\n* v = out.get( out.length-1 );\n* // returns 5\n*/\nfunction accessors( out, stride, offset ) {\n\tvar data;\n\tvar set;\n\tvar v;\n\tvar i;\n\n\tdata = out.data;\n\tset = out.accessors[ 1 ];\n\n\ti = offset;\n\tv = 0;\n\twhile ( i >= 0 && i < data.length ) {\n\t\tset( data, i, v );\n\t\ti += stride;\n\t\tv += 1;\n\t}\n\treturn data;\n}\n\n\n// MAIN //\n\n/**\n* Fills an array with linearly spaced numeric elements which increment by 1 starting from zero.\n*\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = assign( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n*\n* var arr = assign( out, -1, out.length-1 );\n* // returns [ 5, 4, 3, 2, 1, 0 ]\n*/\nfunction assign( out, stride, offset ) {\n\tvar obj = arraylike2object( out );\n\tif ( obj.accessorProtocol ) {\n\t\t// If provided a complex number array, reinterpret as a real typed array and only set the real components...\n\t\tif ( isComplex128Array( out ) ) {\n\t\t\treturn complex( out, reinterpret128( out, 0 ), stride, offset );\n\t\t}\n\t\tif ( isComplex64Array( out ) ) {\n\t\t\treturn complex( out, reinterpret64( out, 0 ), stride, offset );\n\t\t}\n\t\treturn accessors( obj, stride, offset );\n\t}\n\treturn indexed( out, stride, offset );\n}\n\n\n// EXPORTS //\n\nmodule.exports = assign;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1 starting from zero.\n*\n* @module @stdlib/array/base/zero-to\n*\n* @example\n* var zeroTo = require( '@stdlib/array/base/zero-to' );\n*\n* var arr = zeroTo( 6 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* @example\n* var zeroTo = require( '@stdlib/array/base/zero-to' );\n*\n* var out = [ 0, 0, 0, 0, 0, 0 ];\n* var arr = zeroTo.assign( out, 1, 0 );\n* // returns [ 0, 1, 2, 3, 4, 5 ]\n*\n* var bool = ( out === arr );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled2d = require( './../../../base/filled2d' );\n\n\n// MAIN //\n\n/**\n* Returns a zero-filled two-dimensional nested array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {ArrayArray} filled array\n*\n* @example\n* var out = zeros2d( [ 1, 3 ] );\n* // returns [ [ 0.0, 0.0, 0.0 ] ]\n*/\nfunction zeros2d( shape ) {\n\treturn filled2d( 0.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeros2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a zero-filled two-dimensional nested array.\n*\n* @module @stdlib/array/base/zeros2d\n*\n* @example\n* var zeros2d = require( '@stdlib/array/base/zeros2d' );\n*\n* var out = zeros2d( [ 1, 3 ] );\n* // returns [ [ 0.0, 0.0, 0.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled3d = require( './../../../base/filled3d' );\n\n\n// MAIN //\n\n/**\n* Returns a zero-filled three-dimensional nested array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = zeros3d( [ 1, 1, 3 ] );\n* // returns [ [ [ 0.0, 0.0, 0.0 ] ] ]\n*/\nfunction zeros3d( shape ) {\n\treturn filled3d( 0.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeros3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a zero-filled three-dimensional nested array.\n*\n* @module @stdlib/array/base/zeros3d\n*\n* @example\n* var zeros3d = require( '@stdlib/array/base/zeros3d' );\n*\n* var out = zeros3d( [ 1, 1, 3 ] );\n* // returns [ [ [ 0.0, 0.0, 0.0 ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled4d = require( './../../../base/filled4d' );\n\n\n// MAIN //\n\n/**\n* Returns a zero-filled four-dimensional nested array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = zeros4d( [ 1, 1, 1, 3 ] );\n* // returns [ [ [ [ 0.0, 0.0, 0.0 ] ] ] ]\n*/\nfunction zeros4d( shape ) {\n\treturn filled4d( 0.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeros4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a zero-filled four-dimensional nested array.\n*\n* @module @stdlib/array/base/zeros4d\n*\n* @example\n* var zeros4d = require( '@stdlib/array/base/zeros4d' );\n*\n* var out = zeros4d( [ 1, 1, 1, 3 ] );\n* // returns [ [ [ [ 0.0, 0.0, 0.0 ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar filled5d = require( './../../../base/filled5d' );\n\n\n// MAIN //\n\n/**\n* Returns a zero-filled five-dimensional nested array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = zeros5d( [ 1, 1, 1, 1, 3 ] );\n* // returns [ [ [ [ [ 0.0, 0.0, 0.0 ] ] ] ] ]\n*/\nfunction zeros5d( shape ) {\n\treturn filled5d( 0.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeros5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a zero-filled five-dimensional nested array.\n*\n* @module @stdlib/array/base/zeros5d\n*\n* @example\n* var zeros5d = require( '@stdlib/array/base/zeros5d' );\n*\n* var out = zeros5d( [ 1, 1, 1, 1, 3 ] );\n* // returns [ [ [ [ [ 0.0, 0.0, 0.0 ] ] ] ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar fillednd = require( './../../../base/fillednd' );\n\n\n// MAIN //\n\n/**\n* Returns a zero-filled n-dimensional nested array.\n*\n* @param {NonNegativeIntegerArray} shape - array shape\n* @returns {Array} filled array\n*\n* @example\n* var out = zerosnd( [ 3 ] );\n* // returns [ 0.0, 0.0, 0.0 ]\n*\n* @example\n* var out = zerosnd( [ 1, 3 ] );\n* // returns [ [ 0.0, 0.0, 0.0 ] ]\n*/\nfunction zerosnd( shape ) {\n\treturn fillednd( 0.0, shape );\n}\n\n\n// EXPORTS //\n\nmodule.exports = zerosnd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a zero-filled n-dimensional nested array.\n*\n* @module @stdlib/array/base/zerosnd\n*\n* @example\n* var zerosnd = require( '@stdlib/array/base/zerosnd' );\n*\n* var out = zerosnd( [ 1, 3 ] );\n* // returns [ [ 0.0, 0.0, 0.0 ] ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/*\n* When adding modules to the namespace, ensure that they are added in alphabetical order according to module name.\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-read-only-property' );\n\n\n// MAIN //\n\n/**\n* Namespace.\n*\n* @namespace ns\n*/\nvar ns = {};\n\n/**\n* @name AccessorArray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/accessor}\n*/\nsetReadOnly( ns, 'AccessorArray', require( './../../base/accessor' ) );\n\n/**\n* @name accessorGetter\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/accessor-getter}\n*/\nsetReadOnly( ns, 'accessorGetter', require( './../../base/accessor-getter' ) );\n\n/**\n* @name accessorSetter\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/accessor-setter}\n*/\nsetReadOnly( ns, 'accessorSetter', require( './../../base/accessor-setter' ) );\n\n/**\n* @name accessors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/accessors}\n*/\nsetReadOnly( ns, 'accessors', require( './../../base/accessors' ) );\n\n/**\n* @name any\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/any}\n*/\nsetReadOnly( ns, 'any', require( './../../base/any' ) );\n\n/**\n* @name anyBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/any-by}\n*/\nsetReadOnly( ns, 'anyBy', require( './../../base/any-by' ) );\n\n/**\n* @name anyByRight\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/any-by-right}\n*/\nsetReadOnly( ns, 'anyByRight', require( './../../base/any-by-right' ) );\n\n/**\n* @name arraylike2object\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/arraylike2object}\n*/\nsetReadOnly( ns, 'arraylike2object', require( './../../base/arraylike2object' ) );\n\n/**\n* @name assert\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/array/base/assert}\n*/\nsetReadOnly( ns, 'assert', require( './../../base/assert' ) );\n\n/**\n* @name at\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/at}\n*/\nsetReadOnly( ns, 'at', require( './../../base/at' ) );\n\n/**\n* @name at2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/at2d}\n*/\nsetReadOnly( ns, 'at2d', require( './../../base/at2d' ) );\n\n/**\n* @name at3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/at3d}\n*/\nsetReadOnly( ns, 'at3d', require( './../../base/at3d' ) );\n\n/**\n* @name at4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/at4d}\n*/\nsetReadOnly( ns, 'at4d', require( './../../base/at4d' ) );\n\n/**\n* @name at5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/at5d}\n*/\nsetReadOnly( ns, 'at5d', require( './../../base/at5d' ) );\n\n/**\n* @name atnd\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/atnd}\n*/\nsetReadOnly( ns, 'atnd', require( './../../base/atnd' ) );\n\n/**\n* @name bifurcateEntries\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/array/base/bifurcate-entries}\n*/\nsetReadOnly( ns, 'bifurcateEntries', require( './../../base/bifurcate-entries' ) );\n\n/**\n* @name bifurcateEntriesBy\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/array/base/bifurcate-entries-by}\n*/\nsetReadOnly( ns, 'bifurcateEntriesBy', require( './../../base/bifurcate-entries-by' ) );\n\n/**\n* @name bifurcateIndices\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/array/base/bifurcate-indices}\n*/\nsetReadOnly( ns, 'bifurcateIndices', require( './../../base/bifurcate-indices' ) );\n\n/**\n* @name bifurcateIndicesBy\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/array/base/bifurcate-indices-by}\n*/\nsetReadOnly( ns, 'bifurcateIndicesBy', require( './../../base/bifurcate-indices-by' ) );\n\n/**\n* @name bifurcateValues\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/array/base/bifurcate-values}\n*/\nsetReadOnly( ns, 'bifurcateValues', require( './../../base/bifurcate-values' ) );\n\n/**\n* @name bifurcateValuesBy\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/array/base/bifurcate-values-by}\n*/\nsetReadOnly( ns, 'bifurcateValuesBy', require( './../../base/bifurcate-values-by' ) );\n\n/**\n* @name binary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/binary2d}\n*/\nsetReadOnly( ns, 'binary2d', require( './../../base/binary2d' ) );\n\n/**\n* @name binary3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/binary3d}\n*/\nsetReadOnly( ns, 'binary3d', require( './../../base/binary3d' ) );\n\n/**\n* @name binary4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/binary4d}\n*/\nsetReadOnly( ns, 'binary4d', require( './../../base/binary4d' ) );\n\n/**\n* @name binary5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/binary5d}\n*/\nsetReadOnly( ns, 'binary5d', require( './../../base/binary5d' ) );\n\n/**\n* @name binarynd\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/binarynd}\n*/\nsetReadOnly( ns, 'binarynd', require( './../../base/binarynd' ) );\n\n/**\n* @name broadcastArray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcast-array}\n*/\nsetReadOnly( ns, 'broadcastArray', require( './../../base/broadcast-array' ) );\n\n/**\n* @name bbinary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-binary2d}\n*/\nsetReadOnly( ns, 'bbinary2d', require( './../../base/broadcasted-binary2d' ) );\n\n/**\n* @name bbinary3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-binary3d}\n*/\nsetReadOnly( ns, 'bbinary3d', require( './../../base/broadcasted-binary3d' ) );\n\n/**\n* @name bbinary4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-binary4d}\n*/\nsetReadOnly( ns, 'bbinary4d', require( './../../base/broadcasted-binary4d' ) );\n\n/**\n* @name bbinary5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-binary5d}\n*/\nsetReadOnly( ns, 'bbinary5d', require( './../../base/broadcasted-binary5d' ) );\n\n/**\n* @name bquaternary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-quaternary2d}\n*/\nsetReadOnly( ns, 'bquaternary2d', require( './../../base/broadcasted-quaternary2d' ) );\n\n/**\n* @name bquinary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-quinary2d}\n*/\nsetReadOnly( ns, 'bquinary2d', require( './../../base/broadcasted-quinary2d' ) );\n\n/**\n* @name bternary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-ternary2d}\n*/\nsetReadOnly( ns, 'bternary2d', require( './../../base/broadcasted-ternary2d' ) );\n\n/**\n* @name bunary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-unary2d}\n*/\nsetReadOnly( ns, 'bunary2d', require( './../../base/broadcasted-unary2d' ) );\n\n/**\n* @name bunary3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-unary3d}\n*/\nsetReadOnly( ns, 'bunary3d', require( './../../base/broadcasted-unary3d' ) );\n\n/**\n* @name bunary4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-unary4d}\n*/\nsetReadOnly( ns, 'bunary4d', require( './../../base/broadcasted-unary4d' ) );\n\n/**\n* @name bunary5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/broadcasted-unary5d}\n*/\nsetReadOnly( ns, 'bunary5d', require( './../../base/broadcasted-unary5d' ) );\n\n/**\n* @name cartesianPower\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/cartesian-power}\n*/\nsetReadOnly( ns, 'cartesianPower', require( './../../base/cartesian-power' ) );\n\n/**\n* @name cartesianProduct\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/cartesian-product}\n*/\nsetReadOnly( ns, 'cartesianProduct', require( './../../base/cartesian-product' ) );\n\n/**\n* @name cartesianSquare\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/cartesian-square}\n*/\nsetReadOnly( ns, 'cartesianSquare', require( './../../base/cartesian-square' ) );\n\n/**\n* @name copy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/copy}\n*/\nsetReadOnly( ns, 'copy', require( './../../base/copy' ) );\n\n/**\n* @name copyIndexed\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/copy-indexed}\n*/\nsetReadOnly( ns, 'copyIndexed', require( './../../base/copy-indexed' ) );\n\n/**\n* @name dedupe\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/dedupe}\n*/\nsetReadOnly( ns, 'dedupe', require( './../../base/dedupe' ) );\n\n/**\n* @name every\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/every}\n*/\nsetReadOnly( ns, 'every', require( './../../base/every' ) );\n\n/**\n* @name everyBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/every-by}\n*/\nsetReadOnly( ns, 'everyBy', require( './../../base/every-by' ) );\n\n/**\n* @name everyByRight\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/every-by-right}\n*/\nsetReadOnly( ns, 'everyByRight', require( './../../base/every-by-right' ) );\n\n/**\n* @name filled\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled}\n*/\nsetReadOnly( ns, 'filled', require( './../../base/filled' ) );\n\n/**\n* @name filledBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled-by}\n*/\nsetReadOnly( ns, 'filledBy', require( './../../base/filled-by' ) );\n\n/**\n* @name filled2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled2d}\n*/\nsetReadOnly( ns, 'filled2d', require( './../../base/filled2d' ) );\n\n/**\n* @name filled2dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled2d-by}\n*/\nsetReadOnly( ns, 'filled2dBy', require( './../../base/filled2d-by' ) );\n\n/**\n* @name filled3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled3d}\n*/\nsetReadOnly( ns, 'filled3d', require( './../../base/filled3d' ) );\n\n/**\n* @name filled3dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled3d-by}\n*/\nsetReadOnly( ns, 'filled3dBy', require( './../../base/filled3d-by' ) );\n\n/**\n* @name filled4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled4d}\n*/\nsetReadOnly( ns, 'filled4d', require( './../../base/filled4d' ) );\n\n/**\n* @name filled4dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled4d-by}\n*/\nsetReadOnly( ns, 'filled4dBy', require( './../../base/filled4d-by' ) );\n\n/**\n* @name filled5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled5d}\n*/\nsetReadOnly( ns, 'filled5d', require( './../../base/filled5d' ) );\n\n/**\n* @name filled5dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filled5d-by}\n*/\nsetReadOnly( ns, 'filled5dBy', require( './../../base/filled5d-by' ) );\n\n/**\n* @name fillednd\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/fillednd}\n*/\nsetReadOnly( ns, 'fillednd', require( './../../base/fillednd' ) );\n\n/**\n* @name filledndBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/fillednd-by}\n*/\nsetReadOnly( ns, 'filledndBy', require( './../../base/fillednd-by' ) );\n\n/**\n* @name filter\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/filter}\n*/\nsetReadOnly( ns, 'filter', require( './../../base/filter' ) );\n\n/**\n* @name first\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/first}\n*/\nsetReadOnly( ns, 'first', require( './../../base/first' ) );\n\n/**\n* @name flatten\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten}\n*/\nsetReadOnly( ns, 'flatten', require( './../../base/flatten' ) );\n\n/**\n* @name flattenBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten-by}\n*/\nsetReadOnly( ns, 'flattenBy', require( './../../base/flatten-by' ) );\n\n/**\n* @name flatten2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten2d}\n*/\nsetReadOnly( ns, 'flatten2d', require( './../../base/flatten2d' ) );\n\n/**\n* @name flatten2dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten2d-by}\n*/\nsetReadOnly( ns, 'flatten2dBy', require( './../../base/flatten2d-by' ) );\n\n/**\n* @name flatten3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten3d}\n*/\nsetReadOnly( ns, 'flatten3d', require( './../../base/flatten3d' ) );\n\n/**\n* @name flatten3dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten3d-by}\n*/\nsetReadOnly( ns, 'flatten3dBy', require( './../../base/flatten3d-by' ) );\n\n/**\n* @name flatten4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten4d}\n*/\nsetReadOnly( ns, 'flatten4d', require( './../../base/flatten4d' ) );\n\n/**\n* @name flatten4dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten4d-by}\n*/\nsetReadOnly( ns, 'flatten4dBy', require( './../../base/flatten4d-by' ) );\n\n/**\n* @name flatten5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten5d}\n*/\nsetReadOnly( ns, 'flatten5d', require( './../../base/flatten5d' ) );\n\n/**\n* @name flatten5dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flatten5d-by}\n*/\nsetReadOnly( ns, 'flatten5dBy', require( './../../base/flatten5d-by' ) );\n\n/**\n* @name fliplr2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/fliplr2d}\n*/\nsetReadOnly( ns, 'fliplr2d', require( './../../base/fliplr2d' ) );\n\n/**\n* @name fliplr3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/fliplr3d}\n*/\nsetReadOnly( ns, 'fliplr3d', require( './../../base/fliplr3d' ) );\n\n/**\n* @name fliplr4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/fliplr4d}\n*/\nsetReadOnly( ns, 'fliplr4d', require( './../../base/fliplr4d' ) );\n\n/**\n* @name fliplr5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/fliplr5d}\n*/\nsetReadOnly( ns, 'fliplr5d', require( './../../base/fliplr5d' ) );\n\n/**\n* @name flipud2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flipud2d}\n*/\nsetReadOnly( ns, 'flipud2d', require( './../../base/flipud2d' ) );\n\n/**\n* @name flipud3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flipud3d}\n*/\nsetReadOnly( ns, 'flipud3d', require( './../../base/flipud3d' ) );\n\n/**\n* @name flipud4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flipud4d}\n*/\nsetReadOnly( ns, 'flipud4d', require( './../../base/flipud4d' ) );\n\n/**\n* @name flipud5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/flipud5d}\n*/\nsetReadOnly( ns, 'flipud5d', require( './../../base/flipud5d' ) );\n\n/**\n* @name strided2array\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/from-strided}\n*/\nsetReadOnly( ns, 'strided2array', require( './../../base/from-strided' ) );\n\n/**\n* @name getter\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/getter}\n*/\nsetReadOnly( ns, 'getter', require( './../../base/getter' ) );\n\n/**\n* @name groupEntries\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/group-entries}\n*/\nsetReadOnly( ns, 'groupEntries', require( './../../base/group-entries' ) );\n\n/**\n* @name groupEntriesBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/group-entries-by}\n*/\nsetReadOnly( ns, 'groupEntriesBy', require( './../../base/group-entries-by' ) );\n\n/**\n* @name groupIndices\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/group-indices}\n*/\nsetReadOnly( ns, 'groupIndices', require( './../../base/group-indices' ) );\n\n/**\n* @name groupIndicesBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/group-indices-by}\n*/\nsetReadOnly( ns, 'groupIndicesBy', require( './../../base/group-indices-by' ) );\n\n/**\n* @name groupValues\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/group-values}\n*/\nsetReadOnly( ns, 'groupValues', require( './../../base/group-values' ) );\n\n/**\n* @name groupValuesBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/group-values-by}\n*/\nsetReadOnly( ns, 'groupValuesBy', require( './../../base/group-values-by' ) );\n\n/**\n* @name incrspace\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/incrspace}\n*/\nsetReadOnly( ns, 'incrspace', require( './../../base/incrspace' ) );\n\n/**\n* @name indexOf\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/index-of}\n*/\nsetReadOnly( ns, 'indexOf', require( './../../base/index-of' ) );\n\n/**\n* @name last\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/last}\n*/\nsetReadOnly( ns, 'last', require( './../../base/last' ) );\n\n/**\n* @name lastIndexOf\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/last-index-of}\n*/\nsetReadOnly( ns, 'lastIndexOf', require( './../../base/last-index-of' ) );\n\n/**\n* @name linspace\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/linspace}\n*/\nsetReadOnly( ns, 'linspace', require( './../../base/linspace' ) );\n\n/**\n* @name logspace\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/logspace}\n*/\nsetReadOnly( ns, 'logspace', require( './../../base/logspace' ) );\n\n/**\n* @name map2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/map2d}\n*/\nsetReadOnly( ns, 'map2d', require( './../../base/map2d' ) );\n\n/**\n* @name map3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/map3d}\n*/\nsetReadOnly( ns, 'map3d', require( './../../base/map3d' ) );\n\n/**\n* @name map4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/map4d}\n*/\nsetReadOnly( ns, 'map4d', require( './../../base/map4d' ) );\n\n/**\n* @name map5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/map5d}\n*/\nsetReadOnly( ns, 'map5d', require( './../../base/map5d' ) );\n\n/**\n* @name mskbinary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/mskbinary2d}\n*/\nsetReadOnly( ns, 'mskbinary2d', require( './../../base/mskbinary2d' ) );\n\n/**\n* @name mskfilter\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/mskfilter}\n*/\nsetReadOnly( ns, 'mskfilter', require( './../../base/mskfilter' ) );\n\n/**\n* @name mskreject\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/mskreject}\n*/\nsetReadOnly( ns, 'mskreject', require( './../../base/mskreject' ) );\n\n/**\n* @name mskunary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/mskunary2d}\n*/\nsetReadOnly( ns, 'mskunary2d', require( './../../base/mskunary2d' ) );\n\n/**\n* @name mskunary3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/mskunary3d}\n*/\nsetReadOnly( ns, 'mskunary3d', require( './../../base/mskunary3d' ) );\n\n/**\n* @name nCartesianProduct\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/n-cartesian-product}\n*/\nsetReadOnly( ns, 'nCartesianProduct', require( './../../base/n-cartesian-product' ) );\n\n/**\n* @name none\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/none}\n*/\nsetReadOnly( ns, 'none', require( './../../base/none' ) );\n\n/**\n* @name noneBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/none-by}\n*/\nsetReadOnly( ns, 'noneBy', require( './../../base/none-by' ) );\n\n/**\n* @name noneByRight\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/none-by-right}\n*/\nsetReadOnly( ns, 'noneByRight', require( './../../base/none-by-right' ) );\n\n/**\n* @name oneTo\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/one-to}\n*/\nsetReadOnly( ns, 'oneTo', require( './../../base/one-to' ) );\n\n/**\n* @name ones\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ones}\n*/\nsetReadOnly( ns, 'ones', require( './../../base/ones' ) );\n\n/**\n* @name ones2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ones2d}\n*/\nsetReadOnly( ns, 'ones2d', require( './../../base/ones2d' ) );\n\n/**\n* @name ones3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ones3d}\n*/\nsetReadOnly( ns, 'ones3d', require( './../../base/ones3d' ) );\n\n/**\n* @name ones4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ones4d}\n*/\nsetReadOnly( ns, 'ones4d', require( './../../base/ones4d' ) );\n\n/**\n* @name ones5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ones5d}\n*/\nsetReadOnly( ns, 'ones5d', require( './../../base/ones5d' ) );\n\n/**\n* @name onesnd\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/onesnd}\n*/\nsetReadOnly( ns, 'onesnd', require( './../../base/onesnd' ) );\n\n/**\n* @name quaternary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/quaternary2d}\n*/\nsetReadOnly( ns, 'quaternary2d', require( './../../base/quaternary2d' ) );\n\n/**\n* @name quaternary3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/quaternary3d}\n*/\nsetReadOnly( ns, 'quaternary3d', require( './../../base/quaternary3d' ) );\n\n/**\n* @name quaternary4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/quaternary4d}\n*/\nsetReadOnly( ns, 'quaternary4d', require( './../../base/quaternary4d' ) );\n\n/**\n* @name quaternary5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/quaternary5d}\n*/\nsetReadOnly( ns, 'quaternary5d', require( './../../base/quaternary5d' ) );\n\n/**\n* @name quinary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/quinary2d}\n*/\nsetReadOnly( ns, 'quinary2d', require( './../../base/quinary2d' ) );\n\n/**\n* @name quinary3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/quinary3d}\n*/\nsetReadOnly( ns, 'quinary3d', require( './../../base/quinary3d' ) );\n\n/**\n* @name quinary4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/quinary4d}\n*/\nsetReadOnly( ns, 'quinary4d', require( './../../base/quinary4d' ) );\n\n/**\n* @name quinary5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/quinary5d}\n*/\nsetReadOnly( ns, 'quinary5d', require( './../../base/quinary5d' ) );\n\n/**\n* @name reject\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/reject}\n*/\nsetReadOnly( ns, 'reject', require( './../../base/reject' ) );\n\n/**\n* @name resolveGetter\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/resolve-getter}\n*/\nsetReadOnly( ns, 'resolveGetter', require( './../../base/resolve-getter' ) );\n\n/**\n* @name resolveSetter\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/resolve-setter}\n*/\nsetReadOnly( ns, 'resolveSetter', require( './../../base/resolve-setter' ) );\n\n/**\n* @name reverse\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/reverse}\n*/\nsetReadOnly( ns, 'reverse', require( './../../base/reverse' ) );\n\n/**\n* @name setter\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/setter}\n*/\nsetReadOnly( ns, 'setter', require( './../../base/setter' ) );\n\n/**\n* @name slice\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/slice}\n*/\nsetReadOnly( ns, 'slice', require( './../../base/slice' ) );\n\n/**\n* @name strided2array2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/strided2array2d}\n*/\nsetReadOnly( ns, 'strided2array2d', require( './../../base/strided2array2d' ) );\n\n/**\n* @name strided2array3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/strided2array3d}\n*/\nsetReadOnly( ns, 'strided2array3d', require( './../../base/strided2array3d' ) );\n\n/**\n* @name strided2array4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/strided2array4d}\n*/\nsetReadOnly( ns, 'strided2array4d', require( './../../base/strided2array4d' ) );\n\n/**\n* @name strided2array5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/strided2array5d}\n*/\nsetReadOnly( ns, 'strided2array5d', require( './../../base/strided2array5d' ) );\n\n/**\n* @name take\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/take}\n*/\nsetReadOnly( ns, 'take', require( './../../base/take' ) );\n\n/**\n* @name takeIndexed\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/take-indexed}\n*/\nsetReadOnly( ns, 'takeIndexed', require( './../../base/take-indexed' ) );\n\n/**\n* @name take2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/take2d}\n*/\nsetReadOnly( ns, 'take2d', require( './../../base/take2d' ) );\n\n/**\n* @name take3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/take3d}\n*/\nsetReadOnly( ns, 'take3d', require( './../../base/take3d' ) );\n\n/**\n* @name ternary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ternary2d}\n*/\nsetReadOnly( ns, 'ternary2d', require( './../../base/ternary2d' ) );\n\n/**\n* @name ternary3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ternary3d}\n*/\nsetReadOnly( ns, 'ternary3d', require( './../../base/ternary3d' ) );\n\n/**\n* @name ternary4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ternary4d}\n*/\nsetReadOnly( ns, 'ternary4d', require( './../../base/ternary4d' ) );\n\n/**\n* @name ternary5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/ternary5d}\n*/\nsetReadOnly( ns, 'ternary5d', require( './../../base/ternary5d' ) );\n\n/**\n* @name toAccessorArray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/to-accessor-array}\n*/\nsetReadOnly( ns, 'toAccessorArray', require( './../../base/to-accessor-array' ) );\n\n/**\n* @name toDeduped\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/to-deduped}\n*/\nsetReadOnly( ns, 'toDeduped', require( './../../base/to-deduped' ) );\n\n/**\n* @name toReversed\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/to-reversed}\n*/\nsetReadOnly( ns, 'toReversed', require( './../../base/to-reversed' ) );\n\n/**\n* @name unary2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/unary2d}\n*/\nsetReadOnly( ns, 'unary2d', require( './../../base/unary2d' ) );\n\n/**\n* @name unary2dBy\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/unary2d-by}\n*/\nsetReadOnly( ns, 'unary2dBy', require( './../../base/unary2d-by' ) );\n\n/**\n* @name unary3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/unary3d}\n*/\nsetReadOnly( ns, 'unary3d', require( './../../base/unary3d' ) );\n\n/**\n* @name unary4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/unary4d}\n*/\nsetReadOnly( ns, 'unary4d', require( './../../base/unary4d' ) );\n\n/**\n* @name unary5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/unary5d}\n*/\nsetReadOnly( ns, 'unary5d', require( './../../base/unary5d' ) );\n\n/**\n* @name unarynd\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/unarynd}\n*/\nsetReadOnly( ns, 'unarynd', require( './../../base/unarynd' ) );\n\n/**\n* @name unitspace\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/unitspace}\n*/\nsetReadOnly( ns, 'unitspace', require( './../../base/unitspace' ) );\n\n/**\n* @name zeroTo\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/zero-to}\n*/\nsetReadOnly( ns, 'zeroTo', require( './../../base/zero-to' ) );\n\n/**\n* @name zeros\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/zeros}\n*/\nsetReadOnly( ns, 'zeros', require( './../../base/zeros' ) );\n\n/**\n* @name zeros2d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/zeros2d}\n*/\nsetReadOnly( ns, 'zeros2d', require( './../../base/zeros2d' ) );\n\n/**\n* @name zeros3d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/zeros3d}\n*/\nsetReadOnly( ns, 'zeros3d', require( './../../base/zeros3d' ) );\n\n/**\n* @name zeros4d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/zeros4d}\n*/\nsetReadOnly( ns, 'zeros4d', require( './../../base/zeros4d' ) );\n\n/**\n* @name zeros5d\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/zeros5d}\n*/\nsetReadOnly( ns, 'zeros5d', require( './../../base/zeros5d' ) );\n\n/**\n* @name zerosnd\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/base/zerosnd}\n*/\nsetReadOnly( ns, 'zerosnd', require( './../../base/zerosnd' ) );\n\n\n// EXPORTS //\n\nmodule.exports = ns;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof ArrayBuffer === 'function' ) ? ArrayBuffer : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Constructor which returns an object used to represent a generic, fixed-length raw binary data buffer.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Constructor which returns an object used to represent a generic, fixed-length raw binary data buffer.\n*\n* @module @stdlib/array/buffer\n*\n* @example\n* var ctor = require( '@stdlib/array/buffer' );\n*\n* var buf = new ctor( 10 );\n* // returns <ArrayBuffer>\n*/\n\n// MODULES //\n\nvar hasArrayBufferSupport = require( '@stdlib/assert/has-arraybuffer-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasArrayBufferSupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar base = require( './../../base/cartesian-power' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns the Cartesian power.\n*\n* @param {Collection} x - input array\n* @param {NonNegativeInteger} n - power\n* @throws {TypeError} first argument must be a collection\n* @throws {TypeError} second argument must be a nonnegative integer\n* @returns {Array<Array>} list of ordered tuples comprising the Cartesian product\n*\n* @example\n* var x = [ 1, 2 ];\n*\n* var out = cartesianPower( x, 2 );\n* // returns [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ]\n*/\nfunction cartesianPower( x, n ) {\n\tif ( !isCollection( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', x ) );\n\t}\n\tif ( !isNonNegativeInteger( n ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a nonnegative integer. Value: `%s`.', n ) );\n\t}\n\treturn base( x, n );\n}\n\n\n// EXPORTS //\n\nmodule.exports = cartesianPower;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the Cartesian power.\n*\n* @module @stdlib/array/cartesian-power\n*\n* @example\n* var cartesianPower = require( '@stdlib/array/cartesian-power' );\n*\n* var x = [ 1, 2 ];\n*\n* var out = cartesianPower( x, 2 );\n* // returns [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ]\n*/\n\n// MAIN //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar base = require( './../../base/cartesian-product' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns the Cartesian product.\n*\n* @param {Collection} x1 - first input array\n* @param {Collection} x2 - second input array\n* @throws {TypeError} first argument must be a collection\n* @throws {TypeError} second argument must be a collection\n* @returns {Array<Array>} list of ordered tuples comprising the Cartesian product\n*\n* @example\n* var x1 = [ 1, 2, 3 ];\n* var x2 = [ 4, 5 ];\n*\n* var out = cartesianProduct( x1, x2 );\n* // returns [ [ 1, 4 ], [ 1, 5 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 3, 5 ] ]\n*/\nfunction cartesianProduct( x1, x2 ) {\n\tif ( !isCollection( x1 ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', x1 ) );\n\t}\n\tif ( !isCollection( x2 ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an array-like object. Value: `%s`.', x2 ) );\n\t}\n\treturn base( x1, x2 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = cartesianProduct;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the Cartesian product.\n*\n* @module @stdlib/array/cartesian-product\n*\n* @example\n* var cartesianProduct = require( '@stdlib/array/cartesian-product' );\n*\n* var x1 = [ 1, 2, 3 ];\n* var x2 = [ 4, 5 ];\n*\n* var out = cartesianProduct( x1, x2 );\n* // returns [ [ 1, 4 ], [ 1, 5 ], [ 2, 4 ], [ 2, 5 ], [ 3, 4 ], [ 3, 5 ] ]\n*/\n\n// MAIN //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar base = require( './../../base/cartesian-square' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns the Cartesian square.\n*\n* @param {Collection} x - input array\n* @throws {TypeError} first argument must be a collection\n* @returns {Array<Array>} list of ordered tuples comprising the Cartesian product\n*\n* @example\n* var x = [ 1, 2 ];\n*\n* var out = cartesianSquare( x );\n* // returns [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ]\n*/\nfunction cartesianSquare( x ) {\n\tif ( !isCollection( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', x ) );\n\t}\n\treturn base( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = cartesianSquare;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the Cartesian square.\n*\n* @module @stdlib/array/cartesian-square\n*\n* @example\n* var cartesianSquare = require( '@stdlib/array/cartesian-square' );\n*\n* var x = [ 1, 2 ];\n*\n* var out = cartesianSquare( x );\n* // returns [ [ 1, 1 ], [ 1, 2 ], [ 2, 1 ], [ 2, 2 ] ]\n*/\n\n// MAIN //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( './../../float64' );\nvar Float32Array = require( './../../float32' );\nvar Int16Array = require( './../../int16' );\nvar Int32Array = require( './../../int32' );\nvar Int8Array = require( './../../int8' );\nvar Uint16Array = require( './../../uint16' );\nvar Uint32Array = require( './../../uint32' );\nvar Uint8Array = require( './../../uint8' );\nvar Uint8ClampedArray = require( './../../uint8c' );\nvar Complex64Array = require( './../../complex64' );\nvar Complex128Array = require( './../../complex128' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'float64': Float64Array,\n\t'float32': Float32Array,\n\t'generic': Array, // TODO: replace with `stdlib` pkg\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array,\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray,\n\t'complex64': Complex64Array,\n\t'complex128': Complex128Array\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns an array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Array constructors.\n*\n* @module @stdlib/array/ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/ctors' );\n*\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* ctor = ctors( 'int' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar getType = require( './../../dtype' );\nvar ctors = require( './../../ctors' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar format = require( '@stdlib/string/format' );\nvar gcopy = require( '@stdlib/blas/base/gcopy' );\nvar copy = require( './../../base/copy' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether a data type is a single-precision complex floating-point number data type.\n*\n* @private\n* @param {string} dtype - data type\n* @returns {boolean} boolean indicating whether a provided data type is a single-precision complex floating-point number data type\n*\n* @example\n* var bool = isComplex64( 'float64' );\n* // returns false\n*\n* @example\n* var bool = isComplex64( 'complex64' );\n* // returns true\n*/\nfunction isComplex64( dtype ) {\n\treturn ( dtype === 'complex64' );\n}\n\n/**\n* Tests whether a data type is a double-precision complex floating-point number data type.\n*\n* @private\n* @param {string} dtype - data type\n* @returns {boolean} boolean indicating whether a provided data type is a double-precision complex floating-point number data type\n*\n* @example\n* var bool = isComplex128( 'float64' );\n* // returns false\n*\n* @example\n* var bool = isComplex128( 'complex128' );\n* // returns true\n*/\nfunction isComplex128( dtype ) {\n\treturn ( dtype === 'complex128' );\n}\n\n\n// MAIN //\n\n/**\n* Converts an array to an array of a different data type.\n*\n* @param {Collection} x - array to convert\n* @param {string} dtype - output data type\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} second argument must be a recognized array data type\n* @returns {(Array|TypedArray|ComplexArray)} output array\n*\n* @example\n* var arr = [ 1.0, 2.0, 3.0, 4.0 ];\n*\n* var out = convert( arr, 'float64' );\n* // returns <Float64Array>[ 1.0, 2.0, 3.0, 4.0 ]\n*/\nfunction convert( x, dtype ) {\n\tvar isc64;\n\tvar ctor;\n\tvar xbuf;\n\tvar obuf;\n\tvar out;\n\tvar len;\n\tvar t;\n\n\tif ( !isCollection( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', x ) );\n\t}\n\t// If the output data type is \"generic\", our task is relatively straightforward...\n\tif ( dtype === 'generic' ) {\n\t\treturn copy( x );\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a recognized array data type. Value: `%s`.', dtype ) );\n\t}\n\t// Cache the input array length:\n\tlen = x.length;\n\n\t// Get the input array data type:\n\tt = getType( x );\n\tisc64 = isComplex64( t );\n\n\t// Create the output array:\n\tout = new ctor( len );\n\n\t// As the output data type is not \"generic\", we need to explicitly handle complex number input arrays...\n\tif ( isc64 || isComplex128( t ) ) {\n\t\tif ( isc64 ) {\n\t\t\txbuf = reinterpret64( x, 0 );\n\t\t} else {\n\t\t\txbuf = reinterpret128( x, 0 );\n\t\t}\n\t\t// Check whether the output data type is a complex number data type...\n\t\tif ( isComplex64( dtype ) ) { // cmplx => cmplx\n\t\t\tobuf = reinterpret64( out, 0 );\n\t\t\tgcopy( len*2, xbuf, 1, obuf, 1 );\n\t\t\treturn out;\n\t\t}\n\t\tif ( isComplex128( dtype ) ) { // cmplx => cmplx\n\t\t\tobuf = reinterpret128( out, 0 );\n\t\t\tgcopy( len*2, xbuf, 1, obuf, 1 );\n\t\t\treturn out;\n\t\t}\n\t\t// We assume that the output data type is a real number data type, given that we're looking to convert a provided complex number array; in which case, we'll only extract the real components from the complex number input array...\n\t\tgcopy( len, xbuf, 2, out, 1 ); // cmplx => real\n\t\treturn out;\n\t}\n\t// Check whether we need to explicitly handle complex number output arrays...\n\tisc64 = isComplex64( dtype );\n\tif ( isc64 || isComplex128( dtype ) ) {\n\t\tif ( isc64 ) {\n\t\t\tobuf = reinterpret64( out, 0 );\n\t\t} else {\n\t\t\tobuf = reinterpret128( out, 0 );\n\t\t}\n\t\t// We assume that the input data type is a real number data type, given that we're looking to convert to a complex number array; in which case, we'll only set the real components... (WARNING: we're assuming that the output array has been zero-initialized! The imaginary components should be zero!)\n\t\tgcopy( len, x, 1, obuf, 2 ); // real => cmplx\n\t\treturn out;\n\t}\n\t// At this point, we're no longer handling complex number arrays, so we'll just assume that we can perform a straightforward copy...\n\tgcopy( len, x, 1, out, 1 ); // note: `gcopy` is assumed to support arrays using accessors\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = convert;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert an array to an array of a different data type.\n*\n* @module @stdlib/array/convert\n*\n* @example\n* var convert = require( '@stdlib/array/convert' );\n*\n* var arr = [ 1.0, 2.0, 3.0, 4.0 ];\n*\n* var out = convert( arr, 'float64' );\n* // returns <Float64Array>[ 1.0, 2.0, 3.0, 4.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar getType = require( './../../dtype' );\nvar convert = require( './../../convert' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Converts an array to the same data type as a second input array.\n*\n* @param {Collection} x - array to convert\n* @param {(Array|TypedArray|ComplexArray)} y - array having the desired output data type\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} second argument must have a recognized data type\n* @returns {(Array|TypedArray|ComplexArray)} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0 ];\n* var y = new Float64Array( 0 );\n*\n* var out = convertSame( x, y );\n* // returns <Float64Array>[ 1.0, 2.0, 3.0, 4.0 ]\n*/\nfunction convertSame( x, y ) {\n\tvar dtype = getType( y );\n\tif ( dtype === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must have a recognized/supported data type. Type: `%s`. Value: `%s`.', dtype, y ) );\n\t}\n\treturn convert( x, dtype );\n}\n\n\n// EXPORTS //\n\nmodule.exports = convertSame;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert an array to the same data type as a second input array.\n*\n* @module @stdlib/array/convert-same\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var convertSame = require( '@stdlib/array/convert-same' );\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0 ];\n* var y = new Float64Array( 0 );\n*\n* var out = convertSame( x, y );\n* // returns <Float64Array>[ 1.0, 2.0, 3.0, 4.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof DataView === 'function' ) ? DataView : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Constructor which returns a data view representing a provided array buffer.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Constructor which returns a data view representing a provided array buffer.\n*\n* @module @stdlib/array/dataview\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var DataView = require( '@stdlib/array/dataview' );\n*\n* var buf = new ArrayBuffer( 10 );\n* // returns <ArrayBuffer>\n*\n* var dv = new DataView( buf );\n* // returns <DataView>\n*/\n\n// MODULES //\n\nvar hasDataViewSupport = require( '@stdlib/assert/has-dataview-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasDataViewSupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasOwnProp = require( '@stdlib/assert/has-own-property' );\nvar isInteger = require( '@stdlib/assert/is-integer' );\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar isObject = require( '@stdlib/assert/is-object' );\nvar format = require( '@stdlib/string/format' );\nvar floor = require( '@stdlib/math/base/special/floor' );\nvar round = require( '@stdlib/math/base/special/round' );\nvar ceil = require( '@stdlib/math/base/special/ceil' );\n\n\n// VARIABLES //\n\nvar timestamp = /^\\d{10}$|^\\d{13}$/;\nvar rounders = [ 'floor', 'ceil', 'round' ];\n\n\n// FUNCTIONS //\n\n/**\n* Validates a date parameter.\n*\n* @private\n* @param {*} value - value to be validated\n* @param {string} name - name to be used in error messages\n* @throws {TypeError} value must either be a date string, Date object, Unix timestamp, or JavaScript timestamp\n* @throws {Error} numeric date must be either a Unix or JavaScript timestamp\n* @returns {Date} validated date\n*/\nfunction validDate( value, name ) {\n\tvar type;\n\n\ttype = typeof value;\n\tif ( type === 'string' ) {\n\t\tvalue = Date.parse( value );\n\t\tif ( value !== value ) {\n\t\t\tthrow new Error( format( 'invalid argument. Unable to parse %s date.', name.toLowerCase() ) );\n\t\t}\n\t\tvalue = new Date( value );\n\t}\n\tif ( type === 'number' ) {\n\t\tif ( !timestamp.test( value ) ) {\n\t\t\tthrow new Error( format( 'invalid argument. Numeric %s date must be either a Unix or JavaScript timestamp.', name.toLowerCase() ) );\n\t\t}\n\t\tif ( value.toString().length === 10 ) {\n\t\t\tvalue *= 1000; // sec to ms\n\t\t}\n\t\tvalue = new Date( value );\n\t}\n\tif ( !(value instanceof Date) ) {\n\t\tthrow new TypeError( format( 'invalid argument. %s date must either be a date string, Date object, Unix timestamp, or JavaScript timestamp.', name ) );\n\t}\n\treturn value;\n}\n\n\n// MAIN //\n\n/**\n* Generates an array of linearly spaced dates.\n*\n* @param {(Date|number|string)} start - start time as either a `Date` object, Unix timestamp, JavaScript timestamp, or date string\n* @param {(Date|number|string)} stop - stop time as either a `Date` object, Unix timestamp, JavaScript timestamp, or date string\n* @param {number} [length] - output array length (default: 100)\n* @param {Object} [options] - function options\n* @param {string} [options.round] - specifies how sub-millisecond times should be rounded: [ 'floor', 'ceil', 'round' ] (default: 'floor' )\n* @throws {TypeError} length argument must a positive integer\n* @throws {Error} must provide valid options\n* @returns {Array} array of dates\n*\n* @example\n* var stop = '2014-12-02T07:00:54.973Z';\n* var start = new Date( stop ) - 60000;\n*\n* var arr = datespace( start, stop, 6 );\n* // returns [...]\n*\n* @example\n* // Equivalent of Math.ceil():\n* var arr = datespace( 1417503655000, 1417503655001, 3, { 'round': 'ceil' } );\n* // returns [...]\n*\n* // Equivalent of Math.round():\n* arr = datespace( 1417503655000, 1417503655001, 3, { 'round': 'round' } );\n* // returns [...]\n*/\nfunction datespace( start, stop, length, options ) {\n\tvar opts;\n\tvar len;\n\tvar flg;\n\tvar arr;\n\tvar end;\n\tvar fcn;\n\tvar tmp;\n\tvar d;\n\tvar i;\n\n\tlen = 100;\n\tflg = true;\n\topts = {\n\t\t'round': 'floor'\n\t};\n\tstart = validDate( start, 'Start' );\n\tstop = validDate( stop, 'Stop' );\n\tif ( arguments.length > 2 ) {\n\t\tif ( arguments.length === 3 ) {\n\t\t\tif ( isObject( length ) ) {\n\t\t\t\topts = length;\n\t\t\t} else {\n\t\t\t\tlen = length;\n\n\t\t\t\t// Turn off checking the options object...\n\t\t\t\tflg = false;\n\t\t\t}\n\t\t} else {\n\t\t\topts = options;\n\t\t\tlen = length;\n\t\t}\n\t\tif ( len === 0 ) {\n\t\t\treturn [];\n\t\t}\n\t\tif ( !isInteger( len ) || len < 0 ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a positive integer. Value: `%s`.', len ) );\n\t\t}\n\t\tif ( flg ) {\n\t\t\tif ( !isObject( opts ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', opts ) );\n\t\t\t}\n\t\t\tif ( hasOwnProp( opts, 'round' ) ) {\n\t\t\t\tif ( !isString( opts.round ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'round', opts.round ) );\n\t\t\t\t}\n\t\t\t\tif ( rounders.indexOf( opts.round ) === -1 ) {\n\t\t\t\t\tthrow new Error( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'round', rounders.join( '\", \"' ), opts.round ) );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tswitch ( opts.round ) {\n\tcase 'round':\n\t\tfcn = round;\n\t\tbreak;\n\tcase 'ceil':\n\t\tfcn = ceil;\n\t\tbreak;\n\tcase 'floor':\n\tdefault:\n\t\tfcn = floor;\n\t\tbreak;\n\t}\n\n\t// Calculate the increment...\n\tend = len - 1;\n\td = ( stop.getTime() - start.getTime() ) / end;\n\n\t// Build the output array...\n\tarr = new Array( len );\n\ttmp = start;\n\tarr[ 0 ] = tmp;\n\ttmp = tmp.getTime();\n\tfor ( i = 1; i < end; i++ ) {\n\t\ttmp += d;\n\t\tarr[ i ] = new Date( fcn( tmp ) );\n\t}\n\tarr[ end ] = stop;\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = datespace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate an array of linearly spaced dates.\n*\n* @module @stdlib/array/datespace\n*\n* @example\n* var datespace = require( '@stdlib/array/datespace' );\n*\n* var stop = '2014-12-02T07:00:54.973Z';\n* var start = new Date( stop ) - 60000;\n*\n* var arr = datespace( start, stop, 6 );\n* // returns [...]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns default array settings.\n*\n* @returns {Object} defaults\n*\n* @example\n* var o = defaults();\n* // returns {...}\n*/\nfunction defaults() {\n\treturn {\n\t\t// Data types:\n\t\t'dtypes': {\n\t\t\t'default': 'float64',\n\t\t\t'numeric': 'float64',\n\t\t\t'real': 'float64',\n\t\t\t'floating_point': 'float64',\n\t\t\t'real_floating_point': 'float64',\n\t\t\t'complex_floating_point': 'complex128',\n\t\t\t'integer': 'int32',\n\t\t\t'signed_integer': 'int32',\n\t\t\t'unsigned_integer': 'uint32'\n\t\t}\n\t};\n}\n\n\n// EXPORTS //\n\nmodule.exports = defaults;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar defaults = require( './main.js' );\n\n\n// VARIABLES //\n\nvar DEFAULTS = defaults();\nvar HASH = {\n\t'dtypes.default': DEFAULTS.dtypes.default,\n\t'dtypes.numeric': DEFAULTS.dtypes.numeric,\n\t'dtypes.real': DEFAULTS.dtypes.real,\n\t'dtypes.floating_point': DEFAULTS.dtypes.floating_point,\n\t'dtypes.real_floating_point': DEFAULTS.dtypes.real_floating_point,\n\t'dtypes.complex_floating_point': DEFAULTS.dtypes.complex_floating_point,\n\t'dtypes.integer': DEFAULTS.dtypes.integer,\n\t'dtypes.signed_integer': DEFAULTS.dtypes.signed_integer,\n\t'dtypes.unsigned_integer': DEFAULTS.dtypes.unsigned_integer\n};\n\n\n// MAIN //\n\n/**\n* Returns a default array setting.\n*\n* @param {string} name - setting name\n* @returns {*} default setting or null\n*\n* @example\n* var v = get( 'dtypes.default' );\n* // returns <string>\n*/\nfunction get( name ) {\n\tvar v = HASH[ name ];\n\treturn ( v === void 0 ) ? null : v;\n}\n\n\n// EXPORTS //\n\nmodule.exports = get;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return default array settings.\n*\n* @module @stdlib/array/defaults\n*\n* @example\n* var defaults = require( '@stdlib/array/defaults' );\n*\n* var o = defaults();\n* // returns {...}\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar get = require( './get.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'get', get );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "{\n  \"all\": [\n    \"complex64\",\n    \"complex128\",\n    \"float32\",\n    \"float64\",\n    \"generic\",\n    \"int16\",\n    \"int32\",\n    \"int8\",\n    \"uint16\",\n    \"uint32\",\n    \"uint8\",\n    \"uint8c\"\n  ],\n  \"floating_point\": [\n    \"complex64\",\n    \"complex128\",\n    \"float32\",\n    \"float64\"\n  ],\n  \"real_floating_point\": [\n    \"float32\",\n    \"float64\"\n  ],\n  \"complex_floating_point\": [\n    \"complex64\",\n    \"complex128\"\n  ],\n  \"integer\": [\n    \"int16\",\n    \"int32\",\n    \"int8\",\n    \"uint16\",\n    \"uint32\",\n    \"uint8\",\n    \"uint8c\"\n  ],\n  \"signed_integer\": [\n    \"int16\",\n    \"int32\",\n    \"int8\"\n  ],\n  \"unsigned_integer\": [\n    \"uint16\",\n    \"uint32\",\n    \"uint8\",\n    \"uint8c\"\n  ],\n  \"real\": [\n    \"float32\",\n    \"float64\",\n    \"int16\",\n    \"int32\",\n    \"int8\",\n    \"uint16\",\n    \"uint32\",\n    \"uint8\",\n    \"uint8c\"\n  ],\n  \"numeric\": [\n    \"complex64\",\n    \"complex128\",\n    \"float32\",\n    \"float64\",\n    \"int16\",\n    \"int32\",\n    \"int8\",\n    \"uint16\",\n    \"uint32\",\n    \"uint8\",\n    \"uint8c\"\n  ]\n}\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar replace = require( '@stdlib/string/base/replace' );\nvar DTYPES = require( './dtypes.json' );\n\n\n// VARIABLES //\n\nvar RE_SUFFIX = /_and_generic$/;\n\n\n// MAIN //\n\n/**\n* Returns a list of array data types.\n*\n* @param {string} [kind] - data type kind\n* @returns {StringArray} list of array data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', ... ]\n*\n* @example\n* var list = dtypes( 'floating_point' );\n* // returns [...]\n*/\nfunction dtypes() {\n\tvar kind;\n\tvar out;\n\tvar FLG;\n\tif ( arguments.length === 0 ) {\n\t\treturn DTYPES.all.slice();\n\t}\n\tFLG = false;\n\tkind = arguments[ 0 ];\n\tif ( RE_SUFFIX.test( kind ) ) {\n\t\tkind = replace( kind, RE_SUFFIX, '' );\n\t\tif ( kind !== 'all' ) {\n\t\t\tFLG = true;\n\t\t}\n\t}\n\tout = DTYPES[ kind ];\n\tout = ( out ) ? out.slice() : [];\n\tif ( FLG && out.length > 0 ) {\n\t\tout.push( 'generic' );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of array data types.\n*\n* @module @stdlib/array/dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/dtypes' );\n*\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', 'generic', 'int16', 'int32', 'int8', 'uint16', 'uint32', 'uint8', 'uint8c', 'complex128', 'complex64' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar allocUnsafe = require( '@stdlib/buffer/alloc-unsafe' );\nvar isUint8Array = require( '@stdlib/assert/is-uint8array' );\n\n\n// MAIN //\n\n/**\n* Checks whether an environment supports Node.js buffer instances which inherit from `Uint8Array`.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment supports Node.js buffer instances inheriting from `Uint8Array`\n*\n* @example\n* var bool = check();\n* // returns <boolean>\n*/\nfunction check() {\n\tvar buf = allocUnsafe( 1 );\n\treturn isUint8Array( buf );\n}\n\n\n// EXPORTS //\n\nmodule.exports = check;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( './../../float64' );\nvar Float32Array = require( './../../float32' );\nvar Int16Array = require( './../../int16' );\nvar Int32Array = require( './../../int32' );\nvar Int8Array = require( './../../int8' );\nvar Uint16Array = require( './../../uint16' );\nvar Uint32Array = require( './../../uint32' );\nvar Uint8Array = require( './../../uint8' );\nvar Uint8ClampedArray = require( './../../uint8c' );\nvar Complex64Array = require( './../../complex64' );\nvar Complex128Array = require( './../../complex128' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'float64': Float64Array,\n\t'float32': Float32Array,\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array,\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray,\n\t'complex64': Complex64Array,\n\t'complex128': Complex128Array\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns a typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructors.\n*\n* @module @stdlib/array/typed-ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/typed-ctors' );\n*\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* ctor = ctors( 'int' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar allocUnsafe = require( '@stdlib/buffer/alloc-unsafe' );\nvar ctors = require( './../../typed-ctors' );\nvar zeros = require( './../../base/zeros' );\nvar bytesPerElement = require( '@stdlib/ndarray/base/bytes-per-element' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\n\n\n// MAIN //\n\n/**\n* Creates an uninitialized array having a specified length.\n*\n* @param {NonNegativeInteger} length - array length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = empty( 2 );\n* // returns <Float64Array>\n*\n* @example\n* var arr = empty( 2, 'float32' );\n* // returns <Float32Array>\n*/\nfunction empty( length ) {\n\tvar nbytes;\n\tvar offset;\n\tvar dtype;\n\tvar ctor;\n\tvar buf;\n\tvar out;\n\tvar nb;\n\n\tif ( !isNonNegativeInteger( length ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a nonnegative integer. Value: `%s`.', length ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdtype = arguments[ 1 ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tif ( dtype === 'generic' ) {\n\t\treturn zeros( length );\n\t}\n\tnbytes = bytesPerElement( dtype );\n\tif ( nbytes === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a supported data type. Value: `%s`.', dtype ) );\n\t}\n\t// Resolve typed array constructor:\n\tctor = ctors( dtype );\n\n\t// Compute the number of bytes to allocate:\n\tnb = nbytes * length;\n\tif ( dtype === 'complex128' ) {\n\t\tnb += 8; // Note: need to allocate additional bytes to ensure alignment\n\t}\n\t// Allocate binary buffer:\n\tbuf = allocUnsafe( nb );\n\n\t// Resolve the byte offset:\n\toffset = buf.byteOffset;\n\tif ( dtype === 'complex128' ) {\n\t\tif ( !isNonNegativeInteger( offset/nbytes ) ) {\n\t\t\toffset += 8; // Note: ensure alignment\n\t\t}\n\t}\n\t// Reinterpret the binary buffer:\n\tout = new ctor( buf.buffer, offset, length );\n\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = empty;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar ctors = require( './../../ctors' );\nvar gzeros = require( './../../base/zeros' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\n\n\n// MAIN //\n\n/**\n* Creates a zero-filled array having a specified length.\n*\n* @param {NonNegativeInteger} length - array length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = zeros( 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var arr = zeros( 2, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*/\nfunction zeros( length ) {\n\tvar dtype;\n\tvar ctor;\n\tif ( !isNonNegativeInteger( length ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a nonnegative integer. Value: `%s`.', length ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdtype = arguments[ 1 ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tif ( dtype === 'generic' ) {\n\t\treturn gzeros( length );\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\treturn new ctor( length ); // WARNING: we assume that, apart from 'generic', the constructors for supported array data types are zero-filled by default\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeros;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a zero-filled array having a specified length.\n*\n* @module @stdlib/array/zeros\n*\n* @example\n* var zeros = require( '@stdlib/array/zeros' );\n*\n* var arr = zeros( 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var zeros = require( '@stdlib/array/zeros' );\n*\n* var arr = zeros( 2, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar zeros = require( './../../zeros' );\n\n\n// MAIN //\n\n/**\n* Creates an uninitialized array having a specified length.\n*\n* @private\n* @param {NonNegativeInteger} length - array length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = empty( 2 );\n* // returns <Float64Array>\n*\n* @example\n* var arr = empty( 2, 'float32' );\n* // returns <Float32Array>\n*/\nfunction empty( length ) {\n\tif ( arguments.length > 1 ) {\n\t\treturn zeros( length, arguments[ 1 ] );\n\t}\n\treturn zeros( length );\n}\n\n\n// EXPORTS //\n\nmodule.exports = empty;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an uninitialized array having a specified length.\n*\n* @module @stdlib/array/empty\n*\n* @example\n* var empty = require( '@stdlib/array/empty' );\n*\n* var arr = empty( 2 );\n* // returns <Float64Array>\n*\n* @example\n* var empty = require( '@stdlib/array/empty' );\n*\n* var arr = empty( 2, 'float32' );\n* // returns <Float32Array>\n*/\n\n// MODULES //\n\nvar isBufferUint8Array = require( './is_buffer_uint8array.js' );\nvar main = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar empty;\nif ( isBufferUint8Array() ) {\n\tempty = main;\n} else {\n\tempty = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = empty;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar dtype = require( './../../dtype' );\nvar empty = require( './../../empty' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Creates an uninitialized array having the same length and data type as a provided input array.\n*\n* @param {(Array|TypedArray|ComplexArray)} x - input array\n* @param {string} [dtype] - data type\n* @throws {TypeError} first argument must be an array or typed array\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = emptyLike( [ 0.0, 0.0 ] );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* var arr = emptyLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>\n*/\nfunction emptyLike( x ) {\n\tvar dt = dtype( x ); // delegate input argument validation to dtype resolution\n\tif ( dt === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.', x ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdt = arguments[ 1 ];\n\t}\n\treturn empty( x.length, dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = emptyLike;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an uninitialized array having the same length and data type as a provided input array.\n*\n* @module @stdlib/array/empty-like\n*\n* @example\n* var emptyLike = require( '@stdlib/array/empty-like' );\n*\n* var arr = emptyLike( [ 0.0, 0.0 ] );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* var emptyLike = require( '@stdlib/array/empty-like' );\n*\n* var arr = emptyLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isArrayBuffer = require( '@stdlib/assert/is-arraybuffer' );\nvar isObject = require( '@stdlib/assert/is-object' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar ctors = require( './../../ctors' );\nvar gfill = require( '@stdlib/blas/ext/base/gfill' );\nvar filled = require( './../../base/filled' );\nvar hasIteratorSymbolSupport = require( '@stdlib/assert/has-iterator-symbol-support' );\nvar ITERATOR_SYMBOL = require( '@stdlib/symbol/iterator' );\nvar iterLength = require( '@stdlib/iter/length' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\n\n\n// FUNCTIONS //\n\n/**\n* Creates a filled \"generic\" array from an iterator.\n*\n* @private\n* @param {Iterator} it - iterator\n* @param {*} value - fill value\n* @returns {Array} filled array\n*/\nfunction filledIterator( it, value ) {\n\tvar arr;\n\tvar v;\n\n\tarr = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tarr.push( value );\n\t}\n\treturn arr;\n}\n\n/**\n* Fills an array exposing accessors for getting and setting array elements.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {*} value - fill value\n* @returns {Collection} input array\n*/\nfunction filledAccessors( arr, value ) {\n\tvar i;\n\tfor ( i = 0; i < arr.length; i++ ) {\n\t\tarr.set( value, i );\n\t}\n\treturn arr;\n}\n\n\n// MAIN //\n\n/**\n* Creates a filled array.\n*\n* @param {*} [value] - fill value\n* @param {(NonNegativeInteger|TypedArray|ArrayLikeObject|ArrayBuffer|Iterable)} [arg] - a length, typed array, array-like object, buffer, or iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} must provide a recognized data type\n* @throws {TypeError} must provide a length, typed array, array-like object, buffer, or iterable\n* @throws {Error} creating a generic array from an `ArrayBuffer` is not supported\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = filledarray();\n* // returns <Float64Array>\n*\n* @example\n* var arr = filledarray( 1.0, 2 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var arr = filledarray( 1.0, 2, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*\n* @example\n* var arr = filledarray( 1.0, 2, 'generic' );\n* // returns [ 1.0, 1.0 ]\n*\n* @example\n* var arr = filledarray( 1.0, [ 0.5, 0.5 ] );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var arr = filledarray( 1, [ 5, -3 ], 'int32' );\n* // returns <Int32Array>[ 1, 1 ]\n*\n* @example\n* var arr1 = filledarray( 2, [ 5, 3 ], 'int32' );\n* var arr2 = filledarray( 1.0, arr1 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var arr1 = filledarray( 2, [ 5, 3 ], 'int32' );\n* var arr2 = filledarray( 1, arr1, 'uint32' );\n* // returns <Uint32Array>[ 1, 1 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarray( 1.0, buf );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarray( 1.0, buf, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0, 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarray( 1.0, buf, 8 );\n* // returns <Float64Array>[ 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarray( 1.0, buf, 8, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = filledarray( 1.0, buf, 8, 2 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = filledarray( 1, buf, 8, 2, 'int32' );\n* // returns <Int32Array>[ 1, 1 ]\n*/\nfunction filledarray() {\n\tvar value;\n\tvar nargs;\n\tvar dtype;\n\tvar ctor;\n\tvar arr;\n\tvar len;\n\tvar arg;\n\n\tnargs = arguments.length;\n\tnargs -= 1;\n\tif ( nargs >= 0 && isString( arguments[ nargs ] ) ) {\n\t\tdtype = arguments[ nargs ];\n\t\tnargs -= 1;\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tif ( dtype === 'generic' ) {\n\t\tif ( nargs <= 0 ) {\n\t\t\treturn [];\n\t\t}\n\t\tvalue = arguments[ 0 ];\n\t\targ = arguments[ 1 ];\n\t\tif ( nargs === 1 ) {\n\t\t\tif ( isNonNegativeInteger( arg ) ) {\n\t\t\t\tlen = arg;\n\t\t\t} else if ( isCollection( arg ) ) {\n\t\t\t\tlen = arg.length;\n\t\t\t}\n\t\t\tif ( len !== void 0 ) {\n\t\t\t\treturn filled( value, len );\n\t\t\t}\n\t\t\tif ( isArrayBuffer( arg ) ) {\n\t\t\t\tthrow new Error( 'invalid arguments. Creating a generic array from an ArrayBuffer is not supported.' );\n\t\t\t}\n\t\t\tif ( isObject( arg ) ) {\n\t\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, typed array, or array-like object. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\tif ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\targ = arg[ ITERATOR_SYMBOL ]();\n\t\t\t\tif ( !isFunction( arg.next ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\treturn filledIterator( arg, value );\n\t\t\t}\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t} else if ( isArrayBuffer( arg ) ) {\n\t\t\tthrow new Error( 'invalid arguments. Creating a generic array from an ArrayBuffer is not supported.' );\n\t\t}\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t}\n\tif ( nargs <= 0 ) {\n\t\treturn new ctor( 0 );\n\t}\n\tif ( nargs === 1 ) { // length || array-like || ArrayBuffer || iterable\n\t\targ = arguments[ 1 ];\n\t\tif ( isCollection( arg ) ) {\n\t\t\tarr = new ctor( arg.length );\n\t\t} else if ( isArrayBuffer( arg ) ) {\n\t\t\tarr = new ctor( arg );\n\t\t} else if ( isNonNegativeInteger( arg ) ) {\n\t\t\tarr = new ctor( arg );\n\t\t} else if ( isObject( arg ) ) {\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, typed array, or array-like object. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tif ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\targ = arg[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( arg.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tarr = new ctor( iterLength( arg ) );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t}\n\t} else if ( nargs === 2 ) {\n\t\tarr = new ctor( arguments[1], arguments[2] ); // (ArrayBuffer, byteOffset)\n\t} else {\n\t\tarr = new ctor( arguments[1], arguments[2], arguments[3] ); // (ArrayBuffer, byteOffset, length)\n\t}\n\tif ( arr.length > 0 ) {\n\t\tif ( /^complex/.test( dtype ) ) {\n\t\t\tfilledAccessors( arr, arguments[ 0 ] );\n\t\t} else {\n\t\t\tgfill( arr.length, arguments[ 0 ], arr, 1 );\n\t\t}\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = filledarray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled array.\n*\n* @module @stdlib/array/filled\n*\n* @example\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var arr = filledarray();\n* // returns <Float64Array>\n*\n* @example\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var arr = filledarray( 1.0, 2 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var arr = filledarray( 1.0, 2, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*\n* @example\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var arr = filledarray( 1.0, 2, 'generic' );\n* // returns [ 1.0, 1.0 ]\n*\n* @example\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var arr = filledarray( 1.0, [ 0.5, 0.5 ] );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var arr = filledarray( 1, [ 5, -3 ], 'int32' );\n* // returns <Int32Array>[ 1, 1 ]\n*\n* @example\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var arr1 = filledarray( 10, [ 5, 3 ], 'int32' );\n* var arr2 = filledarray( 1.0, arr1 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var arr1 = filledarray( 1, [ 5, 3 ], 'int32' );\n* var arr2 = filledarray( 2, arr1, 'uint32' );\n* // returns <Uint32Array>[ 2, 2 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarray( 1.0, buf );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarray( 1.0, buf, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0, 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarray( 1.0, buf, 8 );\n* // returns <Float64Array>[ 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarray( 1.0, buf, 8, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = filledarray( 1.0, buf, 8, 2 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarray = require( '@stdlib/array/filled' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = filledarray( 1, buf, 8, 2, 'int32' );\n* // returns <Int32Array>[ 1, 1 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isArrayBuffer = require( '@stdlib/assert/is-arraybuffer' );\nvar isObject = require( '@stdlib/assert/is-object' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar ctors = require( './../../ctors' );\nvar gfillBy = require( '@stdlib/blas/ext/base/gfill-by' );\nvar filledArray = require( './../../base/filled-by' );\nvar hasIteratorSymbolSupport = require( '@stdlib/assert/has-iterator-symbol-support' );\nvar ITERATOR_SYMBOL = require( '@stdlib/symbol/iterator' );\nvar iterLength = require( '@stdlib/iter/length' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\n\n\n// FUNCTIONS //\n\n/**\n* Creates a filled \"generic\" array from an iterator.\n*\n* @private\n* @param {Iterable} it - iterator\n* @param {Callback} clbk - callback function\n* @param {*} thisArg - callback function execution context\n* @returns {Array} filled array\n*/\nfunction filledArrayIterator( it, clbk, thisArg ) {\n\tvar arr;\n\tvar i;\n\tvar v;\n\n\tarr = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tarr.push( clbk.call( thisArg, i ) );\n\t}\n\treturn arr;\n}\n\n/**\n* Fills an array exposing accessors for getting and setting array elements.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {Callback} clbk - callback function\n* @param {*} thisArg - callback function execution context\n* @returns {Collection} input array\n*/\nfunction filledAccessors( arr, clbk, thisArg ) {\n\tvar i;\n\tfor ( i = 0; i < arr.length; i++ ) {\n\t\tarr.set( clbk.call( thisArg, i ), i );\n\t}\n\treturn arr;\n}\n\n\n// MAIN //\n\n/**\n* Creates a filled array according to a provided callback function.\n*\n* @param {(NonNegativeInteger|TypedArray|ArrayLikeObject|ArrayBuffer|Iterable)} [arg] - a length, typed array, array-like object, buffer, or iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @param {string} [dtype=\"float64\"] - data type\n* @param {Callback} [clbk] - callback to invoke\n* @param {*} [thisArg] - callback execution context\n* @throws {TypeError} must provide a recognized data type\n* @throws {TypeError} must provide a length, typed array, array-like object, buffer, or iterable\n* @throws {TypeError} callback argument must be a function.\n* @throws {Error} creating a generic array from an `ArrayBuffer` is not supported\n* @returns {(TypedArray|Array)} array or typed array\n*\n* @example\n* var arr = filledarrayBy();\n* // returns <Float64Array>\n*\n* @example\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var arr = filledarrayBy( 2, clbk );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var arr = filledarrayBy( 2, 'float32', clbk );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*\n* @example\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var arr = filledarrayBy( 2, 'generic', clbk );\n* // returns [ 1.0, 1.0 ]\n*\n* @example\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var arr = filledarrayBy( [ 0.5, 0.5 ], clbk );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* function clbk() {\n*     return 1;\n* }\n*\n* var arr = filledarrayBy( [ 5, -3 ], 'int32', clbk );\n* // returns <Int32Array>[ 1, 1 ]\n*\n* @example\n* function clbk1() {\n*     return 10;\n* }\n*\n* function clbk2() {\n*     return 1.0;\n* }\n*\n* var arr1 = filledarrayBy( [ 5, 3 ], 'int32', clbk1 );\n* var arr2 = filledarrayBy( arr1, clbk2 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* function clbk1() {\n*     return 1.0;\n* }\n*\n* function clbk2() {\n*     return 2;\n* }\n*\n* var arr1 = filledarrayBy( [ 5, 3 ], 'int32', clbk1 );\n* var arr2 = filledarrayBy( arr1, 'uint32', clbk2 );\n* // returns <Uint32Array>[ 2, 2 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarrayBy( buf, clbk );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarrayBy( buf, 'float32', clbk );\n* // returns <Float32Array>[ 1.0, 1.0, 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarrayBy( buf, 8, clbk );\n* // returns <Float64Array>[ 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarrayBy( buf, 8, 'float32', clbk );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = filledarrayBy( buf, 8, 2, clbk );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* function clbk() {\n*     return 1;\n* }\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = filledarrayBy( buf, 8, 2, 'int32', clbk );\n* // returns <Int32Array>[ 1, 1 ]\n*/\nfunction filledarrayBy() {\n\tvar thisArg;\n\tvar nargs;\n\tvar dtype;\n\tvar clbk;\n\tvar ctor;\n\tvar arr;\n\tvar len;\n\tvar arg;\n\n\tnargs = arguments.length;\n\n\t// If we weren't provided any arguments, return an empty array...\n\tif ( nargs === 0 ) {\n\t\tctor = ctors( DEFAULT_DTYPE );\n\t\treturn new ctor( 0 );\n\t}\n\t// Check if we were provided a dtype as the first argument...\n\tdtype = arguments[ 0 ];\n\tif ( isString( dtype ) ) {\n\t\t// Invoking this function with arguments `f( dtype, clbk[, thisArg] )` is not allowed (otherwise, we'd need to also allow `f( clbk[, thisArg] )`)...\n\t\tif ( nargs > 1 ) {\n\t\t\tthrow new TypeError( 'invalid arguments. Must provide a length, typed array, array-like object, or an iterable.' );\n\t\t}\n\t\tctor = ctors( dtype );\n\t\tif ( ctor === null ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t\t}\n\t\t// Return an empty array having the specified dtype:\n\t\treturn new ctor( 0 );\n\t}\n\t// For all other supported invocations, we need at least two arguments...\n\tif ( nargs < 2 ) {\n\t\tthrow new TypeError( 'invalid arguments. Must provide a length, typed array, array-like object, or an iterable.' );\n\t}\n\t// At this point, we need to do some argument juggling...\n\tnargs -= 1; // henceforth, the number of available arguments is `nargs+1`\n\n\t// Determine whether the last argument is a callback or \"this\" context...\n\tif ( isFunction( arguments[ nargs ] ) ) {\n\t\t// If the last argument is a function, we need to check the next-to-last argument, and, if the next-to-last argument is a function, assume that the next-to-last argument is the callback and the last argument is a \"this\" context...\n\t\tif ( isFunction( arguments[ nargs-1 ] ) ) {\n\t\t\tthisArg = arguments[ nargs ];\n\t\t\tnargs -= 1;\n\t\t\tclbk = arguments[ nargs ];\n\n\t\t\t// Check if we were provided only a callback and a \"this\" context..\n\t\t\tif ( nargs === 0 ) {\n\t\t\t\tthrow new TypeError( 'invalid arguments. Must provide a length, typed array, array-like object, or an iterable.' );\n\t\t\t}\n\t\t} else {\n\t\t\t// \"this\" context is left undefined...\n\t\t\tclbk = arguments[ nargs ];\n\t\t}\n\t}\n\t// If we were provided 3 or more arguments and the last argument was not a function, assume that we were provided a callback and a \"this\" context...\n\telse if ( nargs >= 2 ) {\n\t\tthisArg = arguments[ nargs ];\n\t\tnargs -= 1;\n\t\tclbk = arguments[ nargs ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t}\n\t// If were were only provided 2 arguments and the last argument was not a function, we've been provided an insufficient number of arguments...\n\telse {\n\t\tthrow new TypeError( 'invalid arguments. Must provide a length, typed array, array-like object, or an iterable.' );\n\t}\n\t// Now that we've processed the callback arguments, let's continue working backward to see if we've been provided a `dtype` argument...\n\tnargs -= 1;\n\tif ( nargs >= 0 && isString( arguments[ nargs ] ) ) {\n\t\tdtype = arguments[ nargs ];\n\t\tnargs -= 1;\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\t// At this point, we've resolved the output array data type, and now we can actually create the output array...\n\tif ( dtype === 'generic' ) {\n\t\targ = arguments[ 0 ];\n\t\tif ( nargs === 0 ) {\n\t\t\tif ( isNonNegativeInteger( arg ) ) {\n\t\t\t\tlen = arg;\n\t\t\t} else if ( isCollection( arg ) ) {\n\t\t\t\tlen = arg.length;\n\t\t\t}\n\t\t\tif ( len !== void 0 ) {\n\t\t\t\treturn filledArray( len, clbk, thisArg );\n\t\t\t}\n\t\t\tif ( isArrayBuffer( arg ) ) {\n\t\t\t\tthrow new Error( 'invalid arguments. Creating a generic array from an ArrayBuffer is not supported.' );\n\t\t\t}\n\t\t\tif ( isObject( arg ) ) {\n\t\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, typed array, or array-like object. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\tif ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\targ = arg[ ITERATOR_SYMBOL ]();\n\t\t\t\tif ( !isFunction( arg.next ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t\t}\n\t\t\t\treturn filledArrayIterator( arg, clbk, thisArg );\n\t\t\t}\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t} else if ( isArrayBuffer( arg ) ) {\n\t\t\tthrow new Error( 'invalid arguments. Creating a generic array from an ArrayBuffer is not supported.' );\n\t\t}\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t}\n\tif ( nargs === 0 ) { // length || array-like || ArrayBuffer || iterable\n\t\targ = arguments[ 0 ];\n\t\tif ( isCollection( arg ) ) {\n\t\t\tarr = new ctor( arg.length );\n\t\t} else if ( isArrayBuffer( arg ) ) {\n\t\t\tarr = new ctor( arg );\n\t\t} else if ( isNonNegativeInteger( arg ) ) {\n\t\t\tarr = new ctor( arg );\n\t\t} else if ( isObject( arg ) ) {\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, typed array, or array-like object. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tif ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\targ = arg[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( arg.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t\t}\n\t\t\tarr = new ctor( iterLength( arg ) );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );\n\t\t}\n\t} else if ( nargs === 1 ) {\n\t\tarr = new ctor( arguments[0], arguments[1] ); // (ArrayBuffer, byteOffset)\n\t} else {\n\t\tarr = new ctor( arguments[0], arguments[1], arguments[2] ); // (ArrayBuffer, byteOffset, length)\n\t}\n\tif ( arr.length > 0 ) {\n\t\tif ( /^complex/.test( dtype ) ) {\n\t\t\tfilledAccessors( arr, clbk, thisArg );\n\t\t} else {\n\t\t\tgfillBy( arr.length, arr, 1, callback );\n\t\t}\n\t}\n\treturn arr;\n\n\t/**\n\t* Callback which wraps a provided callback and is invoked for each array element.\n\t*\n\t* @private\n\t* @param {*} value - element value\n\t* @param {NonNegativeInteger} aidx - array index\n\t* @param {NonNegativeInteger} sidx - strided index\n\t* @param {Collection} array - input array/collection\n\t* @returns {*} callback return value\n\t*/\n\tfunction callback( value, aidx ) {\n\t\treturn clbk.call( thisArg, aidx );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = filledarrayBy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled array according to a provided callback function.\n*\n* @module @stdlib/array/filled-by\n*\n* @example\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* var arr = filledarrayBy();\n* // returns <Float64Array>\n*\n* @example\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var arr = filledarrayBy( 2, clbk );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var arr = filledarrayBy( 2, 'float32', clbk );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*\n* @example\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var arr = filledarrayBy( 2, 'generic', clbk );\n* // returns [ 1.0, 1.0 ]\n*\n* @example\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var arr = filledarrayBy( [ 0.5, 0.5 ], clbk );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1;\n* }\n*\n* var arr = filledarrayBy( [ 5, -3 ], 'int32', clbk );\n* // returns <Int32Array>[ 1, 1 ]\n*\n* @example\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk1() {\n*     return 10;\n* }\n*\n* function clbk2() {\n*     return 1.0;\n* }\n*\n* var arr1 = filledarrayBy( [ 5, 3 ], 'int32', clbk1 );\n* var arr2 = filledarrayBy( arr1, clbk2 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk1() {\n*     return 1.0;\n* }\n*\n* function clbk2() {\n*     return 2;\n* }\n*\n* var arr1 = filledarrayBy( [ 5, 3 ], 'int32', clbk1 );\n* var arr2 = filledarrayBy( arr1, 'uint32', clbk2 );\n* // returns <Uint32Array>[ 2, 2 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarrayBy( buf, clbk );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarrayBy( buf, 'float32', clbk );\n* // returns <Float32Array>[ 1.0, 1.0, 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarrayBy( buf, 8, clbk );\n* // returns <Float64Array>[ 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = filledarrayBy( buf, 8, 'float32', clbk );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1.0;\n* }\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = filledarrayBy( buf, 8, 2, clbk );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var filledarrayBy = require( '@stdlib/array/filled-by' );\n*\n* function clbk() {\n*     return 1;\n* }\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = filledarrayBy( buf, 8, 2, 'int32', clbk );\n* // returns <Int32Array>[ 1, 1 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isIteratorLike = require( '@stdlib/assert/is-iterator-like' );\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar accessorSetter = require( './../../base/accessor-setter' );\nvar setter = require( './../../base/setter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Creates (or fills) an array from an iterator.\n*\n* @param {Iterator} iterator - source iterator\n* @param {Collection} [out] - output array\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} iterator argument must be an iterator\n* @throws {TypeError} callback argument must be a function\n* @returns {Collection} output array\n*\n* @example\n* var randu = require( '@stdlib/random/iter/randu' );\n*\n* var iter = randu({\n*     'iter': 10\n* });\n*\n* var arr = iterator2array( iter );\n* // returns <Array>\n*/\nfunction iterator2array() {\n\tvar iterator;\n\tvar thisArg;\n\tvar fcn;\n\tvar out;\n\tvar len;\n\tvar set;\n\tvar dt;\n\tvar i;\n\tvar v;\n\n\titerator = arguments[ 0 ];\n\tif ( arguments.length > 1 ) {\n\t\tif ( isCollection( arguments[ 1 ] ) ) {\n\t\t\tout = arguments[ 1 ];\n\t\t\tif ( arguments.length > 2 ) {\n\t\t\t\tfcn = arguments[ 2 ];\n\t\t\t\tif ( !isFunction( fcn ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback argument must be a function. Value: `%s`.', fcn ) );\n\t\t\t\t}\n\t\t\t\tthisArg = arguments[ 3 ];\n\t\t\t}\n\t\t} else {\n\t\t\tfcn = arguments[ 1 ];\n\t\t\tif ( !isFunction( fcn ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback argument must be a function. Value: `%s`.', fcn ) );\n\t\t\t}\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( !isIteratorLike( iterator ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Iterator argument must be an iterator protocol-compliant object. Value: `%s`.', iterator ) );\n\t}\n\ti = -1;\n\tif ( out === void 0 ) {\n\t\tout = [];\n\t\tif ( fcn ) {\n\t\t\twhile ( true ) {\n\t\t\t\ti += 1;\n\t\t\t\tv = iterator.next();\n\t\t\t\tif ( v.done ) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tout.push( fcn.call( thisArg, v.value, i ) );\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\twhile ( true ) {\n\t\t\tv = iterator.next();\n\t\t\tif ( v.done ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tout.push( v.value );\n\t\t}\n\t\treturn out;\n\t}\n\tlen = out.length;\n\tdt = dtype( out );\n\tif ( isAccessorArray( out ) ) {\n\t\tset = accessorSetter( dt );\n\t} else {\n\t\tset = setter( dt );\n\t}\n\tif ( fcn ) {\n\t\twhile ( i < len-1 ) {\n\t\t\ti += 1;\n\t\t\tv = iterator.next();\n\t\t\tif ( v.done ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tset( out, i, fcn.call( thisArg, v.value, i ) );\n\t\t}\n\t\treturn out;\n\t}\n\twhile ( i < len-1 ) {\n\t\ti += 1;\n\t\tv = iterator.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tset( out, i, v.value );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = iterator2array;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create (or fill) an array from an iterator.\n*\n* @module @stdlib/array/from-iterator\n*\n* @example\n* var randu = require( '@stdlib/random/iter/randu' );\n* var iterator2array = require( '@stdlib/array/from-iterator' );\n*\n* var iter = randu({\n*     'iter': 10\n* });\n*\n* var arr = iterator2array( iter );\n* // returns <Array>\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar ctors = require( './../../ctors' );\nvar afill = require( './../../base/filled' );\nvar gfill = require( '@stdlib/blas/ext/base/gfill' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\n\n\n// MAIN //\n\n/**\n* Creates a filled array having a specified length.\n*\n* @param {NonNegativeInteger} length - array length\n* @param {*} value - fill value\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} third argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = full( 2, 1.0 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var arr = full( 2, 1.0, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*/\nfunction full( length, value ) {\n\tvar dtype;\n\tvar ctor;\n\tvar out;\n\tif ( !isNonNegativeInteger( length ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a nonnegative integer. Value: `%s`.', length ) );\n\t}\n\tif ( arguments.length > 2 ) {\n\t\tdtype = arguments[ 2 ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tif ( dtype === 'generic' ) {\n\t\treturn afill( value, length );\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tout = new ctor( length );\n\n\t// TODO: revisit the following, as using `gfill` is not the most performant, especially for large arrays. We have two options: (1) use a native add-on which delegates to an appropriate C function which performs the loop or (2) use @stdlib/blas/ext/base/(d|s|c|z)fill functions which use native add-ons. The latter option is not great, as we only get perf boosts for large arrays for a select number of dtypes. The former option is more work, as we may need to write a bespoke add-on for handling the argument signature and the various types that `value` can assume (e.g., number, complex, etc). If we had a generic strided `copy` package with an add-on, we could wrap the value as a single element strided array with a stride of `0` and copy from `x` to `y`, and thus would not need to write a bespoke add-on. Note, however, that calling into a native add-on is not free. For shorter arrays, we'll likely observe a perf hit in Node.js. For now, we focus on just getting something working...\n\tgfill( length, value, out, 1 );\n\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = full;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled array having a specified length.\n*\n* @module @stdlib/array/full\n*\n* @example\n* var full = require( '@stdlib/array/full' );\n*\n* var arr = full( 2, 1.0 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var full = require( '@stdlib/array/full' );\n*\n* var arr = full( 2, 1.0, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar format = require( '@stdlib/string/format' );\nvar dtype = require( './../../dtype' );\nvar full = require( './../../full' );\nvar Complex128 = require( '@stdlib/complex/float64' );\nvar Complex64 = require( '@stdlib/complex/float32' );\n\n\n// MAIN //\n\n/**\n* Creates a filled array having the same length and data type as a provided input array.\n*\n* @param {(Array|TypedArray|ComplexArray)} x - input array\n* @param {number} value - fill value\n* @param {string} [dtype] - data type\n* @throws {TypeError} first argument must be an array or typed array\n* @throws {TypeError} third argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = fullLike( [ 0.0, 0.0 ], 1.0 );\n* // returns [ 1.0, 1.0 ]\n*\n* @example\n* var arr = fullLike( [ 0.0, 0.0 ], 1.0, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*/\nfunction fullLike( x, value ) {\n\tvar dt;\n\tvar v;\n\n\tdt = dtype( x ); // delegate input argument validation to dtype resolution\n\tif ( dt === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.', x ) );\n\t}\n\tif ( arguments.length > 2 ) {\n\t\tdt = arguments[ 2 ];\n\t}\n\tif ( typeof value === 'number' ) {\n\t\tif ( dt === 'complex128' ) {\n\t\t\tv = new Complex128( value, 0.0 );\n\t\t} else if ( dt === 'complex64' ) {\n\t\t\tv = new Complex64( value, 0.0 );\n\t\t} else {\n\t\t\tv = value;\n\t\t}\n\t} else {\n\t\tv = value;\n\t}\n\treturn full( x.length, v, dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = fullLike;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a filled array having the same length and data type as a provided input array.\n*\n* @module @stdlib/array/full-like\n*\n* @example\n* var fullLike = require( '@stdlib/array/full-like' );\n*\n* var arr = fullLike( [ 0.0, 0.0 ], 1.0 );\n* // returns [ 1.0, 1.0 ]\n*\n* @example\n* var fullLike = require( '@stdlib/array/full-like' );\n*\n* var arr = fullLike( [ 0.0, 0.0 ], 1.0, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ceil = require( '@stdlib/math/base/special/ceil' );\nvar isNumber = require( '@stdlib/assert/is-number' ).isPrimitive;\nvar isnan = require( '@stdlib/math/base/assert/is-nan' );\nvar format = require( '@stdlib/string/format' );\nvar MAX_LENGTH = require( '@stdlib/constants/uint32/max' );\nvar gen = require( './../../base/incrspace' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array using a provided increment.\n*\n* @param {number} x1 - first array value\n* @param {number} x2 - array element bound\n* @param {number} [increment=1] - increment\n* @throws {TypeError} first argument must be numeric\n* @throws {TypeError} second argument must be numeric\n* @throws {TypeError} third argument must be numeric\n* @throws {RangeError} length of created array must be less than `4294967295` (`2**32 - 1`)\n* @returns {Array} linearly spaced numeric array\n*\n* @example\n* var arr = incrspace( 0, 11, 2 );\n* // returns [ 0, 2, 4, 6, 8, 10 ]\n*/\nfunction incrspace( x1, x2, increment ) {\n\tvar len;\n\tvar inc;\n\tif ( !isNumber( x1 ) || isnan( x1 ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Start must be numeric. Value: `%s`.', x1 ) );\n\t}\n\tif ( !isNumber( x2 ) || isnan( x2 ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Stop must be numeric. Value: `%s`.', x2 ) );\n\t}\n\tif ( arguments.length < 3 ) {\n\t\tinc = 1;\n\t} else {\n\t\tinc = increment;\n\t\tif ( !isNumber( inc ) || isnan( inc ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Increment must be numeric. Value: `%s`.', inc ) );\n\t\t}\n\t}\n\tlen = ceil( ( x2-x1 ) / inc );\n\tif ( len > MAX_LENGTH ) {\n\t\tthrow new RangeError( 'invalid arguments. Generated array exceeds maximum array length.' );\n\t}\n\treturn gen( x1, x2, inc );\n}\n\n\n// EXPORTS //\n\nmodule.exports = incrspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array using a provided increment.\n*\n* @module @stdlib/array/incrspace\n*\n* @example\n* var incrspace = require( '@stdlib/array/incrspace' );\n*\n* var arr = incrspace( 0, 11, 2 );\n* // returns [ 0, 2, 4, 6, 8, 10 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( './../../float64' );\nvar Float32Array = require( './../../float32' );\nvar Complex128Array = require( './../../complex128' );\nvar Complex64Array = require( './../../complex64' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'float64': Float64Array,\n\t'float32': Float32Array,\n\t'complex128': Complex128Array,\n\t'complex64': Complex64Array\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns a floating-point typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Floating-point typed array constructors.\n*\n* @module @stdlib/array/typed-float-ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/typed-float-ctors' );\n*\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* ctor = ctors( 'int' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced array over a specified interval.\n*\n* @private\n* @param {number} start - start of interval\n* @param {number} stop - end of interval\n* @param {NonNegativeInteger} len - length of output array\n* @param {boolean} endpoint - boolean indicating whether to include `stop` in the output array\n* @returns {Array} linearly spaced array\n*\n* @example\n* var arr = linspace( 0, 100, 6, true );\n* // returns [ 0, 20, 40, 60, 80, 100 ]\n*\n* @example\n* var arr = linspace( 0, 100, 5, false );\n* // returns [ 0, 20, 40, 60, 80 ]\n*/\nfunction linspace( start, stop, len, endpoint ) {\n\tvar arr;\n\tvar N;\n\tvar d;\n\tvar i;\n\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\t// Set the first value:\n\tif ( len === 1 ) {\n\t\tif ( endpoint ) {\n\t\t\treturn [ stop ];\n\t\t}\n\t\treturn [ start ];\n\t}\n\tarr = [ start ];\n\n\t// Calculate the increment:\n\tif ( endpoint ) {\n\t\tN = len - 1;\n\t} else {\n\t\tN = len;\n\t}\n\td = ( stop-start ) / N;\n\n\t// Generate linearly spaced values:\n\tfor ( i = 1; i < N; i++ ) {\n\t\tarr.push( start + (d*i) );\n\t}\n\t// Check whether to include the `stop` value in the output array:\n\tif ( endpoint ) {\n\t\tarr.push( stop );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Complex64 = require( '@stdlib/complex/float32' );\nvar Complex128 = require( '@stdlib/complex/float64' );\nvar real = require( '@stdlib/complex/real' );\nvar imag = require( '@stdlib/complex/imag' );\nvar realf = require( '@stdlib/complex/realf' );\nvar imagf = require( '@stdlib/complex/imagf' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced complex number array over a specified interval.\n*\n* @private\n* @param {string} dt1 - start value data type\n* @param {(number|ComplexLike)} start - start of interval\n* @param {string} dt2 - stop value data type\n* @param {(number|ComplexLike)} stop - end of interval\n* @param {NonNegativeInteger} len - length of output array\n* @param {boolean} endpoint - boolean indicating whether to include `stop` in the output array\n* @returns {Array} linearly spaced array\n*/\nfunction linspace( dt1, start, dt2, stop, len, endpoint ) {\n\tvar cmplx;\n\tvar isf32;\n\tvar arr;\n\tvar re1;\n\tvar re2;\n\tvar im1;\n\tvar im2;\n\tvar re;\n\tvar im;\n\tvar dr;\n\tvar di;\n\tvar N;\n\tvar i;\n\n\tif ( len === 0 ) {\n\t\treturn [];\n\t}\n\tisf32 = 0;\n\tif ( dt1 === 'float64' ) {\n\t\tre1 = start;\n\t\tim1 = 0.0;\n\t} else if ( dt1 === 'complex64' ) {\n\t\tisf32 += 1;\n\t\tre1 = realf( start );\n\t\tim1 = imagf( start );\n\t} else {\n\t\tre1 = real( start );\n\t\tim1 = imag( start );\n\t}\n\tif ( dt2 === 'float64' ) {\n\t\tre2 = stop;\n\t\tim2 = 0.0;\n\t} else if ( dt2 === 'complex64' ) {\n\t\tisf32 += 1;\n\t\tre2 = realf( stop );\n\t\tim2 = imagf( stop );\n\t} else {\n\t\tre2 = real( stop );\n\t\tim2 = imag( stop );\n\t}\n\t// Determine which complex number constructor to use according to type promotion rules:\n\tif ( isf32 === 2 ) {\n\t\tcmplx = Complex64;\n\t} else {\n\t\tcmplx = Complex128;\n\t}\n\t// Set the first value:\n\tif ( len === 1 ) {\n\t\tif ( endpoint ) {\n\t\t\treturn [ new cmplx( re2, im2 ) ];\n\t\t}\n\t\treturn [ new cmplx( re1, im1 ) ];\n\t}\n\tarr = [ new cmplx( re1, im1 ) ];\n\n\t// Calculate the increments:\n\tif ( endpoint ) {\n\t\tN = len - 1;\n\t} else {\n\t\tN = len;\n\t}\n\tdr = ( re2-re1 ) / N;\n\tdi = ( im2-im1 ) / N;\n\n\t// Generate linearly spaced values:\n\tfor ( i = 1; i < N; i++ ) {\n\t\tre = re1 + (dr*i);\n\t\tim = im1 + (di*i);\n\t\tarr.push( new cmplx( re, im ) );\n\t}\n\t// Check whether to include the `stop` value in the output array:\n\tif ( endpoint ) {\n\t\tarr.push( new cmplx( re2, im2 ) );\n\t}\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced sequence over a specified interval and assigns the results to a provided output array.\n*\n* @private\n* @param {TypedArray} out - output array\n* @param {number} start - start of interval\n* @param {number} stop - end of interval\n* @param {NonNegativeInteger} len - length of output array\n* @param {boolean} endpoint - boolean indicating whether to include `stop` in the output array\n* @returns {TypedArray} linearly spaced array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var out = new Float64Array( 6 );\n* var arr = linspace( out, 0, 100, out.length, true );\n* // returns <Float64Array>[ 0.0, 20.0, 40.0, 60.0, 80.0, 100.0 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var out = new Float64Array( 5 );\n* var arr = linspace( out, 0, 100, out.length, false );\n* // returns <Float64Array>[ 0.0, 20.0, 40.0, 60.0, 80.0 ]\n*/\nfunction linspace( out, start, stop, len, endpoint ) {\n\tvar N;\n\tvar d;\n\tvar i;\n\n\tif ( len === 0 ) {\n\t\treturn out;\n\t}\n\t// Set the first value:\n\tif ( len === 1 ) {\n\t\tif ( endpoint ) {\n\t\t\tout[ 0 ] = stop;\n\t\t} else {\n\t\t\tout[ 0 ] = start;\n\t\t}\n\t\treturn out;\n\t}\n\tout[ 0 ] = start;\n\n\t// Calculate the increment:\n\tif ( endpoint ) {\n\t\tN = len - 1;\n\t} else {\n\t\tN = len;\n\t}\n\td = ( stop-start ) / N;\n\n\t// Generate linearly spaced values:\n\tfor ( i = 1; i < N; i++ ) {\n\t\tout[ i ] = start + (d*i);\n\t}\n\t// Check whether to include the `stop` value in the output array:\n\tif ( endpoint ) {\n\t\tout[ N ] = stop;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar real = require( '@stdlib/complex/real' );\nvar imag = require( '@stdlib/complex/imag' );\nvar realf = require( '@stdlib/complex/realf' );\nvar imagf = require( '@stdlib/complex/imagf' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced complex number sequence over a specified interval and assigns the results to a provided output array strided view.\n*\n* @private\n* @param {(Float32Array|Float64Array)} out - output array strided view\n* @param {string} dt1 - start value data type\n* @param {(number|ComplexLike)} start - start of interval\n* @param {string} dt2 - stop value data type\n* @param {(number|ComplexLike)} stop - end of interval\n* @param {NonNegativeInteger} len - length of output array\n* @param {boolean} endpoint - boolean indicating whether to include `stop` in the output array\n* @returns {(Float32Array|Float64Array)} complex number array view\n*/\nfunction linspace( out, dt1, start, dt2, stop, len, endpoint ) {\n\tvar re1;\n\tvar re2;\n\tvar im1;\n\tvar im2;\n\tvar dr;\n\tvar di;\n\tvar N;\n\tvar i;\n\tvar j;\n\n\tif ( len === 0 ) {\n\t\treturn out;\n\t}\n\tif ( dt1 === 'float64' ) {\n\t\tre1 = start;\n\t\tim1 = 0.0;\n\t} else if ( dt1 === 'complex64' ) {\n\t\tre1 = realf( start );\n\t\tim1 = imagf( start );\n\t} else {\n\t\tre1 = real( start );\n\t\tim1 = imag( start );\n\t}\n\tif ( dt2 === 'float64' ) {\n\t\tre2 = stop;\n\t\tim2 = 0.0;\n\t} else if ( dt2 === 'complex64' ) {\n\t\tre2 = realf( stop );\n\t\tim2 = imagf( stop );\n\t} else {\n\t\tre2 = real( stop );\n\t\tim2 = imag( stop );\n\t}\n\t// Set the first value:\n\tif ( len === 1 ) {\n\t\tif ( endpoint ) {\n\t\t\tout[ 0 ] = re2;\n\t\t\tout[ 1 ] = im2;\n\t\t} else {\n\t\t\tout[ 0 ] = re1;\n\t\t\tout[ 1 ] = im1;\n\t\t}\n\t\treturn out;\n\t}\n\tout[ 0 ] = re1;\n\tout[ 1 ] = im1;\n\n\t// Calculate the increments:\n\tif ( endpoint ) {\n\t\tN = len - 1;\n\t} else {\n\t\tN = len;\n\t}\n\tdr = ( re2-re1 ) / N;\n\tdi = ( im2-im1 ) / N;\n\n\t// Generate linearly spaced complex numbers:\n\tj = 2;\n\tfor ( i = 1; i < N; i++ ) {\n\t\tout[ j ] = re1 + (dr*i);\n\t\tout[ j+1 ] = im1 + (di*i);\n\t\tj += 2;\n\t}\n\t// Check whether to include the `stop` value in the output array:\n\tif ( endpoint ) {\n\t\tout[ j ] = re2;\n\t\tout[ j+1 ] = im2;\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isObject = require( '@stdlib/assert/is-plain-object' );\nvar hasOwnProp = require( '@stdlib/assert/has-own-property' );\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar isBoolean = require( '@stdlib/assert/is-boolean' ).isPrimitive;\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination object\n* @param {Options} options - function options\n* @param {string} [options.dtype] - output array data type\n* @param {boolean} [options.endpoint] - boolean indicating whether the `stop` value in the output array\n* @returns {(Error|null)} null or an error object\n*\n* @example\n* var opts = {};\n* var options = {\n*     'endpoint': true\n* };\n* var err = validate( opts, options );\n* if ( err ) {\n*     throw err;\n* }\n*/\nfunction validate( opts, options ) {\n\tif ( !isObject( options ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tif ( hasOwnProp( options, 'dtype' ) ) {\n\t\topts.dtype = options.dtype;\n\t\tif ( !isString( opts.dtype ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'dtype', opts.dtype ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'endpoint' ) ) {\n\t\topts.endpoint = options.endpoint;\n\t\tif ( !isBoolean( opts.endpoint ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'endpoint', opts.endpoint ) );\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\n", "{\n    \"endpoint\": true\n}\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar isNumber = require( '@stdlib/assert/is-number' ).isPrimitive;\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar isnan = require( '@stdlib/math/base/assert/is-nan' );\nvar dtype = require( '@stdlib/complex/dtype' );\nvar ctors = require( './../../typed-float-ctors' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar DEFAULTS = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\nvar genreal = require( './generic_real.js' );\nvar gencmplx = require( './generic_complex.js' );\nvar typedreal = require( './typed_real.js' );\nvar typedcmplx = require( './typed_complex.js' );\nvar validate = require( './validate.js' );\nvar defaults = require( './defaults.json' );\n\n\n// VARIABLES //\n\nvar DEFAULT_COMPLEX_DTYPE = DEFAULTS.get( 'dtypes.complex_floating_point' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced array over a specified interval.\n*\n* @param {(number|ComplexLike)} start - start of interval\n* @param {(number|ComplexLike)} stop - end of interval\n* @param {NonNegativeInteger} len - length of output array\n* @param {Options} [options] - options\n* @param {string} [options.dtype] - output array data type\n* @param {boolean} [options.endpoint=true] - boolean indicating whether to include the `stop` value in the output array\n* @throws {TypeError} first argument must be either a real or complex number\n* @throws {TypeError} second argument must be either a real or complex number\n* @throws {TypeError} third argument must be a nonnegative integer\n* @throws {TypeError} last argument must be an object\n* @throws {TypeError} must provide valid options\n* @throws {TypeError} the output array data type must be a complex number data type or \"generic\" when either `start` or `stop` is a complex number\n* @throws {TypeError} the output array data type must be a real or complex floating-point number data type or \"generic\"\n* @returns {(Array|TypedArray|ComplexArray)} linearly spaced array\n*\n* @example\n* var arr = linspace( 0, 100, 6, {\n*     'dtype': 'generic'\n* });\n* // returns [ 0, 20, 40, 60, 80, 100 ]\n*/\nfunction linspace( start, stop, len ) {\n\tvar opts;\n\tvar ctor;\n\tvar err;\n\tvar out;\n\tvar dt1;\n\tvar dt2;\n\tvar flg;\n\n\tif ( typeof start === 'object' ) {\n\t\tdt1 = dtype( start );\n\t\tif ( dt1 === null ) {\n\t\t\tif ( !isComplexLike( start ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be either a real or complex number. Value: `%s`.', start ) );\n\t\t\t}\n\t\t\tdt1 = 'complex128';\n\t\t}\n\t\tflg = true;\n\t} else if ( !isNumber( start ) || isnan( start ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either a real or complex number. Value: `%s`.', start ) );\n\t} else {\n\t\tdt1 = 'float64';\n\t}\n\tif ( typeof stop === 'object' ) {\n\t\tdt2 = dtype( stop );\n\t\tif ( dt2 === null ) {\n\t\t\tif ( !isComplexLike( stop ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either a real or complex number. Value: `%s`.', stop ) );\n\t\t\t}\n\t\t\tdt2 = 'complex128';\n\t\t}\n\t\tflg = true;\n\t} else if ( !isNumber( stop ) || isnan( stop ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either a real or complex number. Value: `%s`.', stop ) );\n\t} else {\n\t\tdt2 = 'float64';\n\t}\n\tif ( !isNonNegativeInteger( len ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be a nonnegative integer. Value: `%s`.', len ) );\n\t}\n\topts = {\n\t\t'endpoint': defaults.endpoint\n\t};\n\tif ( dt1 === dt2 ) {\n\t\topts.dtype = dt1; // one of 'float64' || 'complex64' || 'complex128'\n\t} else {\n\t\t// If dtypes are different, then at least one is a complex number. According to type promotion rules, for all possible dtype permutations, the default output data type should be 'complex128'...\n\t\topts.dtype = DEFAULT_COMPLEX_DTYPE;\n\t}\n\tif ( arguments.length > 3 ) {\n\t\terr = validate( opts, arguments[ 3 ] );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tif ( opts.dtype === 'generic' ) {\n\t\tif ( flg ) {\n\t\t\treturn gencmplx( dt1, start, dt2, stop, len, opts.endpoint );\n\t\t}\n\t\treturn genreal( start, stop, len, opts.endpoint );\n\t}\n\tctor = ctors( opts.dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a real or complex floating-point data type or \"generic\". Option: `%s`.', 'dtype', opts.dtype ) );\n\t}\n\tout = new ctor( len );\n\tif ( opts.dtype === 'complex64' ) {\n\t\ttypedcmplx( reinterpret64( out, 0 ), dt1, start, dt2, stop, len, opts.endpoint ); // eslint-disable-line max-len\n\t\treturn out;\n\t}\n\tif ( opts.dtype === 'complex128' ) {\n\t\ttypedcmplx( reinterpret128( out, 0 ), dt1, start, dt2, stop, len, opts.endpoint ); // eslint-disable-line max-len\n\t\treturn out;\n\t}\n\tif ( flg ) {\n\t\tthrow new TypeError( 'invalid arguments. If either of the first two arguments are complex numbers, the output array data type must be a complex number data type or \"generic\".' );\n\t}\n\treturn typedreal( out, start, stop, len, opts.endpoint );\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Complex64 = require( '@stdlib/complex/float32' );\nvar Complex128 = require( '@stdlib/complex/float64' );\nvar real = require( '@stdlib/complex/real' );\nvar imag = require( '@stdlib/complex/imag' );\nvar realf = require( '@stdlib/complex/realf' );\nvar imagf = require( '@stdlib/complex/imagf' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced complex number sequence over a specified interval and assigns results to a provided output array.\n*\n* @private\n* @param {Object} out - output array object\n* @param {ArrayLikeObject} out.data - output array data\n* @param {Array<Function>} out.accessors - array element accessors\n* @param {string} dt1 - start value data type\n* @param {ComplexLike} start - start of interval\n* @param {string} dt2 - stop value data type\n* @param {ComplexLike} stop - end of interval\n* @param {NonNegativeInteger} len - length of output array\n* @param {boolean} endpoint - boolean indicating whether to include `stop` in the output array\n* @returns {Object} output array object\n*/\nfunction linspace( out, dt1, start, dt2, stop, len, endpoint ) {\n\tvar cmplx;\n\tvar isf32;\n\tvar re1;\n\tvar re2;\n\tvar im1;\n\tvar im2;\n\tvar set;\n\tvar buf;\n\tvar re;\n\tvar im;\n\tvar dr;\n\tvar di;\n\tvar N;\n\tvar i;\n\n\tif ( len === 0 ) {\n\t\treturn out;\n\t}\n\tisf32 = 0;\n\tif ( dt1 === 'float64' ) {\n\t\tre1 = start;\n\t\tim1 = 0.0;\n\t} else if ( dt1 === 'complex64' ) {\n\t\tisf32 += 1;\n\t\tre1 = realf( start );\n\t\tim1 = imagf( start );\n\t} else {\n\t\tre1 = real( start );\n\t\tim1 = imag( start );\n\t}\n\tif ( dt2 === 'float64' ) {\n\t\tre2 = stop;\n\t\tim2 = 0.0;\n\t} else if ( dt2 === 'complex64' ) {\n\t\tisf32 += 1;\n\t\tre2 = realf( stop );\n\t\tim2 = imagf( stop );\n\t} else {\n\t\tre2 = real( stop );\n\t\tim2 = imag( stop );\n\t}\n\t// Determine which complex number constructor to use according to type promotion rules:\n\tif ( isf32 === 2 ) {\n\t\tcmplx = Complex64;\n\t} else {\n\t\tcmplx = Complex128;\n\t}\n\t// Cache array object references:\n\tbuf = out.data;\n\tset = out.accessors[ 1 ];\n\n\t// Set the first value:\n\tif ( len === 1 ) {\n\t\tif ( endpoint ) {\n\t\t\tset( buf, 0, new cmplx( re2, im2 ) );\n\t\t} else {\n\t\t\tset( buf, 0, new cmplx( re1, im1 ) );\n\t\t}\n\t\treturn out;\n\t}\n\tset( buf, 0, new cmplx( re1, im1 ) );\n\n\t// Calculate the increments:\n\tif ( endpoint ) {\n\t\tN = len - 1;\n\t} else {\n\t\tN = len;\n\t}\n\tdr = ( re2-re1 ) / N;\n\tdi = ( im2-im1 ) / N;\n\n\t// Generate the linearly spaced values:\n\tfor ( i = 1; i < N; i++ ) {\n\t\tre = re1 + (dr*i);\n\t\tim = im1 + (di*i);\n\t\tset( buf, i, new cmplx( re, im ) );\n\t}\n\t// Check whether to include the `stop` value in the output array:\n\tif ( endpoint ) {\n\t\tset( buf, N, new cmplx( re2, im2 ) );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Generates a linearly spaced sequence over a specified interval and assigns results to a provided output array.\n*\n* @private\n* @param {Object} out - output array object\n* @param {ArrayLikeObject} out.data - output array data\n* @param {Array<Function>} out.accessors - array element accessors\n* @param {number} start - start of interval\n* @param {number} stop - end of interval\n* @param {NonNegativeInteger} len - length of output array\n* @param {boolean} endpoint - boolean indicating whether to include `stop` in the output array\n* @returns {Object} output array object\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function set( buf, i, v ) {\n*     buf[ i ] = v * 2.0;\n* }\n*\n* var out = new Float64Array( 6 );\n* var obj = {\n*     'data': out,\n*     'accessors': [ null, set ]\n* };\n* linspace( obj, 0, 100, out.length, true );\n*\n* var arr = obj.data;\n* // returns <Float64Array>[ 0.0, 40.0, 80.0, 120.0, 160.0, 200.0 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* function set( buf, i, v ) {\n*     buf[ i ] = v * 2.0;\n* }\n*\n* var out = new Float64Array( 5 );\n* var obj = {\n*     'data': out,\n*     'accessors': [ null, set ]\n* };\n* linspace( obj, 0, 100, out.length, false );\n*\n* var arr = obj.data;\n* // returns <Float64Array>[ 0.0, 40.0, 80.0, 120.0, 160.0 ]\n*/\nfunction linspace( out, start, stop, len, endpoint ) {\n\tvar buf;\n\tvar set;\n\tvar N;\n\tvar d;\n\tvar i;\n\n\tif ( len === 0 ) {\n\t\treturn out;\n\t}\n\t// Cache array object references:\n\tbuf = out.data;\n\tset = out.accessors[ 1 ];\n\n\t// Set the first value:\n\tif ( len === 1 ) {\n\t\tif ( endpoint ) {\n\t\t\tset( buf, 0, stop );\n\t\t} else {\n\t\t\tset( buf, 0, start );\n\t\t}\n\t\treturn out;\n\t}\n\tset( buf, 0, start );\n\n\t// Calculate the increment:\n\tif ( endpoint ) {\n\t\tN = len - 1;\n\t} else {\n\t\tN = len;\n\t}\n\td = ( stop-start ) / N;\n\n\t// Generate linearly spaced values:\n\tfor ( i = 1; i < N; i++ ) {\n\t\tset( buf, i, start + (d*i) );\n\t}\n\t// Check whether to include the `stop` value in the output array:\n\tif ( endpoint ) {\n\t\tset( buf, N, stop );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar isNumber = require( '@stdlib/assert/is-number' ).isPrimitive;\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar format = require( '@stdlib/string/format' );\nvar isnan = require( '@stdlib/math/base/assert/is-nan' );\nvar dtype = require( '@stdlib/complex/dtype' );\nvar adtype = require( './../../dtype' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar arraylike2object = require( './../../base/arraylike2object' );\nvar acccmplx = require( './accessors_complex.js' );\nvar accreal = require( './accessors_real.js' );\nvar typedcmplx = require( './typed_complex.js' );\nvar typedreal = require( './typed_real.js' );\nvar validate = require( './validate.js' );\nvar defaults = require( './defaults.json' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced sequence over a specified interval and assigns the results to a provided output array.\n*\n* @param {(number|ComplexLike)} start - start of interval\n* @param {(number|ComplexLike)} stop - end of interval\n* @param {Collection} out - output array\n* @param {Options} [options] - options\n* @param {boolean} [options.endpoint=true] - boolean indicating whether to include the `stop` value in the output array\n* @throws {TypeError} first argument must be either a real or complex number\n* @throws {TypeError} second argument must be either a real or complex number\n* @throws {TypeError} third argument must be an array-like object\n* @throws {TypeError} last argument must be an object\n* @throws {TypeError} must provide valid options\n* @throws {TypeError} the output array data type must be a complex number data type or \"generic\" when either `start` or `stop` is a complex number\n* @returns {Collection} output array\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var out = new Float64Array( 6 );\n* var arr = linspace( 0, 100, out );\n* // returns <Float64Array>[ 0.0, 20.0, 40.0, 60.0, 80.0, 100.0 ]\n*/\nfunction linspace( start, stop, out ) {\n\tvar opts;\n\tvar err;\n\tvar dt1;\n\tvar dt2;\n\tvar flg;\n\tvar odt;\n\tvar o;\n\n\tif ( typeof start === 'object' ) {\n\t\tdt1 = dtype( start );\n\t\tif ( dt1 === null ) {\n\t\t\tif ( !isComplexLike( start ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be either a real or complex number. Value: `%s`.', start ) );\n\t\t\t}\n\t\t\tdt1 = 'complex128';\n\t\t}\n\t\tflg = true;\n\t} else if ( !isNumber( start ) || isnan( start ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either a real or complex number. Value: `%s`.', start ) );\n\t} else {\n\t\tdt1 = 'float64';\n\t}\n\tif ( typeof stop === 'object' ) {\n\t\tdt2 = dtype( stop );\n\t\tif ( dt2 === null ) {\n\t\t\tif ( !isComplexLike( stop ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either a real or complex number. Value: `%s`.', stop ) );\n\t\t\t}\n\t\t\tdt2 = 'complex128';\n\t\t}\n\t\tflg = true;\n\t} else if ( !isNumber( stop ) || isnan( stop ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either a real or complex number. Value: `%s`.', stop ) );\n\t} else {\n\t\tdt2 = 'float64';\n\t}\n\tif ( !isCollection( out ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an array-like object. Value: `%s`.', out ) );\n\t}\n\topts = {\n\t\t'endpoint': defaults.endpoint\n\t};\n\tif ( arguments.length > 3 ) {\n\t\terr = validate( opts, arguments[ 3 ] );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\todt = adtype( out );\n\tif ( odt === null ) {\n\t\todt = 'generic';\n\t}\n\tif ( odt === 'complex64' ) {\n\t\ttypedcmplx( reinterpret64( out, 0 ), dt1, start, dt2, stop, out.length, opts.endpoint ); // eslint-disable-line max-len\n\t\treturn out;\n\t}\n\tif ( odt === 'complex128' ) {\n\t\ttypedcmplx( reinterpret128( out, 0 ), dt1, start, dt2, stop, out.length, opts.endpoint ); // eslint-disable-line max-len\n\t\treturn out;\n\t}\n\tif ( flg ) {\n\t\tif ( odt === 'generic' ) {\n\t\t\to = arraylike2object( out );\n\t\t\tacccmplx( o, dt1, start, dt2, stop, out.length, opts.endpoint );\n\t\t\treturn out;\n\t\t}\n\t\tthrow new TypeError( 'invalid arguments. If either of the first two arguments are complex numbers, the output array must be a complex number array or a \"generic\" array-like object.' );\n\t}\n\to = arraylike2object( out );\n\tif ( o.accessorProtocol ) {\n\t\taccreal( o, start, stop, out.length, opts.endpoint );\n\t\treturn out;\n\t}\n\ttypedreal( out, start, stop, out.length, opts.endpoint );\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = linspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced array.\n*\n* @module @stdlib/array/linspace\n*\n* @example\n* var linspace = require( '@stdlib/array/linspace' );\n*\n* var arr = linspace( 0, 100, 6 );\n* // returns <Float64Array>[ 0.0, 20.0, 40.0, 60.0, 80.0, 100.0 ]\n*\n* @example\n* var linspace = require( '@stdlib/array/linspace' );\n*\n* var arr = linspace( 0, 100, 5, {\n*     'endpoint': false\n* });\n* // returns <Float64Array>[ 0.0, 20.0, 40.0, 60.0, 80.0 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var linspace = require( '@stdlib/array/linspace' );\n*\n* var arr = new Float64Array( 6 );\n* var out = linspace.assign( 0, 100, out );\n* // returns <Float64Array>[ 0.0, 20.0, 40.0, 60.0, 80.0, 100.0 ]\n*\n* var bool = ( arr === out );\n* // returns true\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var linspace = require( '@stdlib/array/linspace' );\n*\n* var arr = new Float64Array( 5 );\n* var out = linspace.assign( 0, 100, out, {\n*     'endpoint': false\n* });\n* // returns <Float64Array>[ 0.0, 20.0, 40.0, 60.0, 80.0 ]\n*\n* var bool = ( arr === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert/is-number' ).isPrimitive;\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar format = require( '@stdlib/string/format' );\nvar isnan = require( '@stdlib/math/base/assert/is-nan' );\nvar gen = require( './../../base/logspace' );\n\n\n// MAIN //\n\n/**\n* Generates a logarithmically spaced numeric array.\n*\n* @param {number} a - exponent of start value\n* @param {number} b - exponent of end value\n* @param {NonNegativeInteger} [len=10] - length of output array\n* @throws {TypeError} first argument must be numeric\n* @throws {TypeError} second argument must be numeric\n* @throws {TypeError} third argument must be a nonnegative integer\n* @returns {Array} logarithmically spaced numeric array\n*\n* @example\n* var arr = logspace( 0, 2, 6 );\n* // returns [ 1, ~2.5, ~6.31, ~15.85, ~39.81, 100 ]\n*/\nfunction logspace( a, b, len ) {\n\tif ( !isNumber( a ) || isnan( a ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Exponent of start value must be numeric. Value: `%s`.', a ) );\n\t}\n\tif ( !isNumber( b ) || isnan( b ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Exponent of stop value must be numeric. Value: `%s`.', b ) );\n\t}\n\tif ( arguments.length < 3 ) {\n\t\tlen = 10;\n\t} else if ( !isNonNegativeInteger( len ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t}\n\treturn gen( a, b, len );\n}\n\n\n// EXPORTS //\n\nmodule.exports = logspace;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a logarithmically spaced numeric array.\n*\n* @module @stdlib/array/logspace\n*\n* @example\n* var logspace = require( '@stdlib/array/logspace' );\n*\n* var arr = logspace( 0, 2, 6 );\n* // returns [ 1, ~2.5, ~6.31, ~15.85, ~39.81, 100 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInteger = require( '@stdlib/math/base/assert/is-integer' );\nvar isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' );\nvar isComplexLike = require( '@stdlib/assert/is-complex-like' );\nvar PINF = require( '@stdlib/constants/float64/pinf' );\nvar NINF = require( '@stdlib/constants/float64/ninf' );\nvar FLOAT32_SMALLEST_SUBNORMAL = require( '@stdlib/constants/float32/smallest-subnormal' ); // eslint-disable-line id-length\nvar FLOAT32_MAX_SAFE_INTEGER = require( '@stdlib/constants/float32/max-safe-integer' );\nvar FLOAT32_MIN_SAFE_INTEGER = require( '@stdlib/constants/float32/min-safe-integer' );\nvar INT8_MIN = require( '@stdlib/constants/int8/min' );\nvar INT16_MIN = require( '@stdlib/constants/int16/min' );\nvar INT32_MIN = require( '@stdlib/constants/int32/min' );\nvar UINT8_MAX = require( '@stdlib/constants/uint8/max' );\nvar UINT16_MAX = require( '@stdlib/constants/uint16/max' );\nvar UINT32_MAX = require( '@stdlib/constants/uint32/max' );\n\n\n// FUNCTIONS //\n\n/**\n* Returns the minimum floating-point array data type of the closest \"kind\" necessary for storing a provided scalar.\n*\n* @private\n* @param {number} value - real value\n* @returns {string} array data type\n*/\nfunction minFloatDataType( value ) {\n\tif ( value !== value || value === PINF || value === NINF ) {\n\t\treturn 'float32';\n\t}\n\tif ( isInteger( value ) ) {\n\t\tif ( value >= FLOAT32_MIN_SAFE_INTEGER && value <= FLOAT32_MAX_SAFE_INTEGER ) { // eslint-disable-line max-len\n\t\t\treturn 'float32';\n\t\t}\n\t\treturn 'float64';\n\t}\n\t// Assume that if we are provided a tiny value, we don't want to underflow to zero by storing as `float32`...\n\tif (\n\t\tvalue > -FLOAT32_SMALLEST_SUBNORMAL &&\n\t\tvalue < FLOAT32_SMALLEST_SUBNORMAL\n\t) {\n\t\treturn 'float64';\n\t}\n\t// Any number which reaches this point is less than the maximum single-precision floating-point number, as floating-point format supports a limited number of decimals (e.g., (1.0+EPS)*10**15 => 1000000000000000.2, which is less than ~3.4e38)...\n\treturn 'float32';\n}\n\n\n// MAIN //\n\n/**\n* Returns the minimum array data type of the closest \"kind\" necessary for storing a provided scalar value.\n*\n* @param {*} value - scalar value\n* @returns {string} array data type\n*\n* @example\n* var dt = minDataType( 3.141592653589793 );\n* // returns 'float32'\n*\n* @example\n* var dt = minDataType( 3 );\n* // returns 'uint8'\n*/\nfunction minDataType( value ) {\n\tif ( typeof value !== 'number' ) {\n\t\tif ( isComplexLike( value ) ) {\n\t\t\tif ( minFloatDataType( value.re ) === 'float64' || minFloatDataType( value.im ) === 'float64' ) {\n\t\t\t\treturn 'complex128';\n\t\t\t}\n\t\t\treturn 'complex64';\n\t\t}\n\t\treturn 'generic';\n\t}\n\tif ( value !== value || value === PINF || value === NINF ) {\n\t\treturn 'float32';\n\t}\n\tif ( isInteger( value ) ) {\n\t\tif ( value === 0 && isNegativeZero( value ) ) {\n\t\t\treturn 'float32';\n\t\t}\n\t\tif ( value < 0 ) {\n\t\t\tif ( value >= INT8_MIN ) {\n\t\t\t\treturn 'int8';\n\t\t\t}\n\t\t\tif ( value >= INT16_MIN ) {\n\t\t\t\treturn 'int16';\n\t\t\t}\n\t\t\tif ( value >= INT32_MIN ) {\n\t\t\t\treturn 'int32';\n\t\t\t}\n\t\t\treturn 'float64';\n\t\t}\n\t\tif ( value <= UINT8_MAX ) {\n\t\t\treturn 'uint8';\n\t\t}\n\t\tif ( value <= UINT16_MAX ) {\n\t\t\treturn 'uint16';\n\t\t}\n\t\tif ( value <= UINT32_MAX ) {\n\t\t\treturn 'uint32';\n\t\t}\n\t\treturn 'float64';\n\t}\n\t// Assume that if we are provided a tiny value, we don't want to underflow to zero by storing as `float32`...\n\tif (\n\t\tvalue > -FLOAT32_SMALLEST_SUBNORMAL &&\n\t\tvalue < FLOAT32_SMALLEST_SUBNORMAL\n\t) {\n\t\treturn 'float64';\n\t}\n\t// Any number which reaches this point is less than the maximum single-precision floating-point number, as floating-point format supports a limited number of decimals (e.g., (1.0+EPS)*10**15 => 1000000000000000.2, which is less than ~3.4e38)...\n\treturn 'float32';\n}\n\n\n// EXPORTS //\n\nmodule.exports = minDataType;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine the minimum array data type of the closest \"kind\" necessary for storing a provided scalar value.\n*\n* @module @stdlib/array/min-dtype\n*\n* @example\n* var minDataType = require( '@stdlib/array/min-dtype' );\n*\n* var dt = minDataType( 3.141592653589793 );\n* // returns 'float32'\n*\n* dt = minDataType( 3 );\n* // returns 'uint8'\n*/\n\n// MODULES //\n\nvar minDataType = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = minDataType;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar contains = require( './../../base/assert/contains' ).factory;\nvar Complex128 = require( '@stdlib/complex/float64' );\nvar Complex64 = require( '@stdlib/complex/float32' );\nvar full = require( './../../full' );\nvar defaults = require( './../../defaults' );\nvar dtypes = require( './../../dtypes' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar Z128 = new Complex128( NaN, NaN );\nvar Z64 = new Complex64( NaN, NaN );\nvar DTYPES = dtypes( 'floating_point_and_generic' );\nvar isValidDType = contains( DTYPES );\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.real_floating_point' );\n\n\n// MAIN //\n\n/**\n* Creates an array filled with NaNs and having a specified length.\n*\n* @param {NonNegativeInteger} length - array length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} second argument must be a supported data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = nans( 2 );\n* // returns <Float64Array>[ NaN, NaN ]\n*\n* @example\n* var arr = nans( 2, 'float32' );\n* // returns <Float32Array>[ NaN, NaN ]\n*/\nfunction nans( length ) {\n\tvar dtype;\n\tvar value;\n\n\tif ( arguments.length > 1 ) {\n\t\tdtype = arguments[ 1 ];\n\t\tif ( !isValidDType( dtype ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be one of the following: \"%s\". Value: `%s`.', DTYPES.join( '\", \"' ), dtype ) );\n\t\t}\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tif ( dtype === 'complex128' ) {\n\t\tvalue = Z128;\n\t} else if ( dtype === 'complex64' ) {\n\t\tvalue = Z64;\n\t} else {\n\t\tvalue = NaN;\n\t}\n\treturn full( length, value, dtype );\n}\n\n\n// EXPORTS //\n\nmodule.exports = nans;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an array filled with NaNs and having a specified length.\n*\n* @module @stdlib/array/nans\n*\n* @example\n* var nans = require( '@stdlib/array/nans' );\n*\n* var arr = nans( 2 );\n* // returns <Float64Array>[ NaN, NaN ]\n*\n* @example\n* var nans = require( '@stdlib/array/nans' );\n*\n* var arr = nans( 2, 'float32' );\n* // returns <Float32Array>[ NaN, NaN ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar dtype = require( './../../dtype' );\nvar full = require( './../../full' );\nvar Complex128 = require( '@stdlib/complex/float64' );\nvar Complex64 = require( '@stdlib/complex/float32' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar Z128 = new Complex128( NaN, NaN );\nvar Z64 = new Complex64( NaN, NaN );\nvar DTYPES = [ 'float64', 'float32', 'complex128', 'complex64', 'generic' ];\n\n\n// MAIN //\n\n/**\n* Creates an array filled with NaNs and having the same length and data type as a provided input array.\n*\n* @param {(Array|TypedArray|ComplexArray)} x - input array\n* @param {string} [dtype] - data type\n* @throws {TypeError} first argument must be an array or typed array\n* @throws {TypeError} second argument must be a supported data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = nansLike( [ 0.0, 0.0 ] );\n* // returns [ NaN, NaN ]\n*\n* @example\n* var arr = nansLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ NaN, NaN ]\n*/\nfunction nansLike( x ) {\n\tvar dt;\n\tvar v;\n\n\tdt = dtype( x ); // delegate input argument validation to dtype resolution\n\tif ( dt === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.', x ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdt = arguments[ 1 ];\n\t\tif ( DTYPES.indexOf( dt ) === -1 ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be one of the following: \"%s\". Value: `%s`.', DTYPES.join( '\", \"' ), dt ) );\n\t\t}\n\t} else if ( DTYPES.indexOf( dt ) === -1 ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be one of the following data types: \"%s\". Value: `%s`.', DTYPES.join( '\", \"' ), dt ) );\n\t}\n\tif ( dt === 'complex128' ) {\n\t\tv = Z128;\n\t} else if ( dt === 'complex64' ) {\n\t\tv = Z64;\n\t} else {\n\t\tv = NaN;\n\t}\n\treturn full( x.length, v, dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = nansLike;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an array filled with NaNs and having the same length and data type as a provided input array.\n*\n* @module @stdlib/array/nans-like\n*\n* @example\n* var nansLike = require( '@stdlib/array/nans-like' );\n*\n* var arr = nansLike( [ 0.0, 0.0 ] );\n* // returns [ NaN, NaN ]\n*\n* @example\n* var nansLike = require( '@stdlib/array/nans-like' );\n*\n* var arr = nansLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ NaN, NaN ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "{\n\t\"float64\": -1,\n\t\"float32\": \"float64\",\n\t\"int32\": -1,\n\t\"int16\": \"int32\",\n\t\"int8\": \"int16\",\n\t\"uint32\": -1,\n\t\"uint16\": \"uint32\",\n\t\"uint8\": \"uint16\",\n\t\"uint8c\": \"uint16\",\n\t\"generic\": -1,\n  \"complex64\": \"complex128\",\n  \"complex128\": -1\n}\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar objectKeys = require( '@stdlib/utils/keys' );\nvar hasOwnProp = require( '@stdlib/assert/has-own-property' );\nvar NEXT_DTYPES = require( './next_dtypes.json' );\n\n\n// FUNCTIONS //\n\n/**\n* Generates a table.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( NEXT_DTYPES );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tout[ dtypes[i] ] = NEXT_DTYPES[ dtypes[i] ];\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns the next larger array data type of the same kind.\n*\n* @param {string} [dtype] - array data type\n* @returns {(Object|string|integer|null)} next larger data type(s) or null\n*\n* @example\n* var dt = nextDataType( 'float32' );\n* // returns 'float64'\n*/\nfunction nextDataType( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateTable();\n\t}\n\tif ( hasOwnProp( NEXT_DTYPES, dtype ) ) {\n\t\treturn NEXT_DTYPES[ dtype ];\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = nextDataType;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the next larger array data type of the same kind.\n*\n* @module @stdlib/array/next-dtype\n*\n* @example\n* var nextDataType = require( '@stdlib/array/next-dtype' );\n*\n* var dt = nextDataType( 'float32' );\n* // returns 'float64'\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar base = require( './../../base/one-to' );\nvar zeros = require( './../../zeros' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1 starting from one.\n*\n* @param {NonNegativeInteger} n - number of elements\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = oneTo( 2 );\n* // returns <Float64Array>[ 1.0, 2.0 ]\n*\n* @example\n* var arr = oneTo( 2, 'float32' );\n* // returns <Float32Array>[ 1.0, 2.0 ]\n*/\nfunction oneTo( n ) {\n\tvar dtype;\n\tif ( !isNonNegativeInteger( n ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a nonnegative integer. Value: `%s`.', n ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdtype = arguments[ 1 ];\n\t\tif ( dtype === 'generic' ) {\n\t\t\treturn base( n );\n\t\t}\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\treturn base.assign( zeros( n, dtype ), 1, 0 ); // defer dtype validation to `zeros`\n}\n\n\n// EXPORTS //\n\nmodule.exports = oneTo;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1 starting from one.\n*\n* @module @stdlib/array/one-to\n*\n* @example\n* var oneTo = require( '@stdlib/array/one-to' );\n*\n* var arr = oneTo( 2 );\n* // returns <Float64Array>[ 1.0, 2.0 ]\n*\n* @example\n* var oneTo = require( '@stdlib/array/one-to' );\n*\n* var arr = oneTo( 2, 'float32' );\n* // returns <Float32Array>[ 1.0, 2.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar oneTo = require( './../../one-to' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1 starting from one and having the same length and data type as a provided input array.\n*\n* @param {(TypedArray|Array|ComplexArray)} x - input array\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be an array or typed array\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = oneToLike( [ 0.0, 0.0 ] );\n* // returns [ 1.0, 2.0 ]\n*\n* @example\n* var arr = oneToLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ 1.0, 2.0 ]\n*/\nfunction oneToLike( x ) {\n\tvar dt = dtype( x ); // delegate input argument validation to dtype resolution\n\tif ( dt === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.', x ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdt = arguments[ 1 ];\n\t}\n\treturn oneTo( x.length, dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = oneToLike;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1 starting from one and having the same length and data type as a provided input array.\n*\n* @module @stdlib/array/one-to-like\n*\n* @example\n* var oneToLike = require( '@stdlib/array/one-to-like' );\n*\n* var arr = oneToLike( [ 0.0, 0.0 ] );\n* // returns [ 1.0, 2.0 ]\n*\n* @example\n* var oneToLike = require( '@stdlib/array/one-to-like' );\n*\n* var arr = oneToLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ 1.0, 2.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Complex128 = require( '@stdlib/complex/float64' );\nvar Complex64 = require( '@stdlib/complex/float32' );\nvar full = require( './../../full' );\nvar defaults = require( './../../defaults' );\n\n\n// VARIABLES //\n\nvar Z128 = new Complex128( 1.0, 0.0 );\nvar Z64 = new Complex64( 1.0, 0.0 );\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\n\n\n// MAIN //\n\n/**\n* Creates an array filled with ones and having a specified length.\n*\n* @param {NonNegativeInteger} length - array length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = ones( 2 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var arr = ones( 2, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*/\nfunction ones( length ) {\n\tvar dtype;\n\tvar value;\n\n\tif ( arguments.length > 1 ) {\n\t\tdtype = arguments[ 1 ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tif ( dtype === 'complex128' ) {\n\t\tvalue = Z128;\n\t} else if ( dtype === 'complex64' ) {\n\t\tvalue = Z64;\n\t} else {\n\t\tvalue = 1;\n\t}\n\treturn full( length, value, dtype );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ones;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an array filled with ones and having a specified length.\n*\n* @module @stdlib/array/ones\n*\n* @example\n* var ones = require( '@stdlib/array/ones' );\n*\n* var arr = ones( 2 );\n* // returns <Float64Array>[ 1.0, 1.0 ]\n*\n* @example\n* var ones = require( '@stdlib/array/ones' );\n*\n* var arr = ones( 2, 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar dtype = require( './../../dtype' );\nvar full = require( './../../full' );\nvar Complex128 = require( '@stdlib/complex/float64' );\nvar Complex64 = require( '@stdlib/complex/float32' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar Z128 = new Complex128( 1.0, 0.0 );\nvar Z64 = new Complex64( 1.0, 0.0 );\n\n\n// MAIN //\n\n/**\n* Creates an array filled with ones and having the same length and data type as a provided input array.\n*\n* @param {(Array|TypedArray|ComplexArray)} x - input array\n* @param {string} [dtype] - data type\n* @throws {TypeError} first argument must be an array or typed array\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = onesLike( [ 0.0, 0.0 ] );\n* // returns [ 1.0, 1.0 ]\n*\n* @example\n* var arr = onesLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*/\nfunction onesLike( x ) {\n\tvar dt;\n\tvar v;\n\n\tdt = dtype( x ); // delegate input argument validation to dtype resolution\n\tif ( dt === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.', x ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdt = arguments[ 1 ];\n\t}\n\tif ( dt === 'complex128' ) {\n\t\tv = Z128;\n\t} else if ( dt === 'complex64' ) {\n\t\tv = Z64;\n\t} else {\n\t\tv = 1.0;\n\t}\n\treturn full( x.length, v, dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = onesLike;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an array filled with ones and having the same length and data type as a provided input array.\n*\n* @module @stdlib/array/ones-like\n*\n* @example\n* var onesLike = require( '@stdlib/array/ones-like' );\n*\n* var arr = onesLike( [ 0.0, 0.0 ] );\n* // returns [ 1.0, 1.0 ]\n*\n* @example\n* var onesLike = require( '@stdlib/array/ones-like' );\n*\n* var arr = onesLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ 1.0, 1.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns default options.\n*\n* @private\n* @returns {Object} default options\n*\n* @example\n* var o = defaults();\n* // returns {...}\n*/\nfunction defaults() {\n\treturn {\n\t\t'highWaterMark': 9007199254740992\n\t};\n}\n\n\n// EXPORTS //\n\nmodule.exports = defaults;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isObject = require( '@stdlib/assert/is-plain-object' );\nvar hasOwnProp = require( '@stdlib/assert/has-own-property' );\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination object\n* @param {Options} options - function options\n* @param {NonNegativeInteger} [options.highWaterMark] - maximum total memory which can be allocated\n* @returns {(Error|null)} null or an error object\n*\n* @example\n* var opts = {};\n* var options = {\n*     'highWaterMark': 1024\n* };\n* var err = validate( opts, options );\n* if ( err ) {\n*     throw err;\n* }\n*/\nfunction validate( opts, options ) {\n\tif ( !isObject( options ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tif ( hasOwnProp( options, 'highWaterMark' ) ) {\n\t\topts.highWaterMark = options.highWaterMark;\n\t\tif ( !isNonNegativeInteger( opts.highWaterMark ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a nonnegative integer. Option: `%s`.', 'highWaterMark', opts.highWaterMark ) );\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Initializes a cache for pooled typed array buffers.\n*\n* @private\n* @param {NonNegativeInteger} n - base-2 logarithm of the maximum typed array size\n* @returns {ArrayArray} initialized cache\n*/\nfunction pool( n ) {\n\tvar out;\n\tvar i;\n\n\tout = [];\n\tfor ( i = 0; i < n+1; i++ ) {\n\t\tout.push( [] );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = pool;\n", "{\n\t\"float64\": 8,\n\t\"float32\": 4,\n\t\"int16\": 2,\n\t\"int32\": 4,\n\t\"int8\": 1,\n\t\"uint16\": 2,\n\t\"uint32\": 4,\n\t\"uint8\": 1,\n\t\"uint8c\": 1,\n  \"complex64\": 8,\n  \"complex128\": 16\n}\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isTypedArrayLike = require( '@stdlib/assert/is-typed-array-like' );\nvar isArrayBuffer = require( '@stdlib/assert/is-arraybuffer' );\nvar isComplex64Array = require( '@stdlib/assert/is-complex64array' );\nvar isComplex128Array = require( '@stdlib/assert/is-complex128array' );\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils/define-nonenumerable-read-only-accessor' );\nvar ctors = require( './../../typed-ctors' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar accessors = require( './../../base/accessors' );\nvar adtype = require( './../../dtype' );\nvar ARRAY_DEFAULTS = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\nvar ArrayBuffer = require( './../../buffer' );\nvar ceil = require( '@stdlib/math/base/special/ceil' );\nvar floor = require( '@stdlib/math/base/special/floor' );\nvar ceil2 = require( '@stdlib/math/base/special/ceil2' );\nvar log2 = require( '@stdlib/math/base/special/log2' );\nvar min = require( '@stdlib/math/base/special/min' );\nvar defaults = require( './defaults.js' );\nvar validate = require( './validate.js' );\nvar createPool = require( './pool.js' );\nvar BYTES_PER_ELEMENT = require( './bytes_per_element.json' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = ARRAY_DEFAULTS.get( 'dtypes.default' );\nvar Complex64Array = ctors( 'complex64' );\nvar Complex128Array = ctors( 'complex128' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests whether an array is a single-precision complex floating-point number array.\n*\n* @private\n* @param {Collection} arr - input array\n* @returns {boolean} boolean indicating whether an input array is a single-precision complex floating-point number array\n*/\nfunction isCmplx64Array( arr ) {\n\treturn ( arr instanceof Complex64Array );\n}\n\n/**\n* Tests whether an array is a double-precision complex floating-point number array.\n*\n* @private\n* @param {Collection} arr - input array\n* @returns {boolean} boolean indicating whether an input array is a double-precision complex floating-point number array\n*/\nfunction isCmplx128Array( arr ) {\n\treturn ( arr instanceof Complex128Array );\n}\n\n\n// MAIN //\n\n/**\n* Creates a typed array pool.\n*\n* @param {Options} [options] - pool options\n* @param {NonNegativeInteger} [options.highWaterMark] - maximum total memory which can be allocated\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {Function} allocator\n*\n* @example\n* var typedarraypool = factory();\n*\n* // Allocate an array of doubles:\n* var arr = typedarraypool( 5, 'float64' );\n* // returns <Float64Array>[ 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* arr[ 0 ] = 3.14;\n* arr[ 1 ] = 3.14;\n*\n* // ...\n*\n* // Free the allocated memory to be used in a future allocation:\n* typedarraypool.free( arr );\n*/\nfunction factory( options ) {\n\tvar nbytes;\n\tvar pool;\n\tvar opts;\n\tvar err;\n\n\topts = defaults();\n\tif ( arguments.length ) {\n\t\terr = validate( opts, options );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tpool = createPool( ceil( log2( opts.highWaterMark ) ) );\n\tnbytes = 0;\n\n\tsetReadOnly( malloc, 'malloc', malloc ); // circular reference\n\tsetReadOnly( malloc, 'calloc', calloc );\n\tsetReadOnly( malloc, 'free', free );\n\tsetReadOnly( malloc, 'clear', clear );\n\tsetReadOnly( malloc, 'highWaterMark', opts.highWaterMark );\n\tsetReadOnlyAccessor( malloc, 'nbytes', getBytes );\n\n\treturn malloc;\n\n\t/**\n\t* Returns the number of allocated bytes.\n\t*\n\t* @private\n\t* @returns {NonNegativeInteger} number of allocated bytes\n\t*/\n\tfunction getBytes() {\n\t\treturn nbytes;\n\t}\n\n\t/**\n\t* Returns an array buffer.\n\t*\n\t* @private\n\t* @param {NonNegativeInteger} n - number of bytes\n\t* @returns {(ArrayBuffer|null)} array buffer or null\n\t*/\n\tfunction arraybuffer( n ) {\n\t\tvar buf;\n\t\tvar i;\n\n\t\t// Convert the number of bytes to an index in our pool table:\n\t\ti = log2( n );\n\n\t\t// If we already have an available array buffer, use it...\n\t\tif ( i < pool.length && pool[ i ].length ) {\n\t\t\treturn pool[ i ].pop();\n\t\t}\n\t\t// Before allocating a new array buffer, ensure that we have not exceeded the maximum number of bytes we are allowed to allocate...\n\t\tif ( nbytes+n > opts.highWaterMark ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf = new ArrayBuffer( n );\n\n\t\t// Update the running counter of allocated bytes:\n\t\tnbytes += n;\n\n\t\treturn buf;\n\t}\n\n\t/**\n\t* Returns a typed array.\n\t*\n\t* @private\n\t* @param {Function} ctor - typed array constructor\n\t* @param {NonNegativeInteger} len - view length\n\t* @param {string} dtype - data type\n\t* @returns {(TypedArray|null)} typed array or null\n\t*/\n\tfunction typedarray( ctor, len, dtype ) {\n\t\tvar buf;\n\t\tif ( len === 0 ) {\n\t\t\treturn new ctor( 0 );\n\t\t}\n\t\tbuf = arraybuffer( ceil2( len )*BYTES_PER_ELEMENT[ dtype ] );\n\t\tif ( buf === null ) {\n\t\t\treturn buf;\n\t\t}\n\t\treturn new ctor( buf, 0, len );\n\t}\n\n\t/**\n\t* Returns an uninitialized typed array.\n\t*\n\t* ## Notes\n\t*\n\t* -   Memory is **not** initialized.\n\t* -   Memory is lazily allocated.\n\t* -   If the function returns `null`, the function was unable to allocate a new typed array from the typed array pool (most likely due to insufficient memory).\n\t*\n\t* @private\n\t* @param {(NonNegativeInteger|Collection)} [arg] - an array length or an array-like object\n\t* @param {string} [dtype=\"float64\"] - data type\n\t* @throws {TypeError} must provide a valid array length or an array-like object\n\t* @throws {TypeError} must provide a recognized data type\n\t* @returns {(TypedArray|null)} typed array or null\n\t*/\n\tfunction malloc() {\n\t\tvar nargs;\n\t\tvar dtype;\n\t\tvar ctor;\n\t\tvar arr;\n\t\tvar out;\n\t\tvar set;\n\t\tvar get;\n\t\tvar len;\n\t\tvar i;\n\n\t\tnargs = arguments.length;\n\t\tif ( nargs && isString( arguments[ nargs-1 ] ) ) {\n\t\t\tnargs -= 1;\n\t\t\tdtype = arguments[ nargs ];\n\t\t} else {\n\t\t\tdtype = DEFAULT_DTYPE;\n\t\t}\n\t\tctor = ctors( dtype );\n\t\tif ( ctor === null ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t\t}\n\t\tif ( nargs <= 0 ) {\n\t\t\treturn new ctor( 0 );\n\t\t}\n\t\t// Check if provided a typed array length...\n\t\tif ( isNonNegativeInteger( arguments[ 0 ] ) ) {\n\t\t\treturn typedarray( ctor, arguments[ 0 ], dtype );\n\t\t}\n\t\t// Check if provided an array-like object containing data elements...\n\t\tif ( isCollection( arguments[ 0 ] ) ) {\n\t\t\tarr = arguments[ 0 ];\n\t\t\tlen = arr.length;\n\t\t\tif ( isComplex128Array( arr ) ) {\n\t\t\t\tarr = reinterpret128( arr, 0 );\n\t\t\t} else if ( isComplex64Array( arr ) ) {\n\t\t\t\tarr = reinterpret64( arr, 0 );\n\t\t\t} else if ( /^complex/.test( dtype ) ) {\n\t\t\t\t// Assume we've been provided an array of interleaved real and imaginary components...\n\t\t\t\tlen /= 2;\n\t\t\t}\n\t\t\tout = typedarray( ctor, len, dtype );\n\t\t\tif ( out === null ) {\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\tif ( isCmplx128Array( out ) || isCmplx64Array( out ) ) {\n\t\t\t\tout.set( arr );\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// Wrap the arrays in order to account for the possibility that `arr` is a complex number array. As we don't prohibit other \"unsafe\" casts (e.g., providing a `Float64Array` and specifying a `dtype` of `uint8`), we don't prohibit providing a complex number array and specifying a real `dtype`. The results will probably be unexpected/gibberish, but I am not sure we should be overly pedantic in ensuring users don't do ill-advised things...\n\t\t\tget = accessors( adtype( arr ) ).accessors[ 0 ];\n\t\t\tset = accessors( dtype ).accessors[ 1 ];\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tset( out, i, get( arr, i ) );\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either an array length or an array-like object. Value: `%s`.', arguments[ 0 ] ) );\n\t}\n\n\t/**\n\t* Returns a zero-initialized typed array.\n\t*\n\t* ## Notes\n\t*\n\t* -   If the function returns `null`, the function was unable to allocate a new typed array from the typed array pool (most likely due to insufficient memory).\n\t*\n\t* @private\n\t* @param {NonNegativeInteger} [len=0] - array length\n\t* @param {string} [dtype=\"float64\"] - data type\n\t* @throws {TypeError} must provide a valid array length\n\t* @throws {TypeError} must provide a recognized data type\n\t* @returns {(TypedArray|null)} typed array or null\n\t*/\n\tfunction calloc() {\n\t\tvar nargs;\n\t\tvar out;\n\t\tvar tmp;\n\t\tvar i;\n\n\t\tnargs = arguments.length;\n\t\tif ( nargs === 0 ) {\n\t\t\tout = malloc();\n\t\t} else if ( nargs === 1 ) {\n\t\t\tout = malloc( arguments[ 0 ] );\n\t\t} else {\n\t\t\tout = malloc( arguments[ 0 ], arguments[ 1 ] );\n\t\t}\n\t\tif ( out !== null ) {\n\t\t\t// Initialize the memory...\n\t\t\tif ( isCmplx128Array( out ) ) {\n\t\t\t\ttmp = reinterpret128( out, 0 );\n\t\t\t} else if ( isCmplx64Array( out ) ) {\n\t\t\t\ttmp = reinterpret64( out, 0 );\n\t\t\t} else {\n\t\t\t\ttmp = out;\n\t\t\t}\n\t\t\tfor ( i = 0; i < tmp.length; i++ ) {\n\t\t\t\ttmp[ i ] = 0.0;\n\t\t\t}\n\t\t}\n\t\treturn out;\n\t}\n\n\t/**\n\t* Frees a typed array or typed array buffer.\n\t*\n\t* ## Notes\n\t*\n\t* -   Implicitly, we support providing non-internally allocated arrays and array buffer (e.g., \"freeing\" a typed array allocated in userland); however, the freed array buffer is likely to have excess capacity when compared to other members in its pool.\n\t*\n\t* @private\n\t* @param {(TypedArray|ArrayBuffer)} buf - typed array or array buffer to free\n\t* @throws {TypeError} must provide a typed array or typed array buffer\n\t* @returns {boolean} boolean indicating whether the typed array or array buffer was successfully freed\n\t*/\n\tfunction free( buf ) {\n\t\tvar n;\n\t\tvar p;\n\t\tvar i;\n\t\tif ( isTypedArrayLike( buf ) && buf.buffer ) {\n\t\t\tbuf = buf.buffer;\n\t\t} else if ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a typed array or ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tif ( buf.byteLength > 0 ) {\n\t\t\tn = floor( log2( buf.byteLength ) );\n\n\t\t\t// Prohibit \"freeing\" array buffers which would potentially allow users to circumvent high water mark limits:\n\t\t\tn = min( pool.length-1, n );\n\n\t\t\t// Ensure that we do not attempt to free the same buffer more than once...\n\t\t\tp = pool[ n ];\n\t\t\tfor ( i = 0; i < p.length; i++ ) {\n\t\t\t\tif ( p[ i ] === buf ) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Add the buffer to our pool of free buffers:\n\t\t\tp.push( buf );\n\t\t}\n\t\treturn true;\n\t}\n\n\t/**\n\t* Clears the typed array pool allowing garbage collection of previously allocated (and currently free) array buffers.\n\t*\n\t* @private\n\t*/\n\tfunction clear() {\n\t\tvar i;\n\t\tfor ( i = 0; i < pool.length; i++ ) {\n\t\t\tpool[ i ].length = 0;\n\t\t}\n\t\tnbytes = 0;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = factory;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\n/**\n* Returns an uninitialized typed array.\n*\n* ## Notes\n*\n* -   Memory is **not** initialized.\n* -   Memory is lazily allocated.\n* -   If the function returns `null`, the function was unable to allocate a new typed array from the typed array pool (most likely due to insufficient memory).\n*\n* @name typedarraypool\n* @type {Function}\n* @param {(NonNegativeInteger|ArrayLikeObject)} [arg] - an array length or an array-like object\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} must provide a valid array length or an array-like object\n* @throws {TypeError} must provide a recognized data type\n* @returns {(TypedArray|null)} typed array or null\n*\n* @example\n* // Allocate an array of doubles:\n* var arr = typedarraypool( 5, 'float64' );\n* // e.g., returns <Float64Array>[ 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* arr[ 0 ] = 3.14;\n* arr[ 1 ] = 3.14;\n*\n* // ...\n*\n* // Free the allocated memory to be used in a future allocation:\n* typedarraypool.free( arr );\n*/\nvar typedarraypool = factory();\n\n\n// EXPORTS //\n\nmodule.exports = typedarraypool;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array pool.\n*\n* @module @stdlib/array/pool\n*\n* @example\n* var typedarraypool = require( '@stdlib/array/pool' );\n*\n* // Allocate an array of doubles:\n* var arr = typedarraypool( 5, 'float64' );\n* // returns <Float64Array>[ 0.0, 0.0, 0.0, 0.0, 0.0 ]\n*\n* arr[ 0 ] = 3.14;\n* arr[ 1 ] = 3.14;\n*\n* // ...\n*\n* // Free the allocated memory to be used in a future allocation:\n* typedarraypool.free( arr );\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "{\n\t\"float64\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float64\",\n\t\t\"int32\": \"float64\",\n\t\t\"int16\": \"float64\",\n\t\t\"int8\": \"float64\",\n\t\t\"uint32\": \"float64\",\n\t\t\"uint16\": \"float64\",\n\t\t\"uint8\": \"float64\",\n\t\t\"uint8c\": \"float64\",\n    \"complex64\": \"complex128\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n\t\"float32\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float32\",\n\t\t\"int32\": \"float64\",\n\t\t\"int16\": \"float32\",\n\t\t\"int8\": \"float32\",\n\t\t\"uint32\": \"float64\",\n\t\t\"uint16\": \"float32\",\n\t\t\"uint8\": \"float32\",\n\t\t\"uint8c\": \"float32\",\n    \"complex64\": \"complex64\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n\t\"int32\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float64\",\n\t\t\"int32\": \"int32\",\n\t\t\"int16\": \"int32\",\n\t\t\"int8\": \"int32\",\n\t\t\"uint32\": \"float64\",\n\t\t\"uint16\": \"int32\",\n\t\t\"uint8\": \"int32\",\n\t\t\"uint8c\": \"int32\",\n    \"complex64\": \"complex128\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n\t\"int16\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float32\",\n\t\t\"int32\": \"int32\",\n\t\t\"int16\": \"int16\",\n\t\t\"int8\": \"int16\",\n\t\t\"uint32\": \"float64\",\n\t\t\"uint16\": \"int32\",\n\t\t\"uint8\": \"int16\",\n\t\t\"uint8c\": \"int16\",\n    \"complex64\": \"complex64\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n\t\"int8\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float32\",\n\t\t\"int32\": \"int32\",\n\t\t\"int16\": \"int16\",\n\t\t\"int8\": \"int8\",\n\t\t\"uint32\": \"float64\",\n\t\t\"uint16\": \"int32\",\n\t\t\"uint8\": \"int16\",\n\t\t\"uint8c\": \"int16\",\n    \"complex64\": \"complex64\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n\t\"uint32\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float64\",\n\t\t\"int32\": \"float64\",\n\t\t\"int16\": \"float64\",\n\t\t\"int8\": \"float64\",\n\t\t\"uint32\": \"uint32\",\n\t\t\"uint16\": \"uint32\",\n\t\t\"uint8\": \"uint32\",\n\t\t\"uint8c\": \"uint32\",\n    \"complex64\": \"complex128\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n\t\"uint16\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float32\",\n\t\t\"int32\": \"int32\",\n\t\t\"int16\": \"int32\",\n\t\t\"int8\": \"int32\",\n\t\t\"uint32\": \"uint32\",\n\t\t\"uint16\": \"uint16\",\n\t\t\"uint8\": \"uint16\",\n\t\t\"uint8c\": \"uint16\",\n    \"complex64\": \"complex64\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n\t\"uint8\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float32\",\n\t\t\"int32\": \"int32\",\n\t\t\"int16\": \"int16\",\n\t\t\"int8\": \"int16\",\n\t\t\"uint32\": \"uint32\",\n\t\t\"uint16\": \"uint16\",\n\t\t\"uint8\": \"uint8\",\n\t\t\"uint8c\": \"uint8\",\n    \"complex64\": \"complex64\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n\t\"uint8c\": {\n\t\t\"float64\": \"float64\",\n\t\t\"float32\": \"float32\",\n\t\t\"int32\": \"int32\",\n\t\t\"int16\": \"int16\",\n\t\t\"int8\": \"int16\",\n\t\t\"uint32\": \"uint32\",\n\t\t\"uint16\": \"uint16\",\n\t\t\"uint8\": \"uint8\",\n\t\t\"uint8c\": \"uint8\",\n    \"complex64\": \"complex64\",\n    \"complex128\": \"complex128\",\n\t\t\"generic\": \"generic\"\n\t},\n  \"complex128\": {\n    \"float64\": \"complex128\",\n    \"float32\": \"complex128\",\n    \"int32\": \"complex128\",\n    \"int16\": \"complex128\",\n    \"int8\": \"complex128\",\n    \"uint32\": \"complex128\",\n    \"uint16\": \"complex128\",\n    \"uint8\": \"complex128\",\n    \"uint8c\": \"complex128\",\n    \"complex64\": \"complex128\",\n    \"complex128\": \"complex128\",\n    \"generic\": \"generic\"\n  },\n  \"complex64\": {\n    \"float64\": \"complex128\",\n    \"float32\": \"complex64\",\n    \"int32\": \"complex128\",\n    \"int16\": \"complex64\",\n    \"int8\": \"complex64\",\n    \"uint32\": \"complex128\",\n    \"uint16\": \"complex64\",\n    \"uint8\": \"complex64\",\n    \"uint8c\": \"complex64\",\n    \"complex64\": \"complex64\",\n    \"complex128\": \"complex128\",\n    \"generic\": \"generic\"\n  },\n\t\"generic\": {\n\t\t\"float64\": \"generic\",\n\t\t\"float32\": \"generic\",\n\t\t\"int32\": \"generic\",\n\t\t\"int16\": \"generic\",\n\t\t\"int8\": \"generic\",\n\t\t\"uint32\": \"generic\",\n\t\t\"uint16\": \"generic\",\n\t\t\"uint8\": \"generic\",\n\t\t\"uint8c\": \"generic\",\n    \"complex64\": \"generic\",\n    \"complex128\": \"generic\",\n\t\t\"generic\": \"generic\"\n\t}\n}\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar objectKeys = require( '@stdlib/utils/keys' );\nvar hasOwnProp = require( '@stdlib/assert/has-own-property' );\nvar PROMOTION_RULES = require( './promotion_rules.json' );\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of promotion rules.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( PROMOTION_RULES );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = PROMOTION_RULES[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns the array data type with the smallest size and closest \"kind\" to which array data types can be safely cast.\n*\n* @param {string} [dtype1] - array data type\n* @param {string} [dtype2] - array data type\n* @returns {(Object|integer|string|null)} promotion rule(s) or null\n*\n* @example\n* var table = promotionRules();\n* // returns {...}\n*\n* @example\n* var dt = promotionRules( 'float32', 'uint32' );\n* // returns 'float64'\n*\n* @example\n* var dt = promotionRules( 'float32', 'foo' );\n* // returns null\n*/\nfunction promotionRules( dtype1, dtype2 ) {\n\tvar o;\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( hasOwnProp( PROMOTION_RULES, dtype1 ) ) {\n\t\to = PROMOTION_RULES[ dtype1 ];\n\t\tif ( hasOwnProp( o, dtype2 ) ) {\n\t\t\treturn o[ dtype2 ];\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = promotionRules;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the array data type with the smallest size and closest \"kind\" to which array data types can be safely cast.\n*\n* @module @stdlib/array/promotion-rules\n*\n* @example\n* var promotionRules = require( '@stdlib/array/promotion-rules' );\n*\n* var table = promotionRules();\n* // returns {...}\n*\n* var dt = promotionRules( 'float32', 'uint32' );\n* // returns 'float64'\n*\n* dt = promotionRules( 'float32', 'foo' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( './../../float64' );\nvar Float32Array = require( './../../float32' );\nvar Int16Array = require( './../../int16' );\nvar Int32Array = require( './../../int32' );\nvar Int8Array = require( './../../int8' );\nvar Uint16Array = require( './../../uint16' );\nvar Uint32Array = require( './../../uint32' );\nvar Uint8Array = require( './../../uint8' );\nvar Uint8ClampedArray = require( './../../uint8c' );\nvar Complex64Array = require( './../../complex64' );\nvar Complex128Array = require( './../../complex128' );\n\n\n// MAIN //\n\nvar ctors = {\n\t'Float64Array': Float64Array,\n\t'Float32Array': Float32Array,\n\t'Int32Array': Int32Array,\n\t'Uint32Array': Uint32Array,\n\t'Int16Array': Int16Array,\n\t'Uint16Array': Uint16Array,\n\t'Int8Array': Int8Array,\n\t'Uint8Array': Uint8Array,\n\t'Uint8ClampedArray': Uint8ClampedArray,\n\t'Complex64Array': Complex64Array,\n\t'Complex128Array': Complex128Array\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert/is-array' );\nvar ctors = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Revives a JSON-serialized typed array.\n*\n* @param {string} key - key\n* @param {*} value - value\n* @returns {(*|TypedArray)} value or typed array\n*\n* @example\n* var parseJSON = require( '@stdlib/utils/parse-json' );\n*\n* var str = '{\"type\":\"Float64Array\",\"data\":[5,3]}';\n*\n* var arr = parseJSON( str, reviveTypedArray );\n* // returns <Float64Array>[ 5.0, 3.0 ]\n*/\nfunction reviveTypedArray( key, value ) {\n\tvar ctor;\n\tif (\n\t\tvalue &&\n\t\tvalue.type &&\n\t\tisArray( value.data )\n\t) {\n\t\tctor = ctors[ value.type ];\n\t\tif ( ctor ) {\n\t\t\treturn new ctor( value.data );\n\t\t}\n\t}\n\treturn value;\n}\n\n\n// EXPORTS //\n\nmodule.exports = reviveTypedArray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Revive a JSON-serialized typed array.\n*\n* @module @stdlib/array/reviver\n*\n* @example\n* var parseJSON = require( '@stdlib/utils/parse-json' );\n* var reviveTypedArray = require( '@stdlib/array/reviver' );\n*\n* var str = '{\"type\":\"Float64Array\",\"data\":[5,3]}';\n*\n* var arr = parseJSON( str, reviveTypedArray );\n* // returns <Float64Array>[ 5.0, 3.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "{\n\t\"float64\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 0,\n\t\t\"int32\": 0,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 0,\n\t\t\"generic\": 1\n\t},\n\t\"float32\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 0,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"int32\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 0,\n\t\t\"int32\": 1,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 0,\n\t\t\"generic\": 1\n\t},\n\t\"int16\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"int8\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 1,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"uint32\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 0,\n\t\t\"int32\": 0,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 1,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 0,\n\t\t\"generic\": 1\n\t},\n\t\"uint16\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 1,\n\t\t\"uint16\": 1,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"uint8\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 1,\n\t\t\"uint16\": 1,\n\t\t\"uint8\": 1,\n\t\t\"uint8c\": 1,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"uint8c\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 1,\n\t\t\"uint16\": 1,\n\t\t\"uint8\": 1,\n\t\t\"uint8c\": 1,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n  \"complex128\": {\n    \"float64\": 0,\n    \"float32\": 0,\n    \"int32\": 0,\n    \"int16\": 0,\n    \"int8\": 0,\n    \"uint32\": 0,\n    \"uint16\": 0,\n    \"uint8\": 0,\n    \"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 0,\n    \"generic\": 1\n  },\n  \"complex64\": {\n    \"float64\": 0,\n    \"float32\": 0,\n    \"int32\": 0,\n    \"int16\": 0,\n    \"int8\": 0,\n    \"uint32\": 0,\n    \"uint16\": 0,\n    \"uint8\": 0,\n    \"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n    \"generic\": 1\n  },\n\t\"generic\": {\n\t\t\"float64\": 0,\n\t\t\"float32\": 0,\n\t\t\"int32\": 0,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 0,\n    \"complex64\": 0,\n\t\t\"generic\": 1\n\t}\n}\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar objectKeys = require( '@stdlib/utils/keys' );\nvar hasOwnProp = require( '@stdlib/assert/has-own-property' );\nvar SAFE_CASTS = require( './safe_casts.json' );\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of safe casts for each array data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAFE_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAFE_CASTS[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n/**\n* Generates a table of safe casts for each array data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAFE_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAFE_CASTS[ dt1 ];\n\t\ttmp = [];\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\tif ( o[ dt2 ] === 1 ) {\n\t\t\t\ttmp.push( dt2 );\n\t\t\t}\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a list of array data types to which a provided array data type can be safely cast.\n*\n* @param {string} [dtype] - array data type\n* @returns {(Object|StringArray|null)} list of array data types or null\n*\n* @example\n* var list = safeCasts( 'float32' );\n* // returns [...]\n*/\nfunction safeCasts( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\t// Lazily generate table...\n\t\tTABLE = generateTable();\n\t}\n\tif ( hasOwnProp( TABLE, dtype ) ) {\n\t\treturn TABLE[ dtype ].slice();\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = safeCasts;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of array data types to which a provided array data type can be safely cast.\n*\n* @module @stdlib/array/safe-casts\n*\n* @example\n* var safeCasts = require( '@stdlib/array/safe-casts' );\n*\n* var list = safeCasts( 'float32' );\n* // returns [...]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "{\n\t\"float64\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 0,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 0,\n\t\t\"generic\": 1\n\t},\n\t\"float32\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 0,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"int32\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 0,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 1,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 0,\n\t\t\"generic\": 1\n\t},\n\t\"int16\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 1,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"int8\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 1,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"uint32\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 0,\n\t\t\"int32\": 0,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 1,\n\t\t\"uint16\": 1,\n\t\t\"uint8\": 1,\n\t\t\"uint8c\": 1,\n    \"complex128\": 1,\n    \"complex64\": 0,\n\t\t\"generic\": 1\n\t},\n\t\"uint16\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 1,\n\t\t\"uint16\": 1,\n\t\t\"uint8\": 1,\n\t\t\"uint8c\": 1,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"uint8\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 1,\n\t\t\"uint16\": 1,\n\t\t\"uint8\": 1,\n\t\t\"uint8c\": 1,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n\t\"uint8c\": {\n\t\t\"float64\": 1,\n\t\t\"float32\": 1,\n\t\t\"int32\": 1,\n\t\t\"int16\": 1,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 1,\n\t\t\"uint16\": 1,\n\t\t\"uint8\": 1,\n\t\t\"uint8c\": 1,\n    \"complex128\": 1,\n    \"complex64\": 1,\n\t\t\"generic\": 1\n\t},\n  \"complex128\": {\n    \"float64\": 0,\n    \"float32\": 0,\n    \"int32\": 0,\n    \"int16\": 0,\n    \"int8\": 0,\n    \"uint32\": 0,\n    \"uint16\": 0,\n    \"uint8\": 0,\n    \"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n    \"generic\": 0\n  },\n  \"complex64\": {\n    \"float64\": 0,\n    \"float32\": 0,\n    \"int32\": 0,\n    \"int16\": 0,\n    \"int8\": 0,\n    \"uint32\": 0,\n    \"uint16\": 0,\n    \"uint8\": 0,\n    \"uint8c\": 0,\n    \"complex128\": 1,\n    \"complex64\": 1,\n    \"generic\": 0\n  },\n\t\"generic\": {\n\t\t\"float64\": 0,\n\t\t\"float32\": 0,\n\t\t\"int32\": 0,\n\t\t\"int16\": 0,\n\t\t\"int8\": 0,\n\t\t\"uint32\": 0,\n\t\t\"uint16\": 0,\n\t\t\"uint8\": 0,\n\t\t\"uint8c\": 0,\n    \"complex128\": 0,\n    \"complex64\": 0,\n\t\t\"generic\": 1\n\t}\n}\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar objectKeys = require( '@stdlib/utils/keys' );\nvar hasOwnProp = require( '@stdlib/assert/has-own-property' );\nvar SAME_KIND_CASTS = require( './same_kind_casts.json' );\n\n\n// VARIABLES //\n\nvar TABLE;\n\n\n// FUNCTIONS //\n\n/**\n* Generates a full table of same \"kind\" casts for each array data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateFullTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAME_KIND_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAME_KIND_CASTS[ dt1 ];\n\t\ttmp = {};\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\ttmp[ dt2 ] = o[ dt2 ];\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n/**\n* Generates a table of same \"kind\" casts for each array data type.\n*\n* @private\n* @returns {Object} table\n*/\nfunction generateTable() {\n\tvar dtypes;\n\tvar ntypes;\n\tvar out;\n\tvar tmp;\n\tvar dt1;\n\tvar dt2;\n\tvar o;\n\tvar j;\n\tvar i;\n\n\tout = {};\n\tdtypes = objectKeys( SAME_KIND_CASTS );\n\tntypes = dtypes.length;\n\tfor ( i = 0; i < ntypes; i++ ) {\n\t\tdt1 = dtypes[ i ];\n\t\to = SAME_KIND_CASTS[ dt1 ];\n\t\ttmp = [];\n\t\tfor ( j = 0; j < ntypes; j++ ) {\n\t\t\tdt2 = dtypes[ j ];\n\t\t\tif ( o[ dt2 ] === 1 ) {\n\t\t\t\ttmp.push( dt2 );\n\t\t\t}\n\t\t}\n\t\tout[ dt1 ] = tmp;\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Returns a list of array data types to which a provided array data type can be safely cast or cast within the same \"kind\".\n*\n* @param {string} [dtype] - array data type\n* @returns {(Object|StringArray|null)} list of array data types or null\n*\n* @example\n* var list = sameKindCasts( 'float32' );\n* // returns [...]\n*/\nfunction sameKindCasts( dtype ) {\n\tif ( arguments.length === 0 ) {\n\t\treturn generateFullTable();\n\t}\n\tif ( TABLE === void 0 ) {\n\t\t// Lazily generate table...\n\t\tTABLE = generateTable();\n\t}\n\tif ( hasOwnProp( TABLE, dtype ) ) {\n\t\treturn TABLE[ dtype ].slice();\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = sameKindCasts;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of array data types to which a provided array data type can be safely cast or cast within the same \"kind\".\n*\n* @module @stdlib/array/same-kind-casts\n*\n* @example\n* var sameKindCasts = require( '@stdlib/array/same-kind-casts' );\n*\n* var list = sameKindCasts( 'float32' );\n* // returns [...]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert/is-array-like-object' );\nvar format = require( '@stdlib/string/format' );\n\n\n// FUNCTIONS //\n\n/**\n* Recursively (and eagerly) attempts to resolve nested array dimensions.\n*\n* @private\n* @param {Array} shape - output array\n* @param {ArrayLikeObject} arr - array\n* @returns {Array} shape array\n*/\nfunction recurse( shape, arr ) {\n\tvar v = arr[ 0 ];\n\tif ( isArrayLikeObject( v ) ) {\n\t\tshape.push( v.length );\n\t\trecurse( shape, v );\n\t}\n\treturn shape;\n}\n\n/**\n* Recursively verifies that all nested arrays have consistent dimensions.\n*\n* @private\n* @param {PositiveInteger} ndims - number of dimensions\n* @param {Array} shape - shape array\n* @param {NonNegativeInteger} d - dimension\n* @param {ArrayLikeObject} arr - array element to verify\n* @param {boolean} flg - boolean indicating whether to continue recursing\n* @returns {NonNegativeInteger} number of consistent dimensions\n*/\nfunction check( ndims, shape, d, arr, flg ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\n\t// Get the size of the current dimension:\n\tlen = shape[ d ];\n\n\t// Ensure that each array element is an array of the same size:\n\tfor ( i = 0; i < arr.length; i++ ) {\n\t\tv = arr[ i ];\n\n\t\t// If the array element is not an array or is not the same size, we have found an inconsistent dimension:\n\t\tif ( !isArrayLikeObject( v ) || v.length !== len ) {\n\t\t\t// `d` is one more than the index of the last consistent dimension and thus equal to the number of consistent dimensions:\n\t\t\treturn d;\n\t\t}\n\t\t// Recursively examine nested elements:\n\t\tif ( flg ) {\n\t\t\tv = check( ndims, shape, d+1, v, d+1 < ndims-1 );\n\t\t\tif ( v < ndims ) {\n\t\t\t\t// Propagate the number of consistent dimensions up the recursion chain...\n\t\t\t\treturn v;\n\t\t\t}\n\t\t}\n\t}\n\treturn ndims;\n}\n\n\n// MAIN //\n\n/**\n* Determines (nested) array dimensions.\n*\n* @param {ArrayLikeObject} arr - array\n* @throws {TypeError} must provide an array\n* @returns {Array} array shape\n*\n* @example\n* var arr = [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ];\n*\n* var shape = arrayShape( arr );\n* // returns [ 3, 3 ]\n*\n* @example\n* var arr = [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8 ] ];\n*\n* var shape = arrayShape( arr );\n* // returns [ 3 ]\n*\n* @example\n* var arr = [ [ 1, 2, 3 ], [ 4, 5, 6 ], null ];\n*\n* var shape = arrayShape( arr );\n* // returns [ 3 ]\n*/\nfunction arrayShape( arr ) {\n\tvar shape;\n\tvar ndims;\n\n\tif ( !isArrayLikeObject( arr ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an array-like object. Value: `%s`.', arr ) );\n\t}\n\t// Initialize the shape/dimensions array:\n\tshape = [ arr.length ];\n\n\t// Eagerly determine array dimensions:\n\trecurse( shape, arr );\n\tndims = shape.length;\n\n\t// Check that all array element dimensions are consistent:\n\tif ( ndims > 1 ) {\n\t\t// If `check()` returns a value less than `ndims`, trim off the inconsistent dimensions:\n\t\tshape.length = check( ndims, shape, 1, arr, ndims > 2 );\n\t}\n\treturn shape;\n}\n\n\n// EXPORTS //\n\nmodule.exports = arrayShape;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine (nested) array dimensions.\n*\n* @module @stdlib/array/shape\n*\n* @example\n* var arrayShape = require( '@stdlib/array/shape' );\n*\n* var arr = [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ];\n*\n* var shape = arrayShape( arr );\n* // returns [ 3, 3 ]\n*\n* @example\n* var arrayShape = require( '@stdlib/array/shape' );\n*\n* var arr = [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8 ] ];\n*\n* var shape = arrayShape( arr );\n* // returns [ 3 ]\n*\n* @example\n* var arrayShape = require( '@stdlib/array/shape' );\n*\n* var arr = [ [ 1, 2, 3 ], [ 4, 5, 6 ], null ];\n*\n* var shape = arrayShape( arr );\n* // returns [ 3 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof SharedArrayBuffer === 'function' ) ? SharedArrayBuffer : null; // eslint-disable-line stdlib/require-globals, no-undef\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Constructor returning an object used to represent a generic, fixed-length raw binary data buffer which can be used to create views of shared memory.\n*\n* @param {NonNegativeInteger} size - number of bytes\n* @throws {Error} not implemented\n*/\nfunction polyfill( size ) { // eslint-disable-line no-unused-vars\n\tthrow new Error( 'not supported. The current environment does not support SharedArrayBuffers, and, unfortunately, SharedArrayBuffers cannot be polyfilled. For shared memory applications, upgrade your runtime environment to one which supports SharedArrayBuffers.' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Constructor returning an object used to represent a generic, fixed-length raw binary data buffer which can be used to create views of shared memory.\n*\n* @module @stdlib/array/shared-buffer\n*\n* @example\n* var ctor = require( '@stdlib/array/shared-buffer' );\n*\n* var buf;\n* try {\n*     buf = new ctor( 10 );\n*     // returns <SharedArrayBuffer>\n* } catch ( err ) {\n*     console.log( 'Environment does not support SharedArrayBuffers.' );\n* }\n*/\n\n// MODULES //\n\nvar hasSharedArrayBufferSupport = require( '@stdlib/assert/has-sharedarraybuffer-support' ); // eslint-disable-line id-length\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasSharedArrayBufferSupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isInteger = require( '@stdlib/assert/is-integer' ).isPrimitive;\nvar base = require( './../../base/slice' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns a shallow copy of a portion of an array.\n*\n* @param {Collection} x - input array\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end=x.length] - ending index (exclusive)\n* @throws {TypeError} first argument must be a collection\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = slice( x, 1, 3 );\n* // returns [ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*\n* @example\n* var Int32Array = require( '@stdlib/array/int32' );\n*\n* var x = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var out = slice( x, 1, 3 );\n* // returns <Int32Array>[ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*/\nfunction slice( x ) {\n\tvar start;\n\tvar end;\n\n\tif ( !isCollection( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', x ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tstart = arguments[ 1 ];\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tend = arguments[ 2 ];\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t} else {\n\t\t\tend = x.length;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = x.length;\n\t}\n\treturn base( x, start, end );\n}\n\n\n// EXPORTS //\n\nmodule.exports = slice;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a shallow copy of a portion of an array.\n*\n* @module @stdlib/array/slice\n*\n* @example\n* var slice = require( '@stdlib/array/slice' );\n*\n* var x = [ 1, 2, 3, 4 ];\n*\n* var out = slice( x, 1, 3 );\n* // returns [ 2, 3 ]\n*\n* var bool = ( out === x );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar hasOwnProp = require( '@stdlib/assert/has-own-property' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isObject = require( '@stdlib/assert/is-plain-object' );\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar iteratorSymbol = require( '@stdlib/symbol/iterator' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar getter = require( './../../base/getter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an iterator which repeatedly iterates over each element in an array-like object.\n*\n* @param {Collection} src - input value\n* @param {Options} [options] - function options\n* @param {NonNegativeInteger} [options.iter] - number of iterations\n* @param {integer} [options.dir=1] - iteration direction\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @throws {TypeError} callback argument must be a function\n* @returns {Iterator} iterator\n*\n* @example\n* var iter = circarray2iterator( [ 1, 2, 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 1\n*\n* v = iter.next().value;\n* // returns 2\n*\n* v = iter.next().value;\n* // returns 3\n*\n* // ...\n*/\nfunction circarray2iterator( src ) {\n\tvar thisArg;\n\tvar options;\n\tvar count;\n\tvar opts;\n\tvar iter;\n\tvar FLG;\n\tvar fcn;\n\tvar get;\n\tvar dt;\n\tvar i;\n\tif ( !isCollection( src ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', src ) );\n\t}\n\topts = {\n\t\t'iter': 1e308, // ~infinity\n\t\t'dir': 1       // left to right iteration\n\t};\n\tif ( arguments.length > 1 ) {\n\t\tif ( isObject( arguments[ 1 ] ) ) {\n\t\t\toptions = arguments[ 1 ];\n\t\t\tif ( arguments.length > 2 ) {\n\t\t\t\tfcn = arguments[ 2 ];\n\t\t\t\tif ( !isFunction( fcn ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback argument must be a function. Value: `%s`.', fcn ) );\n\t\t\t\t}\n\t\t\t\tthisArg = arguments[ 3 ];\n\t\t\t}\n\t\t\tif ( hasOwnProp( options, 'iter' ) ) {\n\t\t\t\topts.iter = options.iter;\n\t\t\t\tif ( !isNonNegativeInteger( options.iter ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a nonnegative integer. Option: `%s`.', 'iter', options.iter ) );\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( hasOwnProp( options, 'dir' ) ) {\n\t\t\t\topts.dir = options.dir;\n\t\t\t\tif ( options.dir !== 1 && options.dir !== -1 ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be either `1` or `-1`. Option: `%s`.', 'dir', options.dir ) );\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfcn = arguments[ 1 ];\n\t\t\tif ( !isFunction( fcn ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either a function or an options object. Value: `%s`.', fcn ) );\n\t\t\t}\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tcount = 0;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tif ( fcn ) {\n\t\tif ( opts.dir === 1 ) {\n\t\t\ti = -1;\n\t\t\tsetReadOnly( iter, 'next', next1a );\n\t\t} else {\n\t\t\ti = src.length;\n\t\t\tsetReadOnly( iter, 'next', next1b );\n\t\t}\n\t} else if ( opts.dir === 1 ) {\n\t\ti = -1;\n\t\tsetReadOnly( iter, 'next', next2a );\n\t} else {\n\t\ti = src.length;\n\t\tsetReadOnly( iter, 'next', next2b );\n\t}\n\tsetReadOnly( iter, 'return', end );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Resolve an accessor for retrieving array elements (e.g., to accommodate `Complex64Array`, etc):\n\tdt = dtype( src );\n\tif ( isAccessorArray( src ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1a() {\n\t\ti = (i+1) % src.length;\n\t\tcount += 1;\n\t\tif ( FLG || count > opts.iter || src.length === 0 ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': fcn.call( thisArg, get( src, i ), i, count, src ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1b() {\n\t\ti -= 1;\n\t\tif ( i < 0 ) {\n\t\t\ti += src.length;\n\t\t}\n\t\tcount += 1;\n\t\tif ( FLG || count > opts.iter || src.length === 0 ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': fcn.call( thisArg, get( src, i ), i, count, src ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2a() {\n\t\ti = (i+1) % src.length;\n\t\tcount += 1;\n\t\tif ( FLG || count > opts.iter || src.length === 0 ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': get( src, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2b() {\n\t\ti -= 1;\n\t\tif ( i < 0 ) {\n\t\t\ti += src.length;\n\t\t}\n\t\tcount += 1;\n\t\tif ( FLG || count > opts.iter || src.length === 0 ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': get( src, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\tif ( fcn ) {\n\t\t\treturn circarray2iterator( src, opts, fcn, thisArg );\n\t\t}\n\t\treturn circarray2iterator( src, opts );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = circarray2iterator;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator which repeatedly iterates over the elements of an array-like object.\n*\n* @module @stdlib/array/to-circular-iterator\n*\n* @example\n* var circarray2iterator = require( '@stdlib/array/to-circular-iterator' );\n*\n* var iter = circarray2iterator( [ 1, 2, 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 1\n*\n* v = iter.next().value;\n* // returns 2\n*\n* v = iter.next().value;\n* // returns 3\n*\n* // ...\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar iteratorSymbol = require( '@stdlib/symbol/iterator' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar getter = require( './../../base/getter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an iterator which iterates over each element in an array-like object.\n*\n* @param {Collection} src - input value\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} second argument must be a function\n* @returns {Iterator} iterator\n*\n* @example\n* var iter = array2iterator( [ 1, 2, 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 1\n*\n* v = iter.next().value;\n* // returns 2\n*\n* v = iter.next().value;\n* // returns 3\n*\n* // ...\n*/\nfunction array2iterator( src ) {\n\tvar thisArg;\n\tvar iter;\n\tvar FLG;\n\tvar fcn;\n\tvar get;\n\tvar dt;\n\tvar i;\n\tif ( !isCollection( src ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', src ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tfcn = arguments[ 1 ];\n\t\tif ( !isFunction( fcn ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', fcn ) );\n\t\t}\n\t\tthisArg = arguments[ 2 ];\n\t}\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tif ( fcn ) {\n\t\tsetReadOnly( iter, 'next', next1 );\n\t} else {\n\t\tsetReadOnly( iter, 'next', next2 );\n\t}\n\tsetReadOnly( iter, 'return', end );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Resolve an accessor for retrieving array elements (e.g., to accommodate `Complex64Array`, etc):\n\tdt = dtype( src );\n\tif ( isAccessorArray( src ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1() {\n\t\ti += 1;\n\t\tif ( FLG || i >= src.length ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': fcn.call( thisArg, get( src, i ), i, src ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2() {\n\t\ti += 1;\n\t\tif ( FLG || i >= src.length ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': get( src, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\tif ( fcn ) {\n\t\t\treturn array2iterator( src, fcn, thisArg );\n\t\t}\n\t\treturn array2iterator( src );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = array2iterator;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator from an array-like object.\n*\n* @module @stdlib/array/to-iterator\n*\n* @example\n* var array2iterator = require( '@stdlib/array/to-iterator' );\n*\n* var iter = array2iterator( [ 1, 2, 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 1\n*\n* v = iter.next().value;\n* // returns 2\n*\n* v = iter.next().value;\n* // returns 3\n*\n* // ...\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar iteratorSymbol = require( '@stdlib/symbol/iterator' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar getter = require( './../../base/getter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an iterator which iterates from right to left over each element in an array-like object.\n*\n* ## Notes\n*\n* -   For dynamic array resizing, the only behavior made intentionally consistent with iterating from left to right is when elements are pushed onto the beginning (end) of an array. In other words, iterating from left to right combined with `[].push()` is consistent with iterating from right to left combined with `[].unshift()`.\n*\n* @param {Collection} src - input value\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} second argument must be a function\n* @returns {Iterator} iterator\n*\n* @example\n* var iter = array2iteratorRight( [ 1, 2, 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 4\n*\n* v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 2\n*\n* // ...\n*/\nfunction array2iteratorRight( src ) {\n\tvar thisArg;\n\tvar iter;\n\tvar FLG;\n\tvar fcn;\n\tvar len;\n\tvar get;\n\tvar dt;\n\tvar i;\n\tif ( !isCollection( src ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', src ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tfcn = arguments[ 1 ];\n\t\tif ( !isFunction( fcn ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', fcn ) );\n\t\t}\n\t\tthisArg = arguments[ 2 ];\n\t}\n\tlen = src.length;\n\ti = len;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tif ( fcn ) {\n\t\tsetReadOnly( iter, 'next', next1 );\n\t} else {\n\t\tsetReadOnly( iter, 'next', next2 );\n\t}\n\tsetReadOnly( iter, 'return', end );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Resolve an accessor for retrieving array elements (e.g., to accommodate `Complex64Array`, etc):\n\tdt = dtype( src );\n\tif ( isAccessorArray( src ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1() {\n\t\ti += src.length - len - 1; // accounts for a dynamic array\n\t\tlen = src.length;\n\t\tif ( FLG || i < 0 ) {\n\t\t\tFLG = true;\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': fcn.call( thisArg, get( src, i ), i, src ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2() {\n\t\ti += src.length - len - 1; // accounts for a dynamic array\n\t\tlen = src.length;\n\t\tif ( FLG || i < 0 ) {\n\t\t\tFLG = true;\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': get( src, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\tif ( fcn ) {\n\t\t\treturn array2iteratorRight( src, fcn, thisArg );\n\t\t}\n\t\treturn array2iteratorRight( src );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = array2iteratorRight;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator from an array-like object, iterating from right to left.\n*\n* @module @stdlib/array/to-iterator-right\n*\n* @example\n* var array2iteratorRight = require( '@stdlib/array/to-iterator-right' );\n*\n* var iter = array2iteratorRight( [ 1, 2, 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 4\n*\n* v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 2\n*\n* // ...\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Int8Array = require( './../../int8' );\nvar Uint8Array = require( './../../uint8' );\nvar Uint8ClampedArray = require( './../../uint8c' );\nvar Int16Array = require( './../../int16' );\nvar Uint16Array = require( './../../uint16' );\nvar Int32Array = require( './../../int32' );\nvar Uint32Array = require( './../../uint32' );\nvar Float32Array = require( './../../float32' );\nvar Float64Array = require( './../../float64' );\nvar Complex64Array = require( './../../complex64' );\nvar Complex128Array = require( './../../complex128' );\n\n\n// MAIN //\n\nvar CTORS = [\n\t[ Float64Array, 'Float64Array' ],\n\t[ Float32Array, 'Float32Array' ],\n\t[ Int32Array, 'Int32Array' ],\n\t[ Uint32Array, 'Uint32Array' ],\n\t[ Int16Array, 'Int16Array' ],\n\t[ Uint16Array, 'Uint16Array' ],\n\t[ Int8Array, 'Int8Array' ],\n\t[ Uint8Array, 'Uint8Array' ],\n\t[ Uint8ClampedArray, 'Uint8ClampedArray' ],\n\t[ Complex64Array, 'Complex64Array' ],\n\t[ Complex128Array, 'Complex128Array' ]\n];\n\n\n// EXPORTS //\n\nmodule.exports = CTORS;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar instanceOf = require( '@stdlib/assert/instance-of' );\nvar ctorName = require( '@stdlib/utils/constructor-name' );\nvar getPrototypeOf = require( '@stdlib/utils/get-prototype-of' );\nvar CTORS = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns the typed array type.\n*\n* @private\n* @param {TypedArray} arr - typed array\n* @returns {(string|void)} typed array type\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var arr = new Float64Array( 5 );\n* var str = typeName( arr );\n* // returns 'Float64Array'\n*/\nfunction typeName( arr ) {\n\tvar v;\n\tvar i;\n\n\t// Check for typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( instanceOf( arr, CTORS[ i ][ 0 ] ) ) {\n\t\t\treturn CTORS[ i ][ 1 ];\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired native class...\n\twhile ( arr ) {\n\t\tv = ctorName( arr );\n\t\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\t\tif ( v === CTORS[ i ][ 1 ] ) {\n\t\t\t\treturn CTORS[ i ][ 1 ];\n\t\t\t}\n\t\t}\n\t\tarr = getPrototypeOf( arr );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = typeName;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isTypedArray = require( '@stdlib/assert/is-typed-array' );\nvar isComplexTypedArray = require( '@stdlib/assert/is-complex-typed-array' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar format = require( '@stdlib/string/format' );\nvar typeName = require( './type.js' );\n\n\n// MAIN //\n\n/**\n* Returns a JSON representation of a typed array.\n*\n* ## Notes\n*\n* -   We build a JSON object representing a typed array similar to how Node.js `Buffer` objects are represented. See [Buffer][1].\n*\n* [1]: https://nodejs.org/api/buffer.html#buffer_buf_tojson\n*\n* @param {TypedArray} arr - typed array to serialize\n* @throws {TypeError} first argument must be a typed array\n* @returns {Object} JSON representation\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n*\n* var arr = new Float64Array( [ 5.0, 3.0 ] );\n* var json = typedarray2json( arr );\n* // returns { 'type': 'Float64Array', 'data': [ 5.0, 3.0 ] }\n*/\nfunction typedarray2json( arr ) {\n\tvar data;\n\tvar out;\n\tvar i;\n\n\tif ( isTypedArray( arr ) ) {\n\t\tdata = arr;\n\t} else if ( isComplexTypedArray( arr ) ) {\n\t\tif ( arr.BYTES_PER_ELEMENT === 8 ) {\n\t\t\tdata = reinterpret64( arr, 0 );\n\t\t} else { // arr.BYTES_PER_ELEMENT === 16\n\t\t\tdata = reinterpret128( arr, 0 );\n\t\t}\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a typed array. Value: `%s`.', arr ) );\n\t}\n\tout = {\n\t\t'type': typeName( arr ),\n\t\t'data': []\n\t};\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tout.data.push( data[ i ] );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = typedarray2json;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a JSON representation of a typed array.\n*\n* @module @stdlib/array/to-json\n*\n* @example\n* var Float64Array = require( '@stdlib/array/float64' );\n* var typedarray2json = require( '@stdlib/array/to-json' );\n*\n* var arr = new Float64Array( [ 5.0, 3.0 ] );\n* var json = typedarray2json( arr );\n* // returns { 'type': 'Float64Array', 'data': [ 5.0, 3.0 ] }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2019 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar iteratorSymbol = require( '@stdlib/symbol/iterator' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar getter = require( './../../base/getter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an iterator which iterates over each element in a sparse array-like object.\n*\n* @param {Collection} src - input value\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} second argument must be a function\n* @returns {Iterator} iterator\n*\n* @example\n* var iter = sparsearray2iterator( [ 1, , 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 1\n*\n* v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 4\n*/\nfunction sparsearray2iterator( src ) {\n\tvar thisArg;\n\tvar iter;\n\tvar FLG;\n\tvar fcn;\n\tvar get;\n\tvar dt;\n\tvar i;\n\tif ( !isCollection( src ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', src ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tfcn = arguments[ 1 ];\n\t\tif ( !isFunction( fcn ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', fcn ) );\n\t\t}\n\t\tthisArg = arguments[ 2 ];\n\t}\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tif ( fcn ) {\n\t\tsetReadOnly( iter, 'next', next1 );\n\t} else {\n\t\tsetReadOnly( iter, 'next', next2 );\n\t}\n\tsetReadOnly( iter, 'return', end );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Resolve an accessor for retrieving array elements (e.g., to accommodate `Complex64Array`, etc):\n\tdt = dtype( src );\n\tif ( isAccessorArray( src ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1() {\n\t\tvar len;\n\t\tif ( FLG ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tlen = src.length;\n\t\ti += 1;\n\t\twhile ( i < len && get( src, i ) === void 0 ) {\n\t\t\ti += 1;\n\t\t}\n\t\tif ( i >= len ) {\n\t\t\tFLG = true;\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': fcn.call( thisArg, get( src, i ), i, src ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2() {\n\t\tvar len;\n\t\tif ( FLG ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tlen = src.length;\n\t\ti += 1;\n\t\twhile ( i < len && get( src, i ) === void 0 ) {\n\t\t\ti += 1;\n\t\t}\n\t\tif ( i >= len ) {\n\t\t\tFLG = true;\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': get( src, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\tif ( fcn ) {\n\t\t\treturn sparsearray2iterator( src, fcn, thisArg );\n\t\t}\n\t\treturn sparsearray2iterator( src );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = sparsearray2iterator;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2019 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator from a sparse array-like value.\n*\n* @module @stdlib/array/to-sparse-iterator\n*\n* @example\n* var sparsearray2iterator = require( '@stdlib/array/to-sparse-iterator' );\n*\n* var iter = sparsearray2iterator( [ 1, , 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 1\n*\n* v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 4\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2019 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar iteratorSymbol = require( '@stdlib/symbol/iterator' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar getter = require( './../../base/getter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an iterator which iterates from right to left over each element in a sparse array-like object.\n*\n* ## Notes\n*\n* -   For dynamic array resizing, the only behavior made intentionally consistent with iterating from left to right is when elements are pushed onto the beginning (end) of an array. In other words, iterating from left to right combined with `[].push()` is consistent with iterating from right to left combined with `[].unshift()`.\n*\n* @param {Collection} src - input value\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} second argument must be a function\n* @returns {Iterator} iterator\n*\n* @example\n* var iter = sparsearray2iteratorRight( [ 1, , 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 4\n*\n* v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 1\n*/\nfunction sparsearray2iteratorRight( src ) {\n\tvar thisArg;\n\tvar iter;\n\tvar FLG;\n\tvar fcn;\n\tvar len;\n\tvar get;\n\tvar dt;\n\tvar i;\n\tif ( !isCollection( src ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', src ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tfcn = arguments[ 1 ];\n\t\tif ( !isFunction( fcn ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', fcn ) );\n\t\t}\n\t\tthisArg = arguments[ 2 ];\n\t}\n\tlen = src.length;\n\ti = len;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tif ( fcn ) {\n\t\tsetReadOnly( iter, 'next', next1 );\n\t} else {\n\t\tsetReadOnly( iter, 'next', next2 );\n\t}\n\tsetReadOnly( iter, 'return', end );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Resolve an accessor for retrieving array elements (e.g., to accommodate `Complex64Array`, etc):\n\tdt = dtype( src );\n\tif ( isAccessorArray( src ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1() {\n\t\tif ( FLG ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\ti += src.length - len - 1; // accounts for a dynamic array\n\t\tlen = src.length;\n\t\twhile ( i >= 0 && get( src, i ) === void 0 ) {\n\t\t\ti -= 1;\n\t\t}\n\t\tif ( i < 0 ) {\n\t\t\tFLG = true;\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': fcn.call( thisArg, get( src, i ), i, src ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2() {\n\t\tif ( FLG ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\ti += src.length - len - 1; // accounts for a dynamic array\n\t\tlen = src.length;\n\t\twhile ( i >= 0 && get( src, i ) === void 0 ) {\n\t\t\ti -= 1;\n\t\t}\n\t\tif ( i < 0 ) {\n\t\t\tFLG = true;\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': get( src, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\tif ( fcn ) {\n\t\t\treturn sparsearray2iteratorRight( src, fcn, thisArg );\n\t\t}\n\t\treturn sparsearray2iteratorRight( src );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = sparsearray2iteratorRight;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2019 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator from a sparse array-like value, iterating from right to left.\n*\n* @module @stdlib/array/to-sparse-iterator-right\n*\n* @example\n* var sparsearray2iteratorRight = require( '@stdlib/array/to-sparse-iterator-right' );\n*\n* var iter = sparsearray2iteratorRight( [ 1, , 3, 4 ] );\n*\n* var v = iter.next().value;\n* // returns 4\n*\n* v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 1\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar isInteger = require( '@stdlib/assert/is-integer' ).isPrimitive;\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar iteratorSymbol = require( '@stdlib/symbol/iterator' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar getter = require( './../../base/getter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an iterator which iterates over elements in an array-like object according to specified stride parameters.\n*\n* @param {NonNegativeInteger} N - number of values to iterate\n* @param {Collection} src - input value\n* @param {integer} stride - stride length\n* @param {NonNegativeInteger} offset - starting index\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} second argument must be an array-like object\n* @throws {TypeError} third argument must be an integer\n* @throws {TypeError} fourth argument must be a nonnegative integer\n* @throws {TypeError} fifth argument must be a function\n* @returns {Iterator} iterator\n*\n* @example\n* var values = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n*\n* var N = 4;\n* var stride = -2;\n* var offset = 6;\n*\n* var iter = stridedarray2iterator( N, values, stride, offset );\n*\n* var v = iter.next().value;\n* // returns 7\n*\n* v = iter.next().value;\n* // returns 5\n*\n* v = iter.next().value;\n* // returns 3\n*\n* // ...\n*/\nfunction stridedarray2iterator( N, src, stride, offset ) {\n\tvar thisArg;\n\tvar iter;\n\tvar FLG;\n\tvar fcn;\n\tvar idx;\n\tvar get;\n\tvar dt;\n\tvar i;\n\tif ( !isNonNegativeInteger( N ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a nonnegative integer. Value: `%s`.', N ) );\n\t}\n\tif ( !isCollection( src ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an array-like object. Value: `%s`.', src ) );\n\t}\n\tif ( !isInteger( stride ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', stride ) );\n\t}\n\tif ( !isNonNegativeInteger( offset ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be a nonnegative integer. Value: `%s`.', offset ) );\n\t}\n\tif ( arguments.length > 4 ) {\n\t\tfcn = arguments[ 4 ];\n\t\tif ( !isFunction( fcn ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Fifth argument must be a function. Value: `%s`.', fcn ) );\n\t\t}\n\t\tthisArg = arguments[ 5 ];\n\t}\n\tidx = offset;\n\ti = -1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tif ( fcn ) {\n\t\tsetReadOnly( iter, 'next', next1 );\n\t} else {\n\t\tsetReadOnly( iter, 'next', next2 );\n\t}\n\tsetReadOnly( iter, 'return', end );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Resolve an accessor for retrieving array elements (e.g., to accommodate `Complex64Array`, etc):\n\tdt = dtype( src );\n\tif ( isAccessorArray( src ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1() {\n\t\tvar v;\n\t\ti += 1;\n\t\tif ( FLG || i >= N ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tv = fcn.call( thisArg, get( src, idx ), idx, i, src );\n\t\tidx += stride;\n\t\treturn {\n\t\t\t'value': v,\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2() {\n\t\tvar v;\n\t\ti += 1;\n\t\tif ( FLG || i >= N ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tv = get( src, idx );\n\t\tidx += stride;\n\t\treturn {\n\t\t\t'value': v,\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\tif ( fcn ) {\n\t\t\treturn stridedarray2iterator( N, src, stride, offset, fcn, thisArg ); // eslint-disable-line max-len\n\t\t}\n\t\treturn stridedarray2iterator( N, src, stride, offset );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = stridedarray2iterator;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator from a strided array-like value.\n*\n* @module @stdlib/array/to-strided-iterator\n*\n* @example\n* var stridedarray2iterator = require( '@stdlib/array/to-strided-iterator' );\n*\n* var values = [ 1, 2, 3, 4, 5, 6, 7, 8 ];\n*\n* var N = 4;\n* var stride = -2;\n* var offset = 6;\n*\n* var iter = stridedarray2iterator( N, values, stride, offset );\n*\n* var v = iter.next().value;\n* // returns 7\n*\n* v = iter.next().value;\n* // returns 5\n*\n* v = iter.next().value;\n* // returns 3\n*\n* // ...\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2019 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isInteger = require( '@stdlib/assert/is-integer' ).isPrimitive;\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar iteratorSymbol = require( '@stdlib/symbol/iterator' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar getter = require( './../../base/getter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an iterator which iterates over each element in an array-like object view.\n*\n* @param {Collection} src - input value\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end=src.length] - ending index (non-inclusive)\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} second argument must be either an integer (starting index) or a function\n* @throws {TypeError} third argument must be either an integer (ending index) or a function\n* @throws {TypeError} fourth argument must be a function\n* @returns {Iterator} iterator\n*\n* @example\n* var iter = arrayview2iterator( [ 1, 2, 3, 4 ], 1, 3 );\n*\n* var v = iter.next().value;\n* // returns 2\n*\n* v = iter.next().value;\n* // returns 3\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nfunction arrayview2iterator( src ) {\n\tvar thisArg;\n\tvar begin;\n\tvar nargs;\n\tvar iter;\n\tvar FLG;\n\tvar fcn;\n\tvar end;\n\tvar get;\n\tvar dt;\n\tvar i;\n\tif ( !isCollection( src ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', src ) );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs === 1 ) {\n\t\tbegin = 0;\n\t\tend = src.length;\n\t} else if ( nargs === 2 ) {\n\t\tif ( isFunction( arguments[ 1 ] ) ) {\n\t\t\tbegin = 0;\n\t\t\tfcn = arguments[ 1 ];\n\t\t} else {\n\t\t\tbegin = arguments[ 1 ];\n\t\t}\n\t\tend = src.length;\n\t} else if ( nargs === 3 ) {\n\t\tif ( isFunction( arguments[ 1 ] ) ) {\n\t\t\tbegin = 0;\n\t\t\tend = src.length;\n\t\t\tfcn = arguments[ 1 ];\n\t\t\tthisArg = arguments[ 2 ];\n\t\t} else if ( isFunction( arguments[ 2 ] ) ) {\n\t\t\tbegin = arguments[ 1 ];\n\t\t\tend = src.length;\n\t\t\tfcn = arguments[ 2 ];\n\t\t} else {\n\t\t\tbegin = arguments[ 1 ];\n\t\t\tend = arguments[ 2 ];\n\t\t}\n\t} else { // nargs >= 4\n\t\tbegin = arguments[ 1 ];\n\t\tend = arguments[ 2 ];\n\t\tfcn = arguments[ 3 ];\n\t\tif ( !isFunction( fcn ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be a function. Value: `%s`.', fcn ) );\n\t\t}\n\t\tthisArg = arguments[ 4 ];\n\t}\n\tif ( !isInteger( begin ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either an integer (starting index) or a function. Value: `%s`.', begin ) );\n\t}\n\tif ( !isInteger( end ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be either an integer (ending index) or a function. Value: `%s`.', end ) );\n\t}\n\tif ( end < 0 ) {\n\t\tend = src.length + end;\n\t\tif ( end < 0 ) {\n\t\t\tend = 0;\n\t\t}\n\t} else if ( end > src.length ) {\n\t\tend = src.length;\n\t}\n\tif ( begin < 0 ) {\n\t\tbegin = src.length + begin;\n\t\tif ( begin < 0 ) {\n\t\t\tbegin = 0;\n\t\t}\n\t}\n\ti = begin - 1;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tif ( fcn ) {\n\t\tsetReadOnly( iter, 'next', next1 );\n\t} else {\n\t\tsetReadOnly( iter, 'next', next2 );\n\t}\n\tsetReadOnly( iter, 'return', finish );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Resolve an accessor for retrieving array elements (e.g., to accommodate `Complex64Array`, etc):\n\tdt = dtype( src );\n\tif ( isAccessorArray( src ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1() {\n\t\ti += 1;\n\t\tif ( FLG || i >= end ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': fcn.call( thisArg, get( src, i ), i, i-begin, src ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2() {\n\t\ti += 1;\n\t\tif ( FLG || i >= end ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': get( src, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction finish( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\tif ( fcn ) {\n\t\t\treturn arrayview2iterator( src, begin, end, fcn, thisArg );\n\t\t}\n\t\treturn arrayview2iterator( src, begin, end );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = arrayview2iterator;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2019 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator from an array-like object view.\n*\n* @module @stdlib/array/to-view-iterator\n*\n* @example\n* var arrayview2iterator = require( '@stdlib/array/to-view-iterator' );\n*\n* var iter = arrayview2iterator( [ 1, 2, 3, 4 ], 1, 3 );\n*\n* var v = iter.next().value;\n* // returns 2\n*\n* v = iter.next().value;\n* // returns 3\n*\n* var bool = iter.next().done;\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2019 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );\nvar isFunction = require( '@stdlib/assert/is-function' );\nvar isCollection = require( '@stdlib/assert/is-collection' );\nvar isInteger = require( '@stdlib/assert/is-integer' ).isPrimitive;\nvar isAccessorArray = require( './../../base/assert/is-accessor-array' );\nvar iteratorSymbol = require( '@stdlib/symbol/iterator' );\nvar accessorGetter = require( './../../base/accessor-getter' );\nvar getter = require( './../../base/getter' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Returns an iterator which iterates from right to left over each element in an array-like object view.\n*\n* @param {Collection} src - input value\n* @param {integer} [begin=0] - starting **view** index (inclusive)\n* @param {integer} [end=src.length] - ending **view** index (non-inclusive)\n* @param {Function} [mapFcn] - function to invoke for each iterated value\n* @param {*} [thisArg] - execution context\n* @throws {TypeError} first argument must be an array-like object\n* @throws {TypeError} second argument must be either an integer (starting index) or a function\n* @throws {TypeError} third argument must be either an integer (ending index) or a function\n* @throws {TypeError} fourth argument must be a function\n* @returns {Iterator} iterator\n*\n* @example\n* var iter = arrayview2iteratorRight( [ 1, 2, 3, 4 ], 1, 3 );\n*\n* var v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 2\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nfunction arrayview2iteratorRight( src ) {\n\tvar thisArg;\n\tvar begin;\n\tvar nargs;\n\tvar iter;\n\tvar FLG;\n\tvar fcn;\n\tvar end;\n\tvar get;\n\tvar dt;\n\tvar i;\n\tif ( !isCollection( src ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', src ) );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs === 1 ) {\n\t\tbegin = 0;\n\t\tend = src.length;\n\t} else if ( nargs === 2 ) {\n\t\tif ( isFunction( arguments[ 1 ] ) ) {\n\t\t\tbegin = 0;\n\t\t\tfcn = arguments[ 1 ];\n\t\t} else {\n\t\t\tbegin = arguments[ 1 ];\n\t\t}\n\t\tend = src.length;\n\t} else if ( nargs === 3 ) {\n\t\tif ( isFunction( arguments[ 1 ] ) ) {\n\t\t\tbegin = 0;\n\t\t\tend = src.length;\n\t\t\tfcn = arguments[ 1 ];\n\t\t\tthisArg = arguments[ 2 ];\n\t\t} else if ( isFunction( arguments[ 2 ] ) ) {\n\t\t\tbegin = arguments[ 1 ];\n\t\t\tend = src.length;\n\t\t\tfcn = arguments[ 2 ];\n\t\t} else {\n\t\t\tbegin = arguments[ 1 ];\n\t\t\tend = arguments[ 2 ];\n\t\t}\n\t} else { // nargs >= 4\n\t\tbegin = arguments[ 1 ];\n\t\tend = arguments[ 2 ];\n\t\tfcn = arguments[ 3 ];\n\t\tif ( !isFunction( fcn ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Fourth argument must be a function. Value: `%s`.', fcn ) );\n\t\t}\n\t\tthisArg = arguments[ 4 ];\n\t}\n\tif ( !isInteger( begin ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either an integer (starting view index) or a function. Value: `%s`.', begin ) );\n\t}\n\tif ( !isInteger( end ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be either an integer (ending view index) or a function. Value: `%s`.', end ) );\n\t}\n\tif ( end < 0 ) {\n\t\tend = src.length + end;\n\t\tif ( end < 0 ) {\n\t\t\tend = 0;\n\t\t}\n\t} else if ( end > src.length ) {\n\t\tend = src.length;\n\t}\n\tif ( begin < 0 ) {\n\t\tbegin = src.length + begin;\n\t\tif ( begin < 0 ) {\n\t\t\tbegin = 0;\n\t\t}\n\t}\n\ti = end;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tif ( fcn ) {\n\t\tsetReadOnly( iter, 'next', next1 );\n\t} else {\n\t\tsetReadOnly( iter, 'next', next2 );\n\t}\n\tsetReadOnly( iter, 'return', finish );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Resolve an accessor for retrieving array elements (e.g., to accommodate `Complex64Array`, etc):\n\tdt = dtype( src );\n\tif ( isAccessorArray( src ) ) {\n\t\tget = accessorGetter( dt );\n\t} else {\n\t\tget = getter( dt );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next1() {\n\t\ti -= 1;\n\t\tif ( FLG || i < begin ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': fcn.call( thisArg, get( src, i ), i, end-i-1, src ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next2() {\n\t\ti -= 1;\n\t\tif ( FLG || i < begin ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'value': get( src, i ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction finish( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\tif ( fcn ) {\n\t\t\treturn arrayview2iteratorRight( src, begin, end, fcn, thisArg );\n\t\t}\n\t\treturn arrayview2iteratorRight( src, begin, end );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = arrayview2iteratorRight;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2019 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator from an array-like object view, iterating from right to left.\n*\n* @module @stdlib/array/to-view-iterator-right\n*\n* @example\n* var arrayview2iteratorRight = require( '@stdlib/array/to-view-iterator-right' );\n*\n* var iter = arrayview2iteratorRight( [ 1, 2, 3, 4 ], 1, 3 );\n*\n* var v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 2\n*\n* var bool = iter.next().done;\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar ctors = require( './../../typed-ctors' );\nvar reinterpret128 = require( '@stdlib/strided/base/reinterpret-complex128' );\nvar reinterpret64 = require( '@stdlib/strided/base/reinterpret-complex64' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\nvar Complex64Array = ctors( 'complex64' );\nvar Complex128Array = ctors( 'complex128' );\n\n\n// MAIN //\n\n/**\n* Creates a typed array.\n*\n* @param {(NonNegativeInteger|ComplexArray|TypedArray|ArrayLikeObject|ArrayBuffer)} [arg] - a length, typed array, array-like object, or buffer\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} must provide a recognized data type\n* @returns {(ComplexArray|TypedArray)} typed array\n*\n* @example\n* var arr = typedarray();\n* // returns <Float64Array>\n*\n* @example\n* var arr = typedarray( 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var arr = typedarray( 2, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*\n* @example\n* var arr = typedarray( [ 0.5, 0.5 ] );\n* // returns <Float64Array>[ 0.5, 0.5 ]\n*\n* @example\n* var arr = typedarray( [ 5, -3 ], 'int32' );\n* // returns <Int32Array>[ 5, -3 ]\n*\n* @example\n* var arr1 = typedarray( [ 5, 3 ], 'int32' );\n* var arr2 = typedarray( arr1 );\n* // returns <Float64Array>[ 5.0, 3.0 ]\n*\n* @example\n* var arr1 = typedarray( [ 5, 3 ], 'int32' );\n* var arr2 = typedarray( arr1, 'uint32' );\n* // returns <Uint32Array>[ 5, 3 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0, 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 8 );\n* // returns <Float64Array>[ 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 8, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = typedarray( buf, 8, 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = typedarray( buf, 8, 2, 'int32' );\n* // returns <Int32Array>[ 0, 0 ]\n*/\nfunction typedarray() {\n\tvar nargs;\n\tvar dtype;\n\tvar ctor;\n\tvar arg;\n\n\tnargs = arguments.length;\n\tif ( nargs && isString( arguments[ nargs-1 ] ) ) {\n\t\tnargs -= 1;\n\t\tdtype = arguments[ nargs ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tif ( nargs <= 0 ) {\n\t\treturn new ctor( 0 );\n\t}\n\tif ( nargs === 1 ) {\n\t\targ = arguments[ 0 ];\n\n\t\t// Note: the following checks are not particularly robust, as `instanceof` will fail for cross-realm instances...\n\t\tif ( arg instanceof Complex64Array ) {\n\t\t\targ = reinterpret64( arg, 0 );\n\t\t} else if ( arg instanceof Complex128Array ) {\n\t\t\targ = reinterpret128( arg, 0 );\n\t\t}\n\t\treturn new ctor( arg );\n\t}\n\tif ( nargs === 2 ) {\n\t\treturn new ctor( arguments[0], arguments[1] );\n\t}\n\treturn new ctor( arguments[0], arguments[1], arguments[2] );\n}\n\n\n// EXPORTS //\n\nmodule.exports = typedarray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a typed array.\n*\n* @module @stdlib/array/typed\n*\n* @example\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var arr = typedarray();\n* // returns <Float64Array>\n*\n* @example\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var arr = typedarray( 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var arr = typedarray( 2, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*\n* @example\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var arr = typedarray( [ 0.5, 0.5 ] );\n* // returns <Float64Array>[ 0.5, 0.5 ]\n*\n* @example\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var arr = typedarray( [ 5, -3 ], 'int32' );\n* // returns <Int32Array>[ 5, -3 ]\n*\n* @example\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var arr1 = typedarray( [ 5, 3 ], 'int32' );\n* var arr2 = typedarray( arr1 );\n* // returns <Float64Array>[ 5.0, 3.0 ]\n*\n* @example\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var arr1 = typedarray( [ 5, 3 ], 'int32' );\n* var arr2 = typedarray( arr1, 'uint32' );\n* // returns <Uint32Array>[ 5, 3 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0, 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 8 );\n* // returns <Float64Array>[ 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = typedarray( buf, 8, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = typedarray( buf, 8, 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var typedarray = require( '@stdlib/array/typed' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = typedarray( buf, 8, 2, 'int32' );\n* // returns <Int32Array>[ 0, 0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Complex128Array = require( './../../complex128' );\nvar Complex64Array = require( './../../complex64' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'complex128': Complex128Array,\n\t'complex64': Complex64Array\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns a complex typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'complex128' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Complex typed array constructors.\n*\n* @module @stdlib/array/typed-complex-ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/typed-complex-ctors' );\n*\n* var ctor = ctors( 'complex128' );\n* // returns <Function>\n*\n* ctor = ctors( 'float64' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar ctors = require( './../../typed-complex-ctors' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.complex_floating_point' );\n\n\n// MAIN //\n\n/**\n* Creates a complex number typed array.\n*\n* @param {(NonNegativeInteger|ComplexArray|ArrayLikeObject|ArrayBuffer)} [arg] - a length, typed array, array-like object, or buffer\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @param {string} [dtype=\"complex128\"] - data type\n* @throws {TypeError} must provide a recognized data type\n* @returns {ComplexArray} typed array\n*\n* @example\n* var arr = complexarray();\n* // returns <Complex128Array>\n*\n* @example\n* var arr = complexarray( 2 );\n* // returns <Complex128Array>\n*\n* @example\n* var arr = complexarray( 2, 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var arr = complexarray( [ 0.5, 0.5 ] );\n* // returns <Complex128Array>\n*\n* @example\n* var arr = complexarray( [ 5.0, -3.0 ], 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var arr1 = complexarray( [ 5.0, 3.0 ], 'complex64' );\n* var arr2 = complexarray( arr1 );\n* // returns <Complex128Array>\n*\n* @example\n* var arr1 = complexarray( [ 5.0, 3.0 ], 'complex128' );\n* var arr2 = complexarray( arr1, 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = complexarray( buf );\n* // returns <Complex128Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = complexarray( buf, 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = complexarray( buf, 16 );\n* // returns <Complex128Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = complexarray( buf, 16, 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = complexarray( buf, 16, 2 );\n* // returns <Complex128Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = complexarray( buf, 16, 2, 'complex64' );\n* // returns <Complex64Array>\n*/\nfunction complexarray() {\n\tvar nargs;\n\tvar dtype;\n\tvar ctor;\n\n\tnargs = arguments.length;\n\tif ( nargs && isString( arguments[ nargs-1 ] ) ) {\n\t\tnargs -= 1;\n\t\tdtype = arguments[ nargs ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tif ( nargs <= 0 ) {\n\t\treturn new ctor( 0 );\n\t}\n\tif ( nargs === 1 ) {\n\t\treturn new ctor( arguments[0] );\n\t}\n\tif ( nargs === 2 ) {\n\t\treturn new ctor( arguments[0], arguments[1] );\n\t}\n\treturn new ctor( arguments[0], arguments[1], arguments[2] );\n}\n\n\n// EXPORTS //\n\nmodule.exports = complexarray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a complex number typed array.\n*\n* @module @stdlib/array/typed-complex\n*\n* @example\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var arr = complexarray();\n* // returns <Complex128Array>\n*\n* @example\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var arr = complexarray( 2 );\n* // returns <Complex128Array>\n*\n* @example\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var arr = complexarray( 2, 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var arr = complexarray( [ 0.5, 0.5 ] );\n* // returns <Complex128Array>\n*\n* @example\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var arr = complexarray( [ 5.0, -3.0 ], 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var arr1 = complexarray( [ 5.0, 3.0 ], 'complex64' );\n* var arr2 = complexarray( arr1 );\n* // returns <Complex128Array>\n*\n* @example\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var arr1 = complexarray( [ 5.0, 3.0 ], 'complex128' );\n* var arr2 = complexarray( arr1, 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = complexarray( buf );\n* // returns <Complex128Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = complexarray( buf, 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = complexarray( buf, 16 );\n* // returns <Complex128Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = complexarray( buf, 16, 'complex64' );\n* // returns <Complex64Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = complexarray( buf, 16, 2 );\n* // returns <Complex128Array>\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var complexarray = require( '@stdlib/array/typed-complex' );\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = complexarray( buf, 16, 2, 'complex64' );\n* // returns <Complex64Array>\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "[\n\t\"complex64\",\n\t\"complex128\"\n]\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar DTYPES = require( './dtypes.json' );\n\n\n// MAIN //\n\n/**\n* Returns a list of complex typed array data types.\n*\n* @returns {StringArray} list of complex typed array data types\n*\n* @example\n* var list = dtypes();\n* // returns [ 'complex64', 'complex128' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of complex typed array data types.\n*\n* @module @stdlib/array/typed-complex-dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/typed-complex-dtypes' );\n*\n* var list = dtypes();\n* // returns [ 'complex64', 'complex128' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "[\n\t\"float32\",\n\t\"float64\",\n\t\"int16\",\n\t\"int32\",\n\t\"int8\",\n\t\"uint16\",\n\t\"uint32\",\n\t\"uint8\",\n\t\"uint8c\",\n  \"complex64\",\n  \"complex128\"\n]\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar DTYPES = require( './dtypes.json' );\n\n\n// MAIN //\n\n/**\n* Returns a list of typed array data types.\n*\n* @returns {StringArray} list of typed array data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', 'int16', 'int32', 'int8', 'uint16', 'uint32', 'uint8', 'uint8c', 'complex128', 'complex64' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of typed array data types.\n*\n* @module @stdlib/array/typed-dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/typed-dtypes' );\n*\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', 'int16', 'int32', 'int8', 'uint16', 'uint32', 'uint8', 'uint8c', 'complex128', 'complex64' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "[\n\t\"float32\",\n\t\"float64\",\n\t\"complex64\",\n  \"complex128\"\n]\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar DTYPES = require( './dtypes.json' );\n\n\n// MAIN //\n\n/**\n* Returns a list of typed array floating-point data types.\n*\n* @returns {StringArray} list of typed array floating-point data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', 'complex64', 'complex128' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of typed array floating-point data types.\n*\n* @module @stdlib/array/typed-float-dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/typed-float-dtypes' );\n*\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', 'complex64', 'complex128' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Int16Array = require( './../../int16' );\nvar Int32Array = require( './../../int32' );\nvar Int8Array = require( './../../int8' );\nvar Uint16Array = require( './../../uint16' );\nvar Uint32Array = require( './../../uint32' );\nvar Uint8Array = require( './../../uint8' );\nvar Uint8ClampedArray = require( './../../uint8c' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array,\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns an integer-valued typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'int32' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'int' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Integer-valued typed array constructors.\n*\n* @module @stdlib/array/typed-integer-ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/typed-integer-ctors' );\n*\n* var ctor = ctors( 'int32' );\n* // returns <Function>\n*\n* ctor = ctors( 'int' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "[\n\t\"int16\",\n\t\"int32\",\n\t\"int8\",\n\t\"uint16\",\n\t\"uint32\",\n\t\"uint8\",\n\t\"uint8c\"\n]\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar DTYPES = require( './dtypes.json' );\n\n\n// MAIN //\n\n/**\n* Returns a list of typed array integer data types.\n*\n* @returns {StringArray} list of typed array integer data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'int16', 'int32', 'int8', 'uint16', 'uint32', 'uint8', 'uint8c' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of typed array integer data types.\n*\n* @module @stdlib/array/typed-integer-dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/typed-integer-dtypes' );\n*\n* var list = dtypes();\n* // e.g., returns [ 'int16', 'int32', 'int8', 'uint16', 'uint32', 'uint8', 'uint8c' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isString = require( '@stdlib/assert/is-string' ).isPrimitive;\nvar ctors = require( './../../typed-ctors' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.real' );\n\n\n// MAIN //\n\n/**\n* Creates a typed array.\n*\n* @param {(NonNegativeInteger|TypedArray|ArrayLikeObject|ArrayBuffer)} [arg] - a length, typed array, array-like object, or buffer\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} must provide a recognized data type\n* @returns {TypedArray} typed array\n*\n* @example\n* var arr = realarray();\n* // returns <Float64Array>\n*\n* @example\n* var arr = realarray( 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var arr = realarray( 2, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*\n* @example\n* var arr = realarray( [ 0.5, 0.5 ] );\n* // returns <Float64Array>[ 0.5, 0.5 ]\n*\n* @example\n* var arr = realarray( [ 5, -3 ], 'int32' );\n* // returns <Int32Array>[ 5, -3 ]\n*\n* @example\n* var arr1 = realarray( [ 5, 3 ], 'int32' );\n* var arr2 = realarray( arr1 );\n* // returns <Float64Array>[ 5.0, 3.0 ]\n*\n* @example\n* var arr1 = realarray( [ 5, 3 ], 'int32' );\n* var arr2 = realarray( arr1, 'uint32' );\n* // returns <Uint32Array>[ 5, 3 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = realarray( buf );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = realarray( buf, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0, 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = realarray( buf, 8 );\n* // returns <Float64Array>[ 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = realarray( buf, 8, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = realarray( buf, 8, 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = realarray( buf, 8, 2, 'int32' );\n* // returns <Int32Array>[ 0, 0 ]\n*/\nfunction realarray() {\n\tvar nargs;\n\tvar dtype;\n\tvar ctor;\n\n\tnargs = arguments.length;\n\tif ( nargs && isString( arguments[ nargs-1 ] ) ) {\n\t\tnargs -= 1;\n\t\tdtype = arguments[ nargs ];\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\tctor = ctors( dtype );\n\tif ( ctor === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a recognized data type. Value: `%s`.', dtype ) );\n\t}\n\tif ( nargs <= 0 ) {\n\t\treturn new ctor( 0 );\n\t}\n\tif ( nargs === 1 ) {\n\t\treturn new ctor( arguments[0] );\n\t}\n\tif ( nargs === 2 ) {\n\t\treturn new ctor( arguments[0], arguments[1] );\n\t}\n\treturn new ctor( arguments[0], arguments[1], arguments[2] );\n}\n\n\n// EXPORTS //\n\nmodule.exports = realarray;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a typed array.\n*\n* @module @stdlib/array/typed-real\n*\n* @example\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var arr = realarray();\n* // returns <Float64Array>\n*\n* @example\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var arr = realarray( 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var arr = realarray( 2, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*\n* @example\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var arr = realarray( [ 0.5, 0.5 ] );\n* // returns <Float64Array>[ 0.5, 0.5 ]\n*\n* @example\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var arr = realarray( [ 5, -3 ], 'int32' );\n* // returns <Int32Array>[ 5, -3 ]\n*\n* @example\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var arr1 = realarray( [ 5, 3 ], 'int32' );\n* var arr2 = realarray( arr1 );\n* // returns <Float64Array>[ 5.0, 3.0 ]\n*\n* @example\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var arr1 = realarray( [ 5, 3 ], 'int32' );\n* var arr2 = realarray( arr1, 'uint32' );\n* // returns <Uint32Array>[ 5, 3 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = realarray( buf );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = realarray( buf, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0, 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = realarray( buf, 8 );\n* // returns <Float64Array>[ 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = realarray( buf, 8, 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = realarray( buf, 8, 2 );\n* // returns <Float64Array>[ 0.0, 0.0 ]\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array/buffer' );\n* var realarray = require( '@stdlib/array/typed-real' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = realarray( buf, 8, 2, 'int32' );\n* // returns <Int32Array>[ 0, 0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( './../../float64' );\nvar Float32Array = require( './../../float32' );\nvar Int16Array = require( './../../int16' );\nvar Int32Array = require( './../../int32' );\nvar Int8Array = require( './../../int8' );\nvar Uint16Array = require( './../../uint16' );\nvar Uint32Array = require( './../../uint32' );\nvar Uint8Array = require( './../../uint8' );\nvar Uint8ClampedArray = require( './../../uint8c' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'float64': Float64Array,\n\t'float32': Float32Array,\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array,\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns a typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructors.\n*\n* @module @stdlib/array/typed-real-ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/typed-real-ctors' );\n*\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* ctor = ctors( 'int' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "[\n\t\"float32\",\n\t\"float64\",\n\t\"int16\",\n\t\"int32\",\n\t\"int8\",\n\t\"uint16\",\n\t\"uint32\",\n\t\"uint8\",\n\t\"uint8c\"\n]\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar DTYPES = require( './dtypes.json' );\n\n\n// MAIN //\n\n/**\n* Returns a list of typed array data types.\n*\n* @returns {StringArray} list of typed array data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', 'int16', 'int32', 'int8', 'uint16', 'uint32', 'uint8', 'uint8c' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of typed array data types.\n*\n* @module @stdlib/array/typed-real-dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/typed-real-dtypes' );\n*\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64', 'int16', 'int32', 'int8', 'uint16', 'uint32', 'uint8', 'uint8c' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( './../../float64' );\nvar Float32Array = require( './../../float32' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'float64': Float64Array,\n\t'float32': Float32Array\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns a real-valued floating-point typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'float' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Real-valued floating-point typed array constructors.\n*\n* @module @stdlib/array/typed-real-float-ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/typed-real-float-ctors' );\n*\n* var ctor = ctors( 'float64' );\n* // returns <Function>\n*\n* ctor = ctors( 'int' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "[\n\t\"float32\",\n\t\"float64\"\n]\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar DTYPES = require( './dtypes.json' );\n\n\n// MAIN //\n\n/**\n* Returns a list of typed array real-valued floating-point data types.\n*\n* @returns {StringArray} list of typed array real-valued floating-point data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of typed array real-valued floating-point data types.\n*\n* @module @stdlib/array/typed-real-float-dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/typed-real-float-dtypes' );\n*\n* var list = dtypes();\n* // e.g., returns [ 'float32', 'float64' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Int16Array = require( './../../int16' );\nvar Int32Array = require( './../../int32' );\nvar Int8Array = require( './../../int8' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'int16': Int16Array,\n\t'int32': Int32Array,\n\t'int8': Int8Array\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns a signed integer typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'int32' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'int' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Signed integer typed array constructors.\n*\n* @module @stdlib/array/typed-signed-integer-ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/typed-signed-integer-ctors' );\n*\n* var ctor = ctors( 'int32' );\n* // returns <Function>\n*\n* ctor = ctors( 'int' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "[\n\t\"int16\",\n\t\"int32\",\n\t\"int8\"\n]\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar DTYPES = require( './dtypes.json' );\n\n\n// MAIN //\n\n/**\n* Returns a list of typed array signed integer data types.\n*\n* @returns {StringArray} list of typed array signed integer data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'int16', 'int32', 'int8' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of typed array signed integer data types.\n*\n* @module @stdlib/array/typed-signed-integer-dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/typed-signed-integer-dtypes' );\n*\n* var list = dtypes();\n* // e.g., returns [ 'int16', 'int32', 'int8' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Uint16Array = require( './../../uint16' );\nvar Uint32Array = require( './../../uint32' );\nvar Uint8Array = require( './../../uint8' );\nvar Uint8ClampedArray = require( './../../uint8c' );\n\n\n// MAIN //\n\n// Mapping from data types to constructors...\nvar ctors = {\n\t'uint16': Uint16Array,\n\t'uint32': Uint32Array,\n\t'uint8': Uint8Array,\n\t'uint8c': Uint8ClampedArray\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar table = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns an unsigned integer typed array constructor.\n*\n* @param {string} dtype - data type\n* @returns {(Function|null)} constructor or null\n*\n* @example\n* var ctor = ctors( 'uint32' );\n* // returns <Function>\n*\n* @example\n* var ctor = ctors( 'uint' );\n* // returns null\n*/\nfunction ctors( dtype ) {\n\treturn table[ dtype ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Unsigned integer typed array constructors.\n*\n* @module @stdlib/array/typed-unsigned-integer-ctors\n*\n* @example\n* var ctors = require( '@stdlib/array/typed-unsigned-integer-ctors' );\n*\n* var ctor = ctors( 'uint32' );\n* // returns <Function>\n*\n* ctor = ctors( 'uint' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "[\n\t\"uint16\",\n\t\"uint32\",\n\t\"uint8\",\n\t\"uint8c\"\n]\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar DTYPES = require( './dtypes.json' );\n\n\n// MAIN //\n\n/**\n* Returns a list of typed array unsigned integer data types.\n*\n* @returns {StringArray} list of typed array unsigned integer data types\n*\n* @example\n* var list = dtypes();\n* // e.g., returns [ 'uint16', 'uint32', 'uint8', 'uint8c' ]\n*/\nfunction dtypes() {\n\treturn DTYPES.slice();\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtypes;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a list of typed array unsigned integer data types.\n*\n* @module @stdlib/array/typed-unsigned-integer-dtypes\n*\n* @example\n* var dtypes = require( '@stdlib/array/typed-unsigned-integer-dtypes' );\n*\n* var list = dtypes();\n* // e.g., returns [ 'uint16', 'uint32', 'uint8', 'uint8c' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;\nvar base = require( './../../base/zero-to' );\nvar zeros = require( './../../zeros' );\nvar defaults = require( './../../defaults' );\nvar format = require( '@stdlib/string/format' );\n\n\n// VARIABLES //\n\nvar DEFAULT_DTYPE = defaults.get( 'dtypes.default' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1 starting from zero.\n*\n* @param {NonNegativeInteger} n - number of elements\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be a nonnegative integer\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = zeroTo( 2 );\n* // returns <Float64Array>[ 0.0, 1.0 ]\n*\n* @example\n* var arr = zeroTo( 2, 'float32' );\n* // returns <Float32Array>[ 0.0, 1.0 ]\n*/\nfunction zeroTo( n ) {\n\tvar dtype;\n\tif ( !isNonNegativeInteger( n ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a nonnegative integer. Value: `%s`.', n ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdtype = arguments[ 1 ];\n\t\tif ( dtype === 'generic' ) {\n\t\t\treturn base( n );\n\t\t}\n\t} else {\n\t\tdtype = DEFAULT_DTYPE;\n\t}\n\treturn base.assign( zeros( n, dtype ), 1, 0 ); // defer dtype validation to `zeros`\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeroTo;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1 starting from zero.\n*\n* @module @stdlib/array/zero-to\n*\n* @example\n* var zeroTo = require( '@stdlib/array/zero-to' );\n*\n* var arr = zeroTo( 2 );\n* // returns <Float64Array>[ 0.0, 1.0 ]\n*\n* @example\n* var zeroTo = require( '@stdlib/array/zero-to' );\n*\n* var arr = zeroTo( 2, 'float32' );\n* // returns <Float32Array>[ 0.0, 1.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar zeroTo = require( './../../zero-to' );\nvar dtype = require( './../../dtype' );\nvar format = require( '@stdlib/string/format' );\n\n\n// MAIN //\n\n/**\n* Generates a linearly spaced numeric array whose elements increment by 1 starting from zero and having the same length and data type as a provided input array.\n*\n* @param {(TypedArray|Array|ComplexArray)} x - input array\n* @param {string} [dtype=\"float64\"] - data type\n* @throws {TypeError} first argument must be an array or typed array\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = zeroToLike( [ 0.0, 0.0 ] );\n* // returns [ 0.0, 1.0 ]\n*\n* @example\n* var arr = zeroToLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ 0.0, 1.0 ]\n*/\nfunction zeroToLike( x ) {\n\tvar dt = dtype( x ); // delegate input argument validation to dtype resolution\n\tif ( dt === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.', x ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdt = arguments[ 1 ];\n\t}\n\treturn zeroTo( x.length, dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeroToLike;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate a linearly spaced numeric array whose elements increment by 1 starting from zero and having the same length and data type as a provided input array.\n*\n* @module @stdlib/array/zero-to-like\n*\n* @example\n* var zeroToLike = require( '@stdlib/array/zero-to-like' );\n*\n* var arr = zeroToLike( [ 0.0, 0.0 ] );\n* // returns [ 0.0, 1.0 ]\n*\n* @example\n* var zeroToLike = require( '@stdlib/array/zero-to-like' );\n*\n* var arr = zeroToLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ 0.0, 1.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar format = require( '@stdlib/string/format' );\nvar dtype = require( './../../dtype' );\nvar zeros = require( './../../zeros' );\n\n\n// MAIN //\n\n/**\n* Creates a zero-filled array having the same length and data type as a provided input array.\n*\n* @param {(Array|TypedArray|ComplexArray)} x - input array\n* @param {string} [dtype] - data type\n* @throws {TypeError} first argument must be an array or typed array\n* @throws {TypeError} second argument must be a recognized data type\n* @returns {(TypedArray|Array|ComplexArray)} array or typed array\n*\n* @example\n* var arr = zerosLike( [ 0.0, 0.0 ] );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* var arr = zerosLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*/\nfunction zerosLike( x ) {\n\tvar dt = dtype( x ); // delegate input argument validation to dtype resolution\n\tif ( dt === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be either an array, typed array, or complex typed array. Value: `%s`.', x ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tdt = arguments[ 1 ];\n\t}\n\treturn zeros( x.length, dt );\n}\n\n\n// EXPORTS //\n\nmodule.exports = zerosLike;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a zero-filled array having the same length and data type as a provided input array.\n*\n* @module @stdlib/array/zeros-like\n*\n* @example\n* var zerosLike = require( '@stdlib/array/zeros-like' );\n*\n* var arr = zerosLike( [ 0.0, 0.0 ] );\n* // returns [ 0.0, 0.0 ]\n*\n* @example\n* var zerosLike = require( '@stdlib/array/zeros-like' );\n*\n* var arr = zerosLike( [ 0.0, 0.0 ], 'float32' );\n* // returns <Float32Array>[ 0.0, 0.0 ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/*\n* When adding modules to the namespace, ensure that they are added in alphabetical order according to module name.\n*/\n\n/*\n* The following modules are intentionally not exported: generic\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils/define-read-only-property' );\n\n\n// MAIN //\n\n/**\n* Top-level namespace.\n*\n* @namespace ns\n*/\nvar ns = {};\n\n/**\n* @name base\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/array/base}\n*/\nsetReadOnly( ns, 'base', require( './../base' ) );\n\n/**\n* @name ArrayBuffer\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/buffer}\n*/\nsetReadOnly( ns, 'ArrayBuffer', require( './../buffer' ) );\n\n/**\n* @name acartesianPower\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/cartesian-power}\n*/\nsetReadOnly( ns, 'acartesianPower', require( './../cartesian-power' ) );\n\n/**\n* @name acartesianProduct\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/cartesian-product}\n*/\nsetReadOnly( ns, 'acartesianProduct', require( './../cartesian-product' ) );\n\n/**\n* @name acartesianSquare\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/cartesian-square}\n*/\nsetReadOnly( ns, 'acartesianSquare', require( './../cartesian-square' ) );\n\n/**\n* @name Complex64Array\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/complex64}\n*/\nsetReadOnly( ns, 'Complex64Array', require( './../complex64' ) );\n\n/**\n* @name Complex128Array\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/complex128}\n*/\nsetReadOnly( ns, 'Complex128Array', require( './../complex128' ) );\n\n/**\n* @name convertArray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/convert}\n*/\nsetReadOnly( ns, 'convertArray', require( './../convert' ) );\n\n/**\n* @name convertArraySame\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/convert-same}\n*/\nsetReadOnly( ns, 'convertArraySame', require( './../convert-same' ) );\n\n/**\n* @name arrayCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/ctors}\n*/\nsetReadOnly( ns, 'arrayCtors', require( './../ctors' ) );\n\n/**\n* @name DataView\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/dataview}\n*/\nsetReadOnly( ns, 'DataView', require( './../dataview' ) );\n\n/**\n* @name datespace\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/datespace}\n*/\nsetReadOnly( ns, 'datespace', require( './../datespace' ) );\n\n/**\n* @name arrayDefaults\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/defaults}\n*/\nsetReadOnly( ns, 'arrayDefaults', require( './../defaults' ) );\n\n/**\n* @name arrayDataType\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/dtype}\n*/\nsetReadOnly( ns, 'arrayDataType', require( './../dtype' ) );\n\n/**\n* @name arrayDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/dtypes}\n*/\nsetReadOnly( ns, 'arrayDataTypes', require( './../dtypes' ) );\n\n/**\n* @name aempty\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/empty}\n*/\nsetReadOnly( ns, 'aempty', require( './../empty' ) );\n\n/**\n* @name aemptyLike\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/empty-like}\n*/\nsetReadOnly( ns, 'aemptyLike', require( './../empty-like' ) );\n\n/**\n* @name filledarray\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/filled}\n*/\nsetReadOnly( ns, 'filledarray', require( './../filled' ) );\n\n/**\n* @name filledarrayBy\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/filled-by}\n*/\nsetReadOnly( ns, 'filledarrayBy', require( './../filled-by' ) );\n\n/**\n* @name Float32Array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/float32}\n*/\nsetReadOnly( ns, 'Float32Array', require( './../float32' ) );\n\n/**\n* @name Float64Array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/float64}\n*/\nsetReadOnly( ns, 'Float64Array', require( './../float64' ) );\n\n/**\n* @name iterator2array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/from-iterator}\n*/\nsetReadOnly( ns, 'iterator2array', require( './../from-iterator' ) );\n\n/**\n* @name afull\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/full}\n*/\nsetReadOnly( ns, 'afull', require( './../full' ) );\n\n/**\n* @name afullLike\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/full-like}\n*/\nsetReadOnly( ns, 'afullLike', require( './../full-like' ) );\n\n/**\n* @name incrspace\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/incrspace}\n*/\nsetReadOnly( ns, 'incrspace', require( './../incrspace' ) );\n\n/**\n* @name Int8Array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/int8}\n*/\nsetReadOnly( ns, 'Int8Array', require( './../int8' ) );\n\n/**\n* @name Int16Array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/int16}\n*/\nsetReadOnly( ns, 'Int16Array', require( './../int16' ) );\n\n/**\n* @name Int32Array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/int32}\n*/\nsetReadOnly( ns, 'Int32Array', require( './../int32' ) );\n\n/**\n* @name linspace\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/linspace}\n*/\nsetReadOnly( ns, 'linspace', require( './../linspace' ) );\n\n/**\n* @name logspace\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/logspace}\n*/\nsetReadOnly( ns, 'logspace', require( './../logspace' ) );\n\n/**\n* @name arrayMinDataType\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/min-dtype}\n*/\nsetReadOnly( ns, 'arrayMinDataType', require( './../min-dtype' ) );\n\n/**\n* @name anans\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/nans}\n*/\nsetReadOnly( ns, 'anans', require( './../nans' ) );\n\n/**\n* @name anansLike\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/nans-like}\n*/\nsetReadOnly( ns, 'anansLike', require( './../nans-like' ) );\n\n/**\n* @name arrayNextDataType\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/next-dtype}\n*/\nsetReadOnly( ns, 'arrayNextDataType', require( './../next-dtype' ) );\n\n/**\n* @name aoneTo\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/one-to}\n*/\nsetReadOnly( ns, 'aoneTo', require( './../one-to' ) );\n\n/**\n* @name aoneToLike\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/one-to-like}\n*/\nsetReadOnly( ns, 'aoneToLike', require( './../one-to-like' ) );\n\n/**\n* @name aones\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/ones}\n*/\nsetReadOnly( ns, 'aones', require( './../ones' ) );\n\n/**\n* @name aonesLike\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/ones-like}\n*/\nsetReadOnly( ns, 'aonesLike', require( './../ones-like' ) );\n\n/**\n* @name typedarraypool\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/pool}\n*/\nsetReadOnly( ns, 'typedarraypool', require( './../pool' ) );\n\n/**\n* @name arrayPromotionRules\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/promotion-rules}\n*/\nsetReadOnly( ns, 'arrayPromotionRules', require( './../promotion-rules' ) );\n\n/**\n* @name reviveTypedArray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/reviver}\n*/\nsetReadOnly( ns, 'reviveTypedArray', require( './../reviver' ) );\n\n/**\n* @name arraySafeCasts\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/safe-casts}\n*/\nsetReadOnly( ns, 'arraySafeCasts', require( './../safe-casts' ) );\n\n/**\n* @name arraySameKindCasts\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/same-kind-casts}\n*/\nsetReadOnly( ns, 'arraySameKindCasts', require( './../same-kind-casts' ) );\n\n/**\n* @name arrayShape\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/shape}\n*/\nsetReadOnly( ns, 'arrayShape', require( './../shape' ) );\n\n/**\n* @name SharedArrayBuffer\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/shared-buffer}\n*/\nsetReadOnly( ns, 'SharedArrayBuffer', require( './../shared-buffer' ) );\n\n/**\n* @name aslice\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/slice}\n*/\nsetReadOnly( ns, 'aslice', require( './../slice' ) );\n\n/**\n* @name circarray2iterator\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-circular-iterator}\n*/\nsetReadOnly( ns, 'circarray2iterator', require( './../to-circular-iterator' ) );\n\n/**\n* @name array2iterator\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-iterator}\n*/\nsetReadOnly( ns, 'array2iterator', require( './../to-iterator' ) );\n\n/**\n* @name array2iteratorRight\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-iterator-right}\n*/\nsetReadOnly( ns, 'array2iteratorRight', require( './../to-iterator-right' ) );\n\n/**\n* @name typedarray2json\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-json}\n*/\nsetReadOnly( ns, 'typedarray2json', require( './../to-json' ) );\n\n/**\n* @name sparsearray2iterator\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-sparse-iterator}\n*/\nsetReadOnly( ns, 'sparsearray2iterator', require( './../to-sparse-iterator' ) );\n\n/**\n* @name sparsearray2iteratorRight\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-sparse-iterator-right}\n*/\nsetReadOnly( ns, 'sparsearray2iteratorRight', require( './../to-sparse-iterator-right' ) );\n\n/**\n* @name stridedarray2iterator\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-strided-iterator}\n*/\nsetReadOnly( ns, 'stridedarray2iterator', require( './../to-strided-iterator' ) );\n\n/**\n* @name arrayview2iterator\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-view-iterator}\n*/\nsetReadOnly( ns, 'arrayview2iterator', require( './../to-view-iterator' ) );\n\n/**\n* @name arrayview2iteratorRight\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/to-view-iterator-right}\n*/\nsetReadOnly( ns, 'arrayview2iteratorRight', require( './../to-view-iterator-right' ) );\n\n/**\n* @name typedarray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed}\n*/\nsetReadOnly( ns, 'typedarray', require( './../typed' ) );\n\n/**\n* @name complexarray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-complex}\n*/\nsetReadOnly( ns, 'complexarray', require( './../typed-complex' ) );\n\n/**\n* @name complexarrayCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-complex-ctors}\n*/\nsetReadOnly( ns, 'complexarrayCtors', require( './../typed-complex-ctors' ) );\n\n/**\n* @name complexarrayDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-complex-dtypes}\n*/\nsetReadOnly( ns, 'complexarrayDataTypes', require( './../typed-complex-dtypes' ) );\n\n/**\n* @name typedarrayCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-ctors}\n*/\nsetReadOnly( ns, 'typedarrayCtors', require( './../typed-ctors' ) );\n\n/**\n* @name typedarrayDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-dtypes}\n*/\nsetReadOnly( ns, 'typedarrayDataTypes', require( './../typed-dtypes' ) );\n\n/**\n* @name floatarrayCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-float-ctors}\n*/\nsetReadOnly( ns, 'floatarrayCtors', require( './../typed-float-ctors' ) );\n\n/**\n* @name floatarrayDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-float-dtypes}\n*/\nsetReadOnly( ns, 'floatarrayDataTypes', require( './../typed-float-dtypes' ) );\n\n/**\n* @name intarrayCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-integer-ctors}\n*/\nsetReadOnly( ns, 'intarrayCtors', require( './../typed-integer-ctors' ) );\n\n/**\n* @name intarrayDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-integer-dtypes}\n*/\nsetReadOnly( ns, 'intarrayDataTypes', require( './../typed-integer-dtypes' ) );\n\n/**\n* @name realarray\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-real}\n*/\nsetReadOnly( ns, 'realarray', require( './../typed-real' ) );\n\n/**\n* @name realarrayCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-real-ctors}\n*/\nsetReadOnly( ns, 'realarrayCtors', require( './../typed-real-ctors' ) );\n\n/**\n* @name realarrayDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-real-dtypes}\n*/\nsetReadOnly( ns, 'realarrayDataTypes', require( './../typed-real-dtypes' ) );\n\n/**\n* @name realarrayFloatCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-real-float-ctors}\n*/\nsetReadOnly( ns, 'realarrayFloatCtors', require( './../typed-real-float-ctors' ) );\n\n/**\n* @name realarrayFloatDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-real-float-dtypes}\n*/\nsetReadOnly( ns, 'realarrayFloatDataTypes', require( './../typed-real-float-dtypes' ) );\n\n/**\n* @name intarraySignedCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-signed-integer-ctors}\n*/\nsetReadOnly( ns, 'intarraySignedCtors', require( './../typed-signed-integer-ctors' ) );\n\n/**\n* @name intarraySignedDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-signed-integer-dtypes}\n*/\nsetReadOnly( ns, 'intarraySignedDataTypes', require( './../typed-signed-integer-dtypes' ) );\n\n/**\n* @name intarrayUnsignedCtors\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-unsigned-integer-ctors}\n*/\nsetReadOnly( ns, 'intarrayUnsignedCtors', require( './../typed-unsigned-integer-ctors' ) );\n\n/**\n* @name intarrayUnsignedDataTypes\n* @memberof ns\n* @readonly\n* @type {Function}\n* @see {@link module:@stdlib/array/typed-unsigned-integer-dtypes}\n*/\nsetReadOnly( ns, 'intarrayUnsignedDataTypes', require( './../typed-unsigned-integer-dtypes' ) );\n\n/**\n* @name Uint8Array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/uint8}\n*/\nsetReadOnly( ns, 'Uint8Array', require( './../uint8' ) );\n\n/**\n* @name Uint8ClampedArray\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/uint8c}\n*/\nsetReadOnly( ns, 'Uint8ClampedArray', require( './../uint8c' ) );\n\n/**\n* @name Uint16Array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/uint16}\n*/\nsetReadOnly( ns, 'Uint16Array', require( './../uint16' ) );\n\n/**\n* @name Uint32Array\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/uint32}\n*/\nsetReadOnly( ns, 'Uint32Array', require( './../uint32' ) );\n\n/**\n* @name azeroTo\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/zero-to}\n*/\nsetReadOnly( ns, 'azeroTo', require( './../zero-to' ) );\n\n/**\n* @name azeroToLike\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/zero-to-like}\n*/\nsetReadOnly( ns, 'azeroToLike', require( './../zero-to-like' ) );\n\n/**\n* @name azeros\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/zeros}\n*/\nsetReadOnly( ns, 'azeros', require( './../zeros' ) );\n\n/**\n* @name azerosLike\n* @memberof ns\n* @readonly\n* @constructor\n* @see {@link module:@stdlib/array/zeros-like}\n*/\nsetReadOnly( ns, 'azerosLike', require( './../zeros-like' ) );\n\n/**\n* @name constants\n* @memberof ns\n* @readonly\n* @type {Namespace}\n* @see {@link module:@stdlib/constants/array}\n*/\nsetReadOnly( ns, 'constants', require( '@stdlib/constants/array' ) );\n\n\n// EXPORTS //\n\nmodule.exports = ns;\n"],
-  "mappings": "uGAAA,IAAAA,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAO,WAqBX,SAASC,GAAiBC,EAAQ,CACjC,OAAS,OAAOA,EAAM,MAAQF,IAAQ,OAAOE,EAAM,MAAQF,EAC5D,CAKAD,GAAO,QAAUE,KClDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,CACb,QAAWC,GACX,QAAWC,GACX,MAASC,GACT,MAASC,GACT,KAAQC,GACR,OAAUC,GACV,OAAUC,GACV,MAASC,GACT,OAAUC,GACV,QAAWC,GACX,QAAWC,EACZ,EAqBA,SAASV,GAAYW,EAAKC,EAAM,CAC/B,OAAOD,EAAKC,CAAI,CACjB,CAkBA,SAASX,GAAYU,EAAKC,EAAM,CAC/B,OAAOD,EAAKC,CAAI,CACjB,CAkBA,SAASV,GAAUS,EAAKC,EAAM,CAC7B,OAAOD,EAAKC,CAAI,CACjB,CAkBA,SAAST,GAAUQ,EAAKC,EAAM,CAC7B,OAAOD,EAAKC,CAAI,CACjB,CAkBA,SAASR,GAASO,EAAKC,EAAM,CAC5B,OAAOD,EAAKC,CAAI,CACjB,CAkBA,SAASP,GAAWM,EAAKC,EAAM,CAC9B,OAAOD,EAAKC,CAAI,CACjB,CAkBA,SAASN,GAAWK,EAAKC,EAAM,CAC9B,OAAOD,EAAKC,CAAI,CACjB,CAkBA,SAASL,GAAUI,EAAKC,EAAM,CAC7B,OAAOD,EAAKC,CAAI,CACjB,CAkBA,SAASJ,GAAWG,EAAKC,EAAM,CAC9B,OAAOD,EAAKC,CAAI,CACjB,CAgBA,SAASH,GAAYE,EAAKC,EAAM,CAC/B,OAAOD,EAAKC,CAAI,CACjB,CAgBA,SAASF,GAAcC,EAAKC,EAAM,CACjC,OAAOD,EAAKC,CAAI,CACjB,CAoBA,SAASC,GAAQC,EAAQ,CACxB,IAAIC,EAAIhB,GAASe,CAAM,EACvB,OAAK,OAAOC,GAAM,WACVA,EAEDhB,GAAQ,OAChB,CAKAD,GAAO,QAAUe,KC5RjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,CACb,QAAWC,GACX,QAAWC,GACX,MAASC,GACT,MAASC,GACT,KAAQC,GACR,OAAUC,GACV,OAAUC,GACV,MAASC,GACT,OAAUC,GACV,QAAWC,GACX,QAAWC,EACZ,EAuBA,SAASV,GAAYW,EAAKC,EAAKC,EAAQ,CACtCF,EAAKC,CAAI,EAAIC,CACd,CAoBA,SAASZ,GAAYU,EAAKC,EAAKC,EAAQ,CACtCF,EAAKC,CAAI,EAAIC,CACd,CAoBA,SAASX,GAAUS,EAAKC,EAAKC,EAAQ,CACpCF,EAAKC,CAAI,EAAIC,CACd,CAoBA,SAASV,GAAUQ,EAAKC,EAAKC,EAAQ,CACpCF,EAAKC,CAAI,EAAIC,CACd,CAoBA,SAAST,GAASO,EAAKC,EAAKC,EAAQ,CACnCF,EAAKC,CAAI,EAAIC,CACd,CAoBA,SAASR,GAAWM,EAAKC,EAAKC,EAAQ,CACrCF,EAAKC,CAAI,EAAIC,CACd,CAoBA,SAASP,GAAWK,EAAKC,EAAKC,EAAQ,CACrCF,EAAKC,CAAI,EAAIC,CACd,CAoBA,SAASN,GAAUI,EAAKC,EAAKC,EAAQ,CACpCF,EAAKC,CAAI,EAAIC,CACd,CAoBA,SAASL,GAAWG,EAAKC,EAAKC,EAAQ,CACrCF,EAAKC,CAAI,EAAIC,CACd,CAkBA,SAASJ,GAAYE,EAAKC,EAAKC,EAAQ,CACtCF,EAAKC,CAAI,EAAIC,CACd,CAkBA,SAASH,GAAcC,EAAKC,EAAKC,EAAQ,CACxCF,EAAKC,CAAI,EAAIC,CACd,CAsBA,SAASC,GAAQC,EAAQ,CACxB,IAAIC,EAAIjB,GAASgB,CAAM,EACvB,OAAK,OAAOC,GAAM,WACVA,EAEDjB,GAAQ,OAChB,CAKAD,GAAO,QAAUgB,KCpTjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,CACb,WAAcC,GACd,UAAaC,GACb,QAAWC,EACZ,EA6BA,SAASF,GAAeG,EAAKC,EAAM,CAClC,OAAOD,EAAI,IAAKC,CAAI,CACrB,CA0BA,SAASH,GAAcE,EAAKC,EAAM,CACjC,OAAOD,EAAI,IAAKC,CAAI,CACrB,CA2BA,SAASF,GAAcC,EAAKC,EAAM,CACjC,OAAOD,EAAI,IAAKC,CAAI,CACrB,CA6BA,SAASC,GAAQC,EAAQ,CACxB,IAAIC,EAAIR,GAASO,CAAM,EACvB,OAAK,OAAOC,GAAM,WACVA,EAEDR,GAAQ,OAChB,CAKAD,GAAO,QAAUO,KC1JjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,CACb,WAAcC,GACd,UAAaC,GACb,QAAWC,EACZ,EA+BA,SAASF,GAAeG,EAAKC,EAAKC,EAAQ,CACzCF,EAAI,IAAKE,EAAOD,CAAI,CACrB,CA4BA,SAASH,GAAcE,EAAKC,EAAKC,EAAQ,CACxCF,EAAI,IAAKE,EAAOD,CAAI,CACrB,CA6BA,SAASF,GAAcC,EAAKC,EAAKC,EAAQ,CACxCF,EAAI,IAAKE,EAAOD,CAAI,CACrB,CAgCA,SAASE,GAAQC,EAAQ,CACxB,IAAIC,EAAIT,GAASQ,CAAM,EACvB,OAAK,OAAOC,GAAM,WACVA,EAEDT,GAAQ,OAChB,CAKAD,GAAO,QAAUQ,KCnKjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuBA,IAAIC,GAAc,CACjB,aAAgB,UAChB,aAAgB,UAChB,MAAS,UACT,WAAc,QACd,WAAc,QACd,UAAa,OACb,YAAe,SACf,YAAe,SACf,WAAc,QACd,kBAAqB,SACrB,eAAkB,YAClB,gBAAmB,YACpB,EAKAD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,cAAiB,WAAe,aAAe,OAKnED,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAyB,QAAS,yCAA0C,EAC5EC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAuB,EAC3BG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,cAAiB,WAAe,aAAe,OAKnED,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAyB,QAAS,yCAA0C,EAC5EC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAuB,EAC3BG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,aAAgB,WAAe,YAAc,OAKjED,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAwB,QAAS,wCAAyC,EAC1EC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAsB,EAC1BG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,YAAe,WAAe,WAAa,OAK/DD,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAuB,QAAS,uCAAwC,EACxEC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAqB,EACzBG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,aAAgB,WAAe,YAAc,OAKjED,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAwB,QAAS,wCAAyC,EAC1EC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAsB,EAC1BG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,YAAe,WAAe,WAAa,OAK/DD,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAuB,QAAS,uCAAwC,EACxEC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAqB,EACzBG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,YAAe,WAAe,WAAa,OAK/DD,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAuB,QAAS,uCAAwC,EACxEC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAqB,EACzBG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,mBAAsB,WAAe,kBAAoB,OAK7ED,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAA8B,QAAS,8CAA+C,EACtFC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAA4B,EAChCG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,WAAc,WAAe,UAAY,OAK7DD,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAsB,QAAS,sCAAuC,EACtEC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAoB,EACxBG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,EAoBxB,SAASC,GAAkBC,EAAQ,CAElC,OACC,OAAOA,GAAU,UACjBA,IAAU,MACVA,EAAM,YAAY,OAAS,kBAC3BA,EAAM,oBAAsBF,EAE9B,CAKAD,GAAO,QAAUE,KCvDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,GAoBxB,SAASC,GAAmBC,EAAQ,CAEnC,OACC,OAAOA,GAAU,UACjBA,IAAU,MACVA,EAAM,YAAY,OAAS,mBAC3BA,EAAM,oBAAsBF,EAE9B,CAKAD,GAAO,QAAUE,KCvDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,QAAS,qCAAsC,EACnEC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,QAAS,uBAAwB,EACzCC,GAAS,QAAS,uBAAwB,EAY9C,SAASC,GAAcC,EAAK,CAC3B,IAAIC,EACAC,EACAC,EAGJ,IADAF,EAAM,CAAC,EAENC,EAAIF,EAAG,KAAK,EACP,CAAAE,EAAE,MAIP,GADAC,EAAID,EAAE,MACDR,GAAmBS,CAAE,GAAKA,EAAE,QAAU,EAC1CF,EAAI,KAAME,EAAG,CAAE,EAAGA,EAAG,CAAE,CAAE,UACdR,GAAeQ,CAAE,EAC5BF,EAAI,KAAML,GAAOO,CAAE,EAAGN,GAAOM,CAAE,CAAE,MAEjC,QAAO,IAAI,UAAWL,GAAQ,kJAAmJK,CAAE,CAAE,EAGvL,OAAOF,CACR,CAKAR,GAAO,QAAUM,KChEjB,IAAAK,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,QAAS,qCAAsC,EACnEC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,QAAS,uBAAwB,EACzCC,GAAS,QAAS,uBAAwB,EAc9C,SAASC,GAAiBC,EAAIC,EAAMC,EAAU,CAC7C,IAAIC,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAM,CAAC,EACPG,EAAI,GAEHF,EAAIJ,EAAG,KAAK,EACP,CAAAI,EAAE,MAKP,GAFAE,GAAK,EACLD,EAAIJ,EAAK,KAAMC,EAASE,EAAE,MAAOE,CAAE,EAC9BZ,GAAmBW,CAAE,GAAKA,EAAE,QAAU,EAC1CF,EAAI,KAAME,EAAG,CAAE,EAAGA,EAAG,CAAE,CAAE,UACdV,GAAeU,CAAE,EAC5BF,EAAI,KAAMP,GAAOS,CAAE,EAAGR,GAAOQ,CAAE,CAAE,MAEjC,QAAO,IAAI,UAAWP,GAAQ,+IAAgJO,CAAE,CAAE,EAGpL,OAAOF,CACR,CAKAV,GAAO,QAAUM,KCrEjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,QAAS,uBAAwB,EAa7C,SAASC,GAAWC,EAAKC,EAAM,CAC9B,IAAIC,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAMD,EAAI,OACVI,EAAI,EACED,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAE3B,GADAD,EAAIF,EAAKG,CAAE,EACN,CAACR,GAAeO,CAAE,EACtB,OAAO,KAERH,EAAKK,CAAE,EAAIR,GAAOM,CAAE,EACpBH,EAAKK,EAAE,CAAE,EAAIP,GAAOK,CAAE,EACtBE,GAAK,CACN,CACA,OAAOL,CACR,CAKAL,GAAO,QAAUI,KC5DjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAoB,QAAS,qCAAsC,EACnEC,GAAe,QAAS,8BAA+B,EACvDC,GAAgB,QAAS,+BAAgC,EACzDC,GAAW,QAAS,0BAA2B,EAC/CC,GAAU,QAAS,yBAA0B,EAC7CC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAa,QAAS,4BAA6B,EACnDC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAS,QAAS,kCAAmC,EACrDC,GAAY,QAAS,qCAAsC,EAC3DC,GAAmB,KACnBC,GAAoB,KACpBC,GAA2B,QAAS,4CAA6C,EACjFC,GAAkB,QAAS,yBAA0B,EACrDC,EAAc,QAAS,uDAAwD,EAC/EC,GAAsB,QAAS,uDAAwD,EACvFC,GAAe,KACfC,GAAY,QAAS,yBAA0B,EAC/CC,EAAS,QAAS,uBAAwB,EAC1CC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,QAAS,iCAAkC,EACnDC,GAAgB,QAAS,4CAA6C,EACtEC,GAAiB,QAAS,6CAA8C,EACxEC,GAAS,KACTC,GAAiB,KACjBC,GAAe,KACfC,GAAkB,KAClBC,GAAY,KAKZC,GAAoBb,GAAa,kBAAoB,EACrDc,GAAsBlB,GAAyB,EAYnD,SAASmB,EAAgBC,EAAQ,CAChC,OACCA,aAAiBC,GAEhB,OAAOD,GAAU,UACjBA,IAAU,OAETA,EAAM,YAAY,OAAS,kBAC3BA,EAAM,YAAY,OAAS,oBAE5B,OAAOA,EAAM,SAAY,UAGzB,OAAOA,EAAM,SAAY,QAG5B,CASA,SAASE,GAA2BF,EAAQ,CAC3C,OACCA,IAAUC,GAGVD,EAAM,OAAS,iBAEjB,CAUA,SAASG,GAAcC,EAAKC,EAAM,CACjC,OAAAA,GAAO,EACA,IAAIpB,GAAWmB,EAAKC,CAAI,EAAGD,EAAKC,EAAI,CAAE,CAAE,CAChD,CAyEA,SAASJ,GAAiB,CACzB,IAAIK,EACAC,EACAH,EACAI,EAGJ,GADAD,EAAQ,UAAU,OACb,EAAE,gBAAgBN,GACtB,OAAKM,IAAU,EACP,IAAIN,EAEPM,IAAU,EACP,IAAIN,EAAgB,UAAU,CAAC,CAAE,EAEpCM,IAAU,EACP,IAAIN,EAAgB,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAEhD,IAAIA,EAAgB,UAAU,CAAC,EAAG,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAGrE,GAAKM,IAAU,EACdH,EAAM,IAAIpB,GAAc,CAAE,UACfuB,IAAU,EACrB,GAAKxC,GAAsB,UAAU,CAAC,CAAE,EACvCqC,EAAM,IAAIpB,GAAc,UAAU,CAAC,EAAE,CAAE,UAC5Bf,GAAc,UAAU,CAAC,CAAE,EAKtC,GAJAmC,EAAM,UAAW,CAAE,EACnBI,EAAMJ,EAAI,OAGLI,GAAOpC,GAASgC,CAAI,GAAK7B,GAAe6B,EAAI,CAAC,CAAE,GAEnD,GADAA,EAAMR,GAAW,IAAIZ,GAAcwB,EAAI,CAAE,EAAGJ,CAAI,EAC3CA,IAAQ,KAAO,CAEnB,GAAK,CAAC5B,GAAQgC,CAAI,EACjB,MAAM,IAAI,WAAYtB,EAAQ,6GAA8GsB,CAAI,CAAE,EAGnJJ,EAAM,IAAIpB,GAAc,UAAU,CAAC,CAAE,CACtC,MACM,CACN,GAAKN,GAAkB0B,CAAI,EAC1BA,EAAMd,GAAec,EAAK,CAAE,UACjBzB,GAAmByB,CAAI,EAClCA,EAAMb,GAAgBa,EAAK,CAAE,UAClB,CAAC5B,GAAQgC,CAAI,EACxB,MAAM,IAAI,WAAYtB,EAAQ,6HAA8HsB,CAAI,CAAE,EAEnKJ,EAAM,IAAIpB,GAAcoB,CAAI,CAC7B,SACWlC,GAAe,UAAU,CAAC,CAAE,EAAI,CAE3C,GADAkC,EAAM,UAAW,CAAE,EACd,CAAC3B,GAAW2B,EAAI,WAAWP,EAAkB,EACjD,MAAM,IAAI,WAAYX,EAAQ,yFAA0FW,GAAmBO,EAAI,UAAW,CAAE,EAE7JA,EAAM,IAAIpB,GAAcoB,CAAI,CAC7B,SAAYjC,GAAU,UAAU,CAAC,CAAE,EAAI,CAEtC,GADAiC,EAAM,UAAW,CAAE,EACdN,KAAwB,GAC5B,MAAM,IAAI,UAAWZ,EAAQ,mJAAoJkB,CAAI,CAAE,EAExL,GAAK,CAAC9B,GAAY8B,EAAKvB,EAAgB,CAAE,EACxC,MAAM,IAAI,UAAWK,EAAQ,qHAAsHkB,CAAI,CAAE,EAG1J,GADAA,EAAMA,EAAKvB,EAAgB,EAAE,EACxB,CAACP,GAAY8B,EAAI,IAAK,EAC1B,MAAM,IAAI,UAAWlB,EAAQ,qHAAsHkB,CAAI,CAAE,EAG1J,GADAA,EAAMV,GAAcU,CAAI,EACnBA,aAAe,MACnB,MAAMA,EAEPA,EAAM,IAAIpB,GAAcoB,CAAI,CAC7B,KACC,OAAM,IAAI,UAAWlB,EAAQ,qHAAsH,UAAU,CAAC,CAAE,CAAE,MAE7J,CAEN,GADAkB,EAAM,UAAW,CAAE,EACd,CAAClC,GAAekC,CAAI,EACxB,MAAM,IAAI,UAAWlB,EAAQ,wEAAyEkB,CAAI,CAAE,EAG7G,GADAE,EAAa,UAAW,CAAE,EACrB,CAACvC,GAAsBuC,CAAW,EACtC,MAAM,IAAI,UAAWpB,EAAQ,4EAA6EoB,CAAW,CAAE,EAExH,GAAK,CAAC7B,GAAW6B,EAAWT,EAAkB,EAC7C,MAAM,IAAI,WAAYX,EAAQ,uEAAwEW,GAAmBS,CAAW,CAAE,EAEvI,GAAKC,IAAU,EAAI,CAElB,GADAC,EAAMJ,EAAI,WAAaE,EAClB,CAAC7B,GAAW+B,EAAIX,EAAkB,EACtC,MAAM,IAAI,WAAYX,EAAQ,oGAAqGW,GAAmBW,CAAI,CAAE,EAE7JJ,EAAM,IAAIpB,GAAcoB,EAAKE,CAAW,CACzC,KAAO,CAEN,GADAE,EAAM,UAAW,CAAE,EACd,CAACzC,GAAsByC,CAAI,EAC/B,MAAM,IAAI,UAAWtB,EAAQ,uEAAwEsB,CAAI,CAAE,EAE5G,GAAMA,EAAIX,GAAsBO,EAAI,WAAWE,EAC9C,MAAM,IAAI,WAAYpB,EAAQ,iJAAkJsB,EAAIX,EAAkB,CAAE,EAEzMO,EAAM,IAAIpB,GAAcoB,EAAKE,EAAYE,EAAI,CAAE,CAChD,CACD,CACA,OAAA1B,EAAa,KAAM,UAAWsB,CAAI,EAClCtB,EAAa,KAAM,UAAWsB,EAAI,OAAO,CAAE,EAEpC,IACR,CAeAtB,EAAamB,EAAgB,oBAAqBJ,EAAkB,EAepEf,EAAamB,EAAgB,OAAQ,gBAAiB,EAmDtDnB,EAAamB,EAAgB,OAAQ,SAAeQ,EAAM,CACzD,IAAIC,EACAH,EACAI,EACAC,EACAR,EACAS,EACAC,EACAN,EACAO,EACAC,EACAC,EACAC,EACJ,GAAK,CAAC5C,GAAY,IAAK,EACtB,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAAC4B,GAA2B,IAAK,EACrC,MAAM,IAAI,UAAW,2DAA4D,EAGlF,GADAK,EAAQ,UAAU,OACbA,EAAQ,EAAI,CAEhB,GADAI,EAAO,UAAW,CAAE,EACf,CAACrC,GAAYqC,CAAK,EACtB,MAAM,IAAI,UAAWzB,EAAQ,qEAAsEyB,CAAK,CAAE,EAEtGJ,EAAQ,IACZG,EAAU,UAAW,CAAE,EAEzB,CACA,GAAKX,EAAgBU,CAAI,EAAI,CAE5B,GADAD,EAAMC,EAAI,OACLE,EAAO,CAIX,IAHAC,EAAM,IAAI,KAAMJ,CAAI,EACpBJ,EAAMQ,EAAI,QACVM,EAAI,EACED,EAAI,EAAGA,EAAIT,EAAKS,IAAM,CAE3B,GADAD,EAAIL,EAAK,KAAMD,EAASD,EAAI,IAAKQ,CAAE,EAAGA,CAAE,EACnC1C,GAAeyC,CAAE,EACrBZ,EAAKc,CAAE,EAAI/B,GAAO6B,CAAE,EACpBZ,EAAKc,EAAE,CAAE,EAAI9B,GAAO4B,CAAE,UACXhD,GAAmBgD,CAAE,GAAKA,EAAE,QAAU,EACjDZ,EAAKc,CAAE,EAAIF,EAAG,CAAE,EAChBZ,EAAKc,EAAE,CAAE,EAAIF,EAAG,CAAE,MAElB,OAAM,IAAI,UAAW9B,EAAQ,+IAAgJ8B,CAAE,CAAE,EAElLE,GAAK,CACN,CACA,OAAON,CACR,CACA,OAAO,IAAI,KAAMH,CAAI,CACtB,CACA,GAAKxC,GAAcwC,CAAI,EAAI,CAC1B,GAAKE,EAAO,CAUX,IAPAH,EAAMC,EAAI,OACLA,EAAI,KAAOA,EAAI,IACnBK,EAAMrB,GAAgB,SAAU,EAEhCqB,EAAMtB,GAAQ,SAAU,EAGnByB,EAAI,EAAGA,EAAIT,EAAKS,IACrB,GAAK,CAAC1C,GAAeuC,EAAKL,EAAKQ,CAAE,CAAE,EAAI,CACtCF,EAAM,GACN,KACD,CAGD,GAAKA,EAAM,CACV,GAAK,CAACvC,GAAQgC,CAAI,EACjB,MAAM,IAAI,WAAYtB,EAAQ,+FAAgG,EAAGsB,CAAI,CAAE,EAIxI,IAFAI,EAAM,IAAI,KAAMJ,EAAI,CAAE,EACtBJ,EAAMQ,EAAI,QACJK,EAAI,EAAGA,EAAIT,EAAKS,IACrBb,EAAKa,CAAE,EAAIN,EAAK,KAAMD,EAASI,EAAKL,EAAKQ,CAAE,EAAGA,CAAE,EAEjD,OAAOL,CACR,CAKA,IAHAA,EAAM,IAAI,KAAMJ,CAAI,EACpBJ,EAAMQ,EAAI,QACVM,EAAI,EACED,EAAI,EAAGA,EAAIT,EAAKS,IAAM,CAE3B,GADAD,EAAIL,EAAK,KAAMD,EAASI,EAAKL,EAAKQ,CAAE,EAAGA,CAAE,EACpC1C,GAAeyC,CAAE,EACrBZ,EAAKc,CAAE,EAAI/B,GAAO6B,CAAE,EACpBZ,EAAKc,EAAE,CAAE,EAAI9B,GAAO4B,CAAE,UACXhD,GAAmBgD,CAAE,GAAKA,EAAE,QAAU,EACjDZ,EAAKc,CAAE,EAAIF,EAAG,CAAE,EAChBZ,EAAKc,EAAE,CAAE,EAAIF,EAAG,CAAE,MAElB,OAAM,IAAI,UAAW9B,EAAQ,+IAAgJ8B,CAAE,CAAE,EAElLE,GAAK,CACN,CACA,OAAON,CACR,CACA,OAAO,IAAI,KAAMH,CAAI,CACtB,CACA,GAAKtC,GAAUsC,CAAI,GAAKX,IAAuBxB,GAAYmC,EAAK5B,EAAgB,CAAE,EAAI,CAErF,GADAuB,EAAMK,EAAK5B,EAAgB,EAAE,EACxB,CAACP,GAAY8B,EAAI,IAAK,EAC1B,MAAM,IAAI,UAAWlB,EAAQ,6FAA8FuB,CAAI,CAAE,EAOlI,GALKE,EACJE,EAAMlB,GAAiBS,EAAKO,EAAMD,CAAQ,EAE1CG,EAAMnB,GAAcU,CAAI,EAEpBS,aAAe,MACnB,MAAMA,EAKP,IAHAL,EAAMK,EAAI,OAAS,EACnBD,EAAM,IAAI,KAAMJ,CAAI,EACpBJ,EAAMQ,EAAI,QACJK,EAAI,EAAGA,EAAIT,EAAKS,IACrBb,EAAKa,CAAE,EAAIJ,EAAKI,CAAE,EAEnB,OAAOL,CACR,CACA,MAAM,IAAI,UAAW1B,EAAQ,6FAA8FuB,CAAI,CAAE,CAClI,CAAC,EAoBD3B,EAAamB,EAAgB,KAAM,UAAc,CAChD,IAAIkB,EACAF,EACJ,GAAK,CAAC3C,GAAY,IAAK,EACtB,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAAC4B,GAA2B,IAAK,EACrC,MAAM,IAAI,UAAW,2DAA4D,EAGlF,IADAiB,EAAO,CAAC,EACFF,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAClCE,EAAK,KAAM,UAAWF,CAAE,CAAE,EAE3B,OAAO,IAAI,KAAME,CAAK,CACvB,CAAC,EAuDDrC,EAAamB,EAAe,UAAW,KAAM,SAAaI,EAAM,CAC/D,GAAK,CAACN,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACtB,GAAW4B,CAAI,EACpB,MAAM,IAAI,UAAWnB,EAAQ,0DAA2DmB,CAAI,CAAE,EAK/F,GAHKA,EAAM,IACVA,GAAO,KAAK,SAER,EAAAA,EAAM,GAAKA,GAAO,KAAK,SAG5B,OAAOF,GAAc,KAAK,QAASE,CAAI,CACxC,CAAC,EAgBDtB,GAAqBkB,EAAe,UAAW,SAAU,UAAe,CACvE,OAAO,KAAK,QAAQ,MACrB,CAAC,EAgBDlB,GAAqBkB,EAAe,UAAW,aAAc,UAAe,CAC3E,OAAO,KAAK,QAAQ,UACrB,CAAC,EAgBDlB,GAAqBkB,EAAe,UAAW,aAAc,UAAe,CAC3E,OAAO,KAAK,QAAQ,UACrB,CAAC,EAiBDnB,EAAamB,EAAe,UAAW,oBAAqBA,EAAe,iBAAkB,EAuC7FnB,EAAamB,EAAe,UAAW,aAAc,SAAqBmB,EAAQC,EAAQ,CACzF,GAAK,CAACtB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAGlF,OAAK,UAAU,SAAW,EACzB,KAAK,QAAQ,WAAYqB,EAAO,EAAGC,EAAM,CAAE,EAE3C,KAAK,QAAQ,WAAYD,EAAO,EAAGC,EAAM,EAAG,UAAU,CAAC,EAAE,CAAE,EAErD,IACR,CAAC,EAqCDvC,EAAamB,EAAe,UAAW,UAAW,UAAmB,CACpE,IAAIqB,EACAC,EACAC,EACAhB,EACAiB,EACAR,EACAC,EACJ,GAAK,CAACnB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,OAAAwB,EAAO,KACPD,EAAS,KAAK,QACdd,EAAM,KAAK,QAGXS,EAAI,GACJC,EAAI,GAGJM,EAAO,CAAC,EACR1C,EAAa0C,EAAM,OAAQE,CAAK,EAChC5C,EAAa0C,EAAM,SAAUG,CAAI,EAE5B9C,IACJC,EAAa0C,EAAM3C,GAAiB+C,CAAQ,EAEtCJ,EAQP,SAASE,GAAO,CACf,IAAIG,EAEJ,OADAZ,GAAK,EACAQ,GAAOR,GAAKT,EACT,CACN,KAAQ,EACT,GAEDU,GAAK,EACLW,EAAI,IAAI5C,GAAWqC,EAAQJ,CAAE,EAAGI,EAAQJ,EAAE,CAAE,CAAE,EACvC,CACN,MAAS,CAAED,EAAGY,CAAE,EAChB,KAAQ,EACT,EACD,CASA,SAASF,EAAK3B,EAAQ,CAErB,OADAyB,EAAM,GACD,UAAU,OACP,CACN,MAASzB,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAAS4B,GAAU,CAClB,OAAOL,EAAK,QAAQ,CACrB,CACD,CAAC,EA+BDzC,EAAamB,EAAe,UAAW,QAAS,SAAgB6B,EAAWpB,EAAU,CACpF,IAAIN,EACAa,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAW5C,EAAQ,oEAAqE4C,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9B,GAAK,CAACa,EAAU,KAAMpB,EAASP,GAAcC,EAAKa,CAAE,EAAGA,EAAG,IAAK,EAC9D,MAAO,GAGT,MAAO,EACR,CAAC,EA0CDnC,EAAamB,EAAe,UAAW,OAAQ,SAAeD,EAAOqB,EAAOM,EAAM,CACjF,IAAIvB,EACAI,EACAH,EACA0B,EACAC,EACAf,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACxB,GAAeyB,CAAM,EAC1B,MAAM,IAAI,UAAWd,EAAQ,0EAA2Ec,CAAM,CAAE,EAIjH,GAFAI,EAAM,KAAK,QACXI,EAAM,KAAK,QACN,UAAU,OAAS,EAAI,CAC3B,GAAK,CAAC/B,GAAW4C,CAAM,EACtB,MAAM,IAAI,UAAWnC,EAAQ,qEAAsEmC,CAAM,CAAE,EAQ5G,GANKA,EAAQ,IACZA,GAASb,EACJa,EAAQ,IACZA,EAAQ,IAGL,UAAU,OAAS,EAAI,CAC3B,GAAK,CAAC5C,GAAWkD,CAAI,EACpB,MAAM,IAAI,UAAWzC,EAAQ,oEAAqEyC,CAAI,CAAE,EAEpGA,EAAM,IACVA,GAAOnB,EACFmB,EAAM,IACVA,EAAM,IAGHA,EAAMnB,IACVmB,EAAMnB,EAER,MACCmB,EAAMnB,CAER,MACCa,EAAQ,EACRM,EAAMnB,EAIP,IAFAuB,EAAK5C,GAAOa,CAAM,EAClBgC,EAAK5C,GAAOY,CAAM,EACZiB,EAAII,EAAOJ,EAAIU,EAAKV,IACzBZ,EAAM,EAAEY,EACRb,EAAKC,CAAI,EAAI0B,EACb3B,EAAKC,EAAI,CAAE,EAAI2B,EAEhB,OAAO,IACR,CAAC,EA2CDlD,EAAamB,EAAe,UAAW,SAAU,SAAiB6B,EAAWpB,EAAU,CACtF,IAAIN,EACAQ,EACAK,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAW5C,EAAQ,oEAAqE4C,CAAU,CAAE,EAI/G,IAFA1B,EAAM,KAAK,QACXQ,EAAM,CAAC,EACDK,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9BY,EAAI1B,GAAcC,EAAKa,CAAE,EACpBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,GACxCL,EAAI,KAAMiB,CAAE,EAGd,OAAO,IAAI,KAAK,YAAajB,CAAI,CAClC,CAAC,EAsCD9B,EAAamB,EAAe,UAAW,OAAQ,SAAe6B,EAAWpB,EAAU,CAClF,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAW5C,EAAQ,oEAAqE4C,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAE9B,GADAY,EAAI1B,GAAcC,EAAKa,CAAE,EACpBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,EACxC,OAAOY,CAGV,CAAC,EAgCD/C,EAAamB,EAAe,UAAW,YAAa,SAAoB6B,EAAWpB,EAAU,CAC5F,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAW5C,EAAQ,oEAAqE4C,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAE9B,GADAY,EAAI1B,GAAcC,EAAKa,CAAE,EACpBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,EACxC,OAAOA,EAGT,MAAO,EACR,CAAC,EAsCDnC,EAAamB,EAAe,UAAW,WAAY,SAAmB6B,EAAWpB,EAAU,CAC1F,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAW5C,EAAQ,oEAAqE4C,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,KAAK,QAAQ,EAAGA,GAAK,EAAGA,IAEjC,GADAY,EAAI1B,GAAcC,EAAKa,CAAE,EACpBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,EACxC,OAAOY,CAGV,CAAC,EAgCD/C,EAAamB,EAAe,UAAW,gBAAiB,SAAwB6B,EAAWpB,EAAU,CACpG,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAW5C,EAAQ,oEAAqE4C,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,KAAK,QAAQ,EAAGA,GAAK,EAAGA,IAEjC,GADAY,EAAI1B,GAAcC,EAAKa,CAAE,EACpBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,EACxC,OAAOA,EAGT,MAAO,EACR,CAAC,EA4BDnC,EAAamB,EAAe,UAAW,UAAW,SAAkBgC,EAAKvB,EAAU,CAClF,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAY2D,CAAI,EACrB,MAAM,IAAI,UAAW/C,EAAQ,oEAAqE+C,CAAI,CAAE,EAGzG,IADA7B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9BY,EAAI1B,GAAcC,EAAKa,CAAE,EACzBgB,EAAI,KAAMvB,EAASmB,EAAGZ,EAAG,IAAK,CAEhC,CAAC,EAyCDnC,EAAamB,EAAe,UAAW,MAAO,SAAcI,EAAM,CACjE,GAAK,CAACN,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAAChC,GAAsBsC,CAAI,EAC/B,MAAM,IAAI,UAAWnB,EAAQ,qEAAsEmB,CAAI,CAAE,EAE1G,GAAK,EAAAA,GAAO,KAAK,SAGjB,OAAOF,GAAc,KAAK,QAASE,CAAI,CACxC,CAAC,EAmCDvB,EAAamB,EAAe,UAAW,WAAY,SAAmBiC,EAAeC,EAAY,CAChG,IAAI/B,EACAC,EACA0B,EACAC,EACAf,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACxB,GAAe2D,CAAc,EAClC,MAAM,IAAI,UAAWhD,EAAQ,0EAA2EgD,CAAc,CAAE,EAEzH,GAAK,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACzD,GAAW0D,CAAU,EAC1B,MAAM,IAAI,UAAWjD,EAAQ,qEAAsEiD,CAAU,CAAE,EAE3GA,EAAY,IAChBA,GAAa,KAAK,QACbA,EAAY,IAChBA,EAAY,GAGf,MACCA,EAAY,EAKb,IAHAJ,EAAK5C,GAAO+C,CAAc,EAC1BF,EAAK5C,GAAO8C,CAAc,EAC1B9B,EAAM,KAAK,QACLa,EAAIkB,EAAWlB,EAAI,KAAK,QAASA,IAEtC,GADAZ,EAAM,EAAIY,EACLc,IAAO3B,EAAKC,CAAI,GAAK2B,IAAO5B,EAAKC,EAAI,CAAE,EAC3C,MAAO,GAGT,MAAO,EACR,CAAC,EAmCDvB,EAAamB,EAAe,UAAW,UAAW,SAAkBiC,EAAeC,EAAY,CAC9F,IAAI/B,EACAC,EACA0B,EACAC,EACAf,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACxB,GAAe2D,CAAc,EAClC,MAAM,IAAI,UAAWhD,EAAQ,0EAA2EgD,CAAc,CAAE,EAEzH,GAAK,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACzD,GAAW0D,CAAU,EAC1B,MAAM,IAAI,UAAWjD,EAAQ,qEAAsEiD,CAAU,CAAE,EAE3GA,EAAY,IAChBA,GAAa,KAAK,QACbA,EAAY,IAChBA,EAAY,GAGf,MACCA,EAAY,EAKb,IAHAJ,EAAK5C,GAAO+C,CAAc,EAC1BF,EAAK5C,GAAO8C,CAAc,EAC1B9B,EAAM,KAAK,QACLa,EAAIkB,EAAWlB,EAAI,KAAK,QAASA,IAEtC,GADAZ,EAAM,EAAIY,EACLc,IAAO3B,EAAKC,CAAI,GAAK2B,IAAO5B,EAAKC,EAAI,CAAE,EAC3C,OAAOY,EAGT,MAAO,EACR,CAAC,EAyBDnC,EAAamB,EAAe,UAAW,OAAQ,SAAemC,EAAY,CACzE,IAAIxB,EACAR,EACAiC,EACApB,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,UAAU,SAAW,EACzBsC,EAAM,YACKhE,GAAU+D,CAAU,EAC/BC,EAAMD,MAEN,OAAM,IAAI,UAAWlD,EAAQ,kEAAmEkD,CAAU,CAAE,EAI7G,IAFAxB,EAAM,CAAC,EACPR,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9BL,EAAI,KAAMT,GAAcC,EAAKa,CAAE,EAAE,SAAS,CAAE,EAE7C,OAAOL,EAAI,KAAMyB,CAAI,CACtB,CAAC,EAsCDvD,EAAamB,EAAe,UAAW,cAAe,SAAsBiC,EAAeC,EAAY,CACtG,IAAI/B,EACAC,EACA0B,EACAC,EACAf,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACxB,GAAe2D,CAAc,EAClC,MAAM,IAAI,UAAWhD,EAAQ,0EAA2EgD,CAAc,CAAE,EAEzH,GAAK,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACzD,GAAW0D,CAAU,EAC1B,MAAM,IAAI,UAAWjD,EAAQ,qEAAsEiD,CAAU,CAAE,EAE3GA,GAAa,KAAK,QACtBA,EAAY,KAAK,QAAU,EAChBA,EAAY,IACvBA,GAAa,KAAK,QAEpB,MACCA,EAAY,KAAK,QAAU,EAK5B,IAHAJ,EAAK5C,GAAO+C,CAAc,EAC1BF,EAAK5C,GAAO8C,CAAc,EAC1B9B,EAAM,KAAK,QACLa,EAAIkB,EAAWlB,GAAK,EAAGA,IAE5B,GADAZ,EAAM,EAAIY,EACLc,IAAO3B,EAAKC,CAAI,GAAK2B,IAAO5B,EAAKC,EAAI,CAAE,EAC3C,OAAOY,EAGT,MAAO,EACR,CAAC,EAgBDlC,GAAqBkB,EAAe,UAAW,SAAU,UAAe,CACvE,OAAO,KAAK,OACb,CAAC,EAyCDnB,EAAamB,EAAe,UAAW,MAAO,SAAcgC,EAAKvB,EAAU,CAC1E,IAAI4B,EACAlC,EACAQ,EACAK,EACAD,EACJ,GAAK,CAACjB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAY2D,CAAI,EACrB,MAAM,IAAI,UAAW/C,EAAQ,oEAAqE+C,CAAI,CAAE,EAKzG,IAHA7B,EAAM,KAAK,QACXQ,EAAM,IAAI,KAAK,YAAa,KAAK,OAAQ,EACzC0B,EAAS1B,EAAI,QACPK,EAAI,EAAGA,EAAI,KAAK,QAASA,IAE9B,GADAD,EAAIiB,EAAI,KAAMvB,EAASP,GAAcC,EAAKa,CAAE,EAAGA,EAAG,IAAK,EAClD1C,GAAeyC,CAAE,EACrBsB,EAAQ,EAAErB,CAAE,EAAI9B,GAAO6B,CAAE,EACzBsB,EAAS,EAAErB,EAAG,CAAE,EAAI7B,GAAO4B,CAAE,UAClBhD,GAAmBgD,CAAE,GAAKA,EAAE,SAAW,EAClDsB,EAAQ,EAAErB,CAAE,EAAID,EAAG,CAAE,EACrBsB,EAAS,EAAErB,EAAG,CAAE,EAAID,EAAG,CAAE,MAEzB,OAAM,IAAI,UAAW9B,EAAQ,+IAAgJ8B,CAAE,CAAE,EAGnL,OAAOJ,CACR,CAAC,EAmDD9B,EAAamB,EAAe,UAAW,UAAW,UAAmB,CACpE,IAAIG,EACAS,EACAL,EACA+B,EACAtB,EACAC,EACJ,GAAK,CAACnB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAKlF,IAHAS,EAAM,KAAK,QACXJ,EAAM,KAAK,QACXmC,EAAIlD,GAAOmB,EAAM,CAAE,EACbS,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBC,EAAIV,EAAMS,EAAI,EACdJ,EAAMT,EAAM,EAAEa,CAAG,EACjBb,EAAM,EAAEa,CAAG,EAAIb,EAAM,EAAEc,CAAG,EAC1Bd,EAAM,EAAEc,CAAG,EAAIL,EACfA,EAAMT,EAAM,EAAEa,EAAG,CAAE,EACnBb,EAAM,EAAEa,EAAG,CAAE,EAAIb,EAAM,EAAEc,EAAG,CAAE,EAC9Bd,EAAM,EAAEc,EAAG,CAAE,EAAIL,EAElB,OAAO,IACR,CAAC,EAgED/B,EAAamB,EAAe,UAAW,MAAO,SAAcD,EAAQ,CAEnE,IAAIwC,EACAnC,EACAD,EACAS,EACAE,EACAwB,EACAvB,EACAC,EACAC,EACJ,GAAK,CAACnB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAGlF,GADAK,EAAM,KAAK,QACN,UAAU,OAAS,GAEvB,GADAC,EAAM,UAAW,CAAE,EACd,CAACtC,GAAsBsC,CAAI,EAC/B,MAAM,IAAI,UAAWnB,EAAQ,+EAAgFmB,CAAI,CAAE,OAGpHA,EAAM,EAEP,GAAK9B,GAAeyB,CAAM,EAAI,CAC7B,GAAKK,GAAO,KAAK,QAChB,MAAM,IAAI,WAAYnB,EAAQ,kEAAmEmB,CAAI,CAAE,EAExGA,GAAO,EACPD,EAAKC,CAAI,EAAIlB,GAAOa,CAAM,EAC1BI,EAAKC,EAAI,CAAE,EAAIjB,GAAOY,CAAM,EAC5B,MACD,CACA,GAAKD,EAAgBC,CAAM,EAAI,CAE9B,GADAuC,EAAIvC,EAAM,QACLK,EAAIkC,EAAI,KAAK,QACjB,MAAM,IAAI,WAAY,wFAAyF,EAMhH,GAJAC,EAAOxC,EAAM,QAGbkB,EAAId,EAAI,WAAcC,EAAIR,GAEzB2C,EAAK,SAAWpC,EAAI,QAEnBoC,EAAK,WAAatB,GAClBsB,EAAK,WAAWA,EAAK,WAAatB,EAElC,CAGD,IADAL,EAAM,IAAI7B,GAAcwD,EAAK,MAAO,EAC9BvB,EAAI,EAAGA,EAAIuB,EAAK,OAAQvB,IAC7BJ,EAAKI,CAAE,EAAIuB,EAAMvB,CAAE,EAEpBuB,EAAO3B,CACR,CAGA,IAFAR,GAAO,EACPa,EAAI,EACED,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBb,EAAKC,CAAI,EAAImC,EAAMtB,CAAE,EACrBd,EAAKC,EAAI,CAAE,EAAImC,EAAMtB,EAAE,CAAE,EACzBb,GAAO,EACPa,GAAK,EAEN,MACD,CACA,GAAKjD,GAAc+B,CAAM,EAAI,CAG5B,IADAuC,EAAIvC,EAAM,OACJiB,EAAI,EAAGA,EAAIsB,EAAGtB,IACnB,GAAK,CAAC1C,GAAeyB,EAAOiB,CAAE,CAAE,EAAI,CACnCF,EAAM,GACN,KACD,CAGD,GAAKA,EAAM,CACV,GAAK,CAACvC,GAAQ+D,CAAE,EACf,MAAM,IAAI,WAAYrD,EAAQ,6GAA8GqD,CAAE,CAAE,EAEjJ,GAAKlC,EAAKkC,EAAE,EAAK,KAAK,QACrB,MAAM,IAAI,WAAY,wFAAyF,EAMhH,GAJAC,EAAOxC,EAGPkB,EAAId,EAAI,WAAcC,EAAIR,GAEzB2C,EAAK,SAAWpC,EAAI,QAEnBoC,EAAK,WAAatB,GAClBsB,EAAK,WAAWA,EAAK,WAAatB,EAElC,CAGD,IADAL,EAAM,IAAI7B,GAAcuD,CAAE,EACpBtB,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBJ,EAAKI,CAAE,EAAIuB,EAAMvB,CAAE,EAEpBuB,EAAO3B,CACR,CAIA,IAHAR,GAAO,EACPkC,GAAK,EACLrB,EAAI,EACED,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBb,EAAKC,CAAI,EAAImC,EAAMtB,CAAE,EACrBd,EAAKC,EAAI,CAAE,EAAImC,EAAMtB,EAAE,CAAE,EACzBb,GAAO,EACPa,GAAK,EAEN,MACD,CAEA,GAAKb,EAAIkC,EAAI,KAAK,QACjB,MAAM,IAAI,WAAY,wFAAyF,EAGhH,IADAlC,GAAO,EACDY,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBD,EAAIhB,EAAOiB,CAAE,EACbb,EAAKC,CAAI,EAAIlB,GAAO6B,CAAE,EACtBZ,EAAKC,EAAI,CAAE,EAAIjB,GAAO4B,CAAE,EACxBX,GAAO,EAER,MACD,CACA,MAAM,IAAI,UAAWnB,EAAQ,kIAAmIc,CAAM,CAAE,CAGzK,CAAC,EA2EDlB,EAAamB,EAAe,UAAW,QAAS,SAAgBoB,EAAOM,EAAM,CAC5E,IAAIc,EACAH,EACA1B,EACAP,EACAD,EACAI,EACAS,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAIlF,GAFAK,EAAM,KAAK,QACXI,EAAM,KAAK,QACN,UAAU,SAAW,EACzBa,EAAQ,EACRM,EAAMnB,MACA,CACN,GAAK,CAAC/B,GAAW4C,CAAM,EACtB,MAAM,IAAI,UAAWnC,EAAQ,oEAAqEmC,CAAM,CAAE,EAQ3G,GANKA,EAAQ,IACZA,GAASb,EACJa,EAAQ,IACZA,EAAQ,IAGL,UAAU,SAAW,EACzBM,EAAMnB,MACA,CACN,GAAK,CAAC/B,GAAWkD,CAAI,EACpB,MAAM,IAAI,UAAWzC,EAAQ,qEAAsEyC,CAAI,CAAE,EAErGA,EAAM,GACVA,GAAOnB,EACFmB,EAAM,IACVA,EAAM,IAEIA,EAAMnB,IACjBmB,EAAMnB,EAER,CACD,CAQA,IAPKa,EAAQM,EACZc,EAASd,EAAMN,EAEfoB,EAAS,EAEV7B,EAAM,IAAI,KAAK,YAAa6B,CAAO,EACnCH,EAAS1B,EAAI,QACPK,EAAI,EAAGA,EAAIwB,EAAQxB,IACxBZ,EAAM,GAAGY,EAAEI,GACXiB,EAAQ,EAAErB,CAAE,EAAIb,EAAKC,CAAI,EACzBiC,EAAS,EAAErB,EAAG,CAAE,EAAIb,EAAKC,EAAI,CAAE,EAEhC,OAAOO,CACR,CAAC,EA+BD9B,EAAamB,EAAe,UAAW,OAAQ,SAAe6B,EAAWpB,EAAU,CAClF,IAAIN,EACAa,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAW5C,EAAQ,oEAAqE4C,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9B,GAAKa,EAAU,KAAMpB,EAASP,GAAcC,EAAKa,CAAE,EAAGA,EAAG,IAAK,EAC7D,MAAO,GAGT,MAAO,EACR,CAAC,EA2EDnC,EAAamB,EAAe,UAAW,WAAY,SAAmByC,EAAOf,EAAM,CAClF,IAAIgB,EACAvC,EACAI,EACJ,GAAK,CAACT,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAIlF,GAFAK,EAAM,KAAK,QACXI,EAAM,KAAK,QACN,UAAU,SAAW,EACzBkC,EAAQ,EACRf,EAAMnB,MACA,CACN,GAAK,CAAC/B,GAAWiE,CAAM,EACtB,MAAM,IAAI,UAAWxD,EAAQ,oEAAqEwD,CAAM,CAAE,EAQ3G,GANKA,EAAQ,IACZA,GAASlC,EACJkC,EAAQ,IACZA,EAAQ,IAGL,UAAU,SAAW,EACzBf,EAAMnB,MACA,CACN,GAAK,CAAC/B,GAAWkD,CAAI,EACpB,MAAM,IAAI,UAAWzC,EAAQ,qEAAsEyC,CAAI,CAAE,EAErGA,EAAM,GACVA,GAAOnB,EACFmB,EAAM,IACVA,EAAM,IAEIA,EAAMnB,IACjBmB,EAAMnB,EAER,CACD,CACA,OAAKkC,GAASlC,GACbA,EAAM,EACNmC,EAASvC,EAAI,YACFsC,GAASf,GACpBnB,EAAM,EACNmC,EAASvC,EAAI,WAAcsC,EAAM7C,KAEjCW,EAAMmB,EAAMe,EACZC,EAASvC,EAAI,WAAesC,EAAM7C,IAE5B,IAAI,KAAK,YAAaO,EAAI,OAAQuC,EAAUnC,EAAM,EAAM,EAAIA,CAAI,CACxE,CAAC,EAmDD1B,EAAamB,EAAe,UAAW,aAAc,UAAsB,CAC1E,IAAIqC,EACA1B,EACAJ,EACAJ,EACAa,EACAC,EACJ,GAAK,CAACnB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAMlF,IAJAS,EAAM,KAAK,QACXI,EAAM,IAAI,KAAK,YAAaJ,CAAI,EAChCJ,EAAM,KAAK,QACXkC,EAAS1B,EAAI,QACPK,EAAI,EAAGA,EAAIT,EAAKS,IACrBC,EAAIV,EAAMS,EAAI,EACdqB,EAAS,EAAErB,CAAG,EAAIb,EAAM,EAAEc,CAAG,EAC7BoB,EAAS,EAAErB,EAAG,CAAE,EAAIb,EAAM,EAAEc,EAAG,CAAE,EAElC,OAAON,CACR,CAAC,EAoBD9B,EAAamB,EAAe,UAAW,WAAY,UAAoB,CACtE,IAAIW,EACAR,EACA,EACJ,GAAK,CAACL,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAIlF,IAFAa,EAAM,CAAC,EACPR,EAAM,KAAK,QACL,EAAI,EAAG,EAAI,KAAK,QAAS,IAC9BQ,EAAI,KAAMT,GAAcC,EAAK,CAAE,EAAE,SAAS,CAAE,EAE7C,OAAOQ,EAAI,KAAM,GAAI,CACtB,CAAC,EAuCD9B,EAAamB,EAAe,UAAW,OAAQ,SAAmB2C,EAAO5C,EAAQ,CAChF,IAAII,EACAQ,EACAJ,EACJ,GAAK,CAACT,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACtB,GAAWmE,CAAM,EACtB,MAAM,IAAI,UAAW1D,EAAQ,oEAAqE0D,CAAM,CAAE,EAM3G,GAJApC,EAAM,KAAK,QACNoC,EAAQ,IACZA,GAASpC,GAELoC,EAAQ,GAAKA,GAASpC,EAC1B,MAAM,IAAI,WAAYtB,EAAQ,kEAAmE0D,CAAM,CAAE,EAE1G,GAAK,CAACrE,GAAeyB,CAAM,EAC1B,MAAM,IAAI,UAAWd,EAAQ,2EAA4Ec,CAAM,CAAE,EAElH,OAAAY,EAAM,IAAI,KAAK,YAAa,KAAK,OAAQ,EACzCR,EAAMQ,EAAI,QACVR,EAAK,EAAEwC,CAAM,EAAIzD,GAAOa,CAAM,EAC9BI,EAAM,EAAEwC,EAAO,CAAE,EAAIxD,GAAOY,CAAM,EAC3BY,CACR,CAAC,EAKD9C,GAAO,QAAUmC,ICt4EjB,IAAA4C,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwFA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7FjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,QAAS,qCAAsC,EACnEC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAS,QAAS,uBAAwB,EAC1CC,GAAO,QAAS,sBAAuB,EACvCC,GAAO,QAAS,sBAAuB,EAY3C,SAASC,GAAcC,EAAK,CAC3B,IAAIC,EACAC,EACAC,EAGJ,IADAF,EAAM,CAAC,EAENC,EAAIF,EAAG,KAAK,EACP,CAAAE,EAAE,MAIP,GADAC,EAAID,EAAE,MACDR,GAAmBS,CAAE,GAAKA,EAAE,QAAU,EAC1CF,EAAI,KAAME,EAAG,CAAE,EAAGA,EAAG,CAAE,CAAE,UACdR,GAAeQ,CAAE,EAC5BF,EAAI,KAAMJ,GAAMM,CAAE,EAAGL,GAAMK,CAAE,CAAE,MAE/B,QAAO,IAAI,UAAWP,GAAQ,kJAAmJO,CAAE,CAAE,EAGvL,OAAOF,CACR,CAKAR,GAAO,QAAUM,KChEjB,IAAAK,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,QAAS,qCAAsC,EACnEC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAS,QAAS,uBAAwB,EAC1CC,GAAO,QAAS,sBAAuB,EACvCC,GAAO,QAAS,sBAAuB,EAc3C,SAASC,GAAiBC,EAAIC,EAAMC,EAAU,CAC7C,IAAIC,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAM,CAAC,EACPG,EAAI,GAEHF,EAAIJ,EAAG,KAAK,EACP,CAAAI,EAAE,MAKP,GAFAE,GAAK,EACLD,EAAIJ,EAAK,KAAMC,EAASE,EAAE,MAAOE,CAAE,EAC9BZ,GAAmBW,CAAE,GAAKA,EAAE,QAAU,EAC1CF,EAAI,KAAME,EAAG,CAAE,EAAGA,EAAG,CAAE,CAAE,UACdV,GAAeU,CAAE,EAC5BF,EAAI,KAAMN,GAAMQ,CAAE,EAAGP,GAAMO,CAAE,CAAE,MAE/B,QAAO,IAAI,UAAWT,GAAQ,+IAAgJS,CAAE,CAAE,EAGpL,OAAOF,CACR,CAKAV,GAAO,QAAUM,KCrEjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAO,QAAS,sBAAuB,EACvCC,GAAO,QAAS,sBAAuB,EAa3C,SAASC,GAAWC,EAAKC,EAAM,CAC9B,IAAIC,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAMD,EAAI,OACVI,EAAI,EACED,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAE3B,GADAD,EAAIF,EAAKG,CAAE,EACN,CAACR,GAAeO,CAAE,EACtB,OAAO,KAERH,EAAKK,CAAE,EAAIR,GAAMM,CAAE,EACnBH,EAAKK,EAAE,CAAE,EAAIP,GAAMK,CAAE,EACrBE,GAAK,CACN,CACA,OAAOL,CACR,CAKAL,GAAO,QAAUI,KC5DjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAoB,QAAS,qCAAsC,EACnEC,GAAe,QAAS,8BAA+B,EACvDC,GAAgB,QAAS,+BAAgC,EACzDC,GAAW,QAAS,0BAA2B,EAC/CC,GAAU,QAAS,yBAA0B,EAC7CC,GAAW,QAAS,0BAA2B,EAC/CC,GAAa,QAAS,4BAA6B,EACnDC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAS,QAAS,kCAAmC,EACrDC,GAAY,QAAS,qCAAsC,EAC3DC,GAAmB,KACnBC,GAAoB,KACpBC,GAA2B,QAAS,4CAA6C,EACjFC,GAAkB,QAAS,yBAA0B,EACrDC,EAAc,QAAS,uDAAwD,EAC/EC,GAAsB,QAAS,uDAAwD,EACvFC,GAAe,KACfC,GAAa,QAAS,yBAA0B,EAChDC,GAAO,QAAS,sBAAuB,EACvCC,GAAO,QAAS,sBAAuB,EACvCC,GAAQ,QAAS,iCAAkC,EACnDC,GAAgB,QAAS,4CAA6C,EACtEC,GAAiB,QAAS,6CAA8C,EACxEC,GAAS,KACTC,GAAiB,KACjBC,EAAS,QAAS,uBAAwB,EAC1CC,GAAe,KACfC,GAAkB,KAClBC,GAAY,KAKZC,GAAoBb,GAAa,kBAAoB,EACrDc,GAAsBlB,GAAyB,EAYnD,SAASmB,EAAgBC,EAAQ,CAChC,OACCA,aAAiBC,GAEhB,OAAOD,GAAU,UACjBA,IAAU,OAETA,EAAM,YAAY,OAAS,kBAC3BA,EAAM,YAAY,OAAS,oBAE5B,OAAOA,EAAM,SAAY,UAGzB,OAAOA,EAAM,SAAY,QAG5B,CASA,SAASE,GAA2BF,EAAQ,CAC3C,OACCA,IAAUC,GAGVD,EAAM,OAAS,gBAEjB,CAUA,SAASG,GAAeC,EAAKC,EAAM,CAClC,OAAAA,GAAO,EACA,IAAIpB,GAAYmB,EAAKC,CAAI,EAAGD,EAAKC,EAAI,CAAE,CAAE,CACjD,CAyEA,SAASJ,GAAkB,CAC1B,IAAIK,EACAC,EACAH,EACAI,EAGJ,GADAD,EAAQ,UAAU,OACb,EAAE,gBAAgBN,GACtB,OAAKM,IAAU,EACP,IAAIN,EAEPM,IAAU,EACP,IAAIN,EAAiB,UAAU,CAAC,CAAE,EAErCM,IAAU,EACP,IAAIN,EAAiB,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAEjD,IAAIA,EAAiB,UAAU,CAAC,EAAG,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAGtE,GAAKM,IAAU,EACdH,EAAM,IAAIpB,GAAc,CAAE,UACfuB,IAAU,EACrB,GAAKxC,GAAsB,UAAU,CAAC,CAAE,EACvCqC,EAAM,IAAIpB,GAAc,UAAU,CAAC,EAAE,CAAE,UAC5Bf,GAAc,UAAU,CAAC,CAAE,EAKtC,GAJAmC,EAAM,UAAW,CAAE,EACnBI,EAAMJ,EAAI,OAGLI,GAAOpC,GAASgC,CAAI,GAAK7B,GAAe6B,EAAI,CAAC,CAAE,GAEnD,GADAA,EAAMR,GAAW,IAAIZ,GAAcwB,EAAI,CAAE,EAAGJ,CAAI,EAC3CA,IAAQ,KAAO,CAEnB,GAAK,CAAC5B,GAAQgC,CAAI,EACjB,MAAM,IAAI,WAAYf,EAAQ,6GAA8Ge,CAAI,CAAE,EAGnJJ,EAAM,IAAIpB,GAAc,UAAU,CAAC,CAAE,CACtC,MACM,CACN,GAAKN,GAAkB0B,CAAI,EAC1BA,EAAMf,GAAee,EAAK,CAAE,UACjBzB,GAAmByB,CAAI,EAClCA,EAAMd,GAAgBc,EAAK,CAAE,UAClB,CAAC5B,GAAQgC,CAAI,EACxB,MAAM,IAAI,WAAYf,EAAQ,6HAA8He,CAAI,CAAE,EAEnKJ,EAAM,IAAIpB,GAAcoB,CAAI,CAC7B,SACWlC,GAAe,UAAU,CAAC,CAAE,EAAI,CAE3C,GADAkC,EAAM,UAAW,CAAE,EACd,CAAC3B,GAAW2B,EAAI,WAAWP,EAAkB,EACjD,MAAM,IAAI,WAAYJ,EAAQ,yFAA0FI,GAAmBO,EAAI,UAAW,CAAE,EAE7JA,EAAM,IAAIpB,GAAcoB,CAAI,CAC7B,SAAYjC,GAAU,UAAU,CAAC,CAAE,EAAI,CAEtC,GADAiC,EAAM,UAAW,CAAE,EACdN,KAAwB,GAC5B,MAAM,IAAI,UAAWL,EAAQ,mJAAoJW,CAAI,CAAE,EAExL,GAAK,CAAC9B,GAAY8B,EAAKvB,EAAgB,CAAE,EACxC,MAAM,IAAI,UAAWY,EAAQ,qHAAsHW,CAAI,CAAE,EAG1J,GADAA,EAAMA,EAAKvB,EAAgB,EAAE,EACxB,CAACP,GAAY8B,EAAI,IAAK,EAC1B,MAAM,IAAI,UAAWX,EAAQ,qHAAsHW,CAAI,CAAE,EAG1J,GADAA,EAAMV,GAAcU,CAAI,EACnBA,aAAe,MACnB,MAAMA,EAEPA,EAAM,IAAIpB,GAAcoB,CAAI,CAC7B,KACC,OAAM,IAAI,UAAWX,EAAQ,qHAAsH,UAAU,CAAC,CAAE,CAAE,MAE7J,CAEN,GADAW,EAAM,UAAW,CAAE,EACd,CAAClC,GAAekC,CAAI,EACxB,MAAM,IAAI,UAAWX,EAAQ,wEAAyEW,CAAI,CAAE,EAG7G,GADAE,EAAa,UAAW,CAAE,EACrB,CAACvC,GAAsBuC,CAAW,EACtC,MAAM,IAAI,UAAWb,EAAQ,4EAA6Ea,CAAW,CAAE,EAExH,GAAK,CAAC7B,GAAW6B,EAAWT,EAAkB,EAC7C,MAAM,IAAI,WAAYJ,EAAQ,uEAAwEI,GAAmBS,CAAW,CAAE,EAEvI,GAAKC,IAAU,EAAI,CAElB,GADAC,EAAMJ,EAAI,WAAaE,EAClB,CAAC7B,GAAW+B,EAAIX,EAAkB,EACtC,MAAM,IAAI,WAAYJ,EAAQ,oGAAqGI,GAAmBW,CAAI,CAAE,EAE7JJ,EAAM,IAAIpB,GAAcoB,EAAKE,CAAW,CACzC,KAAO,CAEN,GADAE,EAAM,UAAW,CAAE,EACd,CAACzC,GAAsByC,CAAI,EAC/B,MAAM,IAAI,UAAWf,EAAQ,uEAAwEe,CAAI,CAAE,EAE5G,GAAMA,EAAIX,GAAsBO,EAAI,WAAWE,EAC9C,MAAM,IAAI,WAAYb,EAAQ,iJAAkJe,EAAIX,EAAkB,CAAE,EAEzMO,EAAM,IAAIpB,GAAcoB,EAAKE,EAAYE,EAAI,CAAE,CAChD,CACD,CACA,OAAA1B,EAAa,KAAM,UAAWsB,CAAI,EAClCtB,EAAa,KAAM,UAAWsB,EAAI,OAAO,CAAE,EAEpC,IACR,CAeAtB,EAAamB,EAAiB,oBAAqBJ,EAAkB,EAerEf,EAAamB,EAAiB,OAAQ,iBAAkB,EAmDxDnB,EAAamB,EAAiB,OAAQ,SAAeQ,EAAM,CAC1D,IAAIC,EACAH,EACAI,EACAC,EACAR,EACAS,EACAC,EACAN,EACAO,EACAC,EACAC,EACAC,EACJ,GAAK,CAAC5C,GAAY,IAAK,EACtB,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAAC4B,GAA2B,IAAK,EACrC,MAAM,IAAI,UAAW,2DAA4D,EAGlF,GADAK,EAAQ,UAAU,OACbA,EAAQ,EAAI,CAEhB,GADAI,EAAO,UAAW,CAAE,EACf,CAACrC,GAAYqC,CAAK,EACtB,MAAM,IAAI,UAAWlB,EAAQ,qEAAsEkB,CAAK,CAAE,EAEtGJ,EAAQ,IACZG,EAAU,UAAW,CAAE,EAEzB,CACA,GAAKX,EAAgBU,CAAI,EAAI,CAE5B,GADAD,EAAMC,EAAI,OACLE,EAAO,CAIX,IAHAC,EAAM,IAAI,KAAMJ,CAAI,EACpBJ,EAAMQ,EAAI,QACVM,EAAI,EACED,EAAI,EAAGA,EAAIT,EAAKS,IAAM,CAE3B,GADAD,EAAIL,EAAK,KAAMD,EAASD,EAAI,IAAKQ,CAAE,EAAGA,CAAE,EACnC1C,GAAeyC,CAAE,EACrBZ,EAAKc,CAAE,EAAIhC,GAAM8B,CAAE,EACnBZ,EAAKc,EAAE,CAAE,EAAI/B,GAAM6B,CAAE,UACVhD,GAAmBgD,CAAE,GAAKA,EAAE,QAAU,EACjDZ,EAAKc,CAAE,EAAIF,EAAG,CAAE,EAChBZ,EAAKc,EAAE,CAAE,EAAIF,EAAG,CAAE,MAElB,OAAM,IAAI,UAAWvB,EAAQ,+IAAgJuB,CAAE,CAAE,EAElLE,GAAK,CACN,CACA,OAAON,CACR,CACA,OAAO,IAAI,KAAMH,CAAI,CACtB,CACA,GAAKxC,GAAcwC,CAAI,EAAI,CAC1B,GAAKE,EAAO,CAUX,IAPAH,EAAMC,EAAI,OACLA,EAAI,KAAOA,EAAI,IACnBK,EAAMtB,GAAgB,SAAU,EAEhCsB,EAAMvB,GAAQ,SAAU,EAGnB0B,EAAI,EAAGA,EAAIT,EAAKS,IACrB,GAAK,CAAC1C,GAAeuC,EAAKL,EAAKQ,CAAE,CAAE,EAAI,CACtCF,EAAM,GACN,KACD,CAGD,GAAKA,EAAM,CACV,GAAK,CAACvC,GAAQgC,CAAI,EACjB,MAAM,IAAI,WAAYf,EAAQ,gGAAiGe,CAAI,CAAE,EAItI,IAFAI,EAAM,IAAI,KAAMJ,EAAI,CAAE,EACtBJ,EAAMQ,EAAI,QACJK,EAAI,EAAGA,EAAIT,EAAKS,IACrBb,EAAKa,CAAE,EAAIN,EAAK,KAAMD,EAASI,EAAKL,EAAKQ,CAAE,EAAGA,CAAE,EAEjD,OAAOL,CACR,CAKA,IAHAA,EAAM,IAAI,KAAMJ,CAAI,EACpBJ,EAAMQ,EAAI,QACVM,EAAI,EACED,EAAI,EAAGA,EAAIT,EAAKS,IAAM,CAE3B,GADAD,EAAIL,EAAK,KAAMD,EAASI,EAAKL,EAAKQ,CAAE,EAAGA,CAAE,EACpC1C,GAAeyC,CAAE,EACrBZ,EAAKc,CAAE,EAAIhC,GAAM8B,CAAE,EACnBZ,EAAKc,EAAE,CAAE,EAAI/B,GAAM6B,CAAE,UACVhD,GAAmBgD,CAAE,GAAKA,EAAE,QAAU,EACjDZ,EAAKc,CAAE,EAAIF,EAAG,CAAE,EAChBZ,EAAKc,EAAE,CAAE,EAAIF,EAAG,CAAE,MAElB,OAAM,IAAI,UAAWvB,EAAQ,+IAAgJuB,CAAE,CAAE,EAElLE,GAAK,CACN,CACA,OAAON,CACR,CACA,OAAO,IAAI,KAAMH,CAAI,CACtB,CACA,GAAKtC,GAAUsC,CAAI,GAAKX,IAAuBxB,GAAYmC,EAAK5B,EAAgB,CAAE,EAAI,CAErF,GADAuB,EAAMK,EAAK5B,EAAgB,EAAE,EACxB,CAACP,GAAY8B,EAAI,IAAK,EAC1B,MAAM,IAAI,UAAWX,EAAQ,6FAA8FgB,CAAI,CAAE,EAOlI,GALKE,EACJE,EAAMlB,GAAiBS,EAAKO,EAAMD,CAAQ,EAE1CG,EAAMnB,GAAcU,CAAI,EAEpBS,aAAe,MACnB,MAAMA,EAKP,IAHAL,EAAMK,EAAI,OAAS,EACnBD,EAAM,IAAI,KAAMJ,CAAI,EACpBJ,EAAMQ,EAAI,QACJK,EAAI,EAAGA,EAAIT,EAAKS,IACrBb,EAAKa,CAAE,EAAIJ,EAAKI,CAAE,EAEnB,OAAOL,CACR,CACA,MAAM,IAAI,UAAWnB,EAAQ,6FAA8FgB,CAAI,CAAE,CAClI,CAAC,EAoBD3B,EAAamB,EAAiB,KAAM,UAAc,CACjD,IAAIkB,EACAF,EACJ,GAAK,CAAC3C,GAAY,IAAK,EACtB,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAAC4B,GAA2B,IAAK,EACrC,MAAM,IAAI,UAAW,2DAA4D,EAGlF,IADAiB,EAAO,CAAC,EACFF,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAClCE,EAAK,KAAM,UAAWF,CAAE,CAAE,EAE3B,OAAO,IAAI,KAAME,CAAK,CACvB,CAAC,EAwDDrC,EAAamB,EAAgB,UAAW,KAAM,SAAaI,EAAM,CAChE,GAAK,CAACN,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACtB,GAAW4B,CAAI,EACpB,MAAM,IAAI,UAAWZ,EAAQ,0DAA2DY,CAAI,CAAE,EAK/F,GAHKA,EAAM,IACVA,GAAO,KAAK,SAER,EAAAA,EAAM,GAAKA,GAAO,KAAK,SAG5B,OAAOF,GAAe,KAAK,QAASE,CAAI,CACzC,CAAC,EAgBDtB,GAAqBkB,EAAgB,UAAW,SAAU,UAAe,CACxE,OAAO,KAAK,QAAQ,MACrB,CAAC,EAgBDlB,GAAqBkB,EAAgB,UAAW,aAAc,UAAe,CAC5E,OAAO,KAAK,QAAQ,UACrB,CAAC,EAgBDlB,GAAqBkB,EAAgB,UAAW,aAAc,UAAe,CAC5E,OAAO,KAAK,QAAQ,UACrB,CAAC,EAiBDnB,EAAamB,EAAgB,UAAW,oBAAqBA,EAAgB,iBAAkB,EAuC/FnB,EAAamB,EAAgB,UAAW,aAAc,SAAqBmB,EAAQC,EAAQ,CAC1F,GAAK,CAACtB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAGlF,OAAK,UAAU,SAAW,EACzB,KAAK,QAAQ,WAAYqB,EAAO,EAAGC,EAAM,CAAE,EAE3C,KAAK,QAAQ,WAAYD,EAAO,EAAGC,EAAM,EAAG,UAAU,CAAC,EAAE,CAAE,EAErD,IACR,CAAC,EAqCDvC,EAAamB,EAAgB,UAAW,UAAW,UAAmB,CACrE,IAAIqB,EACAC,EACAC,EACAhB,EACAiB,EACAR,EACAC,EACJ,GAAK,CAACnB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,OAAAwB,EAAO,KACPD,EAAS,KAAK,QACdd,EAAM,KAAK,QAGXS,EAAI,GACJC,EAAI,GAGJM,EAAO,CAAC,EACR1C,EAAa0C,EAAM,OAAQE,CAAK,EAChC5C,EAAa0C,EAAM,SAAUG,CAAI,EAE5B9C,IACJC,EAAa0C,EAAM3C,GAAiB+C,CAAQ,EAEtCJ,EAQP,SAASE,GAAO,CACf,IAAIG,EAEJ,OADAZ,GAAK,EACAQ,GAAOR,GAAKT,EACT,CACN,KAAQ,EACT,GAEDU,GAAK,EACLW,EAAI,IAAI5C,GAAYqC,EAAQJ,CAAE,EAAGI,EAAQJ,EAAE,CAAE,CAAE,EACxC,CACN,MAAS,CAAED,EAAGY,CAAE,EAChB,KAAQ,EACT,EACD,CASA,SAASF,EAAK3B,EAAQ,CAErB,OADAyB,EAAM,GACD,UAAU,OACP,CACN,MAASzB,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAAS4B,GAAU,CAClB,OAAOL,EAAK,QAAQ,CACrB,CACD,CAAC,EA+BDzC,EAAamB,EAAgB,UAAW,QAAS,SAAgB6B,EAAWpB,EAAU,CACrF,IAAIN,EACAa,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAWrC,EAAQ,oEAAqEqC,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9B,GAAK,CAACa,EAAU,KAAMpB,EAASP,GAAeC,EAAKa,CAAE,EAAGA,EAAG,IAAK,EAC/D,MAAO,GAGT,MAAO,EACR,CAAC,EA0CDnC,EAAamB,EAAgB,UAAW,OAAQ,SAAeD,EAAOqB,EAAOM,EAAM,CAClF,IAAIvB,EACAI,EACAH,EACA0B,EACAC,EACAf,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACxB,GAAeyB,CAAM,EAC1B,MAAM,IAAI,UAAWP,EAAQ,0EAA2EO,CAAM,CAAE,EAIjH,GAFAI,EAAM,KAAK,QACXI,EAAM,KAAK,QACN,UAAU,OAAS,EAAI,CAC3B,GAAK,CAAC/B,GAAW4C,CAAM,EACtB,MAAM,IAAI,UAAW5B,EAAQ,qEAAsE4B,CAAM,CAAE,EAQ5G,GANKA,EAAQ,IACZA,GAASb,EACJa,EAAQ,IACZA,EAAQ,IAGL,UAAU,OAAS,EAAI,CAC3B,GAAK,CAAC5C,GAAWkD,CAAI,EACpB,MAAM,IAAI,UAAWlC,EAAQ,oEAAqEkC,CAAI,CAAE,EAEpGA,EAAM,IACVA,GAAOnB,EACFmB,EAAM,IACVA,EAAM,IAGHA,EAAMnB,IACVmB,EAAMnB,EAER,MACCmB,EAAMnB,CAER,MACCa,EAAQ,EACRM,EAAMnB,EAIP,IAFAuB,EAAK7C,GAAMc,CAAM,EACjBgC,EAAK7C,GAAMa,CAAM,EACXiB,EAAII,EAAOJ,EAAIU,EAAKV,IACzBZ,EAAM,EAAEY,EACRb,EAAKC,CAAI,EAAI0B,EACb3B,EAAKC,EAAI,CAAE,EAAI2B,EAEhB,OAAO,IACR,CAAC,EA2CDlD,EAAamB,EAAgB,UAAW,SAAU,SAAiB6B,EAAWpB,EAAU,CACvF,IAAIN,EACAQ,EACAK,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAWrC,EAAQ,oEAAqEqC,CAAU,CAAE,EAI/G,IAFA1B,EAAM,KAAK,QACXQ,EAAM,CAAC,EACDK,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9BY,EAAI1B,GAAeC,EAAKa,CAAE,EACrBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,GACxCL,EAAI,KAAMiB,CAAE,EAGd,OAAO,IAAI,KAAK,YAAajB,CAAI,CAClC,CAAC,EAqCD9B,EAAamB,EAAgB,UAAW,OAAQ,SAAe6B,EAAWpB,EAAU,CACnF,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAWrC,EAAQ,oEAAqEqC,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAE9B,GADAY,EAAI1B,GAAeC,EAAKa,CAAE,EACrBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,EACxC,OAAOY,CAGV,CAAC,EA+BD/C,EAAamB,EAAgB,UAAW,YAAa,SAAoB6B,EAAWpB,EAAU,CAC7F,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAWrC,EAAQ,oEAAqEqC,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAE9B,GADAY,EAAI1B,GAAeC,EAAKa,CAAE,EACrBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,EACxC,OAAOA,EAGT,MAAO,EACR,CAAC,EAqCDnC,EAAamB,EAAgB,UAAW,WAAY,SAAmB6B,EAAWpB,EAAU,CAC3F,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAWrC,EAAQ,oEAAqEqC,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,KAAK,QAAQ,EAAGA,GAAK,EAAGA,IAEjC,GADAY,EAAI1B,GAAeC,EAAKa,CAAE,EACrBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,EACxC,OAAOY,CAGV,CAAC,EA+BD/C,EAAamB,EAAgB,UAAW,gBAAiB,SAAwB6B,EAAWpB,EAAU,CACrG,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAWrC,EAAQ,oEAAqEqC,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,KAAK,QAAQ,EAAGA,GAAK,EAAGA,IAEjC,GADAY,EAAI1B,GAAeC,EAAKa,CAAE,EACrBa,EAAU,KAAMpB,EAASmB,EAAGZ,EAAG,IAAK,EACxC,OAAOA,EAGT,MAAO,EACR,CAAC,EA4BDnC,EAAamB,EAAgB,UAAW,UAAW,SAAkBgC,EAAKvB,EAAU,CACnF,IAAIN,EACAa,EACAY,EACJ,GAAK,CAAC9B,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAY2D,CAAI,EACrB,MAAM,IAAI,UAAWxC,EAAQ,oEAAqEwC,CAAI,CAAE,EAGzG,IADA7B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9BY,EAAI1B,GAAeC,EAAKa,CAAE,EAC1BgB,EAAI,KAAMvB,EAASmB,EAAGZ,EAAG,IAAK,CAEhC,CAAC,EAyCDnC,EAAamB,EAAgB,UAAW,MAAO,SAAcI,EAAM,CAClE,GAAK,CAACN,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAAChC,GAAsBsC,CAAI,EAC/B,MAAM,IAAI,UAAWZ,EAAQ,qEAAsEY,CAAI,CAAE,EAE1G,GAAK,EAAAA,GAAO,KAAK,SAGjB,OAAOF,GAAe,KAAK,QAASE,CAAI,CACzC,CAAC,EAgBDtB,GAAqBkB,EAAgB,UAAW,SAAU,UAAe,CACxE,OAAO,KAAK,OACb,CAAC,EAmCDnB,EAAamB,EAAgB,UAAW,WAAY,SAAmBiC,EAAeC,EAAY,CACjG,IAAI/B,EACAC,EACA0B,EACAC,EACAf,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACxB,GAAe2D,CAAc,EAClC,MAAM,IAAI,UAAWzC,EAAQ,0EAA2EyC,CAAc,CAAE,EAEzH,GAAK,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACzD,GAAW0D,CAAU,EAC1B,MAAM,IAAI,UAAW1C,EAAQ,qEAAsE0C,CAAU,CAAE,EAE3GA,EAAY,IAChBA,GAAa,KAAK,QACbA,EAAY,IAChBA,EAAY,GAGf,MACCA,EAAY,EAKb,IAHAJ,EAAK7C,GAAMgD,CAAc,EACzBF,EAAK7C,GAAM+C,CAAc,EACzB9B,EAAM,KAAK,QACLa,EAAIkB,EAAWlB,EAAI,KAAK,QAASA,IAEtC,GADAZ,EAAM,EAAIY,EACLc,IAAO3B,EAAKC,CAAI,GAAK2B,IAAO5B,EAAKC,EAAI,CAAE,EAC3C,MAAO,GAGT,MAAO,EACR,CAAC,EAmCDvB,EAAamB,EAAgB,UAAW,UAAW,SAAkBiC,EAAeC,EAAY,CAC/F,IAAI/B,EACAC,EACA0B,EACAC,EACAf,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACxB,GAAe2D,CAAc,EAClC,MAAM,IAAI,UAAWzC,EAAQ,0EAA2EyC,CAAc,CAAE,EAEzH,GAAK,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACzD,GAAW0D,CAAU,EAC1B,MAAM,IAAI,UAAW1C,EAAQ,qEAAsE0C,CAAU,CAAE,EAE3GA,EAAY,IAChBA,GAAa,KAAK,QACbA,EAAY,IAChBA,EAAY,GAGf,MACCA,EAAY,EAKb,IAHAJ,EAAK7C,GAAMgD,CAAc,EACzBF,EAAK7C,GAAM+C,CAAc,EACzB9B,EAAM,KAAK,QACLa,EAAIkB,EAAWlB,EAAI,KAAK,QAASA,IAEtC,GADAZ,EAAM,EAAIY,EACLc,IAAO3B,EAAKC,CAAI,GAAK2B,IAAO5B,EAAKC,EAAI,CAAE,EAC3C,OAAOY,EAGT,MAAO,EACR,CAAC,EAyBDnC,EAAamB,EAAgB,UAAW,OAAQ,SAAemC,EAAY,CAC1E,IAAIxB,EACAR,EACAiC,EACApB,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,UAAU,SAAW,EACzBsC,EAAM,YACKhE,GAAU+D,CAAU,EAC/BC,EAAMD,MAEN,OAAM,IAAI,UAAW3C,EAAQ,kEAAmE2C,CAAU,CAAE,EAI7G,IAFAxB,EAAM,CAAC,EACPR,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9BL,EAAI,KAAMT,GAAeC,EAAKa,CAAE,EAAE,SAAS,CAAE,EAE9C,OAAOL,EAAI,KAAMyB,CAAI,CACtB,CAAC,EAsCDvD,EAAamB,EAAgB,UAAW,cAAe,SAAsBiC,EAAeC,EAAY,CACvG,IAAI/B,EACAC,EACA0B,EACAC,EACAf,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACxB,GAAe2D,CAAc,EAClC,MAAM,IAAI,UAAWzC,EAAQ,0EAA2EyC,CAAc,CAAE,EAEzH,GAAK,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACzD,GAAW0D,CAAU,EAC1B,MAAM,IAAI,UAAW1C,EAAQ,qEAAsE0C,CAAU,CAAE,EAE3GA,GAAa,KAAK,QACtBA,EAAY,KAAK,QAAU,EAChBA,EAAY,IACvBA,GAAa,KAAK,QAEpB,MACCA,EAAY,KAAK,QAAU,EAK5B,IAHAJ,EAAK7C,GAAMgD,CAAc,EACzBF,EAAK7C,GAAM+C,CAAc,EACzB9B,EAAM,KAAK,QACLa,EAAIkB,EAAWlB,GAAK,EAAGA,IAE5B,GADAZ,EAAM,EAAIY,EACLc,IAAO3B,EAAKC,CAAI,GAAK2B,IAAO5B,EAAKC,EAAI,CAAE,EAC3C,OAAOY,EAGT,MAAO,EACR,CAAC,EAyCDnC,EAAamB,EAAgB,UAAW,MAAO,SAAcgC,EAAKvB,EAAU,CAC3E,IAAI4B,EACAlC,EACAQ,EACAK,EACAD,EACJ,GAAK,CAACjB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAY2D,CAAI,EACrB,MAAM,IAAI,UAAWxC,EAAQ,oEAAqEwC,CAAI,CAAE,EAKzG,IAHA7B,EAAM,KAAK,QACXQ,EAAM,IAAI,KAAK,YAAa,KAAK,OAAQ,EACzC0B,EAAS1B,EAAI,QACPK,EAAI,EAAGA,EAAI,KAAK,QAASA,IAE9B,GADAD,EAAIiB,EAAI,KAAMvB,EAASP,GAAeC,EAAKa,CAAE,EAAGA,EAAG,IAAK,EACnD1C,GAAeyC,CAAE,EACrBsB,EAAQ,EAAErB,CAAE,EAAI/B,GAAM8B,CAAE,EACxBsB,EAAS,EAAErB,EAAG,CAAE,EAAI9B,GAAM6B,CAAE,UACjBhD,GAAmBgD,CAAE,GAAKA,EAAE,SAAW,EAClDsB,EAAQ,EAAErB,CAAE,EAAID,EAAG,CAAE,EACrBsB,EAAS,EAAErB,EAAG,CAAE,EAAID,EAAG,CAAE,MAEzB,OAAM,IAAI,UAAWvB,EAAQ,+IAAgJuB,CAAE,CAAE,EAGnL,OAAOJ,CACR,CAAC,EAmDD9B,EAAamB,EAAgB,UAAW,UAAW,UAAmB,CACrE,IAAIG,EACAS,EACAL,EACA+B,EACAtB,EACAC,EACJ,GAAK,CAACnB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAKlF,IAHAS,EAAM,KAAK,QACXJ,EAAM,KAAK,QACXmC,EAAInD,GAAOoB,EAAM,CAAE,EACbS,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBC,EAAIV,EAAMS,EAAI,EACdJ,EAAMT,EAAM,EAAEa,CAAG,EACjBb,EAAM,EAAEa,CAAG,EAAIb,EAAM,EAAEc,CAAG,EAC1Bd,EAAM,EAAEc,CAAG,EAAIL,EACfA,EAAMT,EAAM,EAAEa,EAAG,CAAE,EACnBb,EAAM,EAAEa,EAAG,CAAE,EAAIb,EAAM,EAAEc,EAAG,CAAE,EAC9Bd,EAAM,EAAEc,EAAG,CAAE,EAAIL,EAElB,OAAO,IACR,CAAC,EAgED/B,EAAamB,EAAgB,UAAW,MAAO,SAAcD,EAAQ,CAEpE,IAAIwC,EACAnC,EACAD,EACAS,EACAE,EACAwB,EACAvB,EACAC,EACAC,EACJ,GAAK,CAACnB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAGlF,GADAK,EAAM,KAAK,QACN,UAAU,OAAS,GAEvB,GADAC,EAAM,UAAW,CAAE,EACd,CAACtC,GAAsBsC,CAAI,EAC/B,MAAM,IAAI,UAAWZ,EAAQ,+EAAgFY,CAAI,CAAE,OAGpHA,EAAM,EAEP,GAAK9B,GAAeyB,CAAM,EAAI,CAC7B,GAAKK,GAAO,KAAK,QAChB,MAAM,IAAI,WAAYZ,EAAQ,kEAAmEY,CAAI,CAAE,EAExGA,GAAO,EACPD,EAAKC,CAAI,EAAInB,GAAMc,CAAM,EACzBI,EAAKC,EAAI,CAAE,EAAIlB,GAAMa,CAAM,EAC3B,MACD,CACA,GAAKD,EAAgBC,CAAM,EAAI,CAE9B,GADAuC,EAAIvC,EAAM,QACLK,EAAIkC,EAAI,KAAK,QACjB,MAAM,IAAI,WAAY,wFAAyF,EAMhH,GAJAC,EAAOxC,EAAM,QAGbkB,EAAId,EAAI,WAAcC,EAAIR,GAEzB2C,EAAK,SAAWpC,EAAI,QAEnBoC,EAAK,WAAatB,GAClBsB,EAAK,WAAWA,EAAK,WAAatB,EAElC,CAGD,IADAL,EAAM,IAAI7B,GAAcwD,EAAK,MAAO,EAC9BvB,EAAI,EAAGA,EAAIuB,EAAK,OAAQvB,IAC7BJ,EAAKI,CAAE,EAAIuB,EAAMvB,CAAE,EAEpBuB,EAAO3B,CACR,CAGA,IAFAR,GAAO,EACPa,EAAI,EACED,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBb,EAAKC,CAAI,EAAImC,EAAMtB,CAAE,EACrBd,EAAKC,EAAI,CAAE,EAAImC,EAAMtB,EAAE,CAAE,EACzBb,GAAO,EACPa,GAAK,EAEN,MACD,CACA,GAAKjD,GAAc+B,CAAM,EAAI,CAG5B,IADAuC,EAAIvC,EAAM,OACJiB,EAAI,EAAGA,EAAIsB,EAAGtB,IACnB,GAAK,CAAC1C,GAAeyB,EAAOiB,CAAE,CAAE,EAAI,CACnCF,EAAM,GACN,KACD,CAGD,GAAKA,EAAM,CACV,GAAK,CAACvC,GAAQ+D,CAAE,EACf,MAAM,IAAI,WAAY9C,EAAQ,6GAA8G8C,CAAE,CAAE,EAEjJ,GAAKlC,EAAKkC,EAAE,EAAK,KAAK,QACrB,MAAM,IAAI,WAAY,wFAAyF,EAMhH,GAJAC,EAAOxC,EAGPkB,EAAId,EAAI,WAAcC,EAAIR,GAEzB2C,EAAK,SAAWpC,EAAI,QAEnBoC,EAAK,WAAatB,GAClBsB,EAAK,WAAWA,EAAK,WAAatB,EAElC,CAGD,IADAL,EAAM,IAAI7B,GAAcuD,CAAE,EACpBtB,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBJ,EAAKI,CAAE,EAAIuB,EAAMvB,CAAE,EAEpBuB,EAAO3B,CACR,CAIA,IAHAR,GAAO,EACPkC,GAAK,EACLrB,EAAI,EACED,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBb,EAAKC,CAAI,EAAImC,EAAMtB,CAAE,EACrBd,EAAKC,EAAI,CAAE,EAAImC,EAAMtB,EAAE,CAAE,EACzBb,GAAO,EACPa,GAAK,EAEN,MACD,CAEA,GAAKb,EAAIkC,EAAI,KAAK,QACjB,MAAM,IAAI,WAAY,wFAAyF,EAGhH,IADAlC,GAAO,EACDY,EAAI,EAAGA,EAAIsB,EAAGtB,IACnBD,EAAIhB,EAAOiB,CAAE,EACbb,EAAKC,CAAI,EAAInB,GAAM8B,CAAE,EACrBZ,EAAKC,EAAI,CAAE,EAAIlB,GAAM6B,CAAE,EACvBX,GAAO,EAER,MACD,CACA,MAAM,IAAI,UAAWZ,EAAQ,kIAAmIO,CAAM,CAAE,CAGzK,CAAC,EA+BDlB,EAAamB,EAAgB,UAAW,OAAQ,SAAe6B,EAAWpB,EAAU,CACnF,IAAIN,EACAa,EACJ,GAAK,CAAClB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACzB,GAAYwD,CAAU,EAC3B,MAAM,IAAI,UAAWrC,EAAQ,oEAAqEqC,CAAU,CAAE,EAG/G,IADA1B,EAAM,KAAK,QACLa,EAAI,EAAGA,EAAI,KAAK,QAASA,IAC9B,GAAKa,EAAU,KAAMpB,EAASP,GAAeC,EAAKa,CAAE,EAAGA,EAAG,IAAK,EAC9D,MAAO,GAGT,MAAO,EACR,CAAC,EA2EDnC,EAAamB,EAAgB,UAAW,WAAY,SAAmBwC,EAAOd,EAAM,CACnF,IAAIe,EACAtC,EACAI,EACJ,GAAK,CAACT,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAIlF,GAFAK,EAAM,KAAK,QACXI,EAAM,KAAK,QACN,UAAU,SAAW,EACzBiC,EAAQ,EACRd,EAAMnB,MACA,CACN,GAAK,CAAC/B,GAAWgE,CAAM,EACtB,MAAM,IAAI,UAAWhD,EAAQ,oEAAqEgD,CAAM,CAAE,EAQ3G,GANKA,EAAQ,IACZA,GAASjC,EACJiC,EAAQ,IACZA,EAAQ,IAGL,UAAU,SAAW,EACzBd,EAAMnB,MACA,CACN,GAAK,CAAC/B,GAAWkD,CAAI,EACpB,MAAM,IAAI,UAAWlC,EAAQ,qEAAsEkC,CAAI,CAAE,EAErGA,EAAM,GACVA,GAAOnB,EACFmB,EAAM,IACVA,EAAM,IAEIA,EAAMnB,IACjBmB,EAAMnB,EAER,CACD,CACA,OAAKiC,GAASjC,GACbA,EAAM,EACNkC,EAAStC,EAAI,YACFqC,GAASd,GACpBnB,EAAM,EACNkC,EAAStC,EAAI,WAAeqC,EAAM5C,KAElCW,EAAMmB,EAAMc,EACZC,EAAStC,EAAI,WAAeqC,EAAM5C,IAE5B,IAAI,KAAK,YAAaO,EAAI,OAAQsC,EAAUlC,EAAM,EAAM,EAAIA,CAAI,CACxE,CAAC,EAmDD1B,EAAamB,EAAgB,UAAW,aAAc,UAAsB,CAC3E,IAAIqC,EACA1B,EACAJ,EACAJ,EACAa,EACAC,EACJ,GAAK,CAACnB,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAMlF,IAJAS,EAAM,KAAK,QACXI,EAAM,IAAI,KAAK,YAAaJ,CAAI,EAChCJ,EAAM,KAAK,QACXkC,EAAS1B,EAAI,QACPK,EAAI,EAAGA,EAAIT,EAAKS,IACrBC,EAAIV,EAAMS,EAAI,EACdqB,EAAS,EAAErB,CAAG,EAAIb,EAAM,EAAEc,CAAG,EAC7BoB,EAAS,EAAErB,EAAG,CAAE,EAAIb,EAAM,EAAEc,EAAG,CAAE,EAElC,OAAON,CACR,CAAC,EAoBD9B,EAAamB,EAAgB,UAAW,WAAY,UAAoB,CACvE,IAAIW,EACAR,EACA,EACJ,GAAK,CAACL,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAIlF,IAFAa,EAAM,CAAC,EACPR,EAAM,KAAK,QACL,EAAI,EAAG,EAAI,KAAK,QAAS,IAC9BQ,EAAI,KAAMT,GAAeC,EAAK,CAAE,EAAE,SAAS,CAAE,EAE9C,OAAOQ,EAAI,KAAM,GAAI,CACtB,CAAC,EAuCD9B,EAAamB,EAAgB,UAAW,OAAQ,SAAmB0C,EAAO3C,EAAQ,CACjF,IAAII,EACAQ,EACAJ,EACJ,GAAK,CAACT,EAAgB,IAAK,EAC1B,MAAM,IAAI,UAAW,2DAA4D,EAElF,GAAK,CAACtB,GAAWkE,CAAM,EACtB,MAAM,IAAI,UAAWlD,EAAQ,oEAAqEkD,CAAM,CAAE,EAM3G,GAJAnC,EAAM,KAAK,QACNmC,EAAQ,IACZA,GAASnC,GAELmC,EAAQ,GAAKA,GAASnC,EAC1B,MAAM,IAAI,WAAYf,EAAQ,kEAAmEkD,CAAM,CAAE,EAE1G,GAAK,CAACpE,GAAeyB,CAAM,EAC1B,MAAM,IAAI,UAAWP,EAAQ,2EAA4EO,CAAM,CAAE,EAElH,OAAAY,EAAM,IAAI,KAAK,YAAa,KAAK,OAAQ,EACzCR,EAAMQ,EAAI,QACVR,EAAK,EAAEuC,CAAM,EAAIzD,GAAMc,CAAM,EAC7BI,EAAM,EAAEuC,EAAO,CAAE,EAAIxD,GAAMa,CAAM,EAC1BY,CACR,CAAC,EAKD9C,GAAO,QAAUmC,ICjwEjB,IAAA2C,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwFA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7FjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,KACfC,GAAe,KACfC,GAAc,KACdC,GAAa,KACbC,GAAc,KACdC,GAAa,KACbC,GAAa,KACbC,GAAoB,KACpBC,GAAY,KACZC,GAAiB,KACjBC,GAAkB,KAMlBC,GAAQ,CACXX,GACAC,GACAE,GACAD,GACAG,GACAD,GACAI,GACAF,GACAC,GACAE,GACAC,EACD,EAKAX,GAAO,QAAUY,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuBA,IAAIC,GAAS,CACZ,UACA,UACA,QACA,SACA,QACA,SACA,OACA,QACA,SACA,YACA,YACD,EAKAD,GAAO,QAAUC,KCxCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,0BAA2B,EAC/CC,GAAU,QAAS,yBAA0B,EAC7CC,GAAkB,QAAS,gCAAiC,EAC5DC,GAAa,KACbC,GAAQ,KACRC,GAAS,KAKTC,GAASD,GAAO,OAkBpB,SAASE,GAAOC,EAAQ,CACvB,IAAIC,EACJ,GAAKR,GAASO,CAAM,EACnB,MAAO,UAER,GAAKR,GAAUQ,CAAM,EACpB,OAAO,KAER,IAAMC,EAAI,EAAGA,EAAIH,GAAQG,IACxB,GAAKD,aAAiBJ,GAAOK,CAAE,EAC9B,OAAOJ,GAAQI,CAAE,EAInB,OAAON,GAAYD,GAAiBM,CAAM,CAAE,GAAK,IAClD,CAKAT,GAAO,QAAUQ,KCtEjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,GAAA,cA2CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KChDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAkB,KAClBC,GAAS,KACTC,GAAS,KACTC,GAAiB,KACjBC,GAAiB,KACjBC,GAAQ,IAgCZ,SAASC,GAAWC,EAAI,CACvB,IAAIC,EAAKH,GAAOE,CAAE,EAClB,OAAKP,GAAiBO,CAAE,EAChB,CACN,iBAAoB,GACpB,UAAa,CACZJ,GAAgBK,CAAG,EACnBJ,GAAgBI,CAAG,CACpB,CACD,EAEM,CACN,iBAAoB,GACpB,UAAa,CACZP,GAAQO,CAAG,EACXN,GAAQM,CAAG,CACZ,CACD,CACD,CAKAT,GAAO,QAAUO,KClFjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCjDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAuB,QAAS,wDAAyD,EACzFC,GAAc,QAAS,uDAAwD,EAC/EC,GAAY,KACZC,GAAe,QAAS,8BAA+B,EACvDC,GAAS,QAAS,uBAAwB,EAW9C,SAASC,GAAWC,EAAM,CACzB,KAAK,QAAQ,OAASA,CACvB,CAQA,SAASC,IAAY,CACpB,OAAO,KAAK,QAAQ,MACrB,CAoBA,SAASC,GAAeC,EAAM,CAC7B,IAAIC,EACJ,GAAK,EAAE,gBAAgBF,IACtB,OAAO,IAAIA,GAAeC,CAAI,EAE/B,GAAK,CAACN,GAAcM,CAAI,EACvB,MAAM,IAAI,UAAWL,GAAQ,oEAAqEK,CAAI,CAAE,EAEzG,OAAAC,EAAIR,GAAWO,CAAI,EACnB,KAAK,QAAUA,EACf,KAAK,QAAUC,EAAE,UAAW,CAAE,EAC9B,KAAK,QAAUA,EAAE,UAAW,CAAE,EACvB,IACR,CAeAT,GAAaO,GAAe,OAAQ,eAAgB,EASpDR,GAAsBQ,GAAc,UAAW,SAAUD,GAAWF,EAAU,EAkB9EJ,GAAaO,GAAc,UAAW,MAAO,SAAcG,EAAM,CAChE,OAAO,KAAK,QAAS,KAAK,QAASA,CAAI,CACxC,CAAC,EAwBDV,GAAaO,GAAc,UAAW,MAAO,SAAcI,EAAOD,EAAM,CACvE,GAAK,UAAU,OAAS,EAAI,CAC3B,KAAK,QAAS,KAAK,QAAS,EAAGC,CAAM,EACrC,MACD,CACA,KAAK,QAAS,KAAK,QAASD,EAAKC,CAAM,CACxC,CAAC,EAKDb,GAAO,QAAUS,KCnKjB,IAAAK,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAY,KAyBhB,SAASC,GAAkBC,EAAI,CAC9B,IAAIC,EAAIH,GAAWE,CAAE,EACrB,MAAO,CACN,KAAQA,EACR,iBAAoBC,EAAE,iBACtB,UAAaA,EAAE,SAChB,CACD,CAKAJ,GAAO,QAAUE,KC3DjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,KACpBC,GAAmB,KACnBC,GAAmB,IACnBC,GAAiB,QAAS,6CAA8C,EACxEC,GAAgB,QAAS,4CAA6C,EAwB1E,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAID,EAAE,OAAQC,IAC1B,GAAKD,EAAGC,CAAE,EACT,MAAO,GAGT,MAAO,EACR,CA2BA,SAASC,GAAWF,EAAI,CACvB,IAAIG,EACAC,EACA,EAKJ,IAHAD,EAAOH,EAAE,KACTI,EAAMJ,EAAE,UAAW,CAAE,EAEf,EAAI,EAAG,EAAIG,EAAK,OAAQ,IAC7B,GAAKC,EAAKD,EAAM,CAAE,EACjB,MAAO,GAGT,MAAO,EACR,CAuBA,SAASE,GAAKL,EAAI,CACjB,IAAIM,EAAMV,GAAkBI,CAAE,EAC9B,OAAKM,EAAI,iBAEHZ,GAAmBM,CAAE,EAClBD,GAAUF,GAAgBG,EAAG,CAAE,CAAE,EAEpCL,GAAkBK,CAAE,EACjBD,GAAUD,GAAeE,EAAG,CAAE,CAAE,EAEjCE,GAAWI,CAAI,EAEhBP,GAAUC,CAAE,CACpB,CAKAP,GAAO,QAAUY,KC5IjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAqBvB,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAqBA,SAASC,GAAUC,EAAGC,EAAWC,EAAU,CAC1C,IAAI,EACJ,IAAM,EAAI,EAAG,EAAIF,EAAE,OAAQ,IAC1B,GAAKC,EAAU,KAAMC,EAASF,EAAG,CAAE,EAAG,EAAGA,CAAE,EAC1C,MAAO,GAGT,MAAO,EACR,CAwBA,SAASG,GAAWH,EAAGC,EAAWC,EAAU,CAC3C,IAAIE,EACAC,EACAC,EAKJ,IAHAF,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EAEfM,EAAI,EAAGA,EAAIF,EAAK,OAAQE,IAC7B,GAAKL,EAAU,KAAMC,EAASG,EAAKD,EAAME,CAAE,EAAGA,EAAGF,CAAK,EACrD,MAAO,GAGT,MAAO,EACR,CAuBA,SAASG,GAAOP,EAAGC,EAAWC,EAAU,CACvC,IAAIL,EACJ,OAAKD,GAAWI,EAAG,MAAO,EAClBA,EAAE,KAAMC,EAAWC,CAAQ,GAEnCL,EAAMF,GAAkBK,CAAE,EACrBH,EAAI,iBACDM,GAAWN,EAAKI,EAAWC,CAAQ,EAEpCH,GAAUC,EAAGC,EAAWC,CAAQ,EACxC,CAKAR,GAAO,QAAUa,KCtJjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAwBvB,SAASC,GAAUC,EAAGC,EAAWC,EAAU,CAC1C,IAAI,EACJ,IAAM,EAAIF,EAAE,OAAO,EAAG,GAAK,EAAG,IAC7B,GAAKC,EAAU,KAAMC,EAASF,EAAG,CAAE,EAAG,EAAGA,CAAE,EAC1C,MAAO,GAGT,MAAO,EACR,CAwBA,SAASG,GAAWH,EAAGC,EAAWC,EAAU,CAC3C,IAAIE,EACAC,EACAC,EAKJ,IAHAF,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EAEfM,EAAIF,EAAK,OAAO,EAAGE,GAAK,EAAGA,IAChC,GAAKL,EAAU,KAAMC,EAASG,EAAKD,EAAME,CAAE,EAAGA,EAAGF,CAAK,EACrD,MAAO,GAGT,MAAO,EACR,CAuBA,SAASG,GAAYP,EAAGC,EAAWC,EAAU,CAC5C,IAAIM,EAAMV,GAAkBE,CAAE,EAC9B,OAAKQ,EAAI,iBACDL,GAAWK,EAAKP,EAAWC,CAAQ,EAEpCH,GAAUC,EAAGC,EAAWC,CAAQ,CACxC,CAKAL,GAAO,QAAUU,KC9HjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAkB,KAClBC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IAgBZ,SAASC,GAAUC,EAAGC,EAAQ,CAC7B,IAAIC,EACAC,EACAC,EACAC,EAeJ,IAZAD,EAAKN,GAAOE,CAAE,EAGTL,GAAiBK,CAAE,EACvBG,EAAMP,GAAgBQ,CAAG,EAEzBD,EAAMN,GAAQO,CAAG,EAGlBF,EAAMF,EAAE,OAGFK,EAAI,EAAGA,EAAIH,EAAKG,IACrB,GAAKF,EAAKH,EAAGK,CAAE,IAAMJ,EACpB,MAAO,GAGT,MAAO,EACR,CAKAP,GAAO,QAAUK,KCvEjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,QAAS,8BAA+B,EACvDC,GAAkB,KAClBC,GAAiB,KACjBC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EAmB9C,SAASC,GAASC,EAAI,CACrB,IAAIC,EACAC,EACAC,EAEJ,GAAK,CAACT,GAAcM,CAAE,EACrB,MAAM,IAAI,UAAWF,GAAQ,oEAAqEE,CAAE,CAAE,EAGvG,OAAAG,EAAKN,GAAOG,CAAE,EAGTL,GAAiBK,CAAE,IACvBC,EAAML,GAAgBO,CAAG,GAG1BD,EAAMF,EAAE,OAECC,IAAQ,OAAWG,EAAWC,EAYvC,SAASD,EAAUE,EAAQ,CAC1B,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAIL,EAAKK,IACrB,GAAKP,EAAGO,CAAE,IAAMD,EACf,MAAO,GAGT,MAAO,EACR,CAQA,SAASD,EAAWC,EAAQ,CAC3B,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAIL,EAAKK,IACrB,GAAKN,EAAKD,EAAGO,CAAE,IAAMD,EACpB,MAAO,GAGT,MAAO,EACR,CACD,CAKAb,GAAO,QAAUM,KCzGjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgCA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAU,KAKdF,GAAaC,GAAM,UAAWC,EAAQ,EAKtCH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,KACpBC,GAAmB,KACnBC,GAAmB,IACnBC,GAAiB,QAAS,6CAA8C,EACxEC,GAAgB,QAAS,4CAA6C,EACtEC,GAAc,QAAS,8BAA+B,EA2B1D,SAASC,GAAUC,EAAGC,EAAI,CACzB,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAC1B,GAAK,CAACJ,GAAaE,EAAGE,CAAE,EAAGD,EAAGC,CAAE,CAAE,EACjC,MAAO,GAGT,MAAO,EACR,CA8BA,SAASC,GAAWH,EAAGC,EAAI,CAC1B,IAAIG,EACAC,EACAC,EACAC,EACAL,EAQJ,IANAE,EAAQJ,EAAE,KACVK,EAAQJ,EAAE,KAEVK,EAAON,EAAE,UAAW,CAAE,EACtBO,EAAON,EAAE,UAAW,CAAE,EAEhBC,EAAI,EAAGA,EAAIE,EAAM,OAAQF,IAC9B,GAAK,CAACJ,GAAaQ,EAAMF,EAAOF,CAAE,EAAGK,EAAMF,EAAOH,CAAE,CAAE,EACrD,MAAO,GAGT,MAAO,EACR,CA0BA,SAASM,GAAeR,EAAGC,EAAI,CAC9B,IAAIQ,EACAC,EACAC,EACAC,EACAC,EAEJ,OAAKb,EAAE,SAAWC,EAAE,OACZ,IAERS,EAAKf,GAAkBK,CAAE,EACzBW,EAAKhB,GAAkBM,CAAE,EACpBS,EAAG,kBAAoBC,EAAG,kBAC9BF,EAAM,EAGDhB,GAAmBO,CAAE,GACzBY,EAAKhB,GAAgBI,EAAG,CAAE,EAC1BS,GAAO,GACIf,GAAkBM,CAAE,IAC/BY,EAAKf,GAAeG,EAAG,CAAE,EACzBS,GAAO,GAEHhB,GAAmBQ,CAAE,GACzBY,EAAKjB,GAAgBK,EAAG,CAAE,EAC1BQ,GAAO,GACIf,GAAkBO,CAAE,IAC/BY,EAAKhB,GAAeI,EAAG,CAAE,EACzBQ,GAAO,GAEHA,IAAQ,EACLV,GAAUa,EAAIC,CAAG,EAElBV,GAAWO,EAAIC,CAAG,GAEnBZ,GAAUC,EAAGC,CAAE,EACvB,CAKAT,GAAO,QAAUgB,KClLjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0BA,IAAIC,GAAc,QAAS,yCAA0C,EAUjEC,GAAK,CAAC,EASVD,GAAaC,GAAI,WAAY,IAA6C,EAS1ED,GAAaC,GAAI,gBAAiB,IAAoD,EAStFD,GAAaC,GAAI,kBAAmB,IAAsD,EAS1FD,GAAaC,GAAI,mBAAoB,IAAsD,EAS3FD,GAAaC,GAAI,oBAAqB,IAAuD,EAK7FF,GAAO,QAAUE,KCtFjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAkB,KAClBC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IAkBZ,SAASC,GAAeC,EAAI,CAC3B,IAAIC,EAAKH,GAAOE,CAAE,EAClB,OAAKL,GAAiBK,CAAE,EAChBJ,GAAgBK,CAAG,EAEpBJ,GAAQI,CAAG,CACnB,CAKAP,GAAO,QAAUK,KCtDjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAqBpB,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAwBA,SAASC,GAAIC,EAAGC,EAAQ,CACvB,IAAIC,EACJ,GAAKN,GAAWI,EAAG,IAAK,EACvB,OAAOA,EAAE,GAAIC,CAAM,EAEpB,GAAKA,EAAQ,GAEZ,GADAA,GAASD,EAAE,OACNC,EAAQ,EACZ,eAEUA,GAASD,EAAE,OACtB,OAED,OAAAE,EAAMP,GAAeK,CAAE,EAChBE,EAAKF,EAAGC,CAAM,CACtB,CAKAP,GAAO,QAAUK,KCzFjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,SAASC,GAAMC,EAAGC,EAAIC,EAAK,CAC1B,IAAIC,EACAC,EAMJ,GAJAA,EAAIJ,EAAE,OACDC,EAAK,IACTA,GAAMG,GAEF,EAAAH,EAAK,GAAKA,GAAMG,KAGrBD,EAAKH,EAAGC,CAAG,EACXG,EAAID,EAAG,OACFD,EAAK,IACTA,GAAME,GAEF,EAAAF,EAAK,GAAKA,GAAME,IAGrB,OAAOD,EAAID,CAAG,CACf,CAKAJ,GAAO,QAAUC,KCnEjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA2CA,SAASC,GAAMC,EAAGC,EAAIC,EAAIC,EAAK,CAC9B,IAAIC,EACAC,EACAC,EAMJ,GAJAA,EAAIN,EAAE,OACDC,EAAK,IACTA,GAAMK,GAEF,EAAAL,EAAK,GAAKA,GAAMK,KAGrBF,EAAKJ,EAAGC,CAAG,EACXK,EAAIF,EAAG,OACFF,EAAK,IACTA,GAAMI,GAEF,EAAAJ,EAAK,GAAKA,GAAMI,KAGrBD,EAAKD,EAAIF,CAAG,EACZI,EAAID,EAAG,OACFF,EAAK,IACTA,GAAMG,GAEF,EAAAH,EAAK,GAAKA,GAAMG,KAGrB,OAAOD,EAAIF,CAAG,CACf,CAKAL,GAAO,QAAUC,KC7EjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,SAASC,GAAMC,EAAGC,EAAIC,EAAIC,EAAIC,EAAK,CAClC,IAAIC,EACAC,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAM,CAAEL,EAAIC,EAAIC,EAAIC,CAAG,EACvBC,EAAQL,EACFQ,EAAI,EAAGA,EAAIF,EAAI,OAAQE,IAAM,CAMlC,GALAC,EAAIH,EAAKE,CAAE,EACXD,EAAIF,EAAM,OACLI,EAAI,IACRA,GAAKF,GAEDE,EAAI,GAAKA,GAAKF,EAClB,OAEDF,EAAQA,EAAOI,CAAE,CAClB,CACA,OAAOJ,CACR,CAKAP,GAAO,QAAUC,KCtEjB,IAAAW,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6CA,SAASC,GAAMC,EAAGC,EAAIC,EAAIC,EAAIC,EAAIC,EAAK,CACtC,IAAIC,EACAC,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAM,CAAEN,EAAIC,EAAIC,EAAIC,EAAIC,CAAG,EAC3BC,EAAQN,EACFS,EAAI,EAAGA,EAAIF,EAAI,OAAQE,IAAM,CAMlC,GALAC,EAAIH,EAAKE,CAAE,EACXD,EAAIF,EAAM,OACLI,EAAI,IACRA,GAAKF,GAEDE,EAAI,GAAKA,GAAKF,EAClB,OAEDF,EAAQA,EAAOI,CAAE,CAClB,CACA,OAAOJ,CACR,CAKAR,GAAO,QAAUC,KCvEjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,SAASC,GAAMC,EAAGC,EAAK,CACtB,IAAIC,EACAC,EACAC,EACAC,EACAC,EAGJ,IADAH,EAAM,CAAEF,CAAG,EACLI,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAClCF,EAAI,KAAM,UAAWE,CAAE,CAAE,EAG1B,IADAH,EAAQF,EACFK,EAAI,EAAGA,EAAIF,EAAI,OAAQE,IAAM,CAMlC,GALAC,EAAIH,EAAKE,CAAE,EACXD,EAAIF,EAAM,OACLI,EAAI,IACRA,GAAKF,GAEDE,EAAI,GAAKA,GAAKF,EAClB,OAEDF,EAAQA,EAAOI,CAAE,CAClB,CACA,OAAOJ,CACR,CAKAJ,GAAO,QAAUC,KCvEjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAoBpB,SAASC,GAAkBC,EAAGC,EAAS,CACtC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GADAJ,EAAMJ,EAAE,OACHC,EAAO,SAAWG,EACtB,MAAM,IAAI,WAAY,6EAA8E,EAErG,GAAKA,IAAQ,EACZ,MAAO,CAAC,EAQT,IALAF,EAAOJ,GAAeE,CAAE,EACxBG,EAAOL,GAAeG,CAAO,EAG7BI,EAAM,CAAE,CAAC,EAAG,CAAC,CAAE,EACTG,EAAI,EAAGA,EAAIJ,EAAKI,IACrBD,EAAIL,EAAMF,EAAGQ,CAAE,EACfF,EAAIH,EAAMF,EAAQO,CAAE,EACfF,EACJD,EAAK,CAAE,EAAE,KAAM,CAAEG,EAAGD,CAAE,CAAE,EAExBF,EAAK,CAAE,EAAE,KAAM,CAAEG,EAAGD,CAAE,CAAE,EAG1B,OAAOF,CACR,CAKAR,GAAO,QAAUE,KChFjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAuBpB,SAASC,GAAoBC,EAAGC,EAAWC,EAAU,CACpD,IAAIC,EACAC,EACAC,EACAC,EACAC,EAIJ,GADAH,EAAMJ,EAAE,OACHI,IAAQ,EACZ,MAAO,CAAC,EAOT,IAJAD,EAAML,GAAeE,CAAE,EAGvBK,EAAM,CAAE,CAAC,EAAG,CAAC,CAAE,EACTE,EAAI,EAAGA,EAAIH,EAAKG,IACrBD,EAAIH,EAAKH,EAAGO,CAAE,EACTN,EAAU,KAAMC,EAASI,EAAGC,EAAGP,CAAE,EACrCK,EAAK,CAAE,EAAE,KAAM,CAAEE,EAAGD,CAAE,CAAE,EAExBD,EAAK,CAAE,EAAE,KAAM,CAAEE,EAAGD,CAAE,CAAE,EAG1B,OAAOD,CACR,CAKAR,GAAO,QAAUE,KC5EjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAoBpB,SAASC,GAAkBC,EAAGC,EAAS,CACtC,IAAIC,EACAC,EACAC,EACAC,EACAC,EAIJ,GADAH,EAAMH,EAAE,OACHC,EAAO,SAAWE,EACtB,MAAM,IAAI,WAAY,6EAA8E,EAErG,GAAKA,IAAQ,EACZ,MAAO,CAAC,EAOT,IAJAD,EAAOJ,GAAeG,CAAO,EAG7BG,EAAM,CAAE,CAAC,EAAG,CAAC,CAAE,EACTE,EAAI,EAAGA,EAAIH,EAAKG,IACrBD,EAAIH,EAAMD,EAAQK,CAAE,EACfD,EACJD,EAAK,CAAE,EAAE,KAAME,CAAE,EAEjBF,EAAK,CAAE,EAAE,KAAME,CAAE,EAGnB,OAAOF,CACR,CAKAP,GAAO,QAAUE,KC5EjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAuBpB,SAASC,GAAoBC,EAAGC,EAAWC,EAAU,CACpD,IAAIC,EACAC,EACAC,EACAC,EAIJ,GADAF,EAAMJ,EAAE,OACHI,IAAQ,EACZ,MAAO,CAAC,EAOT,IAJAD,EAAML,GAAeE,CAAE,EAGvBK,EAAM,CAAE,CAAC,EAAG,CAAC,CAAE,EACTC,EAAI,EAAGA,EAAIF,EAAKE,IAChBL,EAAU,KAAMC,EAASC,EAAKH,EAAGM,CAAE,EAAGA,EAAGN,CAAE,EAC/CK,EAAK,CAAE,EAAE,KAAMC,CAAE,EAEjBD,EAAK,CAAE,EAAE,KAAMC,CAAE,EAGnB,OAAOD,CACR,CAKAR,GAAO,QAAUE,KC1EjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAoBpB,SAASC,GAAiBC,EAAGC,EAAS,CACrC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GADAJ,EAAMJ,EAAE,OACHC,EAAO,SAAWG,EACtB,MAAM,IAAI,WAAY,6EAA8E,EAErG,GAAKA,IAAQ,EACZ,MAAO,CAAC,EAQT,IALAF,EAAOJ,GAAeE,CAAE,EACxBG,EAAOL,GAAeG,CAAO,EAG7BI,EAAM,CAAE,CAAC,EAAG,CAAC,CAAE,EACTG,EAAI,EAAGA,EAAIJ,EAAKI,IACrBD,EAAIL,EAAMF,EAAGQ,CAAE,EACfF,EAAIH,EAAMF,EAAQO,CAAE,EACfF,EACJD,EAAK,CAAE,EAAE,KAAME,CAAE,EAEjBF,EAAK,CAAE,EAAE,KAAME,CAAE,EAGnB,OAAOF,CACR,CAKAR,GAAO,QAAUE,KChFjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAuBpB,SAASC,GAAmBC,EAAGC,EAAWC,EAAU,CACnD,IAAIC,EACAC,EACAC,EACAC,EACAC,EAIJ,GADAH,EAAMJ,EAAE,OACHI,IAAQ,EACZ,MAAO,CAAC,EAOT,IAJAD,EAAML,GAAeE,CAAE,EAGvBK,EAAM,CAAE,CAAC,EAAG,CAAC,CAAE,EACTE,EAAI,EAAGA,EAAIH,EAAKG,IACrBD,EAAIH,EAAKH,EAAGO,CAAE,EACTN,EAAU,KAAMC,EAASI,EAAGC,EAAGP,CAAE,EACrCK,EAAK,CAAE,EAAE,KAAMC,CAAE,EAEjBD,EAAK,CAAE,EAAE,KAAMC,CAAE,EAGnB,OAAOD,CACR,CAKAR,GAAO,QAAUE,KC5EjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,SAASC,GAAUC,EAAQC,EAAOC,EAAM,CACvC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAT,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAMtB,IAHAM,EAAIV,EAAQ,CAAE,EACdW,EAAIX,EAAQ,CAAE,EACdY,EAAIZ,EAAQ,CAAE,EACRM,EAAK,EAAGA,EAAKF,EAAIE,IAItB,IAHAC,EAAKG,EAAGJ,CAAG,EACXE,EAAKG,EAAGL,CAAG,EACXG,EAAKG,EAAGN,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBI,EAAIJ,CAAG,EAAIH,EAAKK,EAAIF,CAAG,EAAGG,EAAIH,CAAG,CAAE,CAGtC,CAKAP,GAAO,QAAUC,KCnFjB,IAAAc,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KClDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,SAASC,GAAUC,EAAQC,EAAOC,EAAM,CACvC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAd,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAMjC,IAHAU,EAAIf,EAAQ,CAAE,EACdgB,EAAIhB,EAAQ,CAAE,EACdiB,EAAIjB,EAAQ,CAAE,EACRQ,EAAK,EAAGA,EAAKH,EAAIG,IAItB,IAHAE,EAAKK,EAAGP,CAAG,EACXI,EAAKI,EAAGR,CAAG,EACXM,EAAKG,EAAGT,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAItB,IAHAE,EAAKC,EAAIH,CAAG,EACZI,EAAKC,EAAIL,CAAG,EACZM,EAAKC,EAAIP,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBO,EAAIP,CAAG,EAAIJ,EAAKO,EAAIH,CAAG,EAAGK,EAAIL,CAAG,CAAE,CAIvC,CAKAR,GAAO,QAAUC,KC9FjB,IAAAmB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KClDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,SAASC,GAAUC,EAAQC,EAAOC,EAAM,CACvC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,GAJAnB,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAM5C,IAHAc,EAAIpB,EAAQ,CAAE,EACdqB,EAAIrB,EAAQ,CAAE,EACdsB,EAAItB,EAAQ,CAAE,EACRU,EAAK,EAAGA,EAAKJ,EAAII,IAItB,IAHAG,EAAKO,EAAGV,CAAG,EACXM,EAAKK,EAAGX,CAAG,EACXS,EAAKG,EAAGZ,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAItB,IAHAG,EAAKC,EAAIJ,CAAG,EACZM,EAAKC,EAAIP,CAAG,EACZS,EAAKC,EAAIV,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAItB,IAHAG,EAAKC,EAAIJ,CAAG,EACZM,EAAKC,EAAIP,CAAG,EACZS,EAAKC,EAAIV,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBU,EAAIV,CAAG,EAAIL,EAAKS,EAAIJ,CAAG,EAAGO,EAAIP,CAAG,CAAE,CAKxC,CAKAT,GAAO,QAAUC,KCzGjB,IAAAwB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KClDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,SAASC,GAAUC,EAAQC,EAAOC,EAAM,CACvC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAOJ,GALAxB,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAMvD,IAHAkB,EAAIzB,EAAQ,CAAE,EACd0B,EAAI1B,EAAQ,CAAE,EACd2B,EAAI3B,EAAQ,CAAE,EACRY,EAAK,EAAGA,EAAKL,EAAIK,IAItB,IAHAI,EAAKS,EAAGb,CAAG,EACXQ,EAAKM,EAAGd,CAAG,EACXY,EAAKG,EAAGf,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAItB,IAHAI,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAIT,CAAG,EACZY,EAAKC,EAAIb,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAItB,IAHAI,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAIT,CAAG,EACZY,EAAKC,EAAIb,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAItB,IAHAI,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAIT,CAAG,EACZY,EAAKC,EAAIb,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBa,EAAIb,CAAG,EAAIN,EAAKW,EAAIL,CAAG,EAAGS,EAAIT,CAAG,CAAE,CAMzC,CAKAV,GAAO,QAAUC,KCpHjB,IAAA6B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KClDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmCA,SAASC,GAASC,EAAGC,EAAGC,EAAGC,EAAOC,EAAOC,EAAKC,EAAM,CACnD,IAAIC,EACAC,EACAC,EAOJ,GALAF,EAAIH,EAAOC,CAAI,EAGfG,EAAIH,EAAM,EAELG,IAAML,EAAQ,CAElB,IAAMM,EAAI,EAAGA,EAAIF,EAAGE,IACnBP,EAAGO,CAAE,EAAIH,EAAKN,EAAGS,CAAE,EAAGR,EAAGQ,CAAE,CAAE,EAE9B,MACD,CAEA,IAAMA,EAAI,EAAGA,EAAIF,EAAGE,IACnBV,GAASC,EAAGS,CAAE,EAAGR,EAAGQ,CAAE,EAAGP,EAAGO,CAAE,EAAGN,EAAOC,EAAOI,EAAGF,CAAI,CAExD,CAiCA,SAASI,GAAUC,EAAQP,EAAOE,EAAM,CACvC,OAAOP,GAASY,EAAQ,CAAE,EAAGA,EAAQ,CAAE,EAAGA,EAAQ,CAAE,EAAGP,EAAM,OAAQA,EAAO,EAAGE,CAAI,CACpF,CAKAR,GAAO,QAAUY,KChGjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KClDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgCA,SAASC,GAAMC,EAAI,CAClB,IAAIC,EACAC,EACA,EAIJ,IAFAA,EAAMF,EAAE,OACRC,EAAM,CAAC,EACD,EAAI,EAAG,EAAIC,EAAK,IACrBD,EAAI,KAAMD,EAAG,CAAE,CAAE,EAElB,OAAOC,CACR,CAKAH,GAAO,QAAUC,KChDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,SAASC,GAAQC,EAAOC,EAAM,CAC7B,IAAIC,EACA,EAIJ,IADAA,EAAM,CAAC,EACD,EAAI,EAAG,EAAID,EAAK,IACrBC,EAAI,KAAMF,CAAM,EAEjB,OAAOE,CACR,CAKAJ,GAAO,QAAUC,KCpDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAeb,SAASC,GAAOC,EAAM,CACrB,OAAOF,GAAQ,EAAKE,CAAI,CACzB,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAO,KACPC,GAAQ,KACRC,GAAS,QAAS,uBAAwB,EA6D9C,SAASC,GAAgBC,EAAGC,EAASC,EAAW,CAC/C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAJ,EAAIJ,EAAS,OACbK,EAAIN,EAAQ,OACPK,EAAIC,EACR,MAAM,IAAI,MAAO,8JAA+J,EAIjL,IADAJ,EAAOH,EACDS,EAAIF,EAAGE,EAAIH,EAAGG,IACnBN,EAAO,CAAEA,CAAK,EAOf,IAHAE,EAAKR,GAAOS,CAAE,EAGRG,EAAIH,EAAE,EAAGG,GAAK,EAAGA,IAEtB,GADAC,EAAIH,EAAID,EAAIG,EACP,EAAAC,EAAI,GAMT,IAFAF,EAAIP,EAASS,CAAE,EACfN,EAAMF,EAAUO,CAAE,EACbL,IAAQ,GAAKA,EAAMI,EACvB,MAAM,IAAI,MAAOV,GAAQ,8PAA+PF,GAAMK,CAAQ,EAAE,KAAM,IAAK,EAAGL,GAAMM,CAAS,EAAE,KAAM,IAAK,EAAGO,CAAE,CAAE,EAE1V,GAAKD,IAAMJ,EAEVC,EAAII,CAAE,EAAI,UACCD,IAAM,EAEjBH,EAAII,CAAE,EAAI,MAGV,OAAM,IAAI,MAAOX,GAAQ,2IAA4IF,GAAMK,CAAQ,EAAE,KAAM,IAAK,EAAGL,GAAMM,CAAS,EAAE,KAAM,IAAK,EAAGO,CAAE,CAAE,EAIxO,MAAO,CACN,IAAOT,EACP,KAAQG,EACR,MAASP,GAAMM,CAAS,EACxB,QAAWG,CACZ,CACD,CAKAV,GAAO,QAAUI,KChJjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAiCrB,SAASC,GAAWC,EAAQC,EAAQC,EAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAL,EAAKjB,EAAQ,CAAE,EACfM,EAAKW,EAAI,CAAE,EACXV,EAAKU,EAAI,CAAE,EACN,EAAAX,GAAM,GAAKC,GAAM,GAmBtB,IAhBAY,EAAItB,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGiB,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACPjB,EAAMgB,EAAI,CAAE,EACZf,EAAMe,EAAI,CAAE,EAEZC,EAAItB,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGiB,CAAG,EACjDI,EAAIF,EAAE,KACND,EAAKC,EAAE,QACPf,EAAMc,EAAI,CAAE,EACZb,EAAMa,EAAI,CAAE,EAEZI,EAAIvB,EAAQ,CAAE,EAEdY,EAAK,EACLE,EAAK,EACCJ,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAM7B,IALAC,EAAK,EACLE,EAAK,EACLE,EAAKM,EAAGT,CAAG,EACXI,EAAKM,EAAGR,CAAG,EACXG,EAAKM,EAAGb,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBQ,EAAIR,CAAG,EAAIP,EAAKa,EAAIJ,CAAG,EAAGK,EAAIH,CAAG,CAAE,EACnCF,GAAMR,EACNU,GAAMR,EAEPO,GAAMR,EACNU,GAAMR,CACP,CACD,CAKAT,GAAO,QAAUE,KCvHjB,IAAAyB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCtDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAiCrB,SAASC,GAAWC,EAAQC,EAAQC,EAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,GAJAL,EAAK1B,EAAQ,CAAE,EACfQ,EAAKkB,EAAI,CAAE,EACXjB,EAAKiB,EAAI,CAAE,EACXhB,EAAKgB,EAAI,CAAE,EACN,EAAAlB,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAqBjC,IAlBAkB,EAAI/B,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG0B,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACP1B,EAAMyB,EAAI,CAAE,EACZxB,EAAMwB,EAAI,CAAE,EACZvB,EAAMuB,EAAI,CAAE,EAEZC,EAAI/B,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG0B,CAAG,EACjDI,EAAIF,EAAE,KACND,EAAKC,EAAE,QACPvB,EAAMsB,EAAI,CAAE,EACZrB,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAEZI,EAAIhC,EAAQ,CAAE,EAEdiB,EAAK,EACLG,EAAK,EACCN,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAM7B,IALAE,EAAK,EACLG,EAAK,EACLG,EAAKQ,EAAGb,CAAG,EACXO,EAAKO,EAAGX,CAAG,EACXM,EAAKM,EAAGlB,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAM7B,IALAE,EAAK,EACLG,EAAK,EACLG,EAAKC,EAAIN,CAAG,EACZO,EAAKC,EAAIL,CAAG,EACZM,EAAKC,EAAIb,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBa,EAAIb,CAAG,EAAIV,EAAKmB,EAAIN,CAAG,EAAGQ,EAAIL,CAAG,CAAE,EACnCH,GAAMZ,EACNe,GAAMZ,EAEPU,GAAMZ,EACNe,GAAMZ,CACP,CACAU,GAAMZ,EACNe,GAAMZ,CACP,CACD,CAKAX,GAAO,QAAUE,KC5IjB,IAAAkC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCtDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAiCrB,SAASC,GAAWC,EAAQC,EAAQC,EAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GAOJ,GALAL,EAAKnC,EAAQ,CAAE,EACfU,EAAKyB,EAAI,CAAE,EACXxB,EAAKwB,EAAI,CAAE,EACXvB,EAAKuB,EAAI,CAAE,EACXtB,EAAKsB,EAAI,CAAE,EACN,EAAAzB,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAuB5C,IApBAwB,GAAIxC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGmC,CAAG,EACjDG,GAAID,GAAE,KACND,EAAKC,GAAE,QACPnC,EAAMkC,EAAI,CAAE,EACZjC,EAAMiC,EAAI,CAAE,EACZhC,EAAMgC,EAAI,CAAE,EACZ/B,EAAM+B,EAAI,CAAE,EAEZC,GAAIxC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGmC,CAAG,EACjDI,GAAIF,GAAE,KACND,EAAKC,GAAE,QACP/B,EAAM8B,EAAI,CAAE,EACZ7B,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EACZ3B,EAAM2B,EAAI,CAAE,EAEZI,GAAIzC,EAAQ,CAAE,EAEdsB,EAAK,EACLI,EAAK,EACCR,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAM7B,IALAG,EAAK,EACLI,EAAK,EACLI,EAAKU,GAAGjB,CAAG,EACXU,EAAKQ,GAAGd,CAAG,EACXS,EAAKM,GAAGvB,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAM7B,IALAG,EAAK,EACLI,EAAK,EACLI,EAAKC,EAAIR,CAAG,EACZU,EAAKC,EAAIP,CAAG,EACZS,EAAKC,EAAIlB,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAM7B,IALAG,EAAK,EACLI,EAAK,EACLI,EAAKC,EAAIR,CAAG,EACZU,EAAKC,EAAIP,CAAG,EACZS,EAAKC,EAAIlB,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBkB,EAAIlB,CAAG,EAAIb,EAAKyB,EAAIR,CAAG,EAAGW,EAAIP,CAAG,CAAE,EACnCJ,GAAMhB,EACNoB,GAAMhB,EAEPa,GAAMhB,EACNoB,GAAMhB,CACP,CACAa,GAAMhB,EACNoB,GAAMhB,CACP,CACAa,GAAMhB,EACNoB,GAAMhB,CACP,CACD,CAKAb,GAAO,QAAUE,KCjKjB,IAAA2C,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCtDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAiCrB,SAASC,GAAWC,EAAQC,EAAQC,EAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAQJ,GANAL,GAAK5C,EAAQ,CAAE,EACfY,EAAKgC,GAAI,CAAE,EACX/B,EAAK+B,GAAI,CAAE,EACX9B,EAAK8B,GAAI,CAAE,EACX7B,EAAK6B,GAAI,CAAE,EACX5B,EAAK4B,GAAI,CAAE,EACN,EAAAhC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAyBvD,IAtBA8B,GAAIjD,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG4C,EAAG,EACjDG,GAAID,GAAE,KACND,GAAKC,GAAE,QACP5C,EAAM2C,GAAI,CAAE,EACZ1C,EAAM0C,GAAI,CAAE,EACZzC,EAAMyC,GAAI,CAAE,EACZxC,EAAMwC,GAAI,CAAE,EACZvC,EAAMuC,GAAI,CAAE,EAEZC,GAAIjD,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG4C,EAAG,EACjDI,GAAIF,GAAE,KACND,GAAKC,GAAE,QACPvC,EAAMsC,GAAI,CAAE,EACZrC,EAAMqC,GAAI,CAAE,EACZpC,EAAMoC,GAAI,CAAE,EACZnC,EAAMmC,GAAI,CAAE,EACZlC,EAAMkC,GAAI,CAAE,EAEZI,GAAIlD,EAAQ,CAAE,EAEd2B,EAAK,EACLK,EAAK,EACCV,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAM7B,IALAI,EAAK,EACLK,EAAK,EACLK,EAAKY,GAAGrB,CAAG,EACXa,GAAKS,GAAGjB,CAAG,EACXY,GAAKM,GAAG5B,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAM7B,IALAI,EAAK,EACLK,EAAK,EACLK,EAAKC,EAAIV,CAAG,EACZa,GAAKC,GAAIT,CAAG,EACZY,GAAKC,GAAIvB,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAM7B,IALAI,EAAK,EACLK,EAAK,EACLK,EAAKC,EAAIV,CAAG,EACZa,GAAKC,GAAIT,CAAG,EACZY,GAAKC,GAAIvB,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAM7B,IALAI,EAAK,EACLK,EAAK,EACLK,EAAKC,EAAIV,CAAG,EACZa,EAAKC,GAAIT,CAAG,EACZY,GAAKC,GAAIvB,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBuB,GAAIvB,CAAG,EAAIhB,EAAK+B,EAAIV,CAAG,EAAGc,EAAIT,CAAG,CAAE,EACnCL,GAAMpB,EACNyB,GAAMpB,EAEPgB,GAAMpB,EACNyB,GAAMpB,CACP,CACAgB,GAAMpB,EACNyB,GAAMpB,CACP,CACAgB,GAAMpB,EACNyB,GAAMpB,CACP,CACAgB,GAAMpB,EACNyB,GAAMpB,CACP,CACD,CAKAf,GAAO,QAAUE,KCtLjB,IAAAoD,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCtDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAqCrB,SAASC,GAAeC,EAAQC,EAAQC,EAAM,CAC7C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAP,EAAK3B,EAAQ,CAAE,EACfU,EAAKiB,EAAI,CAAE,EACXhB,EAAKgB,EAAI,CAAE,EACN,EAAAjB,GAAM,GAAKC,GAAM,GAiCtB,IA9BAkB,EAAIhC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG2B,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACP3B,EAAM0B,EAAI,CAAE,EACZzB,EAAMyB,EAAI,CAAE,EAEZC,EAAIhC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG2B,CAAG,EACjDI,EAAIF,EAAE,KACND,EAAKC,EAAE,QACPzB,EAAMwB,EAAI,CAAE,EACZvB,EAAMuB,EAAI,CAAE,EAEZC,EAAIhC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG2B,CAAG,EACjDK,EAAIH,EAAE,KACND,EAAKC,EAAE,QACPvB,EAAMsB,EAAI,CAAE,EACZrB,EAAMqB,EAAI,CAAE,EAEZC,EAAIhC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG2B,CAAG,EACjDM,EAAIJ,EAAE,KACND,EAAKC,EAAE,QACPrB,EAAMoB,EAAI,CAAE,EACZnB,EAAMmB,EAAI,CAAE,EAEZM,EAAInC,EAAQ,CAAE,EAEdgB,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAK,EACCR,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAU7B,IATAC,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAKQ,EAAGf,CAAG,EACXQ,EAAKQ,EAAGd,CAAG,EACXO,EAAKQ,EAAGb,CAAG,EACXM,EAAKQ,EAAGZ,CAAG,EACXK,EAAKQ,EAAGrB,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBc,EAAId,CAAG,EAAIX,EAAKqB,EAAIR,CAAG,EAAGS,EAAIP,CAAG,EAAGQ,EAAIN,CAAG,EAAGO,EAAIL,CAAG,CAAE,EACvDN,GAAMZ,EACNc,GAAMZ,EACNc,GAAMZ,EACNc,GAAMZ,EAEPO,GAAMZ,EACNc,GAAMZ,EACNc,GAAMZ,EACNc,GAAMZ,CACP,CACD,CAKAb,GAAO,QAAUE,KC7JjB,IAAAqC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1DjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KA0CrB,SAASC,GAAYC,EAAQC,EAAQC,EAAM,CAC1C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GAKJ,GAHAR,EAAKhC,EAAQ,CAAE,EACfY,EAAKoB,EAAI,CAAE,EACXnB,EAAKmB,EAAI,CAAE,EACN,EAAApB,GAAM,GAAKC,GAAM,GAwCtB,IArCAqB,EAAIrC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGgC,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACPhC,EAAM+B,EAAI,CAAE,EACZ9B,EAAM8B,EAAI,CAAE,EAEZC,EAAIrC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGgC,CAAG,EACjDI,EAAIF,EAAE,KACND,EAAKC,EAAE,QACP9B,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EAEZC,EAAIrC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGgC,CAAG,EACjDK,GAAIH,EAAE,KACND,EAAKC,EAAE,QACP5B,EAAM2B,EAAI,CAAE,EACZ1B,EAAM0B,EAAI,CAAE,EAEZC,EAAIrC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGgC,CAAG,EACjDM,GAAIJ,EAAE,KACND,EAAKC,EAAE,QACP1B,EAAMyB,EAAI,CAAE,EACZxB,EAAMwB,EAAI,CAAE,EAEZC,EAAIrC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGgC,CAAG,EACjDO,GAAIL,EAAE,KACND,EAAKC,EAAE,QACPxB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EAEZO,GAAIzC,EAAQ,CAAE,EAEdkB,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAK,EACCV,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAY7B,IAXAC,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAKS,EAAGlB,CAAG,EACXU,EAAKS,EAAGjB,CAAG,EACXS,EAAKS,GAAGhB,CAAG,EACXQ,EAAKS,GAAGf,CAAG,EACXO,EAAKS,GAAGd,CAAG,EACXM,EAAKS,GAAGzB,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBiB,EAAIjB,CAAG,EAAIb,EAAKyB,EAAIV,CAAG,EAAGW,EAAIT,CAAG,EAAGU,EAAIR,CAAG,EAAGS,EAAIP,CAAG,EAAGQ,EAAIN,CAAG,CAAE,EACjER,GAAMd,EACNgB,GAAMd,EACNgB,GAAMd,EACNgB,GAAMd,EACNgB,GAAMd,EAEPO,GAAMd,EACNgB,GAAMd,EACNgB,GAAMd,EACNgB,GAAMd,EACNgB,GAAMd,CACP,CACD,CAKAf,GAAO,QAAUE,KCnLjB,IAAA2C,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0DA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/DjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAmCrB,SAASC,GAAYC,EAAQC,EAAQC,EAAM,CAC1C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAN,EAAKtB,EAAQ,CAAE,EACfQ,EAAKc,EAAI,CAAE,EACXb,EAAKa,EAAI,CAAE,EACN,EAAAd,GAAM,GAAKC,GAAM,GA0BtB,IAvBAe,EAAI3B,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGsB,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACPtB,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAEZC,EAAI3B,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGsB,CAAG,EACjDI,EAAIF,EAAE,KACND,EAAKC,EAAE,QACPpB,EAAMmB,EAAI,CAAE,EACZlB,EAAMkB,EAAI,CAAE,EAEZC,EAAI3B,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGsB,CAAG,EACjDK,EAAIH,EAAE,KACND,EAAKC,EAAE,QACPlB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EAEZK,EAAI7B,EAAQ,CAAE,EAEdc,EAAK,EACLE,EAAK,EACLE,EAAK,EACCN,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAQ7B,IAPAC,EAAK,EACLE,EAAK,EACLE,EAAK,EACLE,EAAKO,EAAGZ,CAAG,EACXM,EAAKO,EAAGX,CAAG,EACXK,EAAKO,EAAGV,CAAG,EACXI,EAAKO,EAAGjB,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBW,EAAIX,CAAG,EAAIT,EAAKiB,EAAIN,CAAG,EAAGO,EAAIL,CAAG,EAAGM,EAAIJ,CAAG,CAAE,EAC7CJ,GAAMV,EACNY,GAAMV,EACNY,GAAMV,EAEPO,GAAMV,EACNY,GAAMV,EACNY,GAAMV,CACP,CACD,CAKAX,GAAO,QAAUE,KC1IjB,IAAA+B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAkCrB,SAASC,GAAUC,EAAQC,EAAQC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAJ,EAAKZ,EAAQ,CAAE,EACfI,EAAKQ,EAAI,CAAE,EACXP,EAAKO,EAAI,CAAE,EACN,EAAAR,GAAM,GAAKC,GAAM,GAYtB,IATAS,EAAIjB,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGY,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACPZ,EAAMW,EAAI,CAAE,EACZV,EAAMU,EAAI,CAAE,EAEZG,EAAIjB,EAAQ,CAAE,EAEdU,EAAK,EACCF,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAI7B,IAHAC,EAAK,EACLE,EAAKK,EAAGN,CAAG,EACXE,EAAKK,EAAGT,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBK,EAAIL,CAAG,EAAIL,EAAKS,EAAIF,CAAG,CAAE,EACzBA,GAAMN,EAEPO,GAAMN,CACP,CACD,CAKAP,GAAO,QAAUE,KCvGjB,IAAAmB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAkCrB,SAASC,GAAUC,EAAQC,EAAQC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,GAJAJ,EAAKlB,EAAQ,CAAE,EACfK,EAAKa,EAAI,CAAE,EACXZ,EAAKY,EAAI,CAAE,EACXX,EAAKW,EAAI,CAAE,EACN,EAAAb,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAYjC,IATAa,EAAIvB,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGkB,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACPlB,EAAMiB,EAAI,CAAE,EACZhB,EAAMgB,EAAI,CAAE,EACZf,EAAMe,EAAI,CAAE,EAEZG,EAAIvB,EAAQ,CAAE,EACdc,EAAK,EACCH,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAI7B,IAHAE,EAAK,EACLG,EAAKM,EAAGR,CAAG,EACXI,EAAKK,EAAGZ,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAI7B,IAHAE,EAAK,EACLG,EAAKC,EAAIH,CAAG,EACZI,EAAKC,EAAIR,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBQ,EAAIR,CAAG,EAAIP,EAAKa,EAAIH,CAAG,CAAE,EACzBA,GAAMT,EAEPU,GAAMT,CACP,CACAU,GAAMT,CACP,CACD,CAKAR,GAAO,QAAUE,KCpHjB,IAAAyB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAkCrB,SAASC,GAAUC,EAAQC,EAAQC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAOJ,GALAJ,EAAKxB,EAAQ,CAAE,EACfM,EAAKkB,EAAI,CAAE,EACXjB,EAAKiB,EAAI,CAAE,EACXhB,EAAKgB,EAAI,CAAE,EACXf,EAAKe,EAAI,CAAE,EACN,EAAAlB,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAa5C,IAVAiB,EAAI7B,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAGwB,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACPxB,EAAMuB,EAAI,CAAE,EACZtB,EAAMsB,EAAI,CAAE,EACZrB,EAAMqB,EAAI,CAAE,EACZpB,EAAMoB,EAAI,CAAE,EAEZG,EAAI7B,EAAQ,CAAE,EACdkB,EAAK,EACCJ,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAI7B,IAHAG,EAAK,EACLI,EAAKO,EAAGV,CAAG,EACXM,EAAKK,EAAGf,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAI7B,IAHAG,EAAK,EACLI,EAAKC,EAAIJ,CAAG,EACZM,EAAKC,EAAIX,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAI7B,IAHAG,EAAK,EACLI,EAAKC,EAAIJ,CAAG,EACZM,EAAKC,EAAIX,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBW,EAAIX,CAAG,EAAIT,EAAKiB,EAAIJ,CAAG,CAAE,EACzBA,GAAMZ,EAEPa,GAAMZ,CACP,CACAa,GAAMZ,CACP,CACAa,GAAMZ,CACP,CACD,CAKAT,GAAO,QAAUE,KClIjB,IAAA+B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,KAkCrB,SAASC,GAAUC,EAAQC,EAAQC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAQJ,GANAJ,EAAK9B,EAAQ,CAAE,EACfO,EAAKuB,EAAI,CAAE,EACXtB,EAAKsB,EAAI,CAAE,EACXrB,EAAKqB,EAAI,CAAE,EACXpB,EAAKoB,EAAI,CAAE,EACXnB,EAAKmB,EAAI,CAAE,EACN,EAAAvB,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAcvD,IAXAqB,EAAInC,GAAgBE,EAAQ,CAAE,EAAGC,EAAQ,CAAE,EAAG8B,CAAG,EACjDG,EAAID,EAAE,KACND,EAAKC,EAAE,QACP9B,EAAM6B,EAAI,CAAE,EACZ5B,EAAM4B,EAAI,CAAE,EACZ3B,EAAM2B,EAAI,CAAE,EACZ1B,EAAM0B,EAAI,CAAE,EACZzB,EAAMyB,EAAI,CAAE,EAEZG,EAAInC,EAAQ,CAAE,EACdsB,EAAK,EACCL,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAI7B,IAHAI,EAAK,EACLK,EAAKQ,EAAGZ,CAAG,EACXQ,EAAKK,EAAGlB,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAI7B,IAHAI,EAAK,EACLK,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAId,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAI7B,IAHAI,EAAK,EACLK,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAId,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAI7B,IAHAI,EAAK,EACLK,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAId,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBc,EAAId,CAAG,EAAIX,EAAKqB,EAAIL,CAAG,CAAE,EACzBA,GAAMf,EAEPgB,GAAMf,CACP,CACAgB,GAAMf,CACP,CACAgB,GAAMf,CACP,CACAgB,GAAMf,CACP,CACD,CAKAV,GAAO,QAAUE,KChJjB,IAAAqC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAChBC,GAAM,QAAS,+BAAgC,EA2BnD,SAASC,GAAgBC,EAAGC,EAAI,CAC/B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA,EACAC,EACAC,EACAC,EAGJ,GADAH,EAAIP,EAAE,OACDO,GAAK,GAAKN,GAAK,EACnB,MAAO,CAAC,EAUT,IAPAC,EAAML,GAAeG,CAAE,EAGvBM,EAAMR,GAAKS,EAAGN,CAAE,EAGhBI,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIP,EAAGO,IACnBH,EAAI,KAAM,CAAE,EAIb,IADAF,EAAM,CAAC,EACDK,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAG3B,IADAE,EAAIF,EACEC,EAAIR,EAAE,EAAGQ,GAAK,EAAGA,IACtB,EAAIC,EAAIH,EACRG,GAAK,EACLA,GAAKH,EACLF,EAAKI,CAAE,EAAI,EAIZ,IADAL,EAAM,CAAC,EACDK,EAAI,EAAGA,EAAIR,EAAGQ,IACnBL,EAAI,KAAMF,EAAKF,EAAGK,EAAKI,CAAE,CAAE,CAAE,EAE9BN,EAAI,KAAMC,CAAI,CACf,CACA,OAAOD,CACR,CAKAP,GAAO,QAAUG,KCrGjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAmBpB,SAASC,GAAkBC,EAAIC,EAAK,CACnC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAQJ,IANAP,EAAOJ,GAAeE,CAAG,EACzBG,EAAOL,GAAeG,CAAG,EAEzBI,EAAIL,EAAG,OACPM,EAAIL,EAAG,OACPG,EAAM,CAAC,EACDI,EAAI,EAAGA,EAAIH,EAAGG,IAEnB,IADAD,EAAIL,EAAMF,EAAIQ,CAAE,EACVC,EAAI,EAAGA,EAAIH,EAAGG,IACnBL,EAAI,KAAM,CAAEG,EAAGJ,EAAMF,EAAIQ,CAAE,CAAE,CAAE,EAGjC,OAAOL,CACR,CAKAP,GAAO,QAAUE,KCrEjB,IAAAW,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAiBpB,SAASC,GAAiBC,EAAI,CAC7B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,IAHAL,EAAMH,GAAeE,CAAE,EACvBG,EAAIH,EAAE,OACNE,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIF,EAAGE,IAEnB,IADAD,EAAIH,EAAKD,EAAGK,CAAE,EACRC,EAAI,EAAGA,EAAIH,EAAGG,IACnBJ,EAAI,KAAM,CAAEE,EAAGH,EAAKD,EAAGM,CAAE,CAAE,CAAE,EAG/B,OAAOJ,CACR,CAKAL,GAAO,QAAUE,KC9DjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAepB,SAASC,GAAMC,EAAI,CAClB,IAAIC,EACAC,EACAC,EACAC,EAUJ,IAPAD,EAAML,GAAeE,CAAE,EAGvBE,EAAMF,EAAE,OAGRC,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIF,EAAKE,IACrBH,EAAI,KAAME,EAAKH,EAAGI,CAAE,CAAE,EAEvB,OAAOH,CACR,CAKAJ,GAAO,QAAUE,KC5DjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,iCAAkC,EA+BvD,SAASC,GAAeC,EAAGC,EAAQ,CAClC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAGJ,GADAH,EAAMJ,EAAE,OACHI,IAAQ,EACZ,OAAOJ,EAKR,IAHAG,EAAOH,EAAG,CAAE,EACZE,EAAQ,EACRG,EAAM,EACAE,EAAI,EAAGA,EAAIH,EAAKG,IACrBD,EAAIN,EAAGO,CAAE,EACJD,IAAMH,GACVD,GAAS,EACJA,GAASD,IACbD,EAAGK,CAAI,EAAIF,EACXE,GAAO,KAGRF,EAAOG,EACPJ,EAAQ,EACRF,EAAGK,CAAI,EAAIF,EACXE,GAAO,GAGT,OAAAL,EAAE,OAASK,EACJL,CACR,CA4BA,SAASQ,GAAiBR,EAAGC,EAAQ,CACpC,IAAIC,EACAC,EACAC,EACAC,EACAI,EACAH,EACAC,EAGJ,GADAH,EAAMJ,EAAE,OACHI,IAAQ,EACZ,OAAOJ,EASR,IAPAS,EAAM,GACNN,EAAOH,EAAG,CAAE,EACPF,GAAOK,CAAK,IAChBM,EAAM,IAEPP,EAAQ,EACRG,EAAM,EACAE,EAAI,EAAGA,EAAIH,EAAKG,IACrBD,EAAIN,EAAGO,CAAE,EACJD,IAAMH,GAAUM,GAAOX,GAAOQ,CAAE,GACpCJ,GAAS,EACJA,GAASD,IACbD,EAAGK,CAAI,EAAIF,EACXE,GAAO,KAGRF,EAAOG,EACPJ,EAAQ,EACRF,EAAGK,CAAI,EAAIF,EACXE,GAAO,EACPI,EAAM,GACDX,GAAOK,CAAK,IAChBM,EAAM,KAIT,OAAAT,EAAE,OAASK,EACJL,CACR,CA+BA,SAASU,GAAQV,EAAGC,EAAOU,EAAY,CACtC,OAAKA,EACGH,GAAiBR,EAAGC,CAAM,EAE3BF,GAAeC,EAAGC,CAAM,CAChC,CAKAJ,GAAO,QAAUa,KCnMjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,KACpBC,GAAmB,KACnBC,GAAmB,IACnBC,GAAiB,QAAS,6CAA8C,EACxEC,GAAgB,QAAS,4CAA6C,EAwB1E,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAID,EAAE,OAAQC,IAC1B,GAAK,CAACD,EAAGC,CAAE,EACV,MAAO,GAGT,MAAO,EACR,CA2BA,SAASC,GAAiBF,EAAI,CAC7B,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAID,EAAE,OAAQC,GAAK,EAC/B,GAAK,EAAGD,EAAGC,CAAE,GAAKD,EAAGC,EAAE,CAAE,GACxB,MAAO,GAGT,MAAO,EACR,CA2BA,SAASE,GAAWH,EAAI,CACvB,IAAII,EACAC,EACA,EAKJ,IAHAD,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EAEf,EAAI,EAAG,EAAII,EAAK,OAAQ,IAC7B,GAAK,CAACC,EAAKD,EAAM,CAAE,EAClB,MAAO,GAGT,MAAO,EACR,CAuBA,SAASE,GAAON,EAAI,CACnB,IAAIO,EAAMX,GAAkBI,CAAE,EAC9B,OAAKO,EAAI,iBAEHb,GAAmBM,CAAE,EAClBE,GAAiBL,GAAgBG,EAAG,CAAE,CAAE,EAE3CL,GAAkBK,CAAE,EACjBE,GAAiBJ,GAAeE,EAAG,CAAE,CAAE,EAExCG,GAAWI,CAAI,EAEhBR,GAAUC,CAAE,CACpB,CAKAP,GAAO,QAAUa,KC/KjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAqBvB,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAqBA,SAASC,GAAUC,EAAGC,EAAWC,EAAU,CAC1C,IAAI,EACJ,IAAM,EAAI,EAAG,EAAIF,EAAE,OAAQ,IAC1B,GAAK,CAACC,EAAU,KAAMC,EAASF,EAAG,CAAE,EAAG,EAAGA,CAAE,EAC3C,MAAO,GAGT,MAAO,EACR,CAwBA,SAASG,GAAWH,EAAGC,EAAWC,EAAU,CAC3C,IAAIE,EACAC,EACAC,EAKJ,IAHAF,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EAEfM,EAAI,EAAGA,EAAIF,EAAK,OAAQE,IAC7B,GAAK,CAACL,EAAU,KAAMC,EAASG,EAAKD,EAAME,CAAE,EAAGA,EAAGF,CAAK,EACtD,MAAO,GAGT,MAAO,EACR,CAuBA,SAASG,GAASP,EAAGC,EAAWC,EAAU,CACzC,IAAIL,EACJ,OAAKD,GAAWI,EAAG,OAAQ,EACnBA,EAAE,MAAOC,EAAWC,CAAQ,GAEpCL,EAAMF,GAAkBK,CAAE,EACrBH,EAAI,iBACDM,GAAWN,EAAKI,EAAWC,CAAQ,EAEpCH,GAAUC,EAAGC,EAAWC,CAAQ,EACxC,CAKAR,GAAO,QAAUa,KCtJjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAwBvB,SAASC,GAAUC,EAAGC,EAAWC,EAAU,CAC1C,IAAI,EACJ,IAAM,EAAIF,EAAE,OAAO,EAAG,GAAK,EAAG,IAC7B,GAAK,CAACC,EAAU,KAAMC,EAASF,EAAG,CAAE,EAAG,EAAGA,CAAE,EAC3C,MAAO,GAGT,MAAO,EACR,CAwBA,SAASG,GAAWH,EAAGC,EAAWC,EAAU,CAC3C,IAAIE,EACAC,EACAC,EAKJ,IAHAF,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EAEfM,EAAIF,EAAK,OAAO,EAAGE,GAAK,EAAGA,IAChC,GAAK,CAACL,EAAU,KAAMC,EAASG,EAAKD,EAAME,CAAE,EAAGA,EAAGF,CAAK,EACtD,MAAO,GAGT,MAAO,EACR,CAuBA,SAASG,GAAcP,EAAGC,EAAWC,EAAU,CAC9C,IAAIM,EAAMV,GAAkBE,CAAE,EAC9B,OAAKQ,EAAI,iBACDL,GAAWK,EAAKP,EAAWC,CAAQ,EAEpCH,GAAUC,EAAGC,EAAWC,CAAQ,CACxC,CAKAL,GAAO,QAAUU,KC9HjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,SAASC,GAAUC,EAAKC,EAAMC,EAAU,CACvC,IAAIC,EACAC,EAIJ,IADAD,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIJ,EAAKI,IACrBD,EAAI,KAAMF,EAAK,KAAMC,EAASE,CAAE,CAAE,EAEnC,OAAOD,CACR,CAKAL,GAAO,QAAUC,KCnDjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAoBb,SAASC,GAAUC,EAAOC,EAAQ,CACjC,IAAIC,EACAC,EACAC,EACAC,EAOJ,IALAF,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EAGdC,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAID,EAAIC,IACpBH,EAAI,KAAMJ,GAAQE,EAAOG,CAAG,CAAE,EAE/B,OAAOD,CACR,CAKAL,GAAO,QAAUE,KC9DjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,SAASC,GAAYC,EAAOC,EAAMC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAOJ,IALAH,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EAGdG,EAAM,CAAC,EACDI,EAAI,EAAGA,EAAID,EAAIC,IAAM,CAE1B,IADAH,EAAK,CAAC,EACAI,EAAI,EAAGA,EAAIH,EAAIG,IACpBJ,EAAG,KAAMH,EAAK,KAAMC,EAAS,CAAEK,EAAGC,CAAE,CAAE,CAAE,EAEzCL,EAAI,KAAMC,CAAG,CACd,CACA,OAAOD,CACR,CAKAL,GAAO,QAAUC,KC9DjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAoBb,SAASC,GAAUC,EAAOC,EAAQ,CACjC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAQJ,IANAJ,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EAGdC,EAAM,CAAC,EACDK,EAAK,EAAGA,EAAKD,EAAIC,IAAO,CAE7B,IADAJ,EAAK,CAAC,EACAK,EAAK,EAAGA,EAAKH,EAAIG,IACtBL,EAAG,KAAML,GAAQE,EAAOI,CAAG,CAAE,EAE9BF,EAAI,KAAMC,CAAG,CACd,CACA,OAAOD,CACR,CAKAL,GAAO,QAAUE,KCtEjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,SAASC,GAAYC,EAAOC,EAAMC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAQJ,IANAL,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EAGdG,EAAM,CAAC,EACDQ,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAE7B,IADAN,EAAK,CAAC,EACAK,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAE7B,IADAN,EAAK,CAAC,EACAK,EAAK,EAAGA,EAAKH,EAAIG,IACtBL,EAAG,KAAMH,EAAK,KAAMC,EAAS,CAAES,EAAID,EAAID,CAAG,CAAE,CAAE,EAE/CJ,EAAG,KAAMD,CAAG,CACb,CACAD,EAAI,KAAME,CAAG,CACd,CACA,OAAOF,CACR,CAKAL,GAAO,QAAUC,KCtEjB,IAAAa,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAoBb,SAASC,GAAUC,EAAOC,EAAQ,CACjC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,IAPAN,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EAGdC,EAAM,CAAC,EACDS,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAE7B,IADAP,EAAK,CAAC,EACAM,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAE7B,IADAP,EAAK,CAAC,EACAM,EAAK,EAAGA,EAAKH,EAAIG,IACtBN,EAAG,KAAML,GAAQE,EAAOK,CAAG,CAAE,EAE9BD,EAAG,KAAMD,CAAG,CACb,CACAD,EAAI,KAAME,CAAG,CACd,CACA,OAAOF,CACR,CAKAL,GAAO,QAAUE,KC9EjB,IAAAa,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,SAASC,GAAYC,EAAOC,EAAMC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,IAPAP,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EACdS,EAAKT,EAAO,CAAE,EACdU,EAAKV,EAAO,CAAE,EAGdG,EAAM,CAAC,EACDW,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAE7B,IADAR,EAAK,CAAC,EACAO,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAE7B,IADAR,EAAK,CAAC,EACAO,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAE7B,IADAR,EAAK,CAAC,EACAO,EAAK,EAAGA,EAAKJ,EAAII,IACtBP,EAAG,KAAMH,EAAK,KAAMC,EAAS,CAAEY,EAAID,EAAID,EAAID,CAAG,CAAE,CAAE,EAEnDN,EAAG,KAAMD,CAAG,CACb,CACAE,EAAG,KAAMD,CAAG,CACb,CACAF,EAAI,KAAMG,CAAG,CACd,CACA,OAAOH,CACR,CAKAL,GAAO,QAAUC,KC9EjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAoBb,SAASC,GAAUC,EAAOC,EAAQ,CACjC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAUJ,IARAR,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EACdS,EAAKT,EAAO,CAAE,EAGdC,EAAM,CAAC,EACDY,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAE7B,IADAT,EAAK,CAAC,EACAQ,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAE7B,IADAT,EAAK,CAAC,EACAQ,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAE7B,IADAT,EAAK,CAAC,EACAQ,EAAK,EAAGA,EAAKJ,EAAII,IACtBR,EAAG,KAAML,GAAQE,EAAOM,CAAG,CAAE,EAE9BF,EAAG,KAAMD,CAAG,CACb,CACAE,EAAG,KAAMD,CAAG,CACb,CACAF,EAAI,KAAMG,CAAG,CACd,CACA,OAAOH,CACR,CAKAL,GAAO,QAAUE,KCtFjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,SAASC,GAAYC,EAAOC,EAAMC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAUJ,IARAT,EAAKR,EAAO,CAAE,EACdS,EAAKT,EAAO,CAAE,EACdU,EAAKV,EAAO,CAAE,EACdW,EAAKX,EAAO,CAAE,EACdY,EAAKZ,EAAO,CAAE,EAGdG,EAAM,CAAC,EACDc,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAE7B,IADAV,EAAK,CAAC,EACAS,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAE7B,IADAV,EAAK,CAAC,EACAS,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAE7B,IADAV,EAAK,CAAC,EACAS,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAE7B,IADAV,EAAK,CAAC,EACAS,EAAK,EAAGA,EAAKL,EAAIK,IACtBT,EAAG,KAAMH,EAAK,KAAMC,EAAS,CAAEe,EAAID,EAAID,EAAID,EAAID,CAAG,CAAE,CAAE,EAEvDR,EAAG,KAAMD,CAAG,CACb,CACAE,EAAG,KAAMD,CAAG,CACb,CACAE,EAAG,KAAMD,CAAG,CACb,CACAH,EAAI,KAAMI,CAAG,CACd,CACA,OAAOJ,CACR,CAKAL,GAAO,QAAUC,KCtFjB,IAAAmB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAgBb,SAASC,GAASC,EAAOC,EAAOC,EAAOC,EAAKC,EAAM,CACjD,IAAIC,EACAC,EACAC,EAMJ,GAJAF,EAAIH,EAAOC,CAAI,EAGfG,EAAIH,EAAM,EACLG,IAAML,EACV,OAAOH,GAAQE,EAAOK,CAAE,EAIzB,IAAME,EAAI,EAAGA,EAAIF,EAAGE,IACnBH,EAAI,KAAML,GAASC,EAAOC,EAAOC,EAAOI,EAAG,CAAC,CAAE,CAAE,EAEjD,OAAOF,CACR,CAwBA,SAASI,GAAUR,EAAOE,EAAQ,CACjC,OAAOH,GAASC,EAAOE,EAAM,OAAQA,EAAO,EAAG,CAAC,CAAE,CACnD,CAKAL,GAAO,QAAUW,KCvFjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmCA,SAASC,GAASC,EAAOC,EAAOC,EAAKC,EAASC,EAAKC,EAAMC,EAAU,CAClE,IAAIC,EACAC,EACAC,EACAC,EACAC,EAOJ,IAJAD,EAAIR,EAAM,EACVM,EAAQE,IAAMV,EAEdS,EAAIR,EAAOC,CAAI,EACTS,EAAI,EAAGA,EAAIF,EAAGE,IACnBJ,EAAMJ,EAAQ,MAAM,EACpBI,EAAI,KAAMI,CAAE,EACPH,EACJJ,EAAI,KAAMC,EAAK,KAAMC,EAASC,CAAI,CAAE,EAEpCH,EAAI,KAAML,GAASC,EAAOC,EAAOS,EAAGH,EAAK,CAAC,EAAGF,EAAMC,CAAQ,CAAE,EAG/D,OAAOF,CACR,CAmBA,SAASQ,GAAYX,EAAOI,EAAMC,EAAU,CAC3C,OAAOP,GAASE,EAAM,OAAQA,EAAO,EAAG,CAAC,EAAG,CAAC,EAAGI,EAAMC,CAAQ,CAC/D,CAKAR,GAAO,QAAUc,KCnFjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAqBvB,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAqBA,SAASC,GAAUC,EAAGC,EAAWC,EAAU,CAC1C,IAAIC,EACAC,EACAC,EAGJ,IADAF,EAAM,CAAC,EACDE,EAAI,EAAGA,EAAIL,EAAE,OAAQK,IAC1BD,EAAIJ,EAAGK,CAAE,EACJJ,EAAU,KAAMC,EAASE,EAAGC,EAAGL,CAAE,GACrCG,EAAI,KAAMC,CAAE,EAGd,OAAOD,CACR,CAwBA,SAASG,GAAWN,EAAGC,EAAWC,EAAU,CAC3C,IAAIK,EACAC,EACAL,EACAC,EACAC,EAMJ,IAJAE,EAAOP,EAAE,KACTQ,EAAMR,EAAE,UAAW,CAAE,EAErBG,EAAM,CAAC,EACDE,EAAI,EAAGA,EAAIE,EAAK,OAAQF,IAC7BD,EAAII,EAAKD,EAAMF,CAAE,EACZJ,EAAU,KAAMC,EAASE,EAAGC,EAAGE,CAAK,GACxCJ,EAAI,KAAMC,CAAE,EAGd,OAAOD,CACR,CAuBA,SAASM,GAAQT,EAAGC,EAAWC,EAAU,CACxC,IAAIL,EACJ,OAAKD,GAAWI,EAAG,QAAS,EACpBA,EAAE,OAAQC,EAAWC,CAAQ,GAErCL,EAAMF,GAAkBK,CAAE,EACrBH,EAAI,iBACDS,GAAWT,EAAKI,EAAWC,CAAQ,EAEpCH,GAAUC,EAAGC,EAAWC,CAAQ,EACxC,CAKAR,GAAO,QAAUe,KC/JjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAepB,SAASC,GAAOC,EAAM,CACrB,IAAIC,EAEJ,GAAKD,EAAI,SAAW,EAIpB,OAAAC,EAAMH,GAAeE,CAAI,EAGlBC,EAAKD,EAAK,CAAE,CACpB,CAKAH,GAAO,QAAUE,KCrDjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,oCAAqC,EAC9DC,GAAY,QAAS,gCAAiC,EACtDC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAO,QAAS,4BAA6B,EAC7CC,GAAQ,KAKRC,GAAO,QAwBX,SAASC,GAAMC,EAAGC,EAAGC,EAAKC,EAAQC,EAAS,CAC1C,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAIJ,EAAGI,IACnBH,EAAKE,CAAO,EAAIJ,EAAGK,CAAE,EACrBD,GAAUD,CAEZ,CAeA,SAASG,GAAsBN,EAAGO,EAAOC,EAAOC,EAAKP,EAAKC,EAAQC,EAAS,CAC1E,IAAIM,EACAC,EACAC,EACAP,EAOJ,IAJAO,EAAIH,EAAM,EACVC,EAAQE,IAAML,EAEdI,EAAIH,EAAOC,CAAI,EACTJ,EAAI,EAAGA,EAAIM,EAAGN,IACdK,GACJR,EAAKE,CAAO,EAAIJ,EAAGK,CAAE,EACrBD,GAAUD,GAEVC,EAASE,GAAsBN,EAAGK,CAAE,EAAGE,EAAOC,EAAOI,EAAGV,EAAKC,EAAQC,CAAO,EAG9E,OAAOA,CACR,CAaA,SAASS,GAAwBb,EAAGO,EAAOC,EAAON,EAAKC,EAAQC,EAAS,CACvE,IAAIU,EACAC,EACAC,EACAC,EACAC,EACAC,EACAd,EAwBJ,IAnBAS,EAAMnB,GAAOa,CAAM,EAGnBO,EAAMlB,GAAOiB,CAAI,EACjBR,GAAsBN,EAAGO,EAAOC,EAAO,EAAGO,EAAK,EAAG,CAAE,EAGpDC,EAAM,YAGNE,EAAKzB,GAAee,EAAOQ,CAAI,EAG/BC,EAAKpB,GAAOU,CAAM,EAClBR,GAAMS,EAAOD,EAAOU,EAAI,EAAG,CAAE,EAC7BrB,GAAMW,EAAOU,EAAI,CAAE,EACnBrB,GAAMW,EAAOW,EAAI,CAAE,EAGbb,EAAI,EAAGA,EAAIS,EAAKT,IACrBc,EAAIzB,GAAWuB,EAAIC,EAAI,EAAGF,EAAKX,EAAGP,EAAK,EACvCI,EAAKE,CAAO,EAAIW,EAAKI,CAAE,EACvBf,GAAUD,CAEZ,CAoCA,SAASiB,GAASpB,EAAGQ,EAAOa,EAAiBnB,EAAKC,EAAQC,EAAS,CAClE,IAAIG,EAAQC,EAAM,OAClB,OAAKD,IAAU,EACPL,EAEHK,IAAU,GAEdR,GAAMC,EAAGQ,EAAO,CAAE,EAAGN,EAAKC,EAAQC,CAAO,EAClCF,GAEHmB,GACJR,GAAwBb,EAAGO,EAAOC,EAAON,EAAKC,EAAQC,CAAO,EACtDF,IAERI,GAAsBN,EAAGO,EAAOC,EAAO,EAAGN,EAAKC,EAAQC,CAAO,EACvDF,EACR,CAKAV,GAAO,QAAU4B,KC1MjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAQ,KACRC,GAAS,KA6Bb,SAASC,GAASC,EAAGC,EAAOC,EAAkB,CAC7C,IAAIC,EAAMN,GAAOD,GAAOK,CAAM,CAAE,EAChC,OAAOH,GAAQE,EAAGC,EAAOC,EAAiBC,EAAK,EAAG,CAAE,CACrD,CAKAR,GAAO,QAAUI,KC7DjB,IAAAK,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAyDA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCrEjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAgB,QAAS,oCAAqC,EAC9DC,GAAY,QAAS,gCAAiC,EACtDC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAO,QAAS,4BAA6B,EAC7CC,GAAQ,KACRC,GAAO,KAKPC,GAAO,QA8BX,SAASC,GAAQC,EAAGC,EAAGC,EAAKC,EAAQC,EAAQC,EAAMC,EAAU,CAC3D,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAIN,EAAGM,IACnBL,EAAKE,CAAO,EAAIC,EAAK,KAAMC,EAASN,EAAGO,CAAE,EAAG,CAAEA,CAAE,EAAGP,CAAE,EACrDI,GAAUD,CAEZ,CAmBA,SAASK,GAAsBC,EAAMT,EAAGU,EAAOC,EAAOC,EAAKC,EAASX,EAAKC,EAAQC,EAAQC,EAAMC,EAAU,CACxG,IAAIQ,EACAC,EACAC,EACAC,EACAV,EAOJ,IAJAU,EAAIL,EAAM,EACVE,EAAQG,IAAMP,EAEdM,EAAIL,EAAOC,CAAI,EACTL,EAAI,EAAGA,EAAIS,EAAGT,IACnBQ,EAAMF,EAAQ,MAAM,EACpBE,EAAI,KAAMR,CAAE,EACPO,GACJZ,EAAKE,CAAO,EAAIC,EAAK,KAAMC,EAASN,EAAGO,CAAE,EAAGQ,EAAKN,CAAK,EACtDL,GAAUD,GAEVC,EAASI,GAAsBC,EAAMT,EAAGO,CAAE,EAAGG,EAAOC,EAAOM,EAAGF,EAAKb,EAAKC,EAAQC,EAAQC,EAAMC,CAAQ,EAGxG,OAAOF,CACR,CAeA,SAASc,GAAwBlB,EAAGU,EAAOC,EAAOT,EAAKC,EAAQC,EAAQC,EAAMC,EAAU,CACtF,IAAIa,EACAC,EACAC,EACAC,EACAC,EACAC,EACAjB,EAuBJ,IAlBAY,EAAMzB,GAAOiB,CAAM,EAGnBS,EAAMxB,GAAOuB,CAAI,EACjBX,GAAsBR,EAAGA,EAAGU,EAAOC,EAAO,EAAG,CAAC,EAAGS,EAAK,EAAG,EAAGf,EAAMC,CAAQ,EAG1Ee,EAAM,YAGNE,EAAK/B,GAAemB,EAAOU,CAAI,EAG/BC,EAAKzB,GAAMc,CAAM,EACjBhB,GAAMe,EAAOY,EAAI,CAAE,EACnB3B,GAAMe,EAAOa,EAAI,CAAE,EAGbhB,EAAI,EAAGA,EAAIY,EAAKZ,IACrBiB,EAAI/B,GAAW6B,EAAIC,EAAI,EAAGF,EAAKd,EAAGT,EAAK,EACvCI,EAAKE,CAAO,EAAIgB,EAAKI,CAAE,EACvBpB,GAAUD,CAEZ,CA8CA,SAASsB,GAAWzB,EAAGW,EAAOe,EAAiBxB,EAAKC,EAAQC,EAAQC,EAAMC,EAAU,CACnF,IAAII,EAAQC,EAAM,OAClB,OAAKD,IAAU,EACPR,EAEHQ,IAAU,GAEdX,GAAQC,EAAGW,EAAO,CAAE,EAAGT,EAAKC,EAAQC,EAAQC,EAAMC,CAAQ,EACnDJ,GAEHwB,GACJR,GAAwBlB,EAAGU,EAAOC,EAAOT,EAAKC,EAAQC,EAAQC,EAAMC,CAAQ,EACrEJ,IAERM,GAAsBR,EAAGA,EAAGU,EAAOC,EAAO,EAAG,CAAC,EAAGT,EAAKC,EAAQC,EAAQC,EAAMC,CAAQ,EAC7EJ,EACR,CAKAX,GAAO,QAAUkC,KCrOjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAQ,KACRC,GAAS,KAuCb,SAASC,GAAWC,EAAGC,EAAOC,EAAiBC,EAAMC,EAAU,CAC9D,IAAIC,EAAMR,GAAOD,GAAOK,CAAM,CAAE,EAChC,OAAOH,GAAQE,EAAGC,EAAOC,EAAiBG,EAAK,EAAG,EAAGF,EAAMC,CAAQ,CACpE,CAKAT,GAAO,QAAUI,KCvEjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqEA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCjFjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8CA,SAASC,GAAWC,EAAGC,EAAOC,EAAkB,CAC/C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAUJ,GAPAJ,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EAGdE,EAAM,CAAC,EAGFD,EAAkB,CACtB,IAAMI,EAAK,EAAGA,EAAKF,EAAIE,IACtB,IAAMC,EAAK,EAAGA,EAAKF,EAAIE,IACtBJ,EAAI,KAAMH,EAAGO,CAAG,EAAGD,CAAG,CAAE,EAG1B,OAAOH,CACR,CACA,IAAMI,EAAK,EAAGA,EAAKF,EAAIE,IAEtB,IADAC,EAAKR,EAAGO,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBH,EAAI,KAAMK,EAAIF,CAAG,CAAE,EAGrB,OAAOH,CACR,CAKAL,GAAO,QAAUC,KClFjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqDA,SAASC,GAAWC,EAAGC,EAAOC,EAAiBC,EAAKC,EAAQC,EAAS,CACpE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAQJ,GALAL,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EAGdU,EAAKN,EACAH,EAAkB,CACtB,IAAMM,EAAK,EAAGA,EAAKF,EAAIE,IACtB,IAAMC,EAAK,EAAGA,EAAKF,EAAIE,IACtBN,EAAKQ,CAAG,EAAIX,EAAGS,CAAG,EAAGD,CAAG,EACxBG,GAAMP,EAGR,OAAOD,CACR,CACA,IAAMM,EAAK,EAAGA,EAAKF,EAAIE,IAEtB,IADAC,EAAKV,EAAGS,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBL,EAAKQ,CAAG,EAAID,EAAIF,CAAG,EACnBG,GAAMP,EAGR,OAAOD,CACR,CAKAL,GAAO,QAAUC,KCzFjB,IAAAa,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAyDA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCrEjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwDA,SAASC,GAAaC,EAAGC,EAAOC,EAAiBC,EAAMC,EAAU,CAChE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAUJ,GAPAJ,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EAGdI,EAAM,CAAC,EAGFH,EAAkB,CACtB,IAAMM,EAAK,EAAGA,EAAKF,EAAIE,IACtB,IAAMC,EAAK,EAAGA,EAAKF,EAAIE,IACtBJ,EAAI,KAAMF,EAAK,KAAMC,EAASJ,EAAGS,CAAG,EAAGD,CAAG,EAAG,CAAEC,EAAID,CAAG,EAAGR,CAAE,CAAE,EAG/D,OAAOK,CACR,CACA,IAAMI,EAAK,EAAGA,EAAKF,EAAIE,IAEtB,IADAC,EAAKV,EAAGS,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBH,EAAI,KAAMF,EAAK,KAAMC,EAASM,EAAIF,CAAG,EAAG,CAAEC,EAAID,CAAG,EAAGR,CAAE,CAAE,EAG1D,OAAOK,CACR,CAKAP,GAAO,QAAUC,KC5FjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+DA,SAASC,GAAaC,EAAGC,EAAOC,EAAiBC,EAAKC,EAAQC,EAAQC,EAAMC,EAAU,CACrF,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAQJ,GALAL,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EAGdY,EAAKR,EACAH,EAAkB,CACtB,IAAMQ,EAAK,EAAGA,EAAKF,EAAIE,IACtB,IAAMC,EAAK,EAAGA,EAAKF,EAAIE,IACtBR,EAAKU,CAAG,EAAIP,EAAK,KAAMC,EAASP,EAAGW,CAAG,EAAGD,CAAG,EAAG,CAAEC,EAAID,CAAG,EAAGV,CAAE,EAC7Da,GAAMT,EAGR,OAAOD,CACR,CACA,IAAMQ,EAAK,EAAGA,EAAKF,EAAIE,IAEtB,IADAC,EAAKZ,EAAGW,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBP,EAAKU,CAAG,EAAIP,EAAK,KAAMC,EAASK,EAAIF,CAAG,EAAG,CAAEC,EAAID,CAAG,EAAGV,CAAE,EACxDa,GAAMT,EAGR,OAAOD,CACR,CAKAL,GAAO,QAAUC,KCnGjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqEA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCjFjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8CA,SAASC,GAAWC,EAAGC,EAAOC,EAAkB,CAC/C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAWJ,GARAP,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EAGdE,EAAM,CAAC,EAGFD,EAAkB,CACtB,IAAMK,EAAK,EAAGA,EAAKH,EAAIG,IACtB,IAAMC,EAAK,EAAGA,EAAKH,EAAIG,IACtB,IAAMC,EAAK,EAAGA,EAAKH,EAAIG,IACtBN,EAAI,KAAMH,EAAGS,CAAG,EAAGD,CAAG,EAAGD,CAAG,CAAE,EAIjC,OAAOJ,CACR,CACA,IAAMM,EAAK,EAAGA,EAAKH,EAAIG,IAEtB,IADAE,EAAKX,EAAGS,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAEtB,IADAE,EAAKC,EAAIH,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBJ,EAAI,KAAMO,EAAIH,CAAG,CAAE,EAItB,OAAOJ,CACR,CAKAL,GAAO,QAAUC,KC3FjB,IAAAa,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqDA,SAASC,GAAWC,EAAGC,EAAOC,EAAiBC,EAAKC,EAAQC,EAAS,CACpE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GANAR,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EAGda,EAAKT,EACAH,EAAkB,CACtB,IAAMO,EAAK,EAAGA,EAAKH,EAAIG,IACtB,IAAMC,EAAK,EAAGA,EAAKH,EAAIG,IACtB,IAAMC,EAAK,EAAGA,EAAKH,EAAIG,IACtBR,EAAKW,CAAG,EAAId,EAAGW,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAC9BK,GAAMV,EAIT,OAAOD,CACR,CACA,IAAMQ,EAAK,EAAGA,EAAKH,EAAIG,IAEtB,IADAE,EAAKb,EAAGW,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAEtB,IADAE,EAAKC,EAAIH,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBN,EAAKW,CAAG,EAAIF,EAAIH,CAAG,EACnBK,GAAMV,EAIT,OAAOD,CACR,CAKAL,GAAO,QAAUC,KClGjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwDA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCpEjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0DA,SAASC,GAAaC,EAAGC,EAAOC,EAAiBC,EAAMC,EAAU,CAChE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAWJ,GARAP,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EAGdI,EAAM,CAAC,EAGFH,EAAkB,CACtB,IAAMO,EAAK,EAAGA,EAAKH,EAAIG,IACtB,IAAMC,EAAK,EAAGA,EAAKH,EAAIG,IACtB,IAAMC,EAAK,EAAGA,EAAKH,EAAIG,IACtBN,EAAI,KAAMF,EAAK,KAAMC,EAASJ,EAAGW,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAG,CAAEE,EAAID,EAAID,CAAG,EAAGT,CAAE,CAAE,EAI1E,OAAOK,CACR,CACA,IAAMM,EAAK,EAAGA,EAAKH,EAAIG,IAEtB,IADAE,EAAKb,EAAGW,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAEtB,IADAE,EAAKC,EAAIH,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBJ,EAAI,KAAMF,EAAK,KAAMC,EAASQ,EAAIH,CAAG,EAAG,CAAEE,EAAID,EAAID,CAAG,EAAGT,CAAE,CAAE,EAI/D,OAAOK,CACR,CAKAP,GAAO,QAAUC,KCvGjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiEA,SAASC,GAAaC,EAAGC,EAAOC,EAAiBC,EAAKC,EAAQC,EAAQC,EAAMC,EAAU,CACrF,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GANAR,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EACdS,EAAKT,EAAO,CAAE,EAGde,EAAKX,EACAH,EAAkB,CACtB,IAAMS,EAAK,EAAGA,EAAKH,EAAIG,IACtB,IAAMC,EAAK,EAAGA,EAAKH,EAAIG,IACtB,IAAMC,EAAK,EAAGA,EAAKH,EAAIG,IACtBV,EAAKa,CAAG,EAAIV,EAAK,KAAMC,EAASP,EAAGa,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAG,CAAEE,EAAID,EAAID,CAAG,EAAGX,CAAE,EACvEgB,GAAMZ,EAIT,OAAOD,CACR,CACA,IAAMU,EAAK,EAAGA,EAAKH,EAAIG,IAEtB,IADAE,EAAKf,EAAGa,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAEtB,IADAE,EAAKC,EAAIH,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBR,EAAKa,CAAG,EAAIV,EAAK,KAAMC,EAASO,EAAIH,CAAG,EAAG,CAAEE,EAAID,EAAID,CAAG,EAAGX,CAAE,EAC5DgB,GAAMZ,EAIT,OAAOD,CACR,CAKAL,GAAO,QAAUC,KC9GjB,IAAAkB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoEA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KChFjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8CA,SAASC,GAAWC,EAAGC,EAAOC,EAAkB,CAC/C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAYJ,GATAV,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EAGdE,EAAM,CAAC,EAGFD,EAAkB,CACtB,IAAMM,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtBR,EAAI,KAAMH,EAAGW,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,CAAE,EAKxC,OAAOL,CACR,CACA,IAAMQ,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKd,EAAGW,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKC,EAAIJ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKC,EAAIJ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBL,EAAI,KAAMS,EAAIJ,CAAG,CAAE,EAKvB,OAAOL,CACR,CAKAL,GAAO,QAAUC,KCpGjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqDA,SAASC,GAAWC,EAAGC,EAAOC,EAAiBC,EAAKC,EAAQC,EAAS,CACpE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAUJ,GAPAX,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EAGdgB,EAAKZ,EACAH,EAAkB,CACtB,IAAMQ,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtBV,EAAKc,CAAG,EAAIjB,EAAGa,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EACpCO,GAAMb,EAKV,OAAOD,CACR,CACA,IAAMU,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKhB,EAAGa,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKC,EAAIJ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKC,EAAIJ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBP,EAAKc,CAAG,EAAIH,EAAIJ,CAAG,EACnBO,GAAMb,EAKV,OAAOD,CACR,CAKAL,GAAO,QAAUC,KC3GjB,IAAAmB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAyDA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCrEjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0DA,SAASC,GAAaC,EAAGC,EAAOC,EAAiBC,EAAMC,EAAU,CAChE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAYJ,GATAV,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EAGdI,EAAM,CAAC,EAGFH,EAAkB,CACtB,IAAMQ,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtBR,EAAI,KAAMF,EAAK,KAAMC,EAASJ,EAAGa,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAG,CAAEG,EAAID,EAAID,EAAID,CAAG,EAAGV,CAAE,CAAE,EAKrF,OAAOK,CACR,CACA,IAAMQ,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKhB,EAAGa,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKC,EAAIJ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKC,EAAIJ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBL,EAAI,KAAMF,EAAK,KAAMC,EAASU,EAAIJ,CAAG,EAAG,CAAEG,EAAID,EAAID,EAAID,CAAG,EAAGV,CAAE,CAAE,EAKpE,OAAOK,CACR,CAKAP,GAAO,QAAUC,KChHjB,IAAAkB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiEA,SAASC,GAAaC,EAAGC,EAAOC,EAAiBC,EAAKC,EAAQC,EAAQC,EAAMC,EAAU,CACrF,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAUJ,GAPAX,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EACdS,EAAKT,EAAO,CAAE,EACdU,EAAKV,EAAO,CAAE,EAGdkB,EAAKd,EACAH,EAAkB,CACtB,IAAMU,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtB,IAAMC,EAAK,EAAGA,EAAKJ,EAAII,IACtBZ,EAAKgB,CAAG,EAAIb,EAAK,KAAMC,EAASP,EAAGe,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAG,CAAEG,EAAID,EAAID,EAAID,CAAG,EAAGZ,CAAE,EACjFmB,GAAMf,EAKV,OAAOD,CACR,CACA,IAAMY,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKlB,EAAGe,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKC,EAAIJ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAEtB,IADAG,EAAKC,EAAIJ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBT,EAAKgB,CAAG,EAAIb,EAAK,KAAMC,EAASS,EAAIJ,CAAG,EAAG,CAAEG,EAAID,EAAID,EAAID,CAAG,EAAGZ,CAAE,EAChEmB,GAAMf,EAKV,OAAOD,CACR,CAKAL,GAAO,QAAUC,KCvHjB,IAAAqB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqEA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCjFjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgDA,SAASC,GAAWC,EAAGC,EAAOC,EAAkB,CAC/C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,GAVAb,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EAGdE,EAAM,CAAC,EAGFD,EAAkB,CACtB,IAAMO,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtBV,EAAI,KAAMH,EAAGa,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,CAAE,EAM/C,OAAON,CACR,CACA,IAAMU,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKjB,EAAGa,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBN,EAAI,KAAMW,EAAIL,CAAG,CAAE,EAMxB,OAAON,CACR,CAKAL,GAAO,QAAUC,KC/GjB,IAAAmB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuDA,SAASC,GAAWC,EAAGC,EAAOC,EAAiBC,EAAKC,EAAQC,EAAS,CACpE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAWJ,GARAd,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EACdS,EAAKT,EAAO,CAAE,EAGdmB,EAAKf,EACAH,EAAkB,CACtB,IAAMS,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtBZ,EAAKiB,CAAG,EAAIpB,EAAGe,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAC1CS,GAAMhB,EAMX,OAAOD,CACR,CACA,IAAMY,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKnB,EAAGe,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBR,EAAKiB,CAAG,EAAIJ,EAAIL,CAAG,EACnBS,GAAMhB,EAMX,OAAOD,CACR,CAKAL,GAAO,QAAUC,KCtHjB,IAAAsB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAyDA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCrEjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0DA,SAASC,GAAaC,EAAGC,EAAOC,EAAiBC,EAAMC,EAAU,CAChE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,GAVAb,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EACdS,EAAKT,EAAO,CAAE,EAGdI,EAAM,CAAC,EAGFH,EAAkB,CACtB,IAAMS,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtBV,EAAI,KAAMF,EAAK,KAAMC,EAASJ,EAAGe,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAG,CAAEI,EAAID,EAAID,EAAID,EAAID,CAAG,EAAGX,CAAE,CAAE,EAMhG,OAAOK,CACR,CACA,IAAMU,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKnB,EAAGe,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBN,EAAI,KAAMF,EAAK,KAAMC,EAASY,EAAIL,CAAG,EAAG,CAAEI,EAAID,EAAID,EAAID,EAAID,CAAG,EAAGX,CAAE,CAAE,EAMzE,OAAOK,CACR,CAKAP,GAAO,QAAUC,KCzHjB,IAAAqB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiEA,SAASC,GAAaC,EAAGC,EAAOC,EAAiBC,EAAKC,EAAQC,EAAQC,EAAMC,EAAU,CACrF,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAWJ,GARAd,EAAKP,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EACdS,EAAKT,EAAO,CAAE,EACdU,EAAKV,EAAO,CAAE,EACdW,EAAKX,EAAO,CAAE,EAGdqB,EAAKjB,EACAH,EAAkB,CACtB,IAAMW,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtB,IAAMC,EAAK,EAAGA,EAAKL,EAAIK,IACtBd,EAAKmB,CAAG,EAAIhB,EAAK,KAAMC,EAASP,EAAGiB,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAGD,CAAG,EAAG,CAAEI,EAAID,EAAID,EAAID,EAAID,CAAG,EAAGb,CAAE,EAC3FsB,GAAMlB,EAMX,OAAOD,CACR,CACA,IAAMc,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKrB,EAAGiB,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAEtB,IADAI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBV,EAAKmB,CAAG,EAAIhB,EAAK,KAAMC,EAASW,EAAIL,CAAG,EAAG,CAAEI,EAAID,EAAID,EAAID,EAAID,CAAG,EAAGb,CAAE,EACpEsB,GAAMlB,EAMX,OAAOD,CACR,CAKAL,GAAO,QAAUC,KChIjB,IAAAwB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqEA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCjFjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsCA,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EACAC,EACAC,EACAC,EAGJ,IADAJ,EAAM,CAAC,EACDG,EAAK,EAAGA,EAAKJ,EAAE,OAAQI,IAAO,CAGnC,IAFAF,EAAKF,EAAGI,CAAG,EACXD,EAAK,CAAC,EACAE,EAAKH,EAAG,OAAO,EAAGG,GAAM,EAAGA,IAChCF,EAAG,KAAMD,EAAIG,CAAG,CAAE,EAEnBJ,EAAI,KAAME,CAAG,CACd,CACA,OAAOF,CACR,CAKAH,GAAO,QAAUC,KC5DjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAqBf,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAC1BD,EAAI,KAAMH,GAAUE,EAAGE,CAAE,CAAE,CAAE,EAE9B,OAAOD,CACR,CAKAJ,GAAO,QAAUE,KCzDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAqBf,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAC1BD,EAAI,KAAMH,GAAUE,EAAGE,CAAE,CAAE,CAAE,EAE9B,OAAOD,CACR,CAKAJ,GAAO,QAAUE,KCzDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAqBf,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAC1BD,EAAI,KAAMH,GAAUE,EAAGE,CAAE,CAAE,CAAE,EAE9B,OAAOD,CACR,CAKAJ,GAAO,QAAUE,KCzDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsCA,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAIF,EAAE,OAAO,EAAGE,GAAK,EAAGA,IAC7BD,EAAI,KAAMD,EAAGE,CAAE,CAAE,EAElB,OAAOD,CACR,CAKAH,GAAO,QAAUC,KCpDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAqBf,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAC1BD,EAAI,KAAMH,GAAUE,EAAGE,CAAE,CAAE,CAAE,EAE9B,OAAOD,CACR,CAKAJ,GAAO,QAAUE,KCzDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAqBf,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAC1BD,EAAI,KAAMH,GAAUE,EAAGE,CAAE,CAAE,CAAE,EAE9B,OAAOD,CACR,CAKAJ,GAAO,QAAUE,KCzDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAqBf,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAC1BD,EAAI,KAAMH,GAAUE,EAAGE,CAAE,CAAE,CAAE,EAE9B,OAAOD,CACR,CAKAJ,GAAO,QAAUE,KCzDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAwBpB,SAASC,GAAeC,EAAGC,EAAGC,EAAQC,EAAS,CAC9C,IAAIC,EACAC,EACAC,EACAC,EAQJ,IALAF,EAAMP,GAAeG,CAAE,EAGvBK,EAAKH,EACLC,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIP,EAAGO,IACnBH,EAAI,KAAMC,EAAKJ,EAAGK,CAAG,CAAE,EACvBA,GAAMJ,EAEP,OAAOE,CACR,CAKAP,GAAO,QAAUE,KCpEjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,yBAA0B,EAC7CC,GAAgB,IAoBpB,SAASC,GAAcC,EAAGC,EAAS,CAClC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACA,EACAC,EACAC,EAIJ,GADAJ,EAAMJ,EAAE,OACHC,EAAO,SAAWG,EACtB,MAAM,IAAI,WAAY,6EAA8E,EAQrG,IALAF,EAAOJ,GAAeE,CAAE,EACxBG,EAAOL,GAAeG,CAAO,EAG7BI,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIJ,EAAKI,IACrBD,EAAIL,EAAMF,EAAGQ,CAAE,EACfF,EAAIH,EAAMF,EAAQO,CAAE,EAAE,SAAS,EAC/B,EAAIH,EAAKC,CAAE,EACNT,GAAS,CAAE,EACf,EAAE,KAAM,CAAEW,EAAGD,CAAE,CAAE,EAEjBF,EAAKC,CAAE,EAAI,CAAE,CAAEE,EAAGD,CAAE,CAAE,EAGxB,OAAOF,CACR,CAKAT,GAAO,QAAUG,KChFjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,yBAA0B,EAC7CC,GAAgB,IAuBpB,SAASC,GAAgBC,EAAGC,EAAWC,EAAU,CAChD,IAAIC,EACAC,EACAC,EACAC,EACA,EACAC,EACAC,EAUJ,IAPAJ,EAAMJ,EAAE,OAGRG,EAAML,GAAeE,CAAE,EAGvBK,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIJ,EAAKI,IACrBD,EAAIJ,EAAKH,EAAGQ,CAAE,EACdF,EAAIL,EAAU,KAAMC,EAASK,EAAGC,EAAGR,CAAE,EACrC,EAAIK,EAAKC,CAAE,EACNT,GAAS,CAAE,EACf,EAAE,KAAM,CAAEW,EAAGD,CAAE,CAAE,EAEjBF,EAAKC,CAAE,EAAI,CAAE,CAAEE,EAAGD,CAAE,CAAE,EAGxB,OAAOF,CACR,CAKAT,GAAO,QAAUG,KC/EjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,yBAA0B,EAC7CC,GAAgB,IAoBpB,SAASC,GAAcC,EAAGC,EAAS,CAClC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GADAJ,EAAMH,EAAE,OACHC,EAAO,SAAWE,EACtB,MAAM,IAAI,WAAY,6EAA8E,EAOrG,IAJAD,EAAOJ,GAAeG,CAAO,EAG7BG,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIJ,EAAKI,IACrBF,EAAIH,EAAMD,EAAQM,CAAE,EAAE,SAAS,EAC/BD,EAAIF,EAAKC,CAAE,EACNR,GAASS,CAAE,EACfA,EAAE,KAAMC,CAAE,EAEVH,EAAKC,CAAE,EAAI,CAAEE,CAAE,EAGjB,OAAOH,CACR,CAKAR,GAAO,QAAUG,KC5EjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,yBAA0B,EAC7CC,GAAgB,IAuBpB,SAASC,GAAgBC,EAAGC,EAAWC,EAAU,CAChD,IAAIC,EACAC,EACAC,EACAC,EACA,EACAC,EAUJ,IAPAH,EAAMJ,EAAE,OAGRG,EAAML,GAAeE,CAAE,EAGvBK,EAAM,CAAC,EACDE,EAAI,EAAGA,EAAIH,EAAKG,IACrBD,EAAIL,EAAU,KAAMC,EAASC,EAAKH,EAAGO,CAAE,EAAGA,EAAGP,CAAE,EAC/C,EAAIK,EAAKC,CAAE,EACNT,GAAS,CAAE,EACf,EAAE,KAAMU,CAAE,EAEVF,EAAKC,CAAE,EAAI,CAAEC,CAAE,EAGjB,OAAOF,CACR,CAKAT,GAAO,QAAUG,KC7EjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,yBAA0B,EAC7CC,GAAgB,IAoBpB,SAASC,GAAaC,EAAGC,EAAS,CACjC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACA,EACAC,EACAC,EAIJ,GADAJ,EAAMJ,EAAE,OACHC,EAAO,SAAWG,EACtB,MAAM,IAAI,WAAY,6EAA8E,EAQrG,IALAF,EAAOJ,GAAeE,CAAE,EACxBG,EAAOL,GAAeG,CAAO,EAG7BI,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIJ,EAAKI,IACrBD,EAAIL,EAAMF,EAAGQ,CAAE,EACfF,EAAIH,EAAMF,EAAQO,CAAE,EAAE,SAAS,EAC/B,EAAIH,EAAKC,CAAE,EACNT,GAAS,CAAE,EACf,EAAE,KAAMU,CAAE,EAEVF,EAAKC,CAAE,EAAI,CAAEC,CAAE,EAGjB,OAAOF,CACR,CAKAT,GAAO,QAAUG,KChFjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,yBAA0B,EAC7CC,GAAgB,IAuBpB,SAASC,GAAeC,EAAGC,EAAWC,EAAU,CAC/C,IAAIC,EACAC,EACAC,EACAC,EACA,EACAC,EACAC,EAUJ,IAPAJ,EAAMJ,EAAE,OAGRG,EAAML,GAAeE,CAAE,EAGvBK,EAAM,CAAC,EACDG,EAAI,EAAGA,EAAIJ,EAAKI,IACrBD,EAAIJ,EAAKH,EAAGQ,CAAE,EACdF,EAAIL,EAAU,KAAMC,EAASK,EAAGC,EAAGR,CAAE,EACrC,EAAIK,EAAKC,CAAE,EACNT,GAAS,CAAE,EACf,EAAE,KAAMU,CAAE,EAEVF,EAAKC,CAAE,EAAI,CAAEC,CAAE,EAGjB,OAAOF,CACR,CAKAT,GAAO,QAAUG,KC/EjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAO,QAAS,gCAAiC,EAiBrD,SAASC,GAAWC,EAAIC,EAAIC,EAAY,CACvC,IAAIC,EACAC,EACAC,EAGJ,GADAD,EAAMN,IAAQG,EAAGD,GAAOE,CAAU,EAC7BE,GAAO,EACX,MAAO,CAAEJ,CAAG,EAGb,IADAG,EAAM,CAAEH,CAAG,EACLK,EAAI,EAAGA,EAAID,EAAKC,IACrBF,EAAI,KAAMH,EAAME,EAAUG,CAAG,EAE9B,OAAOF,CACR,CAKAN,GAAO,QAAUE,KC1DjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IACnBC,GAAQ,QAAS,iCAAkC,EAqBvD,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAkBA,SAASC,GAAUC,EAAGC,EAAeC,EAAWC,EAAY,CAC3D,IAAIC,EACJ,GAAKD,GAAaR,GAAOM,CAAc,EAAI,CAC1C,IAAMG,EAAIF,EAAWE,EAAIJ,EAAE,OAAQI,IAClC,GAAKT,GAAOK,EAAGI,CAAE,CAAE,EAClB,OAAOA,EAGT,MAAO,EACR,CACA,IAAMA,EAAIF,EAAWE,EAAIJ,EAAE,OAAQI,IAClC,GAAKH,IAAkBD,EAAGI,CAAE,EAC3B,OAAOA,EAGT,MAAO,EACR,CAqBA,SAASC,GAAWL,EAAGC,EAAeC,EAAWC,EAAY,CAC5D,IAAIG,EACAC,EACAH,EAKJ,GAHAE,EAAON,EAAE,KACTO,EAAMP,EAAE,UAAW,CAAE,EAEhBG,GAAaR,GAAOM,CAAc,EAAI,CAC1C,IAAMG,EAAIF,EAAWE,EAAIE,EAAK,OAAQF,IACrC,GAAKT,GAAOY,EAAKD,EAAMF,CAAE,CAAE,EAC1B,OAAOA,EAGT,MAAO,EACR,CACA,IAAMA,EAAIF,EAAWE,EAAIE,EAAK,OAAQF,IACrC,GAAKH,IAAkBM,EAAKD,EAAMF,CAAE,EACnC,OAAOA,EAGT,MAAO,EACR,CAgCA,SAASI,GAASR,EAAGC,EAAeC,EAAWC,EAAY,CAC1D,IAAIN,EACJ,OAAKD,GAAWI,EAAG,SAAU,GAAKG,IAAc,GACxCH,EAAE,QAASC,EAAeC,CAAU,GAEvCA,EAAY,IAChBA,GAAaF,EAAE,OACVE,EAAY,IAChBA,EAAY,IAGdL,EAAMH,GAAkBM,CAAE,EACrBH,EAAI,iBACDQ,GAAWR,EAAKI,EAAeC,EAAWC,CAAU,EAErDJ,GAAUC,EAAGC,EAAeC,EAAWC,CAAU,EACzD,CAKAV,GAAO,QAAUe,KChLjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAepB,SAASC,GAAMC,EAAM,CACpB,IAAIC,EACAC,EASJ,GANAD,EAAMH,GAAeE,CAAI,EAGzBE,EAAMF,EAAI,OAAS,EAGd,EAAAE,EAAM,GAGX,OAAOD,EAAKD,EAAKE,CAAI,CACtB,CAKAL,GAAO,QAAUE,KCzDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IACnBC,GAAQ,QAAS,iCAAkC,EAqBvD,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAkBA,SAASC,GAAUC,EAAGC,EAAeC,EAAWC,EAAY,CAC3D,IAAIC,EACJ,GAAKD,GAAaR,GAAOM,CAAc,EAAI,CAC1C,IAAMG,EAAIF,EAAWE,GAAK,EAAGA,IAC5B,GAAKT,GAAOK,EAAGI,CAAE,CAAE,EAClB,OAAOA,EAGT,MAAO,EACR,CACA,IAAMA,EAAIF,EAAWE,GAAK,EAAGA,IAC5B,GAAKH,IAAkBD,EAAGI,CAAE,EAC3B,OAAOA,EAGT,MAAO,EACR,CAqBA,SAASC,GAAWL,EAAGC,EAAeC,EAAWC,EAAY,CAC5D,IAAIG,EACAC,EACAH,EAKJ,GAHAE,EAAON,EAAE,KACTO,EAAMP,EAAE,UAAW,CAAE,EAEhBG,GAAaR,GAAOM,CAAc,EAAI,CAC1C,IAAMG,EAAIF,EAAWE,GAAK,EAAGA,IAC5B,GAAKT,GAAOY,EAAKD,EAAMF,CAAE,CAAE,EAC1B,OAAOA,EAGT,MAAO,EACR,CACA,IAAMA,EAAIF,EAAWE,GAAK,EAAGA,IAC5B,GAAKH,IAAkBM,EAAKD,EAAMF,CAAE,EACnC,OAAOA,EAGT,MAAO,EACR,CAgCA,SAASI,GAAaR,EAAGC,EAAeC,EAAWC,EAAY,CAC9D,IAAIN,EACJ,GAAKD,GAAWI,EAAG,aAAc,GAAKG,IAAc,GACnD,OAAOH,EAAE,YAAaC,EAAeC,CAAU,EAEhD,GAAKA,EAAY,GAEhB,GADAA,GAAaF,EAAE,OACVE,EAAY,EAChB,MAAO,QAEGA,EAAYF,EAAE,SACzBE,EAAYF,EAAE,OAAS,GAGxB,OADAH,EAAMH,GAAkBM,CAAE,EACrBH,EAAI,iBACDQ,GAAWR,EAAKI,EAAeC,EAAWC,CAAU,EAErDJ,GAAUC,EAAGC,EAAeC,EAAWC,CAAU,CACzD,CAKAV,GAAO,QAAUe,KClLjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,SAASC,GAAUC,EAAIC,EAAIC,EAAM,CAChC,IAAIC,EACAC,EACAC,EACAC,EAEJ,GAAKJ,IAAQ,EACZ,MAAO,CAAC,EAQT,IALAE,EAAIF,EAAM,EACVG,GAAMJ,EAAGD,GAAOI,EAGhBD,EAAM,CAAEH,CAAG,EACLM,EAAI,EAAGA,EAAIF,EAAGE,IACnBH,EAAI,KAAMH,EAAMK,EAAEC,CAAG,EAEtB,OAAAH,EAAI,KAAMF,CAAG,EACNE,CACR,CAKAL,GAAO,QAAUC,KC3DjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAM,QAAS,+BAAgC,EAiBnD,SAASC,GAAUC,EAAGC,EAAGC,EAAM,CAC9B,IAAIC,EACAC,EACAC,EACAC,EAEJ,GAAKJ,IAAQ,EACZ,MAAO,CAAC,EAQT,IALAE,EAAIF,EAAM,EACVG,GAAMJ,EAAED,GAAMI,EAGdD,EAAM,CAAEL,GAAK,GAAIE,CAAE,CAAE,EACfM,EAAI,EAAGA,EAAIF,EAAGE,IACnBH,EAAI,KAAML,GAAK,GAAIE,EAAGK,EAAEC,CAAG,CAAE,EAE9B,OAAAH,EAAI,KAAML,GAAK,GAAIG,CAAE,CAAE,EAChBE,CACR,CAKAN,GAAO,QAAUE,KChEjB,IAAAQ,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,SAASC,GAAOC,EAAGC,EAAOC,EAAKC,EAAU,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,IAHAN,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdS,EAAI,CAAC,EACCH,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAG7B,IAFAC,EAAKR,EAAGO,CAAG,EACXE,EAAK,CAAC,EACAH,EAAK,EAAGA,EAAKF,EAAIE,IACtBG,EAAG,KAAMP,EAAI,KAAMC,EAASK,EAAIF,CAAG,EAAG,CAAEC,EAAID,CAAG,EAAGN,CAAE,CAAE,EAEvDU,EAAE,KAAMD,CAAG,CACZ,CACA,OAAOC,CACR,CAKAZ,GAAO,QAAUC,KCtEjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuDA,SAASC,GAAOC,EAAGC,EAAGC,EAAOC,EAAKC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAL,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACTG,GAAM,GAAKC,GAAM,EACrB,OAAOL,EAER,IAAMO,EAAK,EAAGA,EAAKF,EAAIE,IAGtB,IAFAC,EAAKT,EAAGQ,CAAG,EACXE,EAAKT,EAAGO,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBG,EAAIH,CAAG,EAAIJ,EAAI,KAAMC,EAASK,EAAIF,CAAG,EAAG,CAAEC,EAAID,CAAG,EAAGP,CAAE,EAGxD,OAAOC,CACR,CAKAH,GAAO,QAAUC,KCjFjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8DA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KC1EjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,SAASC,GAAOC,EAAGC,EAAOC,EAAKC,EAAU,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,IAJAV,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACda,EAAI,CAAC,EACCL,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAG7B,IAFAG,EAAKZ,EAAGS,CAAG,EACXI,EAAK,CAAC,EACAL,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAG7B,IAFAE,EAAKE,EAAIJ,CAAG,EACZG,EAAK,CAAC,EACAJ,EAAK,EAAGA,EAAKH,EAAIG,IACtBI,EAAG,KAAMT,EAAI,KAAMC,EAASO,EAAIH,CAAG,EAAG,CAAEE,EAAID,EAAID,CAAG,EAAGP,CAAE,CAAE,EAE3Da,EAAG,KAAMF,CAAG,CACb,CACAG,EAAE,KAAMD,CAAG,CACZ,CACA,OAAOC,CACR,CAKAhB,GAAO,QAAUC,KChFjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuDA,SAASC,GAAOC,EAAGC,EAAGC,EAAOC,EAAKC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAT,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACTG,GAAM,GAAKC,GAAM,GAAKC,GAAM,EAChC,OAAON,EAER,IAAMS,EAAK,EAAGA,EAAKH,EAAIG,IAGtB,IAFAG,EAAKb,EAAGU,CAAG,EACXI,EAAKb,EAAGS,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAGtB,IAFAE,EAAKE,EAAIJ,CAAG,EACZG,EAAKE,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBI,EAAIJ,CAAG,EAAIL,EAAI,KAAMC,EAASO,EAAIH,CAAG,EAAG,CAAEE,EAAID,EAAID,CAAG,EAAGR,CAAE,EAI7D,OAAOC,CACR,CAKAH,GAAO,QAAUC,KC1FjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8DA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KC1EjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,SAASC,GAAOC,EAAGC,EAAOC,EAAKC,EAAU,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAOJ,IALAd,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdiB,EAAI,CAAC,EACCP,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAG7B,IAFAK,EAAKhB,EAAGW,CAAG,EACXM,EAAK,CAAC,EACAP,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAG7B,IAFAI,EAAKE,EAAIN,CAAG,EACZK,EAAK,CAAC,EACAN,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAG7B,IAFAG,EAAKE,EAAIL,CAAG,EACZI,EAAK,CAAC,EACAL,EAAK,EAAGA,EAAKJ,EAAII,IACtBK,EAAG,KAAMX,EAAI,KAAMC,EAASS,EAAIJ,CAAG,EAAG,CAAEG,EAAID,EAAID,EAAID,CAAG,EAAGR,CAAE,CAAE,EAE/De,EAAG,KAAMF,CAAG,CACb,CACAI,EAAG,KAAMF,CAAG,CACb,CACAG,EAAE,KAAMD,CAAG,CACZ,CACA,OAAOC,CACR,CAKApB,GAAO,QAAUC,KC1FjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuDA,SAASC,GAAOC,EAAGC,EAAGC,EAAOC,EAAKC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,GAJAb,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACTG,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,EAC3C,OAAOP,EAER,IAAMW,EAAK,EAAGA,EAAKJ,EAAII,IAGtB,IAFAK,EAAKjB,EAAGY,CAAG,EACXM,EAAKjB,EAAGW,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAGtB,IAFAI,EAAKE,EAAIN,CAAG,EACZK,EAAKE,EAAIP,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAGtB,IAFAG,EAAKE,EAAIL,CAAG,EACZI,EAAKE,EAAIN,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBK,EAAIL,CAAG,EAAIN,EAAI,KAAMC,EAASS,EAAIJ,CAAG,EAAG,CAAEG,EAAID,EAAID,EAAID,CAAG,EAAGT,CAAE,EAKlE,OAAOC,CACR,CAKAH,GAAO,QAAUC,KCnGjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8DA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KC1EjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,SAASC,GAAOC,EAAGC,EAAOC,EAAKC,EAAU,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAQJ,IANAlB,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EACdqB,EAAI,CAAC,EACCT,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAG7B,IAFAO,EAAKpB,EAAGa,CAAG,EACXQ,EAAK,CAAC,EACAT,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAG7B,IAFAM,EAAKE,EAAIR,CAAG,EACZO,EAAK,CAAC,EACAR,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAG7B,IAFAK,EAAKE,EAAIP,CAAG,EACZM,EAAK,CAAC,EACAP,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAG7B,IAFAI,EAAKE,EAAIN,CAAG,EACZK,EAAK,CAAC,EACAN,EAAK,EAAGA,EAAKL,EAAIK,IACtBM,EAAG,KAAMb,EAAI,KAAMC,EAASW,EAAIL,CAAG,EAAG,CAAEI,EAAID,EAAID,EAAID,EAAID,CAAG,EAAGT,CAAE,CAAE,EAEnEiB,EAAG,KAAMF,CAAG,CACb,CACAI,EAAG,KAAMF,CAAG,CACb,CACAI,EAAG,KAAMF,CAAG,CACb,CACAG,EAAE,KAAMD,CAAG,CACZ,CACA,OAAOC,CACR,CAKAxB,GAAO,QAAUC,KCpGjB,IAAAwB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuDA,SAASC,GAAOC,EAAGC,EAAGC,EAAOC,EAAKC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAOJ,GALAjB,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACdO,EAAKP,EAAO,CAAE,EACTG,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,EACtD,OAAOR,EAER,IAAMa,EAAK,EAAGA,EAAKL,EAAIK,IAGtB,IAFAO,EAAKrB,EAAGc,CAAG,EACXQ,EAAKrB,EAAGa,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAGtB,IAFAM,EAAKE,EAAIR,CAAG,EACZO,EAAKE,EAAIT,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAGtB,IAFAK,EAAKE,EAAIP,CAAG,EACZM,EAAKE,EAAIR,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAGtB,IAFAI,EAAKE,EAAIN,CAAG,EACZK,EAAKE,EAAIP,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBM,EAAIN,CAAG,EAAIP,EAAI,KAAMC,EAASW,EAAIL,CAAG,EAAG,CAAEI,EAAID,EAAID,EAAID,EAAID,CAAG,EAAGV,CAAE,EAMvE,OAAOC,CACR,CAKAH,GAAO,QAAUC,KC5GjB,IAAAwB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8DA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KC1EjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAAaC,EAAQC,EAAOC,EAAM,CAC1C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAX,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAOtB,IAJAO,EAAIX,EAAQ,CAAE,EACdY,EAAIZ,EAAQ,CAAE,EACda,EAAIb,EAAQ,CAAE,EACdc,EAAId,EAAQ,CAAE,EACRM,EAAK,EAAGA,EAAKF,EAAIE,IAKtB,IAJAC,EAAKI,EAAGL,CAAG,EACXE,EAAKI,EAAGN,CAAG,EACXG,EAAKI,EAAGP,CAAG,EACXI,EAAKI,EAAGR,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACjBK,EAAIL,CAAG,IAAM,IACjBI,EAAIJ,CAAG,EAAIH,EAAKK,EAAIF,CAAG,EAAGG,EAAIH,CAAG,CAAE,EAIvC,CAKAP,GAAO,QAAUC,KC3FjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAmBpB,SAASC,GAAWC,EAAGC,EAAO,CAC7B,IAAIC,EACAC,EACAC,EACAC,EAQJ,IALAH,EAAOJ,GAAeE,CAAE,EACxBG,EAAOL,GAAeG,CAAK,EAG3BG,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIL,EAAE,OAAQK,IACrBF,EAAMF,EAAMI,CAAE,GAClBD,EAAI,KAAMF,EAAMF,EAAGK,CAAE,CAAE,EAGzB,OAAOD,CACR,CAKAP,GAAO,QAAUE,KChEjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAmBpB,SAASC,GAAWC,EAAGC,EAAO,CAC7B,IAAIC,EACAC,EACAC,EACAC,EAQJ,IALAH,EAAOJ,GAAeE,CAAE,EACxBG,EAAOL,GAAeG,CAAK,EAG3BG,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIL,EAAE,OAAQK,IACpBF,EAAMF,EAAMI,CAAE,GACnBD,EAAI,KAAMF,EAAMF,EAAGK,CAAE,CAAE,EAGzB,OAAOD,CACR,CAKAP,GAAO,QAAUE,KChEjB,IAAAO,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsDA,SAASC,GAAYC,EAAQC,EAAOC,EAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAT,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAMtB,IAHAM,EAAIV,EAAQ,CAAE,EACdW,EAAIX,EAAQ,CAAE,EACdY,EAAIZ,EAAQ,CAAE,EACRM,EAAK,EAAGA,EAAKF,EAAIE,IAItB,IAHAC,EAAKG,EAAGJ,CAAG,EACXE,EAAKG,EAAGL,CAAG,EACXG,EAAKG,EAAGN,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACjBI,EAAIJ,CAAG,IAAM,IACjBG,EAAIH,CAAG,EAAIH,EAAKK,EAAIF,CAAG,CAAE,EAI7B,CAKAP,GAAO,QAAUC,KCzFjB,IAAAc,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCtDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsDA,SAASC,GAAYC,EAAQC,EAAOC,EAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAd,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAMjC,IAHAU,EAAIf,EAAQ,CAAE,EACdgB,EAAIhB,EAAQ,CAAE,EACdiB,EAAIjB,EAAQ,CAAE,EACRQ,EAAK,EAAGA,EAAKH,EAAIG,IAItB,IAHAE,EAAKK,EAAGP,CAAG,EACXI,EAAKI,EAAGR,CAAG,EACXM,EAAKG,EAAGT,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAItB,IAHAE,EAAKC,EAAIH,CAAG,EACZI,EAAKC,EAAIL,CAAG,EACZM,EAAKC,EAAIP,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACjBO,EAAIP,CAAG,IAAM,IACjBK,EAAIL,CAAG,EAAIJ,EAAKO,EAAIH,CAAG,CAAE,EAK9B,CAKAR,GAAO,QAAUC,KCpGjB,IAAAmB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCtDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8CA,SAASC,GAAmBC,EAAIC,EAAK,CACpC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiBJ,IAfAX,EAAQ,UAAU,OAGlBE,EAAM,CAAEJ,EAAIC,CAAG,EAGfE,EAAO,CAAEH,EAAG,OAAQC,EAAG,MAAO,EAG9BO,EAAM,CAAE,EAAG,CAAE,EAGbC,EAAIN,EAAM,CAAE,EAAIA,EAAM,CAAE,EAGlBQ,EAAI,EAAGA,EAAIT,EAAOS,IACvBJ,EAAM,UAAWI,CAAE,EACnBP,EAAI,KAAMG,CAAI,EACdJ,EAAK,KAAMI,EAAI,MAAO,EACtBC,EAAI,KAAM,CAAE,EACZC,GAAKN,EAAMQ,CAAE,EAId,IADAN,EAAM,CAAC,EACDM,EAAI,EAAGA,EAAIF,EAAGE,IAAM,CAGzB,IADAE,EAAIF,EACEC,EAAIV,EAAM,EAAGU,GAAK,EAAGA,IAC1BF,EAAIG,EAAIV,EAAMS,CAAE,EAChBC,GAAKH,EACLG,GAAKV,EAAMS,CAAE,EACbJ,EAAKI,CAAE,EAAIF,EAIZ,IADAJ,EAAM,CAAC,EACDM,EAAI,EAAGA,EAAIV,EAAOU,IACvBN,EAAI,KAAMF,EAAKQ,CAAE,EAAGJ,EAAKI,CAAE,CAAE,CAAE,EAEhCP,EAAI,KAAMC,CAAI,CACf,CACA,OAAOD,CACR,CAKAP,GAAO,QAAUC,KC1GjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,KACpBC,GAAmB,KACnBC,GAAmB,IACnBC,GAAiB,QAAS,6CAA8C,EACxEC,GAAgB,QAAS,4CAA6C,EAwB1E,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAID,EAAE,OAAQC,IAC1B,GAAKD,EAAGC,CAAE,EACT,MAAO,GAGT,MAAO,EACR,CA2BA,SAASC,GAAWF,EAAI,CACvB,IAAIG,EACAC,EACA,EAKJ,IAHAD,EAAOH,EAAE,KACTI,EAAMJ,EAAE,UAAW,CAAE,EAEf,EAAI,EAAG,EAAIG,EAAK,OAAQ,IAC7B,GAAKC,EAAKD,EAAM,CAAE,EACjB,MAAO,GAGT,MAAO,EACR,CAuBA,SAASE,GAAML,EAAI,CAClB,IAAIM,EAAMV,GAAkBI,CAAE,EAC9B,OAAKM,EAAI,iBAEHZ,GAAmBM,CAAE,EAClBD,GAAUF,GAAgBG,EAAG,CAAE,CAAE,EAEpCL,GAAkBK,CAAE,EACjBD,GAAUD,GAAeE,EAAG,CAAE,CAAE,EAEjCE,GAAWI,CAAI,EAEhBP,GAAUC,CAAE,CACpB,CAKAP,GAAO,QAAUY,KC5IjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAwBvB,SAASC,GAAUC,EAAGC,EAAWC,EAAU,CAC1C,IAAI,EACJ,IAAM,EAAI,EAAG,EAAIF,EAAE,OAAQ,IAC1B,GAAKC,EAAU,KAAMC,EAASF,EAAG,CAAE,EAAG,EAAGA,CAAE,EAC1C,MAAO,GAGT,MAAO,EACR,CAwBA,SAASG,GAAWH,EAAGC,EAAWC,EAAU,CAC3C,IAAIE,EACAC,EACAC,EAKJ,IAHAF,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EAEfM,EAAI,EAAGA,EAAIF,EAAK,OAAQE,IAC7B,GAAKL,EAAU,KAAMC,EAASG,EAAKD,EAAME,CAAE,EAAGA,EAAGF,CAAK,EACrD,MAAO,GAGT,MAAO,EACR,CAuBA,SAASG,GAAQP,EAAGC,EAAWC,EAAU,CACxC,IAAIM,EAAMV,GAAkBE,CAAE,EAC9B,OAAKQ,EAAI,iBACDL,GAAWK,EAAKP,EAAWC,CAAQ,EAEpCH,GAAUC,EAAGC,EAAWC,CAAQ,CACxC,CAKAL,GAAO,QAAUU,KC9HjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAwBvB,SAASC,GAAUC,EAAGC,EAAWC,EAAU,CAC1C,IAAI,EACJ,IAAM,EAAIF,EAAE,OAAO,EAAG,GAAK,EAAG,IAC7B,GAAKC,EAAU,KAAMC,EAASF,EAAG,CAAE,EAAG,EAAGA,CAAE,EAC1C,MAAO,GAGT,MAAO,EACR,CAwBA,SAASG,GAAWH,EAAGC,EAAWC,EAAU,CAC3C,IAAIE,EACAC,EACAC,EAKJ,IAHAF,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EAEfM,EAAIF,EAAK,OAAO,EAAGE,GAAK,EAAGA,IAChC,GAAKL,EAAU,KAAMC,EAASG,EAAKD,EAAME,CAAE,EAAGA,EAAGF,CAAK,EACrD,MAAO,GAGT,MAAO,EACR,CAuBA,SAASG,GAAaP,EAAGC,EAAWC,EAAU,CAC7C,IAAIM,EAAMV,GAAkBE,CAAE,EAC9B,OAAKQ,EAAI,iBACDL,GAAWK,EAAKP,EAAWC,CAAQ,EAEpCH,GAAUC,EAAGC,EAAWC,CAAQ,CACxC,CAKAL,GAAO,QAAUU,KC9HjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgCA,SAASC,GAAOC,EAAI,CACnB,IAAIC,EACAC,EAGJ,GADAD,EAAM,CAAC,EACFD,GAAK,EACT,OAAOC,EAER,IAAMC,EAAI,EAAGA,EAAIF,EAAE,EAAGE,IACrBD,EAAI,KAAMC,CAAE,EAEb,OAAOD,CACR,CAKAH,GAAO,QAAUC,KCjDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,KACpBC,GAAmB,KACnBC,GAAmB,IACnBC,GAAiB,QAAS,6CAA8C,EACxEC,GAAgB,QAAS,4CAA6C,EA0B1E,SAASC,GAASC,EAAKC,EAAQC,EAAS,CACvC,IAAIC,EACAC,EAIJ,IAFAA,EAAIF,EACJC,EAAI,EACIC,GAAK,GAAKA,EAAIJ,EAAI,QACzBA,EAAKI,CAAE,EAAID,EACXC,GAAKH,EACLE,GAAK,EAEN,OAAOH,CACR,CA+BA,SAASK,GAASL,EAAKM,EAAML,EAAQC,EAAS,CAC7C,IAAIC,EACAI,EACAH,EAKJ,IAHAG,EAAIN,EAAS,EACbG,EAAIF,EAAS,EACbC,EAAI,EACIC,GAAK,GAAKA,EAAIE,EAAK,QAC1BA,EAAMF,CAAE,EAAID,EACZG,EAAMF,EAAE,CAAE,EAAI,EACdA,GAAKG,EACLJ,GAAK,EAEN,OAAOH,CACR,CA2BA,SAASQ,GAAWR,EAAKC,EAAQC,EAAS,CACzC,IAAII,EACAG,EACAN,EACAC,EAOJ,IALAE,EAAON,EAAI,KACXS,EAAMT,EAAI,UAAW,CAAE,EAEvBI,EAAIF,EACJC,EAAI,EACIC,GAAK,GAAKA,EAAIE,EAAK,QAC1BG,EAAKH,EAAMF,EAAGD,CAAE,EAChBC,GAAKH,EACLE,GAAK,EAEN,OAAOG,CACR,CAyBA,SAASI,GAAQV,EAAKC,EAAQC,EAAS,CACtC,IAAIS,EAAMf,GAAkBI,CAAI,EAChC,OAAKW,EAAI,iBAEHjB,GAAmBM,CAAI,EACpBK,GAASL,EAAKH,GAAgBG,EAAK,CAAE,EAAGC,EAAQC,CAAO,EAE1DP,GAAkBK,CAAI,EACnBK,GAASL,EAAKF,GAAeE,EAAK,CAAE,EAAGC,EAAQC,CAAO,EAEvDM,GAAWG,EAAKV,EAAQC,CAAO,EAEhCH,GAASC,EAAKC,EAAQC,CAAO,CACrC,CAKAT,GAAO,QAAUiB,KCrMjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCxDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAeb,SAASC,GAAMC,EAAM,CACpB,OAAOF,GAAQ,EAAKE,CAAI,CACzB,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAef,SAASC,GAAQC,EAAQ,CACxB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAef,SAASC,GAAQC,EAAQ,CACxB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAef,SAASC,GAAQC,EAAQ,CACxB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAef,SAASC,GAAQC,EAAQ,CACxB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAmBf,SAASC,GAAQC,EAAQ,CACxB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAAcC,EAAQC,EAAOC,EAAM,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAb,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAQtB,IALAQ,EAAIZ,EAAQ,CAAE,EACda,EAAIb,EAAQ,CAAE,EACdc,EAAId,EAAQ,CAAE,EACde,EAAIf,EAAQ,CAAE,EACdgB,EAAIhB,EAAQ,CAAE,EACRM,EAAK,EAAGA,EAAKF,EAAIE,IAMtB,IALAC,EAAKK,EAAGN,CAAG,EACXE,EAAKK,EAAGP,CAAG,EACXG,EAAKK,EAAGR,CAAG,EACXI,EAAKK,EAAGT,CAAG,EACXK,EAAKK,EAAGV,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBM,EAAIN,CAAG,EAAIH,EAAKK,EAAIF,CAAG,EAAGG,EAAIH,CAAG,EAAGI,EAAIJ,CAAG,EAAGK,EAAIL,CAAG,CAAE,CAG1D,CAKAP,GAAO,QAAUC,KC7FjB,IAAAkB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAAcC,EAAQC,EAAOC,EAAM,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHApB,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAQjC,IALAc,EAAInB,EAAQ,CAAE,EACdoB,EAAIpB,EAAQ,CAAE,EACdqB,EAAIrB,EAAQ,CAAE,EACdsB,EAAItB,EAAQ,CAAE,EACduB,EAAIvB,EAAQ,CAAE,EACRQ,EAAK,EAAGA,EAAKH,EAAIG,IAMtB,IALAM,EAAKK,EAAGX,CAAG,EACXO,EAAKK,EAAGZ,CAAG,EACXQ,EAAKK,EAAGb,CAAG,EACXS,EAAKK,EAAGd,CAAG,EACXU,EAAKK,EAAGf,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAMtB,IALAE,EAAKK,EAAIP,CAAG,EACZG,EAAKK,EAAIR,CAAG,EACZI,EAAKK,EAAIT,CAAG,EACZK,EAAKK,EAAIV,CAAG,EACZM,EAAKK,EAAIX,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBO,EAAIP,CAAG,EAAIJ,EAAKO,EAAIH,CAAG,EAAGI,EAAIJ,CAAG,EAAGK,EAAIL,CAAG,EAAGM,EAAIN,CAAG,CAAE,CAI3D,CAKAR,GAAO,QAAUC,KC5GjB,IAAAyB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAAcC,EAAQC,EAAOC,EAAM,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,GAJA3B,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAQ5C,IALAoB,EAAI1B,EAAQ,CAAE,EACd2B,EAAI3B,EAAQ,CAAE,EACd4B,EAAI5B,EAAQ,CAAE,EACd6B,EAAI7B,EAAQ,CAAE,EACd8B,EAAI9B,EAAQ,CAAE,EACRU,EAAK,EAAGA,EAAKJ,EAAII,IAMtB,IALAW,EAAKK,EAAGhB,CAAG,EACXY,EAAKK,EAAGjB,CAAG,EACXa,EAAKK,EAAGlB,CAAG,EACXc,EAAKK,EAAGnB,CAAG,EACXe,EAAKK,EAAGpB,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAMtB,IALAO,EAAKK,EAAIZ,CAAG,EACZQ,EAAKK,EAAIb,CAAG,EACZS,EAAKK,EAAId,CAAG,EACZU,EAAKK,EAAIf,CAAG,EACZW,EAAKK,EAAIhB,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAMtB,IALAG,EAAKK,EAAIR,CAAG,EACZI,EAAKK,EAAIT,CAAG,EACZK,EAAKK,EAAIV,CAAG,EACZM,EAAKK,EAAIX,CAAG,EACZO,EAAKK,EAAIZ,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBQ,EAAIR,CAAG,EAAIL,EAAKS,EAAIJ,CAAG,EAAGK,EAAIL,CAAG,EAAGM,EAAIN,CAAG,EAAGO,EAAIP,CAAG,CAAE,CAK5D,CAKAT,GAAO,QAAUC,KC3HjB,IAAAgC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAAcC,EAAQC,EAAOC,EAAM,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAOJ,GALAlC,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAQvD,IALA0B,EAAIjC,EAAQ,CAAE,EACdkC,EAAIlC,EAAQ,CAAE,EACdmC,EAAInC,EAAQ,CAAE,EACdoC,EAAIpC,EAAQ,CAAE,EACdqC,EAAIrC,EAAQ,CAAE,EACRY,EAAK,EAAGA,EAAKL,EAAIK,IAMtB,IALAgB,EAAKK,EAAGrB,CAAG,EACXiB,EAAKK,EAAGtB,CAAG,EACXkB,EAAKK,EAAGvB,CAAG,EACXmB,EAAKK,EAAGxB,CAAG,EACXoB,EAAKK,EAAGzB,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAMtB,IALAY,EAAKK,EAAIjB,CAAG,EACZa,EAAKK,EAAIlB,CAAG,EACZc,EAAKK,EAAInB,CAAG,EACZe,EAAKK,EAAIpB,CAAG,EACZgB,EAAKK,EAAIrB,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAMtB,IALAQ,EAAKK,EAAIb,CAAG,EACZS,EAAKK,EAAId,CAAG,EACZU,EAAKK,EAAIf,CAAG,EACZW,EAAKK,EAAIhB,CAAG,EACZY,EAAKK,EAAIjB,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAMtB,IALAI,EAAKK,EAAIT,CAAG,EACZK,EAAKK,EAAIV,CAAG,EACZM,EAAKK,EAAIX,CAAG,EACZO,EAAKK,EAAIZ,CAAG,EACZQ,EAAKK,EAAIb,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBS,EAAIT,CAAG,EAAIN,EAAKW,EAAIL,CAAG,EAAGM,EAAIN,CAAG,EAAGO,EAAIP,CAAG,EAAGQ,EAAIR,CAAG,CAAE,CAM7D,CAKAV,GAAO,QAAUC,KC1IjB,IAAAuC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqDA,SAASC,GAAWC,EAAQC,EAAOC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAf,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAStB,IANAS,EAAIb,EAAQ,CAAE,EACdc,EAAId,EAAQ,CAAE,EACde,EAAIf,EAAQ,CAAE,EACdgB,EAAIhB,EAAQ,CAAE,EACdiB,EAAIjB,EAAQ,CAAE,EACdkB,EAAIlB,EAAQ,CAAE,EACRM,EAAK,EAAGA,EAAKF,EAAIE,IAOtB,IANAC,EAAKM,EAAGP,CAAG,EACXE,EAAKM,EAAGR,CAAG,EACXG,EAAKM,EAAGT,CAAG,EACXI,EAAKM,EAAGV,CAAG,EACXK,EAAKM,EAAGX,CAAG,EACXM,EAAKM,EAAGZ,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBO,EAAIP,CAAG,EAAIH,EAAKK,EAAIF,CAAG,EAAGG,EAAIH,CAAG,EAAGI,EAAIJ,CAAG,EAAGK,EAAIL,CAAG,EAAGM,EAAIN,CAAG,CAAE,CAGpE,CAKAP,GAAO,QAAUC,KClGjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCrDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqDA,SAASC,GAAWC,EAAQC,EAAOC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAvB,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GASjC,IANAgB,EAAIrB,EAAQ,CAAE,EACdsB,EAAItB,EAAQ,CAAE,EACduB,EAAIvB,EAAQ,CAAE,EACdwB,EAAIxB,EAAQ,CAAE,EACdyB,EAAIzB,EAAQ,CAAE,EACd0B,EAAI1B,EAAQ,CAAE,EACRQ,EAAK,EAAGA,EAAKH,EAAIG,IAOtB,IANAO,EAAKM,EAAGb,CAAG,EACXQ,EAAKM,EAAGd,CAAG,EACXS,EAAKM,EAAGf,CAAG,EACXU,EAAKM,EAAGhB,CAAG,EACXW,EAAKM,EAAGjB,CAAG,EACXY,EAAKM,EAAGlB,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAOtB,IANAE,EAAKM,EAAIR,CAAG,EACZG,EAAKM,EAAIT,CAAG,EACZI,EAAKM,EAAIV,CAAG,EACZK,EAAKM,EAAIX,CAAG,EACZM,EAAKM,EAAIZ,CAAG,EACZO,EAAKM,EAAIb,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBQ,EAAIR,CAAG,EAAIJ,EAAKO,EAAIH,CAAG,EAAGI,EAAIJ,CAAG,EAAGK,EAAIL,CAAG,EAAGM,EAAIN,CAAG,EAAGO,EAAIP,CAAG,CAAE,CAIrE,CAKAR,GAAO,QAAUC,KCnHjB,IAAA4B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCrDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqDA,SAASC,GAAWC,EAAQC,EAAOC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,GAJA/B,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAS5C,IANAuB,EAAI7B,EAAQ,CAAE,EACd8B,EAAI9B,EAAQ,CAAE,EACd+B,EAAI/B,EAAQ,CAAE,EACdgC,EAAIhC,EAAQ,CAAE,EACdiC,EAAIjC,EAAQ,CAAE,EACdkC,EAAIlC,EAAQ,CAAE,EACRU,EAAK,EAAGA,EAAKJ,EAAII,IAOtB,IANAa,EAAKM,EAAGnB,CAAG,EACXc,EAAKM,EAAGpB,CAAG,EACXe,EAAKM,EAAGrB,CAAG,EACXgB,EAAKM,EAAGtB,CAAG,EACXiB,EAAKM,EAAGvB,CAAG,EACXkB,EAAKM,EAAGxB,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAOtB,IANAQ,EAAKM,EAAId,CAAG,EACZS,EAAKM,EAAIf,CAAG,EACZU,EAAKM,EAAIhB,CAAG,EACZW,EAAKM,EAAIjB,CAAG,EACZY,EAAKM,EAAIlB,CAAG,EACZa,EAAKM,EAAInB,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAOtB,IANAG,EAAKM,EAAIT,CAAG,EACZI,EAAKM,EAAIV,CAAG,EACZK,EAAKM,EAAIX,CAAG,EACZM,EAAKM,EAAIZ,CAAG,EACZO,EAAKM,EAAIb,CAAG,EACZQ,EAAKM,EAAId,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBS,EAAIT,CAAG,EAAIL,EAAKS,EAAIJ,CAAG,EAAGK,EAAIL,CAAG,EAAGM,EAAIN,CAAG,EAAGO,EAAIP,CAAG,EAAGQ,EAAIR,CAAG,CAAE,CAKtE,CAKAT,GAAO,QAAUC,KCpIjB,IAAAoC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCrDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqDA,SAASC,GAAWC,EAAQC,EAAOC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,GACAC,GAOJ,GALAvC,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GASvD,IANA8B,EAAIrC,EAAQ,CAAE,EACdsC,GAAItC,EAAQ,CAAE,EACduC,GAAIvC,EAAQ,CAAE,EACdwC,GAAIxC,EAAQ,CAAE,EACdyC,GAAIzC,EAAQ,CAAE,EACd0C,GAAI1C,EAAQ,CAAE,EACRY,EAAK,EAAGA,EAAKL,EAAIK,IAOtB,IANAmB,EAAKM,EAAGzB,CAAG,EACXoB,EAAKM,GAAG1B,CAAG,EACXqB,EAAKM,GAAG3B,CAAG,EACXsB,EAAKM,GAAG5B,CAAG,EACXuB,EAAKM,GAAG7B,CAAG,EACXwB,EAAKM,GAAG9B,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAOtB,IANAc,EAAKM,EAAIpB,CAAG,EACZe,EAAKM,EAAIrB,CAAG,EACZgB,EAAKM,EAAItB,CAAG,EACZiB,EAAKM,EAAIvB,CAAG,EACZkB,EAAKM,EAAIxB,CAAG,EACZmB,EAAKM,EAAIzB,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAOtB,IANAS,EAAKM,EAAIf,CAAG,EACZU,EAAKM,EAAIhB,CAAG,EACZW,EAAKM,EAAIjB,CAAG,EACZY,EAAKM,EAAIlB,CAAG,EACZa,EAAKM,EAAInB,CAAG,EACZc,EAAKM,EAAIpB,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAOtB,IANAI,EAAKM,EAAIV,CAAG,EACZK,EAAKM,EAAIX,CAAG,EACZM,EAAKM,EAAIZ,CAAG,EACZO,EAAKM,EAAIb,CAAG,EACZQ,EAAKM,EAAId,CAAG,EACZS,EAAKM,EAAIf,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBU,EAAIV,CAAG,EAAIN,EAAKW,EAAIL,CAAG,EAAGM,EAAIN,CAAG,EAAGO,EAAIP,CAAG,EAAGQ,EAAIR,CAAG,EAAGS,EAAIT,CAAG,CAAE,CAMvE,CAKAV,GAAO,QAAUC,KCrJjB,IAAA4C,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCrDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAwBvB,SAASC,GAAUC,EAAGC,EAAWC,EAAU,CAC1C,IAAIC,EACAC,EACAC,EAGJ,IADAF,EAAM,CAAC,EACDE,EAAI,EAAGA,EAAIL,EAAE,OAAQK,IAC1BD,EAAIJ,EAAGK,CAAE,EACHJ,EAAU,KAAMC,EAASE,EAAGC,EAAGL,CAAE,GACtCG,EAAI,KAAMC,CAAE,EAGd,OAAOD,CACR,CAwBA,SAASG,GAAWN,EAAGC,EAAWC,EAAU,CAC3C,IAAIK,EACAC,EACAL,EACAC,EACAC,EAMJ,IAJAE,EAAOP,EAAE,KACTQ,EAAMR,EAAE,UAAW,CAAE,EAErBG,EAAM,CAAC,EACDE,EAAI,EAAGA,EAAIE,EAAK,OAAQF,IAC7BD,EAAII,EAAKD,EAAMF,CAAE,EACXJ,EAAU,KAAMC,EAASE,EAAGC,EAAGE,CAAK,GACzCJ,EAAI,KAAMC,CAAE,EAGd,OAAOD,CACR,CAuBA,SAASM,GAAQT,EAAGC,EAAWC,EAAU,CACxC,IAAIQ,EAAMZ,GAAkBE,CAAE,EAC9B,OAAKU,EAAI,iBACDJ,GAAWI,EAAKT,EAAWC,CAAQ,EAEpCH,GAAUC,EAAGC,EAAWC,CAAQ,CACxC,CAKAL,GAAO,QAAUY,KCvIjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAkB,KAClBC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IA2BZ,SAASC,GAAeC,EAAI,CAC3B,IAAIC,EAAKH,GAAOE,CAAE,EAClB,OAAKL,GAAiBK,CAAE,EAChBJ,GAAgBK,CAAG,EAEpBJ,GAAQI,CAAG,CACnB,CAKAP,GAAO,QAAUK,KC/DjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KClDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IACnBC,GAAQ,QAAS,iCAAkC,EAqBvD,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAeA,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAIP,GAAOK,EAAE,OAAO,CAAE,EACtBG,EAAIH,EAAE,OAAS,EACTI,EAAI,EAAGA,EAAIF,EAAGE,IACnBC,EAAIF,EAAIC,EACRH,EAAMD,EAAGI,CAAE,EACXJ,EAAGI,CAAE,EAAIJ,EAAGK,CAAE,EACdL,EAAGK,CAAE,EAAIJ,EAEV,OAAOD,CACR,CAuBA,SAASM,GAAWN,EAAI,CACvB,IAAIO,EACAC,EACAC,EACAR,EACAC,EACAC,EACAC,EACAC,EAQJ,IANAE,EAAOP,EAAE,KACTQ,EAAMR,EAAE,UAAW,CAAE,EACrBS,EAAMT,EAAE,UAAW,CAAE,EAErBE,EAAIP,GAAOY,EAAK,OAAO,CAAE,EACzBJ,EAAII,EAAK,OAAS,EACZH,EAAI,EAAGA,EAAIF,EAAGE,IACnBC,EAAIF,EAAIC,EACRH,EAAMO,EAAKD,EAAMH,CAAE,EACnBK,EAAKF,EAAMH,EAAGI,EAAKD,EAAMF,CAAE,CAAE,EAC7BI,EAAKF,EAAMF,EAAGJ,CAAI,EAEnB,OAAOM,CACR,CA+BA,SAASG,GAASV,EAAI,CACrB,IAAIH,EACJ,OAAKD,GAAWI,EAAG,SAAU,EACrBA,EAAE,QAAQ,GAElBH,EAAMH,GAAkBM,CAAE,EACrBH,EAAI,iBACDS,GAAWT,CAAI,EAEhBE,GAAUC,CAAE,EACpB,CAKAP,GAAO,QAAUiB,KCzKjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAKnBC,GAAa,MAAM,UAAU,MAqBjC,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAiBA,SAASC,GAASC,EAAGC,EAAOC,EAAM,CACjC,OAAOP,GAAW,KAAMK,EAAGC,EAAOC,CAAI,CACvC,CAoBA,SAASC,GAAWH,EAAGC,EAAOC,EAAM,CACnC,IAAIE,EACAC,EACAC,EACAC,EAKJ,IAHAH,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EACrBM,EAAM,CAAC,EACDC,EAAIN,EAAOM,EAAIL,EAAKK,IACzBD,EAAI,KAAMD,EAAKD,EAAMG,CAAE,CAAE,EAE1B,OAAOD,CACR,CAiCA,SAASE,GAAOR,EAAGC,EAAOC,EAAM,CAC/B,IAAIL,EACJ,OAAKD,GAAWI,EAAG,OAAQ,EACnBA,EAAE,MAAOC,EAAOC,CAAI,GAE5BL,EAAMH,GAAkBM,CAAE,EACrBH,EAAI,iBACDM,GAAWN,EAAKI,EAAOC,CAAI,EAG5BH,GAASC,EAAGC,EAAOC,CAAI,EAC/B,CAKAT,GAAO,QAAUe,KCvJjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IA8BpB,SAASC,GAAiBC,EAAGC,EAAOC,EAASC,EAAS,CACrD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAWJ,IATAT,EAAMN,GAAeE,CAAE,EAEvBU,EAAKT,EAAO,CAAE,EACdQ,EAAKR,EAAO,CAAE,EAEdO,EAAMN,EAAS,CAAE,EACjBK,EAAML,EAAS,CAAE,EAEjBG,EAAM,CAAC,EACDO,EAAK,EAAGA,EAAKF,EAAIE,IAAO,CAG7B,IAFAN,EAAM,CAAC,EACPO,EAAKV,EAAWK,EAAII,EACdD,EAAK,EAAGA,EAAKF,EAAIE,IACtBL,EAAI,KAAMF,EAAKJ,EAAGa,CAAG,CAAE,EACvBA,GAAMN,EAEPF,EAAI,KAAMC,CAAI,CACf,CACA,OAAOD,CACR,CAKAR,GAAO,QAAUE,KCxFjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IA8BpB,SAASC,GAAiBC,EAAGC,EAAOC,EAASC,EAAS,CACrD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,IAXAd,EAAMN,GAAeE,CAAE,EAEvBa,EAAKZ,EAAO,CAAE,EACdW,EAAKX,EAAO,CAAE,EACdU,EAAKV,EAAO,CAAE,EAEdO,EAAMN,EAAS,CAAE,EACjBK,EAAML,EAAS,CAAE,EACjBI,EAAMJ,EAAS,CAAE,EAEjBG,EAAM,CAAC,EACDW,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAG7B,IAFAC,EAAK,CAAC,EACNR,EAAMN,EAAWK,EAAIQ,EACfD,EAAK,EAAGA,EAAKH,EAAIG,IAAO,CAG7B,IAFAG,EAAK,CAAC,EACNR,EAAMD,EAAQF,EAAIQ,EACZD,EAAK,EAAGA,EAAKH,EAAIG,IACtBI,EAAG,KAAMd,EAAKJ,EAAGU,CAAI,CAAE,EACvBA,GAAOJ,EAERW,EAAG,KAAMC,CAAG,CACb,CACAb,EAAI,KAAMY,CAAG,CACd,CACA,OAAOZ,CACR,CAKAR,GAAO,QAAUE,KCpGjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IA8BpB,SAASC,GAAiBC,EAAGC,EAAOC,EAASC,EAAS,CACrD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAeJ,IAbAnB,EAAMN,GAAeE,CAAE,EAEvBgB,EAAKf,EAAO,CAAE,EACdc,EAAKd,EAAO,CAAE,EACda,EAAKb,EAAO,CAAE,EACdY,EAAKZ,EAAO,CAAE,EAEdQ,EAAMP,EAAS,CAAE,EACjBM,EAAMN,EAAS,CAAE,EACjBK,EAAML,EAAS,CAAE,EACjBI,EAAMJ,EAAS,CAAE,EAEjBG,EAAM,CAAC,EACDe,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAG7B,IAFAC,EAAK,CAAC,EACNX,EAAMP,EAAWM,EAAIW,EACfD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAG7B,IAFAG,EAAK,CAAC,EACNX,EAAMD,EAAQF,EAAIW,EACZD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAG7B,IAFAK,EAAK,CAAC,EACNX,EAAMD,EAAQJ,EAAIW,EACZD,EAAK,EAAGA,EAAKJ,EAAII,IACtBM,EAAG,KAAMnB,EAAKJ,EAAGY,CAAI,CAAE,EACvBA,GAAON,EAERgB,EAAG,KAAMC,CAAG,CACb,CACAF,EAAG,KAAMC,CAAG,CACb,CACAjB,EAAI,KAAMgB,CAAG,CACd,CACA,OAAOhB,CACR,CAKAR,GAAO,QAAUE,KChHjB,IAAAyB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IA8BpB,SAASC,GAAiBC,EAAGC,EAAOC,EAASC,EAAS,CACrD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAiBJ,IAfAxB,EAAMN,GAAeE,CAAE,EAEvBmB,EAAKlB,EAAO,CAAE,EACdiB,EAAKjB,EAAO,CAAE,EACdgB,EAAKhB,EAAO,CAAE,EACde,EAAKf,EAAO,CAAE,EACdc,EAAKd,EAAO,CAAE,EAEdS,EAAMR,EAAS,CAAE,EACjBO,EAAMP,EAAS,CAAE,EACjBM,EAAMN,EAAS,CAAE,EACjBK,EAAML,EAAS,CAAE,EACjBI,EAAMJ,EAAS,CAAE,EAEjBG,EAAM,CAAC,EACDmB,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAG7B,IAFAC,EAAK,CAAC,EACNd,EAAMR,EAAWO,EAAIc,EACfD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAG7B,IAFAG,EAAK,CAAC,EACNd,EAAMD,EAAQF,EAAIc,EACZD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAG7B,IAFAK,EAAK,CAAC,EACNd,EAAMD,EAAQJ,EAAIc,EACZD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAG7B,IAFAO,EAAK,CAAC,EACNd,EAAMD,EAAQN,EAAIc,EACZD,EAAK,EAAGA,EAAKL,EAAIK,IACtBQ,EAAG,KAAMxB,EAAKJ,EAAGc,CAAI,CAAE,EACvBA,GAAOR,EAERqB,EAAG,KAAMC,CAAG,CACb,CACAF,EAAG,KAAMC,CAAG,CACb,CACAF,EAAG,KAAMC,CAAG,CACb,CACArB,EAAI,KAAMoB,CAAG,CACd,CACA,OAAOpB,CACR,CAKAR,GAAO,QAAUE,KC5HjB,IAAA8B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,IAmBpB,SAASC,GAAMC,EAAGC,EAAU,CAC3B,IAAIC,EACAC,EACAC,EAOJ,IAJAF,EAAMJ,GAAeE,CAAE,EAGvBG,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIH,EAAQ,OAAQG,IAChCD,EAAI,KAAMD,EAAKF,EAAGC,EAASG,CAAE,CAAE,CAAE,EAElC,OAAOD,CACR,CAKAN,GAAO,QAAUE,KC5DjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,SAASC,GAAMC,EAAGC,EAAU,CAC3B,IAAIC,EACA,EAGJ,IADAA,EAAM,CAAC,EACD,EAAI,EAAG,EAAID,EAAQ,OAAQ,IAChCC,EAAI,KAAMF,EAAGC,EAAS,CAAE,CAAE,CAAE,EAE7B,OAAOC,CACR,CAKAJ,GAAO,QAAUC,KClDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,QAAS,sCAAuC,EACjEC,GAAgB,QAAS,0BAA2B,EAAE,QACtDC,GAAS,QAAS,uBAAwB,EAK1CC,GAAQ,EA2BZ,SAASC,GAAQC,EAAGC,EAASC,EAAWC,EAAO,CAC9C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAGJ,GADAN,EAAMX,GAAgBO,EAAWJ,GAAM,CAAE,EACpCQ,IAAQ,GACZ,MAAM,IAAI,WAAYT,GAAQ,4GAA6GC,GAAOI,CAAU,CAAE,EAI/J,GAFAK,EAAMX,GAAeO,CAAK,EAC1BE,EAAM,CAAC,EACFC,IAAQ,EAAI,CAEhB,IADAF,EAAYJ,EAAE,OAAS,EACjBU,EAAK,EAAGA,EAAKT,EAAQ,OAAQS,IAClCF,EAAMD,EAAKN,EAASS,CAAG,EAAGN,CAAU,EACpCC,EAAI,KAAML,EAAGQ,CAAI,CAAE,EAEpB,OAAOH,CACR,CAEA,IAAMK,EAAK,EAAGA,EAAKV,EAAE,OAAQU,IAAO,CAInC,IAHAC,EAAKX,EAAGU,CAAG,EACXE,EAAK,CAAC,EACNR,EAAYO,EAAG,OAAS,EAClBF,EAAK,EAAGA,EAAKR,EAAQ,OAAQQ,IAClCD,EAAMD,EAAKN,EAASQ,CAAG,EAAGL,CAAU,EACpCQ,EAAG,KAAMD,EAAIH,CAAI,CAAE,EAEpBH,EAAI,KAAMO,CAAG,CACd,CACA,OAAOP,CACR,CAKAX,GAAO,QAAUK,KClGjB,IAAAc,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,QAAS,sCAAuC,EACjEC,GAAgB,QAAS,0BAA2B,EAAE,QACtDC,GAAS,KACTC,GAAS,QAAS,uBAAwB,EAK1CC,GAAQ,EA2BZ,SAASC,GAAQC,EAAGC,EAASC,EAAWC,EAAO,CAC9C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAGJ,GADAH,EAAMZ,GAAgBQ,EAAWJ,GAAM,CAAE,EACpCQ,IAAQ,GACZ,MAAM,IAAI,WAAYT,GAAQ,4GAA6GC,GAAOI,CAAU,CAAE,EAG/J,GADAG,EAAM,CAAC,EACFC,IAAQ,EAAI,CAGhB,IAFAC,EAAMZ,GAAeQ,CAAK,EAC1BC,EAAYJ,EAAE,OAAS,EACjBS,EAAI,EAAGA,EAAIR,EAAQ,OAAQQ,IAChCD,EAAMD,EAAKN,EAASQ,CAAE,EAAGL,CAAU,EACnCC,EAAI,KAAML,EAAGQ,CAAI,CAAE,EAEpB,OAAOH,CACR,CAGA,IADAC,EAAMJ,EAAY,EACZO,EAAI,EAAGA,EAAIT,EAAE,OAAQS,IAC1BJ,EAAI,KAAMT,GAAQI,EAAGS,CAAE,EAAGR,EAASK,EAAKH,CAAK,CAAE,EAEhD,OAAOE,CACR,CAKAZ,GAAO,QAAUM,KC1FjB,IAAAW,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmDA,SAASC,GAAWC,EAAQC,EAAOC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAX,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAOtB,IAJAO,EAAIX,EAAQ,CAAE,EACdY,EAAIZ,EAAQ,CAAE,EACda,EAAIb,EAAQ,CAAE,EACdc,EAAId,EAAQ,CAAE,EACRM,EAAK,EAAGA,EAAKF,EAAIE,IAKtB,IAJAC,EAAKI,EAAGL,CAAG,EACXE,EAAKI,EAAGN,CAAG,EACXG,EAAKI,EAAGP,CAAG,EACXI,EAAKI,EAAGR,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBK,EAAIL,CAAG,EAAIH,EAAKK,EAAIF,CAAG,EAAGG,EAAIH,CAAG,EAAGI,EAAIJ,CAAG,CAAE,CAGhD,CAKAP,GAAO,QAAUC,KCxFjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmDA,SAASC,GAAWC,EAAQC,EAAOC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAjB,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAOjC,IAJAY,EAAIjB,EAAQ,CAAE,EACdkB,EAAIlB,EAAQ,CAAE,EACdmB,EAAInB,EAAQ,CAAE,EACdoB,EAAIpB,EAAQ,CAAE,EACRQ,EAAK,EAAGA,EAAKH,EAAIG,IAKtB,IAJAK,EAAKI,EAAGT,CAAG,EACXM,EAAKI,EAAGV,CAAG,EACXO,EAAKI,EAAGX,CAAG,EACXQ,EAAKI,EAAGZ,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAKtB,IAJAE,EAAKI,EAAIN,CAAG,EACZG,EAAKI,EAAIP,CAAG,EACZI,EAAKI,EAAIR,CAAG,EACZK,EAAKI,EAAIT,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBM,EAAIN,CAAG,EAAIJ,EAAKO,EAAIH,CAAG,EAAGI,EAAIJ,CAAG,EAAGK,EAAIL,CAAG,CAAE,CAIjD,CAKAR,GAAO,QAAUC,KCrGjB,IAAAsB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmDA,SAASC,GAAWC,EAAQC,EAAOC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,GAJAvB,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAO5C,IAJAiB,EAAIvB,EAAQ,CAAE,EACdwB,EAAIxB,EAAQ,CAAE,EACdyB,EAAIzB,EAAQ,CAAE,EACd0B,EAAI1B,EAAQ,CAAE,EACRU,EAAK,EAAGA,EAAKJ,EAAII,IAKtB,IAJAS,EAAKI,EAAGb,CAAG,EACXU,EAAKI,EAAGd,CAAG,EACXW,EAAKI,EAAGf,CAAG,EACXY,EAAKI,EAAGhB,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAKtB,IAJAM,EAAKI,EAAIV,CAAG,EACZO,EAAKI,EAAIX,CAAG,EACZQ,EAAKI,EAAIZ,CAAG,EACZS,EAAKI,EAAIb,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAKtB,IAJAG,EAAKI,EAAIP,CAAG,EACZI,EAAKI,EAAIR,CAAG,EACZK,EAAKI,EAAIT,CAAG,EACZM,EAAKI,EAAIV,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBO,EAAIP,CAAG,EAAIL,EAAKS,EAAIJ,CAAG,EAAGK,EAAIL,CAAG,EAAGM,EAAIN,CAAG,CAAE,CAKlD,CAKAT,GAAO,QAAUC,KClHjB,IAAA4B,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmDA,SAASC,GAAWC,EAAQC,EAAOC,EAAM,CACxC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAOJ,GALA7B,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAO5C,IAJAuB,EAAI7B,EAAQ,CAAE,EACd8B,EAAI9B,EAAQ,CAAE,EACd+B,EAAI/B,EAAQ,CAAE,EACdgC,EAAIhC,EAAQ,CAAE,EACRY,EAAK,EAAGA,EAAKL,EAAIK,IAKtB,IAJAa,EAAKI,EAAGjB,CAAG,EACXc,EAAKI,EAAGlB,CAAG,EACXe,EAAKI,EAAGnB,CAAG,EACXgB,EAAKI,EAAGpB,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAKtB,IAJAU,EAAKI,EAAId,CAAG,EACZW,EAAKI,EAAIf,CAAG,EACZY,EAAKI,EAAIhB,CAAG,EACZa,EAAKI,EAAIjB,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAKtB,IAJAO,EAAKI,EAAIX,CAAG,EACZQ,EAAKI,EAAIZ,CAAG,EACZS,EAAKI,EAAIb,CAAG,EACZU,EAAKI,EAAId,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAKtB,IAJAI,EAAKI,EAAIR,CAAG,EACZK,EAAKI,EAAIT,CAAG,EACZM,EAAKI,EAAIV,CAAG,EACZO,EAAKI,EAAIX,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBQ,EAAIR,CAAG,EAAIN,EAAKW,EAAIL,CAAG,EAAGM,EAAIN,CAAG,EAAGO,EAAIP,CAAG,CAAE,CAMnD,CAKAV,GAAO,QAAUC,KC/HjB,IAAAkC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAkB,KAClBC,GAAgB,KAuBpB,SAASC,GAAiBC,EAAM,CAC/B,OAAKA,GAAO,OAAOA,GAAQ,UAAYH,GAAiBG,CAAI,EACpDA,EAED,IAAIF,GAAeE,CAAI,CAC/B,CAKAJ,GAAO,QAAUG,KCxDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,iCAAkC,EA+BvD,SAASC,GAAYC,EAAGC,EAAQ,CAC/B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAF,EAAM,CAAC,EACPD,EAAMJ,EAAE,OACHI,IAAQ,EACZ,OAAOC,EAIR,IAFAF,EAAO,IACPD,EAAQ,EACFK,EAAI,EAAGA,EAAIH,EAAKG,IACrBD,EAAIN,EAAGO,CAAE,EACJD,IAAMH,GACVD,GAAS,EACJA,GAASD,GACbI,EAAI,KAAMF,CAAK,IAGhBA,EAAOG,EACPJ,EAAQ,EACRG,EAAI,KAAMF,CAAK,GAGjB,OAAOE,CACR,CA4BA,SAASG,GAAiBR,EAAGC,EAAQ,CACpC,IAAIC,EACAC,EACAC,EACAC,EACAI,EACAH,EACAC,EAIJ,GAFAF,EAAM,CAAC,EACPD,EAAMJ,EAAE,OACHI,IAAQ,EACZ,OAAOC,EAKR,IAHAI,EAAM,GACNN,EAAO,IACPD,EAAQ,EACFK,EAAI,EAAGA,EAAIH,EAAKG,IACrBD,EAAIN,EAAGO,CAAE,EACJD,IAAMH,GAAUM,GAAOX,GAAOQ,CAAE,GACpCJ,GAAS,EACJA,GAASD,GACbI,EAAI,KAAMF,CAAK,IAGhBA,EAAOG,EACPJ,EAAQ,EACRG,EAAI,KAAMF,CAAK,EACfM,EAAM,GACDX,GAAOK,CAAK,IAChBM,EAAM,KAIT,OAAOJ,CACR,CA+BA,SAASK,GAAQV,EAAGC,EAAOU,EAAY,CACtC,OAAKA,EACGH,GAAiBR,EAAGC,CAAM,EAE3BF,GAAYC,EAAGC,CAAM,CAC7B,CAKAJ,GAAO,QAAUa,KC1LjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAmB,IAiBvB,SAASC,GAAWC,EAAKC,EAAS,CACjC,OAAS,OAAOD,EAAKC,CAAO,GAAM,UACnC,CAeA,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAIF,EAAE,OAAO,EAAGE,GAAK,EAAGA,IAC7BD,EAAI,KAAMD,EAAGE,CAAE,CAAE,EAElB,OAAOD,CACR,CAqBA,SAASE,GAAWH,EAAI,CACvB,IAAII,EACAC,EACAJ,EACAC,EAMJ,IAJAE,EAAOJ,EAAE,KACTK,EAAML,EAAE,UAAW,CAAE,EAErBC,EAAM,CAAC,EACDC,EAAIE,EAAK,OAAO,EAAGF,GAAK,EAAGA,IAChCD,EAAI,KAAMI,EAAKD,EAAMF,CAAE,CAAE,EAE1B,OAAOD,CACR,CAoBA,SAASK,GAAYN,EAAI,CACxB,IAAIH,EACJ,OAAKD,GAAWI,EAAG,YAAa,EACxBA,EAAE,WAAW,GAErBH,EAAMF,GAAkBK,CAAE,EACrBH,EAAI,iBACDM,GAAWN,CAAI,EAEhBE,GAAUC,CAAE,EACpB,CAKAN,GAAO,QAAUY,KCvIjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAASC,EAAQC,EAAOC,EAAM,CACtC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAP,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAKtB,IAFAK,EAAIT,EAAQ,CAAE,EACdU,EAAIV,EAAQ,CAAE,EACRM,EAAK,EAAGA,EAAKF,EAAIE,IAGtB,IAFAC,EAAKE,EAAGH,CAAG,EACXE,EAAKE,EAAGJ,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBG,EAAIH,CAAG,EAAIH,EAAKK,EAAIF,CAAG,CAAE,CAG5B,CAKAP,GAAO,QAAUC,KCjFjB,IAAAY,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0DA,SAASC,GAAWC,EAAQC,EAAOC,EAAKC,EAAO,CAC9C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAIJ,GAFAR,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACT,EAAAI,GAAM,GAAKC,GAAM,GAQtB,IALK,UAAU,OAAS,IACvBF,EAAU,UAAW,CAAE,GAExBO,EAAIX,EAAQ,CAAE,EACdY,EAAIZ,EAAQ,CAAE,EACRQ,EAAK,EAAGA,EAAKF,EAAIE,IAGtB,IAFAC,EAAKE,EAAGH,CAAG,EACXE,EAAKE,EAAGJ,CAAG,EACLD,EAAK,EAAGA,EAAKF,EAAIE,IACtBM,EAAIV,EAAK,KAAMC,EAASK,EAAIF,CAAG,EAAG,CAAEC,EAAID,CAAG,EAAG,CAAEI,EAAGC,CAAE,CAAE,EAClDC,IAAM,SACVH,EAAIH,CAAG,EAAIL,EAAKW,CAAE,EAItB,CAKAf,GAAO,QAAUC,KC/FjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAmDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCxDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAASC,EAAQC,EAAOC,EAAM,CACtC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,GAHAX,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAKjC,IAFAQ,EAAIb,EAAQ,CAAE,EACdc,EAAId,EAAQ,CAAE,EACRQ,EAAK,EAAGA,EAAKH,EAAIG,IAGtB,IAFAE,EAAKG,EAAGL,CAAG,EACXI,EAAKE,EAAGN,CAAG,EACLD,EAAK,EAAGA,EAAKH,EAAIG,IAGtB,IAFAE,EAAKC,EAAIH,CAAG,EACZI,EAAKC,EAAIL,CAAG,EACND,EAAK,EAAGA,EAAKH,EAAIG,IACtBK,EAAIL,CAAG,EAAIJ,EAAKO,EAAIH,CAAG,CAAE,CAI7B,CAKAR,GAAO,QAAUC,KC1FjB,IAAAgB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAASC,EAAQC,EAAOC,EAAM,CACtC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAMJ,GAJAf,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAK5C,IAFAW,EAAIjB,EAAQ,CAAE,EACdkB,EAAIlB,EAAQ,CAAE,EACRU,EAAK,EAAGA,EAAKJ,EAAII,IAGtB,IAFAG,EAAKI,EAAGP,CAAG,EACXM,EAAKE,EAAGR,CAAG,EACLD,EAAK,EAAGA,EAAKJ,EAAII,IAGtB,IAFAG,EAAKC,EAAIJ,CAAG,EACZM,EAAKC,EAAIP,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IAGtB,IAFAG,EAAKC,EAAIJ,CAAG,EACZM,EAAKC,EAAIP,CAAG,EACND,EAAK,EAAGA,EAAKJ,EAAII,IACtBO,EAAIP,CAAG,EAAIL,EAAKS,EAAIJ,CAAG,CAAE,CAK9B,CAKAT,GAAO,QAAUC,KCnGjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,SAASC,GAASC,EAAQC,EAAOC,EAAM,CACtC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAOJ,GALAnB,EAAKF,EAAO,CAAE,EACdG,EAAKH,EAAO,CAAE,EACdI,EAAKJ,EAAO,CAAE,EACdK,EAAKL,EAAO,CAAE,EACdM,EAAKN,EAAO,CAAE,EACT,EAAAE,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAAKC,GAAM,GAKvD,IAFAc,EAAIrB,EAAQ,CAAE,EACdsB,EAAItB,EAAQ,CAAE,EACRY,EAAK,EAAGA,EAAKL,EAAIK,IAGtB,IAFAI,EAAKK,EAAGT,CAAG,EACXQ,EAAKE,EAAGV,CAAG,EACLD,EAAK,EAAGA,EAAKL,EAAIK,IAGtB,IAFAI,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAIT,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAGtB,IAFAI,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAIT,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IAGtB,IAFAI,EAAKC,EAAIL,CAAG,EACZQ,EAAKC,EAAIT,CAAG,EACND,EAAK,EAAGA,EAAKL,EAAIK,IACtBS,EAAIT,CAAG,EAAIN,EAAKW,EAAIL,CAAG,CAAE,CAM/B,CAKAV,GAAO,QAAUC,KC5GjB,IAAAwB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,SAASC,GAASC,EAAGC,EAAGC,EAAOC,EAAOC,EAAKC,EAAM,CAChD,IAAIC,EACAC,EACAC,EAOJ,GALAF,EAAIH,EAAOC,CAAI,EAGfG,EAAIH,EAAM,EAELG,IAAML,EAAQ,CAElB,IAAMM,EAAI,EAAGA,EAAIF,EAAGE,IACnBP,EAAGO,CAAE,EAAIH,EAAKL,EAAGQ,CAAE,CAAE,EAEtB,MACD,CAEA,IAAMA,EAAI,EAAGA,EAAIF,EAAGE,IACnBT,GAASC,EAAGQ,CAAE,EAAGP,EAAGO,CAAE,EAAGN,EAAOC,EAAOI,EAAGF,CAAI,CAEhD,CAmCA,SAASI,GAASC,EAAQP,EAAOE,EAAM,CACtC,OAAON,GAASW,EAAQ,CAAE,EAAGA,EAAQ,CAAE,EAAGP,EAAM,OAAQA,EAAO,EAAGE,CAAI,CACvE,CAKAP,GAAO,QAAUW,KCjGjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCpDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAiCA,SAASC,GAAWC,EAAIC,EAAK,CAC5B,IAAIC,EACAC,EACAC,EAGJ,GADAD,EAAMF,EAAKD,EACNG,GAAO,EACX,MAAO,CAAEH,CAAG,EAGb,IADAE,EAAM,CAAEF,CAAG,EACLI,EAAI,EAAGA,EAAID,EAAKC,IACrBF,EAAI,KAAMF,EAAKI,CAAE,EAElB,OAAOF,CACR,CAKAJ,GAAO,QAAUC,KCpDjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgCA,SAASC,GAAQC,EAAI,CACpB,IAAIC,EACAC,EAGJ,GADAD,EAAM,CAAC,EACFD,GAAK,EACT,OAAOC,EAER,IAAMC,EAAI,EAAGA,EAAIF,EAAGE,IACnBD,EAAI,KAAMC,CAAE,EAEb,OAAOD,CACR,CAKAH,GAAO,QAAUC,KCjDjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,KACpBC,GAAmB,KACnBC,GAAmB,IACnBC,GAAiB,QAAS,6CAA8C,EACxEC,GAAgB,QAAS,4CAA6C,EA0B1E,SAASC,GAASC,EAAKC,EAAQC,EAAS,CACvC,IAAIC,EACAC,EAIJ,IAFAA,EAAIF,EACJC,EAAI,EACIC,GAAK,GAAKA,EAAIJ,EAAI,QACzBA,EAAKI,CAAE,EAAID,EACXC,GAAKH,EACLE,GAAK,EAEN,OAAOH,CACR,CA+BA,SAASK,GAASL,EAAKM,EAAML,EAAQC,EAAS,CAC7C,IAAIC,EACAI,EACAH,EAKJ,IAHAG,EAAIN,EAAS,EACbG,EAAIF,EAAS,EACbC,EAAI,EACIC,GAAK,GAAKA,EAAIE,EAAK,QAC1BA,EAAMF,CAAE,EAAID,EACZG,EAAMF,EAAE,CAAE,EAAI,EACdA,GAAKG,EACLJ,GAAK,EAEN,OAAOH,CACR,CA2BA,SAASQ,GAAWR,EAAKC,EAAQC,EAAS,CACzC,IAAII,EACAG,EACAN,EACAC,EAOJ,IALAE,EAAON,EAAI,KACXS,EAAMT,EAAI,UAAW,CAAE,EAEvBI,EAAIF,EACJC,EAAI,EACIC,GAAK,GAAKA,EAAIE,EAAK,QAC1BG,EAAKH,EAAMF,EAAGD,CAAE,EAChBC,GAAKH,EACLE,GAAK,EAEN,OAAOG,CACR,CAyBA,SAASI,GAAQV,EAAKC,EAAQC,EAAS,CACtC,IAAIS,EAAMf,GAAkBI,CAAI,EAChC,OAAKW,EAAI,iBAEHjB,GAAmBM,CAAI,EACpBK,GAASL,EAAKH,GAAgBG,EAAK,CAAE,EAAGC,EAAQC,CAAO,EAE1DP,GAAkBK,CAAI,EACnBK,GAASL,EAAKF,GAAeE,EAAK,CAAE,EAAGC,EAAQC,CAAO,EAEvDM,GAAWG,EAAKV,EAAQC,CAAO,EAEhCH,GAASC,EAAKC,EAAQC,CAAO,CACrC,CAKAT,GAAO,QAAUiB,KCrMjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KCxDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAef,SAASC,GAASC,EAAQ,CACzB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAef,SAASC,GAASC,EAAQ,CACzB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAef,SAASC,GAASC,EAAQ,CACzB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAef,SAASC,GAASC,EAAQ,CACzB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KC5CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAmBf,SAASC,GAASC,EAAQ,CACzB,OAAOF,GAAU,EAAKE,CAAM,CAC7B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0BA,IAAIC,EAAc,QAAS,yCAA0C,EAUjEC,EAAK,CAAC,EASVD,EAAaC,EAAI,gBAAiB,IAAmC,EASrED,EAAaC,EAAI,iBAAkB,IAA0C,EAS7ED,EAAaC,EAAI,iBAAkB,IAA0C,EAS7ED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,MAAO,IAA8B,EAStDD,EAAaC,EAAI,QAAS,IAAiC,EAS3DD,EAAaC,EAAI,aAAc,IAAuC,EAStED,EAAaC,EAAI,mBAAoB,GAA2C,EAShFD,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,KAAM,IAA6B,EASpDD,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,mBAAoB,IAA4C,EASjFD,EAAaC,EAAI,qBAAsB,IAA+C,EAStFD,EAAaC,EAAI,mBAAoB,IAA4C,EASjFD,EAAaC,EAAI,qBAAsB,IAA+C,EAStFD,EAAaC,EAAI,kBAAmB,IAA2C,EAS/ED,EAAaC,EAAI,oBAAqB,IAA8C,EASpFD,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,iBAAkB,IAA0C,EAS7ED,EAAaC,EAAI,YAAa,IAA+C,EAS7ED,EAAaC,EAAI,YAAa,IAA+C,EAS7ED,EAAaC,EAAI,YAAa,IAA+C,EAS7ED,EAAaC,EAAI,YAAa,IAA+C,EAS7ED,EAAaC,EAAI,gBAAiB,IAAmD,EASrFD,EAAaC,EAAI,aAAc,IAAgD,EAS/ED,EAAaC,EAAI,aAAc,IAAgD,EAS/ED,EAAaC,EAAI,WAAY,IAA8C,EAS3ED,EAAaC,EAAI,WAAY,IAA8C,EAS3ED,EAAaC,EAAI,WAAY,IAA8C,EAS3ED,EAAaC,EAAI,WAAY,IAA8C,EAS3ED,EAAaC,EAAI,iBAAkB,IAA0C,EAS7ED,EAAaC,EAAI,mBAAoB,IAA4C,EASjFD,EAAaC,EAAI,kBAAmB,IAA2C,EAS/ED,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,cAAe,IAAuC,EASvED,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,QAAS,IAAgC,EAS1DD,EAAaC,EAAI,UAAW,IAAmC,EAS/DD,EAAaC,EAAI,eAAgB,IAAyC,EAS1ED,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,WAAY,IAAoC,EASjED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,aAAc,IAAsC,EASrED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,aAAc,IAAsC,EASrED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,aAAc,IAAsC,EASrED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,aAAc,IAAsC,EASrED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,aAAc,IAAsC,EASrED,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,QAAS,IAAgC,EAS1DD,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,YAAa,IAAqC,EASnED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,cAAe,IAAuC,EASvED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,cAAe,IAAuC,EASvED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,cAAe,IAAuC,EASvED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,cAAe,IAAuC,EASvED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,gBAAiB,IAAuC,EASzED,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,eAAgB,IAAwC,EASzED,EAAaC,EAAI,iBAAkB,IAA2C,EAS9ED,EAAaC,EAAI,eAAgB,IAAwC,EASzED,EAAaC,EAAI,iBAAkB,IAA2C,EAS9ED,EAAaC,EAAI,cAAe,IAAuC,EASvED,EAAaC,EAAI,gBAAiB,IAA0C,EAS5ED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,UAAW,IAAmC,EAS/DD,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,cAAe,IAAwC,EASxED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,WAAY,IAAmC,EAShED,EAAaC,EAAI,QAAS,IAAgC,EAS1DD,EAAaC,EAAI,QAAS,IAAgC,EAS1DD,EAAaC,EAAI,QAAS,IAAgC,EAS1DD,EAAaC,EAAI,QAAS,IAAgC,EAS1DD,EAAaC,EAAI,cAAe,IAAsC,EAStED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,aAAc,IAAqC,EASpED,EAAaC,EAAI,aAAc,IAAqC,EASpED,EAAaC,EAAI,oBAAqB,IAA8C,EASpFD,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,SAAU,IAAkC,EAS7DD,EAAaC,EAAI,cAAe,IAAwC,EASxED,EAAaC,EAAI,QAAS,IAAiC,EAS3DD,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,eAAgB,IAAuC,EASxED,EAAaC,EAAI,eAAgB,IAAuC,EASxED,EAAaC,EAAI,eAAgB,IAAuC,EASxED,EAAaC,EAAI,eAAgB,IAAuC,EASxED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,gBAAiB,GAAyC,EAS3ED,EAAaC,EAAI,gBAAiB,IAAyC,EAS3ED,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,QAAS,IAAgC,EAS1DD,EAAaC,EAAI,kBAAmB,IAA0C,EAS9ED,EAAaC,EAAI,kBAAmB,IAA0C,EAS9ED,EAAaC,EAAI,kBAAmB,IAA0C,EAS9ED,EAAaC,EAAI,kBAAmB,IAA0C,EAS9ED,EAAaC,EAAI,OAAQ,IAA+B,EASxDD,EAAaC,EAAI,cAAe,IAAuC,EASvED,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,SAAU,IAAiC,EAS5DD,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,kBAAmB,IAA4C,EAShFD,EAAaC,EAAI,YAAa,IAAqC,EASnED,EAAaC,EAAI,aAAc,IAAsC,EASrED,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,YAAa,IAAqC,EASnED,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,YAAa,IAAoC,EASlED,EAAaC,EAAI,SAAU,IAAkC,EAS7DD,EAAaC,EAAI,QAAS,IAAgC,EAS1DD,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,UAAW,IAAkC,EAS9DD,EAAaC,EAAI,UAAW,IAAkC,EAK9DF,GAAO,QAAUE,ICr6CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,aAAgB,WAAe,YAAc,OAKjED,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAwB,QAAS,wCAAyC,EAC1EC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAsB,EAC1BG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,QAAS,8BAA+B,EACvDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAO,KACPC,GAAS,QAAS,uBAAwB,EAoB9C,SAASC,GAAgBC,EAAGC,EAAI,CAC/B,GAAK,CAACN,GAAcK,CAAE,EACrB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAE,CAAE,EAEjH,GAAK,CAACJ,GAAsBK,CAAE,EAC7B,MAAM,IAAI,UAAWH,GAAQ,gFAAiFG,CAAE,CAAE,EAEnH,OAAOJ,GAAMG,EAAGC,CAAE,CACnB,CAKAP,GAAO,QAAUK,KC1DjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,QAAS,8BAA+B,EACvDC,GAAO,KACPC,GAAS,QAAS,uBAAwB,EAqB9C,SAASC,GAAkBC,EAAIC,EAAK,CACnC,GAAK,CAACL,GAAcI,CAAG,EACtB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAG,CAAE,EAElH,GAAK,CAACJ,GAAcK,CAAG,EACtB,MAAM,IAAI,UAAWH,GAAQ,+EAAgFG,CAAG,CAAE,EAEnH,OAAOJ,GAAMG,EAAIC,CAAG,CACrB,CAKAN,GAAO,QAAUI,KC1DjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,QAAS,8BAA+B,EACvDC,GAAO,KACPC,GAAS,QAAS,uBAAwB,EAkB9C,SAASC,GAAiBC,EAAI,CAC7B,GAAK,CAACJ,GAAcI,CAAE,EACrB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAE,CAAE,EAEjH,OAAOH,GAAMG,CAAE,CAChB,CAKAL,GAAO,QAAUI,KCpDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,KACfC,GAAe,KACfC,GAAa,KACbC,GAAa,KACbC,GAAY,KACZC,GAAc,KACdC,GAAc,KACdC,GAAa,KACbC,GAAoB,KACpBC,GAAiB,KACjBC,GAAkB,KAMlBC,GAAQ,CACX,QAAWX,GACX,QAAWC,GACX,QAAW,MACX,MAASC,GACT,MAASC,GACT,KAAQC,GACR,OAAUC,GACV,OAAUC,GACV,MAASC,GACT,OAAUC,GACV,UAAaC,GACb,WAAcC,EACf,EAKAX,GAAO,QAAUY,KCxDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,QAAS,8BAA+B,EACvDC,GAAU,IACVC,GAAQ,KACRC,GAAiB,QAAS,6CAA8C,EACxEC,GAAgB,QAAS,4CAA6C,EACtEC,GAAS,QAAS,uBAAwB,EAC1CC,GAAQ,QAAS,yBAA0B,EAC3CC,GAAO,KAoBX,SAASC,GAAaC,EAAQ,CAC7B,OAASA,IAAU,WACpB,CAiBA,SAASC,GAAcD,EAAQ,CAC9B,OAASA,IAAU,YACpB,CAoBA,SAASE,GAASC,EAAGH,EAAQ,CAC5B,IAAII,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAK,CAACnB,GAAcY,CAAE,EACrB,MAAM,IAAI,UAAWP,GAAQ,8EAA+EO,CAAE,CAAE,EAGjH,GAAKH,IAAU,UACd,OAAOF,GAAMK,CAAE,EAGhB,GADAE,EAAOZ,GAAOO,CAAM,EACfK,IAAS,KACb,MAAM,IAAI,UAAWT,GAAQ,uFAAwFI,CAAM,CAAE,EAa9H,OAVAS,EAAMN,EAAE,OAGRO,EAAIlB,GAASW,CAAE,EACfC,EAAQL,GAAaW,CAAE,EAGvBF,EAAM,IAAIH,EAAMI,CAAI,EAGfL,GAASH,GAAcS,CAAE,GACxBN,EACJE,EAAOX,GAAeQ,EAAG,CAAE,EAE3BG,EAAOZ,GAAgBS,EAAG,CAAE,EAGxBJ,GAAaC,CAAM,GACvBO,EAAOZ,GAAea,EAAK,CAAE,EAC7BX,GAAOY,EAAI,EAAGH,EAAM,EAAGC,EAAM,CAAE,EACxBC,GAEHP,GAAcD,CAAM,GACxBO,EAAOb,GAAgBc,EAAK,CAAE,EAC9BX,GAAOY,EAAI,EAAGH,EAAM,EAAGC,EAAM,CAAE,EACxBC,IAGRX,GAAOY,EAAKH,EAAM,EAAGE,EAAK,CAAE,EACrBA,KAGRJ,EAAQL,GAAaC,CAAM,EACtBI,GAASH,GAAcD,CAAM,GAC5BI,EACJG,EAAOZ,GAAea,EAAK,CAAE,EAE7BD,EAAOb,GAAgBc,EAAK,CAAE,EAG/BX,GAAOY,EAAKN,EAAG,EAAGI,EAAM,CAAE,EACnBC,IAGRX,GAAOY,EAAKN,EAAG,EAAGK,EAAK,CAAE,EAClBA,GACR,CAKAlB,GAAO,QAAUY,KClKjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,IACVC,GAAU,KACVC,GAAS,QAAS,uBAAwB,EAuB9C,SAASC,GAAaC,EAAGC,EAAI,CAC5B,IAAIC,EAAQN,GAASK,CAAE,EACvB,GAAKC,IAAU,KACd,MAAM,IAAI,UAAWJ,GAAQ,yGAA0GI,EAAOD,CAAE,CAAE,EAEnJ,OAAOJ,GAASG,EAAGE,CAAM,CAC1B,CAKAP,GAAO,QAAUI,KC1DjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,UAAa,WAAe,SAAW,OAK3DD,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,IAAW,CACnB,MAAM,IAAI,MAAO,iBAAkB,CACpC,CAKAD,GAAO,QAAUC,KCpCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsCA,IAAIC,GAAqB,QAAS,qCAAsC,EACpEC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAAmB,EACvBG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,iCAAkC,EACxDC,GAAY,QAAS,2BAA4B,EACjDC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAW,QAAS,0BAA2B,EAC/CC,GAAS,QAAS,uBAAwB,EAC1CC,GAAQ,QAAS,iCAAkC,EACnDC,GAAQ,QAAS,iCAAkC,EACnDC,GAAO,QAAS,gCAAiC,EAKjDC,GAAY,oBACZC,GAAW,CAAE,QAAS,OAAQ,OAAQ,EAe1C,SAASC,GAAWC,EAAOC,EAAO,CACjC,IAAIC,EAGJ,GADAA,EAAO,OAAOF,EACTE,IAAS,SAAW,CAExB,GADAF,EAAQ,KAAK,MAAOA,CAAM,EACrBA,IAAUA,EACd,MAAM,IAAI,MAAOP,GAAQ,6CAA8CQ,EAAK,YAAY,CAAE,CAAE,EAE7FD,EAAQ,IAAI,KAAMA,CAAM,CACzB,CACA,GAAKE,IAAS,SAAW,CACxB,GAAK,CAACL,GAAU,KAAMG,CAAM,EAC3B,MAAM,IAAI,MAAOP,GAAQ,mFAAoFQ,EAAK,YAAY,CAAE,CAAE,EAE9HD,EAAM,SAAS,EAAE,SAAW,KAChCA,GAAS,KAEVA,EAAQ,IAAI,KAAMA,CAAM,CACzB,CACA,GAAK,EAAEA,aAAiB,MACvB,MAAM,IAAI,UAAWP,GAAQ,gHAAiHQ,CAAK,CAAE,EAEtJ,OAAOD,CACR,CAiCA,SAASG,GAAWC,EAAOC,EAAMC,EAAQC,EAAU,CAClD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAPAP,EAAM,IACNC,EAAM,GACNF,EAAO,CACN,MAAS,OACV,EACAJ,EAAQL,GAAWK,EAAO,OAAQ,EAClCC,EAAON,GAAWM,EAAM,MAAO,EAC1B,UAAU,OAAS,EAAI,CAc3B,GAbK,UAAU,SAAW,EACpBb,GAAUc,CAAO,EACrBE,EAAOF,GAEPG,EAAMH,EAGNI,EAAM,KAGPF,EAAOD,EACPE,EAAMH,GAEFG,IAAQ,EACZ,MAAO,CAAC,EAET,GAAK,CAACnB,GAAWmB,CAAI,GAAKA,EAAM,EAC/B,MAAM,IAAI,UAAWhB,GAAQ,oEAAqEgB,CAAI,CAAE,EAEzG,GAAKC,EAAM,CACV,GAAK,CAAClB,GAAUgB,CAAK,EACpB,MAAM,IAAI,UAAWf,GAAQ,qEAAsEe,CAAK,CAAE,EAE3G,GAAKnB,GAAYmB,EAAM,OAAQ,EAAI,CAClC,GAAK,CAACjB,GAAUiB,EAAK,KAAM,EAC1B,MAAM,IAAI,UAAWf,GAAQ,8DAA+D,QAASe,EAAK,KAAM,CAAE,EAEnH,GAAKV,GAAS,QAASU,EAAK,KAAM,IAAM,GACvC,MAAM,IAAI,MAAOf,GAAQ,gFAAiF,QAASK,GAAS,KAAM,MAAO,EAAGU,EAAK,KAAM,CAAE,CAE3J,CACD,CACD,CACA,OAASA,EAAK,MAAQ,CACtB,IAAK,QACJK,EAAMlB,GACN,MACD,IAAK,OACJkB,EAAMjB,GACN,MACD,IAAK,QACL,QACCiB,EAAMnB,GACN,KACD,CAWA,IARAkB,EAAMH,EAAM,EACZM,GAAMV,EAAK,QAAQ,EAAID,EAAM,QAAQ,GAAMQ,EAG3CD,EAAM,IAAI,MAAOF,CAAI,EACrBK,EAAMV,EACNO,EAAK,CAAE,EAAIG,EACXA,EAAMA,EAAI,QAAQ,EACZE,EAAI,EAAGA,EAAIJ,EAAKI,IACrBF,GAAOC,EACPJ,EAAKK,CAAE,EAAI,IAAI,KAAMH,EAAKC,CAAI,CAAE,EAEjC,OAAAH,EAAKC,CAAI,EAAIP,EACNM,CACR,CAKAvB,GAAO,QAAUe,KChMjB,IAAAc,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+BA,SAASC,IAAW,CACnB,MAAO,CAEN,OAAU,CACT,QAAW,UACX,QAAW,UACX,KAAQ,UACR,eAAkB,UAClB,oBAAuB,UACvB,uBAA0B,aAC1B,QAAW,QACX,eAAkB,QAClB,iBAAoB,QACrB,CACD,CACD,CAKAD,GAAO,QAAUC,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAKXC,GAAWD,GAAS,EACpBE,GAAO,CACV,iBAAkBD,GAAS,OAAO,QAClC,iBAAkBA,GAAS,OAAO,QAClC,cAAeA,GAAS,OAAO,KAC/B,wBAAyBA,GAAS,OAAO,eACzC,6BAA8BA,GAAS,OAAO,oBAC9C,gCAAiCA,GAAS,OAAO,uBACjD,iBAAkBA,GAAS,OAAO,QAClC,wBAAyBA,GAAS,OAAO,eACzC,0BAA2BA,GAAS,OAAO,gBAC5C,EAeA,SAASE,GAAKC,EAAO,CACpB,IAAIC,EAAIH,GAAME,CAAK,EACnB,OAASC,IAAM,OAAW,KAAOA,CAClC,CAKAN,GAAO,QAAUI,KC7DjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAM,KAKVF,GAAaC,GAAM,MAAOC,EAAI,EAK9BH,GAAO,QAAUE,KC9CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACE,IAAO,CACL,YACA,aACA,UACA,UACA,UACA,QACA,QACA,OACA,SACA,SACA,QACA,QACF,EACA,eAAkB,CAChB,YACA,aACA,UACA,SACF,EACA,oBAAuB,CACrB,UACA,SACF,EACA,uBAA0B,CACxB,YACA,YACF,EACA,QAAW,CACT,QACA,QACA,OACA,SACA,SACA,QACA,QACF,EACA,eAAkB,CAChB,QACA,QACA,MACF,EACA,iBAAoB,CAClB,SACA,SACA,QACA,QACF,EACA,KAAQ,CACN,UACA,UACA,QACA,QACA,OACA,SACA,SACA,QACA,QACF,EACA,QAAW,CACT,YACA,aACA,UACA,UACA,QACA,QACA,OACA,SACA,SACA,QACA,QACF,CACF,ICzEA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,6BAA8B,EACjDC,GAAS,KAKTC,GAAY,gBAmBhB,SAASC,IAAS,CACjB,IAAIC,EACAC,EACAC,EACJ,OAAK,UAAU,SAAW,EAClBL,GAAO,IAAI,MAAM,GAEzBK,EAAM,GACNF,EAAO,UAAW,CAAE,EACfF,GAAU,KAAME,CAAK,IACzBA,EAAOJ,GAASI,EAAMF,GAAW,EAAG,EAC/BE,IAAS,QACbE,EAAM,KAGRD,EAAMJ,GAAQG,CAAK,EACnBC,EAAQA,EAAQA,EAAI,MAAM,EAAI,CAAC,EAC1BC,GAAOD,EAAI,OAAS,GACxBA,EAAI,KAAM,SAAU,EAEdA,EACR,CAKAN,GAAO,QAAUI,KCzEjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,6BAA8B,EACrDC,GAAe,QAAS,8BAA+B,EAe3D,SAASC,IAAQ,CAChB,IAAIC,EAAMH,GAAa,CAAE,EACzB,OAAOC,GAAcE,CAAI,CAC1B,CAKAJ,GAAO,QAAUG,KC9CjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,KACfC,GAAe,KACfC,GAAa,KACbC,GAAa,KACbC,GAAY,KACZC,GAAc,KACdC,GAAc,KACdC,GAAa,KACbC,GAAoB,KACpBC,GAAiB,KACjBC,GAAkB,KAMlBC,GAAQ,CACX,QAAWX,GACX,QAAWC,GACX,MAASC,GACT,MAASC,GACT,KAAQC,GACR,OAAUC,GACV,OAAUC,GACV,MAASC,GACT,OAAUC,GACV,UAAaC,GACb,WAAcC,EACf,EAKAX,GAAO,QAAUY,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAc,QAAS,6BAA8B,EACrDC,GAAQ,KACRC,GAAQ,KACRC,GAAkB,QAAS,wCAAyC,EACpEC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAgBF,GAAS,IAAK,gBAAiB,EAsBnD,SAASG,GAAOC,EAAS,CACxB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAK,CAAChB,GAAsBS,CAAO,EAClC,MAAM,IAAI,UAAWH,GAAQ,+EAAgFG,CAAO,CAAE,EAOvH,GALK,UAAU,OAAS,EACvBG,EAAQ,UAAW,CAAE,EAErBA,EAAQL,GAEJK,IAAU,UACd,OAAOT,GAAOM,CAAO,EAGtB,GADAC,EAASN,GAAiBQ,CAAM,EAC3BF,IAAW,KACf,MAAM,IAAI,UAAWJ,GAAQ,gFAAiFM,CAAM,CAAE,EAGvH,OAAAC,EAAOX,GAAOU,CAAM,EAGpBI,EAAKN,EAASD,EACTG,IAAU,eACdI,GAAM,GAGPF,EAAMb,GAAae,CAAG,EAGtBL,EAASG,EAAI,WACRF,IAAU,eACRZ,GAAsBW,EAAOD,CAAO,IACzCC,GAAU,IAIZI,EAAM,IAAIF,EAAMC,EAAI,OAAQH,EAAQF,CAAO,EAEpCM,CACR,CAKAhB,GAAO,QAAUS,KC1GjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAQ,KACRC,GAAS,KACTC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAgBF,GAAS,IAAK,gBAAiB,EAsBnD,SAASG,GAAOC,EAAS,CACxB,IAAIC,EACAC,EACJ,GAAK,CAACT,GAAsBO,CAAO,EAClC,MAAM,IAAI,UAAWH,GAAQ,+EAAgFG,CAAO,CAAE,EAOvH,GALK,UAAU,OAAS,EACvBC,EAAQ,UAAW,CAAE,EAErBA,EAAQH,GAEJG,IAAU,UACd,OAAON,GAAQK,CAAO,EAGvB,GADAE,EAAOR,GAAOO,CAAM,EACfC,IAAS,KACb,MAAM,IAAI,UAAWL,GAAQ,iFAAkFI,CAAM,CAAE,EAExH,OAAO,IAAIC,EAAMF,CAAO,CACzB,CAKAR,GAAO,QAAUO,KC7EjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAuBZ,SAASC,GAAOC,EAAS,CACxB,OAAK,UAAU,OAAS,EAChBF,GAAOE,EAAQ,UAAW,CAAE,CAAE,EAE/BF,GAAOE,CAAO,CACtB,CAKAH,GAAO,QAAUE,KCvDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAqB,KACrBC,GAAO,KACPC,GAAW,KAKXC,GACCH,GAAmB,EACvBG,GAAQF,GAERE,GAAQD,GAMTH,GAAO,QAAUI,KCzDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,IACRC,GAAQ,KACRC,GAAS,QAAS,uBAAwB,EAsB9C,SAASC,GAAWC,EAAI,CACvB,IAAIC,EAAKL,GAAOI,CAAE,EAClB,GAAKC,IAAO,KACX,MAAM,IAAI,UAAWH,GAAQ,8GAA+GE,CAAE,CAAE,EAEjJ,OAAK,UAAU,OAAS,IACvBC,EAAK,UAAW,CAAE,GAEZJ,GAAOG,EAAE,OAAQC,CAAG,CAC5B,CAKAN,GAAO,QAAUI,KC5DjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAe,QAAS,8BAA+B,EACvDC,GAAgB,QAAS,+BAAgC,EACzDC,GAAW,QAAS,0BAA2B,EAC/CC,GAAa,QAAS,4BAA6B,EACnDC,GAAQ,KACRC,GAAQ,QAAS,6BAA8B,EAC/CC,GAAS,KACTC,GAA2B,QAAS,4CAA6C,EACjFC,GAAkB,QAAS,yBAA0B,EACrDC,GAAa,QAAS,qBAAsB,EAC5CC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAsBL,GAAyB,EAC/CM,GAAgBH,GAAS,IAAK,gBAAiB,EAanD,SAASI,GAAgBC,EAAIC,EAAQ,CACpC,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EAENC,EAAIH,EAAG,KAAK,EACP,CAAAG,EAAE,MAGPD,EAAI,KAAMD,CAAM,EAEjB,OAAOC,CACR,CAUA,SAASE,GAAiBF,EAAKD,EAAQ,CACtC,IAAII,EACJ,IAAMA,EAAI,EAAGA,EAAIH,EAAI,OAAQG,IAC5BH,EAAI,IAAKD,EAAOI,CAAE,EAEnB,OAAOH,CACR,CA8FA,SAASI,IAAc,CACtB,IAAIL,EACAM,EACAC,EACAC,EACAP,EACAQ,EACAC,EAWJ,GATAJ,EAAQ,UAAU,OAClBA,GAAS,EACJA,GAAS,GAAKxB,GAAU,UAAWwB,CAAM,CAAE,GAC/CC,EAAQ,UAAWD,CAAM,EACzBA,GAAS,GAETC,EAAQV,GAETW,EAAOpB,GAAOmB,CAAM,EACfC,IAAS,KACb,MAAM,IAAI,UAAWb,GAAQ,sEAAuEY,CAAM,CAAE,EAE7G,GAAKA,IAAU,UAAY,CAC1B,GAAKD,GAAS,EACb,MAAO,CAAC,EAIT,GAFAN,EAAQ,UAAW,CAAE,EACrBU,EAAM,UAAW,CAAE,EACdJ,IAAU,EAAI,CAMlB,GALKvB,GAAsB2B,CAAI,EAC9BD,EAAMC,EACK1B,GAAc0B,CAAI,IAC7BD,EAAMC,EAAI,QAEND,IAAQ,OACZ,OAAOnB,GAAQU,EAAOS,CAAI,EAE3B,GAAKxB,GAAeyB,CAAI,EACvB,MAAM,IAAI,MAAO,mFAAoF,EAEtG,GAAKxB,GAAUwB,CAAI,EAAI,CACtB,GAAKd,KAAwB,GAC5B,MAAM,IAAI,UAAWD,GAAQ,sIAAuIe,CAAI,CAAE,EAE3K,GAAK,CAACvB,GAAYuB,EAAKlB,EAAgB,CAAE,EACxC,MAAM,IAAI,UAAWG,GAAQ,wGAAyGe,CAAI,CAAE,EAG7I,GADAA,EAAMA,EAAKlB,EAAgB,EAAE,EACxB,CAACL,GAAYuB,EAAI,IAAK,EAC1B,MAAM,IAAI,UAAWf,GAAQ,wGAAyGe,CAAI,CAAE,EAE7I,OAAOZ,GAAgBY,EAAKV,CAAM,CACnC,CACA,MAAM,IAAI,UAAWL,GAAQ,wGAAyGe,CAAI,CAAE,CAC7I,SAAYzB,GAAeyB,CAAI,EAC9B,MAAM,IAAI,MAAO,mFAAoF,EAEtG,MAAM,IAAI,UAAWf,GAAQ,wGAAyGe,CAAI,CAAE,CAC7I,CACA,GAAKJ,GAAS,EACb,OAAO,IAAIE,EAAM,CAAE,EAEpB,GAAKF,IAAU,EAEd,GADAI,EAAM,UAAW,CAAE,EACd1B,GAAc0B,CAAI,EACtBT,EAAM,IAAIO,EAAME,EAAI,MAAO,UAChBzB,GAAeyB,CAAI,EAC9BT,EAAM,IAAIO,EAAME,CAAI,UACT3B,GAAsB2B,CAAI,EACrCT,EAAM,IAAIO,EAAME,CAAI,UACTxB,GAAUwB,CAAI,EAAI,CAC7B,GAAKd,KAAwB,GAC5B,MAAM,IAAI,UAAWD,GAAQ,sIAAuIe,CAAI,CAAE,EAE3K,GAAK,CAACvB,GAAYuB,EAAKlB,EAAgB,CAAE,EACxC,MAAM,IAAI,UAAWG,GAAQ,wGAAyGe,CAAI,CAAE,EAG7I,GADAA,EAAMA,EAAKlB,EAAgB,EAAE,EACxB,CAACL,GAAYuB,EAAI,IAAK,EAC1B,MAAM,IAAI,UAAWf,GAAQ,wGAAyGe,CAAI,CAAE,EAE7IT,EAAM,IAAIO,EAAMf,GAAYiB,CAAI,CAAE,CACnC,KACC,OAAM,IAAI,UAAWf,GAAQ,wGAAyGe,CAAI,CAAE,OAElIJ,IAAU,EACrBL,EAAM,IAAIO,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAE3CP,EAAM,IAAIO,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAE1D,OAAKP,EAAI,OAAS,IACZ,WAAW,KAAMM,CAAM,EAC3BJ,GAAiBF,EAAK,UAAW,CAAE,CAAE,EAErCZ,GAAOY,EAAI,OAAQ,UAAW,CAAE,EAAGA,EAAK,CAAE,GAGrCA,CACR,CAKApB,GAAO,QAAUwB,KCvRjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA8HA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCnIjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAe,QAAS,8BAA+B,EACvDC,GAAgB,QAAS,+BAAgC,EACzDC,GAAW,QAAS,0BAA2B,EAC/CC,GAAa,QAAS,4BAA6B,EACnDC,GAAQ,KACRC,GAAU,QAAS,gCAAiC,EACpDC,GAAc,KACdC,GAA2B,QAAS,4CAA6C,EACjFC,GAAkB,QAAS,yBAA0B,EACrDC,GAAa,QAAS,qBAAsB,EAC5CC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAsBL,GAAyB,EAC/CM,GAAgBH,GAAS,IAAK,gBAAiB,EAcnD,SAASI,GAAqBC,EAAIC,EAAMC,EAAU,CACjD,IAAIC,EACAC,EACAC,EAIJ,IAFAF,EAAM,CAAC,EACPC,EAAI,GAEHC,EAAIL,EAAG,KAAK,EACP,CAAAK,EAAE,MAGPD,GAAK,EACLD,EAAI,KAAMF,EAAK,KAAMC,EAASE,CAAE,CAAE,EAEnC,OAAOD,CACR,CAWA,SAASG,GAAiBH,EAAKF,EAAMC,EAAU,CAC9C,IAAI,EACJ,IAAM,EAAI,EAAG,EAAIC,EAAI,OAAQ,IAC5BA,EAAI,IAAKF,EAAK,KAAMC,EAAS,CAAE,EAAG,CAAE,EAErC,OAAOC,CACR,CA4JA,SAASI,IAAgB,CACxB,IAAIL,EACAM,EACAC,EACAR,EACAS,EACAP,EACAQ,EACAC,EAKJ,GAHAJ,EAAQ,UAAU,OAGbA,IAAU,EACd,OAAAE,EAAOrB,GAAOS,EAAc,EACrB,IAAIY,EAAM,CAAE,EAIpB,GADAD,EAAQ,UAAW,CAAE,EAChB1B,GAAU0B,CAAM,EAAI,CAExB,GAAKD,EAAQ,EACZ,MAAM,IAAI,UAAW,2FAA4F,EAGlH,GADAE,EAAOrB,GAAOoB,CAAM,EACfC,IAAS,KACb,MAAM,IAAI,UAAWd,GAAQ,sEAAuEa,CAAM,CAAE,EAG7G,OAAO,IAAIC,EAAM,CAAE,CACpB,CAEA,GAAKF,EAAQ,EACZ,MAAM,IAAI,UAAW,2FAA4F,EAMlH,GAHAA,GAAS,EAGJpB,GAAY,UAAWoB,CAAM,CAAE,EAEnC,GAAKpB,GAAY,UAAWoB,EAAM,CAAE,CAAE,GAMrC,GALAN,EAAU,UAAWM,CAAM,EAC3BA,GAAS,EACTP,EAAO,UAAWO,CAAM,EAGnBA,IAAU,EACd,MAAM,IAAI,UAAW,2FAA4F,OAIlHP,EAAO,UAAWO,CAAM,UAIhBA,GAAS,GAIlB,GAHAN,EAAU,UAAWM,CAAM,EAC3BA,GAAS,EACTP,EAAO,UAAWO,CAAM,EACnB,CAACpB,GAAYa,CAAK,EACtB,MAAM,IAAI,UAAWL,GAAQ,uEAAwEK,CAAK,CAAE,MAK7G,OAAM,IAAI,UAAW,2FAA4F,EAWlH,GARAO,GAAS,EACJA,GAAS,GAAKzB,GAAU,UAAWyB,CAAM,CAAE,GAC/CC,EAAQ,UAAWD,CAAM,EACzBA,GAAS,GAETC,EAAQX,GAETY,EAAOrB,GAAOoB,CAAM,EACfC,IAAS,KACb,MAAM,IAAI,UAAWd,GAAQ,sEAAuEa,CAAM,CAAE,EAG7G,GAAKA,IAAU,UAAY,CAE1B,GADAG,EAAM,UAAW,CAAE,EACdJ,IAAU,EAAI,CAMlB,GALKxB,GAAsB4B,CAAI,EAC9BD,EAAMC,EACK3B,GAAc2B,CAAI,IAC7BD,EAAMC,EAAI,QAEND,IAAQ,OACZ,OAAOpB,GAAaoB,EAAKV,EAAMC,CAAQ,EAExC,GAAKhB,GAAe0B,CAAI,EACvB,MAAM,IAAI,MAAO,mFAAoF,EAEtG,GAAKzB,GAAUyB,CAAI,EAAI,CACtB,GAAKf,KAAwB,GAC5B,MAAM,IAAI,UAAWD,GAAQ,sIAAuIgB,CAAI,CAAE,EAE3K,GAAK,CAACxB,GAAYwB,EAAKnB,EAAgB,CAAE,EACxC,MAAM,IAAI,UAAWG,GAAQ,wGAAyGgB,CAAI,CAAE,EAG7I,GADAA,EAAMA,EAAKnB,EAAgB,EAAE,EACxB,CAACL,GAAYwB,EAAI,IAAK,EAC1B,MAAM,IAAI,UAAWhB,GAAQ,wGAAyGgB,CAAI,CAAE,EAE7I,OAAOb,GAAqBa,EAAKX,EAAMC,CAAQ,CAChD,CACA,MAAM,IAAI,UAAWN,GAAQ,wGAAyGgB,CAAI,CAAE,CAC7I,SAAY1B,GAAe0B,CAAI,EAC9B,MAAM,IAAI,MAAO,mFAAoF,EAEtG,MAAM,IAAI,UAAWhB,GAAQ,wGAAyGgB,CAAI,CAAE,CAC7I,CACA,GAAKJ,IAAU,EAEd,GADAI,EAAM,UAAW,CAAE,EACd3B,GAAc2B,CAAI,EACtBT,EAAM,IAAIO,EAAME,EAAI,MAAO,UAChB1B,GAAe0B,CAAI,EAC9BT,EAAM,IAAIO,EAAME,CAAI,UACT5B,GAAsB4B,CAAI,EACrCT,EAAM,IAAIO,EAAME,CAAI,UACTzB,GAAUyB,CAAI,EAAI,CAC7B,GAAKf,KAAwB,GAC5B,MAAM,IAAI,UAAWD,GAAQ,sIAAuIgB,CAAI,CAAE,EAE3K,GAAK,CAACxB,GAAYwB,EAAKnB,EAAgB,CAAE,EACxC,MAAM,IAAI,UAAWG,GAAQ,wGAAyGgB,CAAI,CAAE,EAG7I,GADAA,EAAMA,EAAKnB,EAAgB,EAAE,EACxB,CAACL,GAAYwB,EAAI,IAAK,EAC1B,MAAM,IAAI,UAAWhB,GAAQ,wGAAyGgB,CAAI,CAAE,EAE7IT,EAAM,IAAIO,EAAMhB,GAAYkB,CAAI,CAAE,CACnC,KACC,OAAM,IAAI,UAAWhB,GAAQ,wGAAyGgB,CAAI,CAAE,OAElIJ,IAAU,EACrBL,EAAM,IAAIO,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAE3CP,EAAM,IAAIO,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAE1D,OAAKP,EAAI,OAAS,IACZ,WAAW,KAAMM,CAAM,EAC3BH,GAAiBH,EAAKF,EAAMC,CAAQ,EAEpCZ,GAASa,EAAI,OAAQA,EAAK,EAAGU,CAAS,GAGjCV,EAYP,SAASU,EAAUC,EAAOC,EAAO,CAChC,OAAOd,EAAK,KAAMC,EAASa,CAAK,CACjC,CACD,CAKAjC,GAAO,QAAUyB,KC7ZjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0LA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/LjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAiB,QAAS,iCAAkC,EAC5DC,GAAkB,KAClBC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EA0B9C,SAASC,IAAiB,CACzB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAGJ,GADAR,EAAW,UAAW,CAAE,EACnB,UAAU,OAAS,EACvB,GAAKR,GAAc,UAAW,CAAE,CAAE,GAEjC,GADAW,EAAM,UAAW,CAAE,EACd,UAAU,OAAS,EAAI,CAE3B,GADAD,EAAM,UAAW,CAAE,EACd,CAACX,GAAYW,CAAI,EACrB,MAAM,IAAI,UAAWJ,GAAQ,uEAAwEI,CAAI,CAAE,EAE5GD,EAAU,UAAW,CAAE,CACxB,MACM,CAEN,GADAC,EAAM,UAAW,CAAE,EACd,CAACX,GAAYW,CAAI,EACrB,MAAM,IAAI,UAAWJ,GAAQ,uEAAwEI,CAAI,CAAE,EAE5GD,EAAU,UAAW,CAAE,CACxB,CAED,GAAK,CAACR,GAAgBO,CAAS,EAC9B,MAAM,IAAI,UAAWF,GAAQ,kGAAmGE,CAAS,CAAE,EAG5I,GADAO,EAAI,GACCJ,IAAQ,OAAS,CAErB,GADAA,EAAM,CAAC,EACFD,EAAM,CACV,KACCK,GAAK,EACLC,EAAIR,EAAS,KAAK,EACb,CAAAQ,EAAE,MAGPL,EAAI,KAAMD,EAAI,KAAMD,EAASO,EAAE,MAAOD,CAAE,CAAE,EAE3C,OAAOJ,CACR,CACA,KACCK,EAAIR,EAAS,KAAK,EACb,CAAAQ,EAAE,MAGPL,EAAI,KAAMK,EAAE,KAAM,EAEnB,OAAOL,CACR,CAQA,GAPAC,EAAMD,EAAI,OACVG,EAAKT,GAAOM,CAAI,EACXT,GAAiBS,CAAI,EACzBE,EAAMV,GAAgBW,CAAG,EAEzBD,EAAMT,GAAQU,CAAG,EAEbJ,EAAM,CACV,KAAQK,EAAIH,EAAI,IACfG,GAAK,EACLC,EAAIR,EAAS,KAAK,EACb,CAAAQ,EAAE,OAGPH,EAAKF,EAAKI,EAAGL,EAAI,KAAMD,EAASO,EAAE,MAAOD,CAAE,CAAE,EAE9C,OAAOJ,CACR,CACA,KAAQI,EAAIH,EAAI,IACfG,GAAK,EACLC,EAAIR,EAAS,KAAK,EACb,CAAAQ,EAAE,OAGPH,EAAKF,EAAKI,EAAGC,EAAE,KAAM,EAEtB,OAAOL,CACR,CAKAb,GAAO,QAAUS,KC/IjB,IAAAU,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAQ,KACRC,GAAQ,KACRC,GAAQ,QAAS,6BAA8B,EAC/CC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAgBF,GAAS,IAAK,gBAAiB,EAuBnD,SAASG,GAAMC,EAAQC,EAAQ,CAC9B,IAAIC,EACAC,EACAC,EACJ,GAAK,CAACZ,GAAsBQ,CAAO,EAClC,MAAM,IAAI,UAAWH,GAAQ,+EAAgFG,CAAO,CAAE,EAOvH,GALK,UAAU,OAAS,EACvBE,EAAQ,UAAW,CAAE,EAErBA,EAAQJ,GAEJI,IAAU,UACd,OAAOR,GAAOO,EAAOD,CAAO,EAG7B,GADAG,EAAOV,GAAOS,CAAM,EACfC,IAAS,KACb,MAAM,IAAI,UAAWN,GAAQ,gFAAiFK,CAAM,CAAE,EAEvH,OAAAE,EAAM,IAAID,EAAMH,CAAO,EAGvBL,GAAOK,EAAQC,EAAOG,EAAK,CAAE,EAEtBA,CACR,CAKAb,GAAO,QAAUQ,KCrFjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,QAAS,uBAAwB,EAC1CC,GAAQ,IACRC,GAAO,KACPC,GAAa,QAAS,yBAA0B,EAChDC,GAAY,QAAS,yBAA0B,EAuBnD,SAASC,GAAUC,EAAGC,EAAQ,CAC7B,IAAIC,EACAC,EAGJ,GADAD,EAAKP,GAAOK,CAAE,EACTE,IAAO,KACX,MAAM,IAAI,UAAWR,GAAQ,8GAA+GM,CAAE,CAAE,EAEjJ,OAAK,UAAU,OAAS,IACvBE,EAAK,UAAW,CAAE,GAEd,OAAOD,GAAU,SAChBC,IAAO,aACXC,EAAI,IAAIN,GAAYI,EAAO,CAAI,EACpBC,IAAO,YAClBC,EAAI,IAAIL,GAAWG,EAAO,CAAI,EAE9BE,EAAIF,EAGLE,EAAIF,EAEEL,GAAMI,EAAE,OAAQG,EAAGD,CAAG,CAC9B,CAKAT,GAAO,QAAUM,KC7EjB,IAAAK,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAO,QAAS,gCAAiC,EACjDC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAQ,QAAS,iCAAkC,EACnDC,GAAS,QAAS,uBAAwB,EAC1CC,GAAa,QAAS,8BAA+B,EACrDC,GAAM,KAqBV,SAASC,GAAWC,EAAIC,EAAIC,EAAY,CACvC,IAAIC,EACAC,EACJ,GAAK,CAACV,GAAUM,CAAG,GAAKL,GAAOK,CAAG,EACjC,MAAM,IAAI,UAAWJ,GAAQ,wDAAyDI,CAAG,CAAE,EAE5F,GAAK,CAACN,GAAUO,CAAG,GAAKN,GAAOM,CAAG,EACjC,MAAM,IAAI,UAAWL,GAAQ,uDAAwDK,CAAG,CAAE,EAE3F,GAAK,UAAU,OAAS,EACvBG,EAAM,UAENA,EAAMF,EACD,CAACR,GAAUU,CAAI,GAAKT,GAAOS,CAAI,EACnC,MAAM,IAAI,UAAWR,GAAQ,4DAA6DQ,CAAI,CAAE,EAIlG,GADAD,EAAMV,IAAQQ,EAAGD,GAAOI,CAAI,EACvBD,EAAMN,GACV,MAAM,IAAI,WAAY,kEAAmE,EAE1F,OAAOC,GAAKE,EAAIC,EAAIG,CAAI,CACzB,CAKAZ,GAAO,QAAUO,KC3EjB,IAAAM,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,KACfC,GAAe,KACfC,GAAkB,KAClBC,GAAiB,KAMjBC,GAAQ,CACX,QAAWJ,GACX,QAAWC,GACX,WAAcC,GACd,UAAaC,EACd,EAKAJ,GAAO,QAAUK,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,SAASC,GAAUC,EAAOC,EAAMC,EAAKC,EAAW,CAC/C,IAAIC,EACAC,EACAC,EACAC,EAEJ,GAAKL,IAAQ,EACZ,MAAO,CAAC,EAGT,GAAKA,IAAQ,EACZ,OAAKC,EACG,CAAEF,CAAK,EAER,CAAED,CAAM,EAahB,IAXAI,EAAM,CAAEJ,CAAM,EAGTG,EACJE,EAAIH,EAAM,EAEVG,EAAIH,EAELI,GAAML,EAAKD,GAAUK,EAGfE,EAAI,EAAGA,EAAIF,EAAGE,IACnBH,EAAI,KAAMJ,EAASM,EAAEC,CAAG,EAGzB,OAAKJ,GACJC,EAAI,KAAMH,CAAK,EAETG,CACR,CAKAN,GAAO,QAAUC,KChFjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAY,QAAS,yBAA0B,EAC/CC,GAAa,QAAS,yBAA0B,EAChDC,GAAO,QAAS,sBAAuB,EACvCC,GAAO,QAAS,sBAAuB,EACvCC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,QAAS,uBAAwB,EAiB7C,SAASC,GAAUC,EAAKC,EAAOC,EAAKC,EAAMC,EAAKC,EAAW,CACzD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKd,IAAQ,EACZ,MAAO,CAAC,EAgCT,GA9BAG,EAAQ,EACHP,IAAQ,WACZS,EAAMR,EACNU,EAAM,GACKX,IAAQ,aACnBO,GAAS,EACTE,EAAMZ,GAAOI,CAAM,EACnBU,EAAMb,GAAOG,CAAM,IAEnBQ,EAAMd,GAAMM,CAAM,EAClBU,EAAMf,GAAMK,CAAM,GAEdC,IAAQ,WACZQ,EAAMP,EACNS,EAAM,GACKV,IAAQ,aACnBK,GAAS,EACTG,EAAMb,GAAOM,CAAK,EAClBS,EAAMd,GAAOK,CAAK,IAElBO,EAAMf,GAAMQ,CAAK,EACjBS,EAAMhB,GAAMO,CAAK,GAGbI,IAAU,EACdD,EAAQb,GAERa,EAAQZ,GAGJU,IAAQ,EACZ,OAAKC,EACG,CAAE,IAAIC,EAAOI,EAAKE,CAAI,CAAE,EAEzB,CAAE,IAAIN,EAAOG,EAAKE,CAAI,CAAE,EAchC,IAZAH,EAAM,CAAE,IAAIF,EAAOG,EAAKE,CAAI,CAAE,EAGzBN,EACJY,EAAIb,EAAM,EAEVa,EAAIb,EAELW,GAAOL,EAAID,GAAQQ,EACnBD,GAAOJ,EAAID,GAAQM,EAGbC,EAAI,EAAGA,EAAID,EAAGC,IACnBL,EAAKJ,EAAOM,EAAGG,EACfJ,EAAKH,EAAOK,EAAGE,EACfV,EAAI,KAAM,IAAIF,EAAOO,EAAIC,CAAG,CAAE,EAG/B,OAAKT,GACJG,EAAI,KAAM,IAAIF,EAAOI,EAAKE,CAAI,CAAE,EAE1BJ,CACR,CAKAhB,GAAO,QAAUO,KC7HjB,IAAAoB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA+CA,SAASC,GAAUC,EAAKC,EAAOC,EAAMC,EAAKC,EAAW,CACpD,IAAIC,EACAC,EACAC,EAEJ,GAAKJ,IAAQ,EACZ,OAAOH,EAGR,GAAKG,IAAQ,EACZ,OAAKC,EACJJ,EAAK,CAAE,EAAIE,EAEXF,EAAK,CAAE,EAAIC,EAELD,EAaR,IAXAA,EAAK,CAAE,EAAIC,EAGNG,EACJC,EAAIF,EAAM,EAEVE,EAAIF,EAELG,GAAMJ,EAAKD,GAAUI,EAGfE,EAAI,EAAGA,EAAIF,EAAGE,IACnBP,EAAKO,CAAE,EAAIN,EAASK,EAAEC,EAGvB,OAAKH,IACJJ,EAAKK,CAAE,EAAIH,GAELF,CACR,CAKAF,GAAO,QAAUC,KCxFjB,IAAAS,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAO,QAAS,sBAAuB,EACvCC,GAAO,QAAS,sBAAuB,EACvCC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,QAAS,uBAAwB,EAkB7C,SAASC,GAAUC,EAAKC,EAAKC,EAAOC,EAAKC,EAAMC,EAAKC,EAAW,CAC9D,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKV,IAAQ,EACZ,OAAOL,EAuBR,GArBKC,IAAQ,WACZM,EAAML,EACNO,EAAM,GACKR,IAAQ,aACnBM,EAAMV,GAAOK,CAAM,EACnBO,EAAMX,GAAOI,CAAM,IAEnBK,EAAMZ,GAAMO,CAAM,EAClBO,EAAMb,GAAMM,CAAM,GAEdC,IAAQ,WACZK,EAAMJ,EACNM,EAAM,GACKP,IAAQ,aACnBK,EAAMX,GAAOO,CAAK,EAClBM,EAAMZ,GAAOM,CAAK,IAElBI,EAAMb,GAAMS,CAAK,EACjBM,EAAMd,GAAMQ,CAAK,GAGbC,IAAQ,EACZ,OAAKC,GACJN,EAAK,CAAE,EAAIQ,EACXR,EAAK,CAAE,EAAIU,IAEXV,EAAK,CAAE,EAAIO,EACXP,EAAK,CAAE,EAAIS,GAELT,EAgBR,IAdAA,EAAK,CAAE,EAAIO,EACXP,EAAK,CAAE,EAAIS,EAGNH,EACJO,EAAIR,EAAM,EAEVQ,EAAIR,EAELM,GAAOH,EAAID,GAAQM,EACnBD,GAAOF,EAAID,GAAQI,EAGnBE,EAAI,EACED,EAAI,EAAGA,EAAID,EAAGC,IACnBd,EAAKe,CAAE,EAAIR,EAAOI,EAAGG,EACrBd,EAAKe,EAAE,CAAE,EAAIN,EAAOG,EAAGE,EACvBC,GAAK,EAGN,OAAKT,IACJN,EAAKe,CAAE,EAAIP,EACXR,EAAKe,EAAE,CAAE,EAAIL,GAEPV,CACR,CAKAN,GAAO,QAAUK,KCtHjB,IAAAiB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,gCAAiC,EACrDC,GAAa,QAAS,iCAAkC,EACxDC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAY,QAAS,2BAA4B,EAAE,YACnDC,GAAS,QAAS,uBAAwB,EAyB9C,SAASC,GAAUC,EAAMC,EAAU,CAClC,OAAMP,GAAUO,CAAQ,EAGnBN,GAAYM,EAAS,OAAQ,IACjCD,EAAK,MAAQC,EAAQ,MAChB,CAACL,GAAUI,EAAK,KAAM,GACnB,IAAI,UAAWF,GAAQ,8DAA+D,QAASE,EAAK,KAAM,CAAE,EAGhHL,GAAYM,EAAS,UAAW,IACpCD,EAAK,SAAWC,EAAQ,SACnB,CAACJ,GAAWG,EAAK,QAAS,GACvB,IAAI,UAAWF,GAAQ,+DAAgE,WAAYE,EAAK,QAAS,CAAE,EAGrH,KAdC,IAAI,UAAWF,GAAQ,qEAAsEG,CAAQ,CAAE,CAehH,CAKAR,GAAO,QAAUM,KCzEjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACI,SAAY,EAChB,ICFA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAQ,QAAS,iCAAkC,EACnDC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,KACRC,GAAgB,QAAS,4CAA6C,EACtEC,GAAiB,QAAS,6CAA8C,EACxEC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAC1CC,GAAU,KACVC,GAAW,KACXC,GAAY,KACZC,GAAa,KACbC,GAAW,KACXC,GAAW,KAKXC,GAAwBR,GAAS,IAAK,+BAAgC,EA6B1E,SAASS,GAAUC,EAAOC,EAAMC,EAAM,CACrC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAK,OAAOT,GAAU,SAAW,CAEhC,GADAO,EAAMrB,GAAOc,CAAM,EACdO,IAAQ,KAAO,CACnB,GAAK,CAACzB,GAAekB,CAAM,EAC1B,MAAM,IAAI,UAAWT,GAAQ,yFAA0FS,CAAM,CAAE,EAEhIO,EAAM,YACP,CACAE,EAAM,EACP,KAAO,IAAK,CAAC1B,GAAUiB,CAAM,GAAKf,GAAOe,CAAM,EAC9C,MAAM,IAAI,UAAWT,GAAQ,yFAA0FS,CAAM,CAAE,EAE/HO,EAAM,UAEP,GAAK,OAAON,GAAS,SAAW,CAE/B,GADAO,EAAMtB,GAAOe,CAAK,EACbO,IAAQ,KAAO,CACnB,GAAK,CAAC1B,GAAemB,CAAK,EACzB,MAAM,IAAI,UAAWV,GAAQ,0FAA2FU,CAAK,CAAE,EAEhIO,EAAM,YACP,CACAC,EAAM,EACP,KAAO,IAAK,CAAC1B,GAAUkB,CAAK,GAAKhB,GAAOgB,CAAK,EAC5C,MAAM,IAAI,UAAWV,GAAQ,0FAA2FU,CAAK,CAAE,EAE/HO,EAAM,UAEP,GAAK,CAACxB,GAAsBkB,CAAI,EAC/B,MAAM,IAAI,UAAWX,GAAQ,+EAAgFW,CAAI,CAAE,EAWpH,GATAC,EAAO,CACN,SAAYN,GAAS,QACtB,EACKU,IAAQC,EACZL,EAAK,MAAQI,EAGbJ,EAAK,MAAQL,GAET,UAAU,OAAS,IACvBO,EAAMT,GAAUO,EAAM,UAAW,CAAE,CAAE,EAChCE,GACJ,MAAMA,EAGR,GAAKF,EAAK,QAAU,UACnB,OAAKM,EACGhB,GAAUc,EAAKP,EAAOQ,EAAKP,EAAMC,EAAKC,EAAK,QAAS,EAErDX,GAASQ,EAAOC,EAAMC,EAAKC,EAAK,QAAS,EAGjD,GADAC,EAAOjB,GAAOgB,EAAK,KAAM,EACpBC,IAAS,KACb,MAAM,IAAI,UAAWb,GAAQ,6GAA8G,QAASY,EAAK,KAAM,CAAE,EAGlK,GADAG,EAAM,IAAIF,EAAMF,CAAI,EACfC,EAAK,QAAU,YACnB,OAAAR,GAAYP,GAAekB,EAAK,CAAE,EAAGC,EAAKP,EAAOQ,EAAKP,EAAMC,EAAKC,EAAK,QAAS,EACxEG,EAER,GAAKH,EAAK,QAAU,aACnB,OAAAR,GAAYN,GAAgBiB,EAAK,CAAE,EAAGC,EAAKP,EAAOQ,EAAKP,EAAMC,EAAKC,EAAK,QAAS,EACzEG,EAER,GAAKG,EACJ,MAAM,IAAI,UAAW,0JAA2J,EAEjL,OAAOf,GAAWY,EAAKN,EAAOC,EAAMC,EAAKC,EAAK,QAAS,CACxD,CAKAtB,GAAO,QAAUkB,KC1JjB,IAAAW,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAY,QAAS,yBAA0B,EAC/CC,GAAa,QAAS,yBAA0B,EAChDC,GAAO,QAAS,sBAAuB,EACvCC,GAAO,QAAS,sBAAuB,EACvCC,GAAQ,QAAS,uBAAwB,EACzCC,GAAQ,QAAS,uBAAwB,EAoB7C,SAASC,GAAUC,EAAKC,EAAKC,EAAOC,EAAKC,EAAMC,EAAKC,EAAW,CAC9D,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKf,IAAQ,EACZ,OAAOL,EAoCR,GAlCAQ,EAAQ,EACHP,IAAQ,WACZQ,EAAMP,EACNS,EAAM,GACKV,IAAQ,aACnBO,GAAS,EACTC,EAAMZ,GAAOK,CAAM,EACnBS,EAAMb,GAAOI,CAAM,IAEnBO,EAAMd,GAAMO,CAAM,EAClBS,EAAMf,GAAMM,CAAM,GAEdC,IAAQ,WACZO,EAAMN,EACNQ,EAAM,GACKT,IAAQ,aACnBK,GAAS,EACTE,EAAMb,GAAOO,CAAK,EAClBQ,EAAMd,GAAOM,CAAK,IAElBM,EAAMf,GAAMS,CAAK,EACjBQ,EAAMhB,GAAMQ,CAAK,GAGbI,IAAU,EACdD,EAAQd,GAERc,EAAQb,GAGToB,EAAMd,EAAI,KACVa,EAAMb,EAAI,UAAW,CAAE,EAGlBK,IAAQ,EACZ,OAAKC,EACJO,EAAKC,EAAK,EAAG,IAAIP,EAAOG,EAAKE,CAAI,CAAE,EAEnCC,EAAKC,EAAK,EAAG,IAAIP,EAAOE,EAAKE,CAAI,CAAE,EAE7BX,EAcR,IAZAa,EAAKC,EAAK,EAAG,IAAIP,EAAOE,EAAKE,CAAI,CAAE,EAG9BL,EACJa,EAAId,EAAM,EAEVc,EAAId,EAELY,GAAOP,EAAID,GAAQU,EACnBD,GAAON,EAAID,GAAQQ,EAGbC,EAAI,EAAGA,EAAID,EAAGC,IACnBL,EAAKN,EAAOQ,EAAGG,EACfJ,EAAKL,EAAOO,EAAGE,EACfP,EAAKC,EAAKM,EAAG,IAAIb,EAAOQ,EAAIC,CAAG,CAAE,EAGlC,OAAKV,GACJO,EAAKC,EAAKK,EAAG,IAAIZ,EAAOG,EAAKE,CAAI,CAAE,EAE7BZ,CACR,CAKAR,GAAO,QAAUO,KCvIjB,IAAAsB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqEA,SAASC,GAAUC,EAAKC,EAAOC,EAAMC,EAAKC,EAAW,CACpD,IAAIC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAKN,IAAQ,EACZ,OAAOH,EAOR,GAJAK,EAAML,EAAI,KACVM,EAAMN,EAAI,UAAW,CAAE,EAGlBG,IAAQ,EACZ,OAAKC,EACJE,EAAKD,EAAK,EAAGH,CAAK,EAElBI,EAAKD,EAAK,EAAGJ,CAAM,EAEbD,EAaR,IAXAM,EAAKD,EAAK,EAAGJ,CAAM,EAGdG,EACJG,EAAIJ,EAAM,EAEVI,EAAIJ,EAELK,GAAMN,EAAKD,GAAUM,EAGfE,EAAI,EAAGA,EAAIF,EAAGE,IACnBH,EAAKD,EAAKI,EAAGR,EAASO,EAAEC,CAAG,EAG5B,OAAKL,GACJE,EAAKD,EAAKE,EAAGL,CAAK,EAEZF,CACR,CAKAF,GAAO,QAAUC,KCpHjB,IAAAW,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAe,QAAS,8BAA+B,EACvDC,GAAS,QAAS,uBAAwB,EAC1CC,GAAQ,QAAS,iCAAkC,EACnDC,GAAQ,QAAS,uBAAwB,EACzCC,GAAS,IACTC,GAAgB,QAAS,4CAA6C,EACtEC,GAAiB,QAAS,6CAA8C,EACxEC,GAAmB,IACnBC,GAAW,KACXC,GAAU,KACVC,GAAa,KACbC,GAAY,KACZC,GAAW,KACXC,GAAW,KA4Bf,SAASC,GAAUC,EAAOC,EAAMC,EAAM,CACrC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAK,OAAOT,GAAU,SAAW,CAEhC,GADAK,EAAMjB,GAAOY,CAAM,EACdK,IAAQ,KAAO,CACnB,GAAK,CAACtB,GAAeiB,CAAM,EAC1B,MAAM,IAAI,UAAWd,GAAQ,yFAA0Fc,CAAM,CAAE,EAEhIK,EAAM,YACP,CACAE,EAAM,EACP,KAAO,IAAK,CAACvB,GAAUgB,CAAM,GAAKb,GAAOa,CAAM,EAC9C,MAAM,IAAI,UAAWd,GAAQ,yFAA0Fc,CAAM,CAAE,EAE/HK,EAAM,UAEP,GAAK,OAAOJ,GAAS,SAAW,CAE/B,GADAK,EAAMlB,GAAOa,CAAK,EACbK,IAAQ,KAAO,CACnB,GAAK,CAACvB,GAAekB,CAAK,EACzB,MAAM,IAAI,UAAWf,GAAQ,0FAA2Fe,CAAK,CAAE,EAEhIK,EAAM,YACP,CACAC,EAAM,EACP,KAAO,IAAK,CAACvB,GAAUiB,CAAK,GAAKd,GAAOc,CAAK,EAC5C,MAAM,IAAI,UAAWf,GAAQ,0FAA2Fe,CAAK,CAAE,EAE/HK,EAAM,UAEP,GAAK,CAACrB,GAAciB,CAAI,EACvB,MAAM,IAAI,UAAWhB,GAAQ,8EAA+EgB,CAAI,CAAE,EAKnH,GAHAC,EAAO,CACN,SAAYL,GAAS,QACtB,EACK,UAAU,OAAS,IACvBM,EAAMP,GAAUM,EAAM,UAAW,CAAE,CAAE,EAChCC,GACJ,MAAMA,EAOR,GAJAI,EAAMnB,GAAQa,CAAI,EACbM,IAAQ,OACZA,EAAM,WAEFA,IAAQ,YACZ,OAAAb,GAAYL,GAAeY,EAAK,CAAE,EAAGG,EAAKL,EAAOM,EAAKL,EAAMC,EAAI,OAAQC,EAAK,QAAS,EAC/ED,EAER,GAAKM,IAAQ,aACZ,OAAAb,GAAYJ,GAAgBW,EAAK,CAAE,EAAGG,EAAKL,EAAOM,EAAKL,EAAMC,EAAI,OAAQC,EAAK,QAAS,EAChFD,EAER,GAAKK,EAAM,CACV,GAAKC,IAAQ,UACZ,OAAAC,EAAIjB,GAAkBU,CAAI,EAC1BT,GAAUgB,EAAGJ,EAAKL,EAAOM,EAAKL,EAAMC,EAAI,OAAQC,EAAK,QAAS,EACvDD,EAER,MAAM,IAAI,UAAW,gKAAiK,CACvL,CAEA,OADAO,EAAIjB,GAAkBU,CAAI,EACrBO,EAAE,kBACNf,GAASe,EAAGT,EAAOC,EAAMC,EAAI,OAAQC,EAAK,QAAS,EAC5CD,IAERN,GAAWM,EAAKF,EAAOC,EAAMC,EAAI,OAAQC,EAAK,QAAS,EAChDD,EACR,CAKApB,GAAO,QAAUiB,KClJjB,IAAAW,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkEA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAS,KAKbF,GAAaC,GAAM,SAAUC,EAAO,EAKpCH,GAAO,QAAUE,KC9EjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAS,QAAS,uBAAwB,EAC1CC,GAAQ,QAAS,iCAAkC,EACnDC,GAAM,KAoBV,SAASC,GAAUC,EAAGC,EAAGC,EAAM,CAC9B,GAAK,CAACR,GAAUM,CAAE,GAAKH,GAAOG,CAAE,EAC/B,MAAM,IAAI,UAAWJ,GAAQ,0EAA2EI,CAAE,CAAE,EAE7G,GAAK,CAACN,GAAUO,CAAE,GAAKJ,GAAOI,CAAE,EAC/B,MAAM,IAAI,UAAWL,GAAQ,yEAA0EK,CAAE,CAAE,EAE5G,GAAK,UAAU,OAAS,EACvBC,EAAM,WACK,CAACP,GAAsBO,CAAI,EACtC,MAAM,IAAI,UAAWN,GAAQ,uEAAwEM,CAAI,CAAE,EAE5G,OAAOJ,GAAKE,EAAGC,EAAGC,CAAI,CACvB,CAKAT,GAAO,QAAUM,KChEjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAY,QAAS,qCAAsC,EAC3DC,GAAiB,QAAS,2CAA4C,EACtEC,GAAgB,QAAS,gCAAiC,EAC1DC,GAAO,QAAS,gCAAiC,EACjDC,GAAO,QAAS,gCAAiC,EACjDC,GAA6B,QAAS,8CAA+C,EACrFC,GAA2B,QAAS,4CAA6C,EACjFC,GAA2B,QAAS,4CAA6C,EACjFC,GAAW,QAAS,4BAA6B,EACjDC,GAAY,QAAS,6BAA8B,EACnDC,GAAY,QAAS,6BAA8B,EACnDC,GAAY,QAAS,6BAA8B,EACnDC,GAAa,QAAS,8BAA+B,EACrDC,GAAa,QAAS,8BAA+B,EAYzD,SAASC,GAAkBC,EAAQ,CAClC,OAAKA,IAAUA,GAASA,IAAUZ,IAAQY,IAAUX,GAC5C,UAEHJ,GAAWe,CAAM,EAChBA,GAASR,IAA4BQ,GAAST,GAC3C,UAED,UAIPS,EAAQ,CAACV,IACTU,EAAQV,GAED,UAGD,SACR,CAmBA,SAASW,GAAaD,EAAQ,CAC7B,OAAK,OAAOA,GAAU,SAChBb,GAAea,CAAM,EACpBD,GAAkBC,EAAM,EAAG,IAAM,WAAaD,GAAkBC,EAAM,EAAG,IAAM,UAC5E,aAED,YAED,UAEHA,IAAUA,GAASA,IAAUZ,IAAQY,IAAUX,GAC5C,UAEHJ,GAAWe,CAAM,EAChBA,IAAU,GAAKd,GAAgBc,CAAM,EAClC,UAEHA,EAAQ,EACPA,GAASP,GACN,OAEHO,GAASN,GACN,QAEHM,GAASL,GACN,QAED,UAEHK,GAASJ,GACN,QAEHI,GAASH,GACN,SAEHG,GAASF,GACN,SAED,UAIPE,EAAQ,CAACV,IACTU,EAAQV,GAED,UAGD,SACR,CAKAN,GAAO,QAAUiB,KC3IjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAc,KAKlBD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,KAA0C,QACrDC,GAAa,QAAS,yBAA0B,EAChDC,GAAY,QAAS,yBAA0B,EAC/CC,GAAO,KACPC,GAAW,KACXC,GAAS,KACTC,GAAS,QAAS,uBAAwB,EAK1CC,GAAO,IAAIN,GAAY,IAAK,GAAI,EAChCO,GAAM,IAAIN,GAAW,IAAK,GAAI,EAC9BO,GAASJ,GAAQ,4BAA6B,EAC9CK,GAAeV,GAAUS,EAAO,EAChCE,GAAgBP,GAAS,IAAK,4BAA6B,EAsB/D,SAASQ,GAAMC,EAAS,CACvB,IAAIC,EACAC,EAEJ,GAAK,UAAU,OAAS,GAEvB,GADAD,EAAQ,UAAW,CAAE,EAChB,CAACJ,GAAcI,CAAM,EACzB,MAAM,IAAI,UAAWR,GAAQ,qFAAsFG,GAAO,KAAM,MAAO,EAAGK,CAAM,CAAE,OAGnJA,EAAQH,GAET,OAAKG,IAAU,aACdC,EAAQR,GACGO,IAAU,YACrBC,EAAQP,GAERO,EAAQ,IAEFZ,GAAMU,EAAQE,EAAOD,CAAM,CACnC,CAKAf,GAAO,QAAUa,KCpFjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,IACRC,GAAO,KACPC,GAAa,QAAS,yBAA0B,EAChDC,GAAY,QAAS,yBAA0B,EAC/CC,GAAS,QAAS,uBAAwB,EAK1CC,GAAO,IAAIH,GAAY,IAAK,GAAI,EAChCI,GAAM,IAAIH,GAAW,IAAK,GAAI,EAC9BI,GAAS,CAAE,UAAW,UAAW,aAAc,YAAa,SAAU,EAsB1E,SAASC,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,GADAD,EAAKV,GAAOS,CAAE,EACTC,IAAO,KACX,MAAM,IAAI,UAAWN,GAAQ,8GAA+GK,CAAE,CAAE,EAEjJ,GAAK,UAAU,OAAS,GAEvB,GADAC,EAAK,UAAW,CAAE,EACbH,GAAO,QAASG,CAAG,IAAM,GAC7B,MAAM,IAAI,UAAWN,GAAQ,qFAAsFG,GAAO,KAAM,MAAO,EAAGG,CAAG,CAAE,UAErIH,GAAO,QAASG,CAAG,IAAM,GACpC,MAAM,IAAI,UAAWN,GAAQ,+FAAgGG,GAAO,KAAM,MAAO,EAAGG,CAAG,CAAE,EAE1J,OAAKA,IAAO,aACXC,EAAIN,GACOK,IAAO,YAClBC,EAAIL,GAEJK,EAAI,IAEEV,GAAMQ,EAAE,OAAQE,EAAGD,CAAG,CAC9B,CAKAX,GAAO,QAAUS,KCpFjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,QAAW,GACX,QAAW,UACX,MAAS,GACT,MAAS,QACT,KAAQ,QACR,OAAU,GACV,OAAU,SACV,MAAS,SACT,OAAU,SACV,QAAW,GACV,UAAa,aACb,WAAc,EAChB,ICbA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,oBAAqB,EAC3CC,GAAa,QAAS,iCAAkC,EACxDC,GAAc,KAWlB,SAASC,IAAgB,CACxB,IAAIC,EACAC,EACAC,EACA,EAKJ,IAHAA,EAAM,CAAC,EACPF,EAASJ,GAAYE,EAAY,EACjCG,EAASD,EAAO,OACV,EAAI,EAAG,EAAIC,EAAQ,IACxBC,EAAKF,EAAO,CAAC,CAAE,EAAIF,GAAaE,EAAO,CAAC,CAAE,EAE3C,OAAOE,CACR,CAeA,SAASC,GAAcC,EAAQ,CAC9B,OAAK,UAAU,SAAW,EAClBL,GAAc,EAEjBF,GAAYC,GAAaM,CAAM,EAC5BN,GAAaM,CAAM,EAEpB,IACR,CAKAT,GAAO,QAAUQ,KC5EjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAO,KACPC,GAAQ,KACRC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAgBF,GAAS,IAAK,gBAAiB,EAsBnD,SAASG,GAAOC,EAAI,CACnB,IAAIC,EACJ,GAAK,CAACR,GAAsBO,CAAE,EAC7B,MAAM,IAAI,UAAWH,GAAQ,+EAAgFG,CAAE,CAAE,EAElH,GAAK,UAAU,OAAS,GAEvB,GADAC,EAAQ,UAAW,CAAE,EAChBA,IAAU,UACd,OAAOP,GAAMM,CAAE,OAGhBC,EAAQH,GAET,OAAOJ,GAAK,OAAQC,GAAOK,EAAGC,CAAM,EAAG,EAAG,CAAE,CAC7C,CAKAT,GAAO,QAAUO,KCxEjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KACRC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EAsB9C,SAASC,GAAWC,EAAI,CACvB,IAAIC,EAAKJ,GAAOG,CAAE,EAClB,GAAKC,IAAO,KACX,MAAM,IAAI,UAAWH,GAAQ,8GAA+GE,CAAE,CAAE,EAEjJ,OAAK,UAAU,OAAS,IACvBC,EAAK,UAAW,CAAE,GAEZL,GAAOI,EAAE,OAAQC,CAAG,CAC5B,CAKAN,GAAO,QAAUI,KC5DjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,yBAA0B,EAChDC,GAAY,QAAS,yBAA0B,EAC/CC,GAAO,KACPC,GAAW,KAKXC,GAAO,IAAIJ,GAAY,EAAK,CAAI,EAChCK,GAAM,IAAIJ,GAAW,EAAK,CAAI,EAC9BK,GAAgBH,GAAS,IAAK,gBAAiB,EAsBnD,SAASI,GAAMC,EAAS,CACvB,IAAIC,EACAC,EAEJ,OAAK,UAAU,OAAS,EACvBD,EAAQ,UAAW,CAAE,EAErBA,EAAQH,GAEJG,IAAU,aACdC,EAAQN,GACGK,IAAU,YACrBC,EAAQL,GAERK,EAAQ,EAEFR,GAAMM,EAAQE,EAAOD,CAAM,CACnC,CAKAV,GAAO,QAAUQ,KC5EjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,IACRC,GAAO,KACPC,GAAa,QAAS,yBAA0B,EAChDC,GAAY,QAAS,yBAA0B,EAC/CC,GAAS,QAAS,uBAAwB,EAK1CC,GAAO,IAAIH,GAAY,EAAK,CAAI,EAChCI,GAAM,IAAIH,GAAW,EAAK,CAAI,EAsBlC,SAASI,GAAUC,EAAI,CACtB,IAAIC,EACAC,EAGJ,GADAD,EAAKT,GAAOQ,CAAE,EACTC,IAAO,KACX,MAAM,IAAI,UAAWL,GAAQ,8GAA+GI,CAAE,CAAE,EAEjJ,OAAK,UAAU,OAAS,IACvBC,EAAK,UAAW,CAAE,GAEdA,IAAO,aACXC,EAAIL,GACOI,IAAO,YAClBC,EAAIJ,GAEJI,EAAI,EAEET,GAAMO,EAAE,OAAQE,EAAGD,CAAG,CAC9B,CAKAV,GAAO,QAAUQ,KC9EjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAgCA,SAASC,IAAW,CACnB,MAAO,CACN,cAAiB,gBAClB,CACD,CAKAD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,gCAAiC,EACrDC,GAAa,QAAS,iCAAkC,EACxDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAS,QAAS,uBAAwB,EAwB9C,SAASC,GAAUC,EAAMC,EAAU,CAClC,OAAMN,GAAUM,CAAQ,EAGnBL,GAAYK,EAAS,eAAgB,IACzCD,EAAK,cAAgBC,EAAQ,cACxB,CAACJ,GAAsBG,EAAK,aAAc,GACvC,IAAI,UAAWF,GAAQ,2EAA4E,gBAAiBE,EAAK,aAAc,CAAE,EAG3I,KARC,IAAI,UAAWF,GAAQ,qEAAsEG,CAAQ,CAAE,CAShH,CAKAP,GAAO,QAAUK,KCjEjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,GAAMC,EAAI,CAClB,IAAIC,EACAC,EAGJ,IADAD,EAAM,CAAC,EACDC,EAAI,EAAGA,EAAIF,EAAE,EAAGE,IACrBD,EAAI,KAAM,CAAC,CAAE,EAEd,OAAOA,CACR,CAKAH,GAAO,QAAUC,KC3CjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACT,UAAa,EACb,WAAc,EAChB,ICZA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAe,QAAS,8BAA+B,EACvDC,GAAmB,QAAS,oCAAqC,EACjEC,GAAgB,QAAS,+BAAgC,EACzDC,GAAmB,QAAS,kCAAmC,EAC/DC,GAAoB,QAAS,mCAAoC,EACjEC,GAAc,QAAS,uDAAwD,EAC/EC,GAAsB,QAAS,uDAAwD,EACvFC,GAAQ,KACRC,GAAgB,QAAS,4CAA6C,EACtEC,GAAiB,QAAS,6CAA8C,EACxEC,GAAY,KACZC,GAAS,IACTC,GAAiB,KACjBC,GAAS,QAAS,uBAAwB,EAC1CC,GAAc,KACdC,GAAO,QAAS,gCAAiC,EACjDC,GAAQ,QAAS,iCAAkC,EACnDC,GAAQ,QAAS,iCAAkC,EACnDC,GAAO,QAAS,gCAAiC,EACjDC,GAAM,QAAS,+BAAgC,EAC/CC,GAAW,KACXC,GAAW,KACXC,GAAa,KACbC,GAAoB,KAKpBC,GAAgBZ,GAAe,IAAK,gBAAiB,EACrDa,GAAiBlB,GAAO,WAAY,EACpCmB,GAAkBnB,GAAO,YAAa,EAY1C,SAASoB,GAAgBC,EAAM,CAC9B,OAASA,aAAeH,EACzB,CASA,SAASI,GAAiBD,EAAM,CAC/B,OAASA,aAAeF,EACzB,CA6BA,SAASI,GAASC,EAAU,CAC3B,IAAIC,EACAC,EACAC,EACAC,EAGJ,GADAD,EAAOd,GAAS,EACX,UAAU,SACde,EAAMd,GAAUa,EAAMH,CAAQ,EACzBI,GACJ,MAAMA,EAGR,OAAAF,EAAOX,GAAYP,GAAMG,GAAMgB,EAAK,aAAc,CAAE,CAAE,EACtDF,EAAS,EAET3B,GAAa+B,EAAQ,SAAUA,CAAO,EACtC/B,GAAa+B,EAAQ,SAAUC,CAAO,EACtChC,GAAa+B,EAAQ,OAAQE,CAAK,EAClCjC,GAAa+B,EAAQ,QAASG,CAAM,EACpClC,GAAa+B,EAAQ,gBAAiBF,EAAK,aAAc,EACzD5B,GAAqB8B,EAAQ,SAAUI,CAAS,EAEzCJ,EAQP,SAASI,GAAW,CACnB,OAAOR,CACR,CASA,SAASS,EAAaC,EAAI,CACzB,IAAIC,EACAC,EAMJ,OAHAA,EAAI1B,GAAMwB,CAAE,EAGPE,EAAIX,EAAK,QAAUA,EAAMW,CAAE,EAAE,OAC1BX,EAAMW,CAAE,EAAE,IAAI,EAGjBZ,EAAOU,EAAIR,EAAK,cACb,MAERS,EAAM,IAAI7B,GAAa4B,CAAE,EAGzBV,GAAUU,EAEHC,EACR,CAWA,SAASE,EAAYC,EAAMC,EAAKC,EAAQ,CACvC,IAAIL,EACJ,OAAKI,IAAQ,EACL,IAAID,EAAM,CAAE,GAEpBH,EAAMF,EAAaxB,GAAO8B,CAAI,EAAExB,GAAmByB,CAAM,CAAE,EACtDL,IAAQ,KACLA,EAED,IAAIG,EAAMH,EAAK,EAAGI,CAAI,EAC9B,CAkBA,SAASX,GAAS,CACjB,IAAIa,EACAD,EACAF,EACAlB,EACAsB,EACAC,EACAC,EACAL,EACAH,EAUJ,GARAK,EAAQ,UAAU,OACbA,GAASnD,GAAU,UAAWmD,EAAM,CAAE,CAAE,GAC5CA,GAAS,EACTD,EAAQ,UAAWC,CAAM,GAEzBD,EAAQxB,GAETsB,EAAOvC,GAAOyC,CAAM,EACfF,IAAS,KACb,MAAM,IAAI,UAAWjC,GAAQ,sEAAuEmC,CAAM,CAAE,EAE7G,GAAKC,GAAS,EACb,OAAO,IAAIH,EAAM,CAAE,EAGpB,GAAK/C,GAAsB,UAAW,CAAE,CAAE,EACzC,OAAO8C,EAAYC,EAAM,UAAW,CAAE,EAAGE,CAAM,EAGhD,GAAKhD,GAAc,UAAW,CAAE,CAAE,EAAI,CAYrC,GAXA4B,EAAM,UAAW,CAAE,EACnBmB,EAAMnB,EAAI,OACLxB,GAAmBwB,CAAI,EAC3BA,EAAMnB,GAAgBmB,EAAK,CAAE,EAClBzB,GAAkByB,CAAI,EACjCA,EAAMpB,GAAeoB,EAAK,CAAE,EACjB,WAAW,KAAMoB,CAAM,IAElCD,GAAO,GAERG,EAAML,EAAYC,EAAMC,EAAKC,CAAM,EAC9BE,IAAQ,KACZ,OAAOA,EAER,GAAKrB,GAAiBqB,CAAI,GAAKvB,GAAgBuB,CAAI,EAClD,OAAAA,EAAI,IAAKtB,CAAI,EACNsB,EAKR,IAFAE,EAAM1C,GAAWC,GAAQiB,CAAI,CAAE,EAAE,UAAW,CAAE,EAC9CuB,EAAMzC,GAAWsC,CAAM,EAAE,UAAW,CAAE,EAChCJ,EAAI,EAAGA,EAAIG,EAAKH,IACrBO,EAAKD,EAAKN,EAAGQ,EAAKxB,EAAKgB,CAAE,CAAE,EAE5B,OAAOM,CACR,CACA,MAAM,IAAI,UAAWrC,GAAQ,wGAAyG,UAAW,CAAE,CAAE,CAAE,CACxJ,CAgBA,SAASwB,GAAS,CACjB,IAAIY,EACAC,EACAG,EACAT,EAUJ,GARAK,EAAQ,UAAU,OACbA,IAAU,EACdC,EAAMd,EAAO,EACFa,IAAU,EACrBC,EAAMd,EAAQ,UAAW,CAAE,CAAE,EAE7Bc,EAAMd,EAAQ,UAAW,CAAE,EAAG,UAAW,CAAE,CAAE,EAEzCc,IAAQ,KASZ,IAPKrB,GAAiBqB,CAAI,EACzBG,EAAM5C,GAAgByC,EAAK,CAAE,EAClBvB,GAAgBuB,CAAI,EAC/BG,EAAM7C,GAAe0C,EAAK,CAAE,EAE5BG,EAAMH,EAEDN,EAAI,EAAGA,EAAIS,EAAI,OAAQT,IAC5BS,EAAKT,CAAE,EAAI,EAGb,OAAOM,CACR,CAcA,SAASZ,EAAMK,EAAM,CACpB,IAAID,EACAY,EACAV,EACJ,GAAK3C,GAAkB0C,CAAI,GAAKA,EAAI,OACnCA,EAAMA,EAAI,eACC,CAACzC,GAAeyC,CAAI,EAC/B,MAAM,IAAI,UAAW9B,GAAQ,4EAA6E8B,CAAI,CAAE,EAEjH,GAAKA,EAAI,WAAa,EAAI,CAQzB,IAPAD,EAAI1B,GAAOE,GAAMyB,EAAI,UAAW,CAAE,EAGlCD,EAAIvB,GAAKc,EAAK,OAAO,EAAGS,CAAE,EAG1BY,EAAIrB,EAAMS,CAAE,EACNE,EAAI,EAAGA,EAAIU,EAAE,OAAQV,IAC1B,GAAKU,EAAGV,CAAE,IAAMD,EACf,MAAO,GAITW,EAAE,KAAMX,CAAI,CACb,CACA,MAAO,EACR,CAOA,SAASJ,GAAQ,CAChB,IAAIK,EACJ,IAAMA,EAAI,EAAGA,EAAIX,EAAK,OAAQW,IAC7BX,EAAMW,CAAE,EAAE,OAAS,EAEpBZ,EAAS,CACV,CACD,CAKAnC,GAAO,QAAUiC,KCnXjB,IAAAyB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,KAmCVC,GAAiBD,GAAQ,EAK7BD,GAAO,QAAUE,KC9DjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA2CA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAU,KAKdF,GAAaC,GAAM,UAAWC,EAAQ,EAKtCH,GAAO,QAAUE,KCvDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,QAAW,CACV,QAAW,UACX,QAAW,UACX,MAAS,UACT,MAAS,UACT,KAAQ,UACR,OAAU,UACV,OAAU,UACV,MAAS,UACT,OAAU,UACR,UAAa,aACb,WAAc,aAChB,QAAW,SACZ,EACA,QAAW,CACV,QAAW,UACX,QAAW,UACX,MAAS,UACT,MAAS,UACT,KAAQ,UACR,OAAU,UACV,OAAU,UACV,MAAS,UACT,OAAU,UACR,UAAa,YACb,WAAc,aAChB,QAAW,SACZ,EACA,MAAS,CACR,QAAW,UACX,QAAW,UACX,MAAS,QACT,MAAS,QACT,KAAQ,QACR,OAAU,UACV,OAAU,QACV,MAAS,QACT,OAAU,QACR,UAAa,aACb,WAAc,aAChB,QAAW,SACZ,EACA,MAAS,CACR,QAAW,UACX,QAAW,UACX,MAAS,QACT,MAAS,QACT,KAAQ,QACR,OAAU,UACV,OAAU,QACV,MAAS,QACT,OAAU,QACR,UAAa,YACb,WAAc,aAChB,QAAW,SACZ,EACA,KAAQ,CACP,QAAW,UACX,QAAW,UACX,MAAS,QACT,MAAS,QACT,KAAQ,OACR,OAAU,UACV,OAAU,QACV,MAAS,QACT,OAAU,QACR,UAAa,YACb,WAAc,aAChB,QAAW,SACZ,EACA,OAAU,CACT,QAAW,UACX,QAAW,UACX,MAAS,UACT,MAAS,UACT,KAAQ,UACR,OAAU,SACV,OAAU,SACV,MAAS,SACT,OAAU,SACR,UAAa,aACb,WAAc,aAChB,QAAW,SACZ,EACA,OAAU,CACT,QAAW,UACX,QAAW,UACX,MAAS,QACT,MAAS,QACT,KAAQ,QACR,OAAU,SACV,OAAU,SACV,MAAS,SACT,OAAU,SACR,UAAa,YACb,WAAc,aAChB,QAAW,SACZ,EACA,MAAS,CACR,QAAW,UACX,QAAW,UACX,MAAS,QACT,MAAS,QACT,KAAQ,QACR,OAAU,SACV,OAAU,SACV,MAAS,QACT,OAAU,QACR,UAAa,YACb,WAAc,aAChB,QAAW,SACZ,EACA,OAAU,CACT,QAAW,UACX,QAAW,UACX,MAAS,QACT,MAAS,QACT,KAAQ,QACR,OAAU,SACV,OAAU,SACV,MAAS,QACT,OAAU,QACR,UAAa,YACb,WAAc,aAChB,QAAW,SACZ,EACC,WAAc,CACZ,QAAW,aACX,QAAW,aACX,MAAS,aACT,MAAS,aACT,KAAQ,aACR,OAAU,aACV,OAAU,aACV,MAAS,aACT,OAAU,aACV,UAAa,aACb,WAAc,aACd,QAAW,SACb,EACA,UAAa,CACX,QAAW,aACX,QAAW,YACX,MAAS,aACT,MAAS,YACT,KAAQ,YACR,OAAU,aACV,OAAU,YACV,MAAS,YACT,OAAU,YACV,UAAa,YACb,WAAc,aACd,QAAW,SACb,EACD,QAAW,CACV,QAAW,UACX,QAAW,UACX,MAAS,UACT,MAAS,UACT,KAAQ,UACR,OAAU,UACV,OAAU,UACV,MAAS,UACT,OAAU,UACR,UAAa,UACb,WAAc,UAChB,QAAW,SACZ,CACD,ICzKA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,oBAAqB,EAC3CC,GAAa,QAAS,iCAAkC,EACxDC,GAAkB,KAWtB,SAASC,IAAoB,CAC5B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,IAHAN,EAAM,CAAC,EACPF,EAASJ,GAAYE,EAAgB,EACrCG,EAASD,EAAO,OACVQ,EAAI,EAAGA,EAAIP,EAAQO,IAAM,CAI9B,IAHAJ,EAAMJ,EAAQQ,CAAE,EAChBF,EAAIR,GAAiBM,CAAI,EACzBD,EAAM,CAAC,EACDI,EAAI,EAAGA,EAAIN,EAAQM,IACxBF,EAAML,EAAQO,CAAE,EAChBJ,EAAKE,CAAI,EAAIC,EAAGD,CAAI,EAErBH,EAAKE,CAAI,EAAID,CACd,CACA,OAAOD,CACR,CAwBA,SAASO,GAAgBC,EAAQC,EAAS,CACzC,IAAIL,EACJ,OAAK,UAAU,SAAW,EAClBP,GAAkB,EAErBF,GAAYC,GAAiBY,CAAO,IACxCJ,EAAIR,GAAiBY,CAAO,EACvBb,GAAYS,EAAGK,CAAO,GACnBL,EAAGK,CAAO,EAGZ,IACR,CAKAhB,GAAO,QAAUc,KCrGjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,KACfC,GAAe,KACfC,GAAa,KACbC,GAAa,KACbC,GAAY,KACZC,GAAc,KACdC,GAAc,KACdC,GAAa,KACbC,GAAoB,KACpBC,GAAiB,KACjBC,GAAkB,KAKlBC,GAAQ,CACX,aAAgBX,GAChB,aAAgBC,GAChB,WAAcE,GACd,YAAeG,GACf,WAAcJ,GACd,YAAeG,GACf,UAAaD,GACb,WAAcG,GACd,kBAAqBC,GACrB,eAAkBC,GAClB,gBAAmBC,EACpB,EAKAX,GAAO,QAAUY,KCtDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,yBAA0B,EAC7CC,GAAQ,KAoBZ,SAASC,GAAkBC,EAAKC,EAAQ,CACvC,IAAIC,EACJ,OACCD,GACAA,EAAM,MACNJ,GAASI,EAAM,IAAK,IAEpBC,EAAOJ,GAAOG,EAAM,IAAK,EACpBC,GACG,IAAIA,EAAMD,EAAM,IAAK,EAGvBA,CACR,CAKAL,GAAO,QAAUG,KC7DjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,QAAW,CACV,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,QAAW,CACV,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,MAAS,CACR,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,MAAS,CACR,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,KAAQ,CACP,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,OAAU,CACT,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,OAAU,CACT,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,MAAS,CACR,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,OAAU,CACT,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACC,WAAc,CACZ,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACV,WAAc,EACd,UAAa,EACb,QAAW,CACb,EACA,UAAa,CACX,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACV,WAAc,EACd,UAAa,EACb,QAAW,CACb,EACD,QAAW,CACV,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,CACD,ICzKA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,oBAAqB,EAC3CC,GAAa,QAAS,iCAAkC,EACxDC,GAAa,KAKbC,GAWJ,SAASC,IAAoB,CAC5B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,IAHAN,EAAM,CAAC,EACPF,EAASL,GAAYE,EAAW,EAChCI,EAASD,EAAO,OACVQ,EAAI,EAAGA,EAAIP,EAAQO,IAAM,CAI9B,IAHAJ,EAAMJ,EAAQQ,CAAE,EAChBF,EAAIT,GAAYO,CAAI,EACpBD,EAAM,CAAC,EACDI,EAAI,EAAGA,EAAIN,EAAQM,IACxBF,EAAML,EAAQO,CAAE,EAChBJ,EAAKE,CAAI,EAAIC,EAAGD,CAAI,EAErBH,EAAKE,CAAI,EAAID,CACd,CACA,OAAOD,CACR,CAQA,SAASO,IAAgB,CACxB,IAAIT,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,IAHAN,EAAM,CAAC,EACPF,EAASL,GAAYE,EAAW,EAChCI,EAASD,EAAO,OACVQ,EAAI,EAAGA,EAAIP,EAAQO,IAAM,CAI9B,IAHAJ,EAAMJ,EAAQQ,CAAE,EAChBF,EAAIT,GAAYO,CAAI,EACpBD,EAAM,CAAC,EACDI,EAAI,EAAGA,EAAIN,EAAQM,IACxBF,EAAML,EAAQO,CAAE,EACXD,EAAGD,CAAI,IAAM,GACjBF,EAAI,KAAME,CAAI,EAGhBH,EAAKE,CAAI,EAAID,CACd,CACA,OAAOD,CACR,CAeA,SAASQ,GAAWC,EAAQ,CAC3B,OAAK,UAAU,SAAW,EAClBZ,GAAkB,GAErBD,KAAU,SAEdA,GAAQW,GAAc,GAElBb,GAAYE,GAAOa,CAAM,EACtBb,GAAOa,CAAM,EAAE,MAAM,EAEtB,KACR,CAKAjB,GAAO,QAAUgB,KCpIjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,QAAW,CACV,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,QAAW,CACV,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,MAAS,CACR,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,MAAS,CACR,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,KAAQ,CACP,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,OAAU,CACT,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,OAAU,CACT,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,MAAS,CACR,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACA,OAAU,CACT,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,EACC,WAAc,CACZ,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACV,WAAc,EACd,UAAa,EACb,QAAW,CACb,EACA,UAAa,CACX,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACV,WAAc,EACd,UAAa,EACb,QAAW,CACb,EACD,QAAW,CACV,QAAW,EACX,QAAW,EACX,MAAS,EACT,MAAS,EACT,KAAQ,EACR,OAAU,EACV,OAAU,EACV,MAAS,EACT,OAAU,EACR,WAAc,EACd,UAAa,EACf,QAAW,CACZ,CACD,ICzKA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,oBAAqB,EAC3CC,GAAa,QAAS,iCAAkC,EACxDC,GAAkB,KAKlBC,GAWJ,SAASC,IAAoB,CAC5B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,IAHAN,EAAM,CAAC,EACPF,EAASL,GAAYE,EAAgB,EACrCI,EAASD,EAAO,OACVQ,EAAI,EAAGA,EAAIP,EAAQO,IAAM,CAI9B,IAHAJ,EAAMJ,EAAQQ,CAAE,EAChBF,EAAIT,GAAiBO,CAAI,EACzBD,EAAM,CAAC,EACDI,EAAI,EAAGA,EAAIN,EAAQM,IACxBF,EAAML,EAAQO,CAAE,EAChBJ,EAAKE,CAAI,EAAIC,EAAGD,CAAI,EAErBH,EAAKE,CAAI,EAAID,CACd,CACA,OAAOD,CACR,CAQA,SAASO,IAAgB,CACxB,IAAIT,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAKJ,IAHAN,EAAM,CAAC,EACPF,EAASL,GAAYE,EAAgB,EACrCI,EAASD,EAAO,OACVQ,EAAI,EAAGA,EAAIP,EAAQO,IAAM,CAI9B,IAHAJ,EAAMJ,EAAQQ,CAAE,EAChBF,EAAIT,GAAiBO,CAAI,EACzBD,EAAM,CAAC,EACDI,EAAI,EAAGA,EAAIN,EAAQM,IACxBF,EAAML,EAAQO,CAAE,EACXD,EAAGD,CAAI,IAAM,GACjBF,EAAI,KAAME,CAAI,EAGhBH,EAAKE,CAAI,EAAID,CACd,CACA,OAAOD,CACR,CAeA,SAASQ,GAAeC,EAAQ,CAC/B,OAAK,UAAU,SAAW,EAClBZ,GAAkB,GAErBD,KAAU,SAEdA,GAAQW,GAAc,GAElBb,GAAYE,GAAOa,CAAM,EACtBb,GAAOa,CAAM,EAAE,MAAM,EAEtB,KACR,CAKAjB,GAAO,QAAUgB,KCpIjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAoB,QAAS,qCAAsC,EACnEC,GAAS,QAAS,uBAAwB,EAa9C,SAASC,GAASC,EAAOC,EAAM,CAC9B,IAAIC,EAAID,EAAK,CAAE,EACf,OAAKJ,GAAmBK,CAAE,IACzBF,EAAM,KAAME,EAAE,MAAO,EACrBH,GAASC,EAAOE,CAAE,GAEZF,CACR,CAaA,SAASG,GAAOC,EAAOJ,EAAOK,EAAGJ,EAAKK,EAAM,CAC3C,IAAIC,EACAL,EACAM,EAMJ,IAHAD,EAAMP,EAAOK,CAAE,EAGTG,EAAI,EAAGA,EAAIP,EAAI,OAAQO,IAAM,CAIlC,GAHAN,EAAID,EAAKO,CAAE,EAGN,CAACX,GAAmBK,CAAE,GAAKA,EAAE,SAAWK,EAE5C,OAAOF,EAGR,GAAKC,IACJJ,EAAIC,GAAOC,EAAOJ,EAAOK,EAAE,EAAGH,EAAGG,EAAE,EAAID,EAAM,CAAE,EAC1CF,EAAIE,GAER,OAAOF,CAGV,CACA,OAAOE,CACR,CA8BA,SAASK,GAAYR,EAAM,CAC1B,IAAID,EACAI,EAEJ,GAAK,CAACP,GAAmBI,CAAI,EAC5B,MAAM,IAAI,UAAWH,GAAQ,oEAAqEG,CAAI,CAAE,EAGzG,OAAAD,EAAQ,CAAEC,EAAI,MAAO,EAGrBF,GAASC,EAAOC,CAAI,EACpBG,EAAQJ,EAAM,OAGTI,EAAQ,IAEZJ,EAAM,OAASG,GAAOC,EAAOJ,EAAO,EAAGC,EAAKG,EAAQ,CAAE,GAEhDJ,CACR,CAKAJ,GAAO,QAAUa,KC1IjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,OAAO,mBAAsB,WAAe,kBAAoB,KAK7ED,GAAO,QAAUC,KC3BjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4BA,SAASC,GAAUC,EAAO,CACzB,MAAM,IAAI,MAAO,qPAAsP,CACxQ,CAKAF,GAAO,QAAUC,KCnCjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAA8B,QAAS,8CAA+C,EACtFC,GAAU,KACVC,GAAW,KAKXC,GACCH,GAA4B,EAChCG,GAAOF,GAEPE,GAAOD,GAMRH,GAAO,QAAUI,KCxDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,QAAS,8BAA+B,EACvDC,GAAY,QAAS,2BAA4B,EAAE,YACnDC,GAAO,KACPC,GAAS,QAAS,uBAAwB,EAoC9C,SAASC,GAAOC,EAAI,CACnB,IAAIC,EACAC,EAEJ,GAAK,CAACP,GAAcK,CAAE,EACrB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAE,CAAE,EAEjH,GAAK,UAAU,OAAS,EAAI,CAE3B,GADAC,EAAQ,UAAW,CAAE,EAChB,CAACL,GAAWK,CAAM,EACtB,MAAM,IAAI,UAAWH,GAAQ,qEAAsEG,CAAM,CAAE,EAE5G,GAAK,UAAU,OAAS,GAEvB,GADAC,EAAM,UAAW,CAAE,EACd,CAACN,GAAWM,CAAI,EACpB,MAAM,IAAI,UAAWJ,GAAQ,oEAAqEI,CAAI,CAAE,OAGzGA,EAAMF,EAAE,MAEV,MACCC,EAAQ,EACRC,EAAMF,EAAE,OAET,OAAOH,GAAMG,EAAGC,EAAOC,CAAI,CAC5B,CAKAR,GAAO,QAAUK,KC3FjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAuCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC5CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAa,QAAS,iCAAkC,EACxDC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAW,QAAS,gCAAiC,EACrDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAkB,KAClBC,GAAiB,QAAS,yBAA0B,EACpDC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EAkC9C,SAASC,GAAoBC,EAAM,CAClC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,CAACpB,GAAcU,CAAI,EACvB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAI,CAAE,EAMnH,GAJAI,EAAO,CACN,KAAQ,MACR,IAAO,CACR,EACK,UAAU,OAAS,EACvB,GAAKb,GAAU,UAAW,CAAE,CAAE,EAAI,CAEjC,GADAW,EAAU,UAAW,CAAE,EAClB,UAAU,OAAS,EAAI,CAE3B,GADAK,EAAM,UAAW,CAAE,EACd,CAAClB,GAAYkB,CAAI,EACrB,MAAM,IAAI,UAAWT,GAAQ,uEAAwES,CAAI,CAAE,EAE5GN,EAAU,UAAW,CAAE,CACxB,CACA,GAAKb,GAAYc,EAAS,MAAO,IAChCE,EAAK,KAAOF,EAAQ,KACf,CAACV,GAAsBU,EAAQ,IAAK,GACxC,MAAM,IAAI,UAAWJ,GAAQ,2EAA4E,OAAQI,EAAQ,IAAK,CAAE,EAGlI,GAAKd,GAAYc,EAAS,KAAM,IAC/BE,EAAK,IAAMF,EAAQ,IACdA,EAAQ,MAAQ,GAAKA,EAAQ,MAAQ,IACzC,MAAM,IAAI,UAAWJ,GAAQ,wEAAyE,MAAOI,EAAQ,GAAI,CAAE,CAG9H,KAAO,CAEN,GADAK,EAAM,UAAW,CAAE,EACd,CAAClB,GAAYkB,CAAI,EACrB,MAAM,IAAI,UAAWT,GAAQ,iGAAkGS,CAAI,CAAE,EAEtIN,EAAU,UAAW,CAAE,CACxB,CAED,OAAAE,EAAQ,EAGRE,EAAO,CAAC,EACHE,EACCH,EAAK,MAAQ,GACjBM,EAAI,GACJvB,GAAakB,EAAM,OAAQM,CAAO,IAElCD,EAAIV,EAAI,OACRb,GAAakB,EAAM,OAAQO,CAAO,GAExBR,EAAK,MAAQ,GACxBM,EAAI,GACJvB,GAAakB,EAAM,OAAQQ,CAAO,IAElCH,EAAIV,EAAI,OACRb,GAAakB,EAAM,OAAQS,CAAO,GAEnC3B,GAAakB,EAAM,SAAUU,CAAI,EAG5BrB,IACJP,GAAakB,EAAMX,GAAgBsB,CAAQ,EAG5CP,EAAKZ,GAAOG,CAAI,EACXP,GAAiBO,CAAI,EACzBQ,EAAMb,GAAgBc,CAAG,EAEzBD,EAAMZ,GAAQa,CAAG,EAEXJ,EAQP,SAASM,GAAS,CAGjB,OAFAD,GAAKA,EAAE,GAAKV,EAAI,OAChBG,GAAS,EACJG,GAAOH,EAAQC,EAAK,MAAQJ,EAAI,SAAW,EACxC,CACN,KAAQ,EACT,EAEM,CACN,MAASO,EAAI,KAAMN,EAASO,EAAKR,EAAKU,CAAE,EAAGA,EAAGP,EAAOH,CAAI,EACzD,KAAQ,EACT,CACD,CAQA,SAASY,GAAS,CAMjB,OALAF,GAAK,EACAA,EAAI,IACRA,GAAKV,EAAI,QAEVG,GAAS,EACJG,GAAOH,EAAQC,EAAK,MAAQJ,EAAI,SAAW,EACxC,CACN,KAAQ,EACT,EAEM,CACN,MAASO,EAAI,KAAMN,EAASO,EAAKR,EAAKU,CAAE,EAAGA,EAAGP,EAAOH,CAAI,EACzD,KAAQ,EACT,CACD,CAQA,SAASa,GAAS,CAGjB,OAFAH,GAAKA,EAAE,GAAKV,EAAI,OAChBG,GAAS,EACJG,GAAOH,EAAQC,EAAK,MAAQJ,EAAI,SAAW,EACxC,CACN,KAAQ,EACT,EAEM,CACN,MAASQ,EAAKR,EAAKU,CAAE,EACrB,KAAQ,EACT,CACD,CAQA,SAASI,GAAS,CAMjB,OALAJ,GAAK,EACAA,EAAI,IACRA,GAAKV,EAAI,QAEVG,GAAS,EACJG,GAAOH,EAAQC,EAAK,MAAQJ,EAAI,SAAW,EACxC,CACN,KAAQ,EACT,EAEM,CACN,MAASQ,EAAKR,EAAKU,CAAE,EACrB,KAAQ,EACT,CACD,CASA,SAASK,EAAKE,EAAQ,CAErB,OADAX,EAAM,GACD,UAAU,OACP,CACN,MAASW,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASD,GAAU,CAClB,OAAKT,EACGR,GAAoBC,EAAKI,EAAMG,EAAKN,CAAQ,EAE7CF,GAAoBC,EAAKI,CAAK,CACtC,CACD,CAKAlB,GAAO,QAAUa,KChRjB,IAAAmB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCjDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAkB,KAClBC,GAAiB,QAAS,yBAA0B,EACpDC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EA6B9C,SAASC,GAAgBC,EAAM,CAC9B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,CAACf,GAAcQ,CAAI,EACvB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAI,CAAE,EAEnH,GAAK,UAAU,OAAS,EAAI,CAE3B,GADAI,EAAM,UAAW,CAAE,EACd,CAACb,GAAYa,CAAI,EACrB,MAAM,IAAI,UAAWN,GAAQ,qEAAsEM,CAAI,CAAE,EAE1GH,EAAU,UAAW,CAAE,CACxB,CACA,OAAAM,EAAI,GAGJL,EAAO,CAAC,EACHE,EACJd,GAAaY,EAAM,OAAQM,CAAM,EAEjClB,GAAaY,EAAM,OAAQO,CAAM,EAElCnB,GAAaY,EAAM,SAAUQ,CAAI,EAG5BhB,IACJJ,GAAaY,EAAMR,GAAgBiB,CAAQ,EAG5CL,EAAKT,GAAOG,CAAI,EACXP,GAAiBO,CAAI,EACzBK,EAAMV,GAAgBW,CAAG,EAEzBD,EAAMT,GAAQU,CAAG,EAEXJ,EAQP,SAASM,GAAQ,CAEhB,OADAD,GAAK,EACAJ,GAAOI,GAAKP,EAAI,OACb,CACN,KAAQ,EACT,EAEM,CACN,MAASI,EAAI,KAAMH,EAASI,EAAKL,EAAKO,CAAE,EAAGA,EAAGP,CAAI,EAClD,KAAQ,EACT,CACD,CAQA,SAASS,GAAQ,CAEhB,OADAF,GAAK,EACAJ,GAAOI,GAAKP,EAAI,OACb,CACN,KAAQ,EACT,EAEM,CACN,MAASK,EAAKL,EAAKO,CAAE,EACrB,KAAQ,EACT,CACD,CASA,SAASG,EAAKE,EAAQ,CAErB,OADAT,EAAM,GACD,UAAU,OACP,CACN,MAASS,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASD,GAAU,CAClB,OAAKP,EACGL,GAAgBC,EAAKI,EAAKH,CAAQ,EAEnCF,GAAgBC,CAAI,CAC5B,CACD,CAKAX,GAAO,QAAUU,KChLjB,IAAAc,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCjDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAkB,KAClBC,GAAiB,QAAS,yBAA0B,EACpDC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EAiC9C,SAASC,GAAqBC,EAAM,CACnC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,CAAChB,GAAcQ,CAAI,EACvB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAI,CAAE,EAEnH,GAAK,UAAU,OAAS,EAAI,CAE3B,GADAI,EAAM,UAAW,CAAE,EACd,CAACb,GAAYa,CAAI,EACrB,MAAM,IAAI,UAAWN,GAAQ,qEAAsEM,CAAI,CAAE,EAE1GH,EAAU,UAAW,CAAE,CACxB,CACA,OAAAI,EAAML,EAAI,OACVQ,EAAIH,EAGJH,EAAO,CAAC,EACHE,EACJd,GAAaY,EAAM,OAAQO,CAAM,EAEjCnB,GAAaY,EAAM,OAAQQ,CAAM,EAElCpB,GAAaY,EAAM,SAAUS,CAAI,EAG5BjB,IACJJ,GAAaY,EAAMR,GAAgBkB,CAAQ,EAG5CL,EAAKV,GAAOG,CAAI,EACXP,GAAiBO,CAAI,EACzBM,EAAMX,GAAgBY,CAAG,EAEzBD,EAAMV,GAAQW,CAAG,EAEXL,EAQP,SAASO,GAAQ,CAGhB,OAFAD,GAAKR,EAAI,OAASK,EAAM,EACxBA,EAAML,EAAI,OACLG,GAAOK,EAAI,GACfL,EAAM,GACC,CACN,KAAQ,EACT,GAEM,CACN,MAASC,EAAI,KAAMH,EAASK,EAAKN,EAAKQ,CAAE,EAAGA,EAAGR,CAAI,EAClD,KAAQ,EACT,CACD,CAQA,SAASU,GAAQ,CAGhB,OAFAF,GAAKR,EAAI,OAASK,EAAM,EACxBA,EAAML,EAAI,OACLG,GAAOK,EAAI,GACfL,EAAM,GACC,CACN,KAAQ,EACT,GAEM,CACN,MAASG,EAAKN,EAAKQ,CAAE,EACrB,KAAQ,EACT,CACD,CASA,SAASG,EAAKE,EAAQ,CAErB,OADAV,EAAM,GACD,UAAU,OACP,CACN,MAASU,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASD,GAAU,CAClB,OAAKR,EACGL,GAAqBC,EAAKI,EAAKH,CAAQ,EAExCF,GAAqBC,CAAI,CACjC,CACD,CAKAX,GAAO,QAAUU,KC1LjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA4CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCjDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAY,KACZC,GAAa,KACbC,GAAoB,KACpBC,GAAa,KACbC,GAAc,KACdC,GAAa,KACbC,GAAc,KACdC,GAAe,KACfC,GAAe,KACfC,GAAiB,KACjBC,GAAkB,KAKlBC,GAAQ,CACX,CAAEH,GAAc,cAAe,EAC/B,CAAED,GAAc,cAAe,EAC/B,CAAEF,GAAY,YAAa,EAC3B,CAAEC,GAAa,aAAc,EAC7B,CAAEH,GAAY,YAAa,EAC3B,CAAEC,GAAa,aAAc,EAC7B,CAAEJ,GAAW,WAAY,EACzB,CAAEC,GAAY,YAAa,EAC3B,CAAEC,GAAmB,mBAAoB,EACzC,CAAEO,GAAgB,gBAAiB,EACnC,CAAEC,GAAiB,iBAAkB,CACtC,EAKAX,GAAO,QAAUY,KCtDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,4BAA6B,EACnDC,GAAW,QAAS,gCAAiC,EACrDC,GAAiB,QAAS,gCAAiC,EAC3DC,GAAQ,KAmBZ,SAASC,GAAUC,EAAM,CACxB,IAAIC,EACAC,EAGJ,IAAMA,EAAI,EAAGA,EAAIJ,GAAM,OAAQI,IAC9B,GAAKP,GAAYK,EAAKF,GAAOI,CAAE,EAAG,CAAE,CAAE,EACrC,OAAOJ,GAAOI,CAAE,EAAG,CAAE,EAIvB,KAAQF,GAAM,CAEb,IADAC,EAAIL,GAAUI,CAAI,EACZE,EAAI,EAAGA,EAAIJ,GAAM,OAAQI,IAC9B,GAAKD,IAAMH,GAAOI,CAAE,EAAG,CAAE,EACxB,OAAOJ,GAAOI,CAAE,EAAG,CAAE,EAGvBF,EAAMH,GAAgBG,CAAI,CAC3B,CACD,CAKAN,GAAO,QAAUK,KCrEjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,QAAS,+BAAgC,EACxDC,GAAsB,QAAS,uCAAwC,EACvEC,GAAgB,QAAS,4CAA6C,EACtEC,GAAiB,QAAS,6CAA8C,EACxEC,GAAS,QAAS,uBAAwB,EAC1CC,GAAW,KAyBf,SAASC,GAAiBC,EAAM,CAC/B,IAAIC,EACAC,EACA,EAEJ,GAAKT,GAAcO,CAAI,EACtBC,EAAOD,UACIN,GAAqBM,CAAI,EAC/BA,EAAI,oBAAsB,EAC9BC,EAAON,GAAeK,EAAK,CAAE,EAE7BC,EAAOL,GAAgBI,EAAK,CAAE,MAG/B,OAAM,IAAI,UAAWH,GAAQ,6DAA8DG,CAAI,CAAE,EAMlG,IAJAE,EAAM,CACL,KAAQJ,GAAUE,CAAI,EACtB,KAAQ,CAAC,CACV,EACM,EAAI,EAAG,EAAIC,EAAK,OAAQ,IAC7BC,EAAI,KAAK,KAAMD,EAAM,CAAE,CAAE,EAE1B,OAAOC,CACR,CAKAV,GAAO,QAAUO,KCjFjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAoCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAkB,KAClBC,GAAiB,QAAS,yBAA0B,EACpDC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EA2B9C,SAASC,GAAsBC,EAAM,CACpC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,CAACf,GAAcQ,CAAI,EACvB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAI,CAAE,EAEnH,GAAK,UAAU,OAAS,EAAI,CAE3B,GADAI,EAAM,UAAW,CAAE,EACd,CAACb,GAAYa,CAAI,EACrB,MAAM,IAAI,UAAWN,GAAQ,qEAAsEM,CAAI,CAAE,EAE1GH,EAAU,UAAW,CAAE,CACxB,CACA,OAAAM,EAAI,GAGJL,EAAO,CAAC,EACHE,EACJd,GAAaY,EAAM,OAAQM,CAAM,EAEjClB,GAAaY,EAAM,OAAQO,CAAM,EAElCnB,GAAaY,EAAM,SAAUQ,CAAI,EAG5BhB,IACJJ,GAAaY,EAAMR,GAAgBiB,CAAQ,EAG5CL,EAAKT,GAAOG,CAAI,EACXP,GAAiBO,CAAI,EACzBK,EAAMV,GAAgBW,CAAG,EAEzBD,EAAMT,GAAQU,CAAG,EAEXJ,EAQP,SAASM,GAAQ,CAChB,IAAII,EACJ,GAAKT,EACJ,MAAO,CACN,KAAQ,EACT,EAID,IAFAS,EAAMZ,EAAI,OACVO,GAAK,EACGA,EAAIK,GAAOP,EAAKL,EAAKO,CAAE,IAAM,QACpCA,GAAK,EAEN,OAAKA,GAAKK,GACTT,EAAM,GACC,CACN,KAAQ,EACT,GAEM,CACN,MAASC,EAAI,KAAMH,EAASI,EAAKL,EAAKO,CAAE,EAAGA,EAAGP,CAAI,EAClD,KAAQ,EACT,CACD,CAQA,SAASS,GAAQ,CAChB,IAAIG,EACJ,GAAKT,EACJ,MAAO,CACN,KAAQ,EACT,EAID,IAFAS,EAAMZ,EAAI,OACVO,GAAK,EACGA,EAAIK,GAAOP,EAAKL,EAAKO,CAAE,IAAM,QACpCA,GAAK,EAEN,OAAKA,GAAKK,GACTT,EAAM,GACC,CACN,KAAQ,EACT,GAEM,CACN,MAASE,EAAKL,EAAKO,CAAE,EACrB,KAAQ,EACT,CACD,CASA,SAASG,EAAKG,EAAQ,CAErB,OADAV,EAAM,GACD,UAAU,OACP,CACN,MAASU,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASF,GAAU,CAClB,OAAKP,EACGL,GAAsBC,EAAKI,EAAKH,CAAQ,EAEzCF,GAAsBC,CAAI,CAClC,CACD,CAKAX,GAAO,QAAUU,KCpMjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAkB,KAClBC,GAAiB,QAAS,yBAA0B,EACpDC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EA+B9C,SAASC,GAA2BC,EAAM,CACzC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,CAAChB,GAAcQ,CAAI,EACvB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAI,CAAE,EAEnH,GAAK,UAAU,OAAS,EAAI,CAE3B,GADAI,EAAM,UAAW,CAAE,EACd,CAACb,GAAYa,CAAI,EACrB,MAAM,IAAI,UAAWN,GAAQ,qEAAsEM,CAAI,CAAE,EAE1GH,EAAU,UAAW,CAAE,CACxB,CACA,OAAAI,EAAML,EAAI,OACVQ,EAAIH,EAGJH,EAAO,CAAC,EACHE,EACJd,GAAaY,EAAM,OAAQO,CAAM,EAEjCnB,GAAaY,EAAM,OAAQQ,CAAM,EAElCpB,GAAaY,EAAM,SAAUS,CAAI,EAG5BjB,IACJJ,GAAaY,EAAMR,GAAgBkB,CAAQ,EAG5CL,EAAKV,GAAOG,CAAI,EACXP,GAAiBO,CAAI,EACzBM,EAAMX,GAAgBY,CAAG,EAEzBD,EAAMV,GAAQW,CAAG,EAEXL,EAQP,SAASO,GAAQ,CAChB,GAAKN,EACJ,MAAO,CACN,KAAQ,EACT,EAID,IAFAK,GAAKR,EAAI,OAASK,EAAM,EACxBA,EAAML,EAAI,OACFQ,GAAK,GAAKF,EAAKN,EAAKQ,CAAE,IAAM,QACnCA,GAAK,EAEN,OAAKA,EAAI,GACRL,EAAM,GACC,CACN,KAAQ,EACT,GAEM,CACN,MAASC,EAAI,KAAMH,EAASK,EAAKN,EAAKQ,CAAE,EAAGA,EAAGR,CAAI,EAClD,KAAQ,EACT,CACD,CAQA,SAASU,GAAQ,CAChB,GAAKP,EACJ,MAAO,CACN,KAAQ,EACT,EAID,IAFAK,GAAKR,EAAI,OAASK,EAAM,EACxBA,EAAML,EAAI,OACFQ,GAAK,GAAKF,EAAKN,EAAKQ,CAAE,IAAM,QACnCA,GAAK,EAEN,OAAKA,EAAI,GACRL,EAAM,GACC,CACN,KAAQ,EACT,GAEM,CACN,MAASG,EAAKN,EAAKQ,CAAE,EACrB,KAAQ,EACT,CACD,CASA,SAASG,EAAKE,EAAQ,CAErB,OADAV,EAAM,GACD,UAAU,OACP,CACN,MAASU,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASD,GAAU,CAClB,OAAKR,EACGL,GAA2BC,EAAKI,EAAKH,CAAQ,EAE9CF,GAA2BC,CAAI,CACvC,CACD,CAKAX,GAAO,QAAUU,KCxMjB,IAAAe,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAY,QAAS,2BAA4B,EAAE,YACnDC,GAAkB,KAClBC,GAAiB,QAAS,yBAA0B,EACpDC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EAyC9C,SAASC,GAAuBC,EAAGC,EAAKC,EAAQC,EAAS,CACxD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,CAACpB,GAAsBS,CAAE,EAC7B,MAAM,IAAI,UAAWF,GAAQ,+EAAgFE,CAAE,CAAE,EAElH,GAAK,CAACV,GAAcW,CAAI,EACvB,MAAM,IAAI,UAAWH,GAAQ,+EAAgFG,CAAI,CAAE,EAEpH,GAAK,CAACT,GAAWU,CAAO,EACvB,MAAM,IAAI,UAAWJ,GAAQ,oEAAqEI,CAAO,CAAE,EAE5G,GAAK,CAACX,GAAsBY,CAAO,EAClC,MAAM,IAAI,UAAWL,GAAQ,gFAAiFK,CAAO,CAAE,EAExH,GAAK,UAAU,OAAS,EAAI,CAE3B,GADAI,EAAM,UAAW,CAAE,EACd,CAAClB,GAAYkB,CAAI,EACrB,MAAM,IAAI,UAAWT,GAAQ,oEAAqES,CAAI,CAAE,EAEzGH,EAAU,UAAW,CAAE,CACxB,CACA,OAAAI,EAAML,EACNQ,EAAI,GAGJN,EAAO,CAAC,EACHE,EACJnB,GAAaiB,EAAM,OAAQO,CAAM,EAEjCxB,GAAaiB,EAAM,OAAQQ,CAAM,EAElCzB,GAAaiB,EAAM,SAAUS,CAAI,EAG5BpB,IACJN,GAAaiB,EAAMX,GAAgBqB,CAAQ,EAG5CL,EAAKb,GAAOI,CAAI,EACXR,GAAiBQ,CAAI,EACzBQ,EAAMd,GAAgBe,CAAG,EAEzBD,EAAMb,GAAQc,CAAG,EAEXL,EAQP,SAASO,GAAQ,CAChB,IAAII,EAEJ,OADAL,GAAK,EACAL,GAAOK,GAAKX,EACT,CACN,KAAQ,EACT,GAEDgB,EAAIT,EAAI,KAAMH,EAASK,EAAKR,EAAKO,CAAI,EAAGA,EAAKG,EAAGV,CAAI,EACpDO,GAAON,EACA,CACN,MAASc,EACT,KAAQ,EACT,EACD,CAQA,SAASH,GAAQ,CAChB,IAAIG,EAEJ,OADAL,GAAK,EACAL,GAAOK,GAAKX,EACT,CACN,KAAQ,EACT,GAEDgB,EAAIP,EAAKR,EAAKO,CAAI,EAClBA,GAAON,EACA,CACN,MAASc,EACT,KAAQ,EACT,EACD,CASA,SAASF,EAAKG,EAAQ,CAErB,OADAX,EAAM,GACD,UAAU,OACP,CACN,MAASW,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASF,GAAU,CAClB,OAAKR,EACGR,GAAuBC,EAAGC,EAAKC,EAAQC,EAAQI,EAAKH,CAAQ,EAE7DL,GAAuBC,EAAGC,EAAKC,EAAQC,CAAO,CACtD,CACD,CAKAhB,GAAO,QAAUY,KC/MjB,IAAAmB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkDA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAY,QAAS,2BAA4B,EAAE,YACnDC,GAAkB,KAClBC,GAAiB,QAAS,yBAA0B,EACpDC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EA+B9C,SAASC,GAAoBC,EAAM,CAClC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,CAACnB,GAAcS,CAAI,EACvB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAI,CAAE,EAGnH,GADAG,EAAQ,UAAU,OACbA,IAAU,EACdD,EAAQ,EACRK,EAAMP,EAAI,eACCG,IAAU,EAChBb,GAAY,UAAW,CAAE,CAAE,GAC/BY,EAAQ,EACRI,EAAM,UAAW,CAAE,GAEnBJ,EAAQ,UAAW,CAAE,EAEtBK,EAAMP,EAAI,eACCG,IAAU,EAChBb,GAAY,UAAW,CAAE,CAAE,GAC/BY,EAAQ,EACRK,EAAMP,EAAI,OACVM,EAAM,UAAW,CAAE,EACnBL,EAAU,UAAW,CAAE,GACZX,GAAY,UAAW,CAAE,CAAE,GACtCY,EAAQ,UAAW,CAAE,EACrBK,EAAMP,EAAI,OACVM,EAAM,UAAW,CAAE,IAEnBJ,EAAQ,UAAW,CAAE,EACrBK,EAAM,UAAW,CAAE,OAEd,CAIN,GAHAL,EAAQ,UAAW,CAAE,EACrBK,EAAM,UAAW,CAAE,EACnBD,EAAM,UAAW,CAAE,EACd,CAAChB,GAAYgB,CAAI,EACrB,MAAM,IAAI,UAAWR,GAAQ,qEAAsEQ,CAAI,CAAE,EAE1GL,EAAU,UAAW,CAAE,CACxB,CACA,GAAK,CAACT,GAAWU,CAAM,EACtB,MAAM,IAAI,UAAWJ,GAAQ,2GAA4GI,CAAM,CAAE,EAElJ,GAAK,CAACV,GAAWe,CAAI,EACpB,MAAM,IAAI,UAAWT,GAAQ,wGAAyGS,CAAI,CAAE,EAE7I,OAAKA,EAAM,GACVA,EAAMP,EAAI,OAASO,EACdA,EAAM,IACVA,EAAM,IAEIA,EAAMP,EAAI,SACrBO,EAAMP,EAAI,QAENE,EAAQ,IACZA,EAAQF,EAAI,OAASE,EAChBA,EAAQ,IACZA,EAAQ,IAGVQ,EAAIR,EAAQ,EAGZE,EAAO,CAAC,EACHE,EACJjB,GAAae,EAAM,OAAQO,CAAM,EAEjCtB,GAAae,EAAM,OAAQQ,CAAM,EAElCvB,GAAae,EAAM,SAAUS,CAAO,EAG/BnB,IACJL,GAAae,EAAMV,GAAgBoB,CAAQ,EAG5CL,EAAKZ,GAAOG,CAAI,EACXP,GAAiBO,CAAI,EACzBQ,EAAMb,GAAgBc,CAAG,EAEzBD,EAAMZ,GAAQa,CAAG,EAEXL,EAQP,SAASO,GAAQ,CAEhB,OADAD,GAAK,EACAL,GAAOK,GAAKH,EACT,CACN,KAAQ,EACT,EAEM,CACN,MAASD,EAAI,KAAML,EAASO,EAAKR,EAAKU,CAAE,EAAGA,EAAGA,EAAER,EAAOF,CAAI,EAC3D,KAAQ,EACT,CACD,CAQA,SAASY,GAAQ,CAEhB,OADAF,GAAK,EACAL,GAAOK,GAAKH,EACT,CACN,KAAQ,EACT,EAEM,CACN,MAASC,EAAKR,EAAKU,CAAE,EACrB,KAAQ,EACT,CACD,CASA,SAASG,EAAQE,EAAQ,CAExB,OADAV,EAAM,GACD,UAAU,OACP,CACN,MAASU,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASD,GAAU,CAClB,OAAKR,EACGP,GAAoBC,EAAKE,EAAOK,EAAKD,EAAKL,CAAQ,EAEnDF,GAAoBC,EAAKE,EAAOK,CAAI,CAC5C,CACD,CAKAnB,GAAO,QAAUW,KCtOjB,IAAAiB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,QAAS,uDAAwD,EAC/EC,GAAa,QAAS,4BAA6B,EACnDC,GAAe,QAAS,8BAA+B,EACvDC,GAAY,QAAS,2BAA4B,EAAE,YACnDC,GAAkB,KAClBC,GAAiB,QAAS,yBAA0B,EACpDC,GAAiB,KACjBC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EA+B9C,SAASC,GAAyBC,EAAM,CACvC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAK,CAACnB,GAAcS,CAAI,EACvB,MAAM,IAAI,UAAWF,GAAQ,8EAA+EE,CAAI,CAAE,EAGnH,GADAG,EAAQ,UAAU,OACbA,IAAU,EACdD,EAAQ,EACRK,EAAMP,EAAI,eACCG,IAAU,EAChBb,GAAY,UAAW,CAAE,CAAE,GAC/BY,EAAQ,EACRI,EAAM,UAAW,CAAE,GAEnBJ,EAAQ,UAAW,CAAE,EAEtBK,EAAMP,EAAI,eACCG,IAAU,EAChBb,GAAY,UAAW,CAAE,CAAE,GAC/BY,EAAQ,EACRK,EAAMP,EAAI,OACVM,EAAM,UAAW,CAAE,EACnBL,EAAU,UAAW,CAAE,GACZX,GAAY,UAAW,CAAE,CAAE,GACtCY,EAAQ,UAAW,CAAE,EACrBK,EAAMP,EAAI,OACVM,EAAM,UAAW,CAAE,IAEnBJ,EAAQ,UAAW,CAAE,EACrBK,EAAM,UAAW,CAAE,OAEd,CAIN,GAHAL,EAAQ,UAAW,CAAE,EACrBK,EAAM,UAAW,CAAE,EACnBD,EAAM,UAAW,CAAE,EACd,CAAChB,GAAYgB,CAAI,EACrB,MAAM,IAAI,UAAWR,GAAQ,qEAAsEQ,CAAI,CAAE,EAE1GL,EAAU,UAAW,CAAE,CACxB,CACA,GAAK,CAACT,GAAWU,CAAM,EACtB,MAAM,IAAI,UAAWJ,GAAQ,gHAAiHI,CAAM,CAAE,EAEvJ,GAAK,CAACV,GAAWe,CAAI,EACpB,MAAM,IAAI,UAAWT,GAAQ,6GAA8GS,CAAI,CAAE,EAElJ,OAAKA,EAAM,GACVA,EAAMP,EAAI,OAASO,EACdA,EAAM,IACVA,EAAM,IAEIA,EAAMP,EAAI,SACrBO,EAAMP,EAAI,QAENE,EAAQ,IACZA,EAAQF,EAAI,OAASE,EAChBA,EAAQ,IACZA,EAAQ,IAGVQ,EAAIH,EAGJH,EAAO,CAAC,EACHE,EACJjB,GAAae,EAAM,OAAQO,CAAM,EAEjCtB,GAAae,EAAM,OAAQQ,CAAM,EAElCvB,GAAae,EAAM,SAAUS,CAAO,EAG/BnB,IACJL,GAAae,EAAMV,GAAgBoB,CAAQ,EAG5CL,EAAKZ,GAAOG,CAAI,EACXP,GAAiBO,CAAI,EACzBQ,EAAMb,GAAgBc,CAAG,EAEzBD,EAAMZ,GAAQa,CAAG,EAEXL,EAQP,SAASO,GAAQ,CAEhB,OADAD,GAAK,EACAL,GAAOK,EAAIR,EACR,CACN,KAAQ,EACT,EAEM,CACN,MAASI,EAAI,KAAML,EAASO,EAAKR,EAAKU,CAAE,EAAGA,EAAGH,EAAIG,EAAE,EAAGV,CAAI,EAC3D,KAAQ,EACT,CACD,CAQA,SAASY,GAAQ,CAEhB,OADAF,GAAK,EACAL,GAAOK,EAAIR,EACR,CACN,KAAQ,EACT,EAEM,CACN,MAASM,EAAKR,EAAKU,CAAE,EACrB,KAAQ,EACT,CACD,CASA,SAASG,EAAQE,EAAQ,CAExB,OADAV,EAAM,GACD,UAAU,OACP,CACN,MAASU,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASD,GAAU,CAClB,OAAKR,EACGP,GAAyBC,EAAKE,EAAOK,EAAKD,EAAKL,CAAQ,EAExDF,GAAyBC,EAAKE,EAAOK,CAAI,CACjD,CACD,CAKAnB,GAAO,QAAUW,KCtOjB,IAAAiB,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cA0CA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAQ,KACRC,GAAiB,QAAS,6CAA8C,EACxEC,GAAgB,QAAS,4CAA6C,EACtEC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAgBF,GAAS,IAAK,gBAAiB,EAC/CG,GAAiBN,GAAO,WAAY,EACpCO,GAAkBP,GAAO,YAAa,EAuF1C,SAASQ,IAAa,CACrB,IAAIC,EACAC,EACAC,EACAC,EAUJ,GARAH,EAAQ,UAAU,OACbA,GAASV,GAAU,UAAWU,EAAM,CAAE,CAAE,GAC5CA,GAAS,EACTC,EAAQ,UAAWD,CAAM,GAEzBC,EAAQL,GAETM,EAAOX,GAAOU,CAAM,EACfC,IAAS,KACb,MAAM,IAAI,UAAWP,GAAQ,sEAAuEM,CAAM,CAAE,EAE7G,OAAKD,GAAS,EACN,IAAIE,EAAM,CAAE,EAEfF,IAAU,GACdG,EAAM,UAAW,CAAE,EAGdA,aAAeN,GACnBM,EAAMV,GAAeU,EAAK,CAAE,EACjBA,aAAeL,KAC1BK,EAAMX,GAAgBW,EAAK,CAAE,GAEvB,IAAID,EAAMC,CAAI,GAEjBH,IAAU,EACP,IAAIE,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAEtC,IAAIA,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,CAC3D,CAKAb,GAAO,QAAUU,KCjKjB,IAAAK,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwHA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7HjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAkB,KAClBC,GAAiB,KAMjBC,GAAQ,CACX,WAAcF,GACd,UAAaC,EACd,EAKAF,GAAO,QAAUG,KCrCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAQ,KACRC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAgBF,GAAS,IAAK,+BAAgC,EAuFlE,SAASG,IAAe,CACvB,IAAIC,EACAC,EACAC,EAUJ,GARAF,EAAQ,UAAU,OACbA,GAASN,GAAU,UAAWM,EAAM,CAAE,CAAE,GAC5CA,GAAS,EACTC,EAAQ,UAAWD,CAAM,GAEzBC,EAAQH,GAETI,EAAOP,GAAOM,CAAM,EACfC,IAAS,KACb,MAAM,IAAI,UAAWL,GAAQ,sEAAuEI,CAAM,CAAE,EAE7G,OAAKD,GAAS,EACN,IAAIE,EAAM,CAAE,EAEfF,IAAU,EACP,IAAIE,EAAM,UAAU,CAAC,CAAE,EAE1BF,IAAU,EACP,IAAIE,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAEtC,IAAIA,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,CAC3D,CAKAT,GAAO,QAAUM,KCpJjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwHA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7HjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,YACA,YACD,ICHA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAcb,SAASC,IAAS,CACjB,OAAOD,GAAO,MAAM,CACrB,CAKAD,GAAO,QAAUE,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,UACA,UACA,QACA,QACA,OACA,SACA,SACA,QACA,SACC,YACA,YACF,ICZA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAcb,SAASC,IAAS,CACjB,OAAOD,GAAO,MAAM,CACrB,CAKAD,GAAO,QAAUE,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,UACA,UACA,YACC,YACF,ICLA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAcb,SAASC,IAAS,CACjB,OAAOD,GAAO,MAAM,CACrB,CAKAD,GAAO,QAAUE,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,KACbC,GAAa,KACbC,GAAY,KACZC,GAAc,KACdC,GAAc,KACdC,GAAa,KACbC,GAAoB,KAMpBC,GAAQ,CACX,MAASP,GACT,MAASC,GACT,KAAQC,GACR,OAAUC,GACV,OAAUC,GACV,MAASC,GACT,OAAUC,EACX,EAKAP,GAAO,QAAUQ,KC/CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,QACA,QACA,OACA,SACA,SACA,QACA,QACD,ICRA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAcb,SAASC,IAAS,CACjB,OAAOD,GAAO,MAAM,CACrB,CAKAD,GAAO,QAAUE,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAQ,KACRC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAgBF,GAAS,IAAK,aAAc,EAuFhD,SAASG,IAAY,CACpB,IAAIC,EACAC,EACAC,EAUJ,GARAF,EAAQ,UAAU,OACbA,GAASN,GAAU,UAAWM,EAAM,CAAE,CAAE,GAC5CA,GAAS,EACTC,EAAQ,UAAWD,CAAM,GAEzBC,EAAQH,GAETI,EAAOP,GAAOM,CAAM,EACfC,IAAS,KACb,MAAM,IAAI,UAAWL,GAAQ,sEAAuEI,CAAM,CAAE,EAE7G,OAAKD,GAAS,EACN,IAAIE,EAAM,CAAE,EAEfF,IAAU,EACP,IAAIE,EAAM,UAAU,CAAC,CAAE,EAE1BF,IAAU,EACP,IAAIE,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,EAEtC,IAAIA,EAAM,UAAU,CAAC,EAAG,UAAU,CAAC,EAAG,UAAU,CAAC,CAAE,CAC3D,CAKAT,GAAO,QAAUM,KCpJjB,IAAAI,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwHA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7HjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,KACfC,GAAe,KACfC,GAAa,KACbC,GAAa,KACbC,GAAY,KACZC,GAAc,KACdC,GAAc,KACdC,GAAa,KACbC,GAAoB,KAMpBC,GAAQ,CACX,QAAWT,GACX,QAAWC,GACX,MAASC,GACT,MAASC,GACT,KAAQC,GACR,OAAUC,GACV,OAAUC,GACV,MAASC,GACT,OAAUC,EACX,EAKAT,GAAO,QAAUU,KCnDjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,UACA,UACA,QACA,QACA,OACA,SACA,SACA,QACA,QACD,ICVA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAcb,SAASC,IAAS,CACjB,OAAOD,GAAO,MAAM,CACrB,CAKAD,GAAO,QAAUE,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAe,KACfC,GAAe,KAMfC,GAAQ,CACX,QAAWF,GACX,QAAWC,EACZ,EAKAF,GAAO,QAAUG,KCrCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,UACA,SACD,ICHA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAcb,SAASC,IAAS,CACjB,OAAOD,GAAO,MAAM,CACrB,CAKAD,GAAO,QAAUE,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,KACbC,GAAa,KACbC,GAAY,KAMZC,GAAQ,CACX,MAASH,GACT,MAASC,GACT,KAAQC,EACT,EAKAH,GAAO,QAAUI,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,QACA,QACA,MACD,ICJA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAcb,SAASC,IAAS,CACjB,OAAOD,GAAO,MAAM,CACrB,CAKAD,GAAO,QAAUE,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAc,KACdC,GAAc,KACdC,GAAa,KACbC,GAAoB,KAMpBC,GAAQ,CACX,OAAUJ,GACV,OAAUC,GACV,MAASC,GACT,OAAUC,EACX,EAKAJ,GAAO,QAAUK,KCzCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,KAmBZ,SAASC,GAAOC,EAAQ,CACvB,OAAOF,GAAOE,CAAM,GAAK,IAC1B,CAKAH,GAAO,QAAUE,KChDjB,IAAAE,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAqCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC1CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,CAAAA,GAAA,SACC,SACA,SACA,QACA,QACD,ICLA,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KAcb,SAASC,IAAS,CACjB,OAAOD,GAAO,MAAM,CACrB,CAKAD,GAAO,QAAUE,KC3CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAkCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCvCjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAuB,QAAS,uCAAwC,EAAE,YAC1EC,GAAO,KACPC,GAAQ,KACRC,GAAW,KACXC,GAAS,QAAS,uBAAwB,EAK1CC,GAAgBF,GAAS,IAAK,gBAAiB,EAsBnD,SAASG,GAAQC,EAAI,CACpB,IAAIC,EACJ,GAAK,CAACR,GAAsBO,CAAE,EAC7B,MAAM,IAAI,UAAWH,GAAQ,+EAAgFG,CAAE,CAAE,EAElH,GAAK,UAAU,OAAS,GAEvB,GADAC,EAAQ,UAAW,CAAE,EAChBA,IAAU,UACd,OAAOP,GAAMM,CAAE,OAGhBC,EAAQH,GAET,OAAOJ,GAAK,OAAQC,GAAOK,EAAGC,CAAM,EAAG,EAAG,CAAE,CAC7C,CAKAT,GAAO,QAAUO,KCxEjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,KACTC,GAAQ,IACRC,GAAS,QAAS,uBAAwB,EAsB9C,SAASC,GAAYC,EAAI,CACxB,IAAIC,EAAKJ,GAAOG,CAAE,EAClB,GAAKC,IAAO,KACX,MAAM,IAAI,UAAWH,GAAQ,8GAA+GE,CAAE,CAAE,EAEjJ,OAAK,UAAU,OAAS,IACvBC,EAAK,UAAW,CAAE,GAEZL,GAAQI,EAAE,OAAQC,CAAG,CAC7B,CAKAN,GAAO,QAAUI,KC5DjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KC7CjB,IAAAC,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAS,QAAS,uBAAwB,EAC1CC,GAAQ,IACRC,GAAQ,KAsBZ,SAASC,GAAWC,EAAI,CACvB,IAAIC,EAAKJ,GAAOG,CAAE,EAClB,GAAKC,IAAO,KACX,MAAM,IAAI,UAAWL,GAAQ,8GAA+GI,CAAE,CAAE,EAEjJ,OAAK,UAAU,OAAS,IACvBC,EAAK,UAAW,CAAE,GAEZH,GAAOE,EAAE,OAAQC,CAAG,CAC5B,CAKAN,GAAO,QAAUI,KC5DjB,IAAAG,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwCA,IAAIC,GAAO,KAKXD,GAAO,QAAUC,KCfjB,IAAIC,EAAc,QAAS,yCAA0C,EAUjEC,EAAK,CAAC,EASVD,EAAaC,EAAI,OAAQ,IAAuB,EAShDD,EAAaC,EAAI,cAAe,IAAyB,EASzDD,EAAaC,EAAI,kBAAmB,IAAkC,EAStED,EAAaC,EAAI,oBAAqB,IAAoC,EAS1ED,EAAaC,EAAI,mBAAoB,IAAmC,EASxED,EAAaC,EAAI,iBAAkB,IAA4B,EAS/DD,EAAaC,EAAI,kBAAmB,IAA6B,EASjED,EAAaC,EAAI,eAAgB,IAA0B,EAS3DD,EAAaC,EAAI,mBAAoB,IAA+B,EASpED,EAAaC,EAAI,aAAc,IAAwB,EASvDD,EAAaC,EAAI,WAAY,IAA2B,EASxDD,EAAaC,EAAI,YAAa,IAA4B,EAS1DD,EAAaC,EAAI,gBAAiB,IAA2B,EAS7DD,EAAaC,EAAI,gBAAiB,GAAwB,EAS1DD,EAAaC,EAAI,iBAAkB,IAAyB,EAS5DD,EAAaC,EAAI,SAAU,IAAwB,EASnDD,EAAaC,EAAI,aAAc,IAA6B,EAS5DD,EAAaC,EAAI,cAAe,IAAyB,EASzDD,EAAaC,EAAI,gBAAiB,IAA4B,EAS9DD,EAAaC,EAAI,eAAgB,IAA0B,EAS3DD,EAAaC,EAAI,eAAgB,IAA0B,EAS3DD,EAAaC,EAAI,iBAAkB,IAAgC,EASnED,EAAaC,EAAI,QAAS,IAAuB,EASjDD,EAAaC,EAAI,YAAa,IAA4B,EAS1DD,EAAaC,EAAI,YAAa,IAA4B,EAS1DD,EAAaC,EAAI,YAAa,IAAuB,EASrDD,EAAaC,EAAI,aAAc,IAAwB,EASvDD,EAAaC,EAAI,aAAc,IAAwB,EASvDD,EAAaC,EAAI,WAAY,IAA2B,EASxDD,EAAaC,EAAI,WAAY,IAA2B,EASxDD,EAAaC,EAAI,mBAAoB,IAA4B,EASjED,EAAaC,EAAI,QAAS,IAAuB,EASjDD,EAAaC,EAAI,YAAa,IAA4B,EAS1DD,EAAaC,EAAI,oBAAqB,IAA6B,EASnED,EAAaC,EAAI,SAAU,IAAyB,EASpDD,EAAaC,EAAI,aAAc,IAA8B,EAS7DD,EAAaC,EAAI,QAAS,IAAuB,EASjDD,EAAaC,EAAI,YAAa,IAA4B,EAS1DD,EAAaC,EAAI,iBAAkB,IAAuB,EAS1DD,EAAaC,EAAI,sBAAuB,IAAkC,EAS1ED,EAAaC,EAAI,mBAAoB,IAA0B,EAS/DD,EAAaC,EAAI,iBAAkB,IAA6B,EAShED,EAAaC,EAAI,qBAAsB,IAAkC,EASzED,EAAaC,EAAI,aAAc,IAAwB,EASvDD,EAAaC,EAAI,oBAAqB,IAAgC,EAStED,EAAaC,EAAI,SAAU,IAAwB,EASnDD,EAAaC,EAAI,qBAAsB,IAAuC,EAS9ED,EAAaC,EAAI,iBAAkB,IAA8B,EASjED,EAAaC,EAAI,sBAAuB,IAAoC,EAS5ED,EAAaC,EAAI,kBAAmB,IAA0B,EAS9DD,EAAaC,EAAI,uBAAwB,IAAqC,EAS9ED,EAAaC,EAAI,4BAA6B,IAA2C,EASzFD,EAAaC,EAAI,wBAAyB,IAAsC,EAShFD,EAAaC,EAAI,qBAAsB,IAAmC,EAS1ED,EAAaC,EAAI,0BAA2B,IAAyC,EASrFD,EAAaC,EAAI,aAAc,IAAwB,EASvDD,EAAaC,EAAI,eAAgB,IAAgC,EASjED,EAAaC,EAAI,oBAAqB,IAAsC,EAS5ED,EAAaC,EAAI,wBAAyB,IAAuC,EASjFD,EAAaC,EAAI,kBAAmB,IAA8B,EASlED,EAAaC,EAAI,sBAAuB,IAA+B,EASvED,EAAaC,EAAI,kBAAmB,IAAoC,EASxED,EAAaC,EAAI,sBAAuB,IAAqC,EAS7ED,EAAaC,EAAI,gBAAiB,IAAsC,EASxED,EAAaC,EAAI,oBAAqB,IAAuC,EAS7ED,EAAaC,EAAI,YAAa,IAA6B,EAS3DD,EAAaC,EAAI,iBAAkB,IAAmC,EAStED,EAAaC,EAAI,qBAAsB,IAAoC,EAS3ED,EAAaC,EAAI,sBAAuB,IAAyC,EASjFD,EAAaC,EAAI,0BAA2B,IAA0C,EAStFD,EAAaC,EAAI,sBAAuB,IAA6C,EASrFD,EAAaC,EAAI,0BAA2B,IAA8C,EAS1FD,EAAaC,EAAI,wBAAyB,IAA+C,EASzFD,EAAaC,EAAI,4BAA6B,IAAgD,EAS9FD,EAAaC,EAAI,aAAc,IAAwB,EASvDD,EAAaC,EAAI,oBAAqB,IAAyB,EAS/DD,EAAaC,EAAI,cAAe,IAAyB,EASzDD,EAAaC,EAAI,cAAe,IAAyB,EASzDD,EAAaC,EAAI,UAAW,IAA0B,EAStDD,EAAaC,EAAI,cAAe,IAA+B,EAS/DD,EAAaC,EAAI,SAAU,IAAwB,EASnDD,EAAaC,EAAI,aAAc,IAA6B,EAS5DD,EAAaC,EAAI,YAAa,QAAS,yBAA0B,CAAE,EAKnE,OAAO,QAAUA",
-  "names": ["require_main", "__commonJSMin", "exports", "module", "TYPE", "isAccessorArray", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "GETTERS", "getFloat64", "getFloat32", "getInt32", "getInt16", "getInt8", "getUint32", "getUint16", "getUint8", "getUint8c", "getGeneric", "getArrayLike", "arr", "idx", "getter", "dtype", "f", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "SETTERS", "setFloat64", "setFloat32", "setInt32", "setInt16", "setInt8", "setUint32", "setUint16", "setUint8", "setUint8c", "setGeneric", "setArrayLike", "arr", "idx", "value", "setter", "dtype", "f", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "GETTERS", "getComplex128", "getComplex64", "getArrayLike", "arr", "idx", "getter", "dtype", "f", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "SETTERS", "setComplex128", "setComplex64", "setArrayLike", "arr", "idx", "value", "setter", "dtype", "f", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctor2dtype", "__commonJSMin", "exports", "module", "ctor2dtypes", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasFloat64ArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasFloat32ArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasUint32ArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasInt32ArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasUint16ArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasInt16ArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasUint8ArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasUint8ClampedArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasInt8ArraySupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "BYTES_PER_ELEMENT", "isComplex64Array", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "BYTES_PER_ELEMENT", "isComplex128Array", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_from_iterator", "__commonJSMin", "exports", "module", "isArrayLikeObject", "isComplexLike", "realf", "imagf", "format", "fromIterator", "it", "out", "v", "z", "require_from_iterator_map", "__commonJSMin", "exports", "module", "isArrayLikeObject", "isComplexLike", "realf", "imagf", "format", "fromIteratorMap", "it", "clbk", "thisArg", "out", "v", "z", "i", "require_from_array", "__commonJSMin", "exports", "module", "isComplexLike", "realf", "imagf", "fromArray", "buf", "arr", "len", "v", "i", "j", "require_main", "__commonJSMin", "exports", "module", "isNonNegativeInteger", "isArrayLikeObject", "isCollection", "isArrayBuffer", "isObject", "isArray", "isString", "isFunction", "isComplexLike", "isEven", "isInteger", "isComplex64Array", "isComplex128Array", "hasIteratorSymbolSupport", "ITERATOR_SYMBOL", "setReadOnly", "setReadOnlyAccessor", "Float32Array", "Complex64", "format", "realf", "imagf", "floor", "reinterpret64", "reinterpret128", "getter", "accessorGetter", "fromIterator", "fromIteratorMap", "fromArray", "BYTES_PER_ELEMENT", "HAS_ITERATOR_SYMBOL", "isComplexArray", "value", "Complex64Array", "isComplexArrayConstructor", "getComplex64", "buf", "idx", "byteOffset", "nargs", "len", "src", "thisArg", "clbk", "out", "tmp", "get", "flg", "v", "i", "j", "args", "target", "start", "buffer", "self", "iter", "FLG", "next", "end", "factory", "z", "predicate", "re", "im", "fcn", "searchElement", "fromIndex", "separator", "sep", "outbuf", "N", "sbuf", "outlen", "begin", "offset", "index", "require_lib", "__commonJSMin", "exports", "module", "main", "require_from_iterator", "__commonJSMin", "exports", "module", "isArrayLikeObject", "isComplexLike", "format", "real", "imag", "fromIterator", "it", "out", "v", "z", "require_from_iterator_map", "__commonJSMin", "exports", "module", "isArrayLikeObject", "isComplexLike", "format", "real", "imag", "fromIteratorMap", "it", "clbk", "thisArg", "out", "v", "z", "i", "require_from_array", "__commonJSMin", "exports", "module", "isComplexLike", "real", "imag", "fromArray", "buf", "arr", "len", "v", "i", "j", "require_main", "__commonJSMin", "exports", "module", "isNonNegativeInteger", "isArrayLikeObject", "isCollection", "isArrayBuffer", "isObject", "isArray", "isString", "isFunction", "isComplexLike", "isEven", "isInteger", "isComplex64Array", "isComplex128Array", "hasIteratorSymbolSupport", "ITERATOR_SYMBOL", "setReadOnly", "setReadOnlyAccessor", "Float64Array", "Complex128", "real", "imag", "floor", "reinterpret64", "reinterpret128", "getter", "accessorGetter", "format", "fromIterator", "fromIteratorMap", "fromArray", "BYTES_PER_ELEMENT", "HAS_ITERATOR_SYMBOL", "isComplexArray", "value", "Complex128Array", "isComplexArrayConstructor", "getComplex128", "buf", "idx", "byteOffset", "nargs", "len", "src", "thisArg", "clbk", "out", "tmp", "get", "flg", "v", "i", "j", "args", "target", "start", "buffer", "self", "iter", "FLG", "next", "end", "factory", "z", "predicate", "re", "im", "fcn", "searchElement", "fromIndex", "separator", "sep", "outbuf", "N", "sbuf", "begin", "offset", "index", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Float64Array", "Float32Array", "Uint32Array", "Int32Array", "Uint16Array", "Int16Array", "Uint8Array", "Uint8ClampedArray", "Int8Array", "Complex64Array", "Complex128Array", "CTORS", "require_dtypes", "__commonJSMin", "exports", "module", "DTYPES", "require_main", "__commonJSMin", "exports", "module", "isBuffer", "isArray", "constructorName", "ctor2dtype", "CTORS", "DTYPES", "NTYPES", "dtype", "value", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isAccessorArray", "getter", "setter", "accessorGetter", "accessorSetter", "dtype", "accessors", "x", "dt", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadWriteAccessor", "setReadOnly", "accessors", "isCollection", "format", "setLength", "len", "getLength", "AccessorArray", "arr", "o", "idx", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "accessors", "arraylike2object", "x", "o", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isComplex128Array", "isComplex64Array", "arraylike2object", "reinterpret128", "reinterpret64", "internal", "x", "i", "accessors", "data", "get", "any", "obj", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "hasMethod", "obj", "method", "internal", "x", "predicate", "thisArg", "accessors", "data", "get", "i", "anyBy", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "internal", "x", "predicate", "thisArg", "accessors", "data", "get", "i", "anyByRight", "obj", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isAccessorArray", "accessorGetter", "getter", "dtype", "contains", "x", "value", "len", "get", "dt", "i", "require_factory", "__commonJSMin", "exports", "module", "isCollection", "isAccessorArray", "accessorGetter", "dtype", "format", "factory", "x", "get", "len", "dt", "contains", "accessors", "value", "i", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "factory", "require_main", "__commonJSMin", "exports", "module", "isComplex128Array", "isComplex64Array", "arraylike2object", "reinterpret128", "reinterpret64", "isSameValue", "internal", "x", "y", "i", "accessors", "xdata", "ydata", "xget", "yget", "hasSameValues", "FLG", "xo", "yo", "xr", "yr", "require_lib", "__commonJSMin", "exports", "module", "main", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "ns", "require_main", "__commonJSMin", "exports", "module", "isAccessorArray", "accessorGetter", "getter", "dtype", "resolveGetter", "x", "dt", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "hasMethod", "obj", "method", "at", "x", "index", "get", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "at2d", "x", "i0", "i1", "x0", "N", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "at3d", "x", "i0", "i1", "i2", "x0", "x1", "N", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "at4d", "x", "i0", "i1", "i2", "i3", "value", "idx", "N", "i", "j", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "at5d", "x", "i0", "i1", "i2", "i3", "i4", "value", "idx", "N", "i", "j", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "atnd", "x", "i0", "value", "idx", "N", "i", "j", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "bifurcateEntries", "x", "filter", "xget", "gget", "len", "out", "g", "v", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "bifurcateEntriesBy", "x", "predicate", "thisArg", "get", "len", "out", "v", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "bifurcateIndices", "x", "filter", "gget", "len", "out", "g", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "bifurcateIndicesBy", "x", "predicate", "thisArg", "get", "len", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "bifurcateValues", "x", "filter", "xget", "gget", "len", "out", "g", "v", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "bifurcateValuesBy", "x", "predicate", "thisArg", "get", "len", "out", "v", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "binary2d", "arrays", "shape", "fcn", "S0", "S1", "i0", "i1", "x0", "y0", "z0", "x", "y", "z", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "binary3d", "arrays", "shape", "fcn", "S0", "S1", "S2", "i0", "i1", "i2", "x0", "x1", "y0", "y1", "z0", "z1", "x", "y", "z", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "binary4d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "x0", "x1", "x2", "y0", "y1", "y2", "z0", "z1", "z2", "x", "y", "z", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "binary5d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "x0", "x1", "x2", "x3", "y0", "y1", "y2", "y3", "z0", "z1", "z2", "z3", "x", "y", "z", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "recurse", "x", "y", "z", "ndims", "shape", "dim", "fcn", "S", "d", "i", "binarynd", "arrays", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "copy", "x", "out", "len", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled", "value", "len", "arr", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled", "zeros", "len", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "copy", "zeros", "format", "broadcastArray", "x", "inShape", "outShape", "data", "dim", "st", "N", "M", "d", "i", "j", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bbinary2d", "arrays", "shapes", "fcn", "dx0", "dx1", "dy0", "dy1", "S0", "S1", "i0", "i1", "j0", "j1", "k0", "k1", "x0", "y0", "z0", "sh", "st", "o", "x", "y", "z", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bbinary3d", "arrays", "shapes", "fcn", "dx0", "dx1", "dx2", "dy0", "dy1", "dy2", "S0", "S1", "S2", "i0", "i1", "i2", "j0", "j1", "j2", "k0", "k1", "k2", "x0", "x1", "y0", "y1", "z0", "z1", "sh", "st", "o", "x", "y", "z", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bbinary4d", "arrays", "shapes", "fcn", "dx0", "dx1", "dx2", "dx3", "dy0", "dy1", "dy2", "dy3", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "k0", "k1", "k2", "k3", "x0", "x1", "x2", "y0", "y1", "y2", "z0", "z1", "z2", "sh", "st", "o", "x", "y", "z", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bbinary5d", "arrays", "shapes", "fcn", "dx0", "dx1", "dx2", "dx3", "dx4", "dy0", "dy1", "dy2", "dy3", "dy4", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "k0", "k1", "k2", "k3", "k4", "x0", "x1", "x2", "x3", "y0", "y1", "y2", "y3", "z0", "z1", "z2", "z3", "sh", "st", "o", "x", "y", "z", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bquaternary2d", "arrays", "shapes", "fcn", "dx0", "dx1", "dy0", "dy1", "dz0", "dz1", "dw0", "dw1", "S0", "S1", "i0", "i1", "j0", "j1", "k0", "k1", "m0", "m1", "n0", "n1", "x0", "y0", "z0", "w0", "u0", "sh", "st", "o", "x", "y", "z", "w", "u", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bquinary2d", "arrays", "shapes", "fcn", "dx0", "dx1", "dy0", "dy1", "dz0", "dz1", "dw0", "dw1", "du0", "du1", "S0", "S1", "i0", "i1", "j0", "j1", "k0", "k1", "m0", "m1", "n0", "n1", "p0", "p1", "x0", "y0", "z0", "w0", "u0", "v0", "sh", "st", "o", "x", "y", "z", "w", "u", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bternary2d", "arrays", "shapes", "fcn", "dx0", "dx1", "dy0", "dy1", "dz0", "dz1", "S0", "S1", "i0", "i1", "j0", "j1", "k0", "k1", "m0", "m1", "x0", "y0", "z0", "w0", "sh", "st", "o", "x", "y", "z", "w", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bunary2d", "arrays", "shapes", "fcn", "dx0", "dx1", "S0", "S1", "i0", "i1", "j0", "j1", "x0", "y0", "sh", "st", "o", "x", "y", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bunary3d", "arrays", "shapes", "fcn", "dx0", "dx1", "dx2", "S0", "S1", "S2", "i0", "i1", "i2", "j0", "j1", "j2", "x0", "x1", "y0", "y1", "sh", "st", "o", "x", "y", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bunary4d", "arrays", "shapes", "fcn", "dx0", "dx1", "dx2", "dx3", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "x0", "x1", "x2", "y0", "y1", "y2", "sh", "st", "o", "x", "y", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "broadcastArray", "bunary5d", "arrays", "shapes", "fcn", "dx0", "dx1", "dx2", "dx3", "dx4", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "x0", "x1", "x2", "x3", "y0", "y1", "y2", "y3", "sh", "st", "o", "x", "y", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "pow", "cartesianPower", "x", "n", "get", "out", "tmp", "idx", "len", "N", "i", "j", "k", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "cartesianProduct", "x1", "x2", "get1", "get2", "out", "M", "N", "v", "i", "j", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "cartesianSquare", "x", "get", "out", "N", "v", "i", "j", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "copy", "x", "out", "len", "get", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isnan", "dedupeInPlace", "x", "limit", "count", "prev", "len", "ptr", "v", "i", "dedupeEqualNaNs", "FLG", "dedupe", "equalNaNs", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isComplex128Array", "isComplex64Array", "arraylike2object", "reinterpret128", "reinterpret64", "internal", "x", "i", "internalComplex", "accessors", "data", "get", "every", "obj", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "hasMethod", "obj", "method", "internal", "x", "predicate", "thisArg", "accessors", "data", "get", "i", "everyBy", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "internal", "x", "predicate", "thisArg", "accessors", "data", "get", "i", "everyByRight", "obj", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filledBy", "len", "clbk", "thisArg", "arr", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled", "filled2d", "value", "shape", "arr", "S0", "S1", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled2dBy", "shape", "clbk", "thisArg", "arr", "a0", "S0", "S1", "i", "j", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled", "filled3d", "value", "shape", "out", "a1", "S0", "S1", "S2", "i2", "i1", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled3dBy", "shape", "clbk", "thisArg", "arr", "a0", "a1", "S0", "S1", "S2", "i0", "i1", "i2", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled", "filled4d", "value", "shape", "out", "a1", "a2", "S0", "S1", "S2", "S3", "i1", "i2", "i3", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled4dBy", "shape", "clbk", "thisArg", "arr", "a0", "a1", "a2", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled", "filled5d", "value", "shape", "out", "a1", "a2", "a3", "S0", "S1", "S2", "S3", "S4", "i1", "i2", "i3", "i4", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled5dBy", "shape", "clbk", "thisArg", "arr", "a0", "a1", "a2", "a3", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled", "recurse", "value", "ndims", "shape", "dim", "out", "S", "d", "i", "fillednd", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "recurse", "ndims", "shape", "dim", "indices", "out", "clbk", "thisArg", "idx", "FLG", "S", "d", "i", "filledndBy", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "hasMethod", "obj", "method", "internal", "x", "predicate", "thisArg", "out", "v", "i", "accessors", "data", "get", "filter", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "first", "arr", "get", "require_lib", "__commonJSMin", "exports", "module", "main", "require_assign", "__commonJSMin", "exports", "module", "shape2strides", "vind2bind", "numel", "grev", "zeros", "MODE", "copy", "x", "N", "out", "stride", "offset", "i", "recurseLexicographic", "ndims", "shape", "dim", "FLG", "S", "d", "flattenColexicographic", "len", "tmp", "ord", "sh", "sx", "j", "flatten", "colexicographic", "require_main", "__commonJSMin", "exports", "module", "numel", "zeros", "assign", "flatten", "x", "shape", "colexicographic", "out", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_assign", "__commonJSMin", "exports", "module", "shape2strides", "vind2bind", "numel", "grev", "zeros", "copy", "MODE", "copyBy", "x", "N", "out", "stride", "offset", "clbk", "thisArg", "i", "recurseLexicographic", "orig", "ndims", "shape", "dim", "indices", "FLG", "idx", "S", "d", "flattenColexicographic", "len", "tmp", "ord", "sh", "sx", "j", "flattenBy", "colexicographic", "require_main", "__commonJSMin", "exports", "module", "numel", "zeros", "assign", "flattenBy", "x", "shape", "colexicographic", "clbk", "thisArg", "out", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "flatten2d", "x", "shape", "colexicographic", "out", "S0", "S1", "i0", "i1", "a0", "require_assign", "__commonJSMin", "exports", "module", "flatten2d", "x", "shape", "colexicographic", "out", "stride", "offset", "S0", "S1", "i0", "i1", "a0", "io", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "flatten2dBy", "x", "shape", "colexicographic", "clbk", "thisArg", "out", "S0", "S1", "i0", "i1", "a0", "require_assign", "__commonJSMin", "exports", "module", "flatten2dBy", "x", "shape", "colexicographic", "out", "stride", "offset", "clbk", "thisArg", "S0", "S1", "i0", "i1", "a0", "io", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "flatten3d", "x", "shape", "colexicographic", "out", "S0", "S1", "S2", "i0", "i1", "i2", "a0", "a1", "require_assign", "__commonJSMin", "exports", "module", "flatten3d", "x", "shape", "colexicographic", "out", "stride", "offset", "S0", "S1", "S2", "i0", "i1", "i2", "a0", "a1", "io", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "flatten3dBy", "x", "shape", "colexicographic", "clbk", "thisArg", "out", "S0", "S1", "S2", "i0", "i1", "i2", "a0", "a1", "require_assign", "__commonJSMin", "exports", "module", "flatten3dBy", "x", "shape", "colexicographic", "out", "stride", "offset", "clbk", "thisArg", "S0", "S1", "S2", "i0", "i1", "i2", "a0", "a1", "io", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "flatten4d", "x", "shape", "colexicographic", "out", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "a0", "a1", "a2", "require_assign", "__commonJSMin", "exports", "module", "flatten4d", "x", "shape", "colexicographic", "out", "stride", "offset", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "a0", "a1", "a2", "io", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "flatten4dBy", "x", "shape", "colexicographic", "clbk", "thisArg", "out", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "a0", "a1", "a2", "require_assign", "__commonJSMin", "exports", "module", "flatten4dBy", "x", "shape", "colexicographic", "out", "stride", "offset", "clbk", "thisArg", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "a0", "a1", "a2", "io", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "flatten5d", "x", "shape", "colexicographic", "out", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "a0", "a1", "a2", "a3", "require_assign", "__commonJSMin", "exports", "module", "flatten5d", "x", "shape", "colexicographic", "out", "stride", "offset", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "a0", "a1", "a2", "a3", "io", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "flatten5dBy", "x", "shape", "colexicographic", "clbk", "thisArg", "out", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "a0", "a1", "a2", "a3", "require_assign", "__commonJSMin", "exports", "module", "flatten5dBy", "x", "shape", "colexicographic", "out", "stride", "offset", "clbk", "thisArg", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "a0", "a1", "a2", "a3", "io", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "fliplr2d", "x", "out", "x0", "y0", "i1", "i0", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "fliplr2d", "fliplr3d", "x", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "fliplr3d", "fliplr4d", "x", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "fliplr4d", "fliplr5d", "x", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "flipud2d", "x", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "flipud2d", "flipud3d", "x", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "flipud3d", "flipud4d", "x", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "flipud4d", "flipud5d", "x", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "strided2array", "N", "x", "stride", "offset", "out", "get", "ix", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isArray", "resolveGetter", "groupEntries", "x", "groups", "xget", "gget", "len", "out", "g", "v", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isArray", "resolveGetter", "groupEntriesBy", "x", "indicator", "thisArg", "get", "len", "out", "g", "v", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isArray", "resolveGetter", "groupIndices", "x", "groups", "gget", "len", "out", "g", "o", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isArray", "resolveGetter", "groupIndicesBy", "x", "indicator", "thisArg", "get", "len", "out", "g", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isArray", "resolveGetter", "groupValues", "x", "groups", "xget", "gget", "len", "out", "g", "v", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isArray", "resolveGetter", "groupValuesBy", "x", "indicator", "thisArg", "get", "len", "out", "g", "v", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "ceil", "incrspace", "x1", "x2", "increment", "arr", "len", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "isnan", "hasMethod", "obj", "method", "internal", "x", "searchElement", "fromIndex", "equalNaNs", "i", "accessors", "data", "get", "indexOf", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "last", "arr", "get", "idx", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "isnan", "hasMethod", "obj", "method", "internal", "x", "searchElement", "fromIndex", "equalNaNs", "i", "accessors", "data", "get", "lastIndexOf", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "linspace", "x1", "x2", "len", "arr", "N", "d", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "pow", "logspace", "a", "b", "len", "arr", "N", "d", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "map2d", "x", "shape", "fcn", "thisArg", "S0", "S1", "i0", "i1", "x0", "y0", "y", "require_assign", "__commonJSMin", "exports", "module", "map2d", "x", "y", "shape", "fcn", "thisArg", "S0", "S1", "i0", "i1", "x0", "y0", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "map3d", "x", "shape", "fcn", "thisArg", "S0", "S1", "S2", "i0", "i1", "i2", "x0", "y0", "x1", "y1", "y", "require_assign", "__commonJSMin", "exports", "module", "map3d", "x", "y", "shape", "fcn", "thisArg", "S0", "S1", "S2", "i0", "i1", "i2", "x0", "y0", "x1", "y1", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "map4d", "x", "shape", "fcn", "thisArg", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "x0", "y0", "x1", "y1", "x2", "y2", "y", "require_assign", "__commonJSMin", "exports", "module", "map4d", "x", "y", "shape", "fcn", "thisArg", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "x0", "y0", "x1", "y1", "x2", "y2", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "map5d", "x", "shape", "fcn", "thisArg", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "x0", "y0", "x1", "y1", "x2", "y2", "x3", "y3", "y", "require_assign", "__commonJSMin", "exports", "module", "map5d", "x", "y", "shape", "fcn", "thisArg", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "x0", "y0", "x1", "y1", "x2", "y2", "x3", "y3", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "mskbinary2d", "arrays", "shape", "fcn", "S0", "S1", "i0", "i1", "x0", "y0", "z0", "m0", "x", "y", "z", "m", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "mskfilter", "x", "mask", "xget", "mget", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "mskreject", "x", "mask", "xget", "mget", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "mskunary2d", "arrays", "shape", "fcn", "S0", "S1", "i0", "i1", "x0", "y0", "m0", "x", "y", "m", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "mskunary3d", "arrays", "shape", "fcn", "S0", "S1", "S2", "i0", "i1", "i2", "x0", "x1", "y0", "y1", "m0", "m1", "x", "y", "m", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "nCartesianProduct", "x1", "x2", "nargs", "dims", "arr", "out", "tmp", "arg", "idx", "N", "s", "i", "j", "k", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isComplex128Array", "isComplex64Array", "arraylike2object", "reinterpret128", "reinterpret64", "internal", "x", "i", "accessors", "data", "get", "none", "obj", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "internal", "x", "predicate", "thisArg", "accessors", "data", "get", "i", "noneBy", "obj", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "internal", "x", "predicate", "thisArg", "accessors", "data", "get", "i", "noneByRight", "obj", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "oneTo", "n", "arr", "i", "require_assign", "__commonJSMin", "exports", "module", "isComplex128Array", "isComplex64Array", "arraylike2object", "reinterpret128", "reinterpret64", "indexed", "out", "stride", "offset", "v", "i", "complex", "data", "s", "accessors", "set", "assign", "obj", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "filled", "ones", "len", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled2d", "ones2d", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled3d", "ones3d", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled4d", "ones4d", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled5d", "ones5d", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "fillednd", "onesnd", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "quaternary2d", "arrays", "shape", "fcn", "S0", "S1", "i0", "i1", "x0", "y0", "z0", "w0", "v0", "x", "y", "z", "w", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "quaternary3d", "arrays", "shape", "fcn", "S0", "S1", "S2", "i0", "i1", "i2", "x0", "y0", "z0", "w0", "v0", "x1", "y1", "z1", "w1", "v1", "x", "y", "z", "w", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "quaternary4d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "x0", "y0", "z0", "w0", "v0", "x1", "y1", "z1", "w1", "v1", "x2", "y2", "z2", "w2", "v2", "x", "y", "z", "w", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "quaternary5d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "x0", "y0", "z0", "w0", "v0", "x1", "y1", "z1", "w1", "v1", "x2", "y2", "z2", "w2", "v2", "x3", "y3", "z3", "w3", "v3", "x", "y", "z", "w", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "quinary2d", "arrays", "shape", "fcn", "S0", "S1", "i0", "i1", "x0", "y0", "z0", "w0", "u0", "v0", "x", "y", "z", "w", "u", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "quinary3d", "arrays", "shape", "fcn", "S0", "S1", "S2", "i0", "i1", "i2", "x0", "y0", "z0", "w0", "u0", "v0", "x1", "y1", "z1", "w1", "u1", "v1", "x", "y", "z", "w", "u", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "quinary4d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "x0", "y0", "z0", "w0", "u0", "v0", "x1", "y1", "z1", "w1", "u1", "v1", "x2", "y2", "z2", "w2", "u2", "v2", "x", "y", "z", "w", "u", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "quinary5d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "x0", "y0", "z0", "w0", "u0", "v0", "x1", "y1", "z1", "w1", "u1", "v1", "x2", "y2", "z2", "w2", "u2", "v2", "x3", "y3", "z3", "w3", "u3", "v3", "x", "y", "z", "w", "u", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "internal", "x", "predicate", "thisArg", "out", "v", "i", "accessors", "data", "get", "reject", "obj", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isAccessorArray", "accessorSetter", "setter", "dtype", "resolveSetter", "x", "dt", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "floor", "hasMethod", "obj", "method", "internal", "x", "tmp", "N", "M", "i", "j", "accessors", "data", "get", "set", "reverse", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "arraySlice", "hasMethod", "obj", "method", "builtin", "x", "start", "end", "accessors", "data", "get", "out", "i", "slice", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "strided2array2d", "x", "shape", "strides", "offset", "get", "out", "tmp", "dx0", "dx1", "S0", "S1", "i0", "i1", "ix", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "strided2array3d", "x", "shape", "strides", "offset", "get", "out", "dx0", "dx1", "dx2", "ix1", "ix0", "S0", "S1", "S2", "i0", "i1", "i2", "t2", "t1", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "strided2array4d", "x", "shape", "strides", "offset", "get", "out", "dx0", "dx1", "dx2", "dx3", "ix2", "ix1", "ix0", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "t3", "t2", "t1", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "strided2array5d", "x", "shape", "strides", "offset", "get", "out", "dx0", "dx1", "dx2", "dx3", "dx4", "ix3", "ix2", "ix1", "ix0", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "t4", "t3", "t2", "t1", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "resolveGetter", "take", "x", "indices", "get", "out", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "take", "x", "indices", "out", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "normalizeIndex", "indexFunction", "format", "NDIMS", "take2d", "x", "indices", "dimension", "mode", "lastIndex", "out", "dim", "ind", "idx", "i0", "i1", "x0", "y0", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "normalizeIndex", "indexFunction", "take2d", "format", "NDIMS", "take3d", "x", "indices", "dimension", "mode", "lastIndex", "out", "dim", "ind", "idx", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "ternary2d", "arrays", "shape", "fcn", "S0", "S1", "i0", "i1", "x0", "y0", "z0", "w0", "x", "y", "z", "w", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "ternary3d", "arrays", "shape", "fcn", "S0", "S1", "S2", "i0", "i1", "i2", "x0", "y0", "z0", "w0", "x1", "y1", "z1", "w1", "x", "y", "z", "w", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "ternary4d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "x0", "y0", "z0", "w0", "x1", "y1", "z1", "w1", "x2", "y2", "z2", "w2", "x", "y", "z", "w", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "ternary5d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "x0", "y0", "z0", "w0", "x1", "y1", "z1", "w1", "x2", "y2", "z2", "w2", "x3", "y3", "z3", "w3", "x", "y", "z", "w", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isAccessorArray", "AccessorArray", "toAccessorArray", "arr", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isnan", "dedupeCopy", "x", "limit", "count", "prev", "len", "out", "v", "i", "dedupeEqualNaNs", "FLG", "dedupe", "equalNaNs", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "arraylike2object", "hasMethod", "obj", "method", "internal", "x", "out", "i", "accessors", "data", "get", "toReversed", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "unary2d", "arrays", "shape", "fcn", "S0", "S1", "i0", "i1", "x0", "y0", "x", "y", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "unary2dBy", "arrays", "shape", "fcn", "clbk", "thisArg", "S0", "S1", "i0", "i1", "x0", "y0", "x", "y", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "unary3d", "arrays", "shape", "fcn", "S0", "S1", "S2", "i0", "i1", "i2", "x0", "x1", "y0", "y1", "x", "y", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "unary4d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "i0", "i1", "i2", "i3", "x0", "x1", "x2", "y0", "y1", "y2", "x", "y", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "unary5d", "arrays", "shape", "fcn", "S0", "S1", "S2", "S3", "S4", "i0", "i1", "i2", "i3", "i4", "x0", "x1", "x2", "x3", "y0", "y1", "y2", "y3", "x", "y", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "recurse", "x", "y", "ndims", "shape", "dim", "fcn", "S", "d", "i", "unarynd", "arrays", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "unitspace", "x1", "x2", "arr", "len", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "zeroTo", "n", "arr", "i", "require_assign", "__commonJSMin", "exports", "module", "isComplex128Array", "isComplex64Array", "arraylike2object", "reinterpret128", "reinterpret64", "indexed", "out", "stride", "offset", "v", "i", "complex", "data", "s", "accessors", "set", "assign", "obj", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "filled2d", "zeros2d", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled3d", "zeros3d", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled4d", "zeros4d", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "filled5d", "zeros5d", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "fillednd", "zerosnd", "shape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "ns", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasArrayBufferSupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "isCollection", "isNonNegativeInteger", "base", "format", "cartesianPower", "x", "n", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isCollection", "base", "format", "cartesianProduct", "x1", "x2", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isCollection", "base", "format", "cartesianSquare", "x", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Float64Array", "Float32Array", "Int16Array", "Int32Array", "Int8Array", "Uint16Array", "Uint32Array", "Uint8Array", "Uint8ClampedArray", "Complex64Array", "Complex128Array", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isCollection", "getType", "ctors", "reinterpret128", "reinterpret64", "format", "gcopy", "copy", "isComplex64", "dtype", "isComplex128", "convert", "x", "isc64", "ctor", "xbuf", "obuf", "out", "len", "t", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "getType", "convert", "format", "convertSame", "x", "y", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "require_lib", "__commonJSMin", "exports", "module", "hasDataViewSupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "hasOwnProp", "isInteger", "isString", "isObject", "format", "floor", "round", "ceil", "timestamp", "rounders", "validDate", "value", "name", "type", "datespace", "start", "stop", "length", "options", "opts", "len", "flg", "arr", "end", "fcn", "tmp", "d", "i", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "defaults", "require_get", "__commonJSMin", "exports", "module", "defaults", "DEFAULTS", "HASH", "get", "name", "v", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "get", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "replace", "DTYPES", "RE_SUFFIX", "dtypes", "kind", "out", "FLG", "require_lib", "__commonJSMin", "exports", "module", "main", "require_is_buffer_uint8array", "__commonJSMin", "exports", "module", "allocUnsafe", "isUint8Array", "check", "buf", "require_ctors", "__commonJSMin", "exports", "module", "Float64Array", "Float32Array", "Int16Array", "Int32Array", "Int8Array", "Uint16Array", "Uint32Array", "Uint8Array", "Uint8ClampedArray", "Complex64Array", "Complex128Array", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isNonNegativeInteger", "allocUnsafe", "ctors", "zeros", "bytesPerElement", "defaults", "format", "DEFAULT_DTYPE", "empty", "length", "nbytes", "offset", "dtype", "ctor", "buf", "out", "nb", "require_main", "__commonJSMin", "exports", "module", "isNonNegativeInteger", "ctors", "gzeros", "defaults", "format", "DEFAULT_DTYPE", "zeros", "length", "dtype", "ctor", "require_lib", "__commonJSMin", "exports", "module", "main", "require_polyfill", "__commonJSMin", "exports", "module", "zeros", "empty", "length", "require_lib", "__commonJSMin", "exports", "module", "isBufferUint8Array", "main", "polyfill", "empty", "require_main", "__commonJSMin", "exports", "module", "dtype", "empty", "format", "emptyLike", "x", "dt", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isString", "isNonNegativeInteger", "isCollection", "isArrayBuffer", "isObject", "isFunction", "ctors", "gfill", "filled", "hasIteratorSymbolSupport", "ITERATOR_SYMBOL", "iterLength", "defaults", "format", "HAS_ITERATOR_SYMBOL", "DEFAULT_DTYPE", "filledIterator", "it", "value", "arr", "v", "filledAccessors", "i", "filledarray", "nargs", "dtype", "ctor", "len", "arg", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isString", "isNonNegativeInteger", "isCollection", "isArrayBuffer", "isObject", "isFunction", "ctors", "gfillBy", "filledArray", "hasIteratorSymbolSupport", "ITERATOR_SYMBOL", "iterLength", "defaults", "format", "HAS_ITERATOR_SYMBOL", "DEFAULT_DTYPE", "filledArrayIterator", "it", "clbk", "thisArg", "arr", "i", "v", "filledAccessors", "filledarrayBy", "nargs", "dtype", "ctor", "len", "arg", "callback", "value", "aidx", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isFunction", "isCollection", "isIteratorLike", "isAccessorArray", "accessorSetter", "setter", "dtype", "format", "iterator2array", "iterator", "thisArg", "fcn", "out", "len", "set", "dt", "i", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isNonNegativeInteger", "ctors", "afill", "gfill", "defaults", "format", "DEFAULT_DTYPE", "full", "length", "value", "dtype", "ctor", "out", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "format", "dtype", "full", "Complex128", "Complex64", "fullLike", "x", "value", "dt", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "ceil", "isNumber", "isnan", "format", "MAX_LENGTH", "gen", "incrspace", "x1", "x2", "increment", "len", "inc", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Float64Array", "Float32Array", "Complex128Array", "Complex64Array", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_generic_real", "__commonJSMin", "exports", "module", "linspace", "start", "stop", "len", "endpoint", "arr", "N", "d", "i", "require_generic_complex", "__commonJSMin", "exports", "module", "Complex64", "Complex128", "real", "imag", "realf", "imagf", "linspace", "dt1", "start", "dt2", "stop", "len", "endpoint", "cmplx", "isf32", "arr", "re1", "re2", "im1", "im2", "re", "im", "dr", "di", "N", "i", "require_typed_real", "__commonJSMin", "exports", "module", "linspace", "out", "start", "stop", "len", "endpoint", "N", "d", "i", "require_typed_complex", "__commonJSMin", "exports", "module", "real", "imag", "realf", "imagf", "linspace", "out", "dt1", "start", "dt2", "stop", "len", "endpoint", "re1", "re2", "im1", "im2", "dr", "di", "N", "i", "j", "require_validate", "__commonJSMin", "exports", "module", "isObject", "hasOwnProp", "isString", "isBoolean", "format", "validate", "opts", "options", "require_defaults", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "isComplexLike", "isNumber", "isNonNegativeInteger", "isnan", "dtype", "ctors", "reinterpret64", "reinterpret128", "DEFAULTS", "format", "genreal", "gencmplx", "typedreal", "typedcmplx", "validate", "defaults", "DEFAULT_COMPLEX_DTYPE", "linspace", "start", "stop", "len", "opts", "ctor", "err", "out", "dt1", "dt2", "flg", "require_accessors_complex", "__commonJSMin", "exports", "module", "Complex64", "Complex128", "real", "imag", "realf", "imagf", "linspace", "out", "dt1", "start", "dt2", "stop", "len", "endpoint", "cmplx", "isf32", "re1", "re2", "im1", "im2", "set", "buf", "re", "im", "dr", "di", "N", "i", "require_accessors_real", "__commonJSMin", "exports", "module", "linspace", "out", "start", "stop", "len", "endpoint", "buf", "set", "N", "d", "i", "require_assign", "__commonJSMin", "exports", "module", "isComplexLike", "isNumber", "isCollection", "format", "isnan", "dtype", "adtype", "reinterpret64", "reinterpret128", "arraylike2object", "acccmplx", "accreal", "typedcmplx", "typedreal", "validate", "defaults", "linspace", "start", "stop", "out", "opts", "err", "dt1", "dt2", "flg", "odt", "o", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "assign", "require_main", "__commonJSMin", "exports", "module", "isNumber", "isNonNegativeInteger", "format", "isnan", "gen", "logspace", "a", "b", "len", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isInteger", "isNegativeZero", "isComplexLike", "PINF", "NINF", "FLOAT32_SMALLEST_SUBNORMAL", "FLOAT32_MAX_SAFE_INTEGER", "FLOAT32_MIN_SAFE_INTEGER", "INT8_MIN", "INT16_MIN", "INT32_MIN", "UINT8_MAX", "UINT16_MAX", "UINT32_MAX", "minFloatDataType", "value", "minDataType", "require_lib", "__commonJSMin", "exports", "module", "minDataType", "require_main", "__commonJSMin", "exports", "module", "contains", "Complex128", "Complex64", "full", "defaults", "dtypes", "format", "Z128", "Z64", "DTYPES", "isValidDType", "DEFAULT_DTYPE", "nans", "length", "dtype", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "dtype", "full", "Complex128", "Complex64", "format", "Z128", "Z64", "DTYPES", "nansLike", "x", "dt", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_next_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "objectKeys", "hasOwnProp", "NEXT_DTYPES", "generateTable", "dtypes", "ntypes", "out", "nextDataType", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isNonNegativeInteger", "base", "zeros", "defaults", "format", "DEFAULT_DTYPE", "oneTo", "n", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "oneTo", "dtype", "format", "oneToLike", "x", "dt", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "Complex128", "Complex64", "full", "defaults", "Z128", "Z64", "DEFAULT_DTYPE", "ones", "length", "dtype", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "dtype", "full", "Complex128", "Complex64", "format", "Z128", "Z64", "onesLike", "x", "dt", "v", "require_lib", "__commonJSMin", "exports", "module", "main", "require_defaults", "__commonJSMin", "exports", "module", "defaults", "require_validate", "__commonJSMin", "exports", "module", "isObject", "hasOwnProp", "isNonNegativeInteger", "format", "validate", "opts", "options", "require_pool", "__commonJSMin", "exports", "module", "pool", "n", "out", "i", "require_bytes_per_element", "__commonJSMin", "exports", "module", "require_factory", "__commonJSMin", "exports", "module", "isString", "isNonNegativeInteger", "isCollection", "isTypedArrayLike", "isArrayBuffer", "isComplex64Array", "isComplex128Array", "setReadOnly", "setReadOnlyAccessor", "ctors", "reinterpret64", "reinterpret128", "accessors", "adtype", "ARRAY_DEFAULTS", "format", "ArrayBuffer", "ceil", "floor", "ceil2", "log2", "min", "defaults", "validate", "createPool", "BYTES_PER_ELEMENT", "DEFAULT_DTYPE", "Complex64Array", "Complex128Array", "isCmplx64Array", "arr", "isCmplx128Array", "factory", "options", "nbytes", "pool", "opts", "err", "malloc", "calloc", "free", "clear", "getBytes", "arraybuffer", "n", "buf", "i", "typedarray", "ctor", "len", "dtype", "nargs", "out", "set", "get", "tmp", "p", "require_main", "__commonJSMin", "exports", "module", "factory", "typedarraypool", "require_lib", "__commonJSMin", "exports", "module", "setReadOnly", "main", "factory", "require_promotion_rules", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "objectKeys", "hasOwnProp", "PROMOTION_RULES", "generateFullTable", "dtypes", "ntypes", "out", "tmp", "dt1", "dt2", "o", "j", "i", "promotionRules", "dtype1", "dtype2", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Float64Array", "Float32Array", "Int16Array", "Int32Array", "Int8Array", "Uint16Array", "Uint32Array", "Uint8Array", "Uint8ClampedArray", "Complex64Array", "Complex128Array", "ctors", "require_main", "__commonJSMin", "exports", "module", "isArray", "ctors", "reviveTypedArray", "key", "value", "ctor", "require_lib", "__commonJSMin", "exports", "module", "main", "require_safe_casts", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "objectKeys", "hasOwnProp", "SAFE_CASTS", "TABLE", "generateFullTable", "dtypes", "ntypes", "out", "tmp", "dt1", "dt2", "o", "j", "i", "generateTable", "safeCasts", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_same_kind_casts", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "objectKeys", "hasOwnProp", "SAME_KIND_CASTS", "TABLE", "generateFullTable", "dtypes", "ntypes", "out", "tmp", "dt1", "dt2", "o", "j", "i", "generateTable", "sameKindCasts", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isArrayLikeObject", "format", "recurse", "shape", "arr", "v", "check", "ndims", "d", "flg", "len", "i", "arrayShape", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "ctor", "require_polyfill", "__commonJSMin", "exports", "module", "polyfill", "size", "require_lib", "__commonJSMin", "exports", "module", "hasSharedArrayBufferSupport", "builtin", "polyfill", "ctor", "require_main", "__commonJSMin", "exports", "module", "isCollection", "isInteger", "base", "format", "slice", "x", "start", "end", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "hasOwnProp", "isFunction", "isCollection", "isObject", "isNonNegativeInteger", "isAccessorArray", "iteratorSymbol", "accessorGetter", "getter", "dtype", "format", "circarray2iterator", "src", "thisArg", "options", "count", "opts", "iter", "FLG", "fcn", "get", "dt", "i", "next1a", "next1b", "next2a", "next2b", "end", "factory", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isFunction", "isCollection", "isAccessorArray", "iteratorSymbol", "accessorGetter", "getter", "dtype", "format", "array2iterator", "src", "thisArg", "iter", "FLG", "fcn", "get", "dt", "i", "next1", "next2", "end", "factory", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isFunction", "isCollection", "isAccessorArray", "iteratorSymbol", "accessorGetter", "getter", "dtype", "format", "array2iteratorRight", "src", "thisArg", "iter", "FLG", "fcn", "len", "get", "dt", "i", "next1", "next2", "end", "factory", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Int8Array", "Uint8Array", "Uint8ClampedArray", "Int16Array", "Uint16Array", "Int32Array", "Uint32Array", "Float32Array", "Float64Array", "Complex64Array", "Complex128Array", "CTORS", "require_type", "__commonJSMin", "exports", "module", "instanceOf", "ctorName", "getPrototypeOf", "CTORS", "typeName", "arr", "v", "i", "require_main", "__commonJSMin", "exports", "module", "isTypedArray", "isComplexTypedArray", "reinterpret64", "reinterpret128", "format", "typeName", "typedarray2json", "arr", "data", "out", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isFunction", "isCollection", "isAccessorArray", "iteratorSymbol", "accessorGetter", "getter", "dtype", "format", "sparsearray2iterator", "src", "thisArg", "iter", "FLG", "fcn", "get", "dt", "i", "next1", "next2", "end", "factory", "len", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isFunction", "isCollection", "isAccessorArray", "iteratorSymbol", "accessorGetter", "getter", "dtype", "format", "sparsearray2iteratorRight", "src", "thisArg", "iter", "FLG", "fcn", "len", "get", "dt", "i", "next1", "next2", "end", "factory", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isFunction", "isCollection", "isNonNegativeInteger", "isInteger", "isAccessorArray", "iteratorSymbol", "accessorGetter", "getter", "dtype", "format", "stridedarray2iterator", "N", "src", "stride", "offset", "thisArg", "iter", "FLG", "fcn", "idx", "get", "dt", "i", "next1", "next2", "end", "factory", "v", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isFunction", "isCollection", "isInteger", "isAccessorArray", "iteratorSymbol", "accessorGetter", "getter", "dtype", "format", "arrayview2iterator", "src", "thisArg", "begin", "nargs", "iter", "FLG", "fcn", "end", "get", "dt", "i", "next1", "next2", "finish", "factory", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isFunction", "isCollection", "isInteger", "isAccessorArray", "iteratorSymbol", "accessorGetter", "getter", "dtype", "format", "arrayview2iteratorRight", "src", "thisArg", "begin", "nargs", "iter", "FLG", "fcn", "end", "get", "dt", "i", "next1", "next2", "finish", "factory", "value", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isString", "ctors", "reinterpret128", "reinterpret64", "defaults", "format", "DEFAULT_DTYPE", "Complex64Array", "Complex128Array", "typedarray", "nargs", "dtype", "ctor", "arg", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Complex128Array", "Complex64Array", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isString", "ctors", "defaults", "format", "DEFAULT_DTYPE", "complexarray", "nargs", "dtype", "ctor", "require_lib", "__commonJSMin", "exports", "module", "main", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "DTYPES", "dtypes", "require_lib", "__commonJSMin", "exports", "module", "main", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "DTYPES", "dtypes", "require_lib", "__commonJSMin", "exports", "module", "main", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "DTYPES", "dtypes", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Int16Array", "Int32Array", "Int8Array", "Uint16Array", "Uint32Array", "Uint8Array", "Uint8ClampedArray", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "DTYPES", "dtypes", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isString", "ctors", "defaults", "format", "DEFAULT_DTYPE", "realarray", "nargs", "dtype", "ctor", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Float64Array", "Float32Array", "Int16Array", "Int32Array", "Int8Array", "Uint16Array", "Uint32Array", "Uint8Array", "Uint8ClampedArray", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "DTYPES", "dtypes", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Float64Array", "Float32Array", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "DTYPES", "dtypes", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Int16Array", "Int32Array", "Int8Array", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "DTYPES", "dtypes", "require_lib", "__commonJSMin", "exports", "module", "main", "require_ctors", "__commonJSMin", "exports", "module", "Uint16Array", "Uint32Array", "Uint8Array", "Uint8ClampedArray", "ctors", "require_main", "__commonJSMin", "exports", "module", "table", "ctors", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_dtypes", "__commonJSMin", "exports", "module", "require_main", "__commonJSMin", "exports", "module", "DTYPES", "dtypes", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "isNonNegativeInteger", "base", "zeros", "defaults", "format", "DEFAULT_DTYPE", "zeroTo", "n", "dtype", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "zeroTo", "dtype", "format", "zeroToLike", "x", "dt", "require_lib", "__commonJSMin", "exports", "module", "main", "require_main", "__commonJSMin", "exports", "module", "format", "dtype", "zeros", "zerosLike", "x", "dt", "require_lib", "__commonJSMin", "exports", "module", "main", "setReadOnly", "ns"]
-}
diff --git a/test/dist/test.js b/test/dist/test.js
deleted file mode 100644
index a8a9c60f..00000000
--- a/test/dist/test.js
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2023 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-
-'use strict';
-
-// MODULES //
-
-var tape = require( 'tape' );
-var main = require( './../../dist' );
-
-
-// TESTS //
-
-tape( 'main export is defined', function test( t ) {
-	t.ok( true, __filename );
-	t.strictEqual( main !== void 0, true, 'main export is defined' );
-	t.end();
-});