vega-util - npm Package Compare versions

Comparing version 1.17.0 to 1.17.1

build/vega-util.js

@@ -5,3 +5,3 @@ (function (global, factory) {
   (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.vega = {}));
-}(this, (function (exports) { 'use strict';
+})(this, (function (exports) { 'use strict';
 
@@ -23,7 +23,5 @@ function accessor (fn, fields, name) {
   }
-
   const get1 = field => function (obj) {
     return obj[field];
   };
-
   const getN = path => {
@@ -35,3 +33,2 @@ const len = path.length;
       }
-
       return obj;
@@ -47,11 +44,10 @@ };
     const path = [],
-          n = p.length;
+      n = p.length;
     let q = null,
-        b = 0,
-        s = '',
-        i,
-        j,
-        c;
+      b = 0,
+      s = '',
+      i,
+      j,
+      c;
     p = p + '';
-
     function push() {
@@ -62,6 +58,4 @@ path.push(s + p.substring(i, j));
     }
-
     for (i = j = 0; j < n; ++j) {
       c = p[j];
-
       if (c === '\\') {
@@ -99,6 +93,4 @@ s += p.substring(i, j);
     }
-
     if (b) error('Access path missing closing bracket: ' + p);
     if (q) error('Access path missing closing quote: ' + p);
-
     if (j > i) {
@@ -108,3 +100,2 @@ j++;
     }
-
     return path;
@@ -147,3 +138,2 @@ }
       },
-
       error() {
@@ -153,3 +143,2 @@ if (level >= Error$1) handler(method || 'error', 'ERROR', arguments);
       },
-
       warn() {
@@ -159,3 +148,2 @@ if (level >= Warn) handler(method || 'warn', 'WARN', arguments);
       },
-
       info() {
@@ -165,3 +153,2 @@ if (level >= Info) handler(method || 'log', 'INFO', arguments);
       },
-
       debug() {
@@ -171,3 +158,2 @@ if (level >= Debug) handler(method || 'log', 'DEBUG', arguments);
       }
-
     };
@@ -183,3 +169,2 @@ }
   const isLegalKey = key => key !== '__proto__';
-
   function mergeConfig(...configs) {
@@ -204,3 +189,2 @@ return configs.reduce((out, source) => {
       }
-
       return out;
@@ -212,6 +196,4 @@ }, {});
     let k, o;
