@rivet-health/design-system 40.7.0 → 40.8.0

package/fesm2015/rivet-health-design-system.mjs

@@ -2090,12 +2090,19 @@ var RivSelect;
             return this.byId.has(option.id);
         }
         add(option) {
-            if (this.byId.has(option.id)) {
-                // Preserve insertion order while swapping to the newer object
-                // reference. Rebuilding the full Set matches the previous
-                // implementation's semantics; the cost of that rebuild only hits
-                // the rare "re-add existing" path — the common O(N²) case (fresh
-                // adds during construction) no longer pays it.
+            const existing = this.byId.get(option.id);
+            if (existing === option) {
+                // Same object reference — nothing to update. Ancestor re-adds
+                // during a selection snapshot hit this path repeatedly, so keeping
+                // it O(1) is what prevents the tree-select N² blow-up seen in
+                // RVT-25470.
+                return this;
+            }
+            if (existing !== undefined) {
+                // Different reference, same id — swap the stored ref while
+                // preserving Set insertion order. The rebuild is O(N), but this
+                // path is rare in practice (the hot ancestor-snapshot loop takes
+                // the identity fast-path above).
                 const items = [...this].map(o => (o.id === option.id ? option : o));
                 this.byId.set(option.id, option);
                 super.clear();
@@ -2394,17 +2401,22 @@ var RivSelect;
         const snapshot = new OptionSet(state.selection.selected);
         const topLevelOptions = getTopLevelOptions(state.sourceOptionGroups);
         const [parents] = getRelationshipMaps(topLevelOptions);
-        // For each selected option, add all its ancestors to the snapshot
+        // Sibling leaves share ancestors, so once we've walked up through a
+        // given parent id we can stop — anything above it has already been
+        // added by a previous iteration. Without this short-circuit the loop
+        // re-runs findOption (which is a full tree walk) once per shared
+        // ancestor edge, which was the #2 hotspot behind OptionSet.add in
+        // RVT-25470's profile.
+        const visited = new Set();
         for (const selectedOption of state.selection.selected) {
-            let currentId = selectedOption.id;
-            let parentId = parents.get(currentId);
-            while (parentId !== undefined) {
+            let parentId = parents.get(selectedOption.id);
+            while (parentId !== undefined && !visited.has(parentId)) {
+                visited.add(parentId);
                 const parentOption = findOption(topLevelOptions, parentId);
                 if (parentOption) {
                     snapshot.add(parentOption);
                 }
-                currentId = parentId;
-                parentId = parents.get(currentId);
+                parentId = parents.get(parentId);
             }
         }
         return snapshot;
@@ -4209,18 +4221,20 @@ i0.ɵɵngDeclareClassMetadata({ minVersion: "12.0.0", version: "15.2.10", ngImpo
         'large',
         'xlarge',
     ];
-    // Accepts MM/DD/YYYY, M/D/YY, and YYYY-MM-DD with /, -, or . separators.
-    // A 4-digit leading segment is treated as year.
+    // Accepts MM/DD/YYYY, M/D/YY, and YYYY-MM-DD with /, -, or . separators, as
+    // well as separator-less digit runs (MMDDYYYY or MMDDYY). A 4-digit leading
+    // segment in the separated form is treated as an ISO year; 2-digit years
+    // pivot at 50 (<50 → 2000s, >=50 → 1900s).
     function parseDate(input) {
-        const parts = input.trim().split(/[/.-]/);
-        if (parts.length !== 3)
+        const trimmed = input.trim();
+        if (!trimmed)
             return undefined;
-        const nums = parts.map(p => parseInt(p, 10));
-        if (nums.some(isNaN))
+        const ymd = /^\d+$/.test(trimmed)
+            ? parseDigits(trimmed)
+            : parseSeparated(trimmed);
+        if (!ymd)
             return undefined;
-        let [year, month, day] = parts[0].length === 4 ? nums : [nums[2], nums[0], nums[1]];
-        if (parts[0].length !== 4 && year < 100)
-            year += year < 50 ? 2000 : 1900;
+        const [year, month, day] = ymd;
         const date = new Date(year, month - 1, day);
         return date.getFullYear() === year &&
             date.getMonth() === month - 1 &&
@@ -4229,6 +4243,35 @@ i0.ɵɵngDeclareClassMetadata({ minVersion: "12.0.0", version: "15.2.10", ngImpo
             : undefined;
     }
     DateComponent.parseDate = parseDate;
+    function expandTwoDigitYear(year) {
+        return year < 100 ? year + (year < 50 ? 2000 : 1900) : year;
+    }
+    // A run of digits with no separators: 8 → MMDDYYYY (literal year), 6 → MMDDYY
+    // (2-digit year pivoted at 50).
+    function parseDigits(digits) {
+        if (digits.length !== 8 && digits.length !== 6)
+            return undefined;
+        const year = parseInt(digits.slice(4), 10);
+        return [
+            digits.length === 6 ? expandTwoDigitYear(year) : year,
+            parseInt(digits.slice(0, 2), 10),
+            parseInt(digits.slice(2, 4), 10),
+        ];
+    }
+    function parseSeparated(input) {
+        const parts = input.split(/[/.-]/);
+        if (parts.length !== 3)
+            return undefined;
+        const nums = parts.map(p => parseInt(p, 10));
+        if (nums.some(isNaN))
+            return undefined;
+        const [year, month, day] = parts[0].length === 4 ? nums : [nums[2], nums[0], nums[1]];
+        return [
+            parts[0].length === 4 ? year : expandTwoDigitYear(year),
+            month,
+            day,
+        ];
+    }
     function isValidDate(date, min, max) {
         const time = date.getTime();
         return time >= min.getTime() && time <= max.getTime();