vega 0.5.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') {
@@ -669,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 : !!_;
@@ -1145,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 {
@@ -1157,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 {
@@ -1169,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;
     }
@@ -1288,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: {
@@ -1315,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: {
@@ -1338,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);
@@ -1376,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) => {
@@ -1483,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));
@@ -1537,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);
@@ -1606,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) {
@@ -1626,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);
@@ -2237,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];
@@ -3361,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: false,
       file: fileLoader(),
-      http: httpLoader(fetch)
+      http: httpLoader
     });
   }
 
@@ -3393,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);
   }
 
   /**
@@ -3492,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.
-   */
-  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.
+   * 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.
    */
-  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;
@@ -3672,7 +3635,7 @@
       }
     }
   }
-  const loader = loaderFactory(typeof fetch !== 'undefined' && fetch);
+  const loader = loaderFactory();
 
   function UniqueList(idFunc) {
     const $ = idFunc || identity$6,
@@ -18372,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]);
           }
@@ -22155,7 +22115,7 @@
       boundsStream$1.point = boundsPoint$1;
       boundsStream$1.lineStart = boundsLineStart;
       boundsStream$1.lineEnd = boundsLineEnd;
-      if (areaRingSum$1 < 0) lambda0 = -(lambda1 = 180), phi0 = -(phi1 = 90);else if (deltaSum > epsilon$3) phi1 = 90;else if (deltaSum < -1e-6) phi0 = -90;
+      if (areaRingSum$1 < 0) lambda0 = -(lambda1 = 180), phi0 = -(phi1 = 90);else if (deltaSum > epsilon$3) phi1 = 90;else if (deltaSum < -epsilon$3) phi0 = -90;
       range$2[0] = lambda0, range$2[1] = lambda1;
     },
     sphere: function () {
@@ -22689,7 +22649,7 @@
     // from the point to the South pole.  If it is zero, then the point is the
     // same side as the South pole.
 
-    return (angle < -1e-6 || angle < epsilon$3 && sum < -1e-12) ^ winding & 1;
+    return (angle < -epsilon$3 || angle < epsilon$3 && sum < -epsilon2) ^ winding & 1;
   }
 
   function clip$1 (pointVisible, clipLine, interpolate, start) {
@@ -23106,7 +23066,7 @@
   }
 
   var clipMax = 1e9,
-    clipMin = -1e9;
+    clipMin = -clipMax;
 
   // TODO Use d3-polygon’s polygonContains here for the ring check?
   // TODO Eliminate duplicate buffering in clipBuffer and polygon.push?
@@ -30623,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++) {
@@ -31111,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);
@@ -31520,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) {
@@ -31626,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;
@@ -33052,7 +33005,7 @@
     resolvefilter: ResolveFilter
   });
 
-  var version$1 = "6.1.2";
+  var version$1 = "6.2.0";
 
   const RawCode = 'RawCode';
   const Literal = 'Literal';
@@ -34558,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;
@@ -34611,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);
@@ -35258,28 +35222,16 @@
   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) {
@@ -35408,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];
 
@@ -35424,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} `;
     }, '');
   }
@@ -41505,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;

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: vega
 version: !ruby/object:Gem::Version
-  version: 0.5.0
+  version: 0.6.0
 platform: ruby
 authors:
 - Andrew Kane
@@ -45,14 +45,14 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: '3.2'
+      version: '3.3'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.6.9
+rubygems_version: 4.0.6
 specification_version: 4
 summary: Interactive charts for Ruby, powered by Vega and Vega-Lite
 test_files: []