@ai-matrx/context-menu 0.1.7 → 0.1.8

package/dist/engine.js

@@ -2402,6 +2402,7 @@ var STRIP_FOR = {
 var PAGE_TEXT_FILE_IDS = /* @__PURE__ */ new Set(["save-as-pdf"]);
 var OPEN_ROW = /^open( record)?$/i;
 var LINK_A_RECORD = /^link a record/i;
+var RECORD_VERBS = [/^merge with/i, /^split(…|\.\.\.)?$/i, /^extract parent/i];
 var FOLDS_INTO_SHARE = [/^copy link\b/i, /^share link\b/i];
 var SAVE_SHARE_GROUPS = ["copy", "download", "convert", "publish", "share"];
 var ORGANIZE_GROUPS = /* @__PURE__ */ new Set(["organize", "history", "compare"]);
@@ -2499,14 +2500,19 @@ function proposedArrangement(target, resolved, { noun }) {
   };
   const openRow = lead(OPEN_ROW);
   const linkRow = lead(LINK_A_RECORD);
-  ownCandidates.unshift(...[openRow, linkRow].filter((r) => r !== null));
+  const verbRows = RECORD_VERBS.map(lead).filter((r) => r !== null);
+  const leading = [openRow, linkRow, ...verbRows].filter((r) => r !== null);
+  const verbIds = new Set(verbRows.map((r) => r.action.id));
+  let counted = 0;
+  ownCandidates.unshift(...leading);
   const own = [];
   const more = [];
   for (const r of ownCandidates) {
     used.add(r.action.id);
     const folds = hasShare && FOLDS_INTO_SHARE.some((re) => re.test(label(r)));
-    if (!folds && own.length < OWN_ROWS_MAX && !r.action.expand) {
+    if (!folds && (verbIds.has(r.action.id) || counted < OWN_ROWS_MAX) && !r.action.expand) {
       const destructive = SLOT2.archive.ownLabels.some((re) => re.test(label(r)));
+      if (!verbIds.has(r.action.id)) counted += 1;
       own.push({ ...r, action: plain(r.action, { category: "edit", order: own.length, ...destructive ? { destructive: true } : {} }) });
     } else {
       more.push(plain(r.action));