@kong-ui-public/dashboard-renderer 5.5.0 → 5.6.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -321,7 +321,7 @@ class Ci {
321
321
  }
322
322
  }
323
323
  K = new WeakMap();
324
- var ge, me, re, Ce, pe, Re, Y, ye, B, Te, X, ve, ie, De, Me, T, St, kt, Nt, At, Ht, ze, Fe, Ue, Se, Ot, ke;
324
+ var ge, me, re, Ce, pe, Re, Y, ye, $, Te, X, ve, ie, De, Me, T, St, kt, Nt, At, Ht, ze, Fe, Ue, Se, Ot, ke;
325
325
  class Ri extends wi {
326
326
  // TODO: The `throwOnTimeout` option should affect the return types of `add()` and `addAll()`
327
327
  constructor(t) {
@@ -336,7 +336,7 @@ class Ri extends wi {
336
336
  M(this, Re, 0);
337
337
  M(this, Y);
338
338
  M(this, ye);
339
- M(this, B);
339
+ M(this, $);
340
340
  M(this, Te);
341
341
  M(this, X, 0);
342
342
  // The `!` is needed because of https://github.com/microsoft/TypeScript/issues/32194
@@ -363,7 +363,7 @@ class Ri extends wi {
363
363
  throw new TypeError(`Expected \`intervalCap\` to be a number from 1 and up, got \`${((i = t.intervalCap) == null ? void 0 : i.toString()) ?? ""}\` (${typeof t.intervalCap})`);
364
364
  if (t.interval === void 0 || !(Number.isFinite(t.interval) && t.interval >= 0))
365
365
  throw new TypeError(`Expected \`interval\` to be a finite number >= 0, got \`${((s = t.interval) == null ? void 0 : s.toString()) ?? ""}\` (${typeof t.interval})`);
366
- A(this, ge, t.carryoverConcurrencyCount), A(this, me, t.intervalCap === Number.POSITIVE_INFINITY || t.interval === 0), A(this, Ce, t.intervalCap), A(this, pe, t.interval), A(this, B, new t.queueClass()), A(this, Te, t.queueClass), this.concurrency = t.concurrency, this.timeout = t.timeout, A(this, De, t.throwOnTimeout === !0), A(this, ie, t.autoStart === !1);
366
+ A(this, ge, t.carryoverConcurrencyCount), A(this, me, t.intervalCap === Number.POSITIVE_INFINITY || t.interval === 0), A(this, Ce, t.intervalCap), A(this, pe, t.interval), A(this, $, new t.queueClass()), A(this, Te, t.queueClass), this.concurrency = t.concurrency, this.timeout = t.timeout, A(this, De, t.throwOnTimeout === !0), A(this, ie, t.autoStart === !1);
367
367
  }
368
368
  get concurrency() {
369
369
  return v(this, ve);
@@ -410,7 +410,7 @@ class Ri extends wi {
410
410
  Here, the promise function with `id: '🦀'` executes last.
411
411
  */
412
412
  setPriority(t, i) {
413
- v(this, B).setPriority(t, i);
413
+ v(this, $).setPriority(t, i);
414
414
  }
415
415
  async add(t, i = {}) {
416
416
  return i.id ?? (i.id = (be(this, Me)._++).toString()), i = {
@@ -418,7 +418,7 @@ class Ri extends wi {
418
418
  throwOnTimeout: v(this, De),
419
419
  ...i
420
420
  }, new Promise((s, r) => {
421
- v(this, B).enqueue(async () => {
421
+ v(this, $).enqueue(async () => {
422
422
  var o;
423
423
  be(this, X)._++, be(this, re)._++;
424
424
  try {
@@ -458,7 +458,7 @@ class Ri extends wi {
458
458
  Clear the queue.
459
459
  */
460
460
  clear() {
461
- A(this, B, new (v(this, Te))());
461
+ A(this, $, new (v(this, Te))());
462
462
  }
463
463
  /**
464
464
  Can be called multiple times. Useful if you for example add additional items at a later time.
@@ -466,7 +466,7 @@ class Ri extends wi {
466
466
  @returns A promise that settles when the queue becomes empty.
467
467
  */
468
468
  async onEmpty() {
469
- v(this, B).size !== 0 && await I(this, T, ke).call(this, "empty");
469
+ v(this, $).size !== 0 && await I(this, T, ke).call(this, "empty");
470
470
  }
471
471
  /**
472
472
  @returns A promise that settles when the queue size is less than the given limit: `queue.size < limit`.
@@ -476,7 +476,7 @@ class Ri extends wi {
476
476
  Note that this only limits the number of items waiting to start. There could still be up to `concurrency` jobs already running that this call does not include in its calculation.
477
477
  */
478
478
  async onSizeLessThan(t) {
479
- v(this, B).size < t || await I(this, T, ke).call(this, "next", () => v(this, B).size < t);
479
+ v(this, $).size < t || await I(this, T, ke).call(this, "next", () => v(this, $).size < t);
480
480
  }
481
481
  /**
482
482
  The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.
@@ -484,13 +484,13 @@ class Ri extends wi {
484
484
  @returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.
485
485
  */
486
486
  async onIdle() {
487
- v(this, X) === 0 && v(this, B).size === 0 || await I(this, T, ke).call(this, "idle");
487
+ v(this, X) === 0 && v(this, $).size === 0 || await I(this, T, ke).call(this, "idle");
488
488
  }
489
489
  /**
490
490
  Size of the queue, the number of queued items waiting to run.
491
491
  */
492
492
  get size() {
493
- return v(this, B).size;
493
+ return v(this, $).size;
494
494
  }
495
495
  /**
496
496
  Size of the queue, filtered by the given options.
@@ -498,7 +498,7 @@ class Ri extends wi {
498
498
  For example, this can be used to find the number of items remaining in the queue with a specific priority level.
499
499
  */
500
500
  sizeBy(t) {
501
- return v(this, B).filter(t).length;
501
+ return v(this, $).filter(t).length;
502
502
  }
503
503
  /**
504
504
  Number of running items (no longer in the queue).
@@ -513,7 +513,7 @@ class Ri extends wi {
513
513
  return v(this, ie);
514
514
  }
515
515
  }
516
- ge = new WeakMap(), me = new WeakMap(), re = new WeakMap(), Ce = new WeakMap(), pe = new WeakMap(), Re = new WeakMap(), Y = new WeakMap(), ye = new WeakMap(), B = new WeakMap(), Te = new WeakMap(), X = new WeakMap(), ve = new WeakMap(), ie = new WeakMap(), De = new WeakMap(), Me = new WeakMap(), T = new WeakSet(), St = function() {
516
+ ge = new WeakMap(), me = new WeakMap(), re = new WeakMap(), Ce = new WeakMap(), pe = new WeakMap(), Re = new WeakMap(), Y = new WeakMap(), ye = new WeakMap(), $ = new WeakMap(), Te = new WeakMap(), X = new WeakMap(), ve = new WeakMap(), ie = new WeakMap(), De = new WeakMap(), Me = new WeakMap(), T = new WeakSet(), St = function() {
517
517
  return v(this, me) || v(this, re) < v(this, Ce);
518
518
  }, kt = function() {
519
519
  return v(this, X) < v(this, ve);
@@ -534,12 +534,12 @@ ge = new WeakMap(), me = new WeakMap(), re = new WeakMap(), Ce = new WeakMap(),
534
534
  }
535
535
  return !1;
536
536
  }, ze = function() {
537
- if (v(this, B).size === 0)
537
+ if (v(this, $).size === 0)
538
538
  return v(this, Y) && clearInterval(v(this, Y)), A(this, Y, void 0), this.emit("empty"), v(this, X) === 0 && this.emit("idle"), !1;
539
539
  if (!v(this, ie)) {
540
540
  const t = !v(this, T, Ht);
541
541
  if (v(this, T, St) && v(this, T, kt)) {
542
- const i = v(this, B).dequeue();
542
+ const i = v(this, $).dequeue();
543
543
  return i ? (this.emit("active"), i(), t && I(this, T, Fe).call(this), !0) : !1;
544
544
  }
545
545
  }
@@ -627,7 +627,7 @@ const Ti = () => {
627
627
  ...t.context.timeSpec,
628
628
  tz: t.context.tz
629
629
  };
630
- const $ = {
630
+ const q = {
631
631
  datasource: D,
632
632
  query: {
633
633
  ...x,
@@ -635,7 +635,7 @@ const Ti = () => {
635
635
  filters: N
636
636
  }
637
637
  };
638
- return r == null ? void 0 : r.queryFn($, n);
638
+ return r == null ? void 0 : r.queryFn(q, n);
639
639
  } catch (D) {
640
640
  p.value = ((k = (E = D == null ? void 0 : D.response) == null ? void 0 : E.data) == null ? void 0 : k.message) === "Range not allowed for this tier" ? s.t("queryDataProvider.timeRangeExceeded") : ((H = (R = D == null ? void 0 : D.response) == null ? void 0 : R.data) == null ? void 0 : H.message) || (D == null ? void 0 : D.message);
641
641
  } finally {
@@ -1043,7 +1043,7 @@ const Ti = () => {
1043
1043
  s("edit-tile", i.definition);
1044
1044
  }, S = () => {
1045
1045
  s("duplicate-tile", i.definition);
1046
- }, $ = () => {
1046
+ }, q = () => {
1047
1047
  s("remove-tile", i.definition);
1048
1048
  }, oe = (w) => {
1049
1049
  h.value = w;
@@ -1132,7 +1132,7 @@ const Ti = () => {
1132
1132
  w.context.editable ? (C(), O(de, {
1133
1133
  key: 3,
1134
1134
  "data-testid": `remove-tile-${w.tileId}`,
1135
- onClick: $
1135
+ onClick: q
1136
1136
  }, {
1137
1137
  default: P(() => [
1138
1138
  ce(J(z(o).t("renderer.remove")), 1)
@@ -2762,7 +2762,7 @@ class ji {
2762
2762
  * Copyright (c) 2021-2024 Alain Dumesny
2763
2763
  * see root license https://github.com/gridstack/gridstack.js/tree/master/LICENSE
2764
2764
  */
2765
- const q = new ji();
2765
+ const B = new ji();
2766
2766
  class _ {
2767
2767
  /**
2768
2768
  * initializing the HTML element, or selector string, into a grid will return the grid. Calling it again will
@@ -3645,7 +3645,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3645
3645
  */
3646
3646
  /** get the global (but static to this code) DD implementation */
3647
3647
  static getDD() {
3648
- return q;
3648
+ return B;
3649
3649
  }
3650
3650
  /**
3651
3651
  * call to setup dragging in from the outside (say toolbar), by specifying the class selection and options.
@@ -3658,7 +3658,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3658
3658
  */
3659
3659
  static setupDragIn(e, t, i, s = document) {
3660
3660
  (t == null ? void 0 : t.pause) !== void 0 && (b.pauseDrag = t.pause), t = { appendTo: "body", helper: "clone", ...t || {} }, (typeof e == "string" ? c.getElements(e, s) : e).forEach((o, n) => {
3661
- q.isDraggable(o) || q.dragIn(o, t), i != null && i[n] && (o.gridstackNode = i[n]);
3661
+ B.isDraggable(o) || B.dragIn(o, t), i != null && i[n] && (o.gridstackNode = i[n]);
3662
3662
  });
3663
3663
  }
3664
3664
  /**
@@ -3737,12 +3737,12 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3737
3737
  }
3738
3738
  /** @internal removes any drag&drop present (called during destroy) */
3739
3739
  _removeDD(e) {
3740
- return q.draggable(e, "destroy").resizable(e, "destroy"), e.gridstackNode && delete e.gridstackNode._initDD, delete e.ddElement, this;
3740
+ return B.draggable(e, "destroy").resizable(e, "destroy"), e.gridstackNode && delete e.gridstackNode._initDD, delete e.ddElement, this;
3741
3741
  }
3742
3742
  /** @internal called to add drag over to support widgets being added externally */
3743
3743
  _setupAcceptWidget() {
3744
3744
  if (this.opts.staticGrid || !this.opts.acceptWidgets && !this.opts.removable)
3745
- return q.droppable(this.el, "destroy"), this;
3745
+ return B.droppable(this.el, "destroy"), this;
3746
3746
  let e, t;
3747
3747
  const i = (s, r, o) => {
3748
3748
  var f;
@@ -3767,7 +3767,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3767
3767
  if (n._temporaryRemoved) {
3768
3768
  if (n.x = Math.max(0, Math.round(h / t)), n.y = Math.max(0, Math.round(d / e)), delete n.autoPosition, this.engine.nodeBoundFix(n), !this.engine.willItFit(n)) {
3769
3769
  if (n.autoPosition = !0, !this.engine.willItFit(n)) {
3770
- q.off(r, "drag");
3770
+ B.off(r, "drag");
3771
3771
  return;
3772
3772
  }
3773
3773
  n._willFitPos && (c.copyPos(n, n._willFitPos), delete n._willFitPos);
@@ -3776,7 +3776,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3776
3776
  } else
3777
3777
  this._dragOrResize(o, s, l, n, t, e);
3778
3778
  };
3779
- return q.droppable(this.el, {
3779
+ return B.droppable(this.el, {
3780
3780
  accept: (s) => {
3781
3781
  const r = s.gridstackNode || this._readAttr(s, !1);
3782
3782
  if ((r == null ? void 0 : r.grid) === this)
@@ -3815,7 +3815,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3815
3815
  n.grid || (n.el || (n = { ...n }), n._isExternal = !0, o.gridstackNode = n);
3816
3816
  const d = n.w || Math.round(o.offsetWidth / t) || 1, h = n.h || Math.round(o.offsetHeight / e) || 1;
3817
3817
  return n.grid && n.grid !== this ? (r._gridstackNodeOrig || (r._gridstackNodeOrig = n), r.gridstackNode = n = { ...n, w: d, h, grid: this }, delete n.x, delete n.y, this.engine.cleanupNode(n).nodeBoundFix(n), n._initDD = n._isExternal = // DOM needs to be re-parented on a drop
3818
- n._temporaryRemoved = !0) : (n.w = d, n.h = h, n._temporaryRemoved = !0), _._itemRemoving(n.el, !1), q.on(r, "drag", i), i(s, r, o), !1;
3818
+ n._temporaryRemoved = !0) : (n.w = d, n.h = h, n._temporaryRemoved = !0), _._itemRemoving(n.el, !1), B.on(r, "drag", i), i(s, r, o), !1;
3819
3819
  }).on(this.el, "dropout", (s, r, o) => {
3820
3820
  const n = (o == null ? void 0 : o.gridstackNode) || r.gridstackNode;
3821
3821
  return n && (!n.grid || n.grid === this) && (this._leave(r, o), this._isTemp && this.removeAsSubGrid(n)), !1;
@@ -3833,7 +3833,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3833
3833
  const m = l.grid;
3834
3834
  m.engine.removeNodeFromLayoutCache(l), m.engine.removedNodes.push(l), m._triggerRemoveEvent()._triggerChangeEvent(), m.parentGridNode && !m.engine.nodes.length && m.opts.subGridDynamic && m.removeAsSubGrid();
3835
3835
  }
3836
- if (!n || (d && (this.engine.cleanupNode(n), n.grid = this), (g = n.grid) == null || delete g._isTemp, q.off(r, "drag"), o !== r ? (o.remove(), r = o) : r.remove(), this._removeDD(r), !d))
3836
+ if (!n || (d && (this.engine.cleanupNode(n), n.grid = this), (g = n.grid) == null || delete g._isTemp, B.off(r, "drag"), o !== r ? (o.remove(), r = o) : r.remove(), this._removeDD(r), !d))
3837
3837
  return !1;
3838
3838
  const f = (y = (p = n.subGrid) == null ? void 0 : p.el) == null ? void 0 : y.gridstack;
3839
3839
  return c.copyPos(n, this._readAttr(this.placeholder)), c.removePositioningStyles(r), h && (n.content || n.subGridOpts || _.addRemoveCB) ? (delete n.el, r = this.addWidget(n)) : (this._prepareElement(r, !0, n), this.el.appendChild(r), this.resizeToContentCheck(!1, n), f && (f.parentGridNode = n, f.opts.styleInHead || f._updateStyles(!0)), this._updateContainerHeight()), this.engine.addedNodes.push(n), this._triggerAddEvent(), this._triggerChangeEvent(), this.engine.endUpdate(), this._gsEventHandler.dropped && this._gsEventHandler.dropped({ ...s, type: "dropped" }, l && l.grid ? l : void 0, n), a && this.setAnimation(this.opts.animate, !0), !1;
@@ -3851,7 +3851,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3851
3851
  if (typeof this.opts.removable != "string")
3852
3852
  return this;
3853
3853
  const e = document.querySelector(this.opts.removable);
3854
- return e ? (!this.opts.staticGrid && !q.isDroppable(e) && q.droppable(e, this.opts.removableOptions).on(e, "dropover", (t, i) => _._itemRemoving(i, !0)).on(e, "dropout", (t, i) => _._itemRemoving(i, !1)), this) : this;
3854
+ return e ? (!this.opts.staticGrid && !B.isDroppable(e) && B.droppable(e, this.opts.removableOptions).on(e, "dropover", (t, i) => _._itemRemoving(i, !0)).on(e, "dropout", (t, i) => _._itemRemoving(i, !1)), this) : this;
3855
3855
  }
3856
3856
  /** @internal prepares the element for drag&drop */
3857
3857
  _prepareDragDropByNode(e) {
@@ -3876,7 +3876,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3876
3876
  this._extraDragRow = 0, this._updateContainerHeight(), this._triggerChangeEvent(), this.engine.endUpdate(), a.type === "resizestop" && (Number.isInteger(e.sizeToContent) && (e.sizeToContent = e.h), this.resizeToContentCheck(l, e));
3877
3877
  }
3878
3878
  };
3879
- q.draggable(t, {
3879
+ B.draggable(t, {
3880
3880
  start: n,
3881
3881
  stop: h,
3882
3882
  drag: d
@@ -3886,7 +3886,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3886
3886
  resize: d
3887
3887
  }), e._initDD = !0;
3888
3888
  }
3889
- return q.draggable(t, i ? "disable" : "enable").resizable(t, s ? "disable" : "enable"), this;
3889
+ return B.draggable(t, i ? "disable" : "enable").resizable(t, s ? "disable" : "enable"), this;
3890
3890
  }
3891
3891
  /** @internal handles actual drag/resize start */
3892
3892
  _onStartMoving(e, t, i, s, r, o) {
@@ -3905,7 +3905,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3905
3905
  };
3906
3906
  if (s.el = this.placeholder, s._lastUiPosition = i.position, s._prevYPix = i.position.top, s._moving = t.type === "dragstart", delete s._lastTried, t.type === "dropover" && s._temporaryRemoved && (this.engine.addNode(s), s._moving = !0), this.engine.cacheRects(r, o, this.opts.marginTop, this.opts.marginRight, this.opts.marginBottom, this.opts.marginLeft), t.type === "resizestart") {
3907
3907
  const d = this.getColumn() - s.x, h = (this.opts.maxRow || Number.MAX_SAFE_INTEGER) - s.y;
3908
- q.resizable(e, "option", "minWidth", r * Math.min(s.minW || 1, d)).resizable(e, "option", "minHeight", o * Math.min(s.minH || 1, h)).resizable(e, "option", "maxWidth", r * Math.min(s.maxW || Number.MAX_SAFE_INTEGER, d)).resizable(e, "option", "maxWidthMoveLeft", r * Math.min(s.maxW || Number.MAX_SAFE_INTEGER, s.x + s.w)).resizable(e, "option", "maxHeight", o * Math.min(s.maxH || Number.MAX_SAFE_INTEGER, h)).resizable(e, "option", "maxHeightMoveUp", o * Math.min(s.maxH || Number.MAX_SAFE_INTEGER, s.y + s.h));
3908
+ B.resizable(e, "option", "minWidth", r * Math.min(s.minW || 1, d)).resizable(e, "option", "minHeight", o * Math.min(s.minH || 1, h)).resizable(e, "option", "maxWidth", r * Math.min(s.maxW || Number.MAX_SAFE_INTEGER, d)).resizable(e, "option", "maxWidthMoveLeft", r * Math.min(s.maxW || Number.MAX_SAFE_INTEGER, s.x + s.w)).resizable(e, "option", "maxHeight", o * Math.min(s.maxH || Number.MAX_SAFE_INTEGER, h)).resizable(e, "option", "maxHeightMoveUp", o * Math.min(s.maxH || Number.MAX_SAFE_INTEGER, s.y + s.h));
3909
3909
  }
3910
3910
  }
3911
3911
  /** @internal handles actual drag/resize */
@@ -3955,7 +3955,7 @@ Note: ".grid-stack" is required for proper CSS styling and drag/drop, and is the
3955
3955
  _leave(e, t) {
3956
3956
  t = t || e;
3957
3957
  const i = t.gridstackNode;
3958
- i && (t.style.transform = t.style.transformOrigin = null, q.off(e, "drag"), !i._temporaryRemoved && (i._temporaryRemoved = !0, this.engine.removeNode(i), i.el = i._isExternal && t ? t : e, i._isExternal && this.engine.cleanupNode(i), this.opts.removable === !0 && _._itemRemoving(e, !0), e._gridstackNodeOrig ? (e.gridstackNode = e._gridstackNodeOrig, delete e._gridstackNodeOrig) : i._isExternal && this.engine.restoreInitial()));
3958
+ i && (t.style.transform = t.style.transformOrigin = null, B.off(e, "drag"), !i._temporaryRemoved && (i._temporaryRemoved = !0, this.engine.removeNode(i), i.el = i._isExternal && t ? t : e, i._isExternal && this.engine.cleanupNode(i), this.opts.removable === !0 && _._itemRemoving(e, !0), e._gridstackNodeOrig ? (e.gridstackNode = e._gridstackNodeOrig, delete e._gridstackNodeOrig) : i._isExternal && this.engine.restoreInitial()));
3959
3959
  }
3960
3960
  // legacy method removed
3961
3961
  commit() {
@@ -4078,7 +4078,7 @@ const Qi = ["data-id", "data-testid", "gs-h", "gs-w", "gs-x", "gs-y"], Zi = { cl
4078
4078
  var S;
4079
4079
  let N = x.definition;
4080
4080
  if ("description" in N.chart) {
4081
- const $ = (S = N.chart.description) == null ? void 0 : S.replace(mi, () => {
4081
+ const q = (S = N.chart.description) == null ? void 0 : S.replace(mi, () => {
4082
4082
  const we = `renderer.trendRange.${l.value.type === "absolute" ? "custom" : l.value.time_range}`;
4083
4083
  return o.te(we) ? o.t(we) : "";
4084
4084
  });
@@ -4086,7 +4086,7 @@ const Qi = ["data-id", "data-testid", "gs-h", "gs-w", "gs-x", "gs-y"], Zi = { cl
4086
4086
  ...N,
4087
4087
  chart: {
4088
4088
  ...N.chart,
4089
- description: $
4089
+ description: q
4090
4090
  }
4091
4091
  };
4092
4092
  }
@@ -4102,8 +4102,9 @@ const Qi = ["data-id", "data-testid", "gs-h", "gs-w", "gs-x", "gs-y"], Zi = { cl
4102
4102
  };
4103
4103
  })), y = L(() => {
4104
4104
  let { tz: x, refreshInterval: N, editable: S } = i.context;
4105
+ const q = [...i.context.filters ?? [], ...r.value.global_filters ?? []];
4105
4106
  return x || (x = new Intl.DateTimeFormat().resolvedOptions().timeZone), N === void 0 && (N = pi), S === void 0 && (S = !1), {
4106
- ...i.context,
4107
+ filters: q,
4107
4108
  tz: x,
4108
4109
  timeSpec: l.value,
4109
4110
  refreshInterval: N,
@@ -4153,21 +4154,21 @@ const Qi = ["data-id", "data-testid", "gs-h", "gs-w", "gs-x", "gs-y"], Zi = { cl
4153
4154
  tiles: p.value,
4154
4155
  onUpdateTiles: D
4155
4156
  }, {
4156
- tile: P(({ tile: $ }) => [
4157
- $.meta.chart.type === "slottable" ? (C(), U("div", is, [
4158
- Ie(x.$slots, $.meta.chart.id, {}, void 0, !0)
4157
+ tile: P(({ tile: q }) => [
4158
+ q.meta.chart.type === "slottable" ? (C(), U("div", is, [
4159
+ Ie(x.$slots, q.meta.chart.id, {}, void 0, !0)
4159
4160
  ])) : (C(), O(Ui, {
4160
4161
  key: 1,
4161
4162
  class: "tile-container",
4162
4163
  context: y.value,
4163
- definition: $.meta,
4164
- height: $.layout.size.rows * (r.value.tileHeight || z(Pe)) + parseInt(z(Lt), 10),
4164
+ definition: q.meta,
4165
+ height: q.layout.size.rows * (r.value.tileHeight || z(Pe)) + parseInt(z(Lt), 10),
4165
4166
  "query-ready": f.value,
4166
4167
  "refresh-counter": n.value,
4167
- "tile-id": $.id,
4168
- onDuplicateTile: (oe) => k($),
4169
- onEditTile: (oe) => m($),
4170
- onRemoveTile: (oe) => R($),
4168
+ "tile-id": q.id,
4169
+ onDuplicateTile: (oe) => k(q),
4170
+ onEditTile: (oe) => m(q),
4171
+ onRemoveTile: (oe) => R(q),
4171
4172
  onZoomTimeRange: N[0] || (N[0] = (oe) => s("zoom-time-range", oe))
4172
4173
  }, null, 8, ["context", "definition", "height", "query-ready", "refresh-counter", "tile-id", "onDuplicateTile", "onEditTile", "onRemoveTile"]))
4173
4174
  ]),
@@ -4184,7 +4185,7 @@ const Qi = ["data-id", "data-testid", "gs-h", "gs-w", "gs-x", "gs-y"], Zi = { cl
4184
4185
  ]);
4185
4186
  };
4186
4187
  }
4187
- }), gs = /* @__PURE__ */ he(ss, [["__scopeId", "data-v-02dbc3a2"]]);
4188
+ }), gs = /* @__PURE__ */ he(ss, [["__scopeId", "data-v-0bb82daa"]]);
4188
4189
  export {
4189
4190
  gi as CP_ID_TOKEN,
4190
4191
  Tt as DASHBOARD_COLS,