-
     if (isObject(value) && !isArray(value)) {
       o = isObject(output[key]) ? output[key] : output[key] = {};
-
       for (k in value) {
@@ -228,8 +210,6 @@ if (recurse && (recurse === true || recurse[k])) {
   }
-
   function mergeNamed(a, b) {
     if (a == null) return b;
     const map = {},
-          out = [];
-
+      out = [];
     function add(_) {
@@ -241,3 +221,2 @@ if (!map[_.name]) {
     }
-
     b.forEach(add);
@@ -257,18 +236,12 @@ a.forEach(add);
   const exp = sign => x => sign * Math.exp(x);
-
   const log = sign => x => Math.log(sign * x);
-
   const symlog = c => x => Math.sign(x) * Math.log1p(Math.abs(x / c));
-
   const symexp = c => x => Math.sign(x) * Math.expm1(Math.abs(x)) * c;
-
   const pow = exponent => x => x < 0 ? -Math.pow(-x, exponent) : Math.pow(x, exponent);
-
   function pan(domain, delta, lift, ground) {
     const d0 = lift(domain[0]),
-          d1 = lift(peek(domain)),
-          dd = (d1 - d0) * delta;
+      d1 = lift(peek(domain)),
+      dd = (d1 - d0) * delta;
     return [ground(d0 - dd), ground(d1 - dd)];
   }
-
   function panLinear(domain, delta) {
@@ -287,10 +260,8 @@ return pan(domain, delta, toNumber, identity);
   }
-
   function zoom(domain, anchor, scale, lift, ground) {
     const d0 = lift(domain[0]),
-          d1 = lift(peek(domain)),
-          da = anchor != null ? lift(anchor) : (d0 + d1) / 2;
+      d1 = lift(peek(domain)),
+      da = anchor != null ? lift(anchor) : (d0 + d1) / 2;
     return [ground(da + (d0 - da) * scale), ground(da + (d1 - da) * scale)];
   }
-
   function zoomLinear(domain, anchor, scale) {
@@ -330,5 +301,4 @@ return zoom(domain, anchor, scale, toNumber, identity);
     let lo = range[0],
-        hi = range[1],
-        span;
-
+      hi = range[1],
+      span;
     if (hi < lo) {
@@ -339,3 +309,2 @@ span = hi;
     }
-
     span = hi - lo;
@@ -354,5 +323,5 @@ return span >= max - min ? [min, max] : [lo = Math.min(Math.max(lo, min), max - span), lo + span];
     const ord = [],
-          get = [],
-          fmap = {},
-          gen = opt.comparator || comparator;
+      get = [],
+      fmap = {},
+      gen = opt.comparator || comparator;
     array(fields).forEach((f, i) => {
@@ -367,17 +336,12 @@ if (f == null) return;
   const ascending = (u, v) => (u < v || u == null) && v != null ? -1 : (u > v || v == null) && u != null ? 1 : (v = v instanceof Date ? +v : v, u = u instanceof Date ? +u : u) !== u && v === v ? -1 : v !== v && u === u ? 1 : 0;
-
   const comparator = (fields, orders) => fields.length === 1 ? compare1(fields[0], orders[0]) : compareN(fields, orders, fields.length);
-
   const compare1 = (field, order) => function (a, b) {
     return ascending(field(a), field(b)) * order;
   };
-
   const compareN = (fields, orders, n) => {
     orders.push(0); // pad zero for convenient lookup
-
     return function (a, b) {
       let f,
-          c = 0,
-          i = -1;
-
+        c = 0,
+        i = -1;
       while (c === 0 && ++i < n) {
@@ -387,3 +351,2 @@ f = fields[i];
       }
-
       return c * orders[i];
@@ -408,3 +371,2 @@ };
       x = arguments[i];
-
       for (k in x) {
@@ -414,3 +376,2 @@ _[k] = x[k];
     }
-
     return _;
@@ -425,7 +386,6 @@ }
     let i = 0,
-        n,
-        v,
-        min,
-        max;
-
+      n,
+      v,
+      min,
+      max;
     if (array && (n = array.length)) {
@@ -435,8 +395,8 @@ if (f == null) {
         for (v = array[i]; i < n && (v == null || v !== v); v = array[++i]);
+        min = max = v;
 
-        min = max = v; // visit all other values
-
+        // visit all other values
         for (; i < n; ++i) {
-          v = array[i]; // skip null/undefined; NaN will fail all comparisons
-
+          v = array[i];
+          // skip null/undefined; NaN will fail all comparisons
           if (v != null) {
@@ -450,8 +410,8 @@ if (v < min) min = v;
         for (v = f(array[i]); i < n && (v == null || v !== v); v = f(array[++i]));
+        min = max = v;
 
-        min = max = v; // visit all other values
-
+        // visit all other values
         for (; i < n; ++i) {
-          v = f(array[i]); // skip null/undefined; NaN will fail all comparisons
-
+          v = f(array[i]);
+          // skip null/undefined; NaN will fail all comparisons
           if (v != null) {
@@ -464,3 +424,2 @@ if (v < min) min = v;
     }
-
     return [min, max];
@@ -472,12 +431,10 @@ }
     let i = -1,
-        a,
-        b,
-        c,
-        u,
-        v;
-
+      a,
+      b,
+      c,
+      u,
+      v;
     if (f == null) {
       while (++i < n) {
         b = array[i];
-
         if (b != null && b >= b) {
@@ -488,9 +445,6 @@ a = c = b;
       }
-
       if (i === n) return [-1, -1];
       u = v = i;
-
       while (++i < n) {
         b = array[i];
-
         if (b != null) {
@@ -501,3 +455,2 @@ if (a > b) {
           }
-
           if (c < b) {
@@ -512,3 +465,2 @@ c = b;
         b = f(array[i], i, array);
-
         if (b != null && b >= b) {
@@ -519,9 +471,6 @@ a = c = b;
       }
-
       if (i === n) return [-1, -1];
       u = v = i;
-
       while (++i < n) {
         b = f(array[i], i, array);
-
         if (b != null) {
@@ -532,3 +481,2 @@ if (a > b) {
           }
-
           if (c < b) {
@@ -541,3 +489,2 @@ c = b;
     }
-
     return [u, v];
@@ -554,8 +501,6 @@ }
     let obj = {},
-        test;
-
+      test;
     function has$1(key) {
       return has(obj, key) && obj[key] !== NULL;
     }
-
     const map = {
@@ -566,7 +511,5 @@ size: 0,
       has: has$1,
-
       get(key) {
         return has$1(key) ? obj[key] : undefined;
       },
-
       set(key, value) {
@@ -577,7 +520,5 @@ if (!has$1(key)) {
         }
-
         obj[key] = value;
         return this;
       },
-
       delete(key) {
@@ -589,6 +530,4 @@ if (has$1(key)) {
         }
-
         return this;
       },
-
       clear() {
@@ -598,3 +537,2 @@ map.size = map.empty = 0;
       },
-
       test(_) {
@@ -608,10 +546,7 @@ if (arguments.length) {
       },
-
       clean() {
         const next = {};
         let size = 0;
-
         for (const key in obj) {
           const value = obj[key];
-
           if (value !== NULL && (!test || !test(value))) {
@@ -622,3 +557,2 @@ next[key] = value;
         }
-
         map.size = size;
@@ -628,3 +562,2 @@ map.empty = 0;
       }
-
     };
@@ -641,5 +574,6 @@ if (input) Object.keys(input).forEach(key => {
     let a = range[0],
-        b = peek(range),
-        l; // swap endpoints if range is reversed
+      b = peek(range),
+      l;
 
+    // swap endpoints if range is reversed
     if (b < a) {
@@ -649,8 +583,9 @@ l = a;
       b = l;
-    } // compare value to endpoints
+    }
 
-
+    // compare value to endpoints
     l = Math.abs(value - a);
-    const r = Math.abs(b - value); // adjust if value is within threshold distance of endpoint
+    const r = Math.abs(b - value);
 
+    // adjust if value is within threshold distance of endpoint
     return l < r && l <= t ? left : r <= t ? right : center;
@@ -677,5 +612,4 @@ }
     let r0 = range[0],
-        r1 = range[range.length - 1],
-        t;
-
+      r1 = range[range.length - 1],
+      t;
     if (r0 > r1) {
@@ -686,3 +620,2 @@ t = r0;
     }
-
     left = left === undefined || left;
@@ -721,9 +654,6 @@ right = right === undefined || right;
     }
-
     const len = fields && fields.length,
-          gen = opt && opt.get || getter,
-          map = f => gen(flat ? [f] : splitAccessPath(f));
-
+      gen = opt && opt.get || getter,
+      map = f => gen(flat ? [f] : splitAccessPath(f));
     let fn;
-
     if (!len) {
@@ -735,3 +665,2 @@ fn = function () {
       const get = map(fields[0]);
-
       fn = function (_) {
@@ -742,13 +671,9 @@ return '' + get(_);
       const get = fields.map(map);
-
       fn = function (_) {
         let s = '' + get[0](_),
-            i = 0;
-
+          i = 0;
         while (++i < len) s += '|' + get[i](_);
-
         return s;
       };
     }
-
     return accessor(fn, fields, 'key');
@@ -759,13 +684,13 @@ }
     const lo = array[0],
-          hi = peek(array),
-          f = +frac;
+      hi = peek(array),
+      f = +frac;
     return !f ? lo : f === 1 ? hi : lo + f * (hi - lo);
   }
 
-  const DEFAULT_MAX_SIZE = 10000; // adapted from https://github.com/dominictarr/hashlru/ (MIT License)
+  const DEFAULT_MAX_SIZE = 10000;
 
+  // adapted from https://github.com/dominictarr/hashlru/ (MIT License)
   function lruCache (maxsize) {
     maxsize = +maxsize || DEFAULT_MAX_SIZE;
     let curr, prev, size;
-
     const clear = () => {
@@ -776,3 +701,2 @@ curr = {};
     };
-
     const update = (key, value) => {
@@ -784,6 +708,4 @@ if (++size > maxsize) {
       }
-
       return curr[key] = value;
     };
-
     clear();
@@ -800,3 +722,3 @@ return {
     const n0 = array0.length,
-          n1 = array1.length;
+      n1 = array1.length;
     if (!n1) return array0;
@@ -806,17 +728,13 @@ if (!n0) return array1;
     let i0 = 0,
-        i1 = 0,
-        i = 0;
-
+      i1 = 0,
+      i = 0;
     for (; i0 < n0 && i1 < n1; ++i) {
       merged[i] = compare(array0[i0], array1[i1]) > 0 ? array1[i1++] : array0[i0++];
     }
-
     for (; i0 < n0; ++i0, ++i) {
       merged[i] = array0[i0];
     }
-
     for (; i1 < n1; ++i1, ++i) {
       merged[i] = array1[i1];
     }
-
     return merged;
@@ -827,5 +745,3 @@ }
     let s = '';
-
     while (--reps >= 0) s += str;
-
     return s;
@@ -836,4 +752,4 @@ }
     const c = padchar || ' ',
-          s = str + '',
-          n = length - s.length;
+      s = str + '',
+      n = length - s.length;
     return n <= 0 ? s : align === 'left' ? repeat(c, n) + s : align === 'center' ? repeat(c, ~~(n / 2)) + s + repeat(c, Math.ceil(n / 2)) : s + repeat(c, n);
@@ -846,3 +762,2 @@ }
    */
-
   function span (array) {
@@ -853,3 +768,4 @@ return array && peek(array) - array[0] || 0;
   function $(x) {
-    return isArray(x) ? '[' + x.map($) + ']' : isObject(x) || isString(x) ? // Output valid JSON and JS source strings.
+    return isArray(x) ? '[' + x.map($) + ']' : isObject(x) || isString(x) ?
+    // Output valid JSON and JS source strings.
     // See http://timelessrepo.com/json-isnt-a-javascript-subset
@@ -864,3 +780,2 @@ JSON.stringify(x).replace('\u2028', '\\u2028').replace('\u2029', '\\u2029') : x;
   const defaultParser = _ => isNumber(_) ? _ : isDate(_) ? _ : Date.parse(_);
-
   function toDate (_, parser) {
@@ -877,6 +792,4 @@ parser = parser || defaultParser;
     const s = {},
-          n = _.length;
-
+      n = _.length;
     for (let i = 0; i < n; ++i) s[_[i]] = true;
-
     return s;
@@ -887,5 +800,5 @@ }
     const e = ellipsis != null ? ellipsis : '\u2026',
-          s = str + '',
-          n = s.length,
-          l = Math.max(0, length - e.length);
+      s = str + '',
+      n = s.length,
+      l = Math.max(0, length - e.length);
     return n <= length ? s : align === 'left' ? e + s.slice(n - l) : align === 'center' ? s.slice(0, Math.ceil(l / 2)) + e + s.slice(n - ~~(l / 2)) : s.slice(0, l) + e;
@@ -898,3 +811,2 @@ }
         const n = array.length;
-
         for (let i = 0; i < n; ++i) {
@@ -980,4 +892,2 @@ const t = filter(array[i]);
 
-  Object.defineProperty(exports, '__esModule', { value: true });
-
-})));
+}));

build/vega-util.min.js

@@ -1,2 +0,2 @@
-!function(n,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((n="undefined"!=typeof globalThis?globalThis:n||self).vega={})}(this,(function(n){"use strict";function t(n,t,e){return n.fields=t||[],n.fname=e,n}function e(n){return null==n?null:n.fields}function r(n){return 1===n.length?o(n[0]):u(n)}const o=n=>function(t){return t[n]},u=n=>{const t=n.length;return function(e){for(let r=0;r<t;++r)e=e[n[r]];return e}};function i(n){throw Error(n)}function l(n){const t=[],e=n.length;let r,o,u,l=null,c=0,s="";function f(){t.push(s+n.substring(r,o)),s="",r=o+1}for(n+="",r=o=0;o<e;++o)if(u=n[o],"\\"===u)s+=n.substring(r,o),s+=n.substring(++o,++o),r=o;else if(u===l)f(),l=null,c=-1;else{if(l)continue;r===c&&'"'===u||r===c&&"'"===u?(r=o+1,l=u):"."!==u||c?"["===u?(o>r&&f(),c=r=o+1):"]"===u&&(c||i("Access path missing open bracket: "+n),c>0&&f(),c=0,r=o+1):o>r?f():r=o+1}return c&&i("Access path missing closing bracket: "+n),l&&i("Access path missing closing quote: "+n),o>r&&(o++,f()),t}function c(n,e,o){const u=l(n);return n=1===u.length?u[0]:n,t((o&&o.get||r)(u),[n],e||n)}const s=c("id"),f=t((n=>n),[],"identity"),a=t((()=>0),[],"zero"),g=t((()=>1),[],"one"),h=t((()=>!0),[],"true"),p=t((()=>!1),[],"false");function y(n,t,e){const r=[t].concat([].slice.call(e));console[n].apply(console,r)}var b=Array.isArray;function m(n){return n===Object(n)}const d=n=>"__proto__"!==n;function M(n,t,e,r){if(!d(t))return;let o,u;if(m(e)&&!b(e))for(o in u=m(n[t])?n[t]:n[t]={},e)r&&(!0===r||r[o])?M(u,o,e[o]):d(o)&&(u[o]=e[o]);else n[t]=e}function j(n,t){if(null==n)return t;const e={},r=[];function o(n){e[n.name]||(e[n.name]=1,r.push(n))}return t.forEach(o),n.forEach(o),r}function O(n){return n[n.length-1]}function w(n){return null==n||""===n?null:+n}const x=n=>t=>n*Math.exp(t),E=n=>t=>Math.log(n*t),v=n=>t=>Math.sign(t)*Math.log1p(Math.abs(t/n)),z=n=>t=>Math.sign(t)*Math.expm1(Math.abs(t))*n,D=n=>t=>t<0?-Math.pow(-t,n):Math.pow(t,n);function k(n,t,e,r){const o=e(n[0]),u=e(O(n)),i=(u-o)*t;return[r(o-i),r(u-i)]}function A(n,t,e,r,o){const u=r(n[0]),i=r(O(n)),l=null!=t?r(t):(u+i)/2;return[o(l+(u-l)*e),o(l+(i-l)*e)]}function S(n){return null!=n?b(n)?n:[n]:[]}function N(n){return"function"==typeof n}const P=(n,t)=>(n<t||null==n)&&null!=t?-1:(n>t||null==t)&&null!=n?1:(t=t instanceof Date?+t:t,(n=n instanceof Date?+n:n)!==n&&t==t?-1:t!=t&&n==n?1:0),R=(n,t)=>1===n.length?_(n[0],t[0]):T(n,t,n.length),_=(n,t)=>function(e,r){return P(n(e),n(r))*t},T=(n,t,e)=>(t.push(0),function(r,o){let u,i=0,l=-1;for(;0===i&&++l<e;)u=n[l],i=P(u(r),u(o));return i*t[l]});function C(n){for(let t,e,r=1,o=arguments.length;r<o;++r)for(e in t=arguments[r],t)n[e]=t[e];return n}const I=Object.prototype.hasOwnProperty;function L(n,t){return I.call(n,t)}const q={};function B(n){return"[object Date]"===Object.prototype.toString.call(n)}function F(n){return"number"==typeof n}function U(n){return"string"==typeof n}function W(n,t){let e="";for(;--t>=0;)e+=n;return e}const G=n=>F(n)||B(n)?n:Date.parse(n);n.Debug=4,n.Error=1,n.Info=3,n.None=0,n.Warn=2,n.accessor=t,n.accessorFields=e,n.accessorName=function(n){return null==n?null:n.fname},n.array=S,n.ascending=P,n.clampRange=function(n,t,e){let r,o=n[0],u=n[1];return u<o&&(r=u,u=o,o=r),r=u-o,r>=e-t?[t,e]:[o=Math.min(Math.max(o,t),e-r),o+r]},n.compare=function(n,r,o){o=o||{},r=S(r)||[];const u=[],i=[],l={},s=o.comparator||R;return S(n).forEach(((n,t)=>{null!=n&&(u.push("descending"===r[t]?-1:1),i.push(n=N(n)?n:c(n,null,o)),(e(n)||[]).forEach((n=>l[n]=1)))})),0===i.length?null:t(s(i,u),Object.keys(l))},n.constant=function(n){return N(n)?n:()=>n},n.debounce=function(n,t){let e;return r=>{e&&clearTimeout(e),e=setTimeout((()=>(t(r),e=null)),n)}},n.error=i,n.extend=C,n.extent=function(n,t){let e,r,o,u,i=0;if(n&&(e=n.length))if(null==t){for(r=n[i];i<e&&(null==r||r!=r);r=n[++i]);for(o=u=r;i<e;++i)r=n[i],null!=r&&(r<o&&(o=r),r>u&&(u=r))}else{for(r=t(n[i]);i<e&&(null==r||r!=r);r=t(n[++i]));for(o=u=r;i<e;++i)r=t(n[i]),null!=r&&(r<o&&(o=r),r>u&&(u=r))}return[o,u]},n.extentIndex=function(n,t){const e=n.length;let r,o,u,i,l,c=-1;if(null==t){for(;++c<e;)if(o=n[c],null!=o&&o>=o){r=u=o;break}if(c===e)return[-1,-1];for(i=l=c;++c<e;)o=n[c],null!=o&&(r>o&&(r=o,i=c),u<o&&(u=o,l=c))}else{for(;++c<e;)if(o=t(n[c],c,n),null!=o&&o>=o){r=u=o;break}if(c===e)return[-1,-1];for(i=l=c;++c<e;)o=t(n[c],c,n),null!=o&&(r>o&&(r=o,i=c),u<o&&(u=o,l=c))}return[i,l]},n.falsy=p,n.fastmap=function(n){let t,e={};function r(n){return L(e,n)&&e[n]!==q}const o={size:0,empty:0,object:e,has:r,get:n=>r(n)?e[n]:void 0,set(n,t){return r(n)||(++o.size,e[n]===q&&--o.empty),e[n]=t,this},delete(n){return r(n)&&(--o.size,++o.empty,e[n]=q),this},clear(){o.size=o.empty=0,o.object=e={}},test(n){return arguments.length?(t=n,o):t},clean(){const n={};let r=0;for(const o in e){const u=e[o];u===q||t&&t(u)||(n[o]=u,++r)}o.size=r,o.empty=0,o.object=e=n}};return n&&Object.keys(n).forEach((t=>{o.set(t,n[t])})),o},n.field=c,n.flush=function(n,t,e,r,o,u){if(!e&&0!==e)return u;const i=+e;let l,c=n[0],s=O(n);s<c&&(l=c,c=s,s=l),l=Math.abs(t-c);const f=Math.abs(s-t);return l<f&&l<=i?r:f<=i?o:u},n.hasOwnProperty=L,n.id=s,n.identity=f,n.inherits=function(n,t,e){const r=n.prototype=Object.create(t.prototype);return Object.defineProperty(r,"constructor",{value:n,writable:!0,enumerable:!0,configurable:!0}),C(r,e)},n.inrange=function(n,t,e,r){let o,u=t[0],i=t[t.length-1];return u>i&&(o=u,u=i,i=o),r=void 0===r||r,((e=void 0===e||e)?u<=n:u<n)&&(r?n<=i:n<i)},n.isArray=b,n.isBoolean=function(n){return"boolean"==typeof n},n.isDate=B,n.isFunction=N,n.isIterable=function(n){return n&&N(n[Symbol.iterator])},n.isNumber=F,n.isObject=m,n.isRegExp=function(n){return"[object RegExp]"===Object.prototype.toString.call(n)},n.isString=U,n.key=function(n,e,o){n&&(n=e?S(n).map((n=>n.replace(/\\(.)/g,"$1"))):S(n));const u=n&&n.length,i=o&&o.get||r,c=n=>i(e?[n]:l(n));let s;if(u)if(1===u){const t=c(n[0]);s=function(n){return""+t(n)}}else{const t=n.map(c);s=function(n){let e=""+t[0](n),r=0;for(;++r<u;)e+="|"+t[r](n);return e}}else s=function(){return""};return t(s,n,"key")},n.lerp=function(n,t){const e=n[0],r=O(n),o=+t;return o?1===o?r:e+o*(r-e):e},n.logger=function(n,t,e=y){let r=n||0;return{level(n){return arguments.length?(r=+n,this):r},error(){return r>=1&&e(t||"error","ERROR",arguments),this},warn(){return r>=2&&e(t||"warn","WARN",arguments),this},info(){return r>=3&&e(t||"log","INFO",arguments),this},debug(){return r>=4&&e(t||"log","DEBUG",arguments),this}}},n.lruCache=function(n){let t,e,r;n=+n||1e4;const o=()=>{t={},e={},r=0},u=(o,u)=>(++r>n&&(e=t,t={},r=1),t[o]=u);return o(),{clear:o,has:n=>L(t,n)||L(e,n),get:n=>L(t,n)?t[n]:L(e,n)?u(n,e[n]):void 0,set:(n,e)=>L(t,n)?t[n]=e:u(n,e)}},n.merge=function(n,t,e,r){const o=t.length,u=e.length;if(!u)return t;if(!o)return e;const i=r||new t.constructor(o+u);let l=0,c=0,s=0;for(;l<o&&c<u;++s)i[s]=n(t[l],e[c])>0?e[c++]:t[l++];for(;l<o;++l,++s)i[s]=t[l];for(;c<u;++c,++s)i[s]=e[c];return i},n.mergeConfig=function(...n){return n.reduce(((n,t)=>{for(const e in t)if("signals"===e)n.signals=j(n.signals,t.signals);else{const r="legend"===e?{layout:1}:"style"===e||null;M(n,e,t[e],r)}return n}),{})},n.one=g,n.pad=function(n,t,e,r){const o=e||" ",u=n+"",i=t-u.length;return i<=0?u:"left"===r?W(o,i)+u:"center"===r?W(o,~~(i/2))+u+W(o,Math.ceil(i/2)):u+W(o,i)},n.panLinear=function(n,t){return k(n,t,w,f)},n.panLog=function(n,t){var e=Math.sign(n[0]);return k(n,t,E(e),x(e))},n.panPow=function(n,t,e){return k(n,t,D(e),D(1/e))},n.panSymlog=function(n,t,e){return k(n,t,v(e),z(e))},n.peek=O,n.quarter=function(n){return 1+~~(new Date(n).getMonth()/3)},n.repeat=W,n.span=function(n){return n&&O(n)-n[0]||0},n.splitAccessPath=l,n.stringValue=function n(t){return b(t)?"["+t.map(n)+"]":m(t)||U(t)?JSON.stringify(t).replace("\u2028","\\u2028").replace("\u2029","\\u2029"):t},n.toBoolean=function(n){return null==n||""===n?null:!(!n||"false"===n||"0"===n)&&!!n},n.toDate=function(n,t){return t=t||G,null==n||""===n?null:t(n)},n.toNumber=w,n.toSet=function(n){const t={},e=n.length;for(let r=0;r<e;++r)t[n[r]]=!0;return t},n.toString=function(n){return null==n||""===n?null:n+""},n.truncate=function(n,t,e,r){const o=null!=r?r:"…",u=n+"",i=u.length,l=Math.max(0,t-o.length);return i<=t?u:"left"===e?o+u.slice(i-l):"center"===e?u.slice(0,Math.ceil(l/2))+o+u.slice(i-~~(l/2)):u.slice(0,l)+o},n.truthy=h,n.utcquarter=function(n){return 1+~~(new Date(n).getUTCMonth()/3)},n.visitArray=function(n,t,e){if(n)if(t){const r=n.length;for(let o=0;o<r;++o){const r=t(n[o]);r&&e(r,o,n)}}else n.forEach(e)},n.writeConfig=M,n.zero=a,n.zoomLinear=function(n,t,e){return A(n,t,e,w,f)},n.zoomLog=function(n,t,e){const r=Math.sign(n[0]);return A(n,t,e,E(r),x(r))},n.zoomPow=function(n,t,e,r){return A(n,t,e,D(r),D(1/r))},n.zoomSymlog=function(n,t,e,r){return A(n,t,e,v(r),z(r))},Object.defineProperty(n,"__esModule",{value:!0})}));
+!function(n,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((n="undefined"!=typeof globalThis?globalThis:n||self).vega={})}(this,(function(n){"use strict";function t(n,t,e){return n.fields=t||[],n.fname=e,n}function e(n){return null==n?null:n.fields}function r(n){return 1===n.length?o(n[0]):u(n)}const o=n=>function(t){return t[n]},u=n=>{const t=n.length;return function(e){for(let r=0;r<t;++r)e=e[n[r]];return e}};function i(n){throw Error(n)}function c(n){const t=[],e=n.length;let r,o,u,c=null,l=0,s="";function f(){t.push(s+n.substring(r,o)),s="",r=o+1}for(n+="",r=o=0;o<e;++o)if(u=n[o],"\\"===u)s+=n.substring(r,o),s+=n.substring(++o,++o),r=o;else if(u===c)f(),c=null,l=-1;else{if(c)continue;r===l&&'"'===u||r===l&&"'"===u?(r=o+1,c=u):"."!==u||l?"["===u?(o>r&&f(),l=r=o+1):"]"===u&&(l||i("Access path missing open bracket: "+n),l>0&&f(),l=0,r=o+1):o>r?f():r=o+1}return l&&i("Access path missing closing bracket: "+n),c&&i("Access path missing closing quote: "+n),o>r&&(o++,f()),t}function l(n,e,o){const u=c(n);return n=1===u.length?u[0]:n,t((o&&o.get||r)(u),[n],e||n)}const s=l("id"),f=t((n=>n),[],"identity"),a=t((()=>0),[],"zero"),g=t((()=>1),[],"one"),h=t((()=>!0),[],"true"),p=t((()=>!1),[],"false");function y(n,t,e){const r=[t].concat([].slice.call(e));console[n].apply(console,r)}const m=0,b=1,d=2,M=3,j=4;var w=Array.isArray;function O(n){return n===Object(n)}const x=n=>"__proto__"!==n;function v(n,t,e,r){if(!x(t))return;let o,u;if(O(e)&&!w(e))for(o in u=O(n[t])?n[t]:n[t]={},e)r&&(!0===r||r[o])?v(u,o,e[o]):x(o)&&(u[o]=e[o]);else n[t]=e}function E(n,t){if(null==n)return t;const e={},r=[];function o(n){e[n.name]||(e[n.name]=1,r.push(n))}return t.forEach(o),n.forEach(o),r}function z(n){return n[n.length-1]}function A(n){return null==n||""===n?null:+n}const D=n=>t=>n*Math.exp(t),k=n=>t=>Math.log(n*t),S=n=>t=>Math.sign(t)*Math.log1p(Math.abs(t/n)),N=n=>t=>Math.sign(t)*Math.expm1(Math.abs(t))*n,R=n=>t=>t<0?-Math.pow(-t,n):Math.pow(t,n);function P(n,t,e,r){const o=e(n[0]),u=e(z(n)),i=(u-o)*t;return[r(o-i),r(u-i)]}function T(n,t,e,r,o){const u=r(n[0]),i=r(z(n)),c=null!=t?r(t):(u+i)/2;return[o(c+(u-c)*e),o(c+(i-c)*e)]}function C(n){return null!=n?w(n)?n:[n]:[]}function I(n){return"function"==typeof n}const L="descending";const _=(n,t)=>(n<t||null==n)&&null!=t?-1:(n>t||null==t)&&null!=n?1:(t=t instanceof Date?+t:t,(n=n instanceof Date?+n:n)!==n&&t==t?-1:t!=t&&n==n?1:0),q=(n,t)=>1===n.length?B(n[0],t[0]):F(n,t,n.length),B=(n,t)=>function(e,r){return _(n(e),n(r))*t},F=(n,t,e)=>(t.push(0),function(r,o){let u,i=0,c=-1;for(;0===i&&++c<e;)u=n[c],i=_(u(r),u(o));return i*t[c]});function U(n){for(let t,e,r=1,o=arguments.length;r<o;++r)for(e in t=arguments[r],t)n[e]=t[e];return n}const W=Object.prototype.hasOwnProperty;function G(n,t){return W.call(n,t)}const J={};function V(n){return"[object Date]"===Object.prototype.toString.call(n)}function $(n){return"number"==typeof n}function H(n){return"string"==typeof n}const K=1e4;function Q(n,t){let e="";for(;--t>=0;)e+=n;return e}const X=n=>$(n)||V(n)?n:Date.parse(n);n.Debug=j,n.Error=b,n.Info=M,n.None=m,n.Warn=d,n.accessor=t,n.accessorFields=e,n.accessorName=function(n){return null==n?null:n.fname},n.array=C,n.ascending=_,n.clampRange=function(n,t,e){let r,o=n[0],u=n[1];return u<o&&(r=u,u=o,o=r),r=u-o,r>=e-t?[t,e]:[o=Math.min(Math.max(o,t),e-r),o+r]},n.compare=function(n,r,o){o=o||{},r=C(r)||[];const u=[],i=[],c={},s=o.comparator||q;return C(n).forEach(((n,t)=>{null!=n&&(u.push(r[t]===L?-1:1),i.push(n=I(n)?n:l(n,null,o)),(e(n)||[]).forEach((n=>c[n]=1)))})),0===i.length?null:t(s(i,u),Object.keys(c))},n.constant=function(n){return I(n)?n:()=>n},n.debounce=function(n,t){let e;return r=>{e&&clearTimeout(e),e=setTimeout((()=>(t(r),e=null)),n)}},n.error=i,n.extend=U,n.extent=function(n,t){let e,r,o,u,i=0;if(n&&(e=n.length))if(null==t){for(r=n[i];i<e&&(null==r||r!=r);r=n[++i]);for(o=u=r;i<e;++i)r=n[i],null!=r&&(r<o&&(o=r),r>u&&(u=r))}else{for(r=t(n[i]);i<e&&(null==r||r!=r);r=t(n[++i]));for(o=u=r;i<e;++i)r=t(n[i]),null!=r&&(r<o&&(o=r),r>u&&(u=r))}return[o,u]},n.extentIndex=function(n,t){const e=n.length;let r,o,u,i,c,l=-1;if(null==t){for(;++l<e;)if(o=n[l],null!=o&&o>=o){r=u=o;break}if(l===e)return[-1,-1];for(i=c=l;++l<e;)o=n[l],null!=o&&(r>o&&(r=o,i=l),u<o&&(u=o,c=l))}else{for(;++l<e;)if(o=t(n[l],l,n),null!=o&&o>=o){r=u=o;break}if(l===e)return[-1,-1];for(i=c=l;++l<e;)o=t(n[l],l,n),null!=o&&(r>o&&(r=o,i=l),u<o&&(u=o,c=l))}return[i,c]},n.falsy=p,n.fastmap=function(n){let t,e={};function r(n){return G(e,n)&&e[n]!==J}const o={size:0,empty:0,object:e,has:r,get:n=>r(n)?e[n]:void 0,set(n,t){return r(n)||(++o.size,e[n]===J&&--o.empty),e[n]=t,this},delete(n){return r(n)&&(--o.size,++o.empty,e[n]=J),this},clear(){o.size=o.empty=0,o.object=e={}},test(n){return arguments.length?(t=n,o):t},clean(){const n={};let r=0;for(const o in e){const u=e[o];u===J||t&&t(u)||(n[o]=u,++r)}o.size=r,o.empty=0,o.object=e=n}};return n&&Object.keys(n).forEach((t=>{o.set(t,n[t])})),o},n.field=l,n.flush=function(n,t,e,r,o,u){if(!e&&0!==e)return u;const i=+e;let c,l=n[0],s=z(n);s<l&&(c=l,l=s,s=c),c=Math.abs(t-l);const f=Math.abs(s-t);return c<f&&c<=i?r:f<=i?o:u},n.hasOwnProperty=G,n.id=s,n.identity=f,n.inherits=function(n,t,e){const r=n.prototype=Object.create(t.prototype);return Object.defineProperty(r,"constructor",{value:n,writable:!0,enumerable:!0,configurable:!0}),U(r,e)},n.inrange=function(n,t,e,r){let o,u=t[0],i=t[t.length-1];return u>i&&(o=u,u=i,i=o),r=void 0===r||r,((e=void 0===e||e)?u<=n:u<n)&&(r?n<=i:n<i)},n.isArray=w,n.isBoolean=function(n){return"boolean"==typeof n},n.isDate=V,n.isFunction=I,n.isIterable=function(n){return n&&I(n[Symbol.iterator])},n.isNumber=$,n.isObject=O,n.isRegExp=function(n){return"[object RegExp]"===Object.prototype.toString.call(n)},n.isString=H,n.key=function(n,e,o){n&&(n=e?C(n).map((n=>n.replace(/\\(.)/g,"$1"))):C(n));const u=n&&n.length,i=o&&o.get||r,l=n=>i(e?[n]:c(n));let s;if(u)if(1===u){const t=l(n[0]);s=function(n){return""+t(n)}}else{const t=n.map(l);s=function(n){let e=""+t[0](n),r=0;for(;++r<u;)e+="|"+t[r](n);return e}}else s=function(){return""};return t(s,n,"key")},n.lerp=function(n,t){const e=n[0],r=z(n),o=+t;return o?1===o?r:e+o*(r-e):e},n.logger=function(n,t){let e=arguments.length>2&&void 0!==arguments[2]?arguments[2]:y,r=n||m;return{level(n){return arguments.length?(r=+n,this):r},error(){return r>=b&&e(t||"error","ERROR",arguments),this},warn(){return r>=d&&e(t||"warn","WARN",arguments),this},info(){return r>=M&&e(t||"log","INFO",arguments),this},debug(){return r>=j&&e(t||"log","DEBUG",arguments),this}}},n.lruCache=function(n){let t,e,r;n=+n||K;const o=()=>{t={},e={},r=0},u=(o,u)=>(++r>n&&(e=t,t={},r=1),t[o]=u);return o(),{clear:o,has:n=>G(t,n)||G(e,n),get:n=>G(t,n)?t[n]:G(e,n)?u(n,e[n]):void 0,set:(n,e)=>G(t,n)?t[n]=e:u(n,e)}},n.merge=function(n,t,e,r){const o=t.length,u=e.length;if(!u)return t;if(!o)return e;const i=r||new t.constructor(o+u);let c=0,l=0,s=0;for(;c<o&&l<u;++s)i[s]=n(t[c],e[l])>0?e[l++]:t[c++];for(;c<o;++c,++s)i[s]=t[c];for(;l<u;++l,++s)i[s]=e[l];return i},n.mergeConfig=function(){for(var n=arguments.length,t=new Array(n),e=0;e<n;e++)t[e]=arguments[e];return t.reduce(((n,t)=>{for(const e in t)if("signals"===e)n.signals=E(n.signals,t.signals);else{const r="legend"===e?{layout:1}:"style"===e||null;v(n,e,t[e],r)}return n}),{})},n.one=g,n.pad=function(n,t,e,r){const o=e||" ",u=n+"",i=t-u.length;return i<=0?u:"left"===r?Q(o,i)+u:"center"===r?Q(o,~~(i/2))+u+Q(o,Math.ceil(i/2)):u+Q(o,i)},n.panLinear=function(n,t){return P(n,t,A,f)},n.panLog=function(n,t){var e=Math.sign(n[0]);return P(n,t,k(e),D(e))},n.panPow=function(n,t,e){return P(n,t,R(e),R(1/e))},n.panSymlog=function(n,t,e){return P(n,t,S(e),N(e))},n.peek=z,n.quarter=function(n){return 1+~~(new Date(n).getMonth()/3)},n.repeat=Q,n.span=function(n){return n&&z(n)-n[0]||0},n.splitAccessPath=c,n.stringValue=function n(t){return w(t)?"["+t.map(n)+"]":O(t)||H(t)?JSON.stringify(t).replace("\u2028","\\u2028").replace("\u2029","\\u2029"):t},n.toBoolean=function(n){return null==n||""===n?null:!(!n||"false"===n||"0"===n)&&!!n},n.toDate=function(n,t){return t=t||X,null==n||""===n?null:t(n)},n.toNumber=A,n.toSet=function(n){const t={},e=n.length;for(let r=0;r<e;++r)t[n[r]]=!0;return t},n.toString=function(n){return null==n||""===n?null:n+""},n.truncate=function(n,t,e,r){const o=null!=r?r:"…",u=n+"",i=u.length,c=Math.max(0,t-o.length);return i<=t?u:"left"===e?o+u.slice(i-c):"center"===e?u.slice(0,Math.ceil(c/2))+o+u.slice(i-~~(c/2)):u.slice(0,c)+o},n.truthy=h,n.utcquarter=function(n){return 1+~~(new Date(n).getUTCMonth()/3)},n.visitArray=function(n,t,e){if(n)if(t){const r=n.length;for(let o=0;o<r;++o){const r=t(n[o]);r&&e(r,o,n)}}else n.forEach(e)},n.writeConfig=v,n.zero=a,n.zoomLinear=function(n,t,e){return T(n,t,e,A,f)},n.zoomLog=function(n,t,e){const r=Math.sign(n[0]);return T(n,t,e,k(r),D(r))},n.zoomPow=function(n,t,e,r){return T(n,t,e,R(r),R(1/r))},n.zoomSymlog=function(n,t,e,r){return T(n,t,e,S(r),N(r))}}));
 //# sourceMappingURL=vega-util.min.js.map

build/vega-util.module.js

@@ -16,7 +16,5 @@ function accessor (fn, fields, name) {
 }
-
 const get1 = field => function (obj) {
   return obj[field];
 };
-
 const getN = path => {
@@ -28,3 +26,2 @@ const len = path.length;
     }
-
     return obj;
@@ -40,11 +37,10 @@ };
   const path = [],
-        n = p.length;
+    n = p.length;
   let q = null,
-      b = 0,
-      s = '',
-      i,
-      j,
-      c;
+    b = 0,
+    s = '',
+    i,
+    j,
+    c;
   p = p + '';
-
   function push() {
@@ -55,6 +51,4 @@ path.push(s + p.substring(i, j));
   }
-
   for (i = j = 0; j < n; ++j) {
     c = p[j];
-
     if (c === '\\') {
@@ -92,6 +86,4 @@ s += p.substring(i, j);
   }
-
   if (b) error('Access path missing closing bracket: ' + p);
   if (q) error('Access path missing closing quote: ' + p);
-
   if (j > i) {
@@ -101,3 +93,2 @@ j++;
   }
-
   return path;
@@ -129,3 +120,4 @@ }
 const Debug = 4;
-function logger (_, method, handler = log$1) {
+function logger (_, method) {
+  let handler = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : log$1;
   let level = _ || None;
@@ -141,3 +133,2 @@ return {
     },
-
     error() {
@@ -147,3 +138,2 @@ if (level >= Error$1) handler(method || 'error', 'ERROR', arguments);
     },
-
     warn() {
@@ -153,3 +143,2 @@ if (level >= Warn) handler(method || 'warn', 'WARN', arguments);
     },
-
     info() {
@@ -159,3 +148,2 @@ if (level >= Info) handler(method || 'log', 'INFO', arguments);
     },
-
     debug() {
@@ -165,3 +153,2 @@ if (level >= Debug) handler(method || 'log', 'DEBUG', arguments);
     }
-
   };
@@ -177,4 +164,6 @@ }
 const isLegalKey = key => key !== '__proto__';
-
-function mergeConfig(...configs) {
+function mergeConfig() {
+  for (var _len = arguments.length, configs = new Array(_len), _key = 0; _key < _len; _key++) {
+    configs[_key] = arguments[_key];
+  }
   return configs.reduce((out, source) => {
@@ -198,3 +187,2 @@ for (const key in source) {
     }
-
     return out;
@@ -206,6 +194,4 @@ }, {});
   let k, o;
-
   if (isObject(value) && !isArray(value)) {
     o = isObject(output[key]) ? output[key] : output[key] = {};
-
     for (k in value) {
@@ -222,8 +208,6 @@ if (recurse && (recurse === true || recurse[k])) {
 }
-
 function mergeNamed(a, b) {
   if (a == null) return b;
   const map = {},
-        out = [];
-
+    out = [];
   function add(_) {
@@ -235,3 +219,2 @@ if (!map[_.name]) {
   }
-
   b.forEach(add);
@@ -251,18 +234,12 @@ a.forEach(add);
 const exp = sign => x => sign * Math.exp(x);
-
 const log = sign => x => Math.log(sign * x);
-
 const symlog = c => x => Math.sign(x) * Math.log1p(Math.abs(x / c));
-
 const symexp = c => x => Math.sign(x) * Math.expm1(Math.abs(x)) * c;
-
 const pow = exponent => x => x < 0 ? -Math.pow(-x, exponent) : Math.pow(x, exponent);
-
 function pan(domain, delta, lift, ground) {
   const d0 = lift(domain[0]),
-        d1 = lift(peek(domain)),
-        dd = (d1 - d0) * delta;
+    d1 = lift(peek(domain)),
+    dd = (d1 - d0) * delta;
   return [ground(d0 - dd), ground(d1 - dd)];
 }
-
 function panLinear(domain, delta) {
@@ -281,10 +258,8 @@ return pan(domain, delta, toNumber, identity);
 }
-
 function zoom(domain, anchor, scale, lift, ground) {
   const d0 = lift(domain[0]),
-        d1 = lift(peek(domain)),
-        da = anchor != null ? lift(anchor) : (d0 + d1) / 2;
+    d1 = lift(peek(domain)),
+    da = anchor != null ? lift(anchor) : (d0 + d1) / 2;
   return [ground(da + (d0 - da) * scale), ground(da + (d1 - da) * scale)];
 }
-
 function zoomLinear(domain, anchor, scale) {
@@ -324,5 +299,4 @@ return zoom(domain, anchor, scale, toNumber, identity);
   let lo = range[0],
-      hi = range[1],
-      span;
-
+    hi = range[1],
+    span;
   if (hi < lo) {
@@ -333,3 +307,2 @@ span = hi;
   }
-
   span = hi - lo;
@@ -348,5 +321,5 @@ return span >= max - min ? [min, max] : [lo = Math.min(Math.max(lo, min), max - span), lo + span];
   const ord = [],
-        get = [],
-        fmap = {},
-        gen = opt.comparator || comparator;
+    get = [],
+    fmap = {},
+    gen = opt.comparator || comparator;
   array(fields).forEach((f, i) => {
@@ -361,17 +334,12 @@ if (f == null) return;
 const ascending = (u, v) => (u < v || u == null) && v != null ? -1 : (u > v || v == null) && u != null ? 1 : (v = v instanceof Date ? +v : v, u = u instanceof Date ? +u : u) !== u && v === v ? -1 : v !== v && u === u ? 1 : 0;
-
 const comparator = (fields, orders) => fields.length === 1 ? compare1(fields[0], orders[0]) : compareN(fields, orders, fields.length);
-
 const compare1 = (field, order) => function (a, b) {
   return ascending(field(a), field(b)) * order;
 };
-
 const compareN = (fields, orders, n) => {
   orders.push(0); // pad zero for convenient lookup
-
   return function (a, b) {
     let f,
-        c = 0,
-        i = -1;
-
+      c = 0,
+      i = -1;
     while (c === 0 && ++i < n) {
@@ -381,3 +349,2 @@ f = fields[i];
     }
-
     return c * orders[i];
@@ -402,3 +369,2 @@ };
     x = arguments[i];
-
     for (k in x) {
@@ -408,3 +374,2 @@ _[k] = x[k];
   }
-
   return _;
@@ -419,7 +384,6 @@ }
   let i = 0,
-      n,
-      v,
-      min,
-      max;
-
+    n,
+    v,
+    min,
+    max;
   if (array && (n = array.length)) {
@@ -429,8 +393,8 @@ if (f == null) {
       for (v = array[i]; i < n && (v == null || v !== v); v = array[++i]);
+      min = max = v;
 
-      min = max = v; // visit all other values
-
+      // visit all other values
       for (; i < n; ++i) {
-        v = array[i]; // skip null/undefined; NaN will fail all comparisons
-
+        v = array[i];
+        // skip null/undefined; NaN will fail all comparisons
         if (v != null) {
@@ -444,8 +408,8 @@ if (v < min) min = v;
       for (v = f(array[i]); i < n && (v == null || v !== v); v = f(array[++i]));
+      min = max = v;
 
-      min = max = v; // visit all other values
-
+      // visit all other values
       for (; i < n; ++i) {
-        v = f(array[i]); // skip null/undefined; NaN will fail all comparisons
-
+        v = f(array[i]);
+        // skip null/undefined; NaN will fail all comparisons
         if (v != null) {
@@ -458,3 +422,2 @@ if (v < min) min = v;
   }
-
   return [min, max];
@@ -466,12 +429,10 @@ }
   let i = -1,
-      a,
-      b,
-      c,
-      u,
-      v;
-
+    a,
+    b,
+    c,
+    u,
+    v;
   if (f == null) {
     while (++i < n) {
       b = array[i];
-
       if (b != null && b >= b) {
@@ -482,9 +443,6 @@ a = c = b;
     }
-
     if (i === n) return [-1, -1];
     u = v = i;
-
     while (++i < n) {
       b = array[i];
-
       if (b != null) {
@@ -495,3 +453,2 @@ if (a > b) {
         }
-
         if (c < b) {
@@ -506,3 +463,2 @@ c = b;
       b = f(array[i], i, array);
-
       if (b != null && b >= b) {
@@ -513,9 +469,6 @@ a = c = b;
     }
-
     if (i === n) return [-1, -1];
     u = v = i;
-
     while (++i < n) {
       b = f(array[i], i, array);
-
       if (b != null) {
@@ -526,3 +479,2 @@ if (a > b) {
         }
-
         if (c < b) {
@@ -535,3 +487,2 @@ c = b;
   }
-
   return [u, v];
@@ -548,8 +499,6 @@ }
   let obj = {},
-      test;
-
+    test;
   function has$1(key) {
     return has(obj, key) && obj[key] !== NULL;
   }
-
   const map = {
@@ -560,7 +509,5 @@ size: 0,
     has: has$1,
-
     get(key) {
       return has$1(key) ? obj[key] : undefined;
     },
-
     set(key, value) {
@@ -571,7 +518,5 @@ if (!has$1(key)) {
       }
-
       obj[key] = value;
       return this;
     },
-
     delete(key) {
@@ -583,6 +528,4 @@ if (has$1(key)) {
       }
-
       return this;
     },
-
     clear() {
@@ -592,3 +535,2 @@ map.size = map.empty = 0;
     },
-
     test(_) {
@@ -602,10 +544,7 @@ if (arguments.length) {
     },
-
     clean() {
       const next = {};
       let size = 0;
-
       for (const key in obj) {
         const value = obj[key];
-
         if (value !== NULL && (!test || !test(value))) {
@@ -616,3 +555,2 @@ next[key] = value;
       }
-
       map.size = size;
@@ -622,3 +560,2 @@ map.empty = 0;
     }
-
   };
@@ -635,5 +572,6 @@ if (input) Object.keys(input).forEach(key => {
   let a = range[0],
-      b = peek(range),
-      l; // swap endpoints if range is reversed
+    b = peek(range),
+    l;
 
+  // swap endpoints if range is reversed
   if (b < a) {
@@ -643,8 +581,9 @@ l = a;
     b = l;
-  } // compare value to endpoints
+  }
 
-
+  // compare value to endpoints
   l = Math.abs(value - a);
-  const r = Math.abs(b - value); // adjust if value is within threshold distance of endpoint
+  const r = Math.abs(b - value);
 
+  // adjust if value is within threshold distance of endpoint
   return l < r && l <= t ? left : r <= t ? right : center;
@@ -671,5 +610,4 @@ }
   let r0 = range[0],
-      r1 = range[range.length - 1],
-      t;
-
+    r1 = range[range.length - 1],
+    t;
   if (r0 > r1) {
@@ -680,3 +618,2 @@ t = r0;
   }
-
   left = left === undefined || left;
@@ -715,9 +652,6 @@ right = right === undefined || right;
   }
-
   const len = fields && fields.length,
-        gen = opt && opt.get || getter,
-        map = f => gen(flat ? [f] : splitAccessPath(f));
-
+    gen = opt && opt.get || getter,
+    map = f => gen(flat ? [f] : splitAccessPath(f));
   let fn;
-
   if (!len) {
@@ -729,3 +663,2 @@ fn = function () {
     const get = map(fields[0]);
-
     fn = function (_) {
@@ -736,13 +669,9 @@ return '' + get(_);
     const get = fields.map(map);
-
     fn = function (_) {
       let s = '' + get[0](_),
-          i = 0;
-
+        i = 0;
       while (++i < len) s += '|' + get[i](_);
-
       return s;
     };
   }
-
   return accessor(fn, fields, 'key');
@@ -753,13 +682,13 @@ }
   const lo = array[0],
-        hi = peek(array),
-        f = +frac;
+    hi = peek(array),
+    f = +frac;
   return !f ? lo : f === 1 ? hi : lo + f * (hi - lo);
 }
 
-const DEFAULT_MAX_SIZE = 10000; // adapted from https://github.com/dominictarr/hashlru/ (MIT License)
+const DEFAULT_MAX_SIZE = 10000;
 
+// adapted from https://github.com/dominictarr/hashlru/ (MIT License)
 function lruCache (maxsize) {
   maxsize = +maxsize || DEFAULT_MAX_SIZE;
   let curr, prev, size;
-
   const clear = () => {
@@ -770,3 +699,2 @@ curr = {};
   };
-
   const update = (key, value) => {
@@ -778,6 +706,4 @@ if (++size > maxsize) {
     }
-
     return curr[key] = value;
   };
-
   clear();
@@ -794,3 +720,3 @@ return {
   const n0 = array0.length,
-        n1 = array1.length;
+    n1 = array1.length;
   if (!n1) return array0;
@@ -800,17 +726,13 @@ if (!n0) return array1;
   let i0 = 0,
-      i1 = 0,
-      i = 0;
-
+    i1 = 0,
+    i = 0;
   for (; i0 < n0 && i1 < n1; ++i) {
     merged[i] = compare(array0[i0], array1[i1]) > 0 ? array1[i1++] : array0[i0++];
   }
-
   for (; i0 < n0; ++i0, ++i) {
     merged[i] = array0[i0];
   }
-
   for (; i1 < n1; ++i1, ++i) {
     merged[i] = array1[i1];
   }
-
   return merged;
@@ -821,5 +743,3 @@ }
   let s = '';
-
   while (--reps >= 0) s += str;
-
   return s;
@@ -830,4 +750,4 @@ }
   const c = padchar || ' ',
-        s = str + '',
-        n = length - s.length;
+    s = str + '',
+    n = length - s.length;
   return n <= 0 ? s : align === 'left' ? repeat(c, n) + s : align === 'center' ? repeat(c, ~~(n / 2)) + s + repeat(c, Math.ceil(n / 2)) : s + repeat(c, n);
@@ -840,3 +760,2 @@ }
  */
-
 function span (array) {
@@ -847,3 +766,4 @@ return array && peek(array) - array[0] || 0;
 function $(x) {
-  return isArray(x) ? '[' + x.map($) + ']' : isObject(x) || isString(x) ? // Output valid JSON and JS source strings.
+  return isArray(x) ? '[' + x.map($) + ']' : isObject(x) || isString(x) ?
+  // Output valid JSON and JS source strings.
   // See http://timelessrepo.com/json-isnt-a-javascript-subset
@@ -858,3 +778,2 @@ JSON.stringify(x).replace('\u2028', '\\u2028').replace('\u2029', '\\u2029') : x;
 const defaultParser = _ => isNumber(_) ? _ : isDate(_) ? _ : Date.parse(_);
-
 function toDate (_, parser) {
@@ -871,6 +790,4 @@ parser = parser || defaultParser;
   const s = {},
-        n = _.length;
-
+    n = _.length;
   for (let i = 0; i < n; ++i) s[_[i]] = true;
-
   return s;
@@ -881,5 +798,5 @@ }
   const e = ellipsis != null ? ellipsis : '\u2026',
-        s = str + '',
-        n = s.length,
-        l = Math.max(0, length - e.length);
+    s = str + '',
+    n = s.length,
+    l = Math.max(0, length - e.length);
   return n <= length ? s : align === 'left' ? e + s.slice(n - l) : align === 'center' ? s.slice(0, Math.ceil(l / 2)) + e + s.slice(n - ~~(l / 2)) : s.slice(0, l) + e;
@@ -892,3 +809,2 @@ }
       const n = array.length;
-
       for (let i = 0; i < n; ++i) {
@@ -895,0 +811,0 @@ const t = filter(array[i]);

package.json

 {
   "name": "vega-util",
-  "version": "1.17.0",
+  "version": "1.17.1",
   "description": "JavaScript utilities for Vega.",
@@ -18,3 +18,3 @@ "keywords": [
     "prebuild": "rimraf build",
-    "build": "rollup -c",
+    "build": "rollup -c rollup.config.mjs",
     "pretest": "yarn build --config-test",
@@ -24,3 +24,3 @@ "test": "tape 'test/**/*-test.js'",
   },
-  "gitHead": "774165e29850b66ec8b79ba52a7955f1ab936ea6"
+  "gitHead": "fb1092f6b931d450f9c210b67ae4752bd3dd461b"
 }

tsconfig.json

 {
-    "compilerOptions": {
-        "module": "commonjs",
-        "noImplicitAny": true,
-        "noImplicitThis": true,
-        "strictNullChecks": true,
-        "strictFunctionTypes": true,
-        "noEmit": true,
-        "forceConsistentCasingInFileNames": true
-    },
-    "files": [
-        "index.d.ts"
-    ]
+  "compilerOptions": {
+    "module": "commonjs",
+    "lib": ["es6", "dom"],
+    "noImplicitAny": true,
+    "noImplicitThis": true,
+    "strictNullChecks": true,
+    "strictFunctionTypes": true,
+    "noEmit": true,
+    "forceConsistentCasingInFileNames": true
+  },
+  "files": [
+    "index.d.ts"
+  ]
 }

No alert changes

Improved metrics

Total package byte prevSize

154927

increased by1.15%

Lines of code

2468

increased by0.9%

No dependency changes