vega 0.4.0 → 0.6.0

data/vendor/assets/javascripts/vega.js

@@ -100,6 +100,11 @@
   const one$2 = accessor(() => 1, [], 'one');
   const truthy = accessor(() => true, [], 'true');
   const falsy = accessor(() => false, [], 'false');
+
+  /** Utilities common to vega-interpreter and vega-expression for evaluating expresions */
+
+  /** JSON authors are not allowed to set these properties, as these are built-in to the JS Object Prototype and should not be overridden. */
+  const DisallowedObjectProperties = new Set([...Object.getOwnPropertyNames(Object.prototype).filter(name => typeof Object.prototype[name] === 'function'), '__proto__']);
   function log$1$1(method, level, input) {
     const args = [level].concat([].slice.call(input));
     console[method].apply(console, args); // eslint-disable-line no-console
@@ -109,8 +114,7 @@
   const Warn = 2;
   const Info = 3;
   const Debug = 4;
-  function logger(_, method) {
-    let handler = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : log$1$1;
+  function logger(_, method, handler = log$1$1) {
     let level = _ || None$2;
     return {
       level(_) {
@@ -144,10 +148,7 @@
     return _ === Object(_);
   }
   const isLegalKey = key => key !== '__proto__';
-  function mergeConfig() {
-    for (var _len = arguments.length, configs = new Array(_len), _key = 0; _key < _len; _key++) {
-      configs[_key] = arguments[_key];
-    }
+  function mergeConfig(...configs) {
     return configs.reduce((out, source) => {
       for (const key in source) {
         if (key === 'signals') {
@@ -434,9 +435,8 @@
     }
     return [u, v];
   }
-  const hop = Object.prototype.hasOwnProperty;
   function has$1(object, property) {
-    return hop.call(object, property);
+    return Object.hasOwn(object, property);
   }
   const NULL = {};
   function fastmap(input) {
@@ -670,10 +670,10 @@
     return array && peek$1(array) - array[0] || 0;
   }
   function $(x) {
-    return isArray(x) ? '[' + x.map($) + ']' : isObject(x) || isString(x) ?
+    return isArray(x) ? `[${x.map(v => v === null ? 'null' : $(v))}]` : isObject(x) || isString(x) ?
     // Output valid JSON and JS source strings.
-    // See http://timelessrepo.com/json-isnt-a-javascript-subset
-    JSON.stringify(x).replace('\u2028', '\\u2028').replace('\u2029', '\\u2029') : x;
+    // See https://github.com/judofyr/timeless/blob/master/posts/json-isnt-a-javascript-subset.md
+    JSON.stringify(x).replaceAll('\u2028', '\\u2028').replaceAll('\u2029', '\\u2029') : x;
   }
   function toBoolean(_) {
     return _ == null || _ === '' ? null : !_ || _ === 'false' || _ === '0' ? false : !!_;
@@ -1146,9 +1146,7 @@
       compare2 = f;
       delta = f;
     }
-    function left(a, x) {
-      let lo = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
-      let hi = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : a.length;
+    function left(a, x, lo = 0, hi = a.length) {
       if (lo < hi) {
         if (compare1(x, x) !== 0) return hi;
         do {
@@ -1158,9 +1156,7 @@
       }
       return lo;
     }
-    function right(a, x) {
-      let lo = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
-      let hi = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : a.length;
+    function right(a, x, lo = 0, hi = a.length) {
       if (lo < hi) {
         if (compare1(x, x) !== 0) return hi;
         do {
@@ -1170,9 +1166,7 @@
       }
       return lo;
     }
-    function center(a, x) {
-      let lo = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
-      let hi = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : a.length;
+    function center(a, x, lo = 0, hi = a.length) {
       const i = left(a, x, lo, hi - 1);
       return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;
     }
@@ -1289,8 +1283,7 @@
   }
 
   class InternMap extends Map {
-    constructor(entries) {
-      let key = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : keyof;
+    constructor(entries, key = keyof) {
       super();
       Object.defineProperties(this, {
         _intern: {
@@ -1316,8 +1309,7 @@
     }
   }
   class InternSet extends Set {
-    constructor(values) {
-      let key = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : keyof;
+    constructor(values, key = keyof) {
       super();
       Object.defineProperties(this, {
         _intern: {
@@ -1339,29 +1331,26 @@
       return super.delete(intern_delete(this, value));
     }
   }
-  function intern_get(_ref, value) {
-    let {
-      _intern,
-      _key
-    } = _ref;
+  function intern_get({
+    _intern,
+    _key
+  }, value) {
     const key = _key(value);
     return _intern.has(key) ? _intern.get(key) : value;
   }
-  function intern_set(_ref2, value) {
-    let {
-      _intern,
-      _key
-    } = _ref2;
+  function intern_set({
+    _intern,
+    _key
+  }, value) {
     const key = _key(value);
     if (_intern.has(key)) return _intern.get(key);
     _intern.set(key, value);
     return value;
   }
-  function intern_delete(_ref3, value) {
-    let {
-      _intern,
-      _key
-    } = _ref3;
+  function intern_delete({
+    _intern,
+    _key
+  }, value) {
     const key = _key(value);
     if (_intern.has(key)) {
       value = _intern.get(key);
@@ -1377,8 +1366,7 @@
     return Array.from(keys, key => source[key]);
   }
 
-  function compareDefined() {
-    let compare = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : ascending$1;
+  function compareDefined(compare = ascending$1) {
     if (compare === ascending$1) return ascendingDefined;
     if (typeof compare !== "function") throw new TypeError("compare is not a function");
     return (a, b) => {
@@ -1484,10 +1472,7 @@
 
   // Based on https://github.com/mourner/quickselect
   // ISC license, Copyright 2018 Vladimir Agafonkin.
-  function quickselect(array, k) {
-    let left = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
-    let right = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : Infinity;
-    let compare = arguments.length > 4 ? arguments[4] : undefined;
+  function quickselect(array, k, left = 0, right = Infinity, compare) {
     k = Math.floor(k);
     left = Math.floor(Math.max(0, left));
     right = Math.floor(Math.min(array.length - 1, right));
@@ -1538,8 +1523,7 @@
       value1 = min$2(values.subarray(i0 + 1));
     return value0 + (value1 - value0) * (i - i0);
   }
-  function quantileSorted(values, p) {
-    let valueof = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : number$6;
+  function quantileSorted(values, p, valueof = number$6) {
     if (!(n = values.length) || isNaN(p = +p)) return;
     if (p <= 0 || n < 2) return +valueof(values[0], 0, values);
     if (p >= 1) return +valueof(values[n - 1], n - 1, values);
@@ -1607,10 +1591,7 @@
     return sum;
   }
 
-  function intersection(values) {
-    for (var _len = arguments.length, others = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
-      others[_key - 1] = arguments[_key];
-    }
+  function intersection(values, ...others) {
     values = new InternSet(values);
     others = others.map(set$4);
     out: for (const value of values) {
@@ -1627,11 +1608,8 @@
     return values instanceof InternSet ? values : new InternSet(values);
   }
 
-  function union() {
+  function union(...others) {
     const set = new InternSet();
-    for (var _len = arguments.length, others = new Array(_len), _key = 0; _key < _len; _key++) {
-      others[_key] = arguments[_key];
-    }
     for (const other of others) {
       for (const o of other) {
         set.add(o);
@@ -1984,7 +1962,7 @@
           if (step < 0) while (++step <= 0) {
             while (offseti(date, -1), !test(date)) {} // eslint-disable-line no-empty
           } else while (--step >= 0) {
-            while (offseti(date, +1), !test(date)) {} // eslint-disable-line no-empty
+            while (offseti(date, 1), !test(date)) {} // eslint-disable-line no-empty
           }
         }
       });
@@ -2238,10 +2216,7 @@
     }
     function tickInterval(start, stop, count) {
       const target = Math.abs(stop - start) / count;
-      const i = bisector(_ref => {
-        let [,, step] = _ref;
-        return step;
-      }).right(tickIntervals, target);
+      const i = bisector(([,, step]) => step).right(tickIntervals, target);
       if (i === tickIntervals.length) return year.every(tickStep(start / durationYear$1, stop / durationYear$1, count));
       if (i === 0) return millisecond.every(Math.max(tickStep(start, stop, count), 1));
       const [t, step] = tickIntervals[target / tickIntervals[i - 1][2] < tickIntervals[i][2] / target ? i - 1 : i];
@@ -3362,22 +3337,20 @@
   /**
    * Factory for a loader constructor that provides methods for requesting
    * files from either the network or disk, and for sanitizing request URIs.
-   * @param {function} fetch - The Fetch API for HTTP network requests.
-   *   If null or undefined, HTTP loading will be disabled.
    * @param {object} fs - The file system interface for file loading.
    *   If null or undefined, local file loading will be disabled.
    * @return {function} A loader constructor with the following signature:
    *   param {object} [options] - Optional default loading options to use.
    *   return {object} - A new loader instance.
    */
-  function loaderFactory(fetch, fs) {
+  function loaderFactory(fs) {
     return options => ({
       options: options || {},
       sanitize: sanitize,
       load: load$1,
-      fileAccess: !!fs,
-      file: fileLoader(fs),
-      http: httpLoader(fetch)
+      fileAccess: false,
+      file: fileLoader(),
+      http: httpLoader
     });
   }
 
@@ -3394,7 +3367,7 @@
   async function load$1(uri, options) {
     const opt = await this.sanitize(uri, options),
       url = opt.href;
-    return opt.localFile ? this.file(url) : this.http(url, options);
+    return opt.localFile ? this.file(url) : this.http(url, options?.http);
   }
 
   /**
@@ -3482,11 +3455,7 @@
    *   return {Promise} A promise that resolves to the file contents.
    */
   function fileLoader(fs) {
-    return fs ? filename => new Promise((accept, reject) => {
-      fs.readFile(filename, (error, data) => {
-        if (error) reject(error);else accept(data);
-      });
-    }) : fileReject;
+    return fileReject;
   }
 
   /**
@@ -3497,27 +3466,16 @@
   }
 
   /**
-   * HTTP request handler factory.
-   * @param {function} fetch - The Fetch API method.
-   * @return {function} - An http loader with the following signature:
-   *   param {string} url - The url to request.
-   *   param {object} options - An options hash.
-   *   return {Promise} - A promise that resolves to the file contents.
+   * An http loader.
+   * @param {string} url - The url to request.
+   * @param {Partial<RequestInit>} options - An options hash.
+   * @return {Promise} - A promise that resolves to the file contents.
    */
-  function httpLoader(fetch) {
-    return fetch ? async function (url, options) {
-      const opt = extend$1({}, this.options.http, options),
-        type = options && options.response,
-        response = await fetch(url, opt);
-      return !response.ok ? error(response.status + '' + response.statusText) : isFunction(response[type]) ? response[type]() : response.text();
-    } : httpReject;
-  }
-
-  /**
-   * Default http request handler that simply rejects.
-   */
-  async function httpReject() {
-    error('No HTTP fetch method available.');
+  async function httpLoader(url, options) {
+    const opt = extend$1({}, this.options.http, options),
+      type = options && options.response,
+      response = await fetch(url, opt);
+    return !response.ok ? error(response.status + '' + response.statusText) : isFunction(response[type]) ? response[type]() : response.text();
   }
   const isValid = _ => _ != null && _ === _;
   const isBoolean = _ => _ === 'true' || _ === 'false' || _ === true || _ === false;
@@ -3677,10 +3635,7 @@
       }
     }
   }
-  const loader = loaderFactory(typeof fetch !== 'undefined' && fetch,
-  // use built-in fetch API
-  null // no file system access
-  );
+  const loader = loaderFactory();
 
   function UniqueList(idFunc) {
     const $ = idFunc || identity$6,
@@ -5128,8 +5083,6 @@
     }
   });
 
-  /* eslint-disable require-atomic-updates */
-
   /**
    * Evaluates the dataflow and returns a Promise that resolves when pulse
    * propagation completes. This method will increment the current timestamp
@@ -6062,67 +6015,67 @@
       p;
     if (w < 6.25) {
       w -= 3.125;
-      p = -3.6444120640178196996e-21;
-      p = -1.685059138182016589e-19 + p * w;
+      p = -364441206401782e-35;
+      p = -16850591381820166e-35 + p * w;
       p = 1.2858480715256400167e-18 + p * w;
       p = 1.115787767802518096e-17 + p * w;
-      p = -1.333171662854620906e-16 + p * w;
+      p = -1333171662854621e-31 + p * w;
       p = 2.0972767875968561637e-17 + p * w;
       p = 6.6376381343583238325e-15 + p * w;
-      p = -4.0545662729752068639e-14 + p * w;
-      p = -8.1519341976054721522e-14 + p * w;
+      p = -4054566272975207e-29 + p * w;
+      p = -8151934197605472e-29 + p * w;
       p = 2.6335093153082322977e-12 + p * w;
-      p = -1.2975133253453532498e-11 + p * w;
-      p = -5.4154120542946279317e-11 + p * w;
+      p = -12975133253453532e-27 + p * w;
+      p = -5415412054294628e-26 + p * w;
       p = 1.051212273321532285e-09 + p * w;
-      p = -4.1126339803469836976e-09 + p * w;
-      p = -2.9070369957882005086e-08 + p * w;
+      p = -4.112633980346984e-9 + p * w;
+      p = -2.9070369957882005e-8 + p * w;
       p = 4.2347877827932403518e-07 + p * w;
-      p = -1.3654692000834678645e-06 + p * w;
-      p = -1.3882523362786468719e-05 + p * w;
+      p = -13654692000834679e-22 + p * w;
+      p = -13882523362786469e-21 + p * w;
       p = 0.0001867342080340571352 + p * w;
-      p = -0.00074070253416626697512 + p * w;
-      p = -0.0060336708714301490533 + p * w;
+      p = -740702534166267e-18 + p * w;
+      p = -0.006033670871430149 + p * w;
       p = 0.24015818242558961693 + p * w;
       p = 1.6536545626831027356 + p * w;
     } else if (w < 16.0) {
       w = Math.sqrt(w) - 3.25;
       p = 2.2137376921775787049e-09;
       p = 9.0756561938885390979e-08 + p * w;
-      p = -2.7517406297064545428e-07 + p * w;
+      p = -2.7517406297064545e-7 + p * w;
       p = 1.8239629214389227755e-08 + p * w;
       p = 1.5027403968909827627e-06 + p * w;
-      p = -4.013867526981545969e-06 + p * w;
+      p = -4013867526981546e-21 + p * w;
       p = 2.9234449089955446044e-06 + p * w;
       p = 1.2475304481671778723e-05 + p * w;
-      p = -4.7318229009055733981e-05 + p * w;
+      p = -47318229009055734e-21 + p * w;
       p = 6.8284851459573175448e-05 + p * w;
       p = 2.4031110387097893999e-05 + p * w;
-      p = -0.0003550375203628474796 + p * w;
+      p = -3550375203628475e-19 + p * w;
       p = 0.00095328937973738049703 + p * w;
-      p = -0.0016882755560235047313 + p * w;
+      p = -0.0016882755560235047 + p * w;
       p = 0.0024914420961078508066 + p * w;
-      p = -0.0037512085075692412107 + p * w;
+      p = -0.003751208507569241 + p * w;
       p = 0.005370914553590063617 + p * w;
       p = 1.0052589676941592334 + p * w;
       p = 3.0838856104922207635 + p * w;
     } else if (Number.isFinite(w)) {
       w = Math.sqrt(w) - 5.0;
-      p = -2.7109920616438573243e-11;
-      p = -2.5556418169965252055e-10 + p * w;
+      p = -27109920616438573e-27;
+      p = -2555641816996525e-25 + p * w;
       p = 1.5076572693500548083e-09 + p * w;
-      p = -3.7894654401267369937e-09 + p * w;
+      p = -3.789465440126737e-9 + p * w;
       p = 7.6157012080783393804e-09 + p * w;
-      p = -1.4960026627149240478e-08 + p * w;
+      p = -1.496002662714924e-8 + p * w;
       p = 2.9147953450901080826e-08 + p * w;
-      p = -6.7711997758452339498e-08 + p * w;
+      p = -6.771199775845234e-8 + p * w;
       p = 2.2900482228026654717e-07 + p * w;
-      p = -9.9298272942317002539e-07 + p * w;
+      p = -9.9298272942317e-7 + p * w;
       p = 4.5260625972231537039e-06 + p * w;
-      p = -1.9681778105531670567e-05 + p * w;
+      p = -1968177810553167e-20 + p * w;
       p = 7.5995277030017761139e-05 + p * w;
-      p = -0.00021503011930044477347 + p * w;
-      p = -0.00013871931833623122026 + p * w;
+      p = -21503011930044477e-20 + p * w;
+      p = -13871931833623122e-20 + p * w;
       p = 1.0103004648645343977 + p * w;
       p = 4.8499064014085844221 + p * w;
     } else {
@@ -6509,7 +6462,6 @@
     };
   }
   function exp$1(data, x, y) {
-    // eslint-disable-next-line no-unused-vars
     const [xv, yv, ux, uy] = points(data, x, y);
     let YL = 0,
       XY = 0,
@@ -12689,10 +12641,10 @@
   }));
 
   var A = -0.14861,
-    B$1 = +1.78277,
+    B$1 = 1.78277,
     C$1 = -0.29227,
     D$1 = -0.90649,
-    E = +1.97294,
+    E = 1.97294,
     ED = E * D$1,
     EB = E * B$1,
     BC_DA = B$1 * C$1 - D$1 * A;
@@ -12767,7 +12719,7 @@
     };
   }
 
-  var constant$2 = (x => () => x);
+  var constant$2 = x => () => x;
 
   function linear$1(a, d) {
     return function (t) {
@@ -17533,12 +17485,12 @@
     /**
      * Add an event handler. Subclasses should override this method.
      */
-    on( /*type, handler*/) {}
+    on(/*type, handler*/) {}
 
     /**
      * Remove an event handler. Subclasses should override this method.
      */
-    off( /*type, handler*/) {}
+    off(/*type, handler*/) {}
 
     /**
      * Utility method for finding the array index of an event handler.
@@ -17744,7 +17696,7 @@
      * incremental should implement this method.
      * @param {Item} item - The dirty item whose bounds should be redrawn.
      */
-    dirty( /*item*/) {}
+    dirty(/*item*/) {}
 
     /**
      * Render an input scenegraph, potentially with a set of dirty items.
@@ -17783,7 +17735,7 @@
      * @param {Array} markTypes - Array of the mark types to render.
      *                            If undefined, render all mark types
      */
-    _render( /*scene, markTypes*/
+    _render(/*scene, markTypes*/
     ) {
       // subclasses to override
     }
@@ -18383,12 +18335,9 @@
         return m;
       },
       m = {
-        open(tag) {
+        open(tag, ...attrs) {
           push(tag);
           outer = '<' + tag;
-          for (var _len = arguments.length, attrs = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
-            attrs[_key - 1] = arguments[_key];
-          }
           for (const set of attrs) {
             for (const key in set) attr(key, set[key]);
           }
@@ -22901,7 +22850,7 @@
 
   function clipCircle (radius) {
     var cr = cos$1(radius),
-      delta = 6 * radians,
+      delta = 2 * radians,
       smallRadius = cr > 0,
       notHemisphere = abs$1(cr) > epsilon$3; // TODO optimise for this common case
 
@@ -23371,7 +23320,7 @@
     return graticule.extentMajor([[-180, -90 + epsilon$3], [180, 90 - epsilon$3]]).extentMinor([[-180, -80 - epsilon$3], [180, 80 + epsilon$3]]);
   }
 
-  var identity = (x => x);
+  var identity = x => x;
 
   var areaSum = new Adder(),
     areaRingSum = new Adder(),
@@ -23645,7 +23594,7 @@
               const r = this._radius;
               const s = this._;
               this._ = ""; // stash the old string so we can cache the circle path fragment
-              this._append`m0,${r}a${r},${r} 0 1,1 0,${-2 * r}a${r},${r} 0 1,1 0,${2 * r}z`;
+              this._append`m0,${r}a${r},${r} 0 1,1 0,${ -2 * r}a${r},${r} 0 1,1 0,${2 * r}z`;
               cacheRadius = r;
               cacheAppend = this._append;
               cacheCircle = this._;
@@ -30626,7 +30575,6 @@
     const detleft = (ay - cy) * (bx - cx);
     const detright = (ax - cx) * (by - cy);
     const det = detleft - detright;
-    if (detleft === 0 || detright === 0 || detleft > 0 !== detright > 0) return det;
     const detsum = Math.abs(detleft + detright);
     if (Math.abs(det) >= ccwerrboundA * detsum) return det;
     return -orient2dadapt(ax, ay, bx, by, cx, cy, detsum);
@@ -30635,9 +30583,7 @@
   const EPSILON = Math.pow(2, -52);
   const EDGE_STACK = new Uint32Array(512);
   class Delaunator {
-    static from(points) {
-      let getX = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultGetX;
-      let getY = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultGetY;
+    static from(points, getX = defaultGetX, getY = defaultGetY) {
       const n = points.length;
       const coords = new Float64Array(n * 2);
       for (let i = 0; i < n; i++) {
@@ -30662,7 +30608,7 @@
       this._hullPrev = new Uint32Array(n); // edge to prev edge
       this._hullNext = new Uint32Array(n); // edge to next edge
       this._hullTri = new Uint32Array(n); // edge to adjacent triangle
-      this._hullHash = new Int32Array(this._hashSize).fill(-1); // angular edge hash
+      this._hullHash = new Int32Array(this._hashSize); // angular edge hash
 
       // temporary arrays for sorting points
       this._ids = new Uint32Array(n);
@@ -30695,11 +30641,10 @@
       }
       const cx = (minX + maxX) / 2;
       const cy = (minY + maxY) / 2;
-      let minDist = Infinity;
       let i0, i1, i2;
 
       // pick a seed point close to the center
-      for (let i = 0; i < n; i++) {
+      for (let i = 0, minDist = Infinity; i < n; i++) {
         const d = dist(cx, cy, coords[2 * i], coords[2 * i + 1]);
         if (d < minDist) {
           i0 = i;
@@ -30708,10 +30653,9 @@
       }
       const i0x = coords[2 * i0];
       const i0y = coords[2 * i0 + 1];
-      minDist = Infinity;
 
       // find the point closest to the seed
-      for (let i = 0; i < n; i++) {
+      for (let i = 0, minDist = Infinity; i < n; i++) {
         if (i === i0) continue;
         const d = dist(i0x, i0y, coords[2 * i], coords[2 * i + 1]);
         if (d < minDist && d > 0) {
@@ -30745,9 +30689,10 @@
         let j = 0;
         for (let i = 0, d0 = -Infinity; i < n; i++) {
           const id = this._ids[i];
-          if (this._dists[id] > d0) {
+          const d = this._dists[id];
+          if (d > d0) {
             hull[j++] = id;
-            d0 = this._dists[id];
+            d0 = d;
           }
         }
         this.hull = hull.subarray(0, j);
@@ -31124,8 +31069,7 @@
   }
 
   let Voronoi$1 = class Voronoi {
-    constructor(delaunay) {
-      let [xmin, ymin, xmax, ymax] = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [0, 0, 960, 500];
+    constructor(delaunay, [xmin, ymin, xmax, ymax] = [0, 0, 960, 500]) {
       if (!((xmax = +xmax) >= (xmin = +xmin)) || !((ymax = +ymax) >= (ymin = +ymin))) throw new Error("invalid bounds");
       this.delaunay = delaunay;
       this._circumcenters = new Float64Array(delaunay.points.length * 2);
@@ -31533,10 +31477,7 @@
     return [x + Math.sin(x + y) * r, y + Math.cos(x - y) * r];
   }
   class Delaunay {
-    static from(points) {
-      let fx = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : pointX;
-      let fy = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : pointY;
-      let that = arguments.length > 3 ? arguments[3] : undefined;
+    static from(points, fx = pointX, fy = pointY, that) {
       return new Delaunay("length" in points ? flatArray(points, fx, fy, that) : Float64Array.from(flatIterable(points, fx, fy, that)));
     }
     constructor(points) {
@@ -31639,8 +31580,7 @@
         }
       } while (e !== e0);
     }
-    find(x, y) {
-      let i = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+    find(x, y, i = 0) {
       if ((x = +x, x !== x) || (y = +y, y !== y)) return -1;
       const i0 = i;
       let c;
@@ -32522,7 +32462,7 @@
         addv[i] = key(data[i]);
         addi[i] = i;
       }
-      addv = sort(addv, addi);
+      addv = sort$1(addv, addi);
       if (n0) {
         oldv = value;
         oldi = index;
@@ -32584,7 +32524,7 @@
       size: () => size
     };
   }
-  function sort(values, index) {
+  function sort$1(values, index) {
     values.sort.call(index, (a, b) => {
       const x = values[a],
         y = values[b];
@@ -33065,7 +33005,7 @@
     resolvefilter: ResolveFilter
   });
 
-  var version = "5.30.0";
+  var version$1 = "6.2.0";
 
   const RawCode = 'RawCode';
   const Literal = 'Literal';
@@ -34543,6 +34483,9 @@
       substring: fn('substring', STRING),
       split: fn('split', STRING),
       trim: fn('trim', STRING, 0),
+      // base64 encode/decode
+      btoa: 'btoa',
+      atob: 'atob',
       // REGEXP functions
       regexp: REGEXP,
       test: fn('test', REGEXP),
@@ -34568,6 +34511,8 @@
       globalvar = opt.globalvar,
       fieldvar = opt.fieldvar,
       outputGlobal = isFunction(globalvar) ? globalvar : id => `${globalvar}["${id}"]`;
+    // JSON authors are not allowed to set properties with these names, as these are built-in to the JS Object Prototype.
+    new Set([...Object.getOwnPropertyNames(Object.prototype).filter(name => typeof Object.prototype[name] === 'function'), '__proto__']);
     let globals = {},
       fields = {},
       memberDepth = 0;
@@ -34621,7 +34566,16 @@
       UnaryExpression: n => '(' + n.operator + visit(n.argument) + ')',
       ConditionalExpression: n => '(' + visit(n.test) + '?' + visit(n.consequent) + ':' + visit(n.alternate) + ')',
       LogicalExpression: n => '(' + visit(n.left) + n.operator + visit(n.right) + ')',
-      ObjectExpression: n => '{' + n.properties.map(visit).join(',') + '}',
+      ObjectExpression: n => {
+        // If any keys would override Object prototype methods, throw error
+        for (const prop of n.properties) {
+          const keyName = prop.key.name;
+          if (DisallowedObjectProperties.has(keyName)) {
+            error('Illegal property: ' + keyName);
+          }
+        }
+        return '{' + n.properties.map(visit).join(',') + '}';
+      },
       Property: n => {
         memberDepth += 1;
         const k = visit(n.key);
@@ -34666,6 +34620,12 @@
     TYPE_RANGE_EXC = 'R-E',
     TYPE_RANGE_LE = 'R-LE',
     TYPE_RANGE_RE = 'R-RE',
+    TYPE_PRED_LT = 'E-LT',
+    TYPE_PRED_LTE = 'E-LTE',
+    TYPE_PRED_GT = 'E-GT',
+    TYPE_PRED_GTE = 'E-GTE',
+    TYPE_PRED_VALID = 'E-VALID',
+    TYPE_PRED_ONE_OF = 'E-ONE',
     UNIT_INDEX = 'index:unit';
 
   // TODO: revisit date coercion?
@@ -34699,6 +34659,18 @@
           if (!inrange(dval, values[i], false, false)) return false;
         } else if (f.type === TYPE_RANGE_LE) {
           if (!inrange(dval, values[i], false, true)) return false;
+        } else if (f.type === TYPE_PRED_LT) {
+          if (dval >= values[i]) return false;
+        } else if (f.type === TYPE_PRED_LTE) {
+          if (dval > values[i]) return false;
+        } else if (f.type === TYPE_PRED_GT) {
+          if (dval <= values[i]) return false;
+        } else if (f.type === TYPE_PRED_GTE) {
+          if (dval < values[i]) return false;
+        } else if (f.type === TYPE_PRED_VALID) {
+          if (dval === null || isNaN(dval)) return false;
+        } else if (f.type === TYPE_PRED_ONE_OF) {
+          if (values[i].indexOf(dval) === -1) return false;
         }
       }
     }
@@ -34945,13 +34917,9 @@
       field = 'unit',
       indexName = IndexPrefix$1 + field,
       dataName = DataPrefix$1 + data;
-
-    // eslint-disable-next-line no-prototype-builtins
     if (op === Intersect && !has$1(params, indexName)) {
       params[indexName] = scope.getData(data).indataRef(scope, field);
     }
-
-    // eslint-disable-next-line no-prototype-builtins
     if (!has$1(params, dataName)) {
       params[dataName] = scope.getData(data).tuplesRef();
     }
@@ -35059,13 +35027,17 @@
       }
     }
   }
+
+  /**
+   * nameOrFunction must be a string or function that was registered.
+   * Return undefined if scale is not recognized.
+   */
   function getScale(nameOrFunction, ctx) {
-    if (isFunction(nameOrFunction)) {
-      return nameOrFunction;
-    }
     if (isString(nameOrFunction)) {
       const maybeScale = ctx.scales[nameOrFunction];
       return maybeScale && isRegisteredScale(maybeScale.value) ? maybeScale.value : undefined;
+    } else if (isFunction(nameOrFunction)) {
+      return isRegisteredScale(nameOrFunction) ? nameOrFunction : undefined;
     }
     return undefined;
   }
@@ -35250,37 +35222,29 @@
   function sequence(seq) {
     return array(seq) || (isString(seq) ? seq : null);
   }
-  function join(seq) {
-    for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
-      args[_key - 1] = arguments[_key];
-    }
+  function join(seq, ...args) {
     return array(seq).join(...args);
   }
-  function indexof(seq) {
-    for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {
-      args[_key2 - 1] = arguments[_key2];
-    }
+  function indexof(seq, ...args) {
     return sequence(seq).indexOf(...args);
   }
-  function lastindexof(seq) {
-    for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {
-      args[_key3 - 1] = arguments[_key3];
-    }
+  function lastindexof(seq, ...args) {
     return sequence(seq).lastIndexOf(...args);
   }
-  function slice(seq) {
-    for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {
-      args[_key4 - 1] = arguments[_key4];
-    }
+  function slice(seq, ...args) {
     return sequence(seq).slice(...args);
   }
   function replace(str, pattern, repl) {
     if (isFunction(repl)) error('Function argument passed to replace.');
+    if (!isString(pattern) && !isRegExp(pattern)) error('Please pass a string or RegExp argument to replace.');
     return String(str).replace(pattern, repl);
   }
   function reverse(seq) {
     return array(seq).slice().reverse();
   }
+  function sort(seq) {
+    return array(seq).slice().sort(ascending$2);
+  }
   function bandspace(count, paddingInner, paddingOuter) {
     return bandSpace(count || 0, paddingInner || 0, paddingOuter || 0);
   }
@@ -35396,8 +35360,7 @@
    * @param {*} minDist the minimum distance, in pixels, that thenew point needs to be apart from the last point
    * @returns a new array containing the lasso with the new point
    */
-  function lassoAppend(lasso, x, y) {
-    let minDist = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 5;
+  function lassoAppend(lasso, x, y, minDist = 5) {
     lasso = array$5(lasso);
     const last = lasso[lasso.length - 1];
 
@@ -35412,8 +35375,7 @@
    * @returns the svg path command that draws the lasso
    */
   function lassoPath(lasso) {
-    return array$5(lasso).reduce((svg, _ref, i) => {
-      let [x, y] = _ref;
+    return array$5(lasso).reduce((svg, [x, y], i) => {
       return svg += i == 0 ? `M ${x},${y} ` : i === lasso.length - 1 ? ' Z' : `L ${x},${y} `;
     }, '');
   }
@@ -35521,6 +35483,7 @@
     lastindexof,
     replace,
     reverse,
+    sort,
     slice,
     flush,
     lerp,
@@ -38598,6 +38561,8 @@
   const GuideTitleStyle = 'guide-title';
   const GroupTitleStyle = 'group-title';
   const GroupSubtitleStyle = 'group-subtitle';
+
+  /** All values of LegendType */
   const Symbols = 'symbol';
   const Gradient = 'gradient';
   const Discrete = 'discrete';
@@ -41480,6 +41445,7 @@
   // -- Transforms -----
 
   extend$1(transforms, tx, vtx, encode$1, geo, force, label, tree, reg, voronoi, wordcloud, xf);
+  const version = version$1;
 
   exports.Bounds = Bounds;
   exports.CanvasHandler = CanvasHandler;
@@ -41489,6 +41455,7 @@
   exports.DAYOFYEAR = DAYOFYEAR;
   exports.Dataflow = Dataflow;
   exports.Debug = Debug;
+  exports.DisallowedObjectProperties = DisallowedObjectProperties;
   exports.Error = Error$1;
   exports.EventStream = EventStream;
   exports.Gradient = Gradient$1;
@@ -41654,7 +41621,6 @@
   exports.renderModule = renderModule;
   exports.repeat = repeat;
   exports.resetDefaultLocale = resetDefaultLocale;
-  exports.resetSVGClipId = resetSVGClipId;
   exports.resetSVGDefIds = resetSVGDefIds;
   exports.responseType = responseType;
   exports.runtimeContext = context;