hys-ui 0.4.0 → 0.6.0

package/dist/components/HysSortableList/SortableGhost/SortableGhost.vue.js

@@ -0,0 +1,7 @@
+import o from "./SortableGhost2.vue.js";
+/* empty css                   */
+import t from "../../../_virtual/_plugin-vue_export-helper.js";
+const f = /* @__PURE__ */ t(o, [["__scopeId", "data-v-e5f0c51b"]]);
+export {
+  f as default
+};

package/dist/components/HysSortableList/SortableGhost/SortableGhost2.vue.js

@@ -0,0 +1,43 @@
+import { defineComponent as r, openBlock as e, createElementBlock as n, mergeProps as o, createElementVNode as i, normalizeStyle as s, normalizeClass as d, renderSlot as c, createCommentVNode as u } from "vue";
+const g = { key: 0 }, y = /* @__PURE__ */ r({
+  __name: "SortableGhost",
+  props: {
+    track: {},
+    appearance: {},
+    motion: { type: Boolean },
+    ghostClass: {},
+    ghostStyle: { type: [Boolean, null, String, Object, Array] }
+  },
+  setup(t) {
+    return (l, h) => {
+      var a;
+      return e(), n("div", o(t.appearance, {
+        class: ["hys-sort-ghost", {
+          "hys-sort-returning": t.motion && t.track.returning.value,
+          "hys-sort-landing": t.motion && t.track.landing.value
+        }],
+        style: {
+          transform: "translate3d(" + t.track.position.value.x + "px," + t.track.position.value.y + "px,0)",
+          width: t.track.width + "px",
+          "--hys-sort-landing-duration": t.track.landing.value ? t.track.landing.value.duration + "ms" : void 0,
+          "--hys-sort-landing-easing": (a = t.track.landing.value) == null ? void 0 : a.easing
+        },
+        "aria-hidden": "true"
+      }), [
+        i("div", {
+          class: d(["hys-sort-ghost-card", t.ghostClass]),
+          style: s(t.ghostStyle)
+        }, [
+          c(l.$slots, "default", {
+            drag: t.track.drag,
+            allowed: t.track.allowed.value
+          }, void 0, !0),
+          t.track.allowed.value ? u("", !0) : (e(), n("small", g, "不可放置"))
+        ], 6)
+      ], 16);
+    };
+  }
+});
+export {
+  y as default
+};

package/dist/components/HysSortableList/SortableGhost/useSortGhost.js

@@ -0,0 +1,54 @@
+import { shallowRef as y, watch as C, ref as d } from "vue";
+let x = 0;
+function L(o, c) {
+  const i = y(null);
+  let f, r, s;
+  function h(t, e, n) {
+    u(!1), r = e.getBoundingClientRect(), i.value = {
+      drag: t,
+      width: Math.max(96, Math.min(r.width || 200, 360)),
+      position: d(n),
+      returning: d(!1),
+      landing: d(null),
+      allowed: d(!0)
+    };
+  }
+  function u(t, e) {
+    clearTimeout(f), s == null || s(), s = void 0;
+    const n = i.value;
+    if (!t || !n || !r || !o()) {
+      i.value = null;
+      return;
+    }
+    const l = e != null && e.isConnected ? e.getBoundingClientRect() : r;
+    n.landing.value = null, n.returning.value = !0, n.position.value = { x: l.left, y: l.top }, f = setTimeout(() => {
+      i.value === n && (i.value = null);
+    }, 200);
+  }
+  function p(t) {
+    const e = i.value, { duration: n, easing: l } = c();
+    if (!e || !o() || !Number.isFinite(n) || n <= 0 || !(t != null && t.isConnected))
+      return u(!1);
+    const v = String(++x);
+    t.style.setProperty("--hys-sort-landing-duration", `${n}ms`), t.dataset.sortLanding = v, s = () => {
+      t.dataset.sortLanding === v && (delete t.dataset.sortLanding, t.style.removeProperty("--hys-sort-landing-duration"));
+    };
+    const a = t.getBoundingClientRect(), g = t.ownerDocument.defaultView;
+    if (!a.width || !a.height || !g || a.right <= 0 || a.bottom <= 0 || a.left >= g.innerWidth || a.top >= g.innerHeight)
+      return u(!1);
+    e.landing.value = { duration: n, easing: l }, e.position.value = { x: a.left, y: a.top }, f = setTimeout(() => u(!1), n);
+  }
+  function m(t, e) {
+    const n = i.value;
+    return !n || !o() || c().duration <= 0 ? (u(!1), t()) : t((l) => {
+      i.value === n && p(l);
+    }).then((l) => (!l && i.value === n && u(!0, e()), l));
+  }
+  return C(o, (t) => {
+    const e = i.value;
+    !t && (e != null && e.landing.value || e != null && e.returning.value) && u(!1);
+  }), { ghost: i, show: h, clear: u, release: m };
+}
+export {
+  L as useSortGhost
+};

