@fullcalendar/core 6.1.10 → 6.1.12

package/index.js

@@ -1908,7 +1908,7 @@ class CalendarContent extends PureComponent {
         let viewContext = this.buildViewContext(props.viewSpec, props.viewApi, props.options, props.dateProfileGenerator, props.dateEnv, props.theme, props.pluginHooks, props.dispatch, props.getCurrentData, props.emitter, props.calendarApi, this.registerInteractiveComponent, this.unregisterInteractiveComponent);
         let viewLabelId = (toolbarConfig.header && toolbarConfig.header.hasTitle)
             ? this.state.viewLabelId
-            : '';
+            : undefined;
         return (createElement(ViewContextType.Provider, { value: viewContext },
             toolbarConfig.header && (createElement(Toolbar, Object.assign({ ref: this.headerRef, extraClassName: "fc-header-toolbar", model: toolbarConfig.header, titleId: viewLabelId }, toolbarProps))),
             createElement(ViewHarness, { liquid: viewVGrow, height: viewHeight, aspectRatio: viewAspectRatio, labeledById: viewLabelId },
@@ -2136,6 +2136,6 @@ function sliceEvents(props, allDay) {
     return sliceEventStore(props.eventStore, props.eventUiBases, props.dateProfile.activeRange, allDay ? props.nextDayThreshold : null).fg;
 }
 
-const version = '6.1.10';
+const version = '6.1.12';
 
 export { Calendar, createPlugin, formatDate, formatRange, globalLocales, globalPlugins, sliceEvents, version };

package/internal-common.cjs

@@ -32,7 +32,9 @@ function injectStyles(styleText) {
     });
 }
 function ensureElHasStyles(el) {
-    if (el.isConnected) {
+    if (el.isConnected && // sometimes true if SSR system simulates DOM
+        el.getRootNode // sometimes undefined if SSR system simulates DOM
+    ) {
         registerStylesRoot(el.getRootNode());
     }
 }
@@ -4445,7 +4447,7 @@ startOverride, endOverride) {
 function getSegMeta(seg, todayRange, nowDate) {
     let segRange = seg.eventRange.range;
     return {
-        isPast: segRange.end < (nowDate || todayRange.start),
+        isPast: segRange.end <= (nowDate || todayRange.start),
         isFuture: segRange.start >= (nowDate || todayRange.end),
         isToday: todayRange && rangeContainsMarker(todayRange, segRange.start),
     };
@@ -4708,10 +4710,14 @@ class CalendarRoot extends BaseComponent {
             forPrint: false,
         };
         this.handleBeforePrint = () => {
-            this.setState({ forPrint: true });
+            flushSync(() => {
+                this.setState({ forPrint: true });
+            });
         };
         this.handleAfterPrint = () => {
-            this.setState({ forPrint: false });
+            flushSync(() => {
+                this.setState({ forPrint: false });
+            });
         };
     }
     render() {
@@ -5509,10 +5515,10 @@ function computeInnerRect(el, goWithinPadding = false, doFromWindowViewport) {
 function computeRect(el) {
     let rect = el.getBoundingClientRect();
     return {
-        left: rect.left + window.pageXOffset,
-        top: rect.top + window.pageYOffset,
-        right: rect.right + window.pageXOffset,
-        bottom: rect.bottom + window.pageYOffset,
+        left: rect.left + window.scrollX,
+        top: rect.top + window.scrollY,
+        right: rect.right + window.scrollX,
+        bottom: rect.bottom + window.scrollY,
     };
 }
 function computeClippedClientRect(el) {
@@ -5703,16 +5709,16 @@ class ElementScrollController extends ScrollController {
 }
 class WindowScrollController extends ScrollController {
     getScrollTop() {
-        return window.pageYOffset;
+        return window.scrollY;
     }
     getScrollLeft() {
-        return window.pageXOffset;
+        return window.scrollX;
     }
     setScrollTop(n) {
-        window.scroll(window.pageXOffset, n);
+        window.scroll(window.scrollX, n);
     }
     setScrollLeft(n) {
-        window.scroll(n, window.pageYOffset);
+        window.scroll(n, window.scrollY);
     }
     getScrollWidth() {
         return document.documentElement.scrollWidth;
@@ -5770,8 +5776,8 @@ class NamedTimeZoneImpl {
 
 class SegHierarchy {
     constructor(getEntryThickness = (entry) => {
-        // should return an integer
-        return entry.thickness;
+        // if no thickness known, assume 1 (if 0, so small it always fits)
+        return entry.thickness || 1;
     }) {
         this.getEntryThickness = getEntryThickness;
         // settings
@@ -5794,51 +5800,45 @@ class SegHierarchy {
         let insertion = this.findInsertion(entry);
         if (this.isInsertionValid(insertion, entry)) {
             this.insertEntryAt(entry, insertion);
-            return 1;
         }
-        return this.handleInvalidInsertion(insertion, entry, hiddenEntries);
+        else {
+            this.handleInvalidInsertion(insertion, entry, hiddenEntries);
+        }
     }
     isInsertionValid(insertion, entry) {
         return (this.maxCoord === -1 || insertion.levelCoord + this.getEntryThickness(entry) <= this.maxCoord) &&
             (this.maxStackCnt === -1 || insertion.stackCnt < this.maxStackCnt);
     }
-    // returns number of new entries inserted
     handleInvalidInsertion(insertion, entry, hiddenEntries) {
         if (this.allowReslicing && insertion.touchingEntry) {
-            return this.splitEntry(entry, insertion.touchingEntry, hiddenEntries);
+            const hiddenEntry = Object.assign(Object.assign({}, entry), { span: intersectSpans(entry.span, insertion.touchingEntry.span) });
+            hiddenEntries.push(hiddenEntry);
+            this.splitEntry(entry, insertion.touchingEntry, hiddenEntries);
+        }
+        else {
+            hiddenEntries.push(entry);
         }
-        hiddenEntries.push(entry);
-        return 0;
     }
+    /*
+    Does NOT add what hit the `barrier` into hiddenEntries. Should already be done.
+    */
     splitEntry(entry, barrier, hiddenEntries) {
-        let partCnt = 0;
-        let splitHiddenEntries = [];
         let entrySpan = entry.span;
         let barrierSpan = barrier.span;
         if (entrySpan.start < barrierSpan.start) {
-            partCnt += this.insertEntry({
+            this.insertEntry({
                 index: entry.index,
                 thickness: entry.thickness,
                 span: { start: entrySpan.start, end: barrierSpan.start },
-            }, splitHiddenEntries);
+            }, hiddenEntries);
         }
         if (entrySpan.end > barrierSpan.end) {
-            partCnt += this.insertEntry({
+            this.insertEntry({
                 index: entry.index,
                 thickness: entry.thickness,
                 span: { start: barrierSpan.end, end: entrySpan.end },
-            }, splitHiddenEntries);
-        }
-        if (partCnt) {
-            hiddenEntries.push({
-                index: entry.index,
-                thickness: entry.thickness,
-                span: intersectSpans(barrierSpan, entrySpan), // guaranteed to intersect
-            }, ...splitHiddenEntries);
-            return partCnt;
+            }, hiddenEntries);
         }
-        hiddenEntries.push(entry);
-        return 0;
     }
     insertEntryAt(entry, insertion) {
         let { entriesByLevel, levelCoords } = this;
@@ -5853,6 +5853,9 @@ class SegHierarchy {
         }
         this.stackCnts[buildEntryKey(entry)] = insertion.stackCnt;
     }
+    /*
+    does not care about limits
+    */
     findInsertion(newEntry) {
         let { levelCoords, entriesByLevel, strictOrder, stackCnts } = this;
         let levelCnt = levelCoords.length;
@@ -5862,7 +5865,7 @@ class SegHierarchy {
         let touchingEntry = null;
         let stackCnt = 0;
         for (let trackingLevel = 0; trackingLevel < levelCnt; trackingLevel += 1) {
-            let trackingCoord = levelCoords[trackingLevel];
+            const trackingCoord = levelCoords[trackingLevel];
             // if the current level is past the placed entry, we have found a good empty space and can stop.
             // if strictOrder, keep finding more lateral intersections.
             if (!strictOrder && trackingCoord >= candidateCoord + this.getEntryThickness(newEntry)) {

package/internal-common.d.ts

@@ -2478,10 +2478,10 @@ declare class SegHierarchy {
     };
     constructor(getEntryThickness?: (entry: SegEntry) => number);
     addSegs(inputs: SegEntry[]): SegEntry[];
-    insertEntry(entry: SegEntry, hiddenEntries: SegEntry[]): number;
+    insertEntry(entry: SegEntry, hiddenEntries: SegEntry[]): void;
     isInsertionValid(insertion: SegInsertion, entry: SegEntry): boolean;
-    handleInvalidInsertion(insertion: SegInsertion, entry: SegEntry, hiddenEntries: SegEntry[]): number;
-    splitEntry(entry: SegEntry, barrier: SegEntry, hiddenEntries: SegEntry[]): number;
+    handleInvalidInsertion(insertion: SegInsertion, entry: SegEntry, hiddenEntries: SegEntry[]): void;
+    splitEntry(entry: SegEntry, barrier: SegEntry, hiddenEntries: SegEntry[]): void;
     insertEntryAt(entry: SegEntry, insertion: SegInsertion): void;
     findInsertion(newEntry: SegEntry): SegInsertion;
     toRects(): SegRect[];

package/internal-common.js

@@ -11,7 +11,9 @@ function injectStyles(styleText) {
     });
 }
 function ensureElHasStyles(el) {
-    if (el.isConnected) {
+    if (el.isConnected && // sometimes true if SSR system simulates DOM
+        el.getRootNode // sometimes undefined if SSR system simulates DOM
+    ) {
         registerStylesRoot(el.getRootNode());
     }
 }
@@ -4424,7 +4426,7 @@ startOverride, endOverride) {
 function getSegMeta(seg, todayRange, nowDate) {
     let segRange = seg.eventRange.range;
     return {
-        isPast: segRange.end < (nowDate || todayRange.start),
+        isPast: segRange.end <= (nowDate || todayRange.start),
         isFuture: segRange.start >= (nowDate || todayRange.end),
         isToday: todayRange && rangeContainsMarker(todayRange, segRange.start),
     };
@@ -4687,10 +4689,14 @@ class CalendarRoot extends BaseComponent {
             forPrint: false,
         };
         this.handleBeforePrint = () => {
-            this.setState({ forPrint: true });
+            flushSync(() => {
+                this.setState({ forPrint: true });
+            });
         };
         this.handleAfterPrint = () => {
-            this.setState({ forPrint: false });
+            flushSync(() => {
+                this.setState({ forPrint: false });
+            });
         };
     }
     render() {
@@ -5488,10 +5494,10 @@ function computeInnerRect(el, goWithinPadding = false, doFromWindowViewport) {
 function computeRect(el) {
     let rect = el.getBoundingClientRect();
     return {
-        left: rect.left + window.pageXOffset,
-        top: rect.top + window.pageYOffset,
-        right: rect.right + window.pageXOffset,
-        bottom: rect.bottom + window.pageYOffset,
+        left: rect.left + window.scrollX,
+        top: rect.top + window.scrollY,
+        right: rect.right + window.scrollX,
+        bottom: rect.bottom + window.scrollY,
     };
 }
 function computeClippedClientRect(el) {
@@ -5682,16 +5688,16 @@ class ElementScrollController extends ScrollController {
 }
 class WindowScrollController extends ScrollController {
     getScrollTop() {
-        return window.pageYOffset;
+        return window.scrollY;
     }
     getScrollLeft() {
-        return window.pageXOffset;
+        return window.scrollX;
     }
     setScrollTop(n) {
-        window.scroll(window.pageXOffset, n);
+        window.scroll(window.scrollX, n);
     }
     setScrollLeft(n) {
-        window.scroll(n, window.pageYOffset);
+        window.scroll(n, window.scrollY);
     }
     getScrollWidth() {
         return document.documentElement.scrollWidth;
@@ -5749,8 +5755,8 @@ class NamedTimeZoneImpl {
 
 class SegHierarchy {
     constructor(getEntryThickness = (entry) => {
-        // should return an integer
-        return entry.thickness;
+        // if no thickness known, assume 1 (if 0, so small it always fits)
+        return entry.thickness || 1;
     }) {
         this.getEntryThickness = getEntryThickness;
         // settings
@@ -5773,51 +5779,45 @@ class SegHierarchy {
         let insertion = this.findInsertion(entry);
         if (this.isInsertionValid(insertion, entry)) {
             this.insertEntryAt(entry, insertion);
-            return 1;
         }
-        return this.handleInvalidInsertion(insertion, entry, hiddenEntries);
+        else {
+            this.handleInvalidInsertion(insertion, entry, hiddenEntries);
+        }
     }
     isInsertionValid(insertion, entry) {
         return (this.maxCoord === -1 || insertion.levelCoord + this.getEntryThickness(entry) <= this.maxCoord) &&
             (this.maxStackCnt === -1 || insertion.stackCnt < this.maxStackCnt);
     }
-    // returns number of new entries inserted
     handleInvalidInsertion(insertion, entry, hiddenEntries) {
         if (this.allowReslicing && insertion.touchingEntry) {
-            return this.splitEntry(entry, insertion.touchingEntry, hiddenEntries);
+            const hiddenEntry = Object.assign(Object.assign({}, entry), { span: intersectSpans(entry.span, insertion.touchingEntry.span) });
+            hiddenEntries.push(hiddenEntry);
+            this.splitEntry(entry, insertion.touchingEntry, hiddenEntries);
+        }
+        else {
+            hiddenEntries.push(entry);
         }
-        hiddenEntries.push(entry);
-        return 0;
     }
+    /*
+    Does NOT add what hit the `barrier` into hiddenEntries. Should already be done.
+    */
     splitEntry(entry, barrier, hiddenEntries) {
-        let partCnt = 0;
-        let splitHiddenEntries = [];
         let entrySpan = entry.span;
         let barrierSpan = barrier.span;
         if (entrySpan.start < barrierSpan.start) {
-            partCnt += this.insertEntry({
+            this.insertEntry({
                 index: entry.index,
                 thickness: entry.thickness,
                 span: { start: entrySpan.start, end: barrierSpan.start },
-            }, splitHiddenEntries);
+            }, hiddenEntries);
         }
         if (entrySpan.end > barrierSpan.end) {
-            partCnt += this.insertEntry({
+            this.insertEntry({
                 index: entry.index,
                 thickness: entry.thickness,
                 span: { start: barrierSpan.end, end: entrySpan.end },
-            }, splitHiddenEntries);
-        }
-        if (partCnt) {
-            hiddenEntries.push({
-                index: entry.index,
-                thickness: entry.thickness,
-                span: intersectSpans(barrierSpan, entrySpan), // guaranteed to intersect
-            }, ...splitHiddenEntries);
-            return partCnt;
+            }, hiddenEntries);
         }
-        hiddenEntries.push(entry);
-        return 0;
     }
     insertEntryAt(entry, insertion) {
         let { entriesByLevel, levelCoords } = this;
@@ -5832,6 +5832,9 @@ class SegHierarchy {
         }
         this.stackCnts[buildEntryKey(entry)] = insertion.stackCnt;
     }
+    /*
+    does not care about limits
+    */
     findInsertion(newEntry) {
         let { levelCoords, entriesByLevel, strictOrder, stackCnts } = this;
         let levelCnt = levelCoords.length;
@@ -5841,7 +5844,7 @@ class SegHierarchy {
         let touchingEntry = null;
         let stackCnt = 0;
         for (let trackingLevel = 0; trackingLevel < levelCnt; trackingLevel += 1) {
-            let trackingCoord = levelCoords[trackingLevel];
+            const trackingCoord = levelCoords[trackingLevel];
             // if the current level is past the placed entry, we have found a good empty space and can stop.
             // if strictOrder, keep finding more lateral intersections.
             if (!strictOrder && trackingCoord >= candidateCoord + this.getEntryThickness(newEntry)) {

package/locales/af.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/af.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-dz.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-dz.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-kw.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-kw.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-ly.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-ly.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-ma.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-ma.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-sa.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-sa.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-tn.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar-tn.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ar.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/az.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/az.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/bg.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/bg.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/bn.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/bn.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/bs.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/bs.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ca.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/ca.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/cs.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/cs.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/cy.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/cy.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/da.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/da.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/de-at.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/de-at.global.min.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */

package/locales/de.global.js

@@ -1,5 +1,5 @@
 /*!
-FullCalendar Core v6.1.10
+FullCalendar Core v6.1.12
 Docs & License: https://fullcalendar.io
 (c) 2023 Adam Shaw
 */