@tesouro/embedded-components-react 0.2.175 → 0.2.176

package/dist/libs/tesouro-embedded-components-react/shared/approval-policy/feature/dist/lib/useApprovalPolicyRules.js

@@ -1,9 +1,9 @@
 "use client";
-import { useState as F, useRef as Y, useCallback as y, useMemo as f, useEffect as Q } from "react";
-import { useGetApprovalPoliciesQuery as X, usePostApprovalPoliciesMutation as Z, usePatchApprovalPoliciesIdMutation as oo, useDeleteApprovalPoliciesIdMutation as eo } from "../../../data-access/dist/lib/approvalPoliciesApi.js";
-import { APPROVAL_POLICY_OBJECT_TYPE as to } from "../../../data-access/dist/lib/queryKeys.js";
+import { useState as G, useRef as K, useCallback as y, useMemo as d, useEffect as X } from "react";
+import { useGetApprovalPoliciesQuery as mo, usePostApprovalPoliciesMutation as fo, usePatchApprovalPoliciesIdMutation as vo, useDeleteApprovalPoliciesIdMutation as go } from "../../../data-access/dist/lib/approvalPoliciesApi.js";
+import { APPROVAL_POLICY_OBJECT_TYPE as yo } from "../../../data-access/dist/lib/queryKeys.js";
 import "../../../../data-access/dist/lib/rest/client/utils.gen.js";
-import { useEmbedApi as io } from "../../../../data-access/dist/lib/EmbedApiContext.js";
+import { useEmbedApi as Ao } from "../../../../data-access/dist/lib/EmbedApiContext.js";
 import "../../../../data-access/dist/lib/rest/client.gen.js";
 import "@tanstack/react-query";
 import "../../../../data-access/dist/lib/rest/zod.gen.js";
@@ -13,22 +13,22 @@ import "lucide-react";
 import "../../../../../../../packages/shared-ui-shadcn/dist/index.js";
 import "../../../../ui/dist/lib/UIContext/UIContext.js";
 import "../../../../ui/dist/lib/OnboardingShell/OnboardingShellOverlayPortal.js";
-import { computeUncoveredAmountRanges as ro } from "../../../util/dist/lib/amountCoverage.js";
-import { nextPolicyPriority as no } from "../../../util/dist/lib/policyPriority.js";
-import { buildApprovalPolicyScript as so, parseApprovalPolicyScript as po } from "../../../util/dist/lib/policyScript.js";
-import { buildApprovalPolicyTrigger as ao, parseApprovalPolicyTrigger as lo, POLICY_DEFAULT_CURRENCY as uo } from "../../../util/dist/lib/policyTrigger.js";
-import { validatePolicyDraft as co } from "../../../util/dist/lib/validatePolicyDraft.js";
-import { toApproverSteps as mo, gapId as vo, toAmountConditionValue as L, toApproverGroupRefs as yo, buildPolicyTitle as V, toAmountConditionErrors as K, toApproverErrors as fo, toGapRanges as Ao, lockMixedApproverSections as go, buildPolicySentence as Co } from "./policyViewModel.js";
-import { useApproverOptions as ho } from "./useApproverOptions.js";
-import { toast as h } from "sonner";
-const N = "draft", Po = { lower: "", upper: "" }, j = { lower: !1, upper: !1 };
-function Io(r) {
-  return r.map((d) => {
-    const a = lo(d.trigger), A = po(d.script), g = a.currency === void 0 || a.currency === uo, v = d.status === "active", s = a.hasKnownAmountBounds && g;
+import { computeUncoveredAmountRanges as Z } from "../../../util/dist/lib/amountCoverage.js";
+import { nextPolicyPriority as ho } from "../../../util/dist/lib/policyPriority.js";
+import { buildApprovalPolicyScript as Io, parseApprovalPolicyScript as Co } from "../../../util/dist/lib/policyScript.js";
+import { buildApprovalPolicyTrigger as bo, parseApprovalPolicyTrigger as Po, POLICY_DEFAULT_CURRENCY as Ro } from "../../../util/dist/lib/policyTrigger.js";
+import { validatePolicyDraft as So } from "../../../util/dist/lib/validatePolicyDraft.js";
+import { toApproverSteps as wo, toGapRanges as Eo, gapId as Do, toAmountConditionValue as x, toApproverGroupRefs as ko, buildPolicyTitle as $, toAmountConditionErrors as oo, toApproverErrors as _o, buildUnlistedPoliciesHeading as Mo, lockUnavailableApprovers as Uo, buildPolicySentence as To } from "./policyViewModel.js";
+import { useApproverOptions as Lo } from "./useApproverOptions.js";
+import { toast as P } from "sonner";
+const eo = "draft", Oo = { lower: "", upper: "" }, to = { lower: !1, upper: !1 };
+function Bo(i) {
+  return i.map((f) => {
+    const p = Po(f.trigger), A = Co(f.script), h = p.currency === void 0 || p.currency === Ro, g = f.status === "active", l = p.hasKnownAmountBounds && h;
     return {
-      id: d.id,
-      priority: d.priority,
-      condition: a.condition,
+      id: f.id,
+      priority: f.priority,
+      condition: p.condition,
       groups: A.groups,
       /**
        * Both halves must round-trip or the rule is not safe to re-save.
@@ -36,7 +36,7 @@ function Io(r) {
        * the event or currency guard is understood, but re-serializing it would
        * add guards it never had and narrow which bills it catches.
        */
-      isRepresentable: a.isSupported && a.hasWrittenGuards && A.isSupported && g && v,
+      isRepresentable: p.isSupported && p.hasWrittenGuards && A.isSupported && h && g,
       /**
        * The amount range this rule claims, whether or not it is editable — an
        * unrepresentable script half, a trigger predicate this model cannot show,
@@ -49,279 +49,368 @@ function Io(r) {
        * A scheduled rule counts here too: it is not in effect yet, but it will
        * be, and a new rule overlapping it would collide the moment it starts.
        */
-      hasKnownCondition: s,
+      hasKnownCondition: l,
+      /**
+       * Whether this rule is in force at all. Separate from `coversNow`, which
+       * also requires a trustworthy range: a rule with bounds this model cannot
+       * read still triggers approvals, it just cannot be placed on the number
+       * line. Only this one answers "does it apply to bills".
+       */
+      isActive: g,
       /**
        * The range this rule covers *right now*, which is what the gap warning
        * is about. A scheduled rule covers nothing yet, so calling its range
        * covered would hide a gap that bills are falling through today.
        */
-      coversNow: s && v
+      coversNow: l && g
     };
   });
 }
-function bo(r) {
-  return [...r].sort(
-    (d, a) => (d.condition.min ?? 0) - (a.condition.min ?? 0)
+function Fo(i) {
+  return [...i].sort(
+    (f, p) => (f.condition.min ?? 0) - (p.condition.min ?? 0)
   );
 }
-function zo({
-  labels: r,
-  componentLabels: d
+function se({
+  labels: i,
+  componentLabels: f
 }) {
-  const a = X(), A = Z(), g = oo(), v = eo(), s = ho(), { organizationId: P } = io(), [e, l] = F(null), [I, C] = F(null), S = Y(P);
-  P && P !== S.current && (S.current = P, l(null), C(null));
-  const x = Y(0), b = y(() => (x.current += 1, { id: `group-new-${x.current}`, selectedItems: [] }), []), m = f(
-    () => Io(a.data?.data ?? []),
-    [a.data]
-  ), E = f(() => {
-    if (s.isResolving)
+  const p = mo(), A = fo(), h = vo(), g = go(), l = Lo(), { organizationId: R } = Ao(), [t, c] = G(null), [S, I] = G(null), L = K(R);
+  R && R !== L.current && (L.current = R, c(null), I(null));
+  const V = K(0), k = y(() => (V.current += 1, { id: `group-new-${V.current}`, selectedItems: [] }), []), u = d(
+    () => Bo(p.data?.data ?? []),
+    [p.data]
+  ), v = d(() => {
+    if (l.isResolving)
       return [];
-    const o = m.flatMap((n) => {
-      if (!n.isRepresentable)
+    const o = u.flatMap((e) => {
+      if (!e.isRepresentable)
         return [];
-      const u = mo(n.groups, s.lookup);
-      return u === void 0 ? [] : [
+      const s = wo(e.groups, l.lookup);
+      return s === void 0 ? [] : [
         {
-          id: n.id,
-          priority: n.priority,
-          condition: n.condition,
-          steps: u
+          id: e.id,
+          priority: e.priority,
+          condition: e.condition,
+          steps: s
         }
       ];
     });
-    return bo(o);
-  }, [m, s.isResolving, s.lookup]), $ = e ? e.policyId ?? N : null, w = !P && S.current != null || a.isResolving || s.isResolving, G = e?.policyId != null && e.policyId !== I && !w && !E.some((o) => o.id === e.policyId);
-  Q(() => {
-    G && (l(null), h.error(r.approverUnavailable));
-  }, [G, r.approverUnavailable]);
-  const p = f(() => {
-    if (e)
-      return co({
-        amount: e.amount,
-        groups: e.steps.map((o) => ({
-          id: o.id,
-          approverIds: o.selectedItems.map((n) => n.id)
-        })),
-        otherConditions: m.filter(
-          (o) => o.hasKnownCondition && o.id !== e.policyId
-        ).map((o) => o.condition)
-      });
-  }, [e, m]), D = f(
-    () => ro(
-      m.filter((o) => o.coversNow).map((o) => o.condition)
+    return Fo(o);
+  }, [u, l.isResolving, l.lookup]), O = t ? t.policyId ?? eo : null, C = !R && L.current != null || p.isResolving || l.isResolving, Y = t?.policyId != null && t.policyId !== S && !C && !v.some((o) => o.id === t.policyId);
+  X(() => {
+    Y && (c(null), P.error(i.approverUnavailable));
+  }, [Y, i.approverUnavailable]);
+  const j = d(
+    () => new Set(v.map((o) => o.id)),
+    [v]
+  ), w = d(
+    () => C ? [] : u.filter((o) => !j.has(o.id)),
+    [C, u, j]
+  ), H = d(() => {
+    const o = /* @__PURE__ */ new Map();
+    for (const e of v)
+      o.set(
+        e.id,
+        e.steps.flatMap(
+          (s) => s.selectedItems.map((r) => r.id)
+        )
+      );
+    return o;
+  }, [v]), _ = d(() => {
+    const o = /* @__PURE__ */ new Set();
+    for (const [e, s] of H)
+      if (e !== t?.policyId)
+        for (const r of s)
+          o.add(r);
+    return o;
+  }, [H, t?.policyId]), a = d(() => {
+    if (!t)
+      return;
+    const o = (e) => e.id !== t.policyId;
+    return So({
+      amount: t.amount,
+      groups: t.steps.map((e) => ({
+        id: e.id,
+        approverIds: e.selectedItems.map((s) => s.id)
+      })),
+      otherConditions: v.filter(o).map((e) => e.condition),
+      unlistedConditions: w.filter((e) => e.hasKnownCondition && o(e)).map((e) => e.condition),
+      approverIdsUsedByOtherRules: [..._].filter(
+        (e) => !t.originalApproverIds.has(e)
+      )
+    });
+  }, [t, v, w, _]), M = d(
+    () => Z(
+      u.filter((o) => o.coversNow).map((o) => o.condition)
+    ),
+    [u]
+  ), U = d(
+    () => u.filter((o) => o.hasKnownCondition).map((o) => o.condition),
+    [u]
+  ), B = d(
+    () => u.length === 0 ? [] : (
+      // A gap that some rule already claims still gets reported — bills fall
+      // through it today — but its link is closed, because seeding a draft
+      // from it could only end in a rejected save.
+      Eo(M, i, U)
     ),
-    [m]
-  ), R = y(
+    [u.length, M, i, U]
+  ), ro = d(
+    () => Z(U),
+    [U]
+  ), io = !C && u.length > 0 && ro.length === 0 ? v.length === 0 ? i.addRuleFullyCoveredUnlisted : i.addRuleFullyCovered : void 0, [N, no] = G(0), Q = K(null);
+  X(() => {
+    N !== 0 && Q.current?.scrollIntoView({
+      behavior: globalThis.matchMedia?.("(prefers-reduced-motion: reduce)").matches ? "auto" : "smooth",
+      block: "nearest"
+    });
+  }, [N]);
+  const T = y(
     (o) => {
-      l({
+      c({
         policyId: null,
         amount: o,
-        steps: [b()],
-        touchedAmount: j
-      });
+        steps: [k()],
+        // A rule that does not exist yet has grandfathered nothing.
+        originalApproverIds: /* @__PURE__ */ new Set(),
+        touchedAmount: to
+      }), no((e) => e + 1);
     },
-    [b]
-  ), z = y(() => {
-    R(Po);
-  }, [R]), J = y(
+    [k]
+  ), so = y(() => {
+    T(Oo);
+  }, [T]), lo = y(
     (o) => {
-      const n = D.find((u) => vo(u) === o);
-      n && R(
-        L({
-          min: n.min,
-          max: n.max
+      const e = M.find((s) => Do(s) === o);
+      e && B.find((s) => s.id === o)?.blockedReason === void 0 && T(
+        x({
+          min: e.min,
+          max: e.max
         })
       );
     },
-    [D, R]
-  ), M = y(() => {
-    l(null);
-  }, []), _ = A.isPending || g.isPending || v.isPending, T = y(async () => {
-    if (!e || !p || !p.isValid)
+    [M, B, T]
+  ), z = y(() => {
+    c(null);
+  }, []), F = A.isPending || h.isPending || g.isPending, J = y(async () => {
+    if (!t || !a || !a.isValid)
       return;
-    const o = p.condition, n = yo(
-      e.steps,
-      s.lookup
+    const o = a.condition, e = ko(
+      t.steps,
+      l.lookup
     );
-    if (!n) {
-      h.error(r.approverUnavailable);
+    if (!e) {
+      P.error(i.approverUnavailable);
       return;
     }
-    const u = ao(o), i = so(n), t = V(o, r);
+    const s = bo(o), r = Io(e), n = $(o, i);
     try {
-      e.policyId === null ? await A.mutateAsync({
+      t.policyId === null ? await A.mutateAsync({
         body: {
-          object_type: to,
-          name: t,
-          trigger: u,
-          script: i,
-          priority: no(
-            m.map((c) => c.priority)
+          object_type: yo,
+          name: n,
+          trigger: s,
+          script: r,
+          priority: ho(
+            u.map((m) => m.priority)
           )
         }
-      }) : await g.mutateAsync({
-        path: { approval_policy_id: e.policyId },
-        body: { name: t, trigger: u, script: i }
-      }), l(null), h.success(r.ruleSaved);
+      }) : await h.mutateAsync({
+        path: { approval_policy_id: t.policyId },
+        body: { name: n, trigger: s, script: r }
+      }), c(null), P.success(i.ruleSaved);
     } catch {
-      h.error(r.ruleSaveFailed);
+      P.error(i.ruleSaveFailed);
     }
   }, [
-    e,
-    p,
-    s.lookup,
-    r,
-    m,
+    t,
+    a,
+    l.lookup,
+    i,
+    u,
     A,
-    g
-  ]), W = y(async () => {
-    if (I)
+    h
+  ]), ao = y(async () => {
+    if (S)
       try {
-        await v.mutateAsync({
-          path: { approval_policy_id: I }
-        }), C(null), l(null), h.success(r.ruleDeleted);
+        await g.mutateAsync({
+          path: { approval_policy_id: S }
+        }), I(null), c(null), P.success(i.ruleDeleted);
       } catch {
-        C(null), h.error(r.ruleDeleteFailed);
+        I(null), P.error(i.ruleDeleteFailed);
       }
-  }, [I, v, r]), q = w || _, U = f(() => {
-    if (!e || !p || _)
+  }, [S, g, i]), po = C || F, W = d(() => {
+    if (!t || !a || F)
       return;
-    const o = K(p.amountErrors, r);
+    const o = oo(a.amountErrors, i);
     if (o)
       return {
-        lower: e.touchedAmount.lower ? o.lower : void 0,
-        upper: e.touchedAmount.upper ? o.upper : void 0
+        lower: t.touchedAmount.lower ? o.lower : void 0,
+        upper: t.touchedAmount.upper ? o.upper : void 0
       };
-  }, [e, p, _, r]), B = f(() => {
-    if (!p || p.isValid)
+  }, [t, a, F, i]), q = d(() => {
+    if (!a || a.isValid)
       return;
-    const o = fo(p.groupErrors, r), n = K(p.amountErrors, r), u = [
+    const o = _o(a.groupErrors, i), e = oo(a.amountErrors, i), s = [
       ...Object.values(o?.steps ?? {}),
-      n?.lower,
-      n?.upper
-    ].filter((t) => !!t), i = [...new Set(u)];
-    return i.length > 0 ? i : void 0;
-  }, [p, r]);
+      e?.lower,
+      e?.upper
+    ].filter((n) => !!n), r = [...new Set(s)];
+    return r.length > 0 ? r : void 0;
+  }, [a, i]);
   return {
-    items: f(() => {
+    items: d(() => {
       const o = {
-        onAmountConditionChange: (i) => l((t) => t && { ...t, amount: i }),
-        onAmountFieldBlur: (i) => l(
-          (t) => t && {
-            ...t,
-            touchedAmount: { ...t.touchedAmount, [i]: !0 }
+        onAmountConditionChange: (r) => c((n) => n && { ...n, amount: r }),
+        onAmountFieldBlur: (r) => c(
+          (n) => n && {
+            ...n,
+            touchedAmount: { ...n.touchedAmount, [r]: !0 }
           }
         ),
-        onApproverStepsChange: (i) => l((t) => t && { ...t, steps: i }),
-        onAddApproverStep: () => l(
-          (i) => i && { ...i, steps: [...i.steps, b()] }
+        onApproverStepsChange: (r) => c((n) => n && { ...n, steps: r }),
+        onAddApproverStep: () => c(
+          (r) => r && { ...r, steps: [...r.steps, k()] }
         ),
-        onRemoveApproverStep: (i) => l(
-          (t) => t && {
-            ...t,
-            steps: t.steps.filter((c) => c.id !== i)
+        onRemoveApproverStep: (r) => c(
+          (n) => n && {
+            ...n,
+            steps: n.steps.filter((m) => m.id !== r)
           }
         )
-      }, n = (i, t, c, O, H) => ({
-        id: i,
-        title: V(t, r),
-        sentence: Co(t, r),
+      }, e = (r, n, m, E, uo) => ({
+        id: r,
+        title: $(n, i),
+        sentence: To(n, i),
         // Decorated here rather than where the steps are created, so both an
         // in-progress draft and a saved policy's chips go through the same rule.
-        approverSteps: c.map(
-          (k) => go(k, s.lookup, r)
+        //
+        // The used-elsewhere locks only ride the open card: they close rows in a
+        // picker, and a collapsed card renders chips instead. Passing them to every
+        // card would also mean marking a rule's own approvers as taken, since
+        // `approverIdsUsedByOtherRules` is relative to whatever is being edited.
+        approverSteps: m.map(
+          (b) => Uo(b, {
+            lookup: l.lookup,
+            labels: i,
+            usedByOtherRules: E ? _ : void 0,
+            usedByOtherSteps: E ? new Set(
+              m.filter((D) => D.id !== b.id).flatMap(
+                (D) => D.selectedItems.map((co) => co.id)
+              )
+            ) : void 0
+          })
         ),
         // A second approval step is only meaningful once the one above it names an
         // approver: an empty step saves nothing and already fails validation.
-        addApproverStepDisabled: c.some(
-          (k) => k.selectedItems.length === 0
+        addApproverStepDisabled: m.some(
+          (b) => b.selectedItems.length === 0
         ),
-        approverOptions: s.options,
-        amountCondition: L(t),
-        amountConditionErrors: O ? U : void 0,
+        approverOptions: l.options,
+        amountCondition: x(n),
+        amountConditionErrors: E ? W : void 0,
         onEdit: () => {
-          l({
-            policyId: i,
-            amount: L(t),
-            steps: c,
-            touchedAmount: j
+          c({
+            policyId: r,
+            amount: x(n),
+            steps: m,
+            originalApproverIds: new Set(
+              m.flatMap((b) => b.selectedItems.map((D) => D.id))
+            ),
+            touchedAmount: to
           });
         },
-        onCancel: M,
+        onCancel: z,
         onSave: () => {
-          T();
+          J();
         },
-        onDelete: H,
+        onDelete: uo,
         // Not `isBusy`: that rides the card's own `disabled`, which disables Save
         // as well. This is the "not valid yet" half, and the reasons below are
         // what a disabled Save says when the user reaches for it.
-        saveDisabled: O && p ? !p.isValid : !1,
-        saveDisabledReasons: O ? B : void 0,
-        labels: d?.policyCard,
+        saveDisabled: E && a ? !a.isValid : !1,
+        saveDisabledReasons: E ? q : void 0,
+        labels: f?.policyCard,
         ...o
-      }), u = E.map((i) => {
-        const t = $ === i.id, c = n(
-          i.id,
-          i.condition,
-          t && e ? e.steps : i.steps,
-          t,
-          () => C(i.id)
+      }), s = v.map((r) => {
+        const n = O === r.id, m = e(
+          r.id,
+          r.condition,
+          n && t ? t.steps : r.steps,
+          n,
+          () => I(r.id)
         );
-        return t && e ? { ...c, amountCondition: e.amount } : c;
+        return n && t ? { ...m, amountCondition: t.amount } : m;
       });
-      return e?.policyId === null && u.unshift({
-        ...n(
-          N,
+      return t?.policyId === null && s.unshift({
+        ...e(
+          eo,
           // A brand-new rule has no saved condition; the heading falls back to
           // the "any amount" copy until bounds are typed.
           {},
-          e.steps,
+          t.steps,
           !0,
           // No Delete at all: nothing exists server-side to delete, and Cancel
           // already discards the rule being written.
           void 0
         ),
-        amountCondition: e.amount
-      }), u;
+        amountCondition: t.amount,
+        // Only the draft carries the ref: it is the one card that can appear
+        // outside the viewport without the user having scrolled there.
+        ref: Q
+      }), s;
     }, [
-      E,
-      e,
-      $,
-      U,
-      B,
-      p,
-      r,
-      d?.policyCard,
-      s.options,
-      s.lookup,
-      M,
-      b,
-      T
+      v,
+      t,
+      O,
+      W,
+      q,
+      a,
+      i,
+      f?.policyCard,
+      l.options,
+      l.lookup,
+      _,
+      z,
+      k,
+      J
     ]),
-    editingId: $,
-    gaps: Ao(D, r),
-    onAddRule: z,
-    onSelectGap: J,
-    isBusy: q,
-    isLoading: w,
-    isError: a.isError || s.isError,
+    editingId: O,
+    gaps: B,
+    unlistedPoliciesHeading: Mo(
+      w.length,
+      i
+    ),
+    unlistedPoliciesBlockAmounts: w.some(
+      (o) => o.hasKnownCondition
+    ),
+    unlistedPoliciesStillApply: w.some(
+      (o) => o.isActive
+    ),
+    onAddRule: so,
+    addRuleDisabledReason: io,
+    onSelectGap: lo,
+    isBusy: po,
+    isLoading: C,
+    isError: p.isError || l.isError,
     onRetry: () => {
-      a.refetch(), s.refetch();
+      p.refetch(), l.refetch();
     },
     deleteDialog: {
-      open: I !== null,
-      isDeleting: v.isPending,
+      open: S !== null,
+      isDeleting: g.isPending,
       onOpenChange: (o) => {
-        o || C(null);
+        o || I(null);
       },
       onConfirm: () => {
-        W();
+        ao();
       },
-      onCancel: () => C(null)
+      onCancel: () => I(null)
     }
   };
 }
 export {
-  N as DRAFT_POLICY_ID,
-  zo as useApprovalPolicyRules
+  eo as DRAFT_POLICY_ID,
+  se as useApprovalPolicyRules
 };