kdutify 0.16.9-rc.0 → 2.6.1

package/es5/components/KCalendar/modes/common.js

@@ -0,0 +1,169 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getVisuals = _getVisuals;
+exports.hasOverlap = hasOverlap;
+exports.setColumnCount = setColumnCount;
+exports.getRange = getRange;
+exports.getDayRange = getDayRange;
+exports.getNormalizedRange = getNormalizedRange;
+exports.getOpenGroup = getOpenGroup;
+exports.getOverlapGroupHandler = getOverlapGroupHandler;
+
+var _timestamp = require("../util/timestamp");
+
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+function _iterableToArrayLimit(arr, i) { if (typeof Symbol === "undefined" || !(Symbol.iterator in Object(arr))) return; var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+
+var MILLIS_IN_DAY = 86400000;
+
+function _getVisuals(events) {
+  var minStart = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  var visuals = events.map(function (event) {
+    return {
+      event: event,
+      columnCount: 0,
+      column: 0,
+      left: 0,
+      width: 100
+    };
+  });
+  visuals.sort(function (a, b) {
+    return Math.max(minStart, a.event.startTimestampIdentifier) - Math.max(minStart, b.event.startTimestampIdentifier) || b.event.endTimestampIdentifier - a.event.endTimestampIdentifier;
+  });
+  return visuals;
+}
+
+function hasOverlap(s0, e0, s1, e1) {
+  var exclude = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;
+  return exclude ? !(s0 >= e1 || e0 <= s1) : !(s0 > e1 || e0 < s1);
+}
+
+function setColumnCount(groups) {
+  groups.forEach(function (group) {
+    group.visuals.forEach(function (groupVisual) {
+      groupVisual.columnCount = groups.length;
+    });
+  });
+}
+
+function getRange(event) {
+  return [event.startTimestampIdentifier, event.endTimestampIdentifier];
+}
+
+function getDayRange(event) {
+  return [event.startIdentifier, event.endIdentifier];
+}
+
+function getNormalizedRange(event, dayStart) {
+  return [Math.max(dayStart, event.startTimestampIdentifier), Math.min(dayStart + MILLIS_IN_DAY, event.endTimestampIdentifier)];
+}
+
+function getOpenGroup(groups, start, end, timed) {
+  for (var i = 0; i < groups.length; i++) {
+    var group = groups[i];
+    var intersected = false;
+
+    if (hasOverlap(start, end, group.start, group.end, timed)) {
+      for (var k = 0; k < group.visuals.length; k++) {
+        var groupVisual = group.visuals[k];
+
+        var _ref = timed ? getRange(groupVisual.event) : getDayRange(groupVisual.event),
+            _ref2 = _slicedToArray(_ref, 2),
+            groupStart = _ref2[0],
+            groupEnd = _ref2[1];
+
+        if (hasOverlap(start, end, groupStart, groupEnd, timed)) {
+          intersected = true;
+          break;
+        }
+      }
+    }
+
+    if (!intersected) {
+      return i;
+    }
+  }
+
+  return -1;
+}
+
+function getOverlapGroupHandler(firstWeekday) {
+  var handler = {
+    groups: [],
+    min: -1,
+    max: -1,
+    reset: function reset() {
+      handler.groups = [];
+      handler.min = handler.max = -1;
+    },
+    getVisuals: function getVisuals(day, dayEvents, timed) {
+      var reset = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
+
+      if (day.weekday === firstWeekday || reset) {
+        handler.reset();
+      }
+
+      var dayStart = (0, _timestamp.getTimestampIdentifier)(day);
+
+      var visuals = _getVisuals(dayEvents, dayStart);
+
+      visuals.forEach(function (visual) {
+        var _ref3 = timed ? getRange(visual.event) : getDayRange(visual.event),
+            _ref4 = _slicedToArray(_ref3, 2),
+            start = _ref4[0],
+            end = _ref4[1];
+
+        if (handler.groups.length > 0 && !hasOverlap(start, end, handler.min, handler.max, timed)) {
+          setColumnCount(handler.groups);
+          handler.reset();
+        }
+
+        var targetGroup = getOpenGroup(handler.groups, start, end, timed);
+
+        if (targetGroup === -1) {
+          targetGroup = handler.groups.length;
+          handler.groups.push({
+            start: start,
+            end: end,
+            visuals: []
+          });
+        }
+
+        var target = handler.groups[targetGroup];
+        target.visuals.push(visual);
+        target.start = Math.min(target.start, start);
+        target.end = Math.max(target.end, end);
+        visual.column = targetGroup;
+
+        if (handler.min === -1) {
+          handler.min = start;
+          handler.max = end;
+        } else {
+          handler.min = Math.min(handler.min, start);
+          handler.max = Math.max(handler.max, end);
+        }
+      });
+      setColumnCount(handler.groups);
+
+      if (timed) {
+        handler.reset();
+      }
+
+      return visuals;
+    }
+  };
+  return handler;
+}
+//# sourceMappingURL=common.js.map

package/es5/components/KCalendar/modes/common.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../src/components/KCalendar/modes/common.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AACA;;;;;;;;;;;;;;AAEA,IAAM,aAAa,GAAG,QAAtB;;AAIM,SAAU,WAAV,CAAsB,MAAtB,EAAiE;AAAA,MAAZ,QAAY,uEAAD,CAAC;AACrE,MAAM,OAAO,GAAG,MAAM,CAAC,GAAP,CAAW,UAAA,KAAK;AAAA,WAAK;AACnC,MAAA,KAAK,EAAL,KADmC;AAEnC,MAAA,WAAW,EAAE,CAFsB;AAGnC,MAAA,MAAM,EAAE,CAH2B;AAInC,MAAA,IAAI,EAAE,CAJ6B;AAKnC,MAAA,KAAK,EAAE;AAL4B,KAAL;AAAA,GAAhB,CAAhB;AAQA,EAAA,OAAO,CAAC,IAAR,CAAa,UAAC,CAAD,EAAI,CAAJ,EAAS;AACpB,WAAQ,IAAI,CAAC,GAAL,CAAS,QAAT,EAAmB,CAAC,CAAC,KAAF,CAAQ,wBAA3B,IAAuD,IAAI,CAAC,GAAL,CAAS,QAAT,EAAmB,CAAC,CAAC,KAAF,CAAQ,wBAA3B,CAAxD,IACC,CAAC,CAAC,KAAF,CAAQ,sBAAR,GAAiC,CAAC,CAAC,KAAF,CAAQ,sBADjD;AAED,GAHD;AAKA,SAAO,OAAP;AACD;;AAQK,SAAU,UAAV,CAAsB,EAAtB,EAAkC,EAAlC,EAA8C,EAA9C,EAA0D,EAA1D,EAAoF;AAAA,MAAd,OAAc,uEAAJ,IAAI;AACxF,SAAO,OAAO,GAAG,EAAE,EAAE,IAAI,EAAN,IAAY,EAAE,IAAI,EAApB,CAAH,GAA6B,EAAE,EAAE,GAAG,EAAL,IAAW,EAAE,GAAG,EAAlB,CAA3C;AACD;;AAEK,SAAU,cAAV,CAA0B,MAA1B,EAA+C;AACnD,EAAA,MAAM,CAAC,OAAP,CAAe,UAAA,KAAK,EAAG;AACrB,IAAA,KAAK,CAAC,OAAN,CAAc,OAAd,CAAsB,UAAA,WAAW,EAAG;AAClC,MAAA,WAAW,CAAC,WAAZ,GAA0B,MAAM,CAAC,MAAjC;AACD,KAFD;AAGD,GAJD;AAKD;;AAEK,SAAU,QAAV,CAAoB,KAApB,EAA8C;AAClD,SAAO,CAAC,KAAK,CAAC,wBAAP,EAAiC,KAAK,CAAC,sBAAvC,CAAP;AACD;;AAEK,SAAU,WAAV,CAAuB,KAAvB,EAAiD;AACrD,SAAO,CAAC,KAAK,CAAC,eAAP,EAAwB,KAAK,CAAC,aAA9B,CAAP;AACD;;AAEK,SAAU,kBAAV,CAA8B,KAA9B,EAA0D,QAA1D,EAA0E;AAC9E,SAAO,CAAC,IAAI,CAAC,GAAL,CAAS,QAAT,EAAmB,KAAK,CAAC,wBAAzB,CAAD,EAAqD,IAAI,CAAC,GAAL,CAAS,QAAQ,GAAG,aAApB,EAAmC,KAAK,CAAC,sBAAzC,CAArD,CAAP;AACD;;AAEK,SAAU,YAAV,CAAwB,MAAxB,EAA+C,KAA/C,EAA8D,GAA9D,EAA2E,KAA3E,EAAyF;AAC7F,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,MAAM,CAAC,MAA3B,EAAmC,CAAC,EAApC,EAAwC;AACtC,QAAM,KAAK,GAAG,MAAM,CAAC,CAAD,CAApB;AACA,QAAI,WAAW,GAAG,KAAlB;;AAEA,QAAI,UAAU,CAAC,KAAD,EAAQ,GAAR,EAAa,KAAK,CAAC,KAAnB,EAA0B,KAAK,CAAC,GAAhC,EAAqC,KAArC,CAAd,EAA2D;AACzD,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAAK,CAAC,OAAN,CAAc,MAAlC,EAA0C,CAAC,EAA3C,EAA+C;AAC7C,YAAM,WAAW,GAAG,KAAK,CAAC,OAAN,CAAc,CAAd,CAApB;;AAD6C,mBAEd,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,KAAb,CAAX,GAAiC,WAAW,CAAC,WAAW,CAAC,KAAb,CAFnC;AAAA;AAAA,YAEtC,UAFsC;AAAA,YAE1B,QAF0B;;AAI7C,YAAI,UAAU,CAAC,KAAD,EAAQ,GAAR,EAAa,UAAb,EAAyB,QAAzB,EAAmC,KAAnC,CAAd,EAAyD;AACvD,UAAA,WAAW,GAAG,IAAd;AACA;AACD;AACF;AACF;;AAED,QAAI,CAAC,WAAL,EAAkB;AAChB,aAAO,CAAP;AACD;AACF;;AAED,SAAO,CAAC,CAAR;AACD;;AAEK,SAAU,sBAAV,CAAkC,YAAlC,EAAsD;AAC1D,MAAM,OAAO,GAAG;AACd,IAAA,MAAM,EAAE,EADM;AAEd,IAAA,GAAG,EAAE,CAAC,CAFQ;AAGd,IAAA,GAAG,EAAE,CAAC,CAHQ;AAId,IAAA,KAAK,EAAE,iBAAK;AACV,MAAA,OAAO,CAAC,MAAR,GAAiB,EAAjB;AACA,MAAA,OAAO,CAAC,GAAR,GAAc,OAAO,CAAC,GAAR,GAAc,CAAC,CAA7B;AACD,KAPa;AAQd,IAAA,UAAU,EAAE,oBAAC,GAAD,EAAyB,SAAzB,EAA2D,KAA3D,EAA4F;AAAA,UAAjB,KAAiB,uEAAT,KAAS;;AACtG,UAAI,GAAG,CAAC,OAAJ,KAAgB,YAAhB,IAAgC,KAApC,EAA2C;AACzC,QAAA,OAAO,CAAC,KAAR;AACD;;AAED,UAAM,QAAQ,GAAG,uCAAuB,GAAvB,CAAjB;;AACA,UAAM,OAAO,GAAG,WAAU,CAAC,SAAD,EAAY,QAAZ,CAA1B;;AAEA,MAAA,OAAO,CAAC,OAAR,CAAgB,UAAA,MAAM,EAAG;AAAA,oBACF,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAR,CAAX,GAA4B,WAAW,CAAC,MAAM,CAAC,KAAR,CAD1C;AAAA;AAAA,YAChB,KADgB;AAAA,YACT,GADS;;AAGvB,YAAI,OAAO,CAAC,MAAR,CAAe,MAAf,GAAwB,CAAxB,IAA6B,CAAC,UAAU,CAAC,KAAD,EAAQ,GAAR,EAAa,OAAO,CAAC,GAArB,EAA0B,OAAO,CAAC,GAAlC,EAAuC,KAAvC,CAA5C,EAA2F;AACzF,UAAA,cAAc,CAAC,OAAO,CAAC,MAAT,CAAd;AACA,UAAA,OAAO,CAAC,KAAR;AACD;;AAED,YAAI,WAAW,GAAG,YAAY,CAAC,OAAO,CAAC,MAAT,EAAiB,KAAjB,EAAwB,GAAxB,EAA6B,KAA7B,CAA9B;;AAEA,YAAI,WAAW,KAAK,CAAC,CAArB,EAAwB;AACtB,UAAA,WAAW,GAAG,OAAO,CAAC,MAAR,CAAe,MAA7B;AAEA,UAAA,OAAO,CAAC,MAAR,CAAe,IAAf,CAAoB;AAAE,YAAA,KAAK,EAAL,KAAF;AAAS,YAAA,GAAG,EAAH,GAAT;AAAc,YAAA,OAAO,EAAE;AAAvB,WAApB;AACD;;AAED,YAAM,MAAM,GAAG,OAAO,CAAC,MAAR,CAAe,WAAf,CAAf;AACA,QAAA,MAAM,CAAC,OAAP,CAAe,IAAf,CAAoB,MAApB;AACA,QAAA,MAAM,CAAC,KAAP,GAAe,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,KAAhB,EAAuB,KAAvB,CAAf;AACA,QAAA,MAAM,CAAC,GAAP,GAAa,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,GAAhB,EAAqB,GAArB,CAAb;AAEA,QAAA,MAAM,CAAC,MAAP,GAAgB,WAAhB;;AAEA,YAAI,OAAO,CAAC,GAAR,KAAgB,CAAC,CAArB,EAAwB;AACtB,UAAA,OAAO,CAAC,GAAR,GAAc,KAAd;AACA,UAAA,OAAO,CAAC,GAAR,GAAc,GAAd;AACD,SAHD,MAGO;AACL,UAAA,OAAO,CAAC,GAAR,GAAc,IAAI,CAAC,GAAL,CAAS,OAAO,CAAC,GAAjB,EAAsB,KAAtB,CAAd;AACA,UAAA,OAAO,CAAC,GAAR,GAAc,IAAI,CAAC,GAAL,CAAS,OAAO,CAAC,GAAjB,EAAsB,GAAtB,CAAd;AACD;AACF,OA9BD;AAgCA,MAAA,cAAc,CAAC,OAAO,CAAC,MAAT,CAAd;;AAEA,UAAI,KAAJ,EAAW;AACT,QAAA,OAAO,CAAC,KAAR;AACD;;AAED,aAAO,OAAP;AACD;AAvDa,GAAhB;AA0DA,SAAO,OAAP;AACD","sourcesContent":["import { CalendarEventParsed, CalendarEventVisual, CalendarTimestamp } from 'kdutify/types'\nimport { getTimestampIdentifier } from '../util/timestamp'\n\nconst MILLIS_IN_DAY = 86400000\n\nexport type GetRange = (event: CalendarEventParsed) => [number, number]\n\nexport function getVisuals (events: CalendarEventParsed[], minStart = 0): CalendarEventVisual[] {\n  const visuals = events.map(event => ({\n    event,\n    columnCount: 0,\n    column: 0,\n    left: 0,\n    width: 100,\n  }))\n\n  visuals.sort((a, b) => {\n    return (Math.max(minStart, a.event.startTimestampIdentifier) - Math.max(minStart, b.event.startTimestampIdentifier)) ||\n           (b.event.endTimestampIdentifier - a.event.endTimestampIdentifier)\n  })\n\n  return visuals\n}\n\nexport interface ColumnGroup {\n  start: number\n  end: number\n  visuals: CalendarEventVisual[]\n}\n\nexport function hasOverlap (s0: number, e0: number, s1: number, e1: number, exclude = true): boolean {\n  return exclude ? !(s0 >= e1 || e0 <= s1) : !(s0 > e1 || e0 < s1)\n}\n\nexport function setColumnCount (groups: ColumnGroup[]) {\n  groups.forEach(group => {\n    group.visuals.forEach(groupVisual => {\n      groupVisual.columnCount = groups.length\n    })\n  })\n}\n\nexport function getRange (event: CalendarEventParsed): [number, number] {\n  return [event.startTimestampIdentifier, event.endTimestampIdentifier]\n}\n\nexport function getDayRange (event: CalendarEventParsed): [number, number] {\n  return [event.startIdentifier, event.endIdentifier]\n}\n\nexport function getNormalizedRange (event: CalendarEventParsed, dayStart: number): [number, number] {\n  return [Math.max(dayStart, event.startTimestampIdentifier), Math.min(dayStart + MILLIS_IN_DAY, event.endTimestampIdentifier)]\n}\n\nexport function getOpenGroup (groups: ColumnGroup[], start: number, end: number, timed: boolean) {\n  for (let i = 0; i < groups.length; i++) {\n    const group = groups[i]\n    let intersected = false\n\n    if (hasOverlap(start, end, group.start, group.end, timed)) {\n      for (let k = 0; k < group.visuals.length; k++) {\n        const groupVisual = group.visuals[k]\n        const [groupStart, groupEnd] = timed ? getRange(groupVisual.event) : getDayRange(groupVisual.event)\n\n        if (hasOverlap(start, end, groupStart, groupEnd, timed)) {\n          intersected = true\n          break\n        }\n      }\n    }\n\n    if (!intersected) {\n      return i\n    }\n  }\n\n  return -1\n}\n\nexport function getOverlapGroupHandler (firstWeekday: number) {\n  const handler = {\n    groups: [] as ColumnGroup[],\n    min: -1,\n    max: -1,\n    reset: () => {\n      handler.groups = []\n      handler.min = handler.max = -1\n    },\n    getVisuals: (day: CalendarTimestamp, dayEvents: CalendarEventParsed[], timed: boolean, reset = false) => {\n      if (day.weekday === firstWeekday || reset) {\n        handler.reset()\n      }\n\n      const dayStart = getTimestampIdentifier(day)\n      const visuals = getVisuals(dayEvents, dayStart)\n\n      visuals.forEach(visual => {\n        const [start, end] = timed ? getRange(visual.event) : getDayRange(visual.event)\n\n        if (handler.groups.length > 0 && !hasOverlap(start, end, handler.min, handler.max, timed)) {\n          setColumnCount(handler.groups)\n          handler.reset()\n        }\n\n        let targetGroup = getOpenGroup(handler.groups, start, end, timed)\n\n        if (targetGroup === -1) {\n          targetGroup = handler.groups.length\n\n          handler.groups.push({ start, end, visuals: [] })\n        }\n\n        const target = handler.groups[targetGroup]\n        target.visuals.push(visual)\n        target.start = Math.min(target.start, start)\n        target.end = Math.max(target.end, end)\n\n        visual.column = targetGroup\n\n        if (handler.min === -1) {\n          handler.min = start\n          handler.max = end\n        } else {\n          handler.min = Math.min(handler.min, start)\n          handler.max = Math.max(handler.max, end)\n        }\n      })\n\n      setColumnCount(handler.groups)\n\n      if (timed) {\n        handler.reset()\n      }\n\n      return visuals\n    },\n  }\n\n  return handler\n}\n"],"sourceRoot":"","file":"common.js"}

package/es5/components/KCalendar/modes/index.js

@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.CalendarEventOverlapModes = void 0;
+
+var _stack = require("./stack");
+
+var _column = require("./column");
+
+var CalendarEventOverlapModes = {
+  stack: _stack.stack,
+  column: _column.column
+};
+exports.CalendarEventOverlapModes = CalendarEventOverlapModes;
+//# sourceMappingURL=index.js.map

package/es5/components/KCalendar/modes/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../src/components/KCalendar/modes/index.ts"],"names":[],"mappings":";;;;;;;AACA;;AACA;;AAEO,IAAM,yBAAyB,GAA6C;AACjF,EAAA,KAAK,EAAL,YADiF;AAEjF,EAAA,MAAM,EAAN;AAFiF,CAA5E","sourcesContent":["import { CalendarEventOverlapMode } from 'kdutify/types'\nimport { stack } from './stack'\nimport { column } from './column'\n\nexport const CalendarEventOverlapModes: Record<string, CalendarEventOverlapMode> = {\n  stack,\n  column,\n}\n"],"sourceRoot":"","file":"index.js"}

package/es5/components/KCalendar/modes/stack.js

@@ -0,0 +1,403 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stack = void 0;
+
+var _common = require("./common");
+
+var _timestamp = require("../util/timestamp");
+
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+
+function _iterableToArrayLimit(arr, i) { if (typeof Symbol === "undefined" || !(Symbol.iterator in Object(arr))) return; var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; }
+
+function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+
+function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e2) { throw _e2; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e3) { didErr = true; err = _e3; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+var FULL_WIDTH = 100;
+var DEFAULT_OFFSET = 5;
+var WIDTH_MULTIPLIER = 1.7;
+/**
+ * Variation of column mode where events can be stacked. The priority of this
+ * mode is to stack events together taking up the least amount of space while
+ * trying to ensure the content of the event is always visible as well as its
+ * start and end. A sibling column has intersecting event content and must be
+ * placed beside each other. Non-sibling columns are offset by 5% from the
+ * previous column. The width is scaled by 1.7 so the events overlap and
+ * whitespace is reduced. If there is a hole in columns the event width is
+ * scaled up so it intersects with the next column. The columns have equal
+ * width in the space they are given. If the event doesn't have any to the
+ * right of it that intersect with it's content it's right side is extended
+ * to the right side.
+ */
+
+var stack = function stack(events, firstWeekday, overlapThreshold) {
+  var handler = (0, _common.getOverlapGroupHandler)(firstWeekday); // eslint-disable-next-line max-statements
+
+  return function (day, dayEvents, timed, reset) {
+    if (!timed) {
+      return handler.getVisuals(day, dayEvents, timed, reset);
+    }
+
+    var dayStart = (0, _timestamp.getTimestampIdentifier)(day);
+    var visuals = (0, _common.getVisuals)(dayEvents, dayStart);
+    var groups = getGroups(visuals, dayStart);
+
+    var _iterator = _createForOfIteratorHelper(groups),
+        _step;
+
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var group = _step.value;
+        var nodes = [];
+
+        var _iterator2 = _createForOfIteratorHelper(group.visuals),
+            _step2;
+
+        try {
+          for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+            var visual = _step2.value;
+            var child = getNode(visual, dayStart);
+            var index = getNextIndex(child, nodes);
+
+            if (index === false) {
+              var parent = getParent(child, nodes);
+
+              if (parent) {
+                child.parent = parent;
+                child.sibling = (0, _common.hasOverlap)(child.start, child.end, parent.start, addTime(parent.start, overlapThreshold));
+                child.index = parent.index + 1;
+                parent.children.push(child);
+              }
+            } else {
+              var _getOverlappingRange = getOverlappingRange(child, nodes, index - 1, index - 1),
+                  _getOverlappingRange2 = _slicedToArray(_getOverlappingRange, 1),
+                  _parent = _getOverlappingRange2[0];
+
+              var children = getOverlappingRange(child, nodes, index + 1, index + nodes.length, true);
+              child.children = children;
+              child.index = index;
+
+              if (_parent) {
+                child.parent = _parent;
+                child.sibling = (0, _common.hasOverlap)(child.start, child.end, _parent.start, addTime(_parent.start, overlapThreshold));
+
+                _parent.children.push(child);
+              }
+
+              var _iterator3 = _createForOfIteratorHelper(children),
+                  _step3;
+
+              try {
+                for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+                  var grand = _step3.value;
+
+                  if (grand.parent === _parent) {
+                    grand.parent = child;
+                  }
+
+                  var grandNext = grand.index - child.index <= 1;
+
+                  if (grandNext && child.sibling && (0, _common.hasOverlap)(child.start, addTime(child.start, overlapThreshold), grand.start, grand.end)) {
+                    grand.sibling = true;
+                  }
+                }
+              } catch (err) {
+                _iterator3.e(err);
+              } finally {
+                _iterator3.f();
+              }
+            }
+
+            nodes.push(child);
+          }
+        } catch (err) {
+          _iterator2.e(err);
+        } finally {
+          _iterator2.f();
+        }
+
+        calculateBounds(nodes, overlapThreshold);
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+
+    visuals.sort(function (a, b) {
+      return a.left - b.left || a.event.startTimestampIdentifier - b.event.startTimestampIdentifier;
+    });
+    return visuals;
+  };
+};
+
+exports.stack = stack;
+
+function calculateBounds(nodes, overlapThreshold) {
+  var _iterator4 = _createForOfIteratorHelper(nodes),
+      _step4;
+
+  try {
+    for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
+      var node = _step4.value;
+      var visual = node.visual,
+          parent = node.parent;
+      var columns = getMaxChildIndex(node) + 1;
+      var spaceLeft = parent ? parent.visual.left : 0;
+      var spaceWidth = FULL_WIDTH - spaceLeft;
+      var offset = Math.min(DEFAULT_OFFSET, FULL_WIDTH / columns);
+      var columnWidthMultiplier = getColumnWidthMultiplier(node, nodes);
+      var columnOffset = spaceWidth / (columns - node.index + 1);
+      var columnWidth = spaceWidth / (columns - node.index + (node.sibling ? 1 : 0)) * columnWidthMultiplier;
+
+      if (parent) {
+        visual.left = node.sibling ? spaceLeft + columnOffset : spaceLeft + offset;
+      }
+
+      visual.width = hasFullWidth(node, nodes, overlapThreshold) ? FULL_WIDTH - visual.left : Math.min(FULL_WIDTH - visual.left, columnWidth * WIDTH_MULTIPLIER);
+    }
+  } catch (err) {
+    _iterator4.e(err);
+  } finally {
+    _iterator4.f();
+  }
+}
+
+function getColumnWidthMultiplier(node, nodes) {
+  if (!node.children.length) {
+    return 1;
+  }
+
+  var maxColumn = node.index + nodes.length;
+  var minColumn = node.children.reduce(function (min, c) {
+    return Math.min(min, c.index);
+  }, maxColumn);
+  return minColumn - node.index;
+}
+
+function getOverlappingIndices(node, nodes) {
+  var indices = [];
+
+  var _iterator5 = _createForOfIteratorHelper(nodes),
+      _step5;
+
+  try {
+    for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
+      var other = _step5.value;
+
+      if ((0, _common.hasOverlap)(node.start, node.end, other.start, other.end)) {
+        indices.push(other.index);
+      }
+    }
+  } catch (err) {
+    _iterator5.e(err);
+  } finally {
+    _iterator5.f();
+  }
+
+  return indices;
+}
+
+function getNextIndex(node, nodes) {
+  var indices = getOverlappingIndices(node, nodes);
+  indices.sort();
+
+  for (var i = 0; i < indices.length; i++) {
+    if (i < indices[i]) {
+      return i;
+    }
+  }
+
+  return false;
+}
+
+function getOverlappingRange(node, nodes, indexMin, indexMax) {
+  var returnFirstColumn = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : false;
+  var overlapping = [];
+
+  var _iterator6 = _createForOfIteratorHelper(nodes),
+      _step6;
+
+  try {
+    for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
+      var other = _step6.value;
+
+      if (other.index >= indexMin && other.index <= indexMax && (0, _common.hasOverlap)(node.start, node.end, other.start, other.end)) {
+        overlapping.push(other);
+      }
+    }
+  } catch (err) {
+    _iterator6.e(err);
+  } finally {
+    _iterator6.f();
+  }
+
+  if (returnFirstColumn && overlapping.length > 0) {
+    var first = overlapping.reduce(function (min, n) {
+      return Math.min(min, n.index);
+    }, overlapping[0].index);
+    return overlapping.filter(function (n) {
+      return n.index === first;
+    });
+  }
+
+  return overlapping;
+}
+
+function getParent(node, nodes) {
+  var parent = null;
+
+  var _iterator7 = _createForOfIteratorHelper(nodes),
+      _step7;
+
+  try {
+    for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
+      var other = _step7.value;
+
+      if ((0, _common.hasOverlap)(node.start, node.end, other.start, other.end) && (parent === null || other.index > parent.index)) {
+        parent = other;
+      }
+    }
+  } catch (err) {
+    _iterator7.e(err);
+  } finally {
+    _iterator7.f();
+  }
+
+  return parent;
+}
+
+function hasFullWidth(node, nodes, overlapThreshold) {
+  var _iterator8 = _createForOfIteratorHelper(nodes),
+      _step8;
+
+  try {
+    for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
+      var other = _step8.value;
+
+      if (other !== node && other.index > node.index && (0, _common.hasOverlap)(node.start, addTime(node.start, overlapThreshold), other.start, other.end)) {
+        return false;
+      }
+    }
+  } catch (err) {
+    _iterator8.e(err);
+  } finally {
+    _iterator8.f();
+  }
+
+  return true;
+}
+
+function getGroups(visuals, dayStart) {
+  var groups = [];
+
+  var _iterator9 = _createForOfIteratorHelper(visuals),
+      _step9;
+
+  try {
+    for (_iterator9.s(); !(_step9 = _iterator9.n()).done;) {
+      var visual = _step9.value;
+
+      var _getNormalizedRange = (0, _common.getNormalizedRange)(visual.event, dayStart),
+          _getNormalizedRange2 = _slicedToArray(_getNormalizedRange, 2),
+          start = _getNormalizedRange2[0],
+          end = _getNormalizedRange2[1];
+
+      var added = false;
+
+      var _iterator10 = _createForOfIteratorHelper(groups),
+          _step10;
+
+      try {
+        for (_iterator10.s(); !(_step10 = _iterator10.n()).done;) {
+          var group = _step10.value;
+
+          if ((0, _common.hasOverlap)(start, end, group.start, group.end)) {
+            group.visuals.push(visual);
+            group.end = Math.max(group.end, end);
+            added = true;
+            break;
+          }
+        }
+      } catch (err) {
+        _iterator10.e(err);
+      } finally {
+        _iterator10.f();
+      }
+
+      if (!added) {
+        groups.push({
+          start: start,
+          end: end,
+          visuals: [visual]
+        });
+      }
+    }
+  } catch (err) {
+    _iterator9.e(err);
+  } finally {
+    _iterator9.f();
+  }
+
+  return groups;
+}
+
+function getNode(visual, dayStart) {
+  var _getNormalizedRange3 = (0, _common.getNormalizedRange)(visual.event, dayStart),
+      _getNormalizedRange4 = _slicedToArray(_getNormalizedRange3, 2),
+      start = _getNormalizedRange4[0],
+      end = _getNormalizedRange4[1];
+
+  return {
+    parent: null,
+    sibling: true,
+    index: 0,
+    visual: visual,
+    start: start,
+    end: end,
+    children: []
+  };
+}
+
+function getMaxChildIndex(node) {
+  var max = node.index;
+
+  var _iterator11 = _createForOfIteratorHelper(node.children),
+      _step11;
+
+  try {
+    for (_iterator11.s(); !(_step11 = _iterator11.n()).done;) {
+      var child = _step11.value;
+      var childMax = getMaxChildIndex(child);
+
+      if (childMax > max) {
+        max = childMax;
+      }
+    }
+  } catch (err) {
+    _iterator11.e(err);
+  } finally {
+    _iterator11.f();
+  }
+
+  return max;
+}
+
+function addTime(identifier, minutes) {
+  var removeMinutes = identifier % 100;
+  var totalMinutes = removeMinutes + minutes;
+  var addHours = Math.floor(totalMinutes / 60);
+  var addMinutes = totalMinutes % 60;
+  return identifier - removeMinutes + addHours * 100 + addMinutes;
+}
+//# sourceMappingURL=stack.js.map