package/dist/components/HysSortableList/geometry.js

@@ -0,0 +1,230 @@
+import { layoutOf as E, portAt as L, keyToken as O, linkedPorts as I } from "./model.js";
+function X(t) {
+  return t.handle === !1 || t.showHandle === !1 && typeof t.handle != "string";
+}
+function j(t, e, n) {
+  var s;
+  const r = Array.from(t.childNodes).filter(
+    (i) => {
+      var c;
+      return i.nodeType === Node.TEXT_NODE && ((c = i.textContent) == null ? void 0 : c.trim());
+    }
+  );
+  if (!r.length || ((s = t.ownerDocument.defaultView) == null ? void 0 : s.getComputedStyle(t).userSelect) === "none")
+    return !1;
+  const o = t.ownerDocument.createRange();
+  return r.some((i) => {
+    var c;
+    return o.selectNodeContents(i), Array.from(((c = o.getClientRects) == null ? void 0 : c.call(o)) ?? []).some(
+      ({ left: a, right: l, top: d, bottom: h, width: f }) => f > 0 && e >= a && e <= l && n >= d && n <= h
+    );
+  });
+}
+function F(t, e, n, r) {
+  if (r && !("reason" in r)) {
+    if (r.source === t && t.props.livePreview !== !1 && !(t.props.virtual && n.source === "keyboard"))
+      return { key: n.keys[0], position: "before" };
+    const o = r.proposal.index;
+    if (o !== e.index) {
+      const s = t.data().items, i = s[o] ?? s.at(-1);
+      if (i)
+        return {
+          key: t.key(i),
+          position: o < s.length ? "before" : "after"
+        };
+    }
+  }
+  return { key: e.anchor, position: e.position };
+}
+const u = (t, e, n) => Math.max(e, Math.min(n, t)), S = (t) => Array.from(t.children).filter(
+  (e) => e instanceof HTMLElement && e.dataset.sortKey !== void 0
+), y = (t, e) => Math.hypot(
+  t.x - u(t.x, e.left, e.right),
+  t.y - u(t.y, e.top, e.bottom)
+);
+function Y(t, e, n) {
+  var d;
+  const { axis: r, bounds: o } = t.props, s = r === "y" ? n.x : e.x, i = r === "x" ? n.y : e.y, c = o === "list" ? t.root() : typeof o == "function" ? o() : typeof o == "object" ? o : void 0, a = c == null ? void 0 : c.getBoundingClientRect(), l = (d = t.root()) == null ? void 0 : d.ownerDocument.defaultView;
+  return a ? {
+    point: {
+      x: u(s, a.left, a.right),
+      y: u(i, a.top, a.bottom)
+    },
+    inside: y({ x: s, y: i }, a) === 0
+  } : l ? {
+    point: {
+      x: u(s, 0, l.innerWidth),
+      y: u(i, 0, l.innerHeight)
+    },
+    inside: s >= 0 && i >= 0 && s < l.innerWidth && i < l.innerHeight
+  } : { point: { x: s, y: i }, inside: !0 };
+}
+function W(t) {
+  var s;
+  if (!t) return 1;
+  const e = Number(t.dataset.sortColumns);
+  if (e > 0) return e;
+  const n = S(t), r = ((s = n[0]) == null ? void 0 : s.getBoundingClientRect().top) ?? 0, o = n.findIndex(
+    (i) => Math.abs(i.getBoundingClientRect().top - r) > 2
+  );
+  return o > 0 ? o : Math.max(1, n.length);
+}
+function A(t, e) {
+  const n = t.getBoundingClientRect();
+  if (!e.some((c) => t.classList.contains(c)))
+    return n;
+  const r = t.ownerDocument.defaultView;
+  if (!(r != null && r.DOMMatrixReadOnly)) return n;
+  const o = r.getComputedStyle(t).transform;
+  if (o === "none") return n;
+  const { m41: s, m42: i } = new r.DOMMatrixReadOnly(o);
+  return {
+    left: n.left - s,
+    right: n.right - s,
+    top: n.top - i,
+    bottom: n.bottom - i,
+    width: n.width,
+    height: n.height
+  };
+}
+function z(t, e, n) {
+  let r, o = 1 / 0;
+  for (const s of S(t)) {
+    const i = A(s, n), c = y(e, i);
+    if (c < o && (o = c, r = { row: s, box: i }, c === 0))
+      break;
+  }
+  return r;
+}
+function P(t, e) {
+  var o;
+  let n, r = 17;
+  for (const s of I(t)) {
+    if (!t.props.snap && !s.props.snap) continue;
+    const i = s.surface();
+    if (!i || i.ownerDocument !== ((o = t.root()) == null ? void 0 : o.ownerDocument) || !i.isConnected)
+      continue;
+    const c = y(e, i.getBoundingClientRect());
+    c < r && (r = c, n = s);
+  }
+  return n;
+}
+function U(t, e) {
+  var b, D;
+  const n = (b = t.root()) == null ? void 0 : b.ownerDocument, r = ((D = n == null ? void 0 : n.elementFromPoint) == null ? void 0 : D.call(n, e.x, e.y)) ?? null, o = L(r) ?? P(t, e), s = o == null ? void 0 : o.surface();
+  if (!o || !s) return { element: r };
+  const i = o.data();
+  if (!i.items.length)
+    return { element: r, candidate: { port: o, index: 0, position: "inside" } };
+  const c = (o.props.moveClass || "hys-sort-motion-move").split(/\s+/).filter(Boolean), a = r == null ? void 0 : r.closest("[data-sort-key]"), l = (a == null ? void 0 : a.parentElement) === s ? A(a, c) : void 0, d = a && l && y(e, l) === 0 ? { row: a, box: l } : z(s, e, c);
+  if (!d) return { element: r };
+  const { row: h, box: f } = d, g = Number(h.dataset.sortIndex);
+  if (!Number.isInteger(g) || g < 0 || g >= i.items.length)
+    return { element: r };
+  const x = E(o.props), m = x === "horizontal" || x === "grid" && f.width + 1 < s.clientWidth, T = m && getComputedStyle(s).direction === "rtl";
+  let w = m ? e.x >= f.left + f.width / 2 !== T : e.y >= f.top + f.height / 2;
+  e.y < f.top && (w = !1), e.y > f.bottom && (w = !0);
+  const C = t === o && o.props.mode === "swap", p = m ? e.x - f.left : e.y - f.top, M = m ? f.width : f.height, v = u(M * 0.12, 4, 10), B = Math.min(Math.abs(p), Math.abs(M - p)), H = x === "grid" ? Math.min(Math.abs(e.y - f.top), Math.abs(e.y - f.bottom)) : 1 / 0, N = i.items[g];
+  return {
+    element: r,
+    rowKey: h.dataset.sortKey,
+    nearCenter: !C && Math.abs(p - M / 2) <= v,
+    nearEdge: Math.min(B, H) <= v,
+    candidate: {
+      port: o,
+      index: g + (w && !C ? 1 : 0),
+      position: w ? "after" : "before",
+      anchor: o.key(N)
+    }
+  };
+}
+function _(t, e, n) {
+  if (!e || !(n != null && n.candidate) || e.port !== n.candidate.port)
+    return !1;
+  const r = n.candidate;
+  if (r.port === t && t.props.mode === "swap") return n.nearEdge;
+  const o = Math.abs(e.index - r.index);
+  return o === 0 ? n.nearEdge : o === 1 && n.nearCenter;
+}
+function V(t, e, n) {
+  const r = e.data().items, o = r.at(-1), s = r[n] ?? o;
+  return {
+    port: e,
+    index: n,
+    position: r.length ? n >= r.length && (t !== e || e.props.mode !== "swap") ? "after" : "before" : "inside",
+    anchor: s ? e.key(s) : void 0
+  };
+}
+function q(t, e, n) {
+  const r = t.data().keys.get(e);
+  if (r === void 0 || !Number.isInteger(n) || !n) return;
+  const o = r + n;
+  if (!(o < 0 || o >= t.data().items.length))
+    return V(
+      t,
+      t,
+      o + (t.props.mode !== "swap" && n > 0 ? 1 : 0)
+    );
+}
+function G(t, e) {
+  const n = E(t.props), r = n === "horizontal", o = n === "grid", s = t.surface();
+  if (e === "ArrowLeft" || e === "ArrowRight") {
+    if (!r && !o) return 0;
+    const i = s && getComputedStyle(s).direction === "rtl";
+    return e === "ArrowRight" !== i ? 1 : -1;
+  }
+  return e === "ArrowUp" || e === "ArrowDown" ? r ? 0 : (e === "ArrowDown" ? 1 : -1) * (o ? W(s) : 1) : 0;
+}
+function J(t, e) {
+  return (t == null ? void 0 : t.port) === (e == null ? void 0 : e.port) && (t == null ? void 0 : t.index) === (e == null ? void 0 : e.index) && (t == null ? void 0 : t.position) === (e == null ? void 0 : e.position) && (t == null ? void 0 : t.anchor) === (e == null ? void 0 : e.anchor);
+}
+const Q = O;
+function k(t, e, n, r, o) {
+  if (t < e || t > n) return 0;
+  const s = Math.min(r, (n - e) / 2);
+  return s ? t < e + s ? -Math.ceil(o * (1 - (t - e) / s)) : t > n - s ? Math.ceil(o * (1 - (n - t) / s)) : 0 : 0;
+}
+function R(t, e, n, r, o, s) {
+  const i = t.ownerDocument.defaultView;
+  if (!i) return { x: !1, y: !1 };
+  const c = r ? { left: 0, top: 0, right: i.innerWidth, bottom: i.innerHeight } : t.getBoundingClientRect();
+  if (y(e, c) > 0) return { x: !1, y: !1 };
+  const a = getComputedStyle(t), l = u(n.threshold ?? 36, 1, 200), d = u(n.speed ?? 14, 1, 100), h = t.scrollLeft, f = t.scrollTop;
+  return !o && n.axis !== "y" && t.scrollWidth > t.clientWidth && (r || /auto|scroll|overlay/.test(a.overflowX)) && (t.scrollLeft += k(
+    e.x,
+    c.left,
+    c.right,
+    l,
+    d
+  )), !s && n.axis !== "x" && t.scrollHeight > t.clientHeight && (r || /auto|scroll|overlay/.test(a.overflowY)) && (t.scrollTop += k(e.y, c.top, c.bottom, l, d)), { x: t.scrollLeft !== h, y: t.scrollTop !== f };
+}
+function Z(t, e, n) {
+  if (n === !1 || !t) return !1;
+  const r = typeof n == "object" ? n : {}, o = t.ownerDocument.scrollingElement;
+  let s = !1, i = !1;
+  for (let c = t; c && !(s && i); c = c.parentElement) {
+    if (!(c instanceof HTMLElement) || c === o) continue;
+    const a = R(c, e, r, !1, s, i);
+    s || (s = a.x), i || (i = a.y);
+  }
+  if (r.window !== !1 && o instanceof HTMLElement && !(s && i)) {
+    const c = R(o, e, r, !0, s, i);
+    s || (s = c.x), i || (i = c.y);
+  }
+  return s || i;
+}
+export {
+  Z as autoScrollSort,
+  V as candidateAt,
+  F as dropMarkerFor,
+  U as findSortHit,
+  W as gridColumns,
+  j as hitsSelectableText,
+  _ as keepSortCandidate,
+  G as keyStep,
+  q as relativeCandidate,
+  J as sameCandidate,
+  Q as tokenOf,
+  X as wholeRowDrag,
+  Y as withinDragBounds
+};

