guestbell-forms 2.0.298 → 2.0.299

package/build/components/bookingCalendar/common.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/lib/components/bookingCalendar/common.ts"],"names":["defaultGetMomentFormatFunction","date","bestStep","undefined","valueOf","clone","startOf","defaultGetNewMomentFunction","defaultGridAvailableSteps"],"mappings":";;;;;;;;;AAAA;;;;;;AAyBO,IAAMA,8BAA8B,GAAG,SAAjCA,8BAAiC,CAC5CC,IAD4C,EAE5CC,QAF4C,EAGzC;AACH,MAAI,CAACD,IAAD,IAAS,CAACC,QAAd,EAAwB;AACtB,WAAOC,SAAP;AACD;;AACD,MACEF,IAAI,CAACG,OAAL,OACAH,IAAI,CACDI,KADH,GAEGC,OAFH,CAEW,KAFX,EAGGF,OAHH,EAFF,EAME;AACA,WAAO,QAAP;AACD;;AACD,SAAO,QAAP;AACD,CAjBM;;;;AAqBA,IAAMG,2BAA2B,GAAG,SAA9BA,2BAA8B,CAACN,IAAD,EAAgB;AACzD,SAAO,qBAAOA,IAAP,CAAP;AACD,CAFM;;;AAMA,IAAMO,yBAAqC,GAAG,CACnD,sBAAS,CAAT,EAAY,QAAZ,CADmD,EAEnD,sBAAS,CAAT,EAAY,QAAZ,CAFmD,EAGnD,sBAAS,EAAT,EAAa,QAAb,CAHmD,EAInD,sBAAS,EAAT,EAAa,QAAb,CAJmD,EAKnD,sBAAS,EAAT,EAAa,QAAb,CALmD,EAMnD,sBAAS,EAAT,EAAa,QAAb,CANmD,EAOnD,sBAAS,CAAT,EAAY,MAAZ,CAPmD,EAQnD,sBAAS,CAAT,EAAY,MAAZ,CARmD,EASnD,sBAAS,CAAT,EAAY,MAAZ,CATmD,EAUnD,sBAAS,CAAT,EAAY,MAAZ,CAVmD,EAWnD,sBAAS,CAAT,EAAY,MAAZ,CAXmD,EAYnD,sBAAS,EAAT,EAAa,MAAb,CAZmD,EAanD,sBAAS,CAAT,EAAY,KAAZ,CAbmD,CAA9C","sourcesContent":["import moment, { Moment, Duration, duration } from 'moment';\r\n\r\nexport interface BookingCalendarItemT {\r\n  from: Moment;\r\n  till: Moment;\r\n  /*\r\n  Optional index that identifies the lane\r\n  */\r\n  laneKey?: string | number;\r\n}\r\n\r\nexport interface BookingCalendarItemWithOriginalIndexT {\r\n  originalIndex: number;\r\n}\r\n\r\nexport interface BookingCalendarDateRange {\r\n  from: Moment;\r\n  till: Moment;\r\n}\r\n\r\nexport interface ZoomLevel {\r\n  step: Duration;\r\n  label: React.ReactNode;\r\n}\r\n\r\nexport const defaultGetMomentFormatFunction = (\r\n  date: Moment,\r\n  bestStep: Duration\r\n) => {\r\n  if (!date || !bestStep) {\r\n    return undefined;\r\n  }\r\n  if (\r\n    date.valueOf() ===\r\n    date\r\n      .clone()\r\n      .startOf('day')\r\n      .valueOf()\r\n  ) {\r\n    return 'MMM Do';\r\n  }\r\n  return 'h:mm a';\r\n};\r\n\r\nexport type GetMomentFormatFunctionType = typeof defaultGetMomentFormatFunction;\r\n\r\nexport const defaultGetNewMomentFunction = (date: Date) => {\r\n  return moment(date);\r\n};\r\n\r\nexport type GetNewMomentFunctionType = typeof defaultGetNewMomentFunction;\r\n\r\nexport const defaultGridAvailableSteps: Duration[] = [\r\n  duration(1, 'minute'),\r\n  duration(5, 'minute'),\r\n  duration(10, 'minute'),\r\n  duration(15, 'minute'),\r\n  duration(20, 'minute'),\r\n  duration(30, 'minute'),\r\n  duration(1, 'hour'),\r\n  duration(2, 'hour'),\r\n  duration(4, 'hour'),\r\n  duration(6, 'hour'),\r\n  duration(8, 'hour'),\r\n  duration(12, 'hour'),\r\n  duration(1, 'day'),\r\n];\r\n"],"file":"common.js"}
+{"version":3,"file":"common.js","names":["defaultGetMomentFormatFunction","date","bestStep","undefined","valueOf","clone","startOf","defaultGetNewMomentFunction","moment","defaultGridAvailableSteps","duration"],"sources":["../../../src/lib/components/bookingCalendar/common.ts"],"sourcesContent":["import moment, { Moment, Duration, duration } from 'moment';\r\n\r\nexport interface BookingCalendarItemT {\r\n  from: Moment;\r\n  till: Moment;\r\n  /*\r\n  Optional index that identifies the lane\r\n  */\r\n  laneKey?: string | number;\r\n}\r\n\r\nexport interface BookingCalendarItemWithOriginalIndexT {\r\n  originalIndex: number;\r\n}\r\n\r\nexport interface BookingCalendarDateRange {\r\n  from: Moment;\r\n  till: Moment;\r\n}\r\n\r\nexport interface ZoomLevel {\r\n  step: Duration;\r\n  label: React.ReactNode;\r\n}\r\n\r\nexport const defaultGetMomentFormatFunction = (\r\n  date: Moment,\r\n  bestStep: Duration\r\n) => {\r\n  if (!date || !bestStep) {\r\n    return undefined;\r\n  }\r\n  if (\r\n    date.valueOf() ===\r\n    date\r\n      .clone()\r\n      .startOf('day')\r\n      .valueOf()\r\n  ) {\r\n    return 'MMM Do';\r\n  }\r\n  return 'h:mm a';\r\n};\r\n\r\nexport type GetMomentFormatFunctionType = typeof defaultGetMomentFormatFunction;\r\n\r\nexport const defaultGetNewMomentFunction = (date: Date) => {\r\n  return moment(date);\r\n};\r\n\r\nexport type GetNewMomentFunctionType = typeof defaultGetNewMomentFunction;\r\n\r\nexport const defaultGridAvailableSteps: Duration[] = [\r\n  duration(1, 'minute'),\r\n  duration(5, 'minute'),\r\n  duration(10, 'minute'),\r\n  duration(15, 'minute'),\r\n  duration(20, 'minute'),\r\n  duration(30, 'minute'),\r\n  duration(1, 'hour'),\r\n  duration(2, 'hour'),\r\n  duration(4, 'hour'),\r\n  duration(6, 'hour'),\r\n  duration(8, 'hour'),\r\n  duration(12, 'hour'),\r\n  duration(1, 'day'),\r\n];\r\n"],"mappings":";;;;;;;AAAA;;;;;;AAyBO,MAAMA,8BAA8B,GAAG,CAC5CC,IAD4C,EAE5CC,QAF4C,KAGzC;EACH,IAAI,CAACD,IAAD,IAAS,CAACC,QAAd,EAAwB;IACtB,OAAOC,SAAP;EACD;;EACD,IACEF,IAAI,CAACG,OAAL,OACAH,IAAI,CACDI,KADH,GAEGC,OAFH,CAEW,KAFX,EAGGF,OAHH,EAFF,EAME;IACA,OAAO,QAAP;EACD;;EACD,OAAO,QAAP;AACD,CAjBM;;;;AAqBA,MAAMG,2BAA2B,GAAIN,IAAD,IAAgB;EACzD,OAAO,IAAAO,eAAA,EAAOP,IAAP,CAAP;AACD,CAFM;;;AAMA,MAAMQ,yBAAqC,GAAG,CACnD,IAAAC,gBAAA,EAAS,CAAT,EAAY,QAAZ,CADmD,EAEnD,IAAAA,gBAAA,EAAS,CAAT,EAAY,QAAZ,CAFmD,EAGnD,IAAAA,gBAAA,EAAS,EAAT,EAAa,QAAb,CAHmD,EAInD,IAAAA,gBAAA,EAAS,EAAT,EAAa,QAAb,CAJmD,EAKnD,IAAAA,gBAAA,EAAS,EAAT,EAAa,QAAb,CALmD,EAMnD,IAAAA,gBAAA,EAAS,EAAT,EAAa,QAAb,CANmD,EAOnD,IAAAA,gBAAA,EAAS,CAAT,EAAY,MAAZ,CAPmD,EAQnD,IAAAA,gBAAA,EAAS,CAAT,EAAY,MAAZ,CARmD,EASnD,IAAAA,gBAAA,EAAS,CAAT,EAAY,MAAZ,CATmD,EAUnD,IAAAA,gBAAA,EAAS,CAAT,EAAY,MAAZ,CAVmD,EAWnD,IAAAA,gBAAA,EAAS,CAAT,EAAY,MAAZ,CAXmD,EAYnD,IAAAA,gBAAA,EAAS,EAAT,EAAa,MAAb,CAZmD,EAanD,IAAAA,gBAAA,EAAS,CAAT,EAAY,KAAZ,CAbmD,CAA9C"}

package/build/components/bookingCalendar/index.js