package/es5/components/KCalendar/modes/stack.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../src/components/KCalendar/modes/stack.ts"],"names":[],"mappings":";;;;;;;AACA;;AACA;;;;;;;;;;;;;;;;AAkBA,IAAM,UAAU,GAAG,GAAnB;AAEA,IAAM,cAAc,GAAG,CAAvB;AAEA,IAAM,gBAAgB,GAAG,GAAzB;AAEA;;;;;;;;;;;;AAYG;;AAEI,IAAM,KAAK,GAA6B,SAAlC,KAAkC,CAAC,MAAD,EAAS,YAAT,EAAuB,gBAAvB,EAA2C;AACxF,MAAM,OAAO,GAAG,oCAAuB,YAAvB,CAAhB,CADwF,CAGxF;;AACA,SAAO,UAAC,GAAD,EAAM,SAAN,EAAiB,KAAjB,EAAwB,KAAxB,EAAiC;AACtC,QAAI,CAAC,KAAL,EAAY;AACV,aAAO,OAAO,CAAC,UAAR,CAAmB,GAAnB,EAAwB,SAAxB,EAAmC,KAAnC,EAA0C,KAA1C,CAAP;AACD;;AAED,QAAM,QAAQ,GAAG,uCAAuB,GAAvB,CAAjB;AACA,QAAM,OAAO,GAAG,wBAAW,SAAX,EAAsB,QAAtB,CAAhB;AACA,QAAM,MAAM,GAAG,SAAS,CAAC,OAAD,EAAU,QAAV,CAAxB;;AAPsC,+CASlB,MATkB;AAAA;;AAAA;AAStC,0DAA4B;AAAA,YAAjB,KAAiB;AAC1B,YAAM,KAAK,GAAW,EAAtB;;AAD0B,oDAGL,KAAK,CAAC,OAHD;AAAA;;AAAA;AAG1B,iEAAoC;AAAA,gBAAzB,MAAyB;AAClC,gBAAM,KAAK,GAAG,OAAO,CAAC,MAAD,EAAS,QAAT,CAArB;AACA,gBAAM,KAAK,GAAG,YAAY,CAAC,KAAD,EAAQ,KAAR,CAA1B;;AAEA,gBAAI,KAAK,KAAK,KAAd,EAAqB;AACnB,kBAAM,MAAM,GAAG,SAAS,CAAC,KAAD,EAAQ,KAAR,CAAxB;;AACA,kBAAI,MAAJ,EAAY;AACV,gBAAA,KAAK,CAAC,MAAN,GAAe,MAAf;AACA,gBAAA,KAAK,CAAC,OAAN,GAAgB,wBAAW,KAAK,CAAC,KAAjB,EAAwB,KAAK,CAAC,GAA9B,EAAmC,MAAM,CAAC,KAA1C,EAAiD,OAAO,CAAC,MAAM,CAAC,KAAR,EAAe,gBAAf,CAAxD,CAAhB;AACA,gBAAA,KAAK,CAAC,KAAN,GAAc,MAAM,CAAC,KAAP,GAAe,CAA7B;AACA,gBAAA,MAAM,CAAC,QAAP,CAAgB,IAAhB,CAAqB,KAArB;AACD;AACF,aARD,MAQO;AAAA,yCACY,mBAAmB,CAAC,KAAD,EAAQ,KAAR,EAAe,KAAK,GAAG,CAAvB,EAA0B,KAAK,GAAG,CAAlC,CAD/B;AAAA;AAAA,kBACE,OADF;;AAEL,kBAAM,QAAQ,GAAG,mBAAmB,CAAC,KAAD,EAAQ,KAAR,EAAe,KAAK,GAAG,CAAvB,EAA0B,KAAK,GAAG,KAAK,CAAC,MAAxC,EAAgD,IAAhD,CAApC;AAEA,cAAA,KAAK,CAAC,QAAN,GAAiB,QAAjB;AACA,cAAA,KAAK,CAAC,KAAN,GAAc,KAAd;;AAEA,kBAAI,OAAJ,EAAY;AACV,gBAAA,KAAK,CAAC,MAAN,GAAe,OAAf;AACA,gBAAA,KAAK,CAAC,OAAN,GAAgB,wBAAW,KAAK,CAAC,KAAjB,EAAwB,KAAK,CAAC,GAA9B,EAAmC,OAAM,CAAC,KAA1C,EAAiD,OAAO,CAAC,OAAM,CAAC,KAAR,EAAe,gBAAf,CAAxD,CAAhB;;AACA,gBAAA,OAAM,CAAC,QAAP,CAAgB,IAAhB,CAAqB,KAArB;AACD;;AAXI,0DAae,QAbf;AAAA;;AAAA;AAaL,uEAA8B;AAAA,sBAAnB,KAAmB;;AAC5B,sBAAI,KAAK,CAAC,MAAN,KAAiB,OAArB,EAA6B;AAC3B,oBAAA,KAAK,CAAC,MAAN,GAAe,KAAf;AACD;;AAED,sBAAM,SAAS,GAAG,KAAK,CAAC,KAAN,GAAc,KAAK,CAAC,KAApB,IAA6B,CAA/C;;AACA,sBAAI,SAAS,IAAI,KAAK,CAAC,OAAnB,IACF,wBAAW,KAAK,CAAC,KAAjB,EAAwB,OAAO,CAAC,KAAK,CAAC,KAAP,EAAc,gBAAd,CAA/B,EAAgE,KAAK,CAAC,KAAtE,EAA6E,KAAK,CAAC,GAAnF,CADF,EAC2F;AACzF,oBAAA,KAAK,CAAC,OAAN,GAAgB,IAAhB;AACD;AACF;AAvBI;AAAA;AAAA;AAAA;AAAA;AAwBN;;AAED,YAAA,KAAK,CAAC,IAAN,CAAW,KAAX;AACD;AA1CyB;AAAA;AAAA;AAAA;AAAA;;AA4C1B,QAAA,eAAe,CAAC,KAAD,EAAQ,gBAAR,CAAf;AACD;AAtDqC;AAAA;AAAA;AAAA;AAAA;;AAwDtC,IAAA,OAAO,CAAC,IAAR,CAAa,UAAC,CAAD,EAAI,CAAJ;AAAA,aAAW,CAAC,CAAC,IAAF,GAAS,CAAC,CAAC,IAAZ,IAAsB,CAAC,CAAC,KAAF,CAAQ,wBAAR,GAAmC,CAAC,CAAC,KAAF,CAAQ,wBAA3E;AAAA,KAAb;AAEA,WAAO,OAAP;AACD,GA3DD;AA4DD,CAhEM;;;;AAkEP,SAAS,eAAT,CAA0B,KAA1B,EAAyC,gBAAzC,EAAiE;AAAA,8CAC5C,KAD4C;AAAA;;AAAA;AAC/D,2DAA0B;AAAA,UAAf,IAAe;AAAA,UAChB,MADgB,GACG,IADH,CAChB,MADgB;AAAA,UACR,MADQ,GACG,IADH,CACR,MADQ;AAExB,UAAM,OAAO,GAAG,gBAAgB,CAAC,IAAD,CAAhB,GAAyB,CAAzC;AACA,UAAM,SAAS,GAAG,MAAM,GAAG,MAAM,CAAC,MAAP,CAAc,IAAjB,GAAwB,CAAhD;AACA,UAAM,UAAU,GAAG,UAAU,GAAG,SAAhC;AACA,UAAM,MAAM,GAAG,IAAI,CAAC,GAAL,CAAS,cAAT,EAAyB,UAAU,GAAG,OAAtC,CAAf;AACA,UAAM,qBAAqB,GAAG,wBAAwB,CAAC,IAAD,EAAO,KAAP,CAAtD;AACA,UAAM,YAAY,GAAG,UAAU,IAAI,OAAO,GAAG,IAAI,CAAC,KAAf,GAAuB,CAA3B,CAA/B;AACA,UAAM,WAAW,GAAG,UAAU,IAAI,OAAO,GAAG,IAAI,CAAC,KAAf,IAAwB,IAAI,CAAC,OAAL,GAAe,CAAf,GAAmB,CAA3C,CAAJ,CAAV,GAA+D,qBAAnF;;AAEA,UAAI,MAAJ,EAAY;AACV,QAAA,MAAM,CAAC,IAAP,GAAc,IAAI,CAAC,OAAL,GACV,SAAS,GAAG,YADF,GAEV,SAAS,GAAG,MAFhB;AAGD;;AAED,MAAA,MAAM,CAAC,KAAP,GAAe,YAAY,CAAC,IAAD,EAAO,KAAP,EAAc,gBAAd,CAAZ,GACX,UAAU,GAAG,MAAM,CAAC,IADT,GAEX,IAAI,CAAC,GAAL,CAAS,UAAU,GAAG,MAAM,CAAC,IAA7B,EAAmC,WAAW,GAAG,gBAAjD,CAFJ;AAGD;AApB8D;AAAA;AAAA;AAAA;AAAA;AAqBhE;;AAED,SAAS,wBAAT,CAAmC,IAAnC,EAA+C,KAA/C,EAA4D;AAC1D,MAAI,CAAC,IAAI,CAAC,QAAL,CAAc,MAAnB,EAA2B;AACzB,WAAO,CAAP;AACD;;AAED,MAAM,SAAS,GAAG,IAAI,CAAC,KAAL,GAAa,KAAK,CAAC,MAArC;AACA,MAAM,SAAS,GAAG,IAAI,CAAC,QAAL,CAAc,MAAd,CAAqB,UAAC,GAAD,EAAM,CAAN;AAAA,WAAY,IAAI,CAAC,GAAL,CAAS,GAAT,EAAc,CAAC,CAAC,KAAhB,CAAZ;AAAA,GAArB,EAAyD,SAAzD,CAAlB;AAEA,SAAO,SAAS,GAAG,IAAI,CAAC,KAAxB;AACD;;AAED,SAAS,qBAAT,CAAgC,IAAhC,EAA4C,KAA5C,EAAyD;AACvD,MAAM,OAAO,GAAa,EAA1B;;AADuD,8CAEnC,KAFmC;AAAA;;AAAA;AAEvD,2DAA2B;AAAA,UAAhB,KAAgB;;AACzB,UAAI,wBAAW,IAAI,CAAC,KAAhB,EAAuB,IAAI,CAAC,GAA5B,EAAiC,KAAK,CAAC,KAAvC,EAA8C,KAAK,CAAC,GAApD,CAAJ,EAA8D;AAC5D,QAAA,OAAO,CAAC,IAAR,CAAa,KAAK,CAAC,KAAnB;AACD;AACF;AANsD;AAAA;AAAA;AAAA;AAAA;;AAOvD,SAAO,OAAP;AACD;;AAED,SAAS,YAAT,CAAuB,IAAvB,EAAmC,KAAnC,EAAgD;AAC9C,MAAM,OAAO,GAAG,qBAAqB,CAAC,IAAD,EAAO,KAAP,CAArC;AACA,EAAA,OAAO,CAAC,IAAR;;AAEA,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,OAAO,CAAC,MAA5B,EAAoC,CAAC,EAArC,EAAyC;AACvC,QAAI,CAAC,GAAG,OAAO,CAAC,CAAD,CAAf,EAAoB;AAClB,aAAO,CAAP;AACD;AACF;;AACD,SAAO,KAAP;AACD;;AAED,SAAS,mBAAT,CAA8B,IAA9B,EAA0C,KAA1C,EAAyD,QAAzD,EAA2E,QAA3E,EAAsH;AAAA,MAAzB,iBAAyB,uEAAL,KAAK;AACpH,MAAM,WAAW,GAAW,EAA5B;;AADoH,8CAEhG,KAFgG;AAAA;;AAAA;AAEpH,2DAA2B;AAAA,UAAhB,KAAgB;;AACzB,UAAI,KAAK,CAAC,KAAN,IAAe,QAAf,IAA2B,KAAK,CAAC,KAAN,IAAe,QAA1C,IAAsD,wBAAW,IAAI,CAAC,KAAhB,EAAuB,IAAI,CAAC,GAA5B,EAAiC,KAAK,CAAC,KAAvC,EAA8C,KAAK,CAAC,GAApD,CAA1D,EAAoH;AAClH,QAAA,WAAW,CAAC,IAAZ,CAAiB,KAAjB;AACD;AACF;AANmH;AAAA;AAAA;AAAA;AAAA;;AAOpH,MAAI,iBAAiB,IAAI,WAAW,CAAC,MAAZ,GAAqB,CAA9C,EAAiD;AAC/C,QAAM,KAAK,GAAG,WAAW,CAAC,MAAZ,CAAmB,UAAC,GAAD,EAAM,CAAN;AAAA,aAAY,IAAI,CAAC,GAAL,CAAS,GAAT,EAAc,CAAC,CAAC,KAAhB,CAAZ;AAAA,KAAnB,EAAuD,WAAW,CAAC,CAAD,CAAX,CAAe,KAAtE,CAAd;AACA,WAAO,WAAW,CAAC,MAAZ,CAAmB,UAAA,CAAC;AAAA,aAAI,CAAC,CAAC,KAAF,KAAY,KAAhB;AAAA,KAApB,CAAP;AACD;;AACD,SAAO,WAAP;AACD;;AAED,SAAS,SAAT,CAAoB,IAApB,EAAgC,KAAhC,EAA6C;AAC3C,MAAI,MAAM,GAAgB,IAA1B;;AAD2C,8CAEvB,KAFuB;AAAA;;AAAA;AAE3C,2DAA2B;AAAA,UAAhB,KAAgB;;AACzB,UAAI,wBAAW,IAAI,CAAC,KAAhB,EAAuB,IAAI,CAAC,GAA5B,EAAiC,KAAK,CAAC,KAAvC,EAA8C,KAAK,CAAC,GAApD,MAA6D,MAAM,KAAK,IAAX,IAAmB,KAAK,CAAC,KAAN,GAAc,MAAM,CAAC,KAArG,CAAJ,EAAiH;AAC/G,QAAA,MAAM,GAAG,KAAT;AACD;AACF;AAN0C;AAAA;AAAA;AAAA;AAAA;;AAO3C,SAAO,MAAP;AACD;;AAED,SAAS,YAAT,CAAuB,IAAvB,EAAmC,KAAnC,EAAkD,gBAAlD,EAA0E;AAAA,8CACpD,KADoD;AAAA;;AAAA;AACxE,2DAA2B;AAAA,UAAhB,KAAgB;;AACzB,UAAI,KAAK,KAAK,IAAV,IACF,KAAK,CAAC,KAAN,GAAc,IAAI,CAAC,KADjB,IAEF,wBAAW,IAAI,CAAC,KAAhB,EAAuB,OAAO,CAAC,IAAI,CAAC,KAAN,EAAa,gBAAb,CAA9B,EAA8D,KAAK,CAAC,KAApE,EAA2E,KAAK,CAAC,GAAjF,CAFF,EAEyF;AACvF,eAAO,KAAP;AACD;AACF;AAPuE;AAAA;AAAA;AAAA;AAAA;;AASxE,SAAO,IAAP;AACD;;AAED,SAAS,SAAT,CAAoB,OAApB,EAAoD,QAApD,EAAoE;AAClE,MAAM,MAAM,GAAY,EAAxB;;AADkE,8CAG7C,OAH6C;AAAA;;AAAA;AAGlE,2DAA8B;AAAA,UAAnB,MAAmB;;AAAA,gCACP,gCAAmB,MAAM,CAAC,KAA1B,EAAiC,QAAjC,CADO;AAAA;AAAA,UACrB,KADqB;AAAA,UACd,GADc;;AAE5B,UAAI,KAAK,GAAG,KAAZ;;AAF4B,mDAIR,MAJQ;AAAA;;AAAA;AAI5B,kEAA4B;AAAA,cAAjB,KAAiB;;AAC1B,cAAI,wBAAW,KAAX,EAAkB,GAAlB,EAAuB,KAAK,CAAC,KAA7B,EAAoC,KAAK,CAAC,GAA1C,CAAJ,EAAoD;AAClD,YAAA,KAAK,CAAC,OAAN,CAAc,IAAd,CAAmB,MAAnB;AACA,YAAA,KAAK,CAAC,GAAN,GAAY,IAAI,CAAC,GAAL,CAAS,KAAK,CAAC,GAAf,EAAoB,GAApB,CAAZ;AACA,YAAA,KAAK,GAAG,IAAR;AACA;AACD;AACF;AAX2B;AAAA;AAAA;AAAA;AAAA;;AAa5B,UAAI,CAAC,KAAL,EAAY;AACV,QAAA,MAAM,CAAC,IAAP,CAAY;AAAE,UAAA,KAAK,EAAL,KAAF;AAAS,UAAA,GAAG,EAAH,GAAT;AAAc,UAAA,OAAO,EAAE,CAAC,MAAD;AAAvB,SAAZ;AACD;AACF;AAnBiE;AAAA;AAAA;AAAA;AAAA;;AAqBlE,SAAO,MAAP;AACD;;AAED,SAAS,OAAT,CAAkB,MAAlB,EAA+C,QAA/C,EAA+D;AAAA,6BACxC,gCAAmB,MAAM,CAAC,KAA1B,EAAiC,QAAjC,CADwC;AAAA;AAAA,MACtD,KADsD;AAAA,MAC/C,GAD+C;;AAG7D,SAAO;AACL,IAAA,MAAM,EAAE,IADH;AAEL,IAAA,OAAO,EAAE,IAFJ;AAGL,IAAA,KAAK,EAAE,CAHF;AAIL,IAAA,MAAM,EAAN,MAJK;AAKL,IAAA,KAAK,EAAL,KALK;AAML,IAAA,GAAG,EAAH,GANK;AAOL,IAAA,QAAQ,EAAE;AAPL,GAAP;AASD;;AAED,SAAS,gBAAT,CAA2B,IAA3B,EAAqC;AACnC,MAAI,GAAG,GAAG,IAAI,CAAC,KAAf;;AADmC,+CAEf,IAAI,CAAC,QAFU;AAAA;;AAAA;AAEnC,8DAAmC;AAAA,UAAxB,KAAwB;AACjC,UAAM,QAAQ,GAAG,gBAAgB,CAAC,KAAD,CAAjC;;AACA,UAAI,QAAQ,GAAG,GAAf,EAAoB;AAClB,QAAA,GAAG,GAAG,QAAN;AACD;AACF;AAPkC;AAAA;AAAA;AAAA;AAAA;;AAQnC,SAAO,GAAP;AACD;;AAED,SAAS,OAAT,CAAkB,UAAlB,EAAsC,OAAtC,EAAqD;AACnD,MAAM,aAAa,GAAG,UAAU,GAAG,GAAnC;AACA,MAAM,YAAY,GAAG,aAAa,GAAG,OAArC;AACA,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAL,CAAW,YAAY,GAAG,EAA1B,CAAjB;AACA,MAAM,UAAU,GAAG,YAAY,GAAG,EAAlC;AAEA,SAAO,UAAU,GAAG,aAAb,GAA6B,QAAQ,GAAG,GAAxC,GAA8C,UAArD;AACD","sourcesContent":["import { CalendarEventOverlapMode, CalendarEventVisual } from 'kdutify/types'\nimport { getOverlapGroupHandler, getVisuals, hasOverlap, getNormalizedRange } from './common'\nimport { getTimestampIdentifier } from '../util/timestamp'\n\ninterface Group {\n  start: number\n  end: number\n  visuals: CalendarEventVisual[]\n}\n\ninterface Node {\n  parent: Node | null\n  sibling: boolean\n  index: number\n  visual: CalendarEventVisual\n  start: number\n  end: number\n  children: Node[]\n}\n\nconst FULL_WIDTH = 100\n\nconst DEFAULT_OFFSET = 5\n\nconst WIDTH_MULTIPLIER = 1.7\n\n/**\n * Variation of column mode where events can be stacked. The priority of this\n * mode is to stack events together taking up the least amount of space while\n * trying to ensure the content of the event is always visible as well as its\n * start and end. A sibling column has intersecting event content and must be\n * placed beside each other. Non-sibling columns are offset by 5% from the\n * previous column. The width is scaled by 1.7 so the events overlap and\n * whitespace is reduced. If there is a hole in columns the event width is\n * scaled up so it intersects with the next column. The columns have equal\n * width in the space they are given. If the event doesn't have any to the\n * right of it that intersect with it's content it's right side is extended\n * to the right side.\n */\n\nexport const stack: CalendarEventOverlapMode = (events, firstWeekday, overlapThreshold) => {\n  const handler = getOverlapGroupHandler(firstWeekday)\n\n  // eslint-disable-next-line max-statements\n  return (day, dayEvents, timed, reset) => {\n    if (!timed) {\n      return handler.getVisuals(day, dayEvents, timed, reset)\n    }\n\n    const dayStart = getTimestampIdentifier(day)\n    const visuals = getVisuals(dayEvents, dayStart)\n    const groups = getGroups(visuals, dayStart)\n\n    for (const group of groups) {\n      const nodes: Node[] = []\n\n      for (const visual of group.visuals) {\n        const child = getNode(visual, dayStart)\n        const index = getNextIndex(child, nodes)\n\n        if (index === false) {\n          const parent = getParent(child, nodes)\n          if (parent) {\n            child.parent = parent\n            child.sibling = hasOverlap(child.start, child.end, parent.start, addTime(parent.start, overlapThreshold))\n            child.index = parent.index + 1\n            parent.children.push(child)\n          }\n        } else {\n          const [parent] = getOverlappingRange(child, nodes, index - 1, index - 1)\n          const children = getOverlappingRange(child, nodes, index + 1, index + nodes.length, true)\n\n          child.children = children\n          child.index = index\n\n          if (parent) {\n            child.parent = parent\n            child.sibling = hasOverlap(child.start, child.end, parent.start, addTime(parent.start, overlapThreshold))\n            parent.children.push(child)\n          }\n\n          for (const grand of children) {\n            if (grand.parent === parent) {\n              grand.parent = child\n            }\n\n            const grandNext = grand.index - child.index <= 1\n            if (grandNext && child.sibling &&\n              hasOverlap(child.start, addTime(child.start, overlapThreshold), grand.start, grand.end)) {\n              grand.sibling = true\n            }\n          }\n        }\n\n        nodes.push(child)\n      }\n\n      calculateBounds(nodes, overlapThreshold)\n    }\n\n    visuals.sort((a, b) => (a.left - b.left) || (a.event.startTimestampIdentifier - b.event.startTimestampIdentifier))\n\n    return visuals\n  }\n}\n\nfunction calculateBounds (nodes: Node[], overlapThreshold: number) {\n  for (const node of nodes) {\n    const { visual, parent } = node\n    const columns = getMaxChildIndex(node) + 1\n    const spaceLeft = parent ? parent.visual.left : 0\n    const spaceWidth = FULL_WIDTH - spaceLeft\n    const offset = Math.min(DEFAULT_OFFSET, FULL_WIDTH / columns)\n    const columnWidthMultiplier = getColumnWidthMultiplier(node, nodes)\n    const columnOffset = spaceWidth / (columns - node.index + 1)\n    const columnWidth = spaceWidth / (columns - node.index + (node.sibling ? 1 : 0)) * columnWidthMultiplier\n\n    if (parent) {\n      visual.left = node.sibling\n        ? spaceLeft + columnOffset\n        : spaceLeft + offset\n    }\n\n    visual.width = hasFullWidth(node, nodes, overlapThreshold)\n      ? FULL_WIDTH - visual.left\n      : Math.min(FULL_WIDTH - visual.left, columnWidth * WIDTH_MULTIPLIER)\n  }\n}\n\nfunction getColumnWidthMultiplier (node: Node, nodes: Node[]): number {\n  if (!node.children.length) {\n    return 1\n  }\n\n  const maxColumn = node.index + nodes.length\n  const minColumn = node.children.reduce((min, c) => Math.min(min, c.index), maxColumn)\n\n  return minColumn - node.index\n}\n\nfunction getOverlappingIndices (node: Node, nodes: Node[]): number[] {\n  const indices: number[] = []\n  for (const other of nodes) {\n    if (hasOverlap(node.start, node.end, other.start, other.end)) {\n      indices.push(other.index)\n    }\n  }\n  return indices\n}\n\nfunction getNextIndex (node: Node, nodes: Node[]): number | false {\n  const indices = getOverlappingIndices(node, nodes)\n  indices.sort()\n\n  for (let i = 0; i < indices.length; i++) {\n    if (i < indices[i]) {\n      return i\n    }\n  }\n  return false\n}\n\nfunction getOverlappingRange (node: Node, nodes: Node[], indexMin: number, indexMax: number, returnFirstColumn = false): Node[] {\n  const overlapping: Node[] = []\n  for (const other of nodes) {\n    if (other.index >= indexMin && other.index <= indexMax && hasOverlap(node.start, node.end, other.start, other.end)) {\n      overlapping.push(other)\n    }\n  }\n  if (returnFirstColumn && overlapping.length > 0) {\n    const first = overlapping.reduce((min, n) => Math.min(min, n.index), overlapping[0].index)\n    return overlapping.filter(n => n.index === first)\n  }\n  return overlapping\n}\n\nfunction getParent (node: Node, nodes: Node[]): Node | null {\n  let parent: Node | null = null\n  for (const other of nodes) {\n    if (hasOverlap(node.start, node.end, other.start, other.end) && (parent === null || other.index > parent.index)) {\n      parent = other\n    }\n  }\n  return parent\n}\n\nfunction hasFullWidth (node: Node, nodes: Node[], overlapThreshold: number): boolean {\n  for (const other of nodes) {\n    if (other !== node &&\n      other.index > node.index &&\n      hasOverlap(node.start, addTime(node.start, overlapThreshold), other.start, other.end)) {\n      return false\n    }\n  }\n\n  return true\n}\n\nfunction getGroups (visuals: CalendarEventVisual[], dayStart: number): Group[] {\n  const groups: Group[] = []\n\n  for (const visual of visuals) {\n    const [start, end] = getNormalizedRange(visual.event, dayStart)\n    let added = false\n\n    for (const group of groups) {\n      if (hasOverlap(start, end, group.start, group.end)) {\n        group.visuals.push(visual)\n        group.end = Math.max(group.end, end)\n        added = true\n        break\n      }\n    }\n\n    if (!added) {\n      groups.push({ start, end, visuals: [visual] })\n    }\n  }\n\n  return groups\n}\n\nfunction getNode (visual: CalendarEventVisual, dayStart: number): Node {\n  const [start, end] = getNormalizedRange(visual.event, dayStart)\n\n  return {\n    parent: null,\n    sibling: true,\n    index: 0,\n    visual,\n    start,\n    end,\n    children: [],\n  }\n}\n\nfunction getMaxChildIndex (node: Node): number {\n  let max = node.index\n  for (const child of node.children) {\n    const childMax = getMaxChildIndex(child)\n    if (childMax > max) {\n      max = childMax\n    }\n  }\n  return max\n}\n\nfunction addTime (identifier: number, minutes: number): number {\n  const removeMinutes = identifier % 100\n  const totalMinutes = removeMinutes + minutes\n  const addHours = Math.floor(totalMinutes / 60)\n  const addMinutes = totalMinutes % 60\n\n  return identifier - removeMinutes + addHours * 100 + addMinutes\n}\n"],"sourceRoot":"","file":"stack.js"}