@boxcustodia/library 1.6.1 → 1.6.3

package/dist/index.es296.js

@@ -1,78 +1,423 @@
-import { __exports as o } from "./index.es304.js";
-Object.defineProperty(o, "__esModule", {
-  value: !0
-});
-o.printIteratorEntries = y;
-o.printIteratorValues = x;
-o.printListItems = I;
-o.printObjectProperties = b;
-const d = (s, e) => {
-  const u = Object.keys(s).sort(e);
-  return Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(s).forEach((l) => {
-    Object.getOwnPropertyDescriptor(s, l).enumerable && u.push(l);
-  }), u;
-};
-function y(s, e, u, l, i, a, t = ": ") {
-  let n = "", r = s.next();
-  if (!r.done) {
-    n += e.spacingOuter;
-    const p = u + e.indent;
-    for (; !r.done; ) {
-      const O = a(
-        r.value[0],
-        e,
-        p,
-        l,
-        i
-      ), c = a(
-        r.value[1],
-        e,
-        p,
-        l,
-        i
-      );
-      n += p + O + t + c, r = s.next(), r.done ? e.min || (n += ",") : n += "," + e.spacingInner;
+import { isElementVisible as V } from "./index.es467.js";
+import { createShadowTreeWalker as B } from "./index.es420.js";
+import { getActiveElement as T, getEventTarget as S } from "./index.es421.js";
+import { getOwnerDocument as N } from "./index.es423.js";
+import { useLayoutEffect as E } from "./index.es368.js";
+import { isAndroid as H, isChrome as J } from "./index.es426.js";
+import { isTabbable as U, isFocusable as j } from "./index.es443.js";
+import { getInteractionModality as G } from "./index.es451.js";
+import { focusSafely as Q } from "./index.es462.js";
+import L, { useRef as F, useContext as X, useMemo as k, useEffect as z } from "react";
+const I = /* @__PURE__ */ L.createContext(null), M = "react-aria-focus-scope-restore";
+let s = null;
+function ve(e) {
+  let { children: t, contain: r, restoreFocus: a, autoFocus: n } = e, i = F(null), u = F(null), o = F([]), { parentNode: b } = X(I) || {}, l = k(() => new A({
+    scopeRef: o
+  }), [
+    o
+  ]);
+  E(() => {
+    let c = b || $.root;
+    if ($.getTreeNode(c.scopeRef) && s && !R(s, c.scopeRef)) {
+      let f = $.getTreeNode(s);
+      f && (c = f);
+    }
+    c.addChild(l), $.addNode(l);
+  }, [
+    l,
+    b
+  ]), E(() => {
+    let c = $.getTreeNode(o);
+    c && (c.contain = !!r);
+  }, [
+    r
+  ]), E(() => {
+    var c;
+    let f = (c = i.current) === null || c === void 0 ? void 0 : c.nextSibling, p = [], y = (C) => C.stopPropagation();
+    for (; f && f !== u.current; )
+      p.push(f), f.addEventListener(M, y), f = f.nextSibling;
+    return o.current = p, () => {
+      for (let C of p) C.removeEventListener(M, y);
+    };
+  }, [
+    t
+  ]), te(o, a, r), Z(o, r), re(o, a, r), ee(o, n), z(() => {
+    const c = T(N(o.current ? o.current[0] : void 0));
+    let f = null;
+    if (m(c, o.current)) {
+      for (let p of $.traverse()) p.scopeRef && m(c, p.scopeRef.current) && (f = p);
+      f === $.getTreeNode(o) && (s = f.scopeRef);
+    }
+  }, [
+    o
+  ]), E(() => () => {
+    var c, f, p;
+    let y = (p = (f = $.getTreeNode(o)) === null || f === void 0 || (c = f.parent) === null || c === void 0 ? void 0 : c.scopeRef) !== null && p !== void 0 ? p : null;
+    (o === s || R(o, s)) && (!y || $.getTreeNode(y)) && (s = y), $.removeTreeNode(o);
+  }, [
+    o
+  ]);
+  let v = k(() => Y(o), []), d = k(() => ({
+    focusManager: v,
+    parentNode: l
+  }), [
+    l,
+    v
+  ]);
+  return /* @__PURE__ */ L.createElement(I.Provider, {
+    value: d
+  }, /* @__PURE__ */ L.createElement("span", {
+    "data-focus-scope-start": !0,
+    hidden: !0,
+    ref: i
+  }), t, /* @__PURE__ */ L.createElement("span", {
+    "data-focus-scope-end": !0,
+    hidden: !0,
+    ref: u
+  }));
+}
+function Y(e) {
+  return {
+    focusNext(t = {}) {
+      let r = e.current, { from: a, tabbable: n, wrap: i, accept: u } = t;
+      var o;
+      let b = a || T(N((o = r[0]) !== null && o !== void 0 ? o : void 0)), l = r[0].previousElementSibling, v = w(r), d = g(v, {
+        tabbable: n,
+        accept: u
+      }, r);
+      d.currentNode = m(b, r) ? b : l;
+      let c = d.nextNode();
+      return !c && i && (d.currentNode = l, c = d.nextNode()), c && h(c, !0), c;
+    },
+    focusPrevious(t = {}) {
+      let r = e.current, { from: a, tabbable: n, wrap: i, accept: u } = t;
+      var o;
+      let b = a || T(N((o = r[0]) !== null && o !== void 0 ? o : void 0)), l = r[r.length - 1].nextElementSibling, v = w(r), d = g(v, {
+        tabbable: n,
+        accept: u
+      }, r);
+      d.currentNode = m(b, r) ? b : l;
+      let c = d.previousNode();
+      return !c && i && (d.currentNode = l, c = d.previousNode()), c && h(c, !0), c;
+    },
+    focusFirst(t = {}) {
+      let r = e.current, { tabbable: a, accept: n } = t, i = w(r), u = g(i, {
+        tabbable: a,
+        accept: n
+      }, r);
+      u.currentNode = r[0].previousElementSibling;
+      let o = u.nextNode();
+      return o && h(o, !0), o;
+    },
+    focusLast(t = {}) {
+      let r = e.current, { tabbable: a, accept: n } = t, i = w(r), u = g(i, {
+        tabbable: a,
+        accept: n
+      }, r);
+      u.currentNode = r[r.length - 1].nextElementSibling;
+      let o = u.previousNode();
+      return o && h(o, !0), o;
+    }
+  };
+}
+function w(e) {
+  return e[0].parentElement;
+}
+function _(e) {
+  let t = $.getTreeNode(s);
+  for (; t && t.scopeRef !== e; ) {
+    if (t.contain) return !1;
+    t = t.parent;
+  }
+  return !0;
+}
+function Z(e, t) {
+  let r = F(void 0), a = F(void 0);
+  E(() => {
+    let n = e.current;
+    if (!t) {
+      a.current && (cancelAnimationFrame(a.current), a.current = void 0);
+      return;
+    }
+    const i = N(n ? n[0] : void 0);
+    let u = (l) => {
+      if (l.key !== "Tab" || l.altKey || l.ctrlKey || l.metaKey || !_(e) || l.isComposing) return;
+      let v = T(i), d = e.current;
+      if (!d || !m(v, d)) return;
+      let c = w(d), f = g(c, {
+        tabbable: !0
+      }, d);
+      if (!v) return;
+      f.currentNode = v;
+      let p = l.shiftKey ? f.previousNode() : f.nextNode();
+      p || (f.currentNode = l.shiftKey ? d[d.length - 1].nextElementSibling : d[0].previousElementSibling, p = l.shiftKey ? f.previousNode() : f.nextNode()), l.preventDefault(), p && h(p, !0);
+    }, o = (l) => {
+      (!s || R(s, e)) && m(S(l), e.current) ? (s = e, r.current = S(l)) : _(e) && !x(S(l), e) ? r.current ? r.current.focus() : s && s.current && K(s.current) : _(e) && (r.current = S(l));
+    }, b = (l) => {
+      a.current && cancelAnimationFrame(a.current), a.current = requestAnimationFrame(() => {
+        let v = G(), d = (v === "virtual" || v === null) && H() && J(), c = T(i);
+        if (!d && c && _(e) && !x(c, e)) {
+          s = e;
+          let p = S(l);
+          if (p && p.isConnected) {
+            var f;
+            r.current = p, (f = r.current) === null || f === void 0 || f.focus();
+          } else s.current && K(s.current);
+        }
+      });
+    };
+    return i.addEventListener("keydown", u, !1), i.addEventListener("focusin", o, !1), n == null || n.forEach((l) => l.addEventListener("focusin", o, !1)), n == null || n.forEach((l) => l.addEventListener("focusout", b, !1)), () => {
+      i.removeEventListener("keydown", u, !1), i.removeEventListener("focusin", o, !1), n == null || n.forEach((l) => l.removeEventListener("focusin", o, !1)), n == null || n.forEach((l) => l.removeEventListener("focusout", b, !1));
+    };
+  }, [
+    e,
+    t
+  ]), E(() => () => {
+    a.current && cancelAnimationFrame(a.current);
+  }, [
+    a
+  ]);
+}
+function W(e) {
+  return x(e);
+}
+function m(e, t) {
+  return !e || !t ? !1 : t.some((r) => r.contains(e));
+}
+function x(e, t = null) {
+  if (e instanceof Element && e.closest("[data-react-aria-top-layer]")) return !0;
+  for (let { scopeRef: r } of $.traverse($.getTreeNode(t)))
+    if (r && m(e, r.current)) return !0;
+  return !1;
+}
+function R(e, t) {
+  var r;
+  let a = (r = $.getTreeNode(t)) === null || r === void 0 ? void 0 : r.parent;
+  for (; a; ) {
+    if (a.scopeRef === e) return !0;
+    a = a.parent;
+  }
+  return !1;
+}
+function h(e, t = !1) {
+  if (e != null && !t) try {
+    Q(e);
+  } catch {
+  }
+  else if (e != null) try {
+    e.focus();
+  } catch {
+  }
+}
+function q(e, t = !0) {
+  let r = e[0].previousElementSibling, a = w(e), n = g(a, {
+    tabbable: t
+  }, e);
+  n.currentNode = r;
+  let i = n.nextNode();
+  return t && !i && (a = w(e), n = g(a, {
+    tabbable: !1
+  }, e), n.currentNode = r, i = n.nextNode()), i;
+}
+function K(e, t = !0) {
+  h(q(e, t));
+}
+function ee(e, t) {
+  const r = L.useRef(t);
+  z(() => {
+    if (r.current) {
+      s = e;
+      const a = N(e.current ? e.current[0] : void 0);
+      !m(T(a), s.current) && e.current && K(e.current);
+    }
+    r.current = !1;
+  }, [
+    e
+  ]);
+}
+function te(e, t, r) {
+  E(() => {
+    if (t || r) return;
+    let a = e.current;
+    const n = N(a ? a[0] : void 0);
+    let i = (u) => {
+      let o = S(u);
+      m(o, e.current) ? s = e : W(o) || (s = null);
+    };
+    return n.addEventListener("focusin", i, !1), a == null || a.forEach((u) => u.addEventListener("focusin", i, !1)), () => {
+      n.removeEventListener("focusin", i, !1), a == null || a.forEach((u) => u.removeEventListener("focusin", i, !1));
+    };
+  }, [
+    e,
+    t,
+    r
+  ]);
+}
+function P(e) {
+  let t = $.getTreeNode(s);
+  for (; t && t.scopeRef !== e; ) {
+    if (t.nodeToRestore) return !1;
+    t = t.parent;
+  }
+  return (t == null ? void 0 : t.scopeRef) === e;
+}
+function re(e, t, r) {
+  const a = F(typeof document < "u" ? T(N(e.current ? e.current[0] : void 0)) : null);
+  E(() => {
+    let n = e.current;
+    const i = N(n ? n[0] : void 0);
+    if (!t || r) return;
+    let u = () => {
+      (!s || R(s, e)) && m(T(i), e.current) && (s = e);
+    };
+    return i.addEventListener("focusin", u, !1), n == null || n.forEach((o) => o.addEventListener("focusin", u, !1)), () => {
+      i.removeEventListener("focusin", u, !1), n == null || n.forEach((o) => o.removeEventListener("focusin", u, !1));
+    };
+  }, [
+    e,
+    r
+  ]), E(() => {
+    const n = N(e.current ? e.current[0] : void 0);
+    if (!t) return;
+    let i = (u) => {
+      if (u.key !== "Tab" || u.altKey || u.ctrlKey || u.metaKey || !_(e) || u.isComposing) return;
+      let o = n.activeElement;
+      if (!x(o, e) || !P(e)) return;
+      let b = $.getTreeNode(e);
+      if (!b) return;
+      let l = b.nodeToRestore, v = g(n.body, {
+        tabbable: !0
+      });
+      v.currentNode = o;
+      let d = u.shiftKey ? v.previousNode() : v.nextNode();
+      if ((!l || !l.isConnected || l === n.body) && (l = void 0, b.nodeToRestore = void 0), (!d || !x(d, e)) && l) {
+        v.currentNode = l;
+        do
+          d = u.shiftKey ? v.previousNode() : v.nextNode();
+        while (x(d, e));
+        u.preventDefault(), u.stopPropagation(), d ? h(d, !0) : W(l) ? h(l, !0) : o.blur();
+      }
+    };
+    return r || n.addEventListener("keydown", i, !0), () => {
+      r || n.removeEventListener("keydown", i, !0);
+    };
+  }, [
+    e,
+    t,
+    r
+  ]), E(() => {
+    const n = N(e.current ? e.current[0] : void 0);
+    if (!t) return;
+    let i = $.getTreeNode(e);
+    if (i) {
+      var u;
+      return i.nodeToRestore = (u = a.current) !== null && u !== void 0 ? u : void 0, () => {
+        let o = $.getTreeNode(e);
+        if (!o) return;
+        let b = o.nodeToRestore, l = T(n);
+        if (t && b && (l && x(l, e) || l === n.body && P(e))) {
+          let v = $.clone();
+          requestAnimationFrame(() => {
+            if (n.activeElement === n.body) {
+              let d = v.getTreeNode(e);
+              for (; d; ) {
+                if (d.nodeToRestore && d.nodeToRestore.isConnected) {
+                  O(d.nodeToRestore);
+                  return;
+                }
+                d = d.parent;
+              }
+              for (d = v.getTreeNode(e); d; ) {
+                if (d.scopeRef && d.scopeRef.current && $.getTreeNode(d.scopeRef)) {
+                  let c = q(d.scopeRef.current, !0);
+                  O(c);
+                  return;
+                }
+                d = d.parent;
+              }
+            }
+          });
+        }
+      };
     }
-    n += e.spacingOuter + u;
-  }
-  return n;
-}
-function x(s, e, u, l, i, a) {
-  let t = "", n = s.next();
-  if (!n.done) {
-    t += e.spacingOuter;
-    const r = u + e.indent;
-    for (; !n.done; )
-      t += r + a(n.value, e, r, l, i), n = s.next(), n.done ? e.min || (t += ",") : t += "," + e.spacingInner;
-    t += e.spacingOuter + u;
-  }
-  return t;
-}
-function I(s, e, u, l, i, a) {
-  let t = "";
-  if (s.length) {
-    t += e.spacingOuter;
-    const n = u + e.indent;
-    for (let r = 0; r < s.length; r++)
-      t += n, r in s && (t += a(s[r], e, n, l, i)), r < s.length - 1 ? t += "," + e.spacingInner : e.min || (t += ",");
-    t += e.spacingOuter + u;
-  }
-  return t;
-}
-function b(s, e, u, l, i, a) {
-  let t = "";
-  const n = d(s, e.compareKeys);
-  if (n.length) {
-    t += e.spacingOuter;
-    const r = u + e.indent;
-    for (let p = 0; p < n.length; p++) {
-      const O = n[p], c = a(O, e, r, l, i), m = a(s[O], e, r, l, i);
-      t += r + c + ": " + m, p < n.length - 1 ? t += "," + e.spacingInner : e.min || (t += ",");
+  }, [
+    e,
+    t
+  ]);
+}
+function O(e) {
+  e.dispatchEvent(new CustomEvent(M, {
+    bubbles: !0,
+    cancelable: !0
+  })) && h(e);
+}
+function g(e, t, r) {
+  let a = t != null && t.tabbable ? U : j, n = (e == null ? void 0 : e.nodeType) === Node.ELEMENT_NODE ? e : null, i = N(n), u = B(i, e || i, NodeFilter.SHOW_ELEMENT, {
+    acceptNode(o) {
+      var b;
+      return !(t == null || (b = t.from) === null || b === void 0) && b.contains(o) ? NodeFilter.FILTER_REJECT : a(o) && V(o) && (!r || m(o, r)) && (!(t != null && t.accept) || t.accept(o)) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
     }
-    t += e.spacingOuter + u;
+  });
+  return t != null && t.from && (u.currentNode = t.from), u;
+}
+class D {
+  get size() {
+    return this.fastMap.size;
+  }
+  getTreeNode(t) {
+    return this.fastMap.get(t);
+  }
+  addTreeNode(t, r, a) {
+    let n = this.fastMap.get(r ?? null);
+    if (!n) return;
+    let i = new A({
+      scopeRef: t
+    });
+    n.addChild(i), i.parent = n, this.fastMap.set(t, i), a && (i.nodeToRestore = a);
+  }
+  addNode(t) {
+    this.fastMap.set(t.scopeRef, t);
+  }
+  removeTreeNode(t) {
+    if (t === null) return;
+    let r = this.fastMap.get(t);
+    if (!r) return;
+    let a = r.parent;
+    for (let i of this.traverse()) i !== r && r.nodeToRestore && i.nodeToRestore && r.scopeRef && r.scopeRef.current && m(i.nodeToRestore, r.scopeRef.current) && (i.nodeToRestore = r.nodeToRestore);
+    let n = r.children;
+    a && (a.removeChild(r), n.size > 0 && n.forEach((i) => a && a.addChild(i))), this.fastMap.delete(r.scopeRef);
+  }
+  // Pre Order Depth First
+  *traverse(t = this.root) {
+    if (t.scopeRef != null && (yield t), t.children.size > 0) for (let r of t.children) yield* this.traverse(r);
+  }
+  clone() {
+    var t;
+    let r = new D();
+    var a;
+    for (let n of this.traverse()) r.addTreeNode(n.scopeRef, (a = (t = n.parent) === null || t === void 0 ? void 0 : t.scopeRef) !== null && a !== void 0 ? a : null, n.nodeToRestore);
+    return r;
+  }
+  constructor() {
+    this.fastMap = /* @__PURE__ */ new Map(), this.root = new A({
+      scopeRef: null
+    }), this.fastMap.set(null, this.root);
+  }
+}
+class A {
+  addChild(t) {
+    this.children.add(t), t.parent = this;
+  }
+  removeChild(t) {
+    this.children.delete(t), t.parent = void 0;
+  }
+  constructor(t) {
+    this.children = /* @__PURE__ */ new Set(), this.contain = !1, this.scopeRef = t.scopeRef;
   }
-  return t;
 }
+let $ = new D();
 export {
-  o as default
+  ve as FocusScope,
+  $ as focusScopeTree,
+  g as getFocusableTreeWalker
 };

package/dist/index.es297.js

@@ -1,37 +1,15 @@
-import { __exports as r } from "./index.es305.js";
-import "./index.es296.js";
-import { __exports as p } from "./index.es304.js";
-Object.defineProperty(r, "__esModule", {
-  value: !0
-});
-r.test = r.serialize = r.default = void 0;
-var c = p, l = function() {
-  return typeof globalThis < "u" ? globalThis : typeof l < "u" ? l : typeof self < "u" ? self : typeof window < "u" ? window : Function("return this")();
-}(), f = l["jest-symbol-do-not-touch"] || l.Symbol;
-const g = typeof f == "function" && f.for ? f.for("jest.asymmetricMatcher") : 1267621, u = " ", m = (e, n, o, i, s, a) => {
-  const t = e.toString();
-  return t === "ArrayContaining" || t === "ArrayNotContaining" ? ++i > n.maxDepth ? "[" + t + "]" : t + u + "[" + (0, c.printListItems)(
-    e.sample,
-    n,
-    o,
-    i,
-    s,
-    a
-  ) + "]" : t === "ObjectContaining" || t === "ObjectNotContaining" ? ++i > n.maxDepth ? "[" + t + "]" : t + u + "{" + (0, c.printObjectProperties)(
-    e.sample,
-    n,
-    o,
-    i,
-    s,
-    a
-  ) + "}" : t === "StringMatching" || t === "StringNotMatching" || t === "StringContaining" || t === "StringNotContaining" ? t + u + a(e.sample, n, o, i, s) : e.toAsymmetricMatcher();
+import { getRowId as r } from "./index.es481.js";
+import { useGridSelectionCheckbox as a } from "./index.es487.js";
+function $(e, o) {
+  let { key: c } = e;
+  const { checkboxProps: b } = a(e, o);
+  return {
+    checkboxProps: {
+      ...b,
+      "aria-labelledby": `${b.id} ${r(o, c)}`
+    }
+  };
+}
+export {
+  $ as useGridListSelectionCheckbox
 };
-r.serialize = m;
-const y = (e) => e && e.$$typeof === g;
-r.test = y;
-const b = {
-  serialize: m,
-  test: y
-};
-var d = b;
-r.default = d;

package/dist/index.es298.js

@@ -1,65 +1,37 @@
-import { __exports as t } from "./index.es306.js";
-import { a as i } from "./index.es409.js";
-import { a as p } from "./index.es295.js";
-Object.defineProperty(t, "__esModule", {
-  value: !0
-});
-t.test = t.serialize = t.default = void 0;
-var s = r(i), e = r(p);
-function r(a) {
-  return a && a.__esModule ? a : { default: a };
+import { TreeCollection as c } from "./index.es496.js";
+import { useMultipleSelectionState as f } from "./index.es463.js";
+import { SelectionManager as i } from "./index.es465.js";
+import { useMemo as r, useCallback as u, useEffect as $ } from "react";
+import { useCollection as K } from "./index.es494.js";
+import { useControlledState as x } from "./index.es293.js";
+function C(e) {
+  let { onExpandedChange: a } = e, [t, o] = x(e.expandedKeys ? new Set(e.expandedKeys) : void 0, e.defaultExpandedKeys ? new Set(e.defaultExpandedKeys) : /* @__PURE__ */ new Set(), a), d = f(e), s = r(() => e.disabledKeys ? new Set(e.disabledKeys) : /* @__PURE__ */ new Set(), [
+    e.disabledKeys
+  ]), n = K(e, u((l) => new c(l, {
+    expandedKeys: t
+  }), [
+    t
+  ]), null);
+  return $(() => {
+    d.focusedKey != null && !n.getItem(d.focusedKey) && d.setFocusedKey(null);
+  }, [
+    n,
+    d.focusedKey
+  ]), {
+    collection: n,
+    expandedKeys: t,
+    disabledKeys: s,
+    toggleKey: (l) => {
+      o(y(t, l));
+    },
+    setExpandedKeys: o,
+    selectionManager: new i(n, d)
+  };
 }
-const g = (a) => a.replace((0, s.default)(), (l) => {
-  switch (l) {
-    case e.default.red.close:
-    case e.default.green.close:
-    case e.default.cyan.close:
-    case e.default.gray.close:
-    case e.default.white.close:
-    case e.default.yellow.close:
-    case e.default.bgRed.close:
-    case e.default.bgGreen.close:
-    case e.default.bgYellow.close:
-    case e.default.inverse.close:
-    case e.default.dim.close:
-    case e.default.bold.close:
-    case e.default.reset.open:
-    case e.default.reset.close:
-      return "</>";
-    case e.default.red.open:
-      return "<red>";
-    case e.default.green.open:
-      return "<green>";
-    case e.default.cyan.open:
-      return "<cyan>";
-    case e.default.gray.open:
-      return "<gray>";
-    case e.default.white.open:
-      return "<white>";
-    case e.default.yellow.open:
-      return "<yellow>";
-    case e.default.bgRed.open:
-      return "<bgRed>";
-    case e.default.bgGreen.open:
-      return "<bgGreen>";
-    case e.default.bgYellow.open:
-      return "<bgYellow>";
-    case e.default.inverse.open:
-      return "<inverse>";
-    case e.default.dim.open:
-      return "<dim>";
-    case e.default.bold.open:
-      return "<bold>";
-    default:
-      return "";
-  }
-}), n = (a) => typeof a == "string" && !!a.match((0, s.default)());
-t.test = n;
-const u = (a, l, o, c, d, f) => f(g(a), l, o, c, d);
-t.serialize = u;
-const y = {
-  serialize: u,
-  test: n
+function y(e, a) {
+  let t = new Set(e);
+  return t.has(a) ? t.delete(a) : t.add(a), t;
+}
+export {
+  C as useTreeState
 };
-var b = y;
-t.default = b;