@@ -11,7 +11,7 @@ Object.keys(_BookingCalendar).forEach(function (key) {
   if (key in exports && exports[key] === _BookingCalendar[key]) return;
   Object.defineProperty(exports, key, {
     enumerable: true,
-    get: function get() {
+    get: function () {
       return _BookingCalendar[key];
     }
   });
@@ -24,7 +24,7 @@ Object.keys(_common).forEach(function (key) {
   if (key in exports && exports[key] === _common[key]) return;
   Object.defineProperty(exports, key, {
     enumerable: true,
-    get: function get() {
+    get: function () {
       return _common[key];
     }
   });
@@ -37,7 +37,7 @@ Object.keys(_classes).forEach(function (key) {
   if (key in exports && exports[key] === _classes[key]) return;
   Object.defineProperty(exports, key, {
     enumerable: true,
-    get: function get() {
+    get: function () {
       return _classes[key];
     }
   });

package/build/components/bookingCalendar/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/lib/components/bookingCalendar/index.ts"],"names":[],"mappings":";;;;;;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AACA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AACA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA","sourcesContent":["export * from './BookingCalendar';\r\nexport * from './common';\r\nexport * from './classes';\r\n"],"file":"index.js"}
+{"version":3,"file":"index.js","names":[],"sources":["../../../src/lib/components/bookingCalendar/index.ts"],"sourcesContent":["export * from './BookingCalendar';\r\nexport * from './common';\r\nexport * from './classes';\r\n"],"mappings":";;;;;;AAAA;;AAAA;EAAA;EAAA;EAAA;IAAA;IAAA;MAAA;IAAA;EAAA;AAAA;;AACA;;AAAA;EAAA;EAAA;EAAA;IAAA;IAAA;MAAA;IAAA;EAAA;AAAA;;AACA;;AAAA;EAAA;EAAA;EAAA;IAAA;IAAA;MAAA;IAAA;EAAA;AAAA"}

package/build/components/bookingCalendar/utils.js

@@ -3,37 +3,25 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
+exports.calculateItemsDimensions = calculateItemsDimensions;
+exports.getItemPositionStyle = exports.generateGridItems = exports.generateControlItems = void 0;
 exports.groupBy = groupBy;
-exports.splitBookingsToLanes = splitBookingsToLanes;
 exports.itemsOverlap = itemsOverlap;
-exports.calculateItemsDimensions = calculateItemsDimensions;
-exports.generateGridItems = exports.generateControlItems = exports.getItemPositionStyle = void 0;
+exports.splitBookingsToLanes = splitBookingsToLanes;
 
 var _moment = _interopRequireDefault(require("moment"));
 
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
-function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
-
-function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread 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 ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
 
-function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
-
-function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
-
-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 ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) { symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); } keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
 
 function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
 
 function groupBy(items, iterator) {
-  return items.reduce(function (obj, item) {
-    var key = iterator(item);
+  return items.reduce((obj, item) => {
+    const key = iterator(item);
 
     if (!obj.hasOwnProperty(key)) {
       obj[key] = [];
@@ -45,154 +33,114 @@ function groupBy(items, iterator) {
 }
 
 function splitBookingsToLanes(bookings, from, minLanesCount) {
-  var lanesSource = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
+  let lanesSource = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
 
   if (!bookings) {
     return [];
   }
 
-  var lanes = [];
+  let lanes = [];
 
   if (lanesSource !== null && lanesSource !== void 0 && lanesSource.length) {
-    lanes = lanesSource.map(function (source) {
-      return _objectSpread(_objectSpread({}, source), {}, {
-        items: []
-      });
-    });
+    lanes = lanesSource.map(source => _objectSpread(_objectSpread({}, source), {}, {
+      items: []
+    }));
   }
 
-  var bookingsWithoutLaneKey = bookings.filter(function (a) {
-    return a.laneKey === undefined;
-  });
-  var bookingsWithLaneKey = bookings.filter(function (a) {
-    return a.laneKey !== undefined;
-  });
+  const bookingsWithoutLaneKey = bookings.filter(a => a.laneKey === undefined);
+  const bookingsWithLaneKey = bookings.filter(a => a.laneKey !== undefined);
 
   if (bookingsWithLaneKey.length) {
-    var grouped = groupBy(bookingsWithLaneKey.map(function (booking, originalIndex) {
-      return _objectSpread(_objectSpread({}, booking), {}, {
-        originalIndex: originalIndex
-      });
-    }), function (a) {
-      return a.laneKey;
-    });
-    lanes = Object.keys(grouped).map(function (key) {
-      return _objectSpread({
-        laneKey: Number(key),
-        items: grouped[key]
-      }, lanesSource === null || lanesSource === void 0 ? void 0 : lanesSource.find(function (a) {
-        return a.laneKey === Number(key);
-      }));
-    });
-    var missingLanes = lanesSource === null || lanesSource === void 0 ? void 0 : lanesSource.filter(function (a) {
-      return !lanes.some(function (l) {
-        return l.laneKey === a.laneKey;
-      });
-    });
-    lanes = lanes.concat(missingLanes.map(function (a) {
-      return _objectSpread(_objectSpread({}, a), {}, {
-        items: []
-      });
-    }));
+    const grouped = groupBy(bookingsWithLaneKey.map((booking, originalIndex) => _objectSpread(_objectSpread({}, booking), {}, {
+      originalIndex
+    })), a => a.laneKey);
+    lanes = Object.keys(grouped).map(key => _objectSpread({
+      laneKey: Number(key),
+      items: grouped[key]
+    }, lanesSource === null || lanesSource === void 0 ? void 0 : lanesSource.find(a => a.laneKey === Number(key))));
+    const missingLanes = lanesSource === null || lanesSource === void 0 ? void 0 : lanesSource.filter(a => !lanes.some(l => l.laneKey === a.laneKey));
+    lanes = lanes.concat(missingLanes.map(a => _objectSpread(_objectSpread({}, a), {}, {
+      items: []
+    })));
   }
 
   if (bookingsWithoutLaneKey.length) {
-    (function () {
-      var remainingBookings = bookingsWithoutLaneKey.map(function (booking, originalIndex) {
-        return _objectSpread(_objectSpread({}, booking), {}, {
-          originalIndex: originalIndex
-        });
-      }).sort(function (a, b) {
-        return a.from.valueOf() - b.from.valueOf();
-      });
-
-      var _loop = function _loop() {
-        var min = 99999999999999;
-        var bookingIndex = -1;
-        var laneIndex = -1;
-        lanes.forEach(function (lane, index) {
-          var _lane$items$till, _lane$items;
-
-          if (lanesSource !== null && lanesSource !== void 0 && lanesSource.some(function (l) {
-            return l.laneKey === lane.laneKey;
-          })) {
-            return;
-          }
-
-          var lastTill = (_lane$items$till = (_lane$items = lane.items[lane.items.length - 1]) === null || _lane$items === void 0 ? void 0 : _lane$items.till) !== null && _lane$items$till !== void 0 ? _lane$items$till : from;
-          var distances = remainingBookings.map(function (booking) {
-            var dist = booking.from.diff(lastTill);
-
-            if (lane.items.length === 0) {
-              return Math.abs(dist);
-            }
-
-            return dist;
-          });
+    let remainingBookings = bookingsWithoutLaneKey.map((booking, originalIndex) => _objectSpread(_objectSpread({}, booking), {}, {
+      originalIndex
+    })).sort((a, b) => a.from.valueOf() - b.from.valueOf());
+
+    while (remainingBookings.length > 0) {
+      let min = 99999999999999;
+      let bookingIndex = -1;
+      let laneIndex = -1;
+      lanes.forEach((lane, index) => {
+        var _lane$items;
+
+        if (lanesSource !== null && lanesSource !== void 0 && lanesSource.some(l => l.laneKey === lane.laneKey)) {
+          return;
+        }
 
-          var _min = Math.min.apply(Math, _toConsumableArray(distances.filter(function (a) {
-            return a >= 0;
-          })));
+        const lastTill = ((_lane$items = lane.items[lane.items.length - 1]) === null || _lane$items === void 0 ? void 0 : _lane$items.till) ?? from;
+        const distances = remainingBookings.map(booking => {
+          const dist = booking.from.diff(lastTill);
 
-          if (_min < min) {
-            bookingIndex = distances.indexOf(_min);
-            laneIndex = index;
+          if (lane.items.length === 0) {
+            return Math.abs(dist);
           }
+
+          return dist;
         });
 
-        if (bookingIndex >= 0 && laneIndex >= 0) {
-          lanes[laneIndex].items = lanes[laneIndex].items.concat(_objectSpread({}, remainingBookings[bookingIndex]));
-          remainingBookings.splice(bookingIndex, 1);
-        } else {
-          lanes = lanes.concat({
-            items: [_objectSpread({}, remainingBookings[0])],
-            laneKey: lanes.length,
-            data: undefined
-          });
-          remainingBookings.shift();
+        const _min = Math.min(...distances.filter(a => a >= 0));
+
+        if (_min < min) {
+          bookingIndex = distances.indexOf(_min);
+          laneIndex = index;
         }
-      };
+      });
 
-      while (remainingBookings.length > 0) {
-        _loop();
-      } // Naive solution that is much less computationally intensive but yields more lanes than necessary
-
-      /*bookings.forEach((booking, originalIndex) => {
-      let found = false;
-      lanes.forEach((lane, index) => {
-        if (!lane.some(i => itemsOverlap(booking, i))) {
-          lanes[index] = lanes[index].concat({ ...booking, originalIndex });
-          found = true;
-        }
-      });
-      if (!found) {
-        lanes = lanes.concat([[{ ...booking, originalIndex }]]);
+      if (bookingIndex >= 0 && laneIndex >= 0) {
+        lanes[laneIndex].items = lanes[laneIndex].items.concat(_objectSpread({}, remainingBookings[bookingIndex]));
+        remainingBookings.splice(bookingIndex, 1);
+      } else {
+        lanes = lanes.concat({
+          items: [_objectSpread({}, remainingBookings[0])],
+          laneKey: lanes.length,
+          data: undefined
+        });
+        remainingBookings.shift();
+      }
+    } // Naive solution that is much less computationally intensive but yields more lanes than necessary
+
+    /*bookings.forEach((booking, originalIndex) => {
+    let found = false;
+    lanes.forEach((lane, index) => {
+      if (!lane.some(i => itemsOverlap(booking, i))) {
+        lanes[index] = lanes[index].concat({ ...booking, originalIndex });
+        found = true;
       }
-      });*/
+    });
+    if (!found) {
+      lanes = lanes.concat([[{ ...booking, originalIndex }]]);
+    }
+    });*/
 
-    })();
   }
 
-  for (var index = 0; index < lanes.length; index++) {
-    var lane = lanes[index];
-    lanes[index].items = lane.items.sort(function (a, b) {
-      return a.from.valueOf() - b.from.valueOf();
-    });
+  for (let index = 0; index < lanes.length; index++) {
+    const lane = lanes[index];
+    lanes[index].items = lane.items.sort((a, b) => a.from.valueOf() - b.from.valueOf());
   }
 
   if (lanes.length < minLanesCount) {
-    lanes = lanes.concat(new Array(minLanesCount - lanes.length).fill(null).map(function (_, index) {
-      return {
-        items: [],
-        laneKey: index + lanes.length,
-        data: null
-      };
-    }));
+    lanes = lanes.concat(new Array(minLanesCount - lanes.length).fill(null).map((_, index) => ({
+      items: [],
+      laneKey: index + lanes.length,
+      data: null
+    })));
   }
 
-  lanes = lanes.sort(function (a, b) {
-    return a.laneKey - b.laneKey;
-  });
+  lanes = lanes.sort((a, b) => a.laneKey - b.laneKey);
   return lanes;
 }
 
@@ -212,54 +160,52 @@ function itemsOverlap(a, b) {
   return true;
 }
 
-var getItemPositionStyle = function getItemPositionStyle(marginStart, width) {
-  return {
-    marginLeft: "".concat(marginStart * 100, "%"),
-    width: "".concat(width * 100, "%")
-  };
-};
+const getItemPositionStyle = (marginStart, width) => ({
+  marginLeft: `${marginStart * 100}%`,
+  width: `${width * 100}%`
+});
 
 exports.getItemPositionStyle = getItemPositionStyle;
 
 function calculateItemsDimensions(items, from, till) {
-  var lastEnd = 0;
-  var widthMs = till.valueOf() - from.valueOf();
-  var startMs = from.valueOf();
-  var endMs = till.valueOf();
-  return widthMs > 0 ? items === null || items === void 0 ? void 0 : items.map(function (item) {
-    var startIsCut = item.from.valueOf() < startMs;
-    var realStart = (item.from.valueOf() - startMs) / widthMs;
-    var realFrom = startIsCut ? (0, _moment.default)(startMs) : (0, _moment.default)(item.from);
-    var start = startIsCut ? 0 : realStart;
-    var endIsCut = item.till.valueOf() > endMs;
-    var realEnd = (item.till.valueOf() - startMs) / widthMs;
-    var end = endIsCut ? (endMs - startMs) / widthMs : realEnd;
-    var realTill = endIsCut ? (0, _moment.default)(endMs) : (0, _moment.default)(item.till);
-    var marginStart = start - lastEnd;
+  let lastEnd = 0;
+  const widthMs = till.valueOf() - from.valueOf();
+  const startMs = from.valueOf();
+  const endMs = till.valueOf();
+  return widthMs > 0 ? items === null || items === void 0 ? void 0 : items.map(item => {
+    const startIsCut = item.from.valueOf() < startMs;
+    const realStart = (item.from.valueOf() - startMs) / widthMs;
+    const realFrom = startIsCut ? (0, _moment.default)(startMs) : (0, _moment.default)(item.from);
+    const start = startIsCut ? 0 : realStart;
+    const endIsCut = item.till.valueOf() > endMs;
+    const realEnd = (item.till.valueOf() - startMs) / widthMs;
+    const end = endIsCut ? (endMs - startMs) / widthMs : realEnd;
+    const realTill = endIsCut ? (0, _moment.default)(endMs) : (0, _moment.default)(item.till);
+    const marginStart = start - lastEnd;
     lastEnd = (item.till.valueOf() - startMs) / widthMs;
     return {
-      item: item,
-      start: start,
-      realStart: realStart,
-      realFrom: realFrom,
-      startIsCut: startIsCut,
+      item,
+      start,
+      realStart,
+      realFrom,
+      startIsCut,
       width: end - start,
-      end: end,
-      realEnd: realEnd,
-      realTill: realTill,
-      endIsCut: endIsCut,
-      marginStart: marginStart
+      end,
+      realEnd,
+      realTill,
+      endIsCut,
+      marginStart
     };
   }) : [];
 }
 
-var generateControlItems = function generateControlItems(from, till, step, startOfStep) {
+const generateControlItems = (from, till, step, startOfStep) => {
   if (!from || !till || !step) {
     return [];
   }
 
-  var steps = Math.max(Math.ceil((till.valueOf() - from.valueOf()) / step.asMilliseconds()), 2);
-  var subtract = (startOfStep.valueOf() - from.valueOf()) % step.asMilliseconds();
+  let steps = Math.max(Math.ceil((till.valueOf() - from.valueOf()) / step.asMilliseconds()), 2);
+  let subtract = (startOfStep.valueOf() - from.valueOf()) % step.asMilliseconds();
 
   if (subtract > 0) {
     subtract -= step.asMilliseconds();
@@ -269,17 +215,15 @@ var generateControlItems = function generateControlItems(from, till, step, start
     steps += 1;
   }
 
-  return new Array(steps).fill(0).map(function (_, index) {
-    return {
-      from: from.clone().add(subtract).add(step.asMilliseconds() * index),
-      till: from.clone().add(subtract).add(step.asMilliseconds() * (index + 1))
-    };
-  });
+  return new Array(steps).fill(0).map((_, index) => ({
+    from: from.clone().add(subtract).add(step.asMilliseconds() * index),
+    till: from.clone().add(subtract).add(step.asMilliseconds() * (index + 1))
+  }));
 };
 
 exports.generateControlItems = generateControlItems;
 
-var generateGridItems = function generateGridItems(from, till, step, containerWidthPx, availableSteps, goalGridWidthPx, startOfStep) {
+const generateGridItems = (from, till, step, containerWidthPx, availableSteps, goalGridWidthPx, startOfStep) => {
   if (!from || !till || !containerWidthPx || !(availableSteps !== null && availableSteps !== void 0 && availableSteps.length) || !goalGridWidthPx || !step || !startOfStep) {
     return {
       bestStep: availableSteps === null || availableSteps === void 0 ? void 0 : availableSteps[0],
@@ -287,23 +231,19 @@ var generateGridItems = function generateGridItems(from, till, step, containerWi
     };
   }
 
-  var stepMs = step.asMilliseconds();
-  var fromMs = from.valueOf();
-  var tillMs = till.valueOf();
-  var timeLengthMs = tillMs - fromMs;
-  var approximateStepsCount = containerWidthPx / goalGridWidthPx;
-  var approximateStepMs = timeLengthMs / approximateStepsCount;
-  var availableStepsDistancesMs = availableSteps.map(function (a) {
-    return Math.abs(a.asMilliseconds() - approximateStepMs);
-  });
-  var smallestDistance = Math.min.apply(Math, _toConsumableArray(availableStepsDistancesMs));
-  var bestStepIndex = availableStepsDistancesMs.findIndex(function (a) {
-    return a === smallestDistance;
-  });
-  var bestStep = availableSteps[bestStepIndex];
-  var subtract = (fromMs + from.utcOffset() * 60 * 1000) % bestStep.asMilliseconds();
-  var startMs = fromMs - subtract;
-  var steps = [];
+  const stepMs = step.asMilliseconds();
+  const fromMs = from.valueOf();
+  const tillMs = till.valueOf();
+  const timeLengthMs = tillMs - fromMs;
+  const approximateStepsCount = containerWidthPx / goalGridWidthPx;
+  const approximateStepMs = timeLengthMs / approximateStepsCount;
+  const availableStepsDistancesMs = availableSteps.map(a => Math.abs(a.asMilliseconds() - approximateStepMs));
+  const smallestDistance = Math.min(...availableStepsDistancesMs);
+  const bestStepIndex = availableStepsDistancesMs.findIndex(a => a === smallestDistance);
+  const bestStep = availableSteps[bestStepIndex];
+  const subtract = (fromMs + from.utcOffset() * 60 * 1000) % bestStep.asMilliseconds();
+  let startMs = fromMs - subtract;
+  let steps = [];
 
   while (startMs <= tillMs) {
     steps = steps.concat(from.clone().add(startMs - fromMs, 'ms'));
@@ -311,14 +251,12 @@ var generateGridItems = function generateGridItems(from, till, step, containerWi
   }
 
   return {
-    items: steps.filter(function (a) {
-      return a.valueOf() > fromMs && a.valueOf() < tillMs;
-    }).map(function (date) {
-      var stepProportion = (date.valueOf() + from.utcOffset() * 60 * 1000) % stepMs / stepMs;
-      var numberOfRoots = 0;
-      var current = stepProportion;
-      var currentTop = 1;
-      var tolerance = 0.001;
+    items: steps.filter(a => a.valueOf() > fromMs && a.valueOf() < tillMs).map(date => {
+      const stepProportion = (date.valueOf() + from.utcOffset() * 60 * 1000) % stepMs / stepMs;
+      let numberOfRoots = 0;
+      let current = stepProportion;
+      let currentTop = 1;
+      let tolerance = 0.001;
 
       while (current > tolerance && current < currentTop - tolerance) {
         numberOfRoots += 1;
@@ -331,12 +269,12 @@ var generateGridItems = function generateGridItems(from, till, step, containerWi
 
       return {
         left: (date.valueOf() - fromMs) / timeLengthMs,
-        date: date,
-        stepProportion: stepProportion,
+        date,
+        stepProportion,
         opacity: 1 / (numberOfRoots || 1)
       };
     }),
-    bestStep: bestStep
+    bestStep
   };
 };
 

package/build/components/bookingCalendar/utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/lib/components/bookingCalendar/utils.ts"],"names":["groupBy","items","iterator","reduce","obj","item","key","hasOwnProperty","push","splitBookingsToLanes","bookings","from","minLanesCount","lanesSource","lanes","length","map","source","bookingsWithoutLaneKey","filter","a","laneKey","undefined","bookingsWithLaneKey","grouped","booking","originalIndex","Object","keys","Number","find","missingLanes","some","l","concat","remainingBookings","sort","b","valueOf","min","bookingIndex","laneIndex","forEach","lane","index","lastTill","till","distances","dist","diff","Math","abs","_min","indexOf","splice","data","shift","Array","fill","_","itemsOverlap","isBefore","isAfter","getItemPositionStyle","marginStart","width","marginLeft","calculateItemsDimensions","lastEnd","widthMs","startMs","endMs","startIsCut","realStart","realFrom","start","endIsCut","realEnd","end","realTill","generateControlItems","step","startOfStep","steps","max","ceil","asMilliseconds","subtract","clone","add","generateGridItems","containerWidthPx","availableSteps","goalGridWidthPx","bestStep","stepMs","fromMs","tillMs","timeLengthMs","approximateStepsCount","approximateStepMs","availableStepsDistancesMs","smallestDistance","bestStepIndex","findIndex","utcOffset","date","stepProportion","numberOfRoots","current","currentTop","tolerance","pow","left","opacity"],"mappings":";;;;;;;;;;;AAAA;;;;;;;;;;;;;;;;;;;;;;AAUO,SAASA,OAAT,CAAoBC,KAApB,EAAgCC,QAAhC,EAAwE;AAC7E,SAAOD,KAAK,CAACE,MAAN,CAAa,UAACC,GAAD,EAAMC,IAAN,EAAe;AACjC,QAAMC,GAAG,GAAGJ,QAAQ,CAACG,IAAD,CAApB;;AACA,QAAI,CAACD,GAAG,CAACG,cAAJ,CAAmBD,GAAnB,CAAL,EAA8B;AAC5BF,MAAAA,GAAG,CAACE,GAAD,CAAH,GAAW,EAAX;AACD;;AACDF,IAAAA,GAAG,CAACE,GAAD,CAAH,CAASE,IAAT,CAAcH,IAAd;AACA,WAAOD,GAAP;AACD,GAPM,EAOJ,EAPI,CAAP;AAQD;;AAqBM,SAASK,oBAAT,CACLC,QADK,EAELC,IAFK,EAGLC,aAHK,EAKL;AAAA,MADAC,WACA,uEAD8C,EAC9C;;AACA,MAAI,CAACH,QAAL,EAAe;AACb,WAAO,EAAP;AACD;;AACD,MAAII,KAA+B,GAAG,EAAtC;;AACA,MAAID,WAAJ,aAAIA,WAAJ,eAAIA,WAAW,CAAEE,MAAjB,EAAyB;AACvBD,IAAAA,KAAK,GAAGD,WAAW,CAACG,GAAZ,CAAgB,UAAAC,MAAM;AAAA,6CACzBA,MADyB;AAE5BhB,QAAAA,KAAK,EAAE;AAFqB;AAAA,KAAtB,CAAR;AAID;;AACD,MAAMiB,sBAAsB,GAAGR,QAAQ,CAACS,MAAT,CAAgB,UAAAC,CAAC;AAAA,WAAIA,CAAC,CAACC,OAAF,KAAcC,SAAlB;AAAA,GAAjB,CAA/B;AACA,MAAMC,mBAAmB,GAAGb,QAAQ,CAACS,MAAT,CAAgB,UAAAC,CAAC;AAAA,WAAIA,CAAC,CAACC,OAAF,KAAcC,SAAlB;AAAA,GAAjB,CAA5B;;AACA,MAAIC,mBAAmB,CAACR,MAAxB,EAAgC;AAC9B,QAAMS,OAAO,GAAGxB,OAAO,CACrBuB,mBAAmB,CAACP,GAApB,CAAwB,UAACS,OAAD,EAAUC,aAAV;AAAA,6CACnBD,OADmB;AAEtBC,QAAAA,aAAa,EAAbA;AAFsB;AAAA,KAAxB,CADqB,EAKrB,UAAAN,CAAC;AAAA,aAAIA,CAAC,CAACC,OAAN;AAAA,KALoB,CAAvB;AAOAP,IAAAA,KAAK,GAAGa,MAAM,CAACC,IAAP,CAAYJ,OAAZ,EAAqBR,GAArB,CAAyB,UAAAV,GAAG;AAAA;AAClCe,QAAAA,OAAO,EAAEQ,MAAM,CAACvB,GAAD,CADmB;AAElCL,QAAAA,KAAK,EAAEuB,OAAO,CAAClB,GAAD;AAFoB,SAG/BO,WAH+B,aAG/BA,WAH+B,uBAG/BA,WAAW,CAAEiB,IAAb,CAAkB,UAAAV,CAAC;AAAA,eAAIA,CAAC,CAACC,OAAF,KAAcQ,MAAM,CAACvB,GAAD,CAAxB;AAAA,OAAnB,CAH+B;AAAA,KAA5B,CAAR;AAKA,QAAMyB,YAAY,GAAGlB,WAAH,aAAGA,WAAH,uBAAGA,WAAW,CAAEM,MAAb,CACnB,UAAAC,CAAC;AAAA,aAAI,CAACN,KAAK,CAACkB,IAAN,CAAW,UAAAC,CAAC;AAAA,eAAIA,CAAC,CAACZ,OAAF,KAAcD,CAAC,CAACC,OAApB;AAAA,OAAZ,CAAL;AAAA,KADkB,CAArB;AAGAP,IAAAA,KAAK,GAAGA,KAAK,CAACoB,MAAN,CAAaH,YAAY,CAACf,GAAb,CAAiB,UAAAI,CAAC;AAAA,6CAAUA,CAAV;AAAanB,QAAAA,KAAK,EAAE;AAApB;AAAA,KAAlB,CAAb,CAAR;AACD;;AACD,MAAIiB,sBAAsB,CAACH,MAA3B,EAAmC;AAAA;AACjC,UAAIoB,iBACsC,GAAGjB,sBAAsB,CAChEF,GAD0C,CACtC,UAACS,OAAD,EAAUC,aAAV;AAAA,+CAAkCD,OAAlC;AAA2CC,UAAAA,aAAa,EAAbA;AAA3C;AAAA,OADsC,EAE1CU,IAF0C,CAErC,UAAChB,CAAD,EAAIiB,CAAJ;AAAA,eAAUjB,CAAC,CAACT,IAAF,CAAO2B,OAAP,KAAmBD,CAAC,CAAC1B,IAAF,CAAO2B,OAAP,EAA7B;AAAA,OAFqC,CAD7C;;AADiC;AAM/B,YAAIC,GAAG,GAAG,cAAV;AACA,YAAIC,YAAY,GAAG,CAAC,CAApB;AACA,YAAIC,SAAS,GAAG,CAAC,CAAjB;AACA3B,QAAAA,KAAK,CAAC4B,OAAN,CAAc,UAACC,IAAD,EAAOC,KAAP,EAAiB;AAAA;;AAC7B,cAAI/B,WAAJ,aAAIA,WAAJ,eAAIA,WAAW,CAAEmB,IAAb,CAAkB,UAAAC,CAAC;AAAA,mBAAIA,CAAC,CAACZ,OAAF,KAAcsB,IAAI,CAACtB,OAAvB;AAAA,WAAnB,CAAJ,EAAwD;AACtD;AACD;;AACD,cAAMwB,QAAQ,sCAAGF,IAAI,CAAC1C,KAAL,CAAW0C,IAAI,CAAC1C,KAAL,CAAWc,MAAX,GAAoB,CAA/B,CAAH,gDAAG,YAAmC+B,IAAtC,+DAA8CnC,IAA5D;AACA,cAAMoC,SAAS,GAAGZ,iBAAiB,CAACnB,GAAlB,CAAsB,UAAAS,OAAO,EAAI;AACjD,gBAAMuB,IAAI,GAAGvB,OAAO,CAACd,IAAR,CAAasC,IAAb,CAAkBJ,QAAlB,CAAb;;AACA,gBAAIF,IAAI,CAAC1C,KAAL,CAAWc,MAAX,KAAsB,CAA1B,EAA6B;AAC3B,qBAAOmC,IAAI,CAACC,GAAL,CAASH,IAAT,CAAP;AACD;;AACD,mBAAOA,IAAP;AACD,WANiB,CAAlB;;AAOA,cAAMI,IAAI,GAAGF,IAAI,CAACX,GAAL,OAAAW,IAAI,qBAAQH,SAAS,CAAC5B,MAAV,CAAiB,UAAAC,CAAC;AAAA,mBAAIA,CAAC,IAAI,CAAT;AAAA,WAAlB,CAAR,EAAjB;;AACA,cAAIgC,IAAI,GAAGb,GAAX,EAAgB;AACdC,YAAAA,YAAY,GAAGO,SAAS,CAACM,OAAV,CAAkBD,IAAlB,CAAf;AACAX,YAAAA,SAAS,GAAGG,KAAZ;AACD;AACF,SAjBD;;AAkBA,YAAIJ,YAAY,IAAI,CAAhB,IAAqBC,SAAS,IAAI,CAAtC,EAAyC;AACvC3B,UAAAA,KAAK,CAAC2B,SAAD,CAAL,CAAiBxC,KAAjB,GAAyBa,KAAK,CAAC2B,SAAD,CAAL,CAAiBxC,KAAjB,CAAuBiC,MAAvB,mBACpBC,iBAAiB,CAACK,YAAD,CADG,EAAzB;AAGAL,UAAAA,iBAAiB,CAACmB,MAAlB,CAAyBd,YAAzB,EAAuC,CAAvC;AACD,SALD,MAKO;AACL1B,UAAAA,KAAK,GAAGA,KAAK,CAACoB,MAAN,CAAa;AACnBjC,YAAAA,KAAK,EAAE,mBAAMkC,iBAAiB,CAAC,CAAD,CAAvB,EADY;AAEnBd,YAAAA,OAAO,EAAEP,KAAK,CAACC,MAFI;AAGnBwC,YAAAA,IAAI,EAAEjC;AAHa,WAAb,CAAR;AAKAa,UAAAA,iBAAiB,CAACqB,KAAlB;AACD;AAvC8B;;AAKjC,aAAOrB,iBAAiB,CAACpB,MAAlB,GAA2B,CAAlC,EAAqC;AAAA;AAmCpC,OAxCgC,CAyCjC;;AACA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AArDqC;AAsDlC;;AACD,OAAK,IAAI6B,KAAK,GAAG,CAAjB,EAAoBA,KAAK,GAAG9B,KAAK,CAACC,MAAlC,EAA0C6B,KAAK,EAA/C,EAAmD;AACjD,QAAMD,IAAI,GAAG7B,KAAK,CAAC8B,KAAD,CAAlB;AACA9B,IAAAA,KAAK,CAAC8B,KAAD,CAAL,CAAa3C,KAAb,GAAqB0C,IAAI,CAAC1C,KAAL,CAAWmC,IAAX,CACnB,UAAChB,CAAD,EAAIiB,CAAJ;AAAA,aAAUjB,CAAC,CAACT,IAAF,CAAO2B,OAAP,KAAmBD,CAAC,CAAC1B,IAAF,CAAO2B,OAAP,EAA7B;AAAA,KADmB,CAArB;AAGD;;AACD,MAAIxB,KAAK,CAACC,MAAN,GAAeH,aAAnB,EAAkC;AAChCE,IAAAA,KAAK,GAAGA,KAAK,CAACoB,MAAN,CACN,IAAIuB,KAAJ,CAAkC7C,aAAa,GAAGE,KAAK,CAACC,MAAxD,EACG2C,IADH,CACQ,IADR,EAEG1C,GAFH,CAEO,UAAC2C,CAAD,EAAIf,KAAJ;AAAA,aAAe;AAClB3C,QAAAA,KAAK,EAAE,EADW;AAElBoB,QAAAA,OAAO,EAAEuB,KAAK,GAAG9B,KAAK,CAACC,MAFL;AAGlBwC,QAAAA,IAAI,EAAE;AAHY,OAAf;AAAA,KAFP,CADM,CAAR;AASD;;AACDzC,EAAAA,KAAK,GAAGA,KAAK,CAACsB,IAAN,CAAW,UAAChB,CAAD,EAAIiB,CAAJ;AAAA,WAAUjB,CAAC,CAACC,OAAF,GAAYgB,CAAC,CAAChB,OAAxB;AAAA,GAAX,CAAR;AACA,SAAOP,KAAP;AACD;;AAEM,SAAS8C,YAAT,CAAsDxC,CAAtD,EAA4DiB,CAA5D,EAAkE;AACvE,MAAI,EAACjB,CAAD,aAACA,CAAD,eAACA,CAAC,CAAET,IAAJ,KAAY,EAACS,CAAD,aAACA,CAAD,eAACA,CAAC,CAAE0B,IAAJ,CAAZ,IAAwB,EAACT,CAAD,aAACA,CAAD,eAACA,CAAC,CAAE1B,IAAJ,CAAxB,IAAoC,EAAC0B,CAAD,aAACA,CAAD,eAACA,CAAC,CAAES,IAAJ,CAAxC,EAAkD;AAChD,WAAO,KAAP;AACD;;AACD,MAAIT,CAAC,CAACS,IAAF,CAAOe,QAAP,CAAgBzC,CAAC,CAACT,IAAlB,CAAJ,EAA6B;AAC3B,WAAO,KAAP;AACD;;AACD,MAAI0B,CAAC,CAAC1B,IAAF,CAAOmD,OAAP,CAAe1C,CAAC,CAAC0B,IAAjB,CAAJ,EAA4B;AAC1B,WAAO,KAAP;AACD;;AACD,SAAO,IAAP;AACD;;AAEM,IAAMiB,oBAAoB,GAAG,SAAvBA,oBAAuB,CAACC,WAAD,EAAsBC,KAAtB;AAAA,SACjC;AACCC,IAAAA,UAAU,YAAKF,WAAW,GAAG,GAAnB,MADX;AAECC,IAAAA,KAAK,YAAKA,KAAK,GAAG,GAAb;AAFN,GADiC;AAAA,CAA7B;;;;AAMA,SAASE,wBAAT,CACLlE,KADK,EAELU,IAFK,EAGLmC,IAHK,EAIL;AACA,MAAIsB,OAAO,GAAG,CAAd;AACA,MAAMC,OAAO,GAAGvB,IAAI,CAACR,OAAL,KAAiB3B,IAAI,CAAC2B,OAAL,EAAjC;AACA,MAAMgC,OAAO,GAAG3D,IAAI,CAAC2B,OAAL,EAAhB;AACA,MAAMiC,KAAK,GAAGzB,IAAI,CAACR,OAAL,EAAd;AACA,SAAO+B,OAAO,GAAG,CAAV,GACHpE,KADG,aACHA,KADG,uBACHA,KAAK,CAAEe,GAAP,CAAW,UAAAX,IAAI,EAAI;AACjB,QAAMmE,UAAU,GAAGnE,IAAI,CAACM,IAAL,CAAU2B,OAAV,KAAsBgC,OAAzC;AACA,QAAMG,SAAS,GAAG,CAACpE,IAAI,CAACM,IAAL,CAAU2B,OAAV,KAAsBgC,OAAvB,IAAkCD,OAApD;AACA,QAAMK,QAAQ,GAAGF,UAAU,GAAG,qBAAOF,OAAP,CAAH,GAAqB,qBAAOjE,IAAI,CAACM,IAAZ,CAAhD;AACA,QAAMgE,KAAK,GAAGH,UAAU,GAAG,CAAH,GAAOC,SAA/B;AACA,QAAMG,QAAQ,GAAGvE,IAAI,CAACyC,IAAL,CAAUR,OAAV,KAAsBiC,KAAvC;AACA,QAAMM,OAAO,GAAG,CAACxE,IAAI,CAACyC,IAAL,CAAUR,OAAV,KAAsBgC,OAAvB,IAAkCD,OAAlD;AACA,QAAMS,GAAG,GAAGF,QAAQ,GAAG,CAACL,KAAK,GAAGD,OAAT,IAAoBD,OAAvB,GAAiCQ,OAArD;AACA,QAAME,QAAQ,GAAGH,QAAQ,GAAG,qBAAOL,KAAP,CAAH,GAAmB,qBAAOlE,IAAI,CAACyC,IAAZ,CAA5C;AACA,QAAMkB,WAAW,GAAGW,KAAK,GAAGP,OAA5B;AACAA,IAAAA,OAAO,GAAG,CAAC/D,IAAI,CAACyC,IAAL,CAAUR,OAAV,KAAsBgC,OAAvB,IAAkCD,OAA5C;AACA,WAAO;AACLhE,MAAAA,IAAI,EAAJA,IADK;AAELsE,MAAAA,KAAK,EAALA,KAFK;AAGLF,MAAAA,SAAS,EAATA,SAHK;AAILC,MAAAA,QAAQ,EAARA,QAJK;AAKLF,MAAAA,UAAU,EAAVA,UALK;AAMLP,MAAAA,KAAK,EAAEa,GAAG,GAAGH,KANR;AAOLG,MAAAA,GAAG,EAAHA,GAPK;AAQLD,MAAAA,OAAO,EAAPA,OARK;AASLE,MAAAA,QAAQ,EAARA,QATK;AAULH,MAAAA,QAAQ,EAARA,QAVK;AAWLZ,MAAAA,WAAW,EAAXA;AAXK,KAAP;AAaD,GAxBD,CADG,GA0BH,EA1BJ;AA2BD;;AAEM,IAAMgB,oBAAoB,GAAG,SAAvBA,oBAAuB,CAClCrE,IADkC,EAElCmC,IAFkC,EAGlCmC,IAHkC,EAIlCC,WAJkC,EAK/B;AACH,MAAI,CAACvE,IAAD,IAAS,CAACmC,IAAV,IAAkB,CAACmC,IAAvB,EAA6B;AAC3B,WAAO,EAAP;AACD;;AACD,MAAIE,KAAK,GAAGjC,IAAI,CAACkC,GAAL,CACVlC,IAAI,CAACmC,IAAL,CAAU,CAACvC,IAAI,CAACR,OAAL,KAAiB3B,IAAI,CAAC2B,OAAL,EAAlB,IAAoC2C,IAAI,CAACK,cAAL,EAA9C,CADU,EAEV,CAFU,CAAZ;AAIA,MAAIC,QAAQ,GACV,CAACL,WAAW,CAAC5C,OAAZ,KAAwB3B,IAAI,CAAC2B,OAAL,EAAzB,IAA2C2C,IAAI,CAACK,cAAL,EAD7C;;AAEA,MAAIC,QAAQ,GAAG,CAAf,EAAkB;AAChBA,IAAAA,QAAQ,IAAIN,IAAI,CAACK,cAAL,EAAZ;AACD;;AACD,MAAIxC,IAAI,CAACR,OAAL,KAAiB3B,IAAI,CAAC2B,OAAL,EAAjB,GAAkC2C,IAAI,CAACK,cAAL,EAAtC,EAA6D;AAC3DH,IAAAA,KAAK,IAAI,CAAT;AACD;;AACD,SAAO,IAAI1B,KAAJ,CAAU0B,KAAV,EAAiBzB,IAAjB,CAAsB,CAAtB,EAAyB1C,GAAzB,CAA6B,UAAC2C,CAAD,EAAIf,KAAJ;AAAA,WAAe;AACjDjC,MAAAA,IAAI,EAAEA,IAAI,CAAC6E,KAAL,GACHC,GADG,CACCF,QADD,EAEHE,GAFG,CAECR,IAAI,CAACK,cAAL,KAAwB1C,KAFzB,CAD2C;AAIjDE,MAAAA,IAAI,EAAEnC,IAAI,CAAC6E,KAAL,GACHC,GADG,CACCF,QADD,EAEHE,GAFG,CAECR,IAAI,CAACK,cAAL,MAAyB1C,KAAK,GAAG,CAAjC,CAFD;AAJ2C,KAAf;AAAA,GAA7B,CAAP;AAQD,CA7BM;;;;AAsCA,IAAM8C,iBAAiB,GAAG,SAApBA,iBAAoB,CAC/B/E,IAD+B,EAE/BmC,IAF+B,EAG/BmC,IAH+B,EAI/BU,gBAJ+B,EAK/BC,cAL+B,EAM/BC,eAN+B,EAO/BX,WAP+B,EAQe;AAC9C,MACE,CAACvE,IAAD,IACA,CAACmC,IADD,IAEA,CAAC6C,gBAFD,IAGA,EAACC,cAAD,aAACA,cAAD,eAACA,cAAc,CAAE7E,MAAjB,CAHA,IAIA,CAAC8E,eAJD,IAKA,CAACZ,IALD,IAMA,CAACC,WAPH,EAQE;AACA,WAAO;AAAEY,MAAAA,QAAQ,EAAEF,cAAF,aAAEA,cAAF,uBAAEA,cAAc,CAAG,CAAH,CAA1B;AAAiC3F,MAAAA,KAAK,EAAE;AAAxC,KAAP;AACD;;AACD,MAAM8F,MAAM,GAAGd,IAAI,CAACK,cAAL,EAAf;AACA,MAAMU,MAAM,GAAGrF,IAAI,CAAC2B,OAAL,EAAf;AACA,MAAM2D,MAAM,GAAGnD,IAAI,CAACR,OAAL,EAAf;AACA,MAAM4D,YAAY,GAAGD,MAAM,GAAGD,MAA9B;AACA,MAAMG,qBAAqB,GAAGR,gBAAgB,GAAGE,eAAjD;AACA,MAAMO,iBAAiB,GAAGF,YAAY,GAAGC,qBAAzC;AACA,MAAME,yBAAyB,GAAGT,cAAc,CAAC5E,GAAf,CAAmB,UAAAI,CAAC;AAAA,WACpD8B,IAAI,CAACC,GAAL,CAAS/B,CAAC,CAACkE,cAAF,KAAqBc,iBAA9B,CADoD;AAAA,GAApB,CAAlC;AAGA,MAAME,gBAAgB,GAAGpD,IAAI,CAACX,GAAL,OAAAW,IAAI,qBAAQmD,yBAAR,EAA7B;AACA,MAAME,aAAa,GAAGF,yBAAyB,CAACG,SAA1B,CACpB,UAAApF,CAAC;AAAA,WAAIA,CAAC,KAAKkF,gBAAV;AAAA,GADmB,CAAtB;AAGA,MAAMR,QAAQ,GAAGF,cAAc,CAACW,aAAD,CAA/B;AACA,MAAMhB,QAAQ,GACZ,CAACS,MAAM,GAAGrF,IAAI,CAAC8F,SAAL,KAAmB,EAAnB,GAAwB,IAAlC,IAA0CX,QAAQ,CAACR,cAAT,EAD5C;AAEA,MAAIhB,OAAO,GAAG0B,MAAM,GAAGT,QAAvB;AACA,MAAIJ,KAAe,GAAG,EAAtB;;AACA,SAAOb,OAAO,IAAI2B,MAAlB,EAA0B;AACxBd,IAAAA,KAAK,GAAGA,KAAK,CAACjD,MAAN,CAAavB,IAAI,CAAC6E,KAAL,GAAaC,GAAb,CAAiBnB,OAAO,GAAG0B,MAA3B,EAAmC,IAAnC,CAAb,CAAR;AACA1B,IAAAA,OAAO,IAAIwB,QAAQ,CAACR,cAAT,EAAX;AACD;;AACD,SAAO;AACLrF,IAAAA,KAAK,EAAEkF,KAAK,CACThE,MADI,CACG,UAAAC,CAAC;AAAA,aAAIA,CAAC,CAACkB,OAAF,KAAc0D,MAAd,IAAwB5E,CAAC,CAACkB,OAAF,KAAc2D,MAA1C;AAAA,KADJ,EAEJjF,GAFI,CAEA,UAAA0F,IAAI,EAAI;AACX,UAAMC,cAAc,GACjB,CAACD,IAAI,CAACpE,OAAL,KAAiB3B,IAAI,CAAC8F,SAAL,KAAmB,EAAnB,GAAwB,IAA1C,IAAkDV,MAAnD,GAA6DA,MAD/D;AAEA,UAAIa,aAAa,GAAG,CAApB;AACA,UAAIC,OAAO,GAAGF,cAAd;AACA,UAAIG,UAAU,GAAG,CAAjB;AACA,UAAIC,SAAS,GAAG,KAAhB;;AACA,aAAOF,OAAO,GAAGE,SAAV,IAAuBF,OAAO,GAAGC,UAAU,GAAGC,SAArD,EAAgE;AAC9DH,QAAAA,aAAa,IAAI,CAAjB;AACAE,QAAAA,UAAU,GAAG,IAAI5D,IAAI,CAAC8D,GAAL,CAAS,CAAT,EAAYJ,aAAZ,CAAjB;;AACA,YAAIC,OAAO,GAAGC,UAAd,EAA0B;AACxBD,UAAAA,OAAO,IAAIC,UAAX;AACD;AACF;;AACD,aAAO;AACLG,QAAAA,IAAI,EAAE,CAACP,IAAI,CAACpE,OAAL,KAAiB0D,MAAlB,IAA4BE,YAD7B;AAELQ,QAAAA,IAAI,EAAJA,IAFK;AAGLC,QAAAA,cAAc,EAAdA,cAHK;AAILO,QAAAA,OAAO,EAAE,KAAKN,aAAa,IAAI,CAAtB;AAJJ,OAAP;AAMD,KAtBI,CADF;AAwBLd,IAAAA,QAAQ,EAARA;AAxBK,GAAP;AA0BD,CApEM","sourcesContent":["import moment, { Moment, Duration } from 'moment';\r\nimport { BookingCalendarItemProps } from './bookingCalendarItem';\r\nimport { BookingCalendarLaneProps } from './bookingCalendarLane';\r\nimport { BookingCalendarLaneHeaderProps } from './bookingCalendarLaneHeader';\r\nimport { BookingCalendarRenderItemProps } from './bookingCalendarRenderItem';\r\nimport {\r\n  BookingCalendarItemT,\r\n  BookingCalendarItemWithOriginalIndexT,\r\n} from './common';\r\n\r\nexport function groupBy<T>(items: T[], iterator: (item: T) => number | string) {\r\n  return items.reduce((obj, item) => {\r\n    const key = iterator(item);\r\n    if (!obj.hasOwnProperty(key)) {\r\n      obj[key] = [];\r\n    }\r\n    obj[key].push(item);\r\n    return obj;\r\n  }, {});\r\n}\r\n\r\nexport interface LaneSourceData<T extends BookingCalendarItemT, TLaneData> {\r\n  laneKey: number;\r\n  data?: TLaneData;\r\n  rowClassName?: string;\r\n  BookingCalendarItem?: React.ComponentType<BookingCalendarItemProps<T>>;\r\n  BookingCalendarRenderItem?: React.ComponentType<\r\n    BookingCalendarRenderItemProps<T>\r\n  >;\r\n  BookingCalendarLaneHeader?: React.ComponentType<\r\n    BookingCalendarLaneHeaderProps<TLaneData>\r\n  >;\r\n  BookingCalendarLane?: React.ComponentType<BookingCalendarLaneProps<T>>;\r\n}\r\n\r\nexport interface LaneData<T extends BookingCalendarItemT, TLaneData>\r\n  extends LaneSourceData<T, TLaneData> {\r\n  items: T[];\r\n}\r\n\r\nexport function splitBookingsToLanes<T extends BookingCalendarItemT, TLaneData>(\r\n  bookings: T[],\r\n  from: Moment,\r\n  minLanesCount: number,\r\n  lanesSource: LaneSourceData<T, TLaneData>[] = []\r\n) {\r\n  if (!bookings) {\r\n    return [];\r\n  }\r\n  let lanes: LaneData<T, TLaneData>[] = [];\r\n  if (lanesSource?.length) {\r\n    lanes = lanesSource.map(source => ({\r\n      ...source,\r\n      items: [],\r\n    }));\r\n  }\r\n  const bookingsWithoutLaneKey = bookings.filter(a => a.laneKey === undefined);\r\n  const bookingsWithLaneKey = bookings.filter(a => a.laneKey !== undefined);\r\n  if (bookingsWithLaneKey.length) {\r\n    const grouped = groupBy(\r\n      bookingsWithLaneKey.map((booking, originalIndex) => ({\r\n        ...booking,\r\n        originalIndex,\r\n      })),\r\n      a => a.laneKey\r\n    );\r\n    lanes = Object.keys(grouped).map(key => ({\r\n      laneKey: Number(key),\r\n      items: grouped[key],\r\n      ...lanesSource?.find(a => a.laneKey === Number(key)),\r\n    }));\r\n    const missingLanes = lanesSource?.filter(\r\n      a => !lanes.some(l => l.laneKey === a.laneKey)\r\n    );\r\n    lanes = lanes.concat(missingLanes.map(a => ({ ...a, items: [] })));\r\n  }\r\n  if (bookingsWithoutLaneKey.length) {\r\n    let remainingBookings: (T &\r\n      BookingCalendarItemWithOriginalIndexT)[] = bookingsWithoutLaneKey\r\n      .map((booking, originalIndex) => ({ ...booking, originalIndex }))\r\n      .sort((a, b) => a.from.valueOf() - b.from.valueOf());\r\n    while (remainingBookings.length > 0) {\r\n      let min = 99999999999999;\r\n      let bookingIndex = -1;\r\n      let laneIndex = -1;\r\n      lanes.forEach((lane, index) => {\r\n        if (lanesSource?.some(l => l.laneKey === lane.laneKey)) {\r\n          return;\r\n        }\r\n        const lastTill = lane.items[lane.items.length - 1]?.till ?? from;\r\n        const distances = remainingBookings.map(booking => {\r\n          const dist = booking.from.diff(lastTill);\r\n          if (lane.items.length === 0) {\r\n            return Math.abs(dist);\r\n          }\r\n          return dist;\r\n        });\r\n        const _min = Math.min(...distances.filter(a => a >= 0));\r\n        if (_min < min) {\r\n          bookingIndex = distances.indexOf(_min);\r\n          laneIndex = index;\r\n        }\r\n      });\r\n      if (bookingIndex >= 0 && laneIndex >= 0) {\r\n        lanes[laneIndex].items = lanes[laneIndex].items.concat({\r\n          ...remainingBookings[bookingIndex],\r\n        });\r\n        remainingBookings.splice(bookingIndex, 1);\r\n      } else {\r\n        lanes = lanes.concat({\r\n          items: [{ ...remainingBookings[0] }],\r\n          laneKey: lanes.length,\r\n          data: undefined,\r\n        });\r\n        remainingBookings.shift();\r\n      }\r\n    }\r\n    // Naive solution that is much less computationally intensive but yields more lanes than necessary\r\n    /*bookings.forEach((booking, originalIndex) => {\r\n    let found = false;\r\n    lanes.forEach((lane, index) => {\r\n      if (!lane.some(i => itemsOverlap(booking, i))) {\r\n        lanes[index] = lanes[index].concat({ ...booking, originalIndex });\r\n        found = true;\r\n      }\r\n    });\r\n    if (!found) {\r\n      lanes = lanes.concat([[{ ...booking, originalIndex }]]);\r\n    }\r\n  });*/\r\n  }\r\n  for (let index = 0; index < lanes.length; index++) {\r\n    const lane = lanes[index];\r\n    lanes[index].items = lane.items.sort(\r\n      (a, b) => a.from.valueOf() - b.from.valueOf()\r\n    );\r\n  }\r\n  if (lanes.length < minLanesCount) {\r\n    lanes = lanes.concat(\r\n      new Array<LaneData<T, TLaneData>>(minLanesCount - lanes.length)\r\n        .fill(null)\r\n        .map((_, index) => ({\r\n          items: [],\r\n          laneKey: index + lanes.length,\r\n          data: null,\r\n        }))\r\n    );\r\n  }\r\n  lanes = lanes.sort((a, b) => a.laneKey - b.laneKey);\r\n  return lanes;\r\n}\r\n\r\nexport function itemsOverlap<T extends BookingCalendarItemT>(a: T, b: T) {\r\n  if (!a?.from || !a?.till || !b?.from || !b?.till) {\r\n    return false;\r\n  }\r\n  if (b.till.isBefore(a.from)) {\r\n    return false;\r\n  }\r\n  if (b.from.isAfter(a.till)) {\r\n    return false;\r\n  }\r\n  return true;\r\n}\r\n\r\nexport const getItemPositionStyle = (marginStart: number, width: number) =>\r\n  ({\r\n    marginLeft: `${marginStart * 100}%`,\r\n    width: `${width * 100}%`,\r\n  } as React.CSSProperties);\r\n\r\nexport function calculateItemsDimensions<T extends BookingCalendarItemT>(\r\n  items: T[],\r\n  from: Moment,\r\n  till: Moment\r\n) {\r\n  let lastEnd = 0;\r\n  const widthMs = till.valueOf() - from.valueOf();\r\n  const startMs = from.valueOf();\r\n  const endMs = till.valueOf();\r\n  return widthMs > 0\r\n    ? items?.map(item => {\r\n        const startIsCut = item.from.valueOf() < startMs;\r\n        const realStart = (item.from.valueOf() - startMs) / widthMs;\r\n        const realFrom = startIsCut ? moment(startMs) : moment(item.from);\r\n        const start = startIsCut ? 0 : realStart;\r\n        const endIsCut = item.till.valueOf() > endMs;\r\n        const realEnd = (item.till.valueOf() - startMs) / widthMs;\r\n        const end = endIsCut ? (endMs - startMs) / widthMs : realEnd;\r\n        const realTill = endIsCut ? moment(endMs) : moment(item.till);\r\n        const marginStart = start - lastEnd;\r\n        lastEnd = (item.till.valueOf() - startMs) / widthMs;\r\n        return {\r\n          item,\r\n          start,\r\n          realStart,\r\n          realFrom,\r\n          startIsCut,\r\n          width: end - start,\r\n          end,\r\n          realEnd,\r\n          realTill,\r\n          endIsCut,\r\n          marginStart,\r\n        };\r\n      })\r\n    : [];\r\n}\r\n\r\nexport const generateControlItems = (\r\n  from: Moment,\r\n  till: Moment,\r\n  step: Duration,\r\n  startOfStep: Moment\r\n) => {\r\n  if (!from || !till || !step) {\r\n    return [];\r\n  }\r\n  let steps = Math.max(\r\n    Math.ceil((till.valueOf() - from.valueOf()) / step.asMilliseconds()),\r\n    2\r\n  );\r\n  let subtract =\r\n    (startOfStep.valueOf() - from.valueOf()) % step.asMilliseconds();\r\n  if (subtract > 0) {\r\n    subtract -= step.asMilliseconds();\r\n  }\r\n  if (till.valueOf() - from.valueOf() > step.asMilliseconds()) {\r\n    steps += 1;\r\n  }\r\n  return new Array(steps).fill(0).map((_, index) => ({\r\n    from: from.clone()\r\n      .add(subtract)\r\n      .add(step.asMilliseconds() * index),\r\n    till: from.clone()\r\n      .add(subtract)\r\n      .add(step.asMilliseconds() * (index + 1)),\r\n  }));\r\n};\r\n\r\nexport interface GridItem {\r\n  left: number;\r\n  date: Moment;\r\n  stepProportion: number;\r\n  opacity: number;\r\n}\r\n\r\nexport const generateGridItems = (\r\n  from: Moment,\r\n  till: Moment,\r\n  step: Duration,\r\n  containerWidthPx: number,\r\n  availableSteps: Duration[],\r\n  goalGridWidthPx: number,\r\n  startOfStep: Moment\r\n): { items: GridItem[]; bestStep: Duration } => {\r\n  if (\r\n    !from ||\r\n    !till ||\r\n    !containerWidthPx ||\r\n    !availableSteps?.length ||\r\n    !goalGridWidthPx ||\r\n    !step ||\r\n    !startOfStep\r\n  ) {\r\n    return { bestStep: availableSteps?.[0], items: [] };\r\n  }\r\n  const stepMs = step.asMilliseconds();\r\n  const fromMs = from.valueOf();\r\n  const tillMs = till.valueOf();\r\n  const timeLengthMs = tillMs - fromMs;\r\n  const approximateStepsCount = containerWidthPx / goalGridWidthPx;\r\n  const approximateStepMs = timeLengthMs / approximateStepsCount;\r\n  const availableStepsDistancesMs = availableSteps.map(a =>\r\n    Math.abs(a.asMilliseconds() - approximateStepMs)\r\n  );\r\n  const smallestDistance = Math.min(...availableStepsDistancesMs);\r\n  const bestStepIndex = availableStepsDistancesMs.findIndex(\r\n    a => a === smallestDistance\r\n  );\r\n  const bestStep = availableSteps[bestStepIndex];\r\n  const subtract =\r\n    (fromMs + from.utcOffset() * 60 * 1000) % bestStep.asMilliseconds();\r\n  let startMs = fromMs - subtract;\r\n  let steps: Moment[] = [];\r\n  while (startMs <= tillMs) {\r\n    steps = steps.concat(from.clone().add(startMs - fromMs, 'ms'));\r\n    startMs += bestStep.asMilliseconds();\r\n  }\r\n  return {\r\n    items: steps\r\n      .filter(a => a.valueOf() > fromMs && a.valueOf() < tillMs)\r\n      .map(date => {\r\n        const stepProportion =\r\n          ((date.valueOf() + from.utcOffset() * 60 * 1000) % stepMs) / stepMs;\r\n        let numberOfRoots = 0;\r\n        let current = stepProportion;\r\n        let currentTop = 1;\r\n        let tolerance = 0.001;\r\n        while (current > tolerance && current < currentTop - tolerance) {\r\n          numberOfRoots += 1;\r\n          currentTop = 1 / Math.pow(2, numberOfRoots);\r\n          if (current > currentTop) {\r\n            current -= currentTop;\r\n          }\r\n        }\r\n        return {\r\n          left: (date.valueOf() - fromMs) / timeLengthMs,\r\n          date,\r\n          stepProportion,\r\n          opacity: 1 / (numberOfRoots || 1),\r\n        };\r\n      }),\r\n    bestStep,\r\n  };\r\n};\r\n"],"file":"utils.js"}
+{"version":3,"file":"utils.js","names":["groupBy","items","iterator","reduce","obj","item","key","hasOwnProperty","push","splitBookingsToLanes","bookings","from","minLanesCount","lanesSource","lanes","length","map","source","bookingsWithoutLaneKey","filter","a","laneKey","undefined","bookingsWithLaneKey","grouped","booking","originalIndex","Object","keys","Number","find","missingLanes","some","l","concat","remainingBookings","sort","b","valueOf","min","bookingIndex","laneIndex","forEach","lane","index","lastTill","till","distances","dist","diff","Math","abs","_min","indexOf","splice","data","shift","Array","fill","_","itemsOverlap","isBefore","isAfter","getItemPositionStyle","marginStart","width","marginLeft","calculateItemsDimensions","lastEnd","widthMs","startMs","endMs","startIsCut","realStart","realFrom","moment","start","endIsCut","realEnd","end","realTill","generateControlItems","step","startOfStep","steps","max","ceil","asMilliseconds","subtract","clone","add","generateGridItems","containerWidthPx","availableSteps","goalGridWidthPx","bestStep","stepMs","fromMs","tillMs","timeLengthMs","approximateStepsCount","approximateStepMs","availableStepsDistancesMs","smallestDistance","bestStepIndex","findIndex","utcOffset","date","stepProportion","numberOfRoots","current","currentTop","tolerance","pow","left","opacity"],"sources":["../../../src/lib/components/bookingCalendar/utils.ts"],"sourcesContent":["import moment, { Moment, Duration } from 'moment';\r\nimport { BookingCalendarItemProps } from './bookingCalendarItem';\r\nimport { BookingCalendarLaneProps } from './bookingCalendarLane';\r\nimport { BookingCalendarLaneHeaderProps } from './bookingCalendarLaneHeader';\r\nimport { BookingCalendarRenderItemProps } from './bookingCalendarRenderItem';\r\nimport {\r\n  BookingCalendarItemT,\r\n  BookingCalendarItemWithOriginalIndexT,\r\n} from './common';\r\n\r\nexport function groupBy<T>(items: T[], iterator: (item: T) => number | string) {\r\n  return items.reduce((obj, item) => {\r\n    const key = iterator(item);\r\n    if (!obj.hasOwnProperty(key)) {\r\n      obj[key] = [];\r\n    }\r\n    obj[key].push(item);\r\n    return obj;\r\n  }, {});\r\n}\r\n\r\nexport interface LaneSourceData<T extends BookingCalendarItemT, TLaneData> {\r\n  laneKey: number;\r\n  data?: TLaneData;\r\n  rowClassName?: string;\r\n  BookingCalendarItem?: React.ComponentType<BookingCalendarItemProps<T>>;\r\n  BookingCalendarRenderItem?: React.ComponentType<\r\n    BookingCalendarRenderItemProps<T>\r\n  >;\r\n  BookingCalendarLaneHeader?: React.ComponentType<\r\n    BookingCalendarLaneHeaderProps<TLaneData>\r\n  >;\r\n  BookingCalendarLane?: React.ComponentType<BookingCalendarLaneProps<T>>;\r\n}\r\n\r\nexport interface LaneData<T extends BookingCalendarItemT, TLaneData>\r\n  extends LaneSourceData<T, TLaneData> {\r\n  items: T[];\r\n}\r\n\r\nexport function splitBookingsToLanes<T extends BookingCalendarItemT, TLaneData>(\r\n  bookings: T[],\r\n  from: Moment,\r\n  minLanesCount: number,\r\n  lanesSource: LaneSourceData<T, TLaneData>[] = []\r\n) {\r\n  if (!bookings) {\r\n    return [];\r\n  }\r\n  let lanes: LaneData<T, TLaneData>[] = [];\r\n  if (lanesSource?.length) {\r\n    lanes = lanesSource.map(source => ({\r\n      ...source,\r\n      items: [],\r\n    }));\r\n  }\r\n  const bookingsWithoutLaneKey = bookings.filter(a => a.laneKey === undefined);\r\n  const bookingsWithLaneKey = bookings.filter(a => a.laneKey !== undefined);\r\n  if (bookingsWithLaneKey.length) {\r\n    const grouped = groupBy(\r\n      bookingsWithLaneKey.map((booking, originalIndex) => ({\r\n        ...booking,\r\n        originalIndex,\r\n      })),\r\n      a => a.laneKey\r\n    );\r\n    lanes = Object.keys(grouped).map(key => ({\r\n      laneKey: Number(key),\r\n      items: grouped[key],\r\n      ...lanesSource?.find(a => a.laneKey === Number(key)),\r\n    }));\r\n    const missingLanes = lanesSource?.filter(\r\n      a => !lanes.some(l => l.laneKey === a.laneKey)\r\n    );\r\n    lanes = lanes.concat(missingLanes.map(a => ({ ...a, items: [] })));\r\n  }\r\n  if (bookingsWithoutLaneKey.length) {\r\n    let remainingBookings: (T &\r\n      BookingCalendarItemWithOriginalIndexT)[] = bookingsWithoutLaneKey\r\n      .map((booking, originalIndex) => ({ ...booking, originalIndex }))\r\n      .sort((a, b) => a.from.valueOf() - b.from.valueOf());\r\n    while (remainingBookings.length > 0) {\r\n      let min = 99999999999999;\r\n      let bookingIndex = -1;\r\n      let laneIndex = -1;\r\n      lanes.forEach((lane, index) => {\r\n        if (lanesSource?.some(l => l.laneKey === lane.laneKey)) {\r\n          return;\r\n        }\r\n        const lastTill = lane.items[lane.items.length - 1]?.till ?? from;\r\n        const distances = remainingBookings.map(booking => {\r\n          const dist = booking.from.diff(lastTill);\r\n          if (lane.items.length === 0) {\r\n            return Math.abs(dist);\r\n          }\r\n          return dist;\r\n        });\r\n        const _min = Math.min(...distances.filter(a => a >= 0));\r\n        if (_min < min) {\r\n          bookingIndex = distances.indexOf(_min);\r\n          laneIndex = index;\r\n        }\r\n      });\r\n      if (bookingIndex >= 0 && laneIndex >= 0) {\r\n        lanes[laneIndex].items = lanes[laneIndex].items.concat({\r\n          ...remainingBookings[bookingIndex],\r\n        });\r\n        remainingBookings.splice(bookingIndex, 1);\r\n      } else {\r\n        lanes = lanes.concat({\r\n          items: [{ ...remainingBookings[0] }],\r\n          laneKey: lanes.length,\r\n          data: undefined,\r\n        });\r\n        remainingBookings.shift();\r\n      }\r\n    }\r\n    // Naive solution that is much less computationally intensive but yields more lanes than necessary\r\n    /*bookings.forEach((booking, originalIndex) => {\r\n    let found = false;\r\n    lanes.forEach((lane, index) => {\r\n      if (!lane.some(i => itemsOverlap(booking, i))) {\r\n        lanes[index] = lanes[index].concat({ ...booking, originalIndex });\r\n        found = true;\r\n      }\r\n    });\r\n    if (!found) {\r\n      lanes = lanes.concat([[{ ...booking, originalIndex }]]);\r\n    }\r\n  });*/\r\n  }\r\n  for (let index = 0; index < lanes.length; index++) {\r\n    const lane = lanes[index];\r\n    lanes[index].items = lane.items.sort(\r\n      (a, b) => a.from.valueOf() - b.from.valueOf()\r\n    );\r\n  }\r\n  if (lanes.length < minLanesCount) {\r\n    lanes = lanes.concat(\r\n      new Array<LaneData<T, TLaneData>>(minLanesCount - lanes.length)\r\n        .fill(null)\r\n        .map((_, index) => ({\r\n          items: [],\r\n          laneKey: index + lanes.length,\r\n          data: null,\r\n        }))\r\n    );\r\n  }\r\n  lanes = lanes.sort((a, b) => a.laneKey - b.laneKey);\r\n  return lanes;\r\n}\r\n\r\nexport function itemsOverlap<T extends BookingCalendarItemT>(a: T, b: T) {\r\n  if (!a?.from || !a?.till || !b?.from || !b?.till) {\r\n    return false;\r\n  }\r\n  if (b.till.isBefore(a.from)) {\r\n    return false;\r\n  }\r\n  if (b.from.isAfter(a.till)) {\r\n    return false;\r\n  }\r\n  return true;\r\n}\r\n\r\nexport const getItemPositionStyle = (marginStart: number, width: number) =>\r\n  ({\r\n    marginLeft: `${marginStart * 100}%`,\r\n    width: `${width * 100}%`,\r\n  } as React.CSSProperties);\r\n\r\nexport function calculateItemsDimensions<T extends BookingCalendarItemT>(\r\n  items: T[],\r\n  from: Moment,\r\n  till: Moment\r\n) {\r\n  let lastEnd = 0;\r\n  const widthMs = till.valueOf() - from.valueOf();\r\n  const startMs = from.valueOf();\r\n  const endMs = till.valueOf();\r\n  return widthMs > 0\r\n    ? items?.map(item => {\r\n        const startIsCut = item.from.valueOf() < startMs;\r\n        const realStart = (item.from.valueOf() - startMs) / widthMs;\r\n        const realFrom = startIsCut ? moment(startMs) : moment(item.from);\r\n        const start = startIsCut ? 0 : realStart;\r\n        const endIsCut = item.till.valueOf() > endMs;\r\n        const realEnd = (item.till.valueOf() - startMs) / widthMs;\r\n        const end = endIsCut ? (endMs - startMs) / widthMs : realEnd;\r\n        const realTill = endIsCut ? moment(endMs) : moment(item.till);\r\n        const marginStart = start - lastEnd;\r\n        lastEnd = (item.till.valueOf() - startMs) / widthMs;\r\n        return {\r\n          item,\r\n          start,\r\n          realStart,\r\n          realFrom,\r\n          startIsCut,\r\n          width: end - start,\r\n          end,\r\n          realEnd,\r\n          realTill,\r\n          endIsCut,\r\n          marginStart,\r\n        };\r\n      })\r\n    : [];\r\n}\r\n\r\nexport const generateControlItems = (\r\n  from: Moment,\r\n  till: Moment,\r\n  step: Duration,\r\n  startOfStep: Moment\r\n) => {\r\n  if (!from || !till || !step) {\r\n    return [];\r\n  }\r\n  let steps = Math.max(\r\n    Math.ceil((till.valueOf() - from.valueOf()) / step.asMilliseconds()),\r\n    2\r\n  );\r\n  let subtract =\r\n    (startOfStep.valueOf() - from.valueOf()) % step.asMilliseconds();\r\n  if (subtract > 0) {\r\n    subtract -= step.asMilliseconds();\r\n  }\r\n  if (till.valueOf() - from.valueOf() > step.asMilliseconds()) {\r\n    steps += 1;\r\n  }\r\n  return new Array(steps).fill(0).map((_, index) => ({\r\n    from: from.clone()\r\n      .add(subtract)\r\n      .add(step.asMilliseconds() * index),\r\n    till: from.clone()\r\n      .add(subtract)\r\n      .add(step.asMilliseconds() * (index + 1)),\r\n  }));\r\n};\r\n\r\nexport interface GridItem {\r\n  left: number;\r\n  date: Moment;\r\n  stepProportion: number;\r\n  opacity: number;\r\n}\r\n\r\nexport const generateGridItems = (\r\n  from: Moment,\r\n  till: Moment,\r\n  step: Duration,\r\n  containerWidthPx: number,\r\n  availableSteps: Duration[],\r\n  goalGridWidthPx: number,\r\n  startOfStep: Moment\r\n): { items: GridItem[]; bestStep: Duration } => {\r\n  if (\r\n    !from ||\r\n    !till ||\r\n    !containerWidthPx ||\r\n    !availableSteps?.length ||\r\n    !goalGridWidthPx ||\r\n    !step ||\r\n    !startOfStep\r\n  ) {\r\n    return { bestStep: availableSteps?.[0], items: [] };\r\n  }\r\n  const stepMs = step.asMilliseconds();\r\n  const fromMs = from.valueOf();\r\n  const tillMs = till.valueOf();\r\n  const timeLengthMs = tillMs - fromMs;\r\n  const approximateStepsCount = containerWidthPx / goalGridWidthPx;\r\n  const approximateStepMs = timeLengthMs / approximateStepsCount;\r\n  const availableStepsDistancesMs = availableSteps.map(a =>\r\n    Math.abs(a.asMilliseconds() - approximateStepMs)\r\n  );\r\n  const smallestDistance = Math.min(...availableStepsDistancesMs);\r\n  const bestStepIndex = availableStepsDistancesMs.findIndex(\r\n    a => a === smallestDistance\r\n  );\r\n  const bestStep = availableSteps[bestStepIndex];\r\n  const subtract =\r\n    (fromMs + from.utcOffset() * 60 * 1000) % bestStep.asMilliseconds();\r\n  let startMs = fromMs - subtract;\r\n  let steps: Moment[] = [];\r\n  while (startMs <= tillMs) {\r\n    steps = steps.concat(from.clone().add(startMs - fromMs, 'ms'));\r\n    startMs += bestStep.asMilliseconds();\r\n  }\r\n  return {\r\n    items: steps\r\n      .filter(a => a.valueOf() > fromMs && a.valueOf() < tillMs)\r\n      .map(date => {\r\n        const stepProportion =\r\n          ((date.valueOf() + from.utcOffset() * 60 * 1000) % stepMs) / stepMs;\r\n        let numberOfRoots = 0;\r\n        let current = stepProportion;\r\n        let currentTop = 1;\r\n        let tolerance = 0.001;\r\n        while (current > tolerance && current < currentTop - tolerance) {\r\n          numberOfRoots += 1;\r\n          currentTop = 1 / Math.pow(2, numberOfRoots);\r\n          if (current > currentTop) {\r\n            current -= currentTop;\r\n          }\r\n        }\r\n        return {\r\n          left: (date.valueOf() - fromMs) / timeLengthMs,\r\n          date,\r\n          stepProportion,\r\n          opacity: 1 / (numberOfRoots || 1),\r\n        };\r\n      }),\r\n    bestStep,\r\n  };\r\n};\r\n"],"mappings":";;;;;;;;;;;AAAA;;;;;;;;;;AAUO,SAASA,OAAT,CAAoBC,KAApB,EAAgCC,QAAhC,EAAwE;EAC7E,OAAOD,KAAK,CAACE,MAAN,CAAa,CAACC,GAAD,EAAMC,IAAN,KAAe;IACjC,MAAMC,GAAG,GAAGJ,QAAQ,CAACG,IAAD,CAApB;;IACA,IAAI,CAACD,GAAG,CAACG,cAAJ,CAAmBD,GAAnB,CAAL,EAA8B;MAC5BF,GAAG,CAACE,GAAD,CAAH,GAAW,EAAX;IACD;;IACDF,GAAG,CAACE,GAAD,CAAH,CAASE,IAAT,CAAcH,IAAd;IACA,OAAOD,GAAP;EACD,CAPM,EAOJ,EAPI,CAAP;AAQD;;AAqBM,SAASK,oBAAT,CACLC,QADK,EAELC,IAFK,EAGLC,aAHK,EAKL;EAAA,IADAC,WACA,uEAD8C,EAC9C;;EACA,IAAI,CAACH,QAAL,EAAe;IACb,OAAO,EAAP;EACD;;EACD,IAAII,KAA+B,GAAG,EAAtC;;EACA,IAAID,WAAJ,aAAIA,WAAJ,eAAIA,WAAW,CAAEE,MAAjB,EAAyB;IACvBD,KAAK,GAAGD,WAAW,CAACG,GAAZ,CAAgBC,MAAM,oCACzBA,MADyB;MAE5BhB,KAAK,EAAE;IAFqB,EAAtB,CAAR;EAID;;EACD,MAAMiB,sBAAsB,GAAGR,QAAQ,CAACS,MAAT,CAAgBC,CAAC,IAAIA,CAAC,CAACC,OAAF,KAAcC,SAAnC,CAA/B;EACA,MAAMC,mBAAmB,GAAGb,QAAQ,CAACS,MAAT,CAAgBC,CAAC,IAAIA,CAAC,CAACC,OAAF,KAAcC,SAAnC,CAA5B;;EACA,IAAIC,mBAAmB,CAACR,MAAxB,EAAgC;IAC9B,MAAMS,OAAO,GAAGxB,OAAO,CACrBuB,mBAAmB,CAACP,GAApB,CAAwB,CAACS,OAAD,EAAUC,aAAV,qCACnBD,OADmB;MAEtBC;IAFsB,EAAxB,CADqB,EAKrBN,CAAC,IAAIA,CAAC,CAACC,OALc,CAAvB;IAOAP,KAAK,GAAGa,MAAM,CAACC,IAAP,CAAYJ,OAAZ,EAAqBR,GAArB,CAAyBV,GAAG;MAClCe,OAAO,EAAEQ,MAAM,CAACvB,GAAD,CADmB;MAElCL,KAAK,EAAEuB,OAAO,CAAClB,GAAD;IAFoB,GAG/BO,WAH+B,aAG/BA,WAH+B,uBAG/BA,WAAW,CAAEiB,IAAb,CAAkBV,CAAC,IAAIA,CAAC,CAACC,OAAF,KAAcQ,MAAM,CAACvB,GAAD,CAA3C,CAH+B,CAA5B,CAAR;IAKA,MAAMyB,YAAY,GAAGlB,WAAH,aAAGA,WAAH,uBAAGA,WAAW,CAAEM,MAAb,CACnBC,CAAC,IAAI,CAACN,KAAK,CAACkB,IAAN,CAAWC,CAAC,IAAIA,CAAC,CAACZ,OAAF,KAAcD,CAAC,CAACC,OAAhC,CADa,CAArB;IAGAP,KAAK,GAAGA,KAAK,CAACoB,MAAN,CAAaH,YAAY,CAACf,GAAb,CAAiBI,CAAC,oCAAUA,CAAV;MAAanB,KAAK,EAAE;IAApB,EAAlB,CAAb,CAAR;EACD;;EACD,IAAIiB,sBAAsB,CAACH,MAA3B,EAAmC;IACjC,IAAIoB,iBACsC,GAAGjB,sBAAsB,CAChEF,GAD0C,CACtC,CAACS,OAAD,EAAUC,aAAV,qCAAkCD,OAAlC;MAA2CC;IAA3C,EADsC,EAE1CU,IAF0C,CAErC,CAAChB,CAAD,EAAIiB,CAAJ,KAAUjB,CAAC,CAACT,IAAF,CAAO2B,OAAP,KAAmBD,CAAC,CAAC1B,IAAF,CAAO2B,OAAP,EAFQ,CAD7C;;IAIA,OAAOH,iBAAiB,CAACpB,MAAlB,GAA2B,CAAlC,EAAqC;MACnC,IAAIwB,GAAG,GAAG,cAAV;MACA,IAAIC,YAAY,GAAG,CAAC,CAApB;MACA,IAAIC,SAAS,GAAG,CAAC,CAAjB;MACA3B,KAAK,CAAC4B,OAAN,CAAc,CAACC,IAAD,EAAOC,KAAP,KAAiB;QAAA;;QAC7B,IAAI/B,WAAJ,aAAIA,WAAJ,eAAIA,WAAW,CAAEmB,IAAb,CAAkBC,CAAC,IAAIA,CAAC,CAACZ,OAAF,KAAcsB,IAAI,CAACtB,OAA1C,CAAJ,EAAwD;UACtD;QACD;;QACD,MAAMwB,QAAQ,GAAG,gBAAAF,IAAI,CAAC1C,KAAL,CAAW0C,IAAI,CAAC1C,KAAL,CAAWc,MAAX,GAAoB,CAA/B,6DAAmC+B,IAAnC,KAA2CnC,IAA5D;QACA,MAAMoC,SAAS,GAAGZ,iBAAiB,CAACnB,GAAlB,CAAsBS,OAAO,IAAI;UACjD,MAAMuB,IAAI,GAAGvB,OAAO,CAACd,IAAR,CAAasC,IAAb,CAAkBJ,QAAlB,CAAb;;UACA,IAAIF,IAAI,CAAC1C,KAAL,CAAWc,MAAX,KAAsB,CAA1B,EAA6B;YAC3B,OAAOmC,IAAI,CAACC,GAAL,CAASH,IAAT,CAAP;UACD;;UACD,OAAOA,IAAP;QACD,CANiB,CAAlB;;QAOA,MAAMI,IAAI,GAAGF,IAAI,CAACX,GAAL,CAAS,GAAGQ,SAAS,CAAC5B,MAAV,CAAiBC,CAAC,IAAIA,CAAC,IAAI,CAA3B,CAAZ,CAAb;;QACA,IAAIgC,IAAI,GAAGb,GAAX,EAAgB;UACdC,YAAY,GAAGO,SAAS,CAACM,OAAV,CAAkBD,IAAlB,CAAf;UACAX,SAAS,GAAGG,KAAZ;QACD;MACF,CAjBD;;MAkBA,IAAIJ,YAAY,IAAI,CAAhB,IAAqBC,SAAS,IAAI,CAAtC,EAAyC;QACvC3B,KAAK,CAAC2B,SAAD,CAAL,CAAiBxC,KAAjB,GAAyBa,KAAK,CAAC2B,SAAD,CAAL,CAAiBxC,KAAjB,CAAuBiC,MAAvB,mBACpBC,iBAAiB,CAACK,YAAD,CADG,EAAzB;QAGAL,iBAAiB,CAACmB,MAAlB,CAAyBd,YAAzB,EAAuC,CAAvC;MACD,CALD,MAKO;QACL1B,KAAK,GAAGA,KAAK,CAACoB,MAAN,CAAa;UACnBjC,KAAK,EAAE,mBAAMkC,iBAAiB,CAAC,CAAD,CAAvB,EADY;UAEnBd,OAAO,EAAEP,KAAK,CAACC,MAFI;UAGnBwC,IAAI,EAAEjC;QAHa,CAAb,CAAR;QAKAa,iBAAiB,CAACqB,KAAlB;MACD;IACF,CAxCgC,CAyCjC;;IACA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;EACG;;EACD,KAAK,IAAIZ,KAAK,GAAG,CAAjB,EAAoBA,KAAK,GAAG9B,KAAK,CAACC,MAAlC,EAA0C6B,KAAK,EAA/C,EAAmD;IACjD,MAAMD,IAAI,GAAG7B,KAAK,CAAC8B,KAAD,CAAlB;IACA9B,KAAK,CAAC8B,KAAD,CAAL,CAAa3C,KAAb,GAAqB0C,IAAI,CAAC1C,KAAL,CAAWmC,IAAX,CACnB,CAAChB,CAAD,EAAIiB,CAAJ,KAAUjB,CAAC,CAACT,IAAF,CAAO2B,OAAP,KAAmBD,CAAC,CAAC1B,IAAF,CAAO2B,OAAP,EADV,CAArB;EAGD;;EACD,IAAIxB,KAAK,CAACC,MAAN,GAAeH,aAAnB,EAAkC;IAChCE,KAAK,GAAGA,KAAK,CAACoB,MAAN,CACN,IAAIuB,KAAJ,CAAkC7C,aAAa,GAAGE,KAAK,CAACC,MAAxD,EACG2C,IADH,CACQ,IADR,EAEG1C,GAFH,CAEO,CAAC2C,CAAD,EAAIf,KAAJ,MAAe;MAClB3C,KAAK,EAAE,EADW;MAElBoB,OAAO,EAAEuB,KAAK,GAAG9B,KAAK,CAACC,MAFL;MAGlBwC,IAAI,EAAE;IAHY,CAAf,CAFP,CADM,CAAR;EASD;;EACDzC,KAAK,GAAGA,KAAK,CAACsB,IAAN,CAAW,CAAChB,CAAD,EAAIiB,CAAJ,KAAUjB,CAAC,CAACC,OAAF,GAAYgB,CAAC,CAAChB,OAAnC,CAAR;EACA,OAAOP,KAAP;AACD;;AAEM,SAAS8C,YAAT,CAAsDxC,CAAtD,EAA4DiB,CAA5D,EAAkE;EACvE,IAAI,EAACjB,CAAD,aAACA,CAAD,eAACA,CAAC,CAAET,IAAJ,KAAY,EAACS,CAAD,aAACA,CAAD,eAACA,CAAC,CAAE0B,IAAJ,CAAZ,IAAwB,EAACT,CAAD,aAACA,CAAD,eAACA,CAAC,CAAE1B,IAAJ,CAAxB,IAAoC,EAAC0B,CAAD,aAACA,CAAD,eAACA,CAAC,CAAES,IAAJ,CAAxC,EAAkD;IAChD,OAAO,KAAP;EACD;;EACD,IAAIT,CAAC,CAACS,IAAF,CAAOe,QAAP,CAAgBzC,CAAC,CAACT,IAAlB,CAAJ,EAA6B;IAC3B,OAAO,KAAP;EACD;;EACD,IAAI0B,CAAC,CAAC1B,IAAF,CAAOmD,OAAP,CAAe1C,CAAC,CAAC0B,IAAjB,CAAJ,EAA4B;IAC1B,OAAO,KAAP;EACD;;EACD,OAAO,IAAP;AACD;;AAEM,MAAMiB,oBAAoB,GAAG,CAACC,WAAD,EAAsBC,KAAtB,MACjC;EACCC,UAAU,EAAG,GAAEF,WAAW,GAAG,GAAI,GADlC;EAECC,KAAK,EAAG,GAAEA,KAAK,GAAG,GAAI;AAFvB,CADiC,CAA7B;;;;AAMA,SAASE,wBAAT,CACLlE,KADK,EAELU,IAFK,EAGLmC,IAHK,EAIL;EACA,IAAIsB,OAAO,GAAG,CAAd;EACA,MAAMC,OAAO,GAAGvB,IAAI,CAACR,OAAL,KAAiB3B,IAAI,CAAC2B,OAAL,EAAjC;EACA,MAAMgC,OAAO,GAAG3D,IAAI,CAAC2B,OAAL,EAAhB;EACA,MAAMiC,KAAK,GAAGzB,IAAI,CAACR,OAAL,EAAd;EACA,OAAO+B,OAAO,GAAG,CAAV,GACHpE,KADG,aACHA,KADG,uBACHA,KAAK,CAAEe,GAAP,CAAWX,IAAI,IAAI;IACjB,MAAMmE,UAAU,GAAGnE,IAAI,CAACM,IAAL,CAAU2B,OAAV,KAAsBgC,OAAzC;IACA,MAAMG,SAAS,GAAG,CAACpE,IAAI,CAACM,IAAL,CAAU2B,OAAV,KAAsBgC,OAAvB,IAAkCD,OAApD;IACA,MAAMK,QAAQ,GAAGF,UAAU,GAAG,IAAAG,eAAA,EAAOL,OAAP,CAAH,GAAqB,IAAAK,eAAA,EAAOtE,IAAI,CAACM,IAAZ,CAAhD;IACA,MAAMiE,KAAK,GAAGJ,UAAU,GAAG,CAAH,GAAOC,SAA/B;IACA,MAAMI,QAAQ,GAAGxE,IAAI,CAACyC,IAAL,CAAUR,OAAV,KAAsBiC,KAAvC;IACA,MAAMO,OAAO,GAAG,CAACzE,IAAI,CAACyC,IAAL,CAAUR,OAAV,KAAsBgC,OAAvB,IAAkCD,OAAlD;IACA,MAAMU,GAAG,GAAGF,QAAQ,GAAG,CAACN,KAAK,GAAGD,OAAT,IAAoBD,OAAvB,GAAiCS,OAArD;IACA,MAAME,QAAQ,GAAGH,QAAQ,GAAG,IAAAF,eAAA,EAAOJ,KAAP,CAAH,GAAmB,IAAAI,eAAA,EAAOtE,IAAI,CAACyC,IAAZ,CAA5C;IACA,MAAMkB,WAAW,GAAGY,KAAK,GAAGR,OAA5B;IACAA,OAAO,GAAG,CAAC/D,IAAI,CAACyC,IAAL,CAAUR,OAAV,KAAsBgC,OAAvB,IAAkCD,OAA5C;IACA,OAAO;MACLhE,IADK;MAELuE,KAFK;MAGLH,SAHK;MAILC,QAJK;MAKLF,UALK;MAMLP,KAAK,EAAEc,GAAG,GAAGH,KANR;MAOLG,GAPK;MAQLD,OARK;MASLE,QATK;MAULH,QAVK;MAWLb;IAXK,CAAP;EAaD,CAxBD,CADG,GA0BH,EA1BJ;AA2BD;;AAEM,MAAMiB,oBAAoB,GAAG,CAClCtE,IADkC,EAElCmC,IAFkC,EAGlCoC,IAHkC,EAIlCC,WAJkC,KAK/B;EACH,IAAI,CAACxE,IAAD,IAAS,CAACmC,IAAV,IAAkB,CAACoC,IAAvB,EAA6B;IAC3B,OAAO,EAAP;EACD;;EACD,IAAIE,KAAK,GAAGlC,IAAI,CAACmC,GAAL,CACVnC,IAAI,CAACoC,IAAL,CAAU,CAACxC,IAAI,CAACR,OAAL,KAAiB3B,IAAI,CAAC2B,OAAL,EAAlB,IAAoC4C,IAAI,CAACK,cAAL,EAA9C,CADU,EAEV,CAFU,CAAZ;EAIA,IAAIC,QAAQ,GACV,CAACL,WAAW,CAAC7C,OAAZ,KAAwB3B,IAAI,CAAC2B,OAAL,EAAzB,IAA2C4C,IAAI,CAACK,cAAL,EAD7C;;EAEA,IAAIC,QAAQ,GAAG,CAAf,EAAkB;IAChBA,QAAQ,IAAIN,IAAI,CAACK,cAAL,EAAZ;EACD;;EACD,IAAIzC,IAAI,CAACR,OAAL,KAAiB3B,IAAI,CAAC2B,OAAL,EAAjB,GAAkC4C,IAAI,CAACK,cAAL,EAAtC,EAA6D;IAC3DH,KAAK,IAAI,CAAT;EACD;;EACD,OAAO,IAAI3B,KAAJ,CAAU2B,KAAV,EAAiB1B,IAAjB,CAAsB,CAAtB,EAAyB1C,GAAzB,CAA6B,CAAC2C,CAAD,EAAIf,KAAJ,MAAe;IACjDjC,IAAI,EAAEA,IAAI,CAAC8E,KAAL,GACHC,GADG,CACCF,QADD,EAEHE,GAFG,CAECR,IAAI,CAACK,cAAL,KAAwB3C,KAFzB,CAD2C;IAIjDE,IAAI,EAAEnC,IAAI,CAAC8E,KAAL,GACHC,GADG,CACCF,QADD,EAEHE,GAFG,CAECR,IAAI,CAACK,cAAL,MAAyB3C,KAAK,GAAG,CAAjC,CAFD;EAJ2C,CAAf,CAA7B,CAAP;AAQD,CA7BM;;;;AAsCA,MAAM+C,iBAAiB,GAAG,CAC/BhF,IAD+B,EAE/BmC,IAF+B,EAG/BoC,IAH+B,EAI/BU,gBAJ+B,EAK/BC,cAL+B,EAM/BC,eAN+B,EAO/BX,WAP+B,KAQe;EAC9C,IACE,CAACxE,IAAD,IACA,CAACmC,IADD,IAEA,CAAC8C,gBAFD,IAGA,EAACC,cAAD,aAACA,cAAD,eAACA,cAAc,CAAE9E,MAAjB,CAHA,IAIA,CAAC+E,eAJD,IAKA,CAACZ,IALD,IAMA,CAACC,WAPH,EAQE;IACA,OAAO;MAAEY,QAAQ,EAAEF,cAAF,aAAEA,cAAF,uBAAEA,cAAc,CAAG,CAAH,CAA1B;MAAiC5F,KAAK,EAAE;IAAxC,CAAP;EACD;;EACD,MAAM+F,MAAM,GAAGd,IAAI,CAACK,cAAL,EAAf;EACA,MAAMU,MAAM,GAAGtF,IAAI,CAAC2B,OAAL,EAAf;EACA,MAAM4D,MAAM,GAAGpD,IAAI,CAACR,OAAL,EAAf;EACA,MAAM6D,YAAY,GAAGD,MAAM,GAAGD,MAA9B;EACA,MAAMG,qBAAqB,GAAGR,gBAAgB,GAAGE,eAAjD;EACA,MAAMO,iBAAiB,GAAGF,YAAY,GAAGC,qBAAzC;EACA,MAAME,yBAAyB,GAAGT,cAAc,CAAC7E,GAAf,CAAmBI,CAAC,IACpD8B,IAAI,CAACC,GAAL,CAAS/B,CAAC,CAACmE,cAAF,KAAqBc,iBAA9B,CADgC,CAAlC;EAGA,MAAME,gBAAgB,GAAGrD,IAAI,CAACX,GAAL,CAAS,GAAG+D,yBAAZ,CAAzB;EACA,MAAME,aAAa,GAAGF,yBAAyB,CAACG,SAA1B,CACpBrF,CAAC,IAAIA,CAAC,KAAKmF,gBADS,CAAtB;EAGA,MAAMR,QAAQ,GAAGF,cAAc,CAACW,aAAD,CAA/B;EACA,MAAMhB,QAAQ,GACZ,CAACS,MAAM,GAAGtF,IAAI,CAAC+F,SAAL,KAAmB,EAAnB,GAAwB,IAAlC,IAA0CX,QAAQ,CAACR,cAAT,EAD5C;EAEA,IAAIjB,OAAO,GAAG2B,MAAM,GAAGT,QAAvB;EACA,IAAIJ,KAAe,GAAG,EAAtB;;EACA,OAAOd,OAAO,IAAI4B,MAAlB,EAA0B;IACxBd,KAAK,GAAGA,KAAK,CAAClD,MAAN,CAAavB,IAAI,CAAC8E,KAAL,GAAaC,GAAb,CAAiBpB,OAAO,GAAG2B,MAA3B,EAAmC,IAAnC,CAAb,CAAR;IACA3B,OAAO,IAAIyB,QAAQ,CAACR,cAAT,EAAX;EACD;;EACD,OAAO;IACLtF,KAAK,EAAEmF,KAAK,CACTjE,MADI,CACGC,CAAC,IAAIA,CAAC,CAACkB,OAAF,KAAc2D,MAAd,IAAwB7E,CAAC,CAACkB,OAAF,KAAc4D,MAD9C,EAEJlF,GAFI,CAEA2F,IAAI,IAAI;MACX,MAAMC,cAAc,GACjB,CAACD,IAAI,CAACrE,OAAL,KAAiB3B,IAAI,CAAC+F,SAAL,KAAmB,EAAnB,GAAwB,IAA1C,IAAkDV,MAAnD,GAA6DA,MAD/D;MAEA,IAAIa,aAAa,GAAG,CAApB;MACA,IAAIC,OAAO,GAAGF,cAAd;MACA,IAAIG,UAAU,GAAG,CAAjB;MACA,IAAIC,SAAS,GAAG,KAAhB;;MACA,OAAOF,OAAO,GAAGE,SAAV,IAAuBF,OAAO,GAAGC,UAAU,GAAGC,SAArD,EAAgE;QAC9DH,aAAa,IAAI,CAAjB;QACAE,UAAU,GAAG,IAAI7D,IAAI,CAAC+D,GAAL,CAAS,CAAT,EAAYJ,aAAZ,CAAjB;;QACA,IAAIC,OAAO,GAAGC,UAAd,EAA0B;UACxBD,OAAO,IAAIC,UAAX;QACD;MACF;;MACD,OAAO;QACLG,IAAI,EAAE,CAACP,IAAI,CAACrE,OAAL,KAAiB2D,MAAlB,IAA4BE,YAD7B;QAELQ,IAFK;QAGLC,cAHK;QAILO,OAAO,EAAE,KAAKN,aAAa,IAAI,CAAtB;MAJJ,CAAP;IAMD,CAtBI,CADF;IAwBLd;EAxBK,CAAP;AA0BD,CApEM"}