@hpcc-js/tree 2.42.0 → 3.0.0

package/dist/index.es6.js

@@ -1,2836 +0,0 @@
-import { ITree } from '@hpcc-js/api';
-import { rgb, d3Event, interpolateZoom, SVGWidget, Utility, PropertyExt, select, SVGZoomWidget, Palette, Platform, max as max$1, HTMLWidget, scaleLinear, scaleSqrt, interpolate } from '@hpcc-js/common';
-
-var PKG_NAME = "@hpcc-js/tree";
-var PKG_VERSION = "2.42.0";
-var BUILD_VERSION = "2.107.0";
-
-/******************************************************************************
-Copyright (c) Microsoft Corporation.
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
-AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
-LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
-OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-PERFORMANCE OF THIS SOFTWARE.
-***************************************************************************** */
-/* global Reflect, Promise, SuppressedError, Symbol, Iterator */
-
-var extendStatics = function(d, b) {
-  extendStatics = Object.setPrototypeOf ||
-      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-  return extendStatics(d, b);
-};
-
-function __extends(d, b) {
-  if (typeof b !== "function" && b !== null)
-      throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-  extendStatics(d, b);
-  function __() { this.constructor = d; }
-  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-}
-
-typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
-  var e = new Error(message);
-  return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
-};
-
-function defaultSeparation$1(a, b) {
-  return a.parent === b.parent ? 1 : 2;
-}
-
-function meanX(children) {
-  return children.reduce(meanXReduce, 0) / children.length;
-}
-
-function meanXReduce(x, c) {
-  return x + c.x;
-}
-
-function maxY(children) {
-  return 1 + children.reduce(maxYReduce, 0);
-}
-
-function maxYReduce(y, c) {
-  return Math.max(y, c.y);
-}
-
-function leafLeft(node) {
-  var children;
-  while (children = node.children) node = children[0];
-  return node;
-}
-
-function leafRight(node) {
-  var children;
-  while (children = node.children) node = children[children.length - 1];
-  return node;
-}
-
-function d3Cluster() {
-  var separation = defaultSeparation$1,
-      dx = 1,
-      dy = 1,
-      nodeSize = false;
-
-  function cluster(root) {
-    var previousNode,
-        x = 0;
-
-    // First walk, computing the initial x & y values.
-    root.eachAfter(function(node) {
-      var children = node.children;
-      if (children) {
-        node.x = meanX(children);
-        node.y = maxY(children);
-      } else {
-        node.x = previousNode ? x += separation(node, previousNode) : 0;
-        node.y = 0;
-        previousNode = node;
-      }
-    });
-
-    var left = leafLeft(root),
-        right = leafRight(root),
-        x0 = left.x - separation(left, right) / 2,
-        x1 = right.x + separation(right, left) / 2;
-
-    // Second walk, normalizing x & y to the desired size.
-    return root.eachAfter(nodeSize ? function(node) {
-      node.x = (node.x - root.x) * dx;
-      node.y = (root.y - node.y) * dy;
-    } : function(node) {
-      node.x = (node.x - x0) / (x1 - x0) * dx;
-      node.y = (1 - (root.y ? node.y / root.y : 1)) * dy;
-    });
-  }
-
-  cluster.separation = function(x) {
-    return arguments.length ? (separation = x, cluster) : separation;
-  };
-
-  cluster.size = function(x) {
-    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? null : [dx, dy]);
-  };
-
-  cluster.nodeSize = function(x) {
-    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? [dx, dy] : null);
-  };
-
-  return cluster;
-}
-
-function count(node) {
-  var sum = 0,
-      children = node.children,
-      i = children && children.length;
-  if (!i) sum = 1;
-  else while (--i >= 0) sum += children[i].value;
-  node.value = sum;
-}
-
-function node_count() {
-  return this.eachAfter(count);
-}
-
-function node_each(callback) {
-  var node = this, current, next = [node], children, i, n;
-  do {
-    current = next.reverse(), next = [];
-    while (node = current.pop()) {
-      callback(node), children = node.children;
-      if (children) for (i = 0, n = children.length; i < n; ++i) {
-        next.push(children[i]);
-      }
-    }
-  } while (next.length);
-  return this;
-}
-
-function node_eachBefore(callback) {
-  var node = this, nodes = [node], children, i;
-  while (node = nodes.pop()) {
-    callback(node), children = node.children;
-    if (children) for (i = children.length - 1; i >= 0; --i) {
-      nodes.push(children[i]);
-    }
-  }
-  return this;
-}
-
-function node_eachAfter(callback) {
-  var node = this, nodes = [node], next = [], children, i, n;
-  while (node = nodes.pop()) {
-    next.push(node), children = node.children;
-    if (children) for (i = 0, n = children.length; i < n; ++i) {
-      nodes.push(children[i]);
-    }
-  }
-  while (node = next.pop()) {
-    callback(node);
-  }
-  return this;
-}
-
-function node_sum(value) {
-  return this.eachAfter(function(node) {
-    var sum = +value(node.data) || 0,
-        children = node.children,
-        i = children && children.length;
-    while (--i >= 0) sum += children[i].value;
-    node.value = sum;
-  });
-}
-
-function node_sort(compare) {
-  return this.eachBefore(function(node) {
-    if (node.children) {
-      node.children.sort(compare);
-    }
-  });
-}
-
-function node_path(end) {
-  var start = this,
-      ancestor = leastCommonAncestor(start, end),
-      nodes = [start];
-  while (start !== ancestor) {
-    start = start.parent;
-    nodes.push(start);
-  }
-  var k = nodes.length;
-  while (end !== ancestor) {
-    nodes.splice(k, 0, end);
-    end = end.parent;
-  }
-  return nodes;
-}
-
-function leastCommonAncestor(a, b) {
-  if (a === b) return a;
-  var aNodes = a.ancestors(),
-      bNodes = b.ancestors(),
-      c = null;
-  a = aNodes.pop();
-  b = bNodes.pop();
-  while (a === b) {
-    c = a;
-    a = aNodes.pop();
-    b = bNodes.pop();
-  }
-  return c;
-}
-
-function node_ancestors() {
-  var node = this, nodes = [node];
-  while (node = node.parent) {
-    nodes.push(node);
-  }
-  return nodes;
-}
-
-function node_descendants() {
-  var nodes = [];
-  this.each(function(node) {
-    nodes.push(node);
-  });
-  return nodes;
-}
-
-function node_leaves() {
-  var leaves = [];
-  this.eachBefore(function(node) {
-    if (!node.children) {
-      leaves.push(node);
-    }
-  });
-  return leaves;
-}
-
-function node_links() {
-  var root = this, links = [];
-  root.each(function(node) {
-    if (node !== root) { // Don’t include the root’s parent, if any.
-      links.push({source: node.parent, target: node});
-    }
-  });
-  return links;
-}
-
-function hierarchy(data, children) {
-  var root = new Node$1(data),
-      valued = +data.value && (root.value = data.value),
-      node,
-      nodes = [root],
-      child,
-      childs,
-      i,
-      n;
-
-  if (children == null) children = defaultChildren;
-
-  while (node = nodes.pop()) {
-    if (valued) node.value = +node.data.value;
-    if ((childs = children(node.data)) && (n = childs.length)) {
-      node.children = new Array(n);
-      for (i = n - 1; i >= 0; --i) {
-        nodes.push(child = node.children[i] = new Node$1(childs[i]));
-        child.parent = node;
-        child.depth = node.depth + 1;
-      }
-    }
-  }
-
-  return root.eachBefore(computeHeight);
-}
-
-function node_copy() {
-  return hierarchy(this).eachBefore(copyData);
-}
-
-function defaultChildren(d) {
-  return d.children;
-}
-
-function copyData(node) {
-  node.data = node.data.data;
-}
-
-function computeHeight(node) {
-  var height = 0;
-  do node.height = height;
-  while ((node = node.parent) && (node.height < ++height));
-}
-
-function Node$1(data) {
-  this.data = data;
-  this.depth =
-  this.height = 0;
-  this.parent = null;
-}
-
-Node$1.prototype = hierarchy.prototype = {
-  constructor: Node$1,
-  count: node_count,
-  each: node_each,
-  eachAfter: node_eachAfter,
-  eachBefore: node_eachBefore,
-  sum: node_sum,
-  sort: node_sort,
-  path: node_path,
-  ancestors: node_ancestors,
-  descendants: node_descendants,
-  leaves: node_leaves,
-  links: node_links,
-  copy: node_copy
-};
-
-var slice = Array.prototype.slice;
-
-function shuffle(array) {
-  var m = array.length,
-      t,
-      i;
-
-  while (m) {
-    i = Math.random() * m-- | 0;
-    t = array[m];
-    array[m] = array[i];
-    array[i] = t;
-  }
-
-  return array;
-}
-
-function enclose(circles) {
-  var i = 0, n = (circles = shuffle(slice.call(circles))).length, B = [], p, e;
-
-  while (i < n) {
-    p = circles[i];
-    if (e && enclosesWeak(e, p)) ++i;
-    else e = encloseBasis(B = extendBasis(B, p)), i = 0;
-  }
-
-  return e;
-}
-
-function extendBasis(B, p) {
-  var i, j;
-
-  if (enclosesWeakAll(p, B)) return [p];
-
-  // If we get here then B must have at least one element.
-  for (i = 0; i < B.length; ++i) {
-    if (enclosesNot(p, B[i])
-        && enclosesWeakAll(encloseBasis2(B[i], p), B)) {
-      return [B[i], p];
-    }
-  }
-
-  // If we get here then B must have at least two elements.
-  for (i = 0; i < B.length - 1; ++i) {
-    for (j = i + 1; j < B.length; ++j) {
-      if (enclosesNot(encloseBasis2(B[i], B[j]), p)
-          && enclosesNot(encloseBasis2(B[i], p), B[j])
-          && enclosesNot(encloseBasis2(B[j], p), B[i])
-          && enclosesWeakAll(encloseBasis3(B[i], B[j], p), B)) {
-        return [B[i], B[j], p];
-      }
-    }
-  }
-
-  // If we get here then something is very wrong.
-  throw new Error;
-}
-
-function enclosesNot(a, b) {
-  var dr = a.r - b.r, dx = b.x - a.x, dy = b.y - a.y;
-  return dr < 0 || dr * dr < dx * dx + dy * dy;
-}
-
-function enclosesWeak(a, b) {
-  var dr = a.r - b.r + 1e-6, dx = b.x - a.x, dy = b.y - a.y;
-  return dr > 0 && dr * dr > dx * dx + dy * dy;
-}
-
-function enclosesWeakAll(a, B) {
-  for (var i = 0; i < B.length; ++i) {
-    if (!enclosesWeak(a, B[i])) {
-      return false;
-    }
-  }
-  return true;
-}
-
-function encloseBasis(B) {
-  switch (B.length) {
-    case 1: return encloseBasis1(B[0]);
-    case 2: return encloseBasis2(B[0], B[1]);
-    case 3: return encloseBasis3(B[0], B[1], B[2]);
-  }
-}
-
-function encloseBasis1(a) {
-  return {
-    x: a.x,
-    y: a.y,
-    r: a.r
-  };
-}
-
-function encloseBasis2(a, b) {
-  var x1 = a.x, y1 = a.y, r1 = a.r,
-      x2 = b.x, y2 = b.y, r2 = b.r,
-      x21 = x2 - x1, y21 = y2 - y1, r21 = r2 - r1,
-      l = Math.sqrt(x21 * x21 + y21 * y21);
-  return {
-    x: (x1 + x2 + x21 / l * r21) / 2,
-    y: (y1 + y2 + y21 / l * r21) / 2,
-    r: (l + r1 + r2) / 2
-  };
-}
-
-function encloseBasis3(a, b, c) {
-  var x1 = a.x, y1 = a.y, r1 = a.r,
-      x2 = b.x, y2 = b.y, r2 = b.r,
-      x3 = c.x, y3 = c.y, r3 = c.r,
-      a2 = x1 - x2,
-      a3 = x1 - x3,
-      b2 = y1 - y2,
-      b3 = y1 - y3,
-      c2 = r2 - r1,
-      c3 = r3 - r1,
-      d1 = x1 * x1 + y1 * y1 - r1 * r1,
-      d2 = d1 - x2 * x2 - y2 * y2 + r2 * r2,
-      d3 = d1 - x3 * x3 - y3 * y3 + r3 * r3,
-      ab = a3 * b2 - a2 * b3,
-      xa = (b2 * d3 - b3 * d2) / (ab * 2) - x1,
-      xb = (b3 * c2 - b2 * c3) / ab,
-      ya = (a3 * d2 - a2 * d3) / (ab * 2) - y1,
-      yb = (a2 * c3 - a3 * c2) / ab,
-      A = xb * xb + yb * yb - 1,
-      B = 2 * (r1 + xa * xb + ya * yb),
-      C = xa * xa + ya * ya - r1 * r1,
-      r = -(A ? (B + Math.sqrt(B * B - 4 * A * C)) / (2 * A) : C / B);
-  return {
-    x: x1 + xa + xb * r,
-    y: y1 + ya + yb * r,
-    r: r
-  };
-}
-
-function place(b, a, c) {
-  var dx = b.x - a.x, x, a2,
-      dy = b.y - a.y, y, b2,
-      d2 = dx * dx + dy * dy;
-  if (d2) {
-    a2 = a.r + c.r, a2 *= a2;
-    b2 = b.r + c.r, b2 *= b2;
-    if (a2 > b2) {
-      x = (d2 + b2 - a2) / (2 * d2);
-      y = Math.sqrt(Math.max(0, b2 / d2 - x * x));
-      c.x = b.x - x * dx - y * dy;
-      c.y = b.y - x * dy + y * dx;
-    } else {
-      x = (d2 + a2 - b2) / (2 * d2);
-      y = Math.sqrt(Math.max(0, a2 / d2 - x * x));
-      c.x = a.x + x * dx - y * dy;
-      c.y = a.y + x * dy + y * dx;
-    }
-  } else {
-    c.x = a.x + c.r;
-    c.y = a.y;
-  }
-}
-
-function intersects(a, b) {
-  var dr = a.r + b.r - 1e-6, dx = b.x - a.x, dy = b.y - a.y;
-  return dr > 0 && dr * dr > dx * dx + dy * dy;
-}
-
-function score(node) {
-  var a = node._,
-      b = node.next._,
-      ab = a.r + b.r,
-      dx = (a.x * b.r + b.x * a.r) / ab,
-      dy = (a.y * b.r + b.y * a.r) / ab;
-  return dx * dx + dy * dy;
-}
-
-function Node(circle) {
-  this._ = circle;
-  this.next = null;
-  this.previous = null;
-}
-
-function packEnclose(circles) {
-  if (!(n = circles.length)) return 0;
-
-  var a, b, c, n, aa, ca, i, j, k, sj, sk;
-
-  // Place the first circle.
-  a = circles[0], a.x = 0, a.y = 0;
-  if (!(n > 1)) return a.r;
-
-  // Place the second circle.
-  b = circles[1], a.x = -b.r, b.x = a.r, b.y = 0;
-  if (!(n > 2)) return a.r + b.r;
-
-  // Place the third circle.
-  place(b, a, c = circles[2]);
-
-  // Initialize the front-chain using the first three circles a, b and c.
-  a = new Node(a), b = new Node(b), c = new Node(c);
-  a.next = c.previous = b;
-  b.next = a.previous = c;
-  c.next = b.previous = a;
-
-  // Attempt to place each remaining circle…
-  pack: for (i = 3; i < n; ++i) {
-    place(a._, b._, c = circles[i]), c = new Node(c);
-
-    // Find the closest intersecting circle on the front-chain, if any.
-    // “Closeness” is determined by linear distance along the front-chain.
-    // “Ahead” or “behind” is likewise determined by linear distance.
-    j = b.next, k = a.previous, sj = b._.r, sk = a._.r;
-    do {
-      if (sj <= sk) {
-        if (intersects(j._, c._)) {
-          b = j, a.next = b, b.previous = a, --i;
-          continue pack;
-        }
-        sj += j._.r, j = j.next;
-      } else {
-        if (intersects(k._, c._)) {
-          a = k, a.next = b, b.previous = a, --i;
-          continue pack;
-        }
-        sk += k._.r, k = k.previous;
-      }
-    } while (j !== k.next);
-
-    // Success! Insert the new circle c between a and b.
-    c.previous = a, c.next = b, a.next = b.previous = b = c;
-
-    // Compute the new closest circle pair to the centroid.
-    aa = score(a);
-    while ((c = c.next) !== b) {
-      if ((ca = score(c)) < aa) {
-        a = c, aa = ca;
-      }
-    }
-    b = a.next;
-  }
-
-  // Compute the enclosing circle of the front chain.
-  a = [b._], c = b; while ((c = c.next) !== b) a.push(c._); c = enclose(a);
-
-  // Translate the circles to put the enclosing circle around the origin.
-  for (i = 0; i < n; ++i) a = circles[i], a.x -= c.x, a.y -= c.y;
-
-  return c.r;
-}
-
-function optional(f) {
-  return f == null ? null : required(f);
-}
-
-function required(f) {
-  if (typeof f !== "function") throw new Error;
-  return f;
-}
-
-function constantZero() {
-  return 0;
-}
-
-function constant$1(x) {
-  return function() {
-    return x;
-  };
-}
-
-function defaultRadius(d) {
-  return Math.sqrt(d.value);
-}
-
-function d3Pack() {
-  var radius = null,
-      dx = 1,
-      dy = 1,
-      padding = constantZero;
-
-  function pack(root) {
-    root.x = dx / 2, root.y = dy / 2;
-    if (radius) {
-      root.eachBefore(radiusLeaf(radius))
-          .eachAfter(packChildren(padding, 0.5))
-          .eachBefore(translateChild(1));
-    } else {
-      root.eachBefore(radiusLeaf(defaultRadius))
-          .eachAfter(packChildren(constantZero, 1))
-          .eachAfter(packChildren(padding, root.r / Math.min(dx, dy)))
-          .eachBefore(translateChild(Math.min(dx, dy) / (2 * root.r)));
-    }
-    return root;
-  }
-
-  pack.radius = function(x) {
-    return arguments.length ? (radius = optional(x), pack) : radius;
-  };
-
-  pack.size = function(x) {
-    return arguments.length ? (dx = +x[0], dy = +x[1], pack) : [dx, dy];
-  };
-
-  pack.padding = function(x) {
-    return arguments.length ? (padding = typeof x === "function" ? x : constant$1(+x), pack) : padding;
-  };
-
-  return pack;
-}
-
-function radiusLeaf(radius) {
-  return function(node) {
-    if (!node.children) {
-      node.r = Math.max(0, +radius(node) || 0);
-    }
-  };
-}
-
-function packChildren(padding, k) {
-  return function(node) {
-    if (children = node.children) {
-      var children,
-          i,
-          n = children.length,
-          r = padding(node) * k || 0,
-          e;
-
-      if (r) for (i = 0; i < n; ++i) children[i].r += r;
-      e = packEnclose(children);
-      if (r) for (i = 0; i < n; ++i) children[i].r -= r;
-      node.r = e + r;
-    }
-  };
-}
-
-function translateChild(k) {
-  return function(node) {
-    var parent = node.parent;
-    node.r *= k;
-    if (parent) {
-      node.x = parent.x + k * node.x;
-      node.y = parent.y + k * node.y;
-    }
-  };
-}
-
-function roundNode(node) {
-  node.x0 = Math.round(node.x0);
-  node.y0 = Math.round(node.y0);
-  node.x1 = Math.round(node.x1);
-  node.y1 = Math.round(node.y1);
-}
-
-function d3treemapDice(parent, x0, y0, x1, y1) {
-  var nodes = parent.children,
-      node,
-      i = -1,
-      n = nodes.length,
-      k = parent.value && (x1 - x0) / parent.value;
-
-  while (++i < n) {
-    node = nodes[i], node.y0 = y0, node.y1 = y1;
-    node.x0 = x0, node.x1 = x0 += node.value * k;
-  }
-}
-
-function d3Parition() {
-  var dx = 1,
-      dy = 1,
-      padding = 0,
-      round = false;
-
-  function partition(root) {
-    var n = root.height + 1;
-    root.x0 =
-    root.y0 = padding;
-    root.x1 = dx;
-    root.y1 = dy / n;
-    root.eachBefore(positionNode(dy, n));
-    if (round) root.eachBefore(roundNode);
-    return root;
-  }
-
-  function positionNode(dy, n) {
-    return function(node) {
-      if (node.children) {
-        d3treemapDice(node, node.x0, dy * (node.depth + 1) / n, node.x1, dy * (node.depth + 2) / n);
-      }
-      var x0 = node.x0,
-          y0 = node.y0,
-          x1 = node.x1 - padding,
-          y1 = node.y1 - padding;
-      if (x1 < x0) x0 = x1 = (x0 + x1) / 2;
-      if (y1 < y0) y0 = y1 = (y0 + y1) / 2;
-      node.x0 = x0;
-      node.y0 = y0;
-      node.x1 = x1;
-      node.y1 = y1;
-    };
-  }
-
-  partition.round = function(x) {
-    return arguments.length ? (round = !!x, partition) : round;
-  };
-
-  partition.size = function(x) {
-    return arguments.length ? (dx = +x[0], dy = +x[1], partition) : [dx, dy];
-  };
-
-  partition.padding = function(x) {
-    return arguments.length ? (padding = +x, partition) : padding;
-  };
-
-  return partition;
-}
-
-function defaultSeparation(a, b) {
-  return a.parent === b.parent ? 1 : 2;
-}
-
-// function radialSeparation(a, b) {
-//   return (a.parent === b.parent ? 1 : 2) / a.depth;
-// }
-
-// This function is used to traverse the left contour of a subtree (or
-// subforest). It returns the successor of v on this contour. This successor is
-// either given by the leftmost child of v or by the thread of v. The function
-// returns null if and only if v is on the highest level of its subtree.
-function nextLeft(v) {
-  var children = v.children;
-  return children ? children[0] : v.t;
-}
-
-// This function works analogously to nextLeft.
-function nextRight(v) {
-  var children = v.children;
-  return children ? children[children.length - 1] : v.t;
-}
-
-// Shifts the current subtree rooted at w+. This is done by increasing
-// prelim(w+) and mod(w+) by shift.
-function moveSubtree(wm, wp, shift) {
-  var change = shift / (wp.i - wm.i);
-  wp.c -= change;
-  wp.s += shift;
-  wm.c += change;
-  wp.z += shift;
-  wp.m += shift;
-}
-
-// All other shifts, applied to the smaller subtrees between w- and w+, are
-// performed by this function. To prepare the shifts, we have to adjust
-// change(w+), shift(w+), and change(w-).
-function executeShifts(v) {
-  var shift = 0,
-      change = 0,
-      children = v.children,
-      i = children.length,
-      w;
-  while (--i >= 0) {
-    w = children[i];
-    w.z += shift;
-    w.m += shift;
-    shift += w.s + (change += w.c);
-  }
-}
-
-// If vi-’s ancestor is a sibling of v, returns vi-’s ancestor. Otherwise,
-// returns the specified (default) ancestor.
-function nextAncestor(vim, v, ancestor) {
-  return vim.a.parent === v.parent ? vim.a : ancestor;
-}
-
-function TreeNode(node, i) {
-  this._ = node;
-  this.parent = null;
-  this.children = null;
-  this.A = null; // default ancestor
-  this.a = this; // ancestor
-  this.z = 0; // prelim
-  this.m = 0; // mod
-  this.c = 0; // change
-  this.s = 0; // shift
-  this.t = null; // thread
-  this.i = i; // number
-}
-
-TreeNode.prototype = Object.create(Node$1.prototype);
-
-function treeRoot(root) {
-  var tree = new TreeNode(root, 0),
-      node,
-      nodes = [tree],
-      child,
-      children,
-      i,
-      n;
-
-  while (node = nodes.pop()) {
-    if (children = node._.children) {
-      node.children = new Array(n = children.length);
-      for (i = n - 1; i >= 0; --i) {
-        nodes.push(child = node.children[i] = new TreeNode(children[i], i));
-        child.parent = node;
-      }
-    }
-  }
-
-  (tree.parent = new TreeNode(null, 0)).children = [tree];
-  return tree;
-}
-
-// Node-link tree diagram using the Reingold-Tilford "tidy" algorithm
-function d3Tree() {
-  var separation = defaultSeparation,
-      dx = 1,
-      dy = 1,
-      nodeSize = null;
-
-  function tree(root) {
-    var t = treeRoot(root);
-
-    // Compute the layout using Buchheim et al.’s algorithm.
-    t.eachAfter(firstWalk), t.parent.m = -t.z;
-    t.eachBefore(secondWalk);
-
-    // If a fixed node size is specified, scale x and y.
-    if (nodeSize) root.eachBefore(sizeNode);
-
-    // If a fixed tree size is specified, scale x and y based on the extent.
-    // Compute the left-most, right-most, and depth-most nodes for extents.
-    else {
-      var left = root,
-          right = root,
-          bottom = root;
-      root.eachBefore(function(node) {
-        if (node.x < left.x) left = node;
-        if (node.x > right.x) right = node;
-        if (node.depth > bottom.depth) bottom = node;
-      });
-      var s = left === right ? 1 : separation(left, right) / 2,
-          tx = s - left.x,
-          kx = dx / (right.x + s + tx),
-          ky = dy / (bottom.depth || 1);
-      root.eachBefore(function(node) {
-        node.x = (node.x + tx) * kx;
-        node.y = node.depth * ky;
-      });
-    }
-
-    return root;
-  }
-
-  // Computes a preliminary x-coordinate for v. Before that, FIRST WALK is
-  // applied recursively to the children of v, as well as the function
-  // APPORTION. After spacing out the children by calling EXECUTE SHIFTS, the
-  // node v is placed to the midpoint of its outermost children.
-  function firstWalk(v) {
-    var children = v.children,
-        siblings = v.parent.children,
-        w = v.i ? siblings[v.i - 1] : null;
-    if (children) {
-      executeShifts(v);
-      var midpoint = (children[0].z + children[children.length - 1].z) / 2;
-      if (w) {
-        v.z = w.z + separation(v._, w._);
-        v.m = v.z - midpoint;
-      } else {
-        v.z = midpoint;
-      }
-    } else if (w) {
-      v.z = w.z + separation(v._, w._);
-    }
-    v.parent.A = apportion(v, w, v.parent.A || siblings[0]);
-  }
-
-  // Computes all real x-coordinates by summing up the modifiers recursively.
-  function secondWalk(v) {
-    v._.x = v.z + v.parent.m;
-    v.m += v.parent.m;
-  }
-
-  // The core of the algorithm. Here, a new subtree is combined with the
-  // previous subtrees. Threads are used to traverse the inside and outside
-  // contours of the left and right subtree up to the highest common level. The
-  // vertices used for the traversals are vi+, vi-, vo-, and vo+, where the
-  // superscript o means outside and i means inside, the subscript - means left
-  // subtree and + means right subtree. For summing up the modifiers along the
-  // contour, we use respective variables si+, si-, so-, and so+. Whenever two
-  // nodes of the inside contours conflict, we compute the left one of the
-  // greatest uncommon ancestors using the function ANCESTOR and call MOVE
-  // SUBTREE to shift the subtree and prepare the shifts of smaller subtrees.
-  // Finally, we add a new thread (if necessary).
-  function apportion(v, w, ancestor) {
-    if (w) {
-      var vip = v,
-          vop = v,
-          vim = w,
-          vom = vip.parent.children[0],
-          sip = vip.m,
-          sop = vop.m,
-          sim = vim.m,
-          som = vom.m,
-          shift;
-      while (vim = nextRight(vim), vip = nextLeft(vip), vim && vip) {
-        vom = nextLeft(vom);
-        vop = nextRight(vop);
-        vop.a = v;
-        shift = vim.z + sim - vip.z - sip + separation(vim._, vip._);
-        if (shift > 0) {
-          moveSubtree(nextAncestor(vim, v, ancestor), v, shift);
-          sip += shift;
-          sop += shift;
-        }
-        sim += vim.m;
-        sip += vip.m;
-        som += vom.m;
-        sop += vop.m;
-      }
-      if (vim && !nextRight(vop)) {
-        vop.t = vim;
-        vop.m += sim - sop;
-      }
-      if (vip && !nextLeft(vom)) {
-        vom.t = vip;
-        vom.m += sip - som;
-        ancestor = v;
-      }
-    }
-    return ancestor;
-  }
-
-  function sizeNode(node) {
-    node.x *= dx;
-    node.y = node.depth * dy;
-  }
-
-  tree.separation = function(x) {
-    return arguments.length ? (separation = x, tree) : separation;
-  };
-
-  tree.size = function(x) {
-    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], tree) : (nodeSize ? null : [dx, dy]);
-  };
-
-  tree.nodeSize = function(x) {
-    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], tree) : (nodeSize ? [dx, dy] : null);
-  };
-
-  return tree;
-}
-
-function d3treemapSlice(parent, x0, y0, x1, y1) {
-  var nodes = parent.children,
-      node,
-      i = -1,
-      n = nodes.length,
-      k = parent.value && (y1 - y0) / parent.value;
-
-  while (++i < n) {
-    node = nodes[i], node.x0 = x0, node.x1 = x1;
-    node.y0 = y0, node.y1 = y0 += node.value * k;
-  }
-}
-
-var phi = (1 + Math.sqrt(5)) / 2;
-
-function squarifyRatio(ratio, parent, x0, y0, x1, y1) {
-  var rows = [],
-      nodes = parent.children,
-      row,
-      nodeValue,
-      i0 = 0,
-      i1 = 0,
-      n = nodes.length,
-      dx, dy,
-      value = parent.value,
-      sumValue,
-      minValue,
-      maxValue,
-      newRatio,
-      minRatio,
-      alpha,
-      beta;
-
-  while (i0 < n) {
-    dx = x1 - x0, dy = y1 - y0;
-
-    // Find the next non-empty node.
-    do sumValue = nodes[i1++].value; while (!sumValue && i1 < n);
-    minValue = maxValue = sumValue;
-    alpha = Math.max(dy / dx, dx / dy) / (value * ratio);
-    beta = sumValue * sumValue * alpha;
-    minRatio = Math.max(maxValue / beta, beta / minValue);
-
-    // Keep adding nodes while the aspect ratio maintains or improves.
-    for (; i1 < n; ++i1) {
-      sumValue += nodeValue = nodes[i1].value;
-      if (nodeValue < minValue) minValue = nodeValue;
-      if (nodeValue > maxValue) maxValue = nodeValue;
-      beta = sumValue * sumValue * alpha;
-      newRatio = Math.max(maxValue / beta, beta / minValue);
-      if (newRatio > minRatio) { sumValue -= nodeValue; break; }
-      minRatio = newRatio;
-    }
-
-    // Position and record the row orientation.
-    rows.push(row = {value: sumValue, dice: dx < dy, children: nodes.slice(i0, i1)});
-    if (row.dice) d3treemapDice(row, x0, y0, x1, value ? y0 += dy * sumValue / value : y1);
-    else d3treemapSlice(row, x0, y0, value ? x0 += dx * sumValue / value : x1, y1);
-    value -= sumValue, i0 = i1;
-  }
-
-  return rows;
-}
-
-var d3treemapSquarify = (function custom(ratio) {
-
-  function squarify(parent, x0, y0, x1, y1) {
-    squarifyRatio(ratio, parent, x0, y0, x1, y1);
-  }
-
-  squarify.ratio = function(x) {
-    return custom((x = +x) > 1 ? x : 1);
-  };
-
-  return squarify;
-})(phi);
-
-function d3Treemap() {
-  var tile = d3treemapSquarify,
-      round = false,
-      dx = 1,
-      dy = 1,
-      paddingStack = [0],
-      paddingInner = constantZero,
-      paddingTop = constantZero,
-      paddingRight = constantZero,
-      paddingBottom = constantZero,
-      paddingLeft = constantZero;
-
-  function treemap(root) {
-    root.x0 =
-    root.y0 = 0;
-    root.x1 = dx;
-    root.y1 = dy;
-    root.eachBefore(positionNode);
-    paddingStack = [0];
-    if (round) root.eachBefore(roundNode);
-    return root;
-  }
-
-  function positionNode(node) {
-    var p = paddingStack[node.depth],
-        x0 = node.x0 + p,
-        y0 = node.y0 + p,
-        x1 = node.x1 - p,
-        y1 = node.y1 - p;
-    if (x1 < x0) x0 = x1 = (x0 + x1) / 2;
-    if (y1 < y0) y0 = y1 = (y0 + y1) / 2;
-    node.x0 = x0;
-    node.y0 = y0;
-    node.x1 = x1;
-    node.y1 = y1;
-    if (node.children) {
-      p = paddingStack[node.depth + 1] = paddingInner(node) / 2;
-      x0 += paddingLeft(node) - p;
-      y0 += paddingTop(node) - p;
-      x1 -= paddingRight(node) - p;
-      y1 -= paddingBottom(node) - p;
-      if (x1 < x0) x0 = x1 = (x0 + x1) / 2;
-      if (y1 < y0) y0 = y1 = (y0 + y1) / 2;
-      tile(node, x0, y0, x1, y1);
-    }
-  }
-
-  treemap.round = function(x) {
-    return arguments.length ? (round = !!x, treemap) : round;
-  };
-
-  treemap.size = function(x) {
-    return arguments.length ? (dx = +x[0], dy = +x[1], treemap) : [dx, dy];
-  };
-
-  treemap.tile = function(x) {
-    return arguments.length ? (tile = required(x), treemap) : tile;
-  };
-
-  treemap.padding = function(x) {
-    return arguments.length ? treemap.paddingInner(x).paddingOuter(x) : treemap.paddingInner();
-  };
-
-  treemap.paddingInner = function(x) {
-    return arguments.length ? (paddingInner = typeof x === "function" ? x : constant$1(+x), treemap) : paddingInner;
-  };
-
-  treemap.paddingOuter = function(x) {
-    return arguments.length ? treemap.paddingTop(x).paddingRight(x).paddingBottom(x).paddingLeft(x) : treemap.paddingTop();
-  };
-
-  treemap.paddingTop = function(x) {
-    return arguments.length ? (paddingTop = typeof x === "function" ? x : constant$1(+x), treemap) : paddingTop;
-  };
-
-  treemap.paddingRight = function(x) {
-    return arguments.length ? (paddingRight = typeof x === "function" ? x : constant$1(+x), treemap) : paddingRight;
-  };
-
-  treemap.paddingBottom = function(x) {
-    return arguments.length ? (paddingBottom = typeof x === "function" ? x : constant$1(+x), treemap) : paddingBottom;
-  };
-
-  treemap.paddingLeft = function(x) {
-    return arguments.length ? (paddingLeft = typeof x === "function" ? x : constant$1(+x), treemap) : paddingLeft;
-  };
-
-  return treemap;
-}
-
-function d3treemapBinary(parent, x0, y0, x1, y1) {
-  var nodes = parent.children,
-      i, n = nodes.length,
-      sum, sums = new Array(n + 1);
-
-  for (sums[0] = sum = i = 0; i < n; ++i) {
-    sums[i + 1] = sum += nodes[i].value;
-  }
-
-  partition(0, n, parent.value, x0, y0, x1, y1);
-
-  function partition(i, j, value, x0, y0, x1, y1) {
-    if (i >= j - 1) {
-      var node = nodes[i];
-      node.x0 = x0, node.y0 = y0;
-      node.x1 = x1, node.y1 = y1;
-      return;
-    }
-
-    var valueOffset = sums[i],
-        valueTarget = (value / 2) + valueOffset,
-        k = i + 1,
-        hi = j - 1;
-
-    while (k < hi) {
-      var mid = k + hi >>> 1;
-      if (sums[mid] < valueTarget) k = mid + 1;
-      else hi = mid;
-    }
-
-    if ((valueTarget - sums[k - 1]) < (sums[k] - valueTarget) && i + 1 < k) --k;
-
-    var valueLeft = sums[k] - valueOffset,
-        valueRight = value - valueLeft;
-
-    if ((x1 - x0) > (y1 - y0)) {
-      var xk = (x0 * valueRight + x1 * valueLeft) / value;
-      partition(i, k, valueLeft, x0, y0, xk, y1);
-      partition(k, j, valueRight, xk, y0, x1, y1);
-    } else {
-      var yk = (y0 * valueRight + y1 * valueLeft) / value;
-      partition(i, k, valueLeft, x0, y0, x1, yk);
-      partition(k, j, valueRight, x0, yk, x1, y1);
-    }
-  }
-}
-
-function d3treemapSliceDice(parent, x0, y0, x1, y1) {
-  (parent.depth & 1 ? d3treemapSlice : d3treemapDice)(parent, x0, y0, x1, y1);
-}
-
-var d3treemapResquarify = (function custom(ratio) {
-
-  function resquarify(parent, x0, y0, x1, y1) {
-    if ((rows = parent._squarify) && (rows.ratio === ratio)) {
-      var rows,
-          row,
-          nodes,
-          i,
-          j = -1,
-          n,
-          m = rows.length,
-          value = parent.value;
-
-      while (++j < m) {
-        row = rows[j], nodes = row.children;
-        for (i = row.value = 0, n = nodes.length; i < n; ++i) row.value += nodes[i].value;
-        if (row.dice) d3treemapDice(row, x0, y0, x1, y0 += (y1 - y0) * row.value / value);
-        else d3treemapSlice(row, x0, y0, x0 += (x1 - x0) * row.value / value, y1);
-        value -= row.value;
-      }
-    } else {
-      parent._squarify = rows = squarifyRatio(ratio, parent, x0, y0, x1, y1);
-      rows.ratio = ratio;
-    }
-  }
-
-  resquarify.ratio = function(x) {
-    return custom((x = +x) > 1 ? x : 1);
-  };
-
-  return resquarify;
-})(phi);
-
-function styleInject(css, ref) {
-  if ( ref === void 0 ) ref = {};
-  var insertAt = ref.insertAt;
-
-  if (!css || typeof document === 'undefined') { return; }
-
-  var head = document.head || document.getElementsByTagName('head')[0];
-  var style = document.createElement('style');
-  style.type = 'text/css';
-
-  if (insertAt === 'top') {
-    if (head.firstChild) {
-      head.insertBefore(style, head.firstChild);
-    } else {
-      head.appendChild(style);
-    }
-  } else {
-    head.appendChild(style);
-  }
-
-  if (style.styleSheet) {
-    style.styleSheet.cssText = css;
-  } else {
-    style.appendChild(document.createTextNode(css));
-  }
-}
-
-var css_248z$4 = ".tree_CirclePacking circle{fill:#1f77b4;fill-opacity:.25;stroke:#1f77b4;stroke-width:1px}.tree_CirclePacking .leaf circle{fill:#ff7f0e;fill-opacity:1}.tree_CirclePacking .label{fill:#fff;text-anchor:middle}";
-styleInject(css_248z$4);
-
-var CirclePacking = /** @class */ (function (_super) {
-    __extends(CirclePacking, _super);
-    function CirclePacking() {
-        var _this = _super.call(this) || this;
-        ITree.call(_this);
-        return _this;
-    }
-    CirclePacking.prototype.enter = function (_domNode, element) {
-        this.diameter = Math.min(this.width(), this.height());
-        this.pack = d3Pack()
-            .size([this.diameter - 4, this.diameter - 4])
-            .padding(1.5);
-        this.svg = element
-            .append("g");
-    };
-    CirclePacking.prototype.update = function (_domNode, _element) {
-        var context = this;
-        this.diameter = Math.min(this.width(), this.height());
-        this.pack
-            .size([this.diameter - 4, this.diameter - 4])
-            .padding(1.5);
-        this._palette = this._palette.switch(this.paletteID());
-        if (this.useClonedPalette()) {
-            this._palette = this._palette.cloneNotExists(this.paletteID() + "_" + this.id());
-        }
-        this.svg.selectAll("circle").remove();
-        this.svg.selectAll("text").remove();
-        var root = hierarchy(this.data())
-            .sum(function (d) {
-            return d && d.size ? d.size : 1;
-        }).sort(function (a, b) {
-            return a.value < b.value ? -1 : a.value > b.value ? 1 : 0;
-        });
-        this._focus = root;
-        this.pack(root);
-        this.circle = this.svg.selectAll("circle").data(root.descendants())
-            .enter().append("circle")
-            .attr("class", function (d) { return d.parent ? d.children ? "node" : "node leaf" : "node root"; })
-            .style("fill", function (d) {
-            d.color = context.paletteDepthLevel_exists() && d.depth > context.paletteDepthLevel() ? rgb(d.parent.color)[context.paletteDepthVariant()](1) : context._palette(d.data.label);
-            return d.color;
-        })
-            .on("click", function (d) { context.click(d.data, null, null); })
-            .on("dblclick", function (d) {
-            if (this._focus !== d) {
-                context.zoom(d);
-            }
-            d3Event().stopPropagation();
-        });
-        this.circle.append("title").text(function (d) { return d.data.label; });
-        this.svg.selectAll("text").data(root.descendants())
-            .enter().append("text")
-            .attr("class", "label")
-            .style("fill-opacity", function (d) { return d.parent === root ? 1 : 0; })
-            .style("display", function (d) { return d.parent === root ? null : "none"; })
-            .text(function (d) {
-            return d.data.label + (context.showSize() && typeof d.data.size !== "undefined" ? " " + d.data.size : "");
-        });
-        this._node = this.svg.selectAll("circle,text");
-        this.zoomTo([root.x, root.y, root.r * 2]);
-    };
-    CirclePacking.prototype.zoom = function (newFocus) {
-        this._focus = newFocus;
-        var context = this;
-        var transition = this.svg.transition()
-            .duration(d3Event().altKey ? 7500 : 750)
-            .tween("zoom", function () {
-            var i = interpolateZoom(context.view, [context._focus.x, context._focus.y, context._focus.r * 2]);
-            return function (t) { context.zoomTo(i(t)); };
-        });
-        function showText(d) {
-            return (d === context._focus && !d.children) || d.parent === context._focus;
-        }
-        transition.selectAll("text")
-            .filter(function (d) { return showText(d) || this.style.display === "inline"; })
-            .style("fill-opacity", function (d) { return showText(d) ? 1 : 0; })
-            .on("start", function (d) { if (showText(d))
-            this.style.display = "inline"; })
-            .on("end", function (d) { if (!showText(d))
-            this.style.display = "none"; });
-    };
-    CirclePacking.prototype.zoomTo = function (v) {
-        var k = this.diameter / v[2];
-        this.view = v;
-        this._node.attr("transform", function (d) { return "translate(" + (d.x - v[0]) * k + "," + (d.y - v[1]) * k + ")"; });
-        this.circle.attr("r", function (d) { return d.r * k; });
-    };
-    return CirclePacking;
-}(SVGWidget));
-CirclePacking.prototype._class += " tree_CirclePacking";
-CirclePacking.prototype.implements(ITree.prototype);
-CirclePacking.prototype.publish("showSize", true, "boolean", "Show size along with label");
-CirclePacking.prototype.publish("paletteDepthLevel", null, "number", "If not null then beyond this depth number the child node colors are based on parent", null, { optional: true });
-CirclePacking.prototype.publish("paletteDepthVariant", "brighter", "set", "Determines paletteDepthLevel decendant color shade variant", ["brighter", "darker"], { disable: function (w) { return w.paletteDepthLevel_exists(); } });
-CirclePacking.prototype.publish("paletteID", "default", "set", "Color palette for this widget", CirclePacking.prototype._palette.switch(), { tags: ["Basic", "Shared"] });
-CirclePacking.prototype.publish("useClonedPalette", false, "boolean", "Enable or disable using a cloned palette", null, { tags: ["Intermediate", "Shared"] });
-
-var css_248z$3 = ".tree_Dendrogram .node circle{fill:#dcf1ff;stroke:#1f77b4;stroke-width:1px}.tree_Dendrogram .node.selected circle{stroke:red}.tree_Dendrogram .node.over circle{stroke:orange}.tree_Dendrogram .node.selected.over circle{stroke:red}.tree_Dendrogram .node.selected text{fill:red}.tree_Dendrogram .node.over text{fill:orange}.tree_Dendrogram .node.selected.over text{fill:red}.tree_Dendrogram .node text{font-size:14px}.tree_Dendrogram .link{fill:none;stroke:#656565;stroke-width:1px}";
-styleInject(css_248z$3);
-
-var DendrogramColumn = /** @class */ (function (_super) {
-    __extends(DendrogramColumn, _super);
-    function DendrogramColumn() {
-        return _super.call(this) || this;
-    }
-    DendrogramColumn.prototype.owner = function (_) {
-        if (!arguments.length)
-            return this._owner;
-        this._owner = _;
-        return this;
-    };
-    DendrogramColumn.prototype.valid = function () {
-        return !!this.column();
-    };
-    return DendrogramColumn;
-}(PropertyExt));
-DendrogramColumn.prototype._class += " tree_Dendrogram.DendrogramColumn";
-DendrogramColumn.prototype.publish("column", null, "set", "Field", function () { return this._owner ? this._owner.columns() : []; }, { optional: true });
-// ===
-var Dendrogram = /** @class */ (function (_super) {
-    __extends(Dendrogram, _super);
-    function Dendrogram() {
-        var _this = _super.call(this) || this;
-        ITree.call(_this);
-        Utility.SimpleSelectionMixin.call(_this);
-        _this._drawStartPos = "origin";
-        _this._d3LayoutCluster = d3Cluster();
-        _this._d3LayoutTree = d3Tree();
-        return _this;
-    }
-    Dendrogram.prototype.dendrogramData = function () {
-        if (this.data().length === 0)
-            return [];
-        if (!this.mappings().filter(function (mapping) { return mapping.valid(); }).length) {
-            return this.data();
-        }
-        var view = this._db.rollupView(this.mappings().map(function (mapping) { return mapping.column(); }));
-        var retVal = {
-            key: "root",
-            values: view.entries()
-        };
-        return formatData(retVal);
-        function formatData(node) {
-            return {
-                label: node.key,
-                children: node.values.filter(function (value) { return !(value instanceof Array); }).map(function (value) { return formatData(value); }),
-                origRows: node.values
-            };
-        }
-    };
-    Dendrogram.prototype.enter = function (domNode, element) {
-        _super.prototype.enter.call(this, domNode, element);
-        this._renderElement
-            .attr("opacity", 0)
-            .transition().duration(500)
-            .attr("opacity", 1);
-        this._selection.widgetElement(this._renderElement);
-    };
-    Dendrogram.prototype.update = function (domNode, element) {
-        _super.prototype.update.call(this, domNode, element);
-        var context = this;
-        var isVertical = this.orientation() === "vertical";
-        this._palette = this._palette.switch(this.paletteID());
-        if (this.useClonedPalette()) {
-            this._palette = this._palette.cloneNotExists(this.paletteID() + "_" + this.id());
-        }
-        this._d3Layout = this.dendrogram() ? this._d3LayoutCluster : this._d3LayoutTree;
-        if (this.radial()) {
-            this._d3Layout
-                .size([360, this.separation() * 2]);
-            this._d3Layout.separation(function separation(a, b) {
-                return (a.parent === b.parent ? 1 : 2) / a.depth;
-            });
-        }
-        else {
-            this._d3Layout.nodeSize([14, this.separation()]);
-            this._d3Layout.separation(function separation(a, b) {
-                return a.parent === b.parent ? 1 : 2;
-            });
-        }
-        var data = this.dendrogramData();
-        var root = hierarchy(data);
-        this._d3Layout(root);
-        var dataNodes = root.descendants();
-        var links = root.descendants().slice(1);
-        //  Lines  ---
-        function linkVertical(d) {
-            return "M" + d.parent.x + "," + d.parent.y
-                + "C" + d.parent.x + "," + (d.parent.y + d.y) / 2
-                + " " + d.x + "," + (d.parent.y + d.y) / 2
-                + " " + d.x + "," + d.y;
-        }
-        function linkHorizontal(d) {
-            return "M" + d.y + "," + d.x
-                + "C" + (d.y + d.parent.y) / 2 + "," + d.x
-                + " " + (d.y + d.parent.y) / 2 + "," + d.parent.x
-                + " " + d.parent.y + "," + d.parent.x;
-        }
-        function diagonal(d) {
-            return isVertical ? linkVertical(d) : linkHorizontal(d);
-        }
-        function project(x, y) {
-            var angle = (x - 90) / 180 * Math.PI;
-            var radius = y;
-            return [radius * Math.cos(angle), radius * Math.sin(angle)];
-        }
-        function radialDiagonal(d) {
-            return "M" + project(d.x, d.y)
-                + "C" + project(d.x, (d.y + d.parent.y) / 2)
-                + " " + project(d.parent.x, (d.y + d.parent.y) / 2)
-                + " " + project(d.parent.x, d.parent.y);
-        }
-        var transitionDuration = this._renderCount ? 500 : 0;
-        var lines = this._renderElement.selectAll(".link").data(links);
-        lines.enter().append("path")
-            .attr("class", "link")
-            .attr("d", this.radial() ? radialDiagonal : diagonal);
-        lines.transition().duration(transitionDuration)
-            .attr("d", this.radial() ? radialDiagonal : diagonal);
-        lines.exit().remove();
-        //  Nodes  ---
-        var textOffsetX = this.circleRadius() + 2;
-        function nodeTransform(d) {
-            if (context.radial()) {
-                return "rotate(" + (d.x - 90) + ")translate(" + d.y + ")";
-            }
-            return context.orientation() === "horizontal" ? "translate(" + d.y + "," + d.x + ")" : "translate(" + d.x + "," + d.y + ")";
-        }
-        var nodes = this._renderElement.selectAll(".node").data(dataNodes);
-        nodes.transition().duration(transitionDuration)
-            .attr("transform", nodeTransform);
-        var enterNodes = nodes.enter().append("g")
-            .attr("class", "node")
-            .attr("transform", nodeTransform)
-            .call(this._selection.enter.bind(this._selection))
-            .on("click", function (d) {
-            var tmp = d;
-            while (tmp.children) {
-                tmp = tmp.children[0];
-            }
-            if (d.depth > 0) {
-                if (tmp.origRows) {
-                    context.click(context.rowToObj(tmp.origRows[0]), context.mappings()[d.depth - 1].column(), true);
-                }
-                else {
-                    context.click(tmp.data, context.mappings()[d.depth - 1].column(), true);
-                }
-            }
-        })
-            .on("dblclick", function (d) {
-            var tmp = d;
-            while (tmp.children) {
-                tmp = tmp.children[0];
-            }
-            if (d.depth > 0) {
-                if (tmp.origRows) {
-                    context.dblclick(context.rowToObj(tmp.origRows[0]), context.mappings()[d.depth - 1].column(), true);
-                }
-                else {
-                    context.dblclick(tmp.data, context.mappings()[d.depth - 1].column(), true);
-                }
-            }
-        })
-            .each(function () {
-            var e = select(this);
-            e.append("circle");
-            e.append("text");
-        });
-        enterNodes.merge(nodes).select("circle")
-            .attr("r", this.circleRadius())
-            .style("fill", function (d) { return context._palette(d.data.label); })
-            .append("title")
-            .text(function (d) { return d.data.label; });
-        enterNodes.merge(nodes).select("text")
-            .attr("dx", function (d) {
-            if (context.radial()) {
-                if (d.children) {
-                    return d.x < 180 ? -textOffsetX : textOffsetX;
-                }
-                else {
-                    return d.x < 180 ? textOffsetX : -textOffsetX;
-                }
-            }
-            else if (isVertical) {
-                return d.children ? textOffsetX : -textOffsetX;
-            }
-            return d.children ? -textOffsetX : textOffsetX;
-        })
-            .attr("dy", "0.25em")
-            .style("text-anchor", function (d) {
-            if (context.radial()) {
-                if (d.children) {
-                    return d.x < 180 ? "end" : "start";
-                }
-                else {
-                    return d.x < 180 ? "start" : "end";
-                }
-            }
-            else if (isVertical) {
-                return d.children ? "start" : "end";
-            }
-            return d.children ? "end" : "start";
-        })
-            .attr("transform", function (d) {
-            if (context.radial()) {
-                return d.x < 180 ? null : "rotate(180)";
-            }
-            else if (isVertical) {
-                return "rotate(-66)";
-            }
-            return null;
-        })
-            .text(function (d) { return d.data.label; });
-        nodes.exit().remove();
-        if (!this._renderCount) {
-            context.zoomToFit();
-        }
-    };
-    return Dendrogram;
-}(SVGZoomWidget));
-Dendrogram.prototype._class += " tree_Dendrogram";
-Dendrogram.prototype.implements(ITree.prototype);
-Dendrogram.prototype.mixin(Utility.SimpleSelectionMixin);
-Dendrogram.prototype.Column = DendrogramColumn;
-Dendrogram.prototype.publish("paletteID", "default", "set", "Color palette for this widget", Dendrogram.prototype._palette.switch(), { tags: ["Basic", "Shared"] });
-Dendrogram.prototype.publish("useClonedPalette", false, "boolean", "Enable or disable using a cloned palette", null, { tags: ["Intermediate", "Shared"] });
-Dendrogram.prototype.publish("mappings", [], "propertyArray", "Source Columns", null, { autoExpand: DendrogramColumn });
-Dendrogram.prototype.publish("circleRadius", 4.5, "number", "Text offset from circle");
-Dendrogram.prototype.publish("separation", 240, "number", "Leaf Separation");
-Dendrogram.prototype.publish("dendrogram", true, "boolean", "Dendrogram");
-Dendrogram.prototype.publish("radial", false, "boolean", "Radial");
-Dendrogram.prototype.publish("orientation", "horizontal", "set", "Orientation", ["horizontal", "vertical"], { tags: ["Private"], disable: function (w) { return w.radial(); } });
-
-var DirectoryTree = /** @class */ (function (_super) {
-    __extends(DirectoryTree, _super);
-    function DirectoryTree() {
-        return _super.call(this) || this;
-    }
-    DirectoryTree.prototype.flattenData = function (json) {
-        var context = this;
-        var root = hierarchy(json);
-        var ret = [];
-        if (!this.omitRoot()) {
-            visitNode(root);
-        }
-        else if (root.children) {
-            root.children.forEach(visitNode);
-        }
-        return ret;
-        function visitNode(node) {
-            var weightValue = node.data.markers && node.data.markers.length ? node.data.markers.length : "";
-            ret.push({
-                label: node.data.label,
-                depth: node.depth - (context.omitRoot() ? 1 : 0),
-                content: node.data.content,
-                isFolder: !!node.data.children,
-                iconClass: node.data.iconClass,
-                color: node.data.color,
-                bold: node.data.bold,
-                weightValue: weightValue,
-                markers: node.data.markers,
-                selected: node.data.selected
-            });
-            if (node.children) {
-                node.children.forEach(visitNode);
-            }
-        }
-    };
-    DirectoryTree.prototype.iconClass = function (d) {
-        if (d.label === "error") {
-            return "fa fa-exclamation";
-        }
-        if (d.isFolder) {
-            return this.folderIconOpen();
-        }
-        return this.textFileIcon();
-    };
-    DirectoryTree.prototype.calcRequiredWidth = function () {
-        var _this = this;
-        var flatData = this.flattenData(this.data());
-        var widest = 0;
-        var padding = this.rowItemPadding();
-        var iconWidth = this.iconSize() + (padding * 2);
-        var scrollbarWidth = Platform.getScrollbarWidth();
-        flatData.forEach(function (row) {
-            var offsetWidth = (row.depth * iconWidth) + (padding * 2);
-            var textWidth = Utility.textSize(row.label, _this.fontFamily(), _this.fontSize(), !!row.bold).width + (padding * 2);
-            var totalWidth = textWidth + iconWidth + offsetWidth + scrollbarWidth;
-            if (widest < totalWidth) {
-                widest = totalWidth;
-            }
-        });
-        return widest;
-    };
-    DirectoryTree.prototype.rowClick = function (str, markers) { };
-    DirectoryTree.prototype.enter = function (domNode, element) {
-        _super.prototype.enter.call(this, domNode, element);
-        element
-            .style("width", "100%")
-            .style("height", "100%");
-    };
-    DirectoryTree.prototype.update = function (domNode, element) {
-        var _this = this;
-        _super.prototype.update.call(this, domNode, element);
-        this._palette = this._palette.switch(this.paletteID());
-        element
-            .style("overflow-y", this.verticalScroll() ? "scroll" : null);
-        var flatData = this.flattenData(this.data());
-        var maxWeightValue = max$1(flatData, function (n) { return Number(n.weightValue); });
-        flatData.forEach(function (d) {
-            if (!d.weightValue) {
-                d.weightColor = "transparent";
-            }
-            else {
-                d.weightColor = _this._palette(d.weightValue, 1, maxWeightValue);
-            }
-        });
-        var context = this;
-        var padding = this.rowItemPadding();
-        var iconWidth = this.iconSize() + padding;
-        var lineHeight = Math.max(context.iconSize(), context.fontSize());
-        var rowSelection = element.selectAll(".directory-row").data(flatData);
-        var fontFamily = this.fontFamily();
-        var fontSize = this.fontSize();
-        var maxWeightWidth = max$1(flatData, function (d) { return _this.textSize(d.weightValue, fontFamily, fontSize).width; });
-        var rowItemPadding = "".concat(padding, "px ").concat(padding, "px ").concat(padding / 2, "px ").concat(padding, "px");
-        var rowEnter = rowSelection.enter().append("div")
-            .attr("class", function (d) { return "directory-row directory-row-depth-".concat(d.depth); })
-            .style("display", "flex")
-            .style("cursor", "pointer")
-            .each(function (d) {
-            var rowDiv = select(this);
-            var fontColor = d.color ? d.color : context.fontColor();
-            var weightColor = d.weightColor ? d.weightColor : "transparent";
-            var weightFontColor = Palette.textColor(weightColor);
-            var weightDiv = rowDiv.append("div")
-                .attr("class", "row-weight")
-                .style("padding", rowItemPadding)
-                .style("color", weightFontColor)
-                .style("box-shadow", "inset 0 0 100px ".concat(weightColor))
-                .style("font-weight", d.bold ? "bold" : "normal")
-                .style("font-family", fontFamily)
-                .style("font-size", fontSize + "px")
-                .text(d.weightValue)
-                .attr("title", d.weightValue)
-                .style("overflow", "hidden")
-                .style("width", (maxWeightWidth + (padding * 2)) + "px")
-                .style("text-overflow", "ellipsis")
-                .style("text-align", "right")
-                .style("line-height", lineHeight + "px");
-            rowDiv.append("div")
-                .attr("class", "row-depth")
-                .style("width", (context.depthSize() * d.depth) + "px")
-                .style("opacity", 1)
-                .style("line-height", lineHeight + "px");
-            var iconDiv = rowDiv.append("div")
-                .attr("class", "row-icon " + (d.iconClass ? d.iconClass : context.iconClass(d)))
-                .style("width", iconWidth + "px")
-                .style("height", lineHeight + "px")
-                .style("color", fontColor)
-                .style("background-color", d.selected ? context.selectionBackgroundColor() : "transparent")
-                .style("font-size", context.iconSize() + "px")
-                .style("padding", rowItemPadding)
-                .style("line-height", lineHeight + "px");
-            var labelDiv = rowDiv.append("div")
-                .attr("class", "row-label")
-                .style("padding", rowItemPadding)
-                .style("color", fontColor)
-                .style("background-color", d.selected ? context.selectionBackgroundColor() : "transparent")
-                .style("font-weight", d.bold ? "bold" : "normal")
-                .style("font-family", context.fontFamily())
-                .style("font-size", context.fontSize() + "px")
-                .text(d.label)
-                .attr("title", d.label)
-                .style("flex", 1)
-                .style("overflow", "hidden")
-                .style("text-overflow", "ellipsis")
-                .style("line-height", lineHeight + "px");
-            rowDiv
-                .on("mouseenter", function () {
-                labelDiv.style("font-weight", "bold");
-            })
-                .on("mouseleave", function () {
-                labelDiv.style("font-weight", d.bold ? "bold" : "normal");
-            });
-            weightDiv
-                .on("mouseenter", function () {
-                context.weight_mouseenter(d);
-            })
-                .on("mouseleave", function () {
-                context.weight_mouseleave(d);
-            });
-            if (d.isFolder) {
-                rowDiv.on("click", function (d) {
-                    var next = this.nextSibling;
-                    var wasClosed = rowDiv.classed("folder-closed");
-                    if (wasClosed) {
-                        rowDiv.classed("folder-closed", false);
-                        rowDiv.classed("folder-open", true);
-                        iconDiv.attr("class", "row-icon " + context.folderIconOpen());
-                    }
-                    else {
-                        rowDiv.classed("folder-closed", true);
-                        rowDiv.classed("folder-open", false);
-                        iconDiv.attr("class", "row-icon " + context.folderIconClosed());
-                    }
-                    while (next !== null) {
-                        var nextDepth = select(next).datum().depth;
-                        if (nextDepth > d.depth) {
-                            next.style.display = wasClosed ? "flex" : "none";
-                            next = next.nextSibling;
-                        }
-                        else {
-                            next = null;
-                        }
-                    }
-                });
-            }
-            else {
-                rowDiv.on("click", function () {
-                    element.selectAll(".row-label").style("background-color", "transparent");
-                    element.selectAll(".row-icon").style("background-color", "transparent");
-                    iconDiv.style("background-color", context.selectionBackgroundColor());
-                    labelDiv.style("background-color", context.selectionBackgroundColor());
-                    var ext = d.label.split(".").pop().toLowerCase();
-                    context.rowClick(ext === "json" ? JSON.stringify(JSON.parse(d.content), null, 4) : d.content, d.markers);
-                });
-            }
-        });
-        rowEnter
-            .merge(rowSelection)
-            .style("background-color", context.backgroundColor());
-        rowSelection.exit().remove();
-    };
-    DirectoryTree.prototype.weight_mouseenter = function (d) {
-    };
-    DirectoryTree.prototype.weight_mouseleave = function (d) {
-    };
-    return DirectoryTree;
-}(HTMLWidget));
-DirectoryTree.prototype._class += " tree_DirectoryTree";
-DirectoryTree.prototype._palette = Palette.rainbow("Blues");
-DirectoryTree.prototype.publish("depthSize", 14, "number", "Width of indentation per file or folder depth (pixels)");
-DirectoryTree.prototype.publish("paletteID", "Blues", "set", "Color palette for the weight backgrounds", DirectoryTree.prototype._palette.switch(), { tags: ["Basic"] });
-DirectoryTree.prototype.publish("omitRoot", false, "boolean", "If true, root node will not display");
-DirectoryTree.prototype.publish("rowItemPadding", 2, "number", "Top, bottom, left and right row item padding");
-DirectoryTree.prototype.publish("selectionBackgroundColor", "#CCC", "html-color", "Background color of selected directory rows");
-DirectoryTree.prototype.publish("backgroundColor", "#FFF", "html-color", "Directory item background color");
-DirectoryTree.prototype.publish("fontColor", "#000", "html-color", "Directory item font color");
-DirectoryTree.prototype.publish("fontFamily", "Arial", "string", "Directory item font family");
-DirectoryTree.prototype.publish("fontSize", 12, "number", "Directory item font size (pixels)");
-DirectoryTree.prototype.publish("iconSize", 12, "number", "Directory folder and file icon size (pixels)");
-DirectoryTree.prototype.publish("folderIconOpen", "fa fa-folder-open", "string", "Open folder icon class");
-DirectoryTree.prototype.publish("folderIconClosed", "fa fa-folder", "string", "Closed folder icon class");
-DirectoryTree.prototype.publish("textFileIcon", "fa fa-file-text-o", "string", "Text file icon class");
-DirectoryTree.prototype.publish("verticalScroll", true, "boolean", "If true, vertical scroll bar will be shown");
-
-var css_248z$2 = ".tree_Indented .node rect{fill:#fff;stroke:#3182bd;stroke-width:1px;cursor:pointer}.tree_Indented .node text{font:10px sans-serif;pointer-events:none}.tree_Indented path.link{fill:none;stroke:#9ecae1;stroke-width:1.5px}";
-styleInject(css_248z$2);
-
-var IndentedColumn = /** @class */ (function (_super) {
-    __extends(IndentedColumn, _super);
-    function IndentedColumn() {
-        return _super.call(this) || this;
-    }
-    IndentedColumn.prototype.owner = function (_) {
-        if (!arguments.length)
-            return this._owner;
-        this._owner = _;
-        return this;
-    };
-    IndentedColumn.prototype.valid = function () {
-        return !!this.column();
-    };
-    return IndentedColumn;
-}(PropertyExt));
-IndentedColumn.prototype._class += " tree_Dendrogram.IndentedColumn";
-IndentedColumn.prototype.publish("column", null, "set", "Field", function () { return this._owner ? this._owner.columns() : []; }, { optional: true });
-// ===
-var Indented = /** @class */ (function (_super) {
-    __extends(Indented, _super);
-    function Indented() {
-        var _this = _super.call(this) || this;
-        _this._collapsed = {};
-        ITree.call(_this);
-        Utility.SimpleSelectionMixin.call(_this);
-        _this._drawStartPos = "origin";
-        _this._d3Tree = d3Tree();
-        return _this;
-    }
-    Indented.prototype.xmlToData = function (xml, id) {
-        if (id === void 0) { id = ""; }
-        if (DOMParser) {
-            var parser = new DOMParser();
-            var doc = parser.parseFromString(xml, "text/xml");
-            return xmlToJson(doc, id).children[0];
-        }
-        return [];
-    };
-    Indented.prototype.xml = function (_) {
-        if (!arguments.length)
-            return this._xml;
-        this._xml = _;
-        this.data(this.xmlToData(this._xml));
-        return this;
-    };
-    Indented.prototype.IndentedData = function () {
-        if (this.data().length === 0)
-            return [];
-        if (this.xmlColumn_exists()) {
-            var cellIdx_1 = this.columns().indexOf(this.xmlColumn());
-            var retVal = {
-                label: this.xmlColumn(),
-                children: this.data().map(function (row, idx) {
-                    return this.xmlToData(row[cellIdx_1], "[" + idx + "]");
-                }, this)
-            };
-            return retVal.children.length === 1 ? retVal.children[0] : retVal;
-        }
-        else {
-            if (!this.mappings().filter(function (mapping) { return mapping.valid(); }).length) {
-                return this.data();
-            }
-            var view = this._db.rollupView(this.mappings().map(function (mapping) { return mapping.column(); }));
-            var root = {
-                key: "root",
-                values: view.entries()
-            };
-            return formatData(root);
-        }
-        function formatData(node) {
-            if (node.values instanceof Array) {
-                var children = node.values.filter(function (value) {
-                    return !(value instanceof Array);
-                }).map(function (value) {
-                    return formatData(value);
-                });
-                var retVal = {
-                    label: node.key
-                };
-                if (children.length) {
-                    retVal.children = children;
-                }
-                else {
-                    retVal.size = 22;
-                }
-                return retVal;
-            }
-            return {
-                label: node.key,
-                size: node.values.aggregate,
-                origRows: node.values
-            };
-        }
-    };
-    Indented.prototype.enter = function (domNode, element) {
-        _super.prototype.enter.call(this, domNode, element);
-        this._svgLinks = this._renderElement.append("g");
-        this._svgNodes = this._renderElement.append("g");
-        this._selection.widgetElement(this._svgNodes);
-    };
-    Indented.prototype.update = function (domNode, _element) {
-        var _this = this;
-        _super.prototype.update.call(this, domNode, _element);
-        var context = this;
-        this._d3Tree
-            .nodeSize([0, this.barHeight()]);
-        var dataChecksum = this._db.dataChecksum();
-        if (this._prevDataChecksum !== dataChecksum) {
-            this._treeData = this.IndentedData();
-            this._prevDataChecksum = dataChecksum;
-        }
-        function getID(d) {
-            return (d.parent ? getID(d.parent) + "." : "") + d.data.label;
-        }
-        var root = hierarchy(this.data())
-            .sum(function (d) {
-            return d.size || 50;
-        }).each(function (d) {
-            if (_this._collapsed[getID(d)]) {
-                delete (d.children);
-            }
-        });
-        var dataNodes = this._d3Tree(root).descendants();
-        var links = this._d3Tree(root).descendants().slice(1);
-        var nodeIdx = 0;
-        root.eachBefore(function (n) {
-            n.x = nodeIdx * context.barHeight();
-            ++nodeIdx;
-        });
-        var boxSize = this.barHeight() - 4;
-        var transitionDuration = this._renderCount ? 500 : 0;
-        //  Lines  ---
-        var lines = this._svgLinks.selectAll(".link").data(links, function (d) { return getID(d); });
-        lines.enter().append("path")
-            .attr("class", "link")
-            .attr("d", elbow);
-        lines.transition().duration(transitionDuration)
-            .attr("d", elbow);
-        lines.exit().remove();
-        function elbow(d) {
-            return "M" + d.parent.y + "," + d.parent.x
-                + "V" + d.x + ", H" + d.y;
-        }
-        //  Nodes  ---
-        var nodes = this._svgNodes.selectAll(".node").data(dataNodes, function (d) { return getID(d); });
-        nodes.transition().duration(transitionDuration)
-            .attr("transform", function (d) { return "translate(" + d.y + "," + d.x + ")"; });
-        var enterNodes = nodes.enter().append("g")
-            .attr("class", "node")
-            .attr("transform", function (d) { return "translate(" + d.y + "," + d.x + ")"; })
-            .call(this._selection.enter.bind(this._selection))
-            .each(function () {
-            var element = select(this);
-            element.append("rect")
-                .attr("height", boxSize)
-                .attr("width", boxSize)
-                .on("click", function (d) {
-                if (context._collapsed[getID(d)]) {
-                    delete context._collapsed[getID(d)];
-                }
-                else if (d.children) {
-                    context._collapsed[getID(d)] = true;
-                }
-                context.lazyRender();
-            });
-            element.append("text");
-        })
-            .style("opacity", 0);
-        enterNodes.transition()
-            .style("opacity", 1);
-        enterNodes.merge(nodes).select("rect")
-            .attr("x", -boxSize / 2)
-            .attr("y", -boxSize / 2)
-            .style("fill", color);
-        enterNodes.merge(nodes).select("text")
-            .attr("dx", boxSize / 2 + 4 + "px")
-            .attr("dy", "0.33em")
-            .text(function (d) { return d.data.label; });
-        nodes.exit().transition()
-            .style("opacity", 0)
-            .remove();
-        if (!this._renderCount) {
-            context.zoomToFit();
-        }
-        function color(d) {
-            return context._collapsed[getID(d)] ? "#3182bd" : d.children ? "#c6dbef" : "#fd8d3c";
-        }
-    };
-    return Indented;
-}(SVGZoomWidget));
-Indented.prototype._class += " tree_Indented";
-Indented.prototype.implements(ITree.prototype);
-Indented.prototype.mixin(Utility.SimpleSelectionMixin);
-Indented.prototype.Column = IndentedColumn;
-Indented.prototype.publish("xmlColumn", null, "set", "Field", function () { return this.columns(); }, { optional: true });
-Indented.prototype.publish("mappings", [], "propertyArray", "Source Columns", null, { autoExpand: IndentedColumn, disable: function (w) { return w.xmlColumn_exists(); } });
-Indented.prototype.publish("barHeight", 16, "number", "Bar height");
-function xmlToJson(xml, id) {
-    if (id === void 0) { id = ""; }
-    var retVal = {
-        id: id,
-        label: "",
-        attributes: {},
-        children: []
-    };
-    retVal.label = xml.nodeName;
-    if (xml.nodeType === 1) { // element
-        if (xml.attributes.length > 0) {
-            for (var j = 0; j < xml.attributes.length; j++) {
-                var attribute = xml.attributes.item(j);
-                retVal.attributes[attribute.nodeName] = attribute.nodeValue;
-            }
-        }
-    }
-    else if (xml.nodeType === 3) { // text
-        retVal.label = xml.nodeValue;
-    }
-    if (xml.hasChildNodes()) {
-        for (var i = 0; i < xml.childNodes.length; i++) {
-            var item = xml.childNodes.item(i);
-            var child = xmlToJson(item, id + "[" + retVal.children.length + "]");
-            retVal.children.push(child);
-        }
-    }
-    return retVal;
-}
-
-var pi$1 = Math.PI,
-    tau$1 = 2 * pi$1,
-    epsilon$1 = 1e-6,
-    tauEpsilon = tau$1 - epsilon$1;
-
-function Path() {
-  this._x0 = this._y0 = // start of current subpath
-  this._x1 = this._y1 = null; // end of current subpath
-  this._ = "";
-}
-
-function path() {
-  return new Path;
-}
-
-Path.prototype = path.prototype = {
-  constructor: Path,
-  moveTo: function(x, y) {
-    this._ += "M" + (this._x0 = this._x1 = +x) + "," + (this._y0 = this._y1 = +y);
-  },
-  closePath: function() {
-    if (this._x1 !== null) {
-      this._x1 = this._x0, this._y1 = this._y0;
-      this._ += "Z";
-    }
-  },
-  lineTo: function(x, y) {
-    this._ += "L" + (this._x1 = +x) + "," + (this._y1 = +y);
-  },
-  quadraticCurveTo: function(x1, y1, x, y) {
-    this._ += "Q" + (+x1) + "," + (+y1) + "," + (this._x1 = +x) + "," + (this._y1 = +y);
-  },
-  bezierCurveTo: function(x1, y1, x2, y2, x, y) {
-    this._ += "C" + (+x1) + "," + (+y1) + "," + (+x2) + "," + (+y2) + "," + (this._x1 = +x) + "," + (this._y1 = +y);
-  },
-  arcTo: function(x1, y1, x2, y2, r) {
-    x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;
-    var x0 = this._x1,
-        y0 = this._y1,
-        x21 = x2 - x1,
-        y21 = y2 - y1,
-        x01 = x0 - x1,
-        y01 = y0 - y1,
-        l01_2 = x01 * x01 + y01 * y01;
-
-    // Is the radius negative? Error.
-    if (r < 0) throw new Error("negative radius: " + r);
-
-    // Is this path empty? Move to (x1,y1).
-    if (this._x1 === null) {
-      this._ += "M" + (this._x1 = x1) + "," + (this._y1 = y1);
-    }
-
-    // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.
-    else if (!(l01_2 > epsilon$1));
-
-    // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?
-    // Equivalently, is (x1,y1) coincident with (x2,y2)?
-    // Or, is the radius zero? Line to (x1,y1).
-    else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon$1) || !r) {
-      this._ += "L" + (this._x1 = x1) + "," + (this._y1 = y1);
-    }
-
-    // Otherwise, draw an arc!
-    else {
-      var x20 = x2 - x0,
-          y20 = y2 - y0,
-          l21_2 = x21 * x21 + y21 * y21,
-          l20_2 = x20 * x20 + y20 * y20,
-          l21 = Math.sqrt(l21_2),
-          l01 = Math.sqrt(l01_2),
-          l = r * Math.tan((pi$1 - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),
-          t01 = l / l01,
-          t21 = l / l21;
-
-      // If the start tangent is not coincident with (x0,y0), line to.
-      if (Math.abs(t01 - 1) > epsilon$1) {
-        this._ += "L" + (x1 + t01 * x01) + "," + (y1 + t01 * y01);
-      }
-
-      this._ += "A" + r + "," + r + ",0,0," + (+(y01 * x20 > x01 * y20)) + "," + (this._x1 = x1 + t21 * x21) + "," + (this._y1 = y1 + t21 * y21);
-    }
-  },
-  arc: function(x, y, r, a0, a1, ccw) {
-    x = +x, y = +y, r = +r, ccw = !!ccw;
-    var dx = r * Math.cos(a0),
-        dy = r * Math.sin(a0),
-        x0 = x + dx,
-        y0 = y + dy,
-        cw = 1 ^ ccw,
-        da = ccw ? a0 - a1 : a1 - a0;
-
-    // Is the radius negative? Error.
-    if (r < 0) throw new Error("negative radius: " + r);
-
-    // Is this path empty? Move to (x0,y0).
-    if (this._x1 === null) {
-      this._ += "M" + x0 + "," + y0;
-    }
-
-    // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).
-    else if (Math.abs(this._x1 - x0) > epsilon$1 || Math.abs(this._y1 - y0) > epsilon$1) {
-      this._ += "L" + x0 + "," + y0;
-    }
-
-    // Is this arc empty? We’re done.
-    if (!r) return;
-
-    // Does the angle go the wrong way? Flip the direction.
-    if (da < 0) da = da % tau$1 + tau$1;
-
-    // Is this a complete circle? Draw two arcs to complete the circle.
-    if (da > tauEpsilon) {
-      this._ += "A" + r + "," + r + ",0,1," + cw + "," + (x - dx) + "," + (y - dy) + "A" + r + "," + r + ",0,1," + cw + "," + (this._x1 = x0) + "," + (this._y1 = y0);
-    }
-
-    // Is this arc non-empty? Draw an arc!
-    else if (da > epsilon$1) {
-      this._ += "A" + r + "," + r + ",0," + (+(da >= pi$1)) + "," + cw + "," + (this._x1 = x + r * Math.cos(a1)) + "," + (this._y1 = y + r * Math.sin(a1));
-    }
-  },
-  rect: function(x, y, w, h) {
-    this._ += "M" + (this._x0 = this._x1 = +x) + "," + (this._y0 = this._y1 = +y) + "h" + (+w) + "v" + (+h) + "h" + (-w) + "Z";
-  },
-  toString: function() {
-    return this._;
-  }
-};
-
-function constant(x) {
-  return function constant() {
-    return x;
-  };
-}
-
-var abs = Math.abs;
-var atan2 = Math.atan2;
-var cos = Math.cos;
-var max = Math.max;
-var min = Math.min;
-var sin = Math.sin;
-var sqrt = Math.sqrt;
-
-var epsilon = 1e-12;
-var pi = Math.PI;
-var halfPi = pi / 2;
-var tau = 2 * pi;
-
-function acos(x) {
-  return x > 1 ? 0 : x < -1 ? pi : Math.acos(x);
-}
-
-function asin(x) {
-  return x >= 1 ? halfPi : x <= -1 ? -halfPi : Math.asin(x);
-}
-
-function arcInnerRadius(d) {
-  return d.innerRadius;
-}
-
-function arcOuterRadius(d) {
-  return d.outerRadius;
-}
-
-function arcStartAngle(d) {
-  return d.startAngle;
-}
-
-function arcEndAngle(d) {
-  return d.endAngle;
-}
-
-function arcPadAngle(d) {
-  return d && d.padAngle; // Note: optional!
-}
-
-function intersect(x0, y0, x1, y1, x2, y2, x3, y3) {
-  var x10 = x1 - x0, y10 = y1 - y0,
-      x32 = x3 - x2, y32 = y3 - y2,
-      t = y32 * x10 - x32 * y10;
-  if (t * t < epsilon) return;
-  t = (x32 * (y0 - y2) - y32 * (x0 - x2)) / t;
-  return [x0 + t * x10, y0 + t * y10];
-}
-
-// Compute perpendicular offset line of length rc.
-// http://mathworld.wolfram.com/Circle-LineIntersection.html
-function cornerTangents(x0, y0, x1, y1, r1, rc, cw) {
-  var x01 = x0 - x1,
-      y01 = y0 - y1,
-      lo = (cw ? rc : -rc) / sqrt(x01 * x01 + y01 * y01),
-      ox = lo * y01,
-      oy = -lo * x01,
-      x11 = x0 + ox,
-      y11 = y0 + oy,
-      x10 = x1 + ox,
-      y10 = y1 + oy,
-      x00 = (x11 + x10) / 2,
-      y00 = (y11 + y10) / 2,
-      dx = x10 - x11,
-      dy = y10 - y11,
-      d2 = dx * dx + dy * dy,
-      r = r1 - rc,
-      D = x11 * y10 - x10 * y11,
-      d = (dy < 0 ? -1 : 1) * sqrt(max(0, r * r * d2 - D * D)),
-      cx0 = (D * dy - dx * d) / d2,
-      cy0 = (-D * dx - dy * d) / d2,
-      cx1 = (D * dy + dx * d) / d2,
-      cy1 = (-D * dx + dy * d) / d2,
-      dx0 = cx0 - x00,
-      dy0 = cy0 - y00,
-      dx1 = cx1 - x00,
-      dy1 = cy1 - y00;
-
-  // Pick the closer of the two intersection points.
-  // TODO Is there a faster way to determine which intersection to use?
-  if (dx0 * dx0 + dy0 * dy0 > dx1 * dx1 + dy1 * dy1) cx0 = cx1, cy0 = cy1;
-
-  return {
-    cx: cx0,
-    cy: cy0,
-    x01: -ox,
-    y01: -oy,
-    x11: cx0 * (r1 / r - 1),
-    y11: cy0 * (r1 / r - 1)
-  };
-}
-
-function d3Arc() {
-  var innerRadius = arcInnerRadius,
-      outerRadius = arcOuterRadius,
-      cornerRadius = constant(0),
-      padRadius = null,
-      startAngle = arcStartAngle,
-      endAngle = arcEndAngle,
-      padAngle = arcPadAngle,
-      context = null;
-
-  function arc() {
-    var buffer,
-        r,
-        r0 = +innerRadius.apply(this, arguments),
-        r1 = +outerRadius.apply(this, arguments),
-        a0 = startAngle.apply(this, arguments) - halfPi,
-        a1 = endAngle.apply(this, arguments) - halfPi,
-        da = abs(a1 - a0),
-        cw = a1 > a0;
-
-    if (!context) context = buffer = path();
-
-    // Ensure that the outer radius is always larger than the inner radius.
-    if (r1 < r0) r = r1, r1 = r0, r0 = r;
-
-    // Is it a point?
-    if (!(r1 > epsilon)) context.moveTo(0, 0);
-
-    // Or is it a circle or annulus?
-    else if (da > tau - epsilon) {
-      context.moveTo(r1 * cos(a0), r1 * sin(a0));
-      context.arc(0, 0, r1, a0, a1, !cw);
-      if (r0 > epsilon) {
-        context.moveTo(r0 * cos(a1), r0 * sin(a1));
-        context.arc(0, 0, r0, a1, a0, cw);
-      }
-    }
-
-    // Or is it a circular or annular sector?
-    else {
-      var a01 = a0,
-          a11 = a1,
-          a00 = a0,
-          a10 = a1,
-          da0 = da,
-          da1 = da,
-          ap = padAngle.apply(this, arguments) / 2,
-          rp = (ap > epsilon) && (padRadius ? +padRadius.apply(this, arguments) : sqrt(r0 * r0 + r1 * r1)),
-          rc = min(abs(r1 - r0) / 2, +cornerRadius.apply(this, arguments)),
-          rc0 = rc,
-          rc1 = rc,
-          t0,
-          t1;
-
-      // Apply padding? Note that since r1 ≥ r0, da1 ≥ da0.
-      if (rp > epsilon) {
-        var p0 = asin(rp / r0 * sin(ap)),
-            p1 = asin(rp / r1 * sin(ap));
-        if ((da0 -= p0 * 2) > epsilon) p0 *= (cw ? 1 : -1), a00 += p0, a10 -= p0;
-        else da0 = 0, a00 = a10 = (a0 + a1) / 2;
-        if ((da1 -= p1 * 2) > epsilon) p1 *= (cw ? 1 : -1), a01 += p1, a11 -= p1;
-        else da1 = 0, a01 = a11 = (a0 + a1) / 2;
-      }
-
-      var x01 = r1 * cos(a01),
-          y01 = r1 * sin(a01),
-          x10 = r0 * cos(a10),
-          y10 = r0 * sin(a10);
-
-      // Apply rounded corners?
-      if (rc > epsilon) {
-        var x11 = r1 * cos(a11),
-            y11 = r1 * sin(a11),
-            x00 = r0 * cos(a00),
-            y00 = r0 * sin(a00),
-            oc;
-
-        // Restrict the corner radius according to the sector angle.
-        if (da < pi && (oc = intersect(x01, y01, x00, y00, x11, y11, x10, y10))) {
-          var ax = x01 - oc[0],
-              ay = y01 - oc[1],
-              bx = x11 - oc[0],
-              by = y11 - oc[1],
-              kc = 1 / sin(acos((ax * bx + ay * by) / (sqrt(ax * ax + ay * ay) * sqrt(bx * bx + by * by))) / 2),
-              lc = sqrt(oc[0] * oc[0] + oc[1] * oc[1]);
-          rc0 = min(rc, (r0 - lc) / (kc - 1));
-          rc1 = min(rc, (r1 - lc) / (kc + 1));
-        }
-      }
-
-      // Is the sector collapsed to a line?
-      if (!(da1 > epsilon)) context.moveTo(x01, y01);
-
-      // Does the sector’s outer ring have rounded corners?
-      else if (rc1 > epsilon) {
-        t0 = cornerTangents(x00, y00, x01, y01, r1, rc1, cw);
-        t1 = cornerTangents(x11, y11, x10, y10, r1, rc1, cw);
-
-        context.moveTo(t0.cx + t0.x01, t0.cy + t0.y01);
-
-        // Have the corners merged?
-        if (rc1 < rc) context.arc(t0.cx, t0.cy, rc1, atan2(t0.y01, t0.x01), atan2(t1.y01, t1.x01), !cw);
-
-        // Otherwise, draw the two corners and the ring.
-        else {
-          context.arc(t0.cx, t0.cy, rc1, atan2(t0.y01, t0.x01), atan2(t0.y11, t0.x11), !cw);
-          context.arc(0, 0, r1, atan2(t0.cy + t0.y11, t0.cx + t0.x11), atan2(t1.cy + t1.y11, t1.cx + t1.x11), !cw);
-          context.arc(t1.cx, t1.cy, rc1, atan2(t1.y11, t1.x11), atan2(t1.y01, t1.x01), !cw);
-        }
-      }
-
-      // Or is the outer ring just a circular arc?
-      else context.moveTo(x01, y01), context.arc(0, 0, r1, a01, a11, !cw);
-
-      // Is there no inner ring, and it’s a circular sector?
-      // Or perhaps it’s an annular sector collapsed due to padding?
-      if (!(r0 > epsilon) || !(da0 > epsilon)) context.lineTo(x10, y10);
-
-      // Does the sector’s inner ring (or point) have rounded corners?
-      else if (rc0 > epsilon) {
-        t0 = cornerTangents(x10, y10, x11, y11, r0, -rc0, cw);
-        t1 = cornerTangents(x01, y01, x00, y00, r0, -rc0, cw);
-
-        context.lineTo(t0.cx + t0.x01, t0.cy + t0.y01);
-
-        // Have the corners merged?
-        if (rc0 < rc) context.arc(t0.cx, t0.cy, rc0, atan2(t0.y01, t0.x01), atan2(t1.y01, t1.x01), !cw);
-
-        // Otherwise, draw the two corners and the ring.
-        else {
-          context.arc(t0.cx, t0.cy, rc0, atan2(t0.y01, t0.x01), atan2(t0.y11, t0.x11), !cw);
-          context.arc(0, 0, r0, atan2(t0.cy + t0.y11, t0.cx + t0.x11), atan2(t1.cy + t1.y11, t1.cx + t1.x11), cw);
-          context.arc(t1.cx, t1.cy, rc0, atan2(t1.y11, t1.x11), atan2(t1.y01, t1.x01), !cw);
-        }
-      }
-
-      // Or is the inner ring just a circular arc?
-      else context.arc(0, 0, r0, a10, a00, cw);
-    }
-
-    context.closePath();
-
-    if (buffer) return context = null, buffer + "" || null;
-  }
-
-  arc.centroid = function() {
-    var r = (+innerRadius.apply(this, arguments) + +outerRadius.apply(this, arguments)) / 2,
-        a = (+startAngle.apply(this, arguments) + +endAngle.apply(this, arguments)) / 2 - pi / 2;
-    return [cos(a) * r, sin(a) * r];
-  };
-
-  arc.innerRadius = function(_) {
-    return arguments.length ? (innerRadius = typeof _ === "function" ? _ : constant(+_), arc) : innerRadius;
-  };
-
-  arc.outerRadius = function(_) {
-    return arguments.length ? (outerRadius = typeof _ === "function" ? _ : constant(+_), arc) : outerRadius;
-  };
-
-  arc.cornerRadius = function(_) {
-    return arguments.length ? (cornerRadius = typeof _ === "function" ? _ : constant(+_), arc) : cornerRadius;
-  };
-
-  arc.padRadius = function(_) {
-    return arguments.length ? (padRadius = _ == null ? null : typeof _ === "function" ? _ : constant(+_), arc) : padRadius;
-  };
-
-  arc.startAngle = function(_) {
-    return arguments.length ? (startAngle = typeof _ === "function" ? _ : constant(+_), arc) : startAngle;
-  };
-
-  arc.endAngle = function(_) {
-    return arguments.length ? (endAngle = typeof _ === "function" ? _ : constant(+_), arc) : endAngle;
-  };
-
-  arc.padAngle = function(_) {
-    return arguments.length ? (padAngle = typeof _ === "function" ? _ : constant(+_), arc) : padAngle;
-  };
-
-  arc.context = function(_) {
-    return arguments.length ? ((context = _ == null ? null : _), arc) : context;
-  };
-
-  return arc;
-}
-
-var css_248z$1 = ".tree_Sunburst path{stroke:#fff;stroke-width:.5px;fill-rule:evenodd}";
-styleInject(css_248z$1);
-
-var SunburstPartition = /** @class */ (function (_super) {
-    __extends(SunburstPartition, _super);
-    function SunburstPartition() {
-        var _this = _super.call(this) || this;
-        ITree.call(_this);
-        return _this;
-    }
-    SunburstPartition.prototype.data = function (_) {
-        var retVal = SVGWidget.prototype.data.apply(this, arguments);
-        if (arguments.length) {
-            this._resetRoot = true;
-        }
-        return retVal;
-    };
-    SunburstPartition.prototype.enter = function (_domNode, element) {
-        var context = this;
-        this.radius = Math.min(this.width(), this.height()) / 2;
-        this._xScale = scaleLinear()
-            .range([0, 2 * Math.PI]);
-        this._yScale = scaleSqrt()
-            .range([0, this.radius]);
-        this.partition = d3Parition();
-        this.arc = d3Arc()
-            .startAngle(function (d) {
-            return Math.max(0, Math.min(2 * Math.PI, context._xScale(d.x0)));
-        })
-            .endAngle(function (d) {
-            return Math.max(0, Math.min(2 * Math.PI, context._xScale(d.x1)));
-        })
-            .innerRadius(function (d) {
-            return Math.max(0, context._yScale(d.y0));
-        })
-            .outerRadius(function (d) {
-            return Math.max(0, context._yScale(d.y1));
-        });
-        this.svg = element.append("g");
-    };
-    SunburstPartition.prototype.update = function (_domNode, _element) {
-        var context = this;
-        this._palette = this._palette.switch(this.paletteID());
-        if (this.useClonedPalette()) {
-            this._palette = this._palette.cloneNotExists(this.paletteID() + "_" + this.id());
-        }
-        this.radius = Math.min(this.width(), this.height()) / 2;
-        this._yScale.range([0, this.radius]);
-        var root = hierarchy(this.data())
-            .sum(function (d) {
-            return d.size !== undefined ? d.size : 1;
-        });
-        var paths = this.svg.selectAll("path").data(this.partition(root).descendants(), function (d, i) {
-            return d.data.label !== undefined ? d.data.label : i;
-        });
-        paths.enter().append("path")
-            .on("click", function (d) { context.click(d.data, null, null); })
-            .on("dblclick", function (d) {
-            var event = d3Event();
-            if (event) {
-                event.stopPropagation();
-            }
-            context.zoomTo(d);
-        })
-            .each(function () {
-            var element = select(this);
-            element
-                .append("title");
-        })
-            .merge(paths)
-            .attr("d", this.arc)
-            .style("fill", function (d) {
-            return d.data.__viz_fill ? d.data.__viz_fill : context._palette(d.data.label);
-        })
-            .style("stroke", function (d) {
-            return d.value > 16 ? "white" : "none";
-        })
-            .select("title")
-            .text(function (d) {
-            return d.data.label;
-        });
-        paths.exit().remove();
-        if (this._resetRoot) {
-            this._resetRoot = false;
-            this.zoomTo(root);
-        }
-    };
-    SunburstPartition.prototype.zoomTo = function (d) {
-        var context = this;
-        this.svg.transition()
-            .duration(750)
-            .tween("scale", function () {
-            var xd = interpolate(context._xScale.domain(), [d.x0, d.x1]);
-            var yd = interpolate(context._yScale.domain(), [d.y0, 1]);
-            var yr = interpolate(context._yScale.range(), [d.y0 ? 20 : 0, context.radius]);
-            return function (t) { context._xScale.domain(xd(t)); context._yScale.domain(yd(t)).range(yr(t)); };
-        })
-            .selectAll("path")
-            .attrTween("d", function (d2) { return function () { return context.arc(d2); }; });
-    };
-    return SunburstPartition;
-}(SVGWidget));
-SunburstPartition.prototype._class += " tree_SunburstPartition";
-SunburstPartition.prototype.implements(ITree.prototype);
-SunburstPartition.prototype.publish("paletteID", "default", "set", "Color palette for this widget", SunburstPartition.prototype._palette.switch(), { tags: ["Basic", "Shared"] });
-SunburstPartition.prototype.publish("useClonedPalette", false, "boolean", "Enable or disable using a cloned palette", null, { tags: ["Intermediate", "Shared"] });
-
-var css_248z = ".tree_Treemap *{box-sizing:border-box}.tree_Treemap .node{border:1px solid #333;overflow:hidden;position:absolute;text-overflow:ellipsis}.tree_Treemap .node.selected{border-color:red}.tree_Treemap .node.over{border-color:orange}.tree_Treemap .node.selected.over{border-color:red}.tree_Treemap .node>span.treemap-parent-label{display:inline-block;font-weight:700;margin:4px 4px 0}.tree_Treemap .node>span.treemap-parent-value{font-style:italic;font-weight:400;margin:4px 0 0}.tree_Treemap .node>span.treemap-singleton-label{display:block;font-weight:400;margin:4px 0 0 4px}.tree_Treemap .node>span.treemap-singleton-value{display:block;font-style:italic;margin:0 0 0 4px}";
-styleInject(css_248z);
-
-var TreemapColumn = /** @class */ (function (_super) {
-    __extends(TreemapColumn, _super);
-    function TreemapColumn() {
-        return _super.call(this) || this;
-    }
-    TreemapColumn.prototype.owner = function (_) {
-        if (!arguments.length)
-            return this._owner;
-        this._owner = _;
-        return this;
-    };
-    TreemapColumn.prototype.valid = function () {
-        return !!this.column();
-    };
-    return TreemapColumn;
-}(PropertyExt));
-TreemapColumn.prototype._class += " tree_Dendrogram.TreemapColumn";
-TreemapColumn.prototype.publish("column", null, "set", "Field", function () { return this._owner ? this._owner.columns() : []; }, { optional: true });
-// ===
-var Treemap = /** @class */ (function (_super) {
-    __extends(Treemap, _super);
-    function Treemap() {
-        var _this = _super.call(this) || this;
-        ITree.call(_this);
-        Utility.SimpleSelectionMixin.call(_this, true);
-        return _this;
-    }
-    Treemap.prototype.getTilingMethod = function () {
-        switch (this.tilingMethod()) {
-            case "treemapBinary":
-                return d3treemapBinary;
-            case "treemapDice":
-                return d3treemapDice;
-            case "treemapSlice":
-                return d3treemapSlice;
-            case "treemapSliceDice":
-                return d3treemapSliceDice;
-            case "treemapResquarify":
-                return d3treemapResquarify;
-            case "treemapSquarify":
-            default:
-                return d3treemapSquarify;
-        }
-    };
-    Treemap.prototype.treemapData = function () {
-        if (!this.mappings().filter(function (mapping) { return mapping.valid(); }).length) {
-            return this.data();
-        }
-        var view = this._db.aggregateView(this.mappings().map(function (mapping) { return mapping.column(); }), this.aggrType(), this.aggrColumn());
-        var retVal = {
-            key: "root",
-            values: view.entries()
-        };
-        return formatData(retVal);
-        function formatData(node) {
-            if (node.values instanceof Array) {
-                var children = node.values.filter(function (value) {
-                    return !(value instanceof Array);
-                }).map(function (value) {
-                    return formatData(value);
-                });
-                var retVal2 = {
-                    label: node.key
-                };
-                if (children.length) {
-                    retVal2.children = children;
-                }
-                else {
-                    retVal2.size = 22;
-                }
-                return retVal2;
-            }
-            return {
-                label: node.key,
-                size: node.values.aggregate,
-                origRows: node.values
-            };
-        }
-    };
-    Treemap.prototype.enter = function (domNode, element) {
-        _super.prototype.enter.call(this, domNode, element);
-        this._d3Treemap = d3Treemap();
-        this._elementDIV = element.append("div");
-        this._selection.widgetElement(this._elementDIV);
-    };
-    Treemap.prototype.update = function (domNode, element) {
-        _super.prototype.update.call(this, domNode, element);
-        var context = this;
-        this._palette = this._palette.switch(this.paletteID());
-        if (this.useClonedPalette()) {
-            this._palette = this._palette.cloneNotExists(this.paletteID() + "_" + this.id());
-        }
-        var root = hierarchy(this.treemapData())
-            .sum(this.nodeWeight);
-        this._d3Treemap
-            .size([this.width(), this.height()])
-            .paddingInner(this.paddingInner())
-            .paddingOuter(this.paddingOuter())
-            .paddingTop(this.paddingTop());
-        if (["treemapSquarify", "treemapResquarify"].indexOf(this.tilingMethod()) !== -1) {
-            this._d3Treemap.tile(this.getTilingMethod()["ratio"](this.squarifyRatio()));
-        }
-        else {
-            this._d3Treemap.tile(this.getTilingMethod());
-        }
-        this._d3Treemap(root);
-        this._elementDIV
-            .style("font-size", this.fontSize_exists() ? this.fontSize() + "px" : null)
-            .style("line-height", this.fontSize_exists() ? (this.fontSize() + 2) + "px" : null);
-        var node = this._elementDIV.selectAll(".node").data(root.descendants());
-        node.enter().append("div")
-            .attr("class", "node")
-            .call(this._selection.enter.bind(this._selection))
-            .on("click", function (d) {
-            if (d) {
-                var columnLabel_1 = "";
-                context.mappings().forEach(function (mapping) {
-                    if (mapping.column()) {
-                        columnLabel_1 = mapping.column();
-                    }
-                });
-                if (d.origRows) {
-                    context.click(context.rowToObj(d.origRows[0]), columnLabel_1, context._selection.selected(this));
-                }
-                else {
-                    context.click(d.data, columnLabel_1, context._selection.selected(this));
-                }
-            }
-        })
-            .on("dblclick", function (d) {
-            if (d) {
-                var columnLabel_2 = "";
-                context.mappings().forEach(function (mapping) {
-                    if (mapping.column()) {
-                        columnLabel_2 = mapping.column();
-                    }
-                });
-                if (d.origRows) {
-                    context.dblclick(context.rowToObj(d.origRows[0]), columnLabel_2, context._selection.selected(this));
-                }
-                else {
-                    context.dblclick(d.data, columnLabel_2, context._selection.selected(this));
-                }
-            }
-        })
-            .merge(node)
-            .style("left", function (d) { return (d.x0 + Math.max(0, d.x1 - d.x0) / 2) + "px"; })
-            .style("top", function (d) { return (d.y0 + Math.max(0, d.y1 - d.y0) / 2) + "px"; })
-            .style("width", function () { return 0 + "px"; })
-            .style("height", function () { return 0 + "px"; })
-            .style("font-size", function (d) { return (d.children ? context.parentFontSize() : context.leafFontSize()) + "px"; })
-            .style("line-height", function (d) { return (d.children ? context.parentFontSize() : context.leafFontSize()) + "px"; })
-            .attr("title", tooltip)
-            .html(function (d) {
-            if (!context.showRoot() && d.depth === 0) {
-                return null;
-            }
-            if (d.children) {
-                if (context.enableParentLabels()) {
-                    return context.parentWeightHTML(d);
-                }
-                else {
-                    return null;
-                }
-            }
-            else {
-                return context.leafWeightHTML(d);
-            }
-        })
-            .style("background", function (d) {
-            if (!context.showRoot() && d.depth === 0) {
-                this.style.color = "transparent";
-                return "transparent";
-            }
-            var light_dark = context.brighterLeafNodes() ? "brighter" : "darker";
-            var _color;
-            if (context.usePaletteOnParentNodes()) {
-                _color = d.children ? context._palette(d.data.label) : rgb(context._palette(d.parent.data.label))[light_dark](1);
-            }
-            else {
-                if (d.depth > context.depthColorLimit()) {
-                    _color = rgb(d.parent.color)[light_dark](1);
-                }
-                else {
-                    _color = context._palette(d.data.label);
-                }
-                d.color = _color;
-            }
-            this.style.color = Palette.textColor(_color);
-            return _color;
-        })
-            .transition().duration(this.transitionDuration())
-            .style("pointer-events", function (d) { return !context.showRoot() && d.depth === 0 ? "none" : "all"; })
-            .style("opacity", function (d) { return d.children ? 1 : null; })
-            .style("left", function (d) { return d.x0 + "px"; })
-            .style("top", function (d) { return d.y0 + "px"; })
-            .style("width", function (d) { return Math.max(0, d.x1 - d.x0) + "px"; })
-            .style("height", function (d) { return Math.max(0, d.y1 - d.y0) + "px"; })
-            .each(function (d) {
-            if (d.depth === 0) {
-                this.style.color = !context.showRoot() ? "transparent" : "";
-                this.style.borderColor = !context.showRoot() ? "transparent" : "";
-            }
-        });
-        node.exit().transition().duration(this.transitionDuration())
-            .style("opacity", 0)
-            .remove();
-        function tooltip(d) {
-            if (d.children && !context.enableParentTooltips()) {
-                return null;
-            }
-            var retVal = d.data.label + " (" + d.value + ")";
-            while (d.parent && d.parent.parent) {
-                retVal = d.parent.data.label + " -> " + retVal;
-                d = d.parent;
-            }
-            return retVal;
-        }
-    };
-    Treemap.prototype.exit = function (domNode, element) {
-        _super.prototype.exit.call(this, domNode, element);
-    };
-    Treemap.prototype.nodeWeight = function (d) {
-        return d.size || 1;
-    };
-    Treemap.prototype.parentWeightHTML = function (d) {
-        return this.showParentWeight() ? "<span class=\"treemap-parent-label\">".concat(d.data.label, "</span><span class=\"treemap-parent-value\">").concat(d.value).concat(this.weightSuffix(), "</span>") : "<span class=\"treemap-parent-label\">".concat(d.data.label, "</span>");
-    };
-    Treemap.prototype.leafWeightHTML = function (d) {
-        return this.showLeafWeight() ? "<span class=\"treemap-leaf-label\">".concat(d.data.label, "</span><span class=\"treemap-leaf-value\">").concat(d.value).concat(this.weightSuffix(), "</span>") : "<span class=\"treemap-leaf-label\">".concat(d.data.label, "</span>");
-    };
-    return Treemap;
-}(HTMLWidget));
-Treemap.prototype._class += " tree_Treemap";
-Treemap.prototype.implements(ITree.prototype);
-Treemap.prototype.mixin(Utility.SimpleSelectionMixin);
-Treemap.prototype.Column = TreemapColumn;
-Treemap.prototype.publish("paletteID", "default", "set", "Color palette for this widget", Treemap.prototype._palette.switch(), { tags: ["Basic", "Shared"] });
-Treemap.prototype.publish("useClonedPalette", false, "boolean", "Enable or disable using a cloned palette", null, { tags: ["Intermediate", "Shared"] });
-Treemap.prototype.publish("mappings", [], "propertyArray", "Source Columns", null, { autoExpand: TreemapColumn });
-Treemap.prototype.publish("aggrType", null, "set", "Aggregation Type", [null, "mean", "median", "sum", "min", "max"], { optional: true });
-Treemap.prototype.publish("aggrColumn", null, "set", "Aggregation Field", function () { return this.columns(); }, { optional: true, disable: function (w) { return !w.aggrType(); } });
-Treemap.prototype.publish("fontSize", null, "number", "Font Size", null, { optional: true });
-Treemap.prototype.publish("paddingInner", 18.6, "number", "Pixel spacing between each sibling node");
-Treemap.prototype.publish("paddingOuter", 30, "number", "Pixel padding of parent nodes");
-Treemap.prototype.publish("paddingTop", 41.4, "number", "Additional top pixel padding of parent nodes");
-Treemap.prototype.publish("showRoot", false, "boolean", "Show root element");
-Treemap.prototype.publish("parentFontSize", 18, "number", "Parent font-size");
-Treemap.prototype.publish("leafFontSize", 16, "number", "Leaf font-size");
-Treemap.prototype.publish("usePaletteOnParentNodes", false, "boolean", "Assign a color from the palette to every parent node");
-Treemap.prototype.publish("depthColorLimit", 1, "number", "Assign a color from the palette to node with depth lower than this value", null, { optional: true, disable: function (w) { return w.usePaletteOnParentNodes(); } });
-Treemap.prototype.publish("squarifyRatio", 1, "number", "Specifies the desired aspect ratio of the generated rectangles (must be >= 1)", null, { optional: true, disable: function (w) { return ["treemapSquarify", "treemapResquarify"].indexOf(w.tilingMethod()) === -1; } });
-Treemap.prototype.publish("showParentWeight", true, "boolean", "Show weight of parent nodes");
-Treemap.prototype.publish("showLeafWeight", true, "boolean", "Show weight of leaf nodes");
-Treemap.prototype.publish("weightSuffix", "", "string", "Weight suffix (ex: 'ms')");
-Treemap.prototype.publish("brighterLeafNodes", false, "boolean", "Brighter/darker leaf node color (false = darker)");
-Treemap.prototype.publish("enableParentLabels", true, "boolean", "Enable parent labels");
-Treemap.prototype.publish("enableParentTooltips", true, "boolean", "Enable parent tooltips");
-Treemap.prototype.publish("transitionDuration", 250, "number", "Transition Duration");
-Treemap.prototype.publish("tilingMethod", "treemapSquarify", "set", "Transition Duration", ["treemapBinary", "treemapDice", "treemapResquarify", "treemapSlice", "treemapSliceDice", "treemapSquarify"]);
-
-export { BUILD_VERSION, CirclePacking, Dendrogram, DendrogramColumn, DirectoryTree, Indented, IndentedColumn, PKG_NAME, PKG_VERSION, SunburstPartition, Treemap, TreemapColumn };
-//# sourceMappingURL=index.es6.js.map