package/dist/components/HysSortableList/model.js

@@ -0,0 +1,254 @@
+import { toRaw as b } from "vue";
+const g = /* @__PURE__ */ new Map(), P = (t) => t;
+function G(t, o) {
+  return g.set(t, o), () => {
+    g.delete(t);
+  };
+}
+const K = () => Array.from(g.values(), P);
+function H(t) {
+  const o = t == null ? void 0 : t.closest("[data-sort-root]"), s = o && g.get(o);
+  return s ? P(s) : void 0;
+}
+const m = (t) => {
+  const o = t.props.group;
+  return typeof o == "string" ? { name: o } : o;
+};
+function J(t) {
+  var i;
+  const o = m(t);
+  if (!o) return [t];
+  const s = (i = t.root()) == null ? void 0 : i.ownerDocument;
+  return K().filter((e) => {
+    var r, c;
+    if (e === t) return !0;
+    const n = m(e);
+    return !n || ((r = e.root()) == null ? void 0 : r.ownerDocument) !== s || !((c = e.root()) != null && c.isConnected) ? !1 : n.name === o.name || n.put === !0 || typeof n.put == "function" || Array.isArray(n.put) && n.put.includes(o.name);
+  });
+}
+const x = (t) => {
+  var o;
+  return {
+    id: t.id(),
+    group: (o = m(t)) == null ? void 0 : o.name,
+    items: t.data().items
+  };
+}, L = (t) => typeof t == "number" ? `n:${t}` : `s:${t}`, Q = (t) => t.listTag === "table" ? "vertical" : t.layout ?? "vertical", A = (t) => typeof t == "string" || typeof t == "number" && Number.isFinite(t);
+function U(t, o, s) {
+  const i = /* @__PURE__ */ new Map(), e = [], n = Array.isArray(s) ? new Set(s) : void 0;
+  return t.forEach((r, c) => {
+    const a = o(r);
+    A(a) && i.set(a, c);
+    const u = typeof s == "function" ? s(r, c) : n == null ? void 0 : n.has(a);
+    u && e.push({ key: a, index: c, placement: u });
+  }), { keys: i, fixed: e, items: t, valid: i.size === t.length };
+}
+const N = {
+  cancelled: "已取消排序",
+  outside: "请放到可排序区域内",
+  disabled: "该项目或列表已禁用排序",
+  keys: "项目键缺失或重复",
+  group: "这两个列表不允许此操作",
+  capacity: "目标列表已满",
+  fixed: "不能改变固定项目的位置",
+  cycle: "不能将项目移动到自己的子列表",
+  noop: "顺序没有变化",
+  rule: "不符合排序规则",
+  conflict: "列表已更新，请重新操作",
+  save: "保存排序失败"
+};
+function f(t, o, s = N[t], i) {
+  return { reason: t, proposal: o, message: s, error: i };
+}
+const I = (t) => t === !1 || typeof t == "string";
+function T(t, o, s) {
+  var r, c;
+  if (t.props.disabled) return f("disabled");
+  if (!t.data().valid) return f("keys");
+  const i = t.key(o), e = t.props.itemDisabled;
+  if (typeof e == "function" ? e(o, s) : e != null && e.includes(i))
+    return f("disabled");
+  if (t.data().fixed.some((a) => a.key === i))
+    return f("fixed");
+  const n = (c = (r = t.props).canDrag) == null ? void 0 : c.call(r, o, s);
+  if (I(n))
+    return f(
+      "rule",
+      void 0,
+      typeof n == "string" ? n : void 0
+    );
+}
+function V(t, o, s) {
+  const i = t.data();
+  if (!i.valid) return f("keys");
+  const e = Array.from(
+    new Set(o),
+    (n) => i.keys.get(n) ?? -1
+  ).sort((n, r) => n - r);
+  if (!e.length || e[0] < 0) return f("conflict");
+  for (const n of e) {
+    const r = T(t, i.items[n], n);
+    if (r) return r;
+  }
+  return {
+    source: s,
+    from: x(t),
+    indices: e,
+    items: e.map((n) => i.items[n]),
+    keys: e.map((n) => t.key(i.items[n]))
+  };
+}
+function _(t, o, s, i) {
+  if (t === o)
+    return i && i !== "move" ? f("group", s) : "move";
+  const e = m(t), n = m(o);
+  if (!(e != null && e.name) || !(n != null && n.name)) return f("group", s);
+  const r = typeof e.pull == "function" ? e.pull(s) : e.pull;
+  if (r === !1) return f("group", s);
+  const c = typeof r == "string" ? r : "move";
+  if (i && i !== c) return f("group", s);
+  const a = { ...s, operation: c };
+  if (typeof n.put == "function") {
+    const p = n.put(a);
+    return I(p) ? f(
+      "group",
+      a,
+      typeof p == "string" ? p : void 0
+    ) : c;
+  }
+  return (Array.isArray(n.put) ? n.put.includes(e.name) : n.put === !0 || n.put !== !1 && e.name === n.name) ? c : f("group", a);
+}
+function k(t, o) {
+  const s = t.data().fixed;
+  if (!s.length) return !0;
+  const i = new Map(o.map((r, c) => [t.key(r), c])), e = s.filter((r) => r.placement === "top"), n = s.filter((r) => r.placement === "bottom");
+  return e.every((r, c) => i.get(r.key) === c) && n.every(
+    (r, c) => i.get(r.key) === o.length - n.length + c
+  ) && s.every(
+    (r) => r.placement !== !0 || i.get(r.key) === r.index
+  );
+}
+const j = (t, o) => t.length === o.length && t.every((s, i) => b(s) === b(o[i]));
+function F(t, o, s) {
+  const i = o.map((n, r) => s + r);
+  if (i.some(
+    (n) => n >= t.length || o.includes(n)
+  ))
+    return;
+  const e = t.slice();
+  return o.forEach((n, r) => {
+    e[n] = t[i[r]], e[i[r]] = t[n];
+  }), e;
+}
+let w = 0;
+function R(t, o, s) {
+  const i = t.props.clone ?? o.props.clone, e = /* @__PURE__ */ new Set([
+    ...o.data().keys.keys(),
+    ...t.data().keys.keys()
+  ]), n = o.props.itemKey ?? "id";
+  return s.items.map((r) => {
+    let c;
+    if (i) c = i(r, s);
+    else {
+      if (typeof n == "function")
+        throw Error("函数形式的 itemKey 需要 clone 回调生成新键");
+      const u = b(r);
+      c = s.operation === "clone" ? structuredClone(u) : { ...u };
+      const p = o.key(r);
+      let y;
+      do
+        w++, y = typeof p == "number" ? -w : `${p}-copy-${w}`;
+      while (e.has(y));
+      Object.assign(c, { [n]: y });
+    }
+    const a = o.key(c);
+    if (!A(a) || e.has(a))
+      throw Error("复制项目必须提供新的唯一键");
+    return e.add(a), c;
+  });
+}
+function W(t, o, s, i = !1) {
+  var O, E, $, M;
+  const e = s.port, n = t.data().items, r = e.data().items, c = t === e, a = c ? e.props.mode ?? "insert" : "insert", u = {
+    ...o,
+    from: x(t),
+    to: x(e),
+    index: s.index,
+    position: s.position,
+    targetItem: s.anchor === void 0 ? void 0 : r[e.data().keys.get(s.anchor) ?? -1],
+    operation: s.operation ?? "move",
+    mode: a
+  };
+  if (e.props.disabled) return f("disabled", u);
+  if (!t.data().valid || !e.data().valid)
+    return f("keys", u);
+  if (!c && o.keys.some((l) => {
+    var d;
+    return (d = t.row(l)) == null ? void 0 : d.contains(e.root() ?? null);
+  }))
+    return f("cycle", u);
+  const p = _(
+    t,
+    e,
+    u,
+    s.operation
+  );
+  if (typeof p != "string") return p;
+  u.operation = p, u.index = ((E = (O = e.props).resolveIndex) == null ? void 0 : E.call(O, u)) ?? u.index;
+  const { index: y } = u;
+  if (!Number.isInteger(y) || y < 0 || y > r.length || a === "swap" && y === r.length)
+    return f("outside", u);
+  if (!c && r.length + o.items.length > (e.props.maxItems ?? 1 / 0))
+    return f("capacity", u);
+  const z = c ? [t] : [t, e];
+  for (const l of z) {
+    const d = (M = ($ = l.props).canDrop) == null ? void 0 : M.call($, u);
+    if (I(d))
+      return f(
+        "rule",
+        u,
+        typeof d == "string" ? d : void 0
+      );
+  }
+  const C = new Set(o.indices), v = n.filter((l, d) => !C.has(d));
+  if (c) {
+    const l = a === "swap" ? F(n, o.indices, y) : v;
+    return !l || (a === "insert" && l.splice(
+      y - o.indices.filter((d) => d < y).length,
+      0,
+      ...o.items
+    ), j(n, l)) ? f("noop", u) : k(t, l) ? {
+      source: t,
+      target: e,
+      proposal: u,
+      changes: [{ port: t, previous: n, next: l }]
+    } : f("fixed", u);
+  }
+  const S = p === "move" || !i ? o.items : R(t, e, u);
+  if (p === "move" || i) {
+    const l = S.map(e.key);
+    if (new Set(l).size !== l.length || l.some((d) => !A(d) || e.data().keys.has(d)))
+      return f("keys", u);
+  }
+  const h = r.slice();
+  if (h.splice(y, 0, ...S), !k(e, h) || p === "move" && !k(t, v))
+    return f("fixed", u);
+  const D = [{ port: e, previous: r, next: h }];
+  return p === "move" && D.unshift({ port: t, previous: n, next: v }), { source: t, target: e, proposal: u, changes: D };
+}
+export {
+  U as buildSortIndex,
+  T as dragIssue,
+  f as feedback,
+  m as groupOf,
+  L as keyToken,
+  Q as layoutOf,
+  J as linkedPorts,
+  V as makeDrag,
+  H as portAt,
+  k as preserved,
+  W as proposeSort,
+  G as registerSortPort,
+  j as sameItems,
+  K as sortPorts
+};