@milaboratories/graph-maker 1.1.175 → 1.1.177

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/assert-tools-array-function/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/assert-tools-array-function/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 isArray = require( '@stdlib/assert-is-array' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array function\n*\n* @example\n* var isOdd = require( '@stdlib/assert-is-odd' );\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arrayfcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arrayfcn( predicate ) {\n\tif ( typeof predicate !== 'function' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', predicate ) );\n\t}\n\treturn every;\n\n\t/**\n\t* Tests if every element in an array passes a test condition.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating whether a value is an array for which all elements pass a test condition\n\t*/\n\tfunction every( value ) {\n\t\tvar len;\n\t\tvar i;\n\t\tif ( !isArray( value ) ) {\n\t\t\treturn false;\n\t\t}\n\t\tlen = value.length;\n\t\tif ( len === 0 ) {\n\t\t\treturn false;\n\t\t}\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( predicate( value[ i ] ) === false ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = arrayfcn;\n"],"names":["isArray","require$$0","format","require$$1","arrayfcn","predicate","every","value","len","i","main"],"mappings":";;;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAUC,GACVC,IAASC;AA0Bb,SAASC,EAAUC,GAAY;AAC9B,MAAK,OAAOA,KAAc;AACzB,UAAM,IAAI,UAAWH,EAAQ,2DAA2DG,CAAS,CAAE;AAEpG,SAAOC;AASP,WAASA,EAAOC,GAAQ;AACvB,QAAIC,GACAC;AAKJ,QAJK,CAACT,EAASO,CAAAA,MAGfC,IAAMD,EAAM,QACPC,MAAQ;AACZ,aAAO;AAER,SAAMC,IAAI,GAAGA,IAAID,GAAKC;AACrB,UAAKJ,EAAWE,EAAOE,CAAC,CAAE,MAAO;AAChC,eAAO;AAGT,WAAO;AAAA,EACT;AACA;AAKA,IAAAC,IAAiBN;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/assert-tools-array-like-function/lib/index.js

@@ -1,23 +0,0 @@
-import { m } 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 r = m, o = r;
-export {
-  o as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/assert-tools-array-like-function/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/assert-tools-array-like-function/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* Return a function which tests if every element in an array-like object passes a test condition.\n*\n* @module @stdlib/assert-tools-array-like-function\n*\n* @example\n* var isOdd = require( '@stdlib/assert-is-odd' );\n* var arraylikefcn = require( '@stdlib/assert-tools-array-like-function' );\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arraylikefcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\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":";;;;;;;;;;;;;;;;;;AA2CA,IAAIA,IAAOC,GAKXC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/assert-tools-array-like-function/lib/main.js

@@ -1,39 +0,0 @@
-import { l as a } from "../../assert-is-array-like/lib/index.js";
-import { l as n } from "../../string-format/lib/index.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 u = a, f = n;
-function l(t) {
-  if (typeof t != "function")
-    throw new TypeError(f("invalid argument. Must provide a function. Value: `%s`.", t));
-  return o;
-  function o(e) {
-    var i, r;
-    if (!u(e) || (i = e.length, i === 0))
-      return !1;
-    for (r = 0; r < i; r++)
-      if (t(e[r]) === !1)
-        return !1;
-    return !0;
-  }
-}
-var p = l;
-export {
-  p as m
-};
-//# sourceMappingURL=main.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/assert-tools-array-like-function/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/assert-tools-array-like-function/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 isArrayLike = require( '@stdlib/assert-is-array-like' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array-like object passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array-like object function\n*\n* @example\n* var isOdd = require( '@stdlib/assert-is-odd' );\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arraylikefcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arraylikefcn( predicate ) {\n\tif ( typeof predicate !== 'function' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', predicate ) );\n\t}\n\treturn every;\n\n\t/**\n\t* Tests if every element in an array-like object passes a test condition.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating whether a value is an array-like object for which all elements pass a test condition\n\t*/\n\tfunction every( value ) {\n\t\tvar len;\n\t\tvar i;\n\t\tif ( !isArrayLike( value ) ) {\n\t\t\treturn false;\n\t\t}\n\t\tlen = value.length;\n\t\tif ( len === 0 ) {\n\t\t\treturn false;\n\t\t}\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( predicate( value[ i ] ) === false ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = arraylikefcn;\n"],"names":["isArrayLike","require$$0","format","require$$1","arraylikefcn","predicate","every","value","len","i","main"],"mappings":";;;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAcC,GACdC,IAASC;AA0Bb,SAASC,EAAcC,GAAY;AAClC,MAAK,OAAOA,KAAc;AACzB,UAAM,IAAI,UAAWH,EAAQ,2DAA2DG,CAAS,CAAE;AAEpG,SAAOC;AASP,WAASA,EAAOC,GAAQ;AACvB,QAAIC,GACAC;AAKJ,QAJK,CAACT,EAAaO,CAAAA,MAGnBC,IAAMD,EAAM,QACPC,MAAQ;AACZ,aAAO;AAER,SAAMC,IAAI,GAAGA,IAAID,GAAKC;AACrB,UAAKJ,EAAWE,EAAOE,CAAC,CAAE,MAAO;AAChC,eAAO;AAGT,WAAO;AAAA,EACT;AACA;AAKA,IAAAC,IAAiBN;","x_google_ignoreList":[0]}

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

@@ -1,28 +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.
-*/
-function v(d, r, p, u, o, g, i) {
-  var t, e, f, n, a, s, c;
-  for (t = r.data, e = o.data, n = r.accessors[0], f = o.accessors[1], a = u, s = i, c = 0; c < d; c++)
-    f(e, s, n(t, a)), a += p, s += g;
-  return r;
-}
-var x = v;
-export {
-  x as a
-};
-//# sourceMappingURL=accessors.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"accessors.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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;AACnBJ,IAAAA,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/@milaboratories/miplots4/dist/node_modules/@stdlib/blas-base-gcopy/lib/index.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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/@milaboratories/miplots4/dist/node_modules/@stdlib/blas-base-gcopy/lib/main.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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","m","i","main"],"mappings":";;;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAmBC,GACnBC,IAAYC,GAKZC,IAAI;AAsBR,SAASC,EAAOC,GAAGC,GAAGC,GAASC,GAAGC,GAAU;AAC3C,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,MAAKV,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,QAHAK,IAAIT,IAAIF,GAGHW,IAAI;AACR,WAAMC,IAAI,GAAGA,IAAID,GAAGC;AACnBP,QAAAA,EAAGO,CAAC,IAAKT,EAAGS,CAAC;AAGf,QAAKV,IAAIF;AACR,aAAOK;AAER,SAAMO,IAAID,GAAGC,IAAIV,GAAGU,KAAKZ;AACxBK,MAAAA,EAAGO,CAAC,IAAKT,EAAGS,CAAC,GACbP,EAAGO,IAAE,CAAC,IAAKT,EAAGS,IAAE,CAAC,GACjBP,EAAGO,IAAE,CAAC,IAAKT,EAAGS,IAAE,CAAC,GACjBP,EAAGO,IAAE,CAAC,IAAKT,EAAGS,IAAE,CAAC,GACjBP,EAAGO,IAAE,CAAC,IAAKT,EAAGS,IAAE,CAAC,GACjBP,EAAGO,IAAE,CAAC,IAAKT,EAAGS,IAAE,CAAC,GACjBP,EAAGO,IAAE,CAAC,IAAKT,EAAGS,IAAE,CAAC,GACjBP,EAAGO,IAAE,CAAC,IAAKT,EAAGS,IAAE,CAAC;AAElB,WAAOP;AAAAA,EACT;AAWC,OAVKD,IAAU,IACdG,KAAM,IAAEL,KAAKE,IAEbG,IAAK,GAEDD,IAAU,IACdE,KAAM,IAAEN,KAAKI,IAEbE,IAAK,GAEAI,IAAI,GAAGA,IAAIV,GAAGU;AACnBP,IAAAA,EAAGG,CAAE,IAAKL,EAAGI,CAAE,GACfA,KAAMH,GACNI,KAAMF;AAEP,SAAOD;AACR;AAKA,IAAAQ,IAAiBZ;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"ndarray.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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","m","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,GACAC,GACAC;AAEJ,MAAKZ,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,QAHAM,IAAIX,IAAIF,GAGHa,IAAI;AACR,WAAMC,IAAI,GAAGA,IAAID,GAAGC;AACnBR,QAAAA,EAAGI,CAAE,IAAKP,EAAGM,CAAE,GACfA,KAAML,GACNM,KAAMH;AAGR,QAAKL,IAAIF;AACR,aAAOM;AAER,SAAMQ,IAAID,GAAGC,IAAIZ,GAAGY,KAAKd;AACxBM,MAAAA,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;AAAAA,EACT;AACC,OAAMQ,IAAI,GAAGA,IAAIZ,GAAGY;AACnBR,IAAAA,EAAGI,CAAE,IAAKP,EAAGM,CAAE,GACfA,KAAML,GACNM,KAAMH;AAEP,SAAOD;AACR;AAKA,IAAAS,IAAiBd;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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/@milaboratories/miplots4/dist/node_modules/@stdlib/blas-ext-base-gapxsumpw/lib/main.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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","i","main"],"mappings":";;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAMC;AA6BV,SAASC,EAAWC,GAAGC,GAAOC,GAAGC,GAAS;AACzC,MAAIC,GACAC,GACAC;AAEJ,MAAKN,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,GACEC,IAAI,GAAGA,IAAIN,GAAGM;AACnBD,MAAAA,KAAKJ,IAAQC,EAAGE,CAAE,GAClBA,KAAMD;AAEP,WAAOE;AAAAA,EACT;AACC,SAAOR,EAAKG,GAAGC,GAAOC,GAAGC,GAAQC,CAAE;AACpC;AAKA,IAAAG,IAAiBR;","x_google_ignoreList":[0]}

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

@@ -1,44 +0,0 @@
-import { l as E } 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 I = E, K = 128;
-function y(a, u, e, i, B) {
-  var t, p, s, b, g, k, l, w, x, C, m, c, v;
-  if (a <= 0)
-    return 0;
-  if (a === 1 || i === 0)
-    return u + e[B];
-  if (t = B, a < 8) {
-    for (m = 0, v = 0; v < a; v++)
-      m += u + e[t], t += i;
-    return m;
-  }
-  if (a <= K) {
-    for (p = u + e[t], s = u + e[t + i], b = u + e[t + 2 * i], g = u + e[t + 3 * i], k = u + e[t + 4 * i], l = u + e[t + 5 * i], w = u + e[t + 6 * i], x = u + e[t + 7 * i], t += 8 * i, C = a % 8, v = 8; v < a - C; v += 8)
-      p += u + e[t], s += u + e[t + i], b += u + e[t + 2 * i], g += u + e[t + 3 * i], k += u + e[t + 4 * i], l += u + e[t + 5 * i], w += u + e[t + 6 * i], x += u + e[t + 7 * i], t += 8 * i;
-    for (m = p + s + (b + g) + (k + l + (w + x)), v; v < a; v++)
-      m += u + e[t], t += i;
-    return m;
-  }
-  return c = I(a / 2), c -= c % 8, y(c, u, e, i, t) + y(a - c, u, e, i, t + c * i);
-}
-var S = y;
-export {
-  S as n
-};
-//# sourceMappingURL=ndarray.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ndarray.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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","M","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,GACAC,GACAC,GACAC,GACAC;AAEJ,MAAKjB,KAAK;AACT,WAAO;AAER,MAAKA,MAAM,KAAKG,MAAW;AAC1B,WAAOF,IAAQC,EAAGE,CAAM;AAGzB,MADAC,IAAKD,GACAJ,IAAI,GAAI;AAGZ,SADAe,IAAI,GACEE,IAAI,GAAGA,IAAIjB,GAAGiB;AACnBF,WAAKd,IAAQC,EAAGG,CAAE,GAClBA,KAAMF;AAEP,WAAOY;AAAAA,EACT;AACC,MAAKf,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,GAEVW,IAAId,IAAI,GACFiB,IAAI,GAAGA,IAAIjB,IAAEc,GAAGG,KAAK;AAC1BX,MAAAA,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,SAHAY,IAAMT,IAAGC,KAAOC,IAAGC,MAASC,IAAGC,KAAOC,IAAGC,KAGnCI,GAAGA,IAAIjB,GAAGiB;AACfF,WAAKd,IAAQC,EAAGG,CAAE,GAClBA,KAAMF;AAEP,WAAOY;AAAAA,EACT;AAEC,SAAAC,IAAIpB,EAAOI,IAAE,CAAC,GACdgB,KAAKA,IAAI,GACFjB,EAAWiB,GAAGf,GAAOC,GAAGC,GAAQE,CAAE,IAAKN,EAAWC,IAAEgB,GAAGf,GAAOC,GAAGC,GAAQE,IAAIW,IAAEb,CAAAA;AACvF;AAKA,IAAAe,IAAiBnB;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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/@milaboratories/miplots4/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 f = i;
-function m(r, o, n) {
-  var t, u, e;
-  if (r <= 0)
-    return 0;
-  if (r === 1 || n === 0)
-    return o[0];
-  if (n < 0 ? t = (1 - r) * n : t = 0, r < 8) {
-    for (u = 0, e = 0; e < r; e++)
-      u += o[t], t += n;
-    return u;
-  }
-  return f(r, o, n, t);
-}
-var p = m;
-export {
-  p as m
-};
-//# sourceMappingURL=main.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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;AACnBD,WAAKH,EAAGE,CAAE,GACVA,KAAMD;AAEP,WAAOE;AAAAA,EACT;AACC,SAAOP,EAAKG,GAAGC,GAAGC,GAAQC,CAAE;AAC7B;AAKA,IAAAG,IAAiBP;","x_google_ignoreList":[0]}

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

@@ -1,44 +0,0 @@
-import { l as E } 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 = E, L = 128;
-function x(i, t, o, y) {
-  var f, m, p, c, l, s, b, g, w, B, a, e, u;
-  if (i <= 0)
-    return 0;
-  if (i === 1 || o === 0)
-    return t[y];
-  if (f = y, i < 8) {
-    for (a = 0, u = 0; u < i; u++)
-      a += t[f], f += o;
-    return a;
-  }
-  if (i <= L) {
-    for (m = t[f], p = t[f + o], c = t[f + 2 * o], l = t[f + 3 * o], s = t[f + 4 * o], b = t[f + 5 * o], g = t[f + 6 * o], w = t[f + 7 * o], f += 8 * o, B = i % 8, u = 8; u < i - B; u += 8)
-      m += t[f], p += t[f + o], c += t[f + 2 * o], l += t[f + 3 * o], s += t[f + 4 * o], b += t[f + 5 * o], g += t[f + 6 * o], w += t[f + 7 * o], f += 8 * o;
-    for (a = m + p + (c + l) + (s + b + (g + w)), u; u < i; u++)
-      a += t[f], f += o;
-    return a;
-  }
-  return e = K(i / 2), e -= e % 8, x(e, t, o, f) + x(i - e, t, o, f + e * o);
-}
-var d = x;
-export {
-  d as n
-};
-//# sourceMappingURL=ndarray.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ndarray.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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;AACnBF,MAAAA,KAAKb,EAAGG,CAAE,GACVA,KAAMF;AAEP,WAAOY;AAAAA,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;AAC1BX,MAAAA,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;AACfF,MAAAA,KAAKb,EAAGG,CAAE,GACVA,KAAMF;AAEP,WAAOY;AAAAA,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/@milaboratories/miplots4/dist/node_modules/@stdlib/boolean-ctor/lib/index.js

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/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/@milaboratories/miplots4/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