@milaboratories/miplots4 1.0.157 → 1.0.158

package/dist/node_modules/@stdlib/blas-base-gcopy/lib/accessors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"accessors.js","sources":["../../../../../node_modules/@stdlib/blas-base-gcopy/lib/accessors.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// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @private\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array<Function>} x.accessors - array element accessors\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - starting `x` index\n* @param {Object} y - output array object\n* @param {Collection} y.data - output array data\n* @param {Array<Function>} y.accessors - array element accessors\n* @param {integer} strideY - `y` stride length\n* @param {NonNegativeInteger} offsetY - starting `y` index\n* @returns {Object} output array object\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var reinterpret64 = require( '@stdlib/strided-base-reinterpret-complex64' );\n*\n* function setter( data, idx, value ) {\n*     data.set( value, idx );\n* }\n*\n* function getter( data, idx ) {\n*     return data.get( idx );\n* }\n*\n* var x = {\n*     'data': new Complex64Array( [ 1.0, 2.0, 3.0, 4.0 ] ),\n*     'accessors': [ getter, setter ]\n* };\n*\n* var y = {\n*     'data': new Complex64Array( [ 5.0, 6.0, 7.0, 8.0 ] ),\n*     'accessors': [ getter, setter ]\n* };\n*\n* gcopy( x.data.length, x, 1, 0, y, 1, 0 );\n*\n* var view = reinterpret64( y.data, 0 );\n* // view => <Float32Array>[ 1.0, 2.0, 3.0, 4.0 ]\n*/\nfunction gcopy( N, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar set;\n\tvar get;\n\tvar ix;\n\tvar iy;\n\tvar i;\n\n\t// Cache references to array data:\n\txbuf = x.data;\n\tybuf = y.data;\n\n\t// Cache a reference to the element accessors:\n\tget = x.accessors[ 0 ];\n\tset = y.accessors[ 1 ];\n\n\tix = offsetX;\n\tiy = offsetY;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tset( ybuf, iy, get( xbuf, ix ) );\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcopy;\n"],"names":["gcopy","N","x","strideX","offsetX","y","strideY","offsetY","xbuf","ybuf","set","get","ix","iy","i","accessors"],"mappings":";;;;;;;;;;;;;;;;;AAmEA,SAASA,EAAOC,GAAGC,GAAGC,GAASC,GAASC,GAAGC,GAASC,GAAU;AAC7D,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAYJ,OATAN,IAAON,EAAE,MACTO,IAAOJ,EAAE,MAGTM,IAAMT,EAAE,UAAW,CAAC,GACpBQ,IAAML,EAAE,UAAW,CAAC,GAEpBO,IAAKR,GACLS,IAAKN,GACCO,IAAI,GAAGA,IAAIb,GAAGa;AACnB,IAAAJ,EAAKD,GAAMI,GAAIF,EAAKH,GAAMI,CAAE,CAAE,GAC9BA,KAAMT,GACNU,KAAMP;AAEP,SAAOJ;AACR;AAKA,IAAAa,IAAiBf;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-base-gcopy/lib/index.js

@@ -1,27 +0,0 @@
-import { l as r } from "../../utils-define-nonenumerable-read-only-property/lib/index.js";
-import { m } from "./main.js";
-import { n as i } from "./ndarray.js";
-/**
-* @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.
-*/
-var n = r, a = m, o = i;
-n(a, "ndarray", o);
-var d = a;
-export {
-  d as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@stdlib/blas-base-gcopy/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/@stdlib/blas-base-gcopy/lib/index.js"],"sourcesContent":["/**\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* BLAS level 1 routine to copy values from `x` into `y`.\n*\n* @module @stdlib/blas-base-gcopy\n*\n* @example\n* var gcopy = require( '@stdlib/blas-base-gcopy' );\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, y, 1 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*\n* @example\n* var gcopy = require( '@stdlib/blas-base-gcopy' );\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy.ndarray( x.length, x, 1, 0, y, 1, 0 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["setReadOnly","require$$0","main","require$$1","ndarray","require$$2","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;AA8CA,IAAIA,IAAcC,GACdC,IAAOC,GACPC,IAAUC;AAKdL,EAAaE,GAAM,WAAWE,CAAO;AAKrC,IAAAE,IAAiBJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-base-gcopy/lib/main.js

@@ -1,45 +0,0 @@
-import { l as p } from "../../array-base-arraylike2object/lib/index.js";
-import { a as b } from "./accessors.js";
-/**
-* @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.
-*/
-var s = p, P = b, u = 8;
-function g(f, o, c, a, v) {
-  var l, e, i, n, m, r;
-  if (f <= 0)
-    return a;
-  if (i = s(o), n = s(a), i.accessorProtocol || n.accessorProtocol)
-    return c < 0 ? l = (1 - f) * c : l = 0, v < 0 ? e = (1 - f) * v : e = 0, P(f, i, c, l, n, v, e), n.data;
-  if (c === 1 && v === 1) {
-    if (m = f % u, m > 0)
-      for (r = 0; r < m; r++)
-        a[r] = o[r];
-    if (f < u)
-      return a;
-    for (r = m; r < f; r += u)
-      a[r] = o[r], a[r + 1] = o[r + 1], a[r + 2] = o[r + 2], a[r + 3] = o[r + 3], a[r + 4] = o[r + 4], a[r + 5] = o[r + 5], a[r + 6] = o[r + 6], a[r + 7] = o[r + 7];
-    return a;
-  }
-  for (c < 0 ? l = (1 - f) * c : l = 0, v < 0 ? e = (1 - f) * v : e = 0, r = 0; r < f; r++)
-    a[e] = o[l], l += c, e += v;
-  return a;
-}
-var t = g;
-export {
-  t as m
-};
-//# sourceMappingURL=main.js.map

package/dist/node_modules/@stdlib/blas-base-gcopy/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../node_modules/@stdlib/blas-base-gcopy/lib/main.js"],"sourcesContent":["/**\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 arraylike2object = require( '@stdlib/array-base-arraylike2object' );\nvar accessors = require( './accessors.js' );\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {Collection} y - output array\n* @param {integer} strideY - `y` stride length\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, y, 1 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\nfunction gcopy( N, x, strideX, y, strideY ) {\n\tvar ix;\n\tvar iy;\n\tvar ox;\n\tvar oy;\n\tvar m;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn y;\n\t}\n\tox = arraylike2object( x );\n\toy = arraylike2object( y );\n\tif ( ox.accessorProtocol || oy.accessorProtocol ) {\n\t\tif ( strideX < 0 ) {\n\t\t\tix = (1-N) * strideX;\n\t\t} else {\n\t\t\tix = 0;\n\t\t}\n\t\tif ( strideY < 0 ) {\n\t\t\tiy = (1-N) * strideY;\n\t\t} else {\n\t\t\tiy = 0;\n\t\t}\n\t\taccessors( N, ox, strideX, ix, oy, strideY, iy );\n\t\treturn oy.data;\n\t}\n\t// Use unrolled loops if both strides are equal to `1`...\n\tif ( strideX === 1 && strideY === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\ty[ i ] = x[ i ];\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn y;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\ty[ i ] = x[ i ];\n\t\t\ty[ i+1 ] = x[ i+1 ];\n\t\t\ty[ i+2 ] = x[ i+2 ];\n\t\t\ty[ i+3 ] = x[ i+3 ];\n\t\t\ty[ i+4 ] = x[ i+4 ];\n\t\t\ty[ i+5 ] = x[ i+5 ];\n\t\t\ty[ i+6 ] = x[ i+6 ];\n\t\t\ty[ i+7 ] = x[ i+7 ];\n\t\t}\n\t\treturn y;\n\t}\n\tif ( strideX < 0 ) {\n\t\tix = (1-N) * strideX;\n\t} else {\n\t\tix = 0;\n\t}\n\tif ( strideY < 0 ) {\n\t\tiy = (1-N) * strideY;\n\t} else {\n\t\tiy = 0;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\ty[ iy ] = x[ ix ];\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcopy;\n"],"names":["arraylike2object","require$$0","accessors","require$$1","M","gcopy","N","x","strideX","y","strideY","ix","iy","ox","oy","i","main"],"mappings":";;;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAmBC,GACnBC,IAAYC,GAKZC,IAAI;AAsBR,SAASC,EAAOC,GAAGC,GAAGC,GAASC,GAAGC,GAAU;AAC3C,MAAIC,GACAC,GACAC,GACAC,GACA,GACAC;AAEJ,MAAKT,KAAK;AACT,WAAOG;AAIR,MAFAI,IAAKb,EAAkBO,CAAC,GACxBO,IAAKd,EAAkBS,CAAC,GACnBI,EAAG,oBAAoBC,EAAG;AAC9B,WAAKN,IAAU,IACdG,KAAM,IAAEL,KAAKE,IAEbG,IAAK,GAEDD,IAAU,IACdE,KAAM,IAAEN,KAAKI,IAEbE,IAAK,GAENV,EAAWI,GAAGO,GAAIL,GAASG,GAAIG,GAAIJ,GAASE,CAAE,GACvCE,EAAG;AAGX,MAAKN,MAAY,KAAKE,MAAY,GAAI;AAIrC,QAHA,IAAIJ,IAAIF,GAGH,IAAI;AACR,WAAMW,IAAI,GAAGA,IAAI,GAAGA;AACnB,QAAAN,EAAGM,CAAC,IAAKR,EAAGQ,CAAC;AAGf,QAAKT,IAAIF;AACR,aAAOK;AAER,SAAMM,IAAI,GAAGA,IAAIT,GAAGS,KAAKX;AACxB,MAAAK,EAAGM,CAAC,IAAKR,EAAGQ,CAAC,GACbN,EAAGM,IAAE,CAAC,IAAKR,EAAGQ,IAAE,CAAC,GACjBN,EAAGM,IAAE,CAAC,IAAKR,EAAGQ,IAAE,CAAC,GACjBN,EAAGM,IAAE,CAAC,IAAKR,EAAGQ,IAAE,CAAC,GACjBN,EAAGM,IAAE,CAAC,IAAKR,EAAGQ,IAAE,CAAC,GACjBN,EAAGM,IAAE,CAAC,IAAKR,EAAGQ,IAAE,CAAC,GACjBN,EAAGM,IAAE,CAAC,IAAKR,EAAGQ,IAAE,CAAC,GACjBN,EAAGM,IAAE,CAAC,IAAKR,EAAGQ,IAAE,CAAC;AAElB,WAAON;AAAA,EACT;AAWC,OAVKD,IAAU,IACdG,KAAM,IAAEL,KAAKE,IAEbG,IAAK,GAEDD,IAAU,IACdE,KAAM,IAAEN,KAAKI,IAEbE,IAAK,GAEAG,IAAI,GAAGA,IAAIT,GAAGS;AACnB,IAAAN,EAAGG,CAAE,IAAKL,EAAGI,CAAE,GACfA,KAAMH,GACNI,KAAMF;AAEP,SAAOD;AACR;AAKA,IAAAO,IAAiBX;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-base-gcopy/lib/ndarray.js

@@ -1,45 +0,0 @@
-import { l as b } from "../../array-base-arraylike2object/lib/index.js";
-import { a as P } from "./accessors.js";
-/**
-* @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.
-*/
-var p = b, g = P, f = 8;
-function j(n, c, i, t, r, u, e) {
-  var a, o, s, l, m, v;
-  if (n <= 0)
-    return r;
-  if (s = p(c), l = p(r), s.accessorProtocol || l.accessorProtocol)
-    return g(n, s, i, t, l, u, e), l.data;
-  if (a = t, o = e, i === 1 && u === 1) {
-    if (m = n % f, m > 0)
-      for (v = 0; v < m; v++)
-        r[o] = c[a], a += i, o += u;
-    if (n < f)
-      return r;
-    for (v = m; v < n; v += f)
-      r[o] = c[a], r[o + 1] = c[a + 1], r[o + 2] = c[a + 2], r[o + 3] = c[a + 3], r[o + 4] = c[a + 4], r[o + 5] = c[a + 5], r[o + 6] = c[a + 6], r[o + 7] = c[a + 7], a += f, o += f;
-    return r;
-  }
-  for (v = 0; v < n; v++)
-    r[o] = c[a], a += i, o += u;
-  return r;
-}
-var $ = j;
-export {
-  $ as n
-};
-//# sourceMappingURL=ndarray.js.map

package/dist/node_modules/@stdlib/blas-base-gcopy/lib/ndarray.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ndarray.js","sources":["../../../../../node_modules/@stdlib/blas-base-gcopy/lib/ndarray.js"],"sourcesContent":["/**\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 arraylike2object = require( '@stdlib/array-base-arraylike2object' );\nvar accessors = require( './accessors.js' );\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - starting `x` index\n* @param {Collection} y - output array\n* @param {integer} strideY - `y` stride length\n* @param {NonNegativeInteger} offsetY - starting `y` index\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, 0, y, 1, 0 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\nfunction gcopy( N, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar ix;\n\tvar iy;\n\tvar ox;\n\tvar oy;\n\tvar m;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn y;\n\t}\n\tox = arraylike2object( x );\n\toy = arraylike2object( y );\n\tif ( ox.accessorProtocol || oy.accessorProtocol ) {\n\t\taccessors( N, ox, strideX, offsetX, oy, strideY, offsetY );\n\t\treturn oy.data;\n\t}\n\tix = offsetX;\n\tiy = offsetY;\n\n\t// Use unrolled loops if both strides are equal to `1`...\n\tif ( strideX === 1 && strideY === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\ty[ iy ] = x[ ix ];\n\t\t\t\tix += strideX;\n\t\t\t\tiy += strideY;\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn y;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\ty[ iy ] = x[ ix ];\n\t\t\ty[ iy+1 ] = x[ ix+1 ];\n\t\t\ty[ iy+2 ] = x[ ix+2 ];\n\t\t\ty[ iy+3 ] = x[ ix+3 ];\n\t\t\ty[ iy+4 ] = x[ ix+4 ];\n\t\t\ty[ iy+5 ] = x[ ix+5 ];\n\t\t\ty[ iy+6 ] = x[ ix+6 ];\n\t\t\ty[ iy+7 ] = x[ ix+7 ];\n\t\t\tix += M;\n\t\t\tiy += M;\n\t\t}\n\t\treturn y;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\ty[ iy ] = x[ ix ];\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcopy;\n"],"names":["arraylike2object","require$$0","accessors","require$$1","M","gcopy","N","x","strideX","offsetX","y","strideY","offsetY","ix","iy","ox","oy","i","ndarray"],"mappings":";;;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAmBC,GACnBC,IAAYC,GAKZC,IAAI;AAwBR,SAASC,EAAOC,GAAGC,GAAGC,GAASC,GAASC,GAAGC,GAASC,GAAU;AAC7D,MAAIC,GACAC,GACAC,GACAC,GACA,GACAC;AAEJ,MAAKX,KAAK;AACT,WAAOI;AAIR,MAFAK,IAAKf,EAAkBO,CAAC,GACxBS,IAAKhB,EAAkBU,CAAC,GACnBK,EAAG,oBAAoBC,EAAG;AAC9B,WAAAd,EAAWI,GAAGS,GAAIP,GAASC,GAASO,GAAIL,GAASC,CAAO,GACjDI,EAAG;AAMX,MAJAH,IAAKJ,GACLK,IAAKF,GAGAJ,MAAY,KAAKG,MAAY,GAAI;AAIrC,QAHA,IAAIL,IAAIF,GAGH,IAAI;AACR,WAAMa,IAAI,GAAGA,IAAI,GAAGA;AACnB,QAAAP,EAAGI,CAAE,IAAKP,EAAGM,CAAE,GACfA,KAAML,GACNM,KAAMH;AAGR,QAAKL,IAAIF;AACR,aAAOM;AAER,SAAMO,IAAI,GAAGA,IAAIX,GAAGW,KAAKb;AACxB,MAAAM,EAAGI,CAAE,IAAKP,EAAGM,CAAE,GACfH,EAAGI,IAAG,CAAC,IAAKP,EAAGM,IAAG,CAAC,GACnBH,EAAGI,IAAG,CAAC,IAAKP,EAAGM,IAAG,CAAC,GACnBH,EAAGI,IAAG,CAAC,IAAKP,EAAGM,IAAG,CAAC,GACnBH,EAAGI,IAAG,CAAC,IAAKP,EAAGM,IAAG,CAAC,GACnBH,EAAGI,IAAG,CAAC,IAAKP,EAAGM,IAAG,CAAC,GACnBH,EAAGI,IAAG,CAAC,IAAKP,EAAGM,IAAG,CAAC,GACnBH,EAAGI,IAAG,CAAC,IAAKP,EAAGM,IAAG,CAAC,GACnBA,KAAMT,GACNU,KAAMV;AAEP,WAAOM;AAAA,EACT;AACC,OAAMO,IAAI,GAAGA,IAAIX,GAAGW;AACnB,IAAAP,EAAGI,CAAE,IAAKP,EAAGM,CAAE,GACfA,KAAML,GACNM,KAAMH;AAEP,SAAOD;AACR;AAKA,IAAAQ,IAAiBb;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/index.js

@@ -1,27 +0,0 @@
-import { l as r } from "../../utils-define-nonenumerable-read-only-property/lib/index.js";
-import { m } from "./main.js";
-import { n as i } from "./ndarray.js";
-/**
-* @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.
-*/
-var n = r, a = m, o = i;
-n(a, "ndarray", o);
-var d = a;
-export {
-  d as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/index.js"],"sourcesContent":["/**\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* Add a constant to each strided array element and compute the sum using pairwise summation.\n*\n* @module @stdlib/blas-ext-base-gapxsumpw\n*\n* @example\n* var gapxsumpw = require( '@stdlib/blas-ext-base-gapxsumpw' );\n*\n* var x = [ 1.0, -2.0, 2.0 ];\n* var N = x.length;\n*\n* var v = gapxsumpw( N, 5.0, x, 1 );\n* // returns 16.0\n*\n* @example\n* var floor = require( '@stdlib/math-base-special-floor' );\n* var gapxsumpw = require( '@stdlib/blas-ext-base-gapxsumpw' );\n*\n* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];\n* var N = floor( x.length / 2 );\n*\n* var v = gapxsumpw.ndarray( N, 5.0, x, 2, 1 );\n* // returns 25.0\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["setReadOnly","require$$0","main","require$$1","ndarray","require$$2","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;AA+CA,IAAIA,IAAcC,GACdC,IAAOC,GACPC,IAAUC;AAKdL,EAAaE,GAAM,WAAWE,CAAO;AAKrC,IAAAE,IAAiBJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/main.js

@@ -1,37 +0,0 @@
-import { n as o } from "./ndarray.js";
-/**
-* @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.
-*/
-var v = o;
-function e(r, f, u, n) {
-  var a, m, i;
-  if (r <= 0)
-    return 0;
-  if (r === 1 || n === 0)
-    return f + u[0];
-  if (n < 0 ? a = (1 - r) * n : a = 0, r < 8) {
-    for (m = 0, i = 0; i < r; i++)
-      m += f + u[a], a += n;
-    return m;
-  }
-  return v(r, f, u, n, a);
-}
-var p = e;
-export {
-  p as m
-};
-//# sourceMappingURL=main.js.map

package/dist/node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/main.js"],"sourcesContent":["/**\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 sum = require( './ndarray.js' );\n\n\n// MAIN //\n\n/**\n* Adds a constant to each strided array element and computes the sum using pairwise summation.\n*\n* ## Method\n*\n* -   This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`.\n*\n* ## References\n*\n* -   Higham, Nicholas J. 1993. \"The Accuracy of Floating Point Summation.\" _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050).\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} alpha - constant\n* @param {NumericArray} x - input array\n* @param {integer} stride - stride length\n* @returns {number} sum\n*\n* @example\n* var x = [ 1.0, -2.0, 2.0 ];\n* var N = x.length;\n*\n* var v = gapxsumpw( N, 5.0, x, 1 );\n* // returns 16.0\n*/\nfunction gapxsumpw( N, alpha, x, stride ) {\n\tvar ix;\n\tvar s;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn 0.0;\n\t}\n\tif ( N === 1 || stride === 0 ) {\n\t\treturn alpha + x[ 0 ];\n\t}\n\tif ( stride < 0 ) {\n\t\tix = (1-N) * stride;\n\t} else {\n\t\tix = 0;\n\t}\n\tif ( N < 8 ) {\n\t\t// Use simple summation...\n\t\ts = 0.0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\ts += alpha + x[ ix ];\n\t\t\tix += stride;\n\t\t}\n\t\treturn s;\n\t}\n\treturn sum( N, alpha, x, stride, ix );\n}\n\n\n// EXPORTS //\n\nmodule.exports = gapxsumpw;\n"],"names":["sum","require$$0","gapxsumpw","N","alpha","x","stride","ix","s","main"],"mappings":";;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAMC;AA6BV,SAASC,EAAWC,GAAGC,GAAOC,GAAGC,GAAS;AACzC,MAAIC,GACAC,GACA;AAEJ,MAAKL,KAAK;AACT,WAAO;AAER,MAAKA,MAAM,KAAKG,MAAW;AAC1B,WAAOF,IAAQC,EAAG,CAAC;AAOpB,MALKC,IAAS,IACbC,KAAM,IAAEJ,KAAKG,IAEbC,IAAK,GAEDJ,IAAI,GAAI;AAGZ,SADAK,IAAI,GACE,IAAI,GAAG,IAAIL,GAAG;AACnB,MAAAK,KAAKJ,IAAQC,EAAGE,CAAE,GAClBA,KAAMD;AAEP,WAAOE;AAAA,EACT;AACC,SAAOR,EAAKG,GAAGC,GAAOC,GAAGC,GAAQC,CAAE;AACpC;AAKA,IAAAE,IAAiBP;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/ndarray.js

@@ -1,44 +0,0 @@
-import { l as O } from "../../math-base-special-floor/lib/index.js";
-/**
-* @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.
-*/
-var S = O, Z = 128;
-function K(o, n, f, r, L) {
-  var v, c, g, w, y, B, C, E, I, M, m, b, u;
-  if (o <= 0)
-    return 0;
-  if (o === 1 || r === 0)
-    return n + f[L];
-  if (v = L, o < 8) {
-    for (m = 0, u = 0; u < o; u++)
-      m += n + f[v], v += r;
-    return m;
-  }
-  if (o <= Z) {
-    for (c = n + f[v], g = n + f[v + r], w = n + f[v + 2 * r], y = n + f[v + 3 * r], B = n + f[v + 4 * r], C = n + f[v + 5 * r], E = n + f[v + 6 * r], I = n + f[v + 7 * r], v += 8 * r, M = o % 8, u = 8; u < o - M; u += 8)
-      c += n + f[v], g += n + f[v + r], w += n + f[v + 2 * r], y += n + f[v + 3 * r], B += n + f[v + 4 * r], C += n + f[v + 5 * r], E += n + f[v + 6 * r], I += n + f[v + 7 * r], v += 8 * r;
-    for (m = c + g + (w + y) + (B + C + (E + I)), u; u < o; u++)
-      m += n + f[v], v += r;
-    return m;
-  }
-  return b = S(o / 2), b -= b % 8, K(b, n, f, r, v) + K(o - b, n, f, r, v + b * r);
-}
-var k = K;
-export {
-  k as n
-};
-//# sourceMappingURL=ndarray.js.map

package/dist/node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/ndarray.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ndarray.js","sources":["../../../../../node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/ndarray.js"],"sourcesContent":["/**\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 floor = require( '@stdlib/math-base-special-floor' );\n\n\n// VARIABLES //\n\n// Blocksize for pairwise summation (NOTE: decreasing the blocksize decreases rounding error as more pairs are summed, but also decreases performance. Because the inner loop is unrolled eight times, the blocksize is effectively `16`.):\nvar BLOCKSIZE = 128;\n\n\n// MAIN //\n\n/**\n* Adds a constant to each strided array element and computes the sum using pairwise summation.\n*\n* ## Method\n*\n* -   This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`.\n*\n* ## References\n*\n* -   Higham, Nicholas J. 1993. \"The Accuracy of Floating Point Summation.\" _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050).\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {number} alpha - constant\n* @param {NumericArray} x - input array\n* @param {integer} stride - stride length\n* @param {NonNegativeInteger} offset - starting index\n* @returns {number} sum\n*\n* @example\n* var floor = require( '@stdlib/math-base-special-floor' );\n*\n* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];\n* var N = floor( x.length / 2 );\n*\n* var v = gapxsumpw( N, 5.0, x, 2, 1 );\n* // returns 25.0\n*/\nfunction gapxsumpw( N, alpha, x, stride, offset ) {\n\tvar ix;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar M;\n\tvar s;\n\tvar n;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn 0.0;\n\t}\n\tif ( N === 1 || stride === 0 ) {\n\t\treturn alpha + x[ offset ];\n\t}\n\tix = offset;\n\tif ( N < 8 ) {\n\t\t// Use simple summation...\n\t\ts = 0.0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\ts += alpha + x[ ix ];\n\t\t\tix += stride;\n\t\t}\n\t\treturn s;\n\t}\n\tif ( N <= BLOCKSIZE ) {\n\t\t// Sum a block with 8 accumulators (by loop unrolling, we lower the effective blocksize to 16)...\n\t\ts0 = alpha + x[ ix ];\n\t\ts1 = alpha + x[ ix+stride ];\n\t\ts2 = alpha + x[ ix+(2*stride) ];\n\t\ts3 = alpha + x[ ix+(3*stride) ];\n\t\ts4 = alpha + x[ ix+(4*stride) ];\n\t\ts5 = alpha + x[ ix+(5*stride) ];\n\t\ts6 = alpha + x[ ix+(6*stride) ];\n\t\ts7 = alpha + x[ ix+(7*stride) ];\n\t\tix += 8 * stride;\n\n\t\tM = N % 8;\n\t\tfor ( i = 8; i < N-M; i += 8 ) {\n\t\t\ts0 += alpha + x[ ix ];\n\t\t\ts1 += alpha + x[ ix+stride ];\n\t\t\ts2 += alpha + x[ ix+(2*stride) ];\n\t\t\ts3 += alpha + x[ ix+(3*stride) ];\n\t\t\ts4 += alpha + x[ ix+(4*stride) ];\n\t\t\ts5 += alpha + x[ ix+(5*stride) ];\n\t\t\ts6 += alpha + x[ ix+(6*stride) ];\n\t\t\ts7 += alpha + x[ ix+(7*stride) ];\n\t\t\tix += 8 * stride;\n\t\t}\n\t\t// Pairwise sum the accumulators:\n\t\ts = ((s0+s1) + (s2+s3)) + ((s4+s5) + (s6+s7));\n\n\t\t// Clean-up loop...\n\t\tfor ( i; i < N; i++ ) {\n\t\t\ts += alpha + x[ ix ];\n\t\t\tix += stride;\n\t\t}\n\t\treturn s;\n\t}\n\t// Recurse by dividing by two, but avoiding non-multiples of unroll factor...\n\tn = floor( N/2 );\n\tn -= n % 8;\n\treturn gapxsumpw( n, alpha, x, stride, ix ) + gapxsumpw( N-n, alpha, x, stride, ix+(n*stride) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = gapxsumpw;\n"],"names":["floor","require$$0","BLOCKSIZE","gapxsumpw","N","alpha","x","stride","offset","ix","s0","s1","s2","s3","s4","s5","s6","s7","s","n","i","ndarray"],"mappings":";;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAQC,GAMRC,IAAY;AAgChB,SAASC,EAAWC,GAAGC,GAAOC,GAAGC,GAAQC,GAAS;AACjD,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACA,GACAC,GACAC,GACAC;AAEJ,MAAKhB,KAAK;AACT,WAAO;AAER,MAAKA,MAAM,KAAKG,MAAW;AAC1B,WAAOF,IAAQC,EAAGE,CAAM;AAGzB,MADAC,IAAKD,GACAJ,IAAI,GAAI;AAGZ,SADAc,IAAI,GACEE,IAAI,GAAGA,IAAIhB,GAAGgB;AACnB,MAAAF,KAAKb,IAAQC,EAAGG,CAAE,GAClBA,KAAMF;AAEP,WAAOW;AAAA,EACT;AACC,MAAKd,KAAKF,GAAY;AAarB,SAXAQ,IAAKL,IAAQC,EAAGG,CAAE,GAClBE,IAAKN,IAAQC,EAAGG,IAAGF,CAAM,GACzBK,IAAKP,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC7BM,IAAKR,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC7BO,IAAKT,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC7BQ,IAAKV,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC7BS,IAAKX,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC7BU,IAAKZ,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC7BE,KAAM,IAAIF,GAEV,IAAIH,IAAI,GACFgB,IAAI,GAAGA,IAAIhB,IAAE,GAAGgB,KAAK;AAC1B,MAAAV,KAAML,IAAQC,EAAGG,CAAE,GACnBE,KAAMN,IAAQC,EAAGG,IAAGF,CAAM,GAC1BK,KAAMP,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC9BM,KAAMR,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC9BO,KAAMT,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC9BQ,KAAMV,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC9BS,KAAMX,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC9BU,KAAMZ,IAAQC,EAAGG,IAAI,IAAEF,CAAO,GAC9BE,KAAM,IAAIF;AAMX,SAHAW,IAAMR,IAAGC,KAAOC,IAAGC,MAASC,IAAGC,KAAOC,IAAGC,KAGnCG,GAAGA,IAAIhB,GAAGgB;AACf,MAAAF,KAAKb,IAAQC,EAAGG,CAAE,GAClBA,KAAMF;AAEP,WAAOW;AAAA,EACT;AAEC,SAAAC,IAAInB,EAAOI,IAAE,CAAC,GACde,KAAKA,IAAI,GACFhB,EAAWgB,GAAGd,GAAOC,GAAGC,GAAQE,CAAE,IAAKN,EAAWC,IAAEe,GAAGd,GAAOC,GAAGC,GAAQE,IAAIU,IAAEZ;AACvF;AAKA,IAAAc,IAAiBlB;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-ext-base-gsumpw/lib/index.js

@@ -1,27 +0,0 @@
-import { l as r } from "../../utils-define-nonenumerable-read-only-property/lib/index.js";
-import { m } from "./main.js";
-import { n as i } from "./ndarray.js";
-/**
-* @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.
-*/
-var n = r, a = m, o = i;
-n(a, "ndarray", o);
-var d = a;
-export {
-  d as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@stdlib/blas-ext-base-gsumpw/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/@stdlib/blas-ext-base-gsumpw/lib/index.js"],"sourcesContent":["/**\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* Compute the sum of strided array elements using pairwise summation.\n*\n* @module @stdlib/blas-ext-base-gsumpw\n*\n* @example\n* var gsumpw = require( '@stdlib/blas-ext-base-gsumpw' );\n*\n* var x = [ 1.0, -2.0, 2.0 ];\n* var N = x.length;\n*\n* var v = gsumpw( N, x, 1 );\n* // returns 1.0\n*\n* @example\n* var floor = require( '@stdlib/math-base-special-floor' );\n* var gsumpw = require( '@stdlib/blas-ext-base-gsumpw' );\n*\n* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];\n* var N = floor( x.length / 2 );\n*\n* var v = gsumpw.ndarray( N, x, 2, 1 );\n* // returns 5.0\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["setReadOnly","require$$0","main","require$$1","ndarray","require$$2","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;AA+CA,IAAIA,IAAcC,GACdC,IAAOC,GACPC,IAAUC;AAKdL,EAAaE,GAAM,WAAWE,CAAO;AAKrC,IAAAE,IAAiBJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-ext-base-gsumpw/lib/main.js

@@ -1,37 +0,0 @@
-import { n as i } from "./ndarray.js";
-/**
-* @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.
-*/
-var o = i;
-function v(r, f, a) {
-  var n, u, m;
-  if (r <= 0)
-    return 0;
-  if (r === 1 || a === 0)
-    return f[0];
-  if (a < 0 ? n = (1 - r) * a : n = 0, r < 8) {
-    for (u = 0, m = 0; m < r; m++)
-      u += f[n], n += a;
-    return u;
-  }
-  return o(r, f, a, n);
-}
-var p = v;
-export {
-  p as m
-};
-//# sourceMappingURL=main.js.map

package/dist/node_modules/@stdlib/blas-ext-base-gsumpw/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../node_modules/@stdlib/blas-ext-base-gsumpw/lib/main.js"],"sourcesContent":["/**\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 sum = require( './ndarray.js' );\n\n\n// MAIN //\n\n/**\n* Computes the sum of strided array elements using pairwise summation.\n*\n* ## Method\n*\n* -   This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`.\n*\n* ## References\n*\n* -   Higham, Nicholas J. 1993. \"The Accuracy of Floating Point Summation.\" _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050).\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {NumericArray} x - input array\n* @param {integer} stride - stride length\n* @returns {number} sum\n*\n* @example\n* var x = [ 1.0, -2.0, 2.0 ];\n* var N = x.length;\n*\n* var v = gsumpw( N, x, 1 );\n* // returns 1.0\n*/\nfunction gsumpw( N, x, stride ) {\n\tvar ix;\n\tvar s;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn 0.0;\n\t}\n\tif ( N === 1 || stride === 0 ) {\n\t\treturn x[ 0 ];\n\t}\n\tif ( stride < 0 ) {\n\t\tix = (1-N) * stride;\n\t} else {\n\t\tix = 0;\n\t}\n\tif ( N < 8 ) {\n\t\t// Use simple summation...\n\t\ts = 0.0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\ts += x[ ix ];\n\t\t\tix += stride;\n\t\t}\n\t\treturn s;\n\t}\n\treturn sum( N, x, stride, ix );\n}\n\n\n// EXPORTS //\n\nmodule.exports = gsumpw;\n"],"names":["sum","require$$0","gsumpw","N","x","stride","ix","s","i","main"],"mappings":";;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAMC;AA4BV,SAASC,EAAQC,GAAGC,GAAGC,GAAS;AAC/B,MAAIC,GACAC,GACAC;AAEJ,MAAKL,KAAK;AACT,WAAO;AAER,MAAKA,MAAM,KAAKE,MAAW;AAC1B,WAAOD,EAAG,CAAC;AAOZ,MALKC,IAAS,IACbC,KAAM,IAAEH,KAAKE,IAEbC,IAAK,GAEDH,IAAI,GAAI;AAGZ,SADAI,IAAI,GACEC,IAAI,GAAGA,IAAIL,GAAGK;AACnB,MAAAD,KAAKH,EAAGE,CAAE,GACVA,KAAMD;AAEP,WAAOE;AAAA,EACT;AACC,SAAOP,EAAKG,GAAGC,GAAGC,GAAQC,CAAE;AAC7B;AAKA,IAAAG,IAAiBP;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/blas-ext-base-gsumpw/lib/ndarray.js

@@ -1,44 +0,0 @@
-import { l as I } from "../../math-base-special-floor/lib/index.js";
-/**
-* @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.
-*/
-var K = I, L = 128;
-function B(n, r, v, C) {
-  var a, l, m, p, b, c, g, w, y, E, o, u, f;
-  if (n <= 0)
-    return 0;
-  if (n === 1 || v === 0)
-    return r[C];
-  if (a = C, n < 8) {
-    for (o = 0, f = 0; f < n; f++)
-      o += r[a], a += v;
-    return o;
-  }
-  if (n <= L) {
-    for (l = r[a], m = r[a + v], p = r[a + 2 * v], b = r[a + 3 * v], c = r[a + 4 * v], g = r[a + 5 * v], w = r[a + 6 * v], y = r[a + 7 * v], a += 8 * v, E = n % 8, f = 8; f < n - E; f += 8)
-      l += r[a], m += r[a + v], p += r[a + 2 * v], b += r[a + 3 * v], c += r[a + 4 * v], g += r[a + 5 * v], w += r[a + 6 * v], y += r[a + 7 * v], a += 8 * v;
-    for (o = l + m + (p + b) + (c + g + (w + y)), f; f < n; f++)
-      o += r[a], a += v;
-    return o;
-  }
-  return u = K(n / 2), u -= u % 8, B(u, r, v, a) + B(n - u, r, v, a + u * v);
-}
-var O = B;
-export {
-  O as n
-};
-//# sourceMappingURL=ndarray.js.map

package/dist/node_modules/@stdlib/blas-ext-base-gsumpw/lib/ndarray.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ndarray.js","sources":["../../../../../node_modules/@stdlib/blas-ext-base-gsumpw/lib/ndarray.js"],"sourcesContent":["/**\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 floor = require( '@stdlib/math-base-special-floor' );\n\n\n// VARIABLES //\n\n// Blocksize for pairwise summation (NOTE: decreasing the blocksize decreases rounding error as more pairs are summed, but also decreases performance. Because the inner loop is unrolled eight times, the blocksize is effectively `16`.):\nvar BLOCKSIZE = 128;\n\n\n// MAIN //\n\n/**\n* Computes the sum of strided array elements using pairwise summation.\n*\n* ## Method\n*\n* -   This implementation uses pairwise summation, which accrues rounding error `O(log2 N)` instead of `O(N)`. The recursion depth is also `O(log2 N)`.\n*\n* ## References\n*\n* -   Higham, Nicholas J. 1993. \"The Accuracy of Floating Point Summation.\" _SIAM Journal on Scientific Computing_ 14 (4): 783–99. doi:[10.1137/0914050](https://doi.org/10.1137/0914050).\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {NumericArray} x - input array\n* @param {integer} stride - stride length\n* @param {NonNegativeInteger} offset - starting index\n* @returns {number} sum\n*\n* @example\n* var floor = require( '@stdlib/math-base-special-floor' );\n*\n* var x = [ 2.0, 1.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];\n* var N = floor( x.length / 2 );\n*\n* var v = gsumpw( N, x, 2, 1 );\n* // returns 5.0\n*/\nfunction gsumpw( N, x, stride, offset ) {\n\tvar ix;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar M;\n\tvar s;\n\tvar n;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn 0.0;\n\t}\n\tif ( N === 1 || stride === 0 ) {\n\t\treturn x[ offset ];\n\t}\n\tix = offset;\n\tif ( N < 8 ) {\n\t\t// Use simple summation...\n\t\ts = 0.0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\ts += x[ ix ];\n\t\t\tix += stride;\n\t\t}\n\t\treturn s;\n\t}\n\tif ( N <= BLOCKSIZE ) {\n\t\t// Sum a block with 8 accumulators (by loop unrolling, we lower the effective blocksize to 16)...\n\t\ts0 = x[ ix ];\n\t\ts1 = x[ ix+stride ];\n\t\ts2 = x[ ix+(2*stride) ];\n\t\ts3 = x[ ix+(3*stride) ];\n\t\ts4 = x[ ix+(4*stride) ];\n\t\ts5 = x[ ix+(5*stride) ];\n\t\ts6 = x[ ix+(6*stride) ];\n\t\ts7 = x[ ix+(7*stride) ];\n\t\tix += 8 * stride;\n\n\t\tM = N % 8;\n\t\tfor ( i = 8; i < N-M; i += 8 ) {\n\t\t\ts0 += x[ ix ];\n\t\t\ts1 += x[ ix+stride ];\n\t\t\ts2 += x[ ix+(2*stride) ];\n\t\t\ts3 += x[ ix+(3*stride) ];\n\t\t\ts4 += x[ ix+(4*stride) ];\n\t\t\ts5 += x[ ix+(5*stride) ];\n\t\t\ts6 += x[ ix+(6*stride) ];\n\t\t\ts7 += x[ ix+(7*stride) ];\n\t\t\tix += 8 * stride;\n\t\t}\n\t\t// Pairwise sum the accumulators:\n\t\ts = ((s0+s1) + (s2+s3)) + ((s4+s5) + (s6+s7));\n\n\t\t// Clean-up loop...\n\t\tfor ( i; i < N; i++ ) {\n\t\t\ts += x[ ix ];\n\t\t\tix += stride;\n\t\t}\n\t\treturn s;\n\t}\n\t// Recurse by dividing by two, but avoiding non-multiples of unroll factor...\n\tn = floor( N/2 );\n\tn -= n % 8;\n\treturn gsumpw( n, x, stride, ix ) + gsumpw( N-n, x, stride, ix+(n*stride) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = gsumpw;\n"],"names":["floor","require$$0","BLOCKSIZE","gsumpw","N","x","stride","offset","ix","s0","s1","s2","s3","s4","s5","s6","s7","M","s","n","i","ndarray"],"mappings":";;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAQC,GAMRC,IAAY;AA+BhB,SAASC,EAAQC,GAAGC,GAAGC,GAAQC,GAAS;AACvC,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,MAAKhB,KAAK;AACT,WAAO;AAER,MAAKA,MAAM,KAAKE,MAAW;AAC1B,WAAOD,EAAGE,CAAM;AAGjB,MADAC,IAAKD,GACAH,IAAI,GAAI;AAGZ,SADAc,IAAI,GACEE,IAAI,GAAGA,IAAIhB,GAAGgB;AACnB,MAAAF,KAAKb,EAAGG,CAAE,GACVA,KAAMF;AAEP,WAAOY;AAAA,EACT;AACC,MAAKd,KAAKF,GAAY;AAarB,SAXAO,IAAKJ,EAAGG,CAAE,GACVE,IAAKL,EAAGG,IAAGF,CAAM,GACjBK,IAAKN,EAAGG,IAAI,IAAEF,CAAO,GACrBM,IAAKP,EAAGG,IAAI,IAAEF,CAAO,GACrBO,IAAKR,EAAGG,IAAI,IAAEF,CAAO,GACrBQ,IAAKT,EAAGG,IAAI,IAAEF,CAAO,GACrBS,IAAKV,EAAGG,IAAI,IAAEF,CAAO,GACrBU,IAAKX,EAAGG,IAAI,IAAEF,CAAO,GACrBE,KAAM,IAAIF,GAEVW,IAAIb,IAAI,GACFgB,IAAI,GAAGA,IAAIhB,IAAEa,GAAGG,KAAK;AAC1B,MAAAX,KAAMJ,EAAGG,CAAE,GACXE,KAAML,EAAGG,IAAGF,CAAM,GAClBK,KAAMN,EAAGG,IAAI,IAAEF,CAAO,GACtBM,KAAMP,EAAGG,IAAI,IAAEF,CAAO,GACtBO,KAAMR,EAAGG,IAAI,IAAEF,CAAO,GACtBQ,KAAMT,EAAGG,IAAI,IAAEF,CAAO,GACtBS,KAAMV,EAAGG,IAAI,IAAEF,CAAO,GACtBU,KAAMX,EAAGG,IAAI,IAAEF,CAAO,GACtBE,KAAM,IAAIF;AAMX,SAHAY,IAAMT,IAAGC,KAAOC,IAAGC,MAASC,IAAGC,KAAOC,IAAGC,KAGnCI,GAAGA,IAAIhB,GAAGgB;AACf,MAAAF,KAAKb,EAAGG,CAAE,GACVA,KAAMF;AAEP,WAAOY;AAAA,EACT;AAEC,SAAAC,IAAInB,EAAOI,IAAE,CAAC,GACde,KAAKA,IAAI,GACFhB,EAAQgB,GAAGd,GAAGC,GAAQE,CAAE,IAAKL,EAAQC,IAAEe,GAAGd,GAAGC,GAAQE,IAAIW,IAAEb,CAAO;AAC1E;AAKA,IAAAe,IAAiBlB;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/boolean-ctor/lib/index.js

@@ -1,23 +0,0 @@
-import { m as a } from "./main.js";
-/**
-* @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.
-*/
-var m = a, i = m;
-export {
-  i as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@stdlib/boolean-ctor/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/@stdlib/boolean-ctor/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/**\n* Boolean constructor.\n*\n* @module @stdlib/boolean-ctor\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n*\n* var b = Boolean( null );\n* // returns false\n*\n* b = Boolean( [] );\n* // returns true\n*\n* b = Boolean( {} );\n* // returns true\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n*\n* var b = new Boolean( false );\n* // returns <Boolean>\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["main","require$$0","lib"],"mappings":";;;;;;;;;;;;;;;;;;AA8CA,IAAIA,IAAOC,GAKXC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/boolean-ctor/lib/main.js

@@ -1,22 +0,0 @@
-/**
-* @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.
-*/
-var a = Boolean, o = a;
-export {
-  o as m
-};
-//# sourceMappingURL=main.js.map

package/dist/node_modules/@stdlib/boolean-ctor/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../node_modules/@stdlib/boolean-ctor/lib/main.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// MAIN //\n\n/**\n* Returns a boolean.\n*\n* @name Boolean\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {(boolean|Boolean)} boolean\n*\n* @example\n* var b = Boolean( null );\n* // returns false\n*\n* b = Boolean( [] );\n* // returns true\n*\n* b = Boolean( {} );\n* // returns true\n*\n* @example\n* var b = new Boolean( false );\n* // returns <Boolean>\n*/\nvar Bool = Boolean; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = Bool;\n"],"names":["Bool","main"],"mappings":";;;;;;;;;;;;;;;;;AA6CA,IAAIA,IAAO,SAKXC,IAAiBD;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/complex-float32/lib/index.js

@@ -1,23 +0,0 @@
-import { m as a } from "./main.js";
-/**
-* @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.
-*/
-var m = a, i = m;
-export {
-  i as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@stdlib/complex-float32/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/@stdlib/complex-float32/lib/index.js"],"sourcesContent":["/**\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 constructor.\n*\n* @module @stdlib/complex-float32\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var z = new Complex64( 5.0, 3.0 );\n* // returns <Complex64>\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["main","require$$0","lib"],"mappings":";;;;;;;;;;;;;;;;;;AAkCA,IAAIA,IAAOC,GAKXC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/complex-float32/lib/main.js

@@ -1,54 +0,0 @@
-import { l as m } from "../../assert-is-number/lib/index.js";
-import { l as s } from "../../utils-define-property/lib/index.js";
-import { l as p } from "../../utils-define-nonenumerable-read-only-property/lib/index.js";
-import { l as f } from "../../number-float64-base-to-float32/lib/index.js";
-import { l as u } from "../../string-format/lib/index.js";
-import { t as b } from "./tostring.js";
-import { t as v } from "./tojson.js";
-/**
-* @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.
-*/
-var a = m.isPrimitive, i = s, t = p, n = f, l = u, E = b, y = v;
-function r(e, o) {
-  if (!(this instanceof r))
-    throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");
-  if (!a(e))
-    throw new TypeError(l("invalid argument. Real component must be a number. Value: `%s`.", e));
-  if (!a(o))
-    throw new TypeError(l("invalid argument. Imaginary component must be a number. Value: `%s`.", o));
-  return i(this, "re", {
-    configurable: !1,
-    enumerable: !0,
-    writable: !1,
-    value: n(e)
-  }), i(this, "im", {
-    configurable: !1,
-    enumerable: !0,
-    writable: !1,
-    value: n(o)
-  }), this;
-}
-t(r, "BYTES_PER_ELEMENT", 4);
-t(r.prototype, "BYTES_PER_ELEMENT", 4);
-t(r.prototype, "byteLength", 8);
-t(r.prototype, "toString", E);
-t(r.prototype, "toJSON", y);
-var N = r;
-export {
-  N as m
-};
-//# sourceMappingURL=main.js.map

package/dist/node_modules/@stdlib/complex-float32/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../node_modules/@stdlib/complex-float32/lib/main.js"],"sourcesContent":["/**\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 defineProperty = require( '@stdlib/utils-define-property' );\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar float64ToFloat32 = require( '@stdlib/number-float64-base-to-float32' );\nvar format = require( '@stdlib/string-format' );\nvar toStr = require( './tostring.js' );\nvar toJSON = require( './tojson.js' );\n\n\n// MAIN //\n\n/**\n* 64-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex64} 64-bit complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n* // returns <Complex64>\n*/\nfunction Complex64( real, imag ) {\n\tif ( !( this instanceof Complex64 ) ) {\n\t\tthrow new TypeError( 'invalid invocation. Constructor must be called with the `new` keyword.' );\n\t}\n\tif ( !isNumber( real ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Real component must be a number. Value: `%s`.', real ) );\n\t}\n\tif ( !isNumber( imag ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Imaginary component must be a number. Value: `%s`.', imag ) );\n\t}\n\tdefineProperty( this, 're', {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': float64ToFloat32( real )\n\t});\n\tdefineProperty( this, 'im', {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': float64ToFloat32( imag )\n\t});\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var nbytes = Complex64.BYTES_PER_ELEMENT;\n* // returns 4\n*/\nsetReadOnly( Complex64, 'BYTES_PER_ELEMENT', 4 );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64.prototype\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var nbytes = z.BYTES_PER_ELEMENT;\n* // returns 4\n*/\nsetReadOnly( Complex64.prototype, 'BYTES_PER_ELEMENT', 4 );\n\n/**\n* Length (in bytes) of a complex number.\n*\n* @name byteLength\n* @memberof Complex64.prototype\n* @type {integer}\n* @returns {integer} byte length\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var nbytes = z.byteLength;\n* // returns 8\n*/\nsetReadOnly( Complex64.prototype, 'byteLength', 8 );\n\n/**\n* Serializes a complex number as a string.\n*\n* @name toString\n* @memberof Complex64.prototype\n* @type {Function}\n* @returns {string} serialized complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var str = z.toString();\n* // returns '5 + 3i'\n*/\nsetReadOnly( Complex64.prototype, 'toString', toStr );\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* ## Notes\n*\n* -   `JSON.stringify()` implicitly calls this method when stringifying a `Complex64` instance.\n*\n* @name toJSON\n* @memberof Complex64.prototype\n* @type {Function}\n* @returns {Object} serialized complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var obj = z.toJSON();\n* // returns { 'type': 'Complex64', 're': 5.0, 'im': 3.0 }\n*/\nsetReadOnly( Complex64.prototype, 'toJSON', toJSON );\n\n\n// EXPORTS //\n\nmodule.exports = Complex64;\n"],"names":["isNumber","require$$0","defineProperty","require$$1","setReadOnly","require$$2","float64ToFloat32","require$$3","format","require$$4","toStr","require$$5","toJSON","require$$6","Complex64","real","imag","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAWC,EAAsC,aACjDC,IAAiBC,GACjBC,IAAcC,GACdC,IAAmBC,GACnBC,IAASC,GACTC,IAAQC,GACRC,IAASC;AAoBb,SAASC,EAAWC,GAAMC,GAAO;AAChC,MAAK,EAAG,gBAAgBF;AACvB,UAAM,IAAI,UAAW,wEAAwE;AAE9F,MAAK,CAACd,EAAUe;AACf,UAAM,IAAI,UAAWP,EAAQ,mEAAmEO,CAAI,CAAE;AAEvG,MAAK,CAACf,EAAUgB;AACf,UAAM,IAAI,UAAWR,EAAQ,wEAAwEQ,CAAI,CAAE;AAE5G,SAAAd,EAAgB,MAAM,MAAM;AAAA,IAC3B,cAAgB;AAAA,IAChB,YAAc;AAAA,IACd,UAAY;AAAA,IACZ,OAASI,EAAkBS,CAAI;AAAA,EACjC,CAAE,GACDb,EAAgB,MAAM,MAAM;AAAA,IAC3B,cAAgB;AAAA,IAChB,YAAc;AAAA,IACd,UAAY;AAAA,IACZ,OAASI,EAAkBU,CAAI;AAAA,EACjC,CAAE,GACM;AACR;AAcAZ,EAAaU,GAAW,qBAAqB,CAAC;AAgB9CV,EAAaU,EAAU,WAAW,qBAAqB,CAAC;AAgBxDV,EAAaU,EAAU,WAAW,cAAc,CAAC;AAgBjDV,EAAaU,EAAU,WAAW,YAAYJ,CAAK;AAoBnDN,EAAaU,EAAU,WAAW,UAAUF,CAAM;AAKlD,IAAAK,IAAiBH;","x_google_ignoreList":[0]}