@atlaskit/editor-plugin-tasks-and-decisions 21.0.10 → 22.0.0

package/dist/esm/ui/quick-insert/TasksAndDecisionsQuickInsertMenuItem.js

@@ -9,7 +9,8 @@ import FieldCheckboxGroupIcon from '@atlaskit/icon/core/field-checkbox-group';
 import { getListTypes, insertTaskDecisionAction } from '../../pm-plugins/insert-commands';
 export var TasksAndDecisionsQuickInsertMenuItem = function TasksAndDecisionsQuickInsertMenuItem(_ref) {
   var api = _ref.api,
-    item = _ref.item;
+    item = _ref.item,
+    previewImageUrls = _ref.previewImageUrls;
   var _useIntl = useIntl(),
     formatMessage = _useIntl.formatMessage;
   var _useSharedPluginState = useSharedPluginStateWithSelector(api, ['contextIdentifier'], function (states) {
@@ -49,6 +50,7 @@ export var TasksAndDecisionsQuickInsertMenuItem = function TasksAndDecisionsQuic
       label: ""
     }),
     onSelect: onSelect,
+    previewImageUrls: previewImageUrls,
     shortcut: isAction ? '[]' : '<>',
     title: formatMessage(isAction ? messages.action : messages.decision)
   });

package/dist/esm/ui/quick-insert/getTasksAndDecisionsQuickInsertComponents.js

@@ -4,6 +4,14 @@ import { createQuickInsertMatcher } from '@atlaskit/editor-common/quick-insert/c
 import { ACTION_MENU_ITEM, DECISION_MENU_ITEM, STRUCTURE_SECTION } from '@atlaskit/editor-common/quick-insert/keys';
 import { STRUCTURE_SECTION_RANK } from '@atlaskit/editor-common/quick-insert/rank';
 import { TasksAndDecisionsQuickInsertMenuItem } from './TasksAndDecisionsQuickInsertMenuItem';
+var taskPreviewImageUrls = {
+  light: 'https://dam-cdn.atl.orangelogic.com/AssetLink/y5ly4nr488m2m4k4esk1bu415k1gn4gn.png',
+  dark: 'https://dam-cdn.atl.orangelogic.com/AssetLink/t7loyl783j0qo1h45i828310rv4au3h8.png'
+};
+var decisionPreviewImageUrls = {
+  light: 'https://dam-cdn.atl.orangelogic.com/AssetLink/h5duy8s83312r7263jauu10mapc53383.png',
+  dark: 'https://dam-cdn.atl.orangelogic.com/AssetLink/70q22b8a03dep35ynbv8xigg82osw0rk.png'
+};
 export var getTasksAndDecisionsQuickInsertComponents = function getTasksAndDecisionsQuickInsertComponents(_ref) {
   var api = _ref.api,
     quickInsertActionDescription = _ref.quickInsertActionDescription;
@@ -27,7 +35,8 @@ export var getTasksAndDecisionsQuickInsertComponents = function getTasksAndDecis
     component: function component() {
       return /*#__PURE__*/React.createElement(TasksAndDecisionsQuickInsertMenuItem, {
         api: api,
-        item: "taskList"
+        item: "taskList",
+        previewImageUrls: taskPreviewImageUrls
       });
     }
   }, {
@@ -50,7 +59,8 @@ export var getTasksAndDecisionsQuickInsertComponents = function getTasksAndDecis
     component: function component() {
       return /*#__PURE__*/React.createElement(TasksAndDecisionsQuickInsertMenuItem, {
         api: api,
-        item: "decisionList"
+        item: "decisionList",
+        previewImageUrls: decisionPreviewImageUrls
       });
     }
   }];

package/dist/types/pm-plugins/commands.d.ts

@@ -1,24 +1,5 @@
 import type { Command } from '@atlaskit/editor-common/types';
 import type { ResolvedPos } from '@atlaskit/editor-prosemirror/model';
-export declare const liftSelection: Command;
-/**
- * Wraps the current selection in a task list, respecting a maximum indentation depth of 6 levels.
- *
- * - Normalizes the selection to ensure it covers complete task items.
- * - Determines the maximum depth of task list nesting within the selection.
- * - If the selection is already nested at or beyond the maximum depth, the command does nothing.
- * - Calculates the block range to wrap, handling both regular and block task items.
- * - Wraps the block in a task list to increase indentation or create a new task list if necessary.
- *
- * @param state - The current editor state.
- * @param dispatch - The dispatch function to apply the transaction.
- * @returns `true` if the command was handled (even if no changes were made), otherwise `false`.
- * @example
- * ```typescript
- * autoJoin(wrapSelectionInTaskList, ['taskList']))(state, dispatch);
- * ```
- */
-export declare const wrapSelectionInTaskList: Command;
 /**
  * Tries to move the paragraph content near the given position into the taskItem or decisionItem
  * before it.

package/dist/types/pm-plugins/helpers.d.ts

@@ -1,5 +1,5 @@
 import { NodeRange } from '@atlaskit/editor-prosemirror/model';
-import type { Node, NodeType, ResolvedPos } from '@atlaskit/editor-prosemirror/model';
+import type { Node, ResolvedPos } from '@atlaskit/editor-prosemirror/model';
 import type { EditorState, Selection, Transaction } from '@atlaskit/editor-prosemirror/state';
 import type { EditorView } from '@atlaskit/editor-prosemirror/view';
 import type { TaskItemData } from './types';
@@ -43,19 +43,6 @@ export declare const getTaskItemIndex: (state: EditorState) => number;
  * @param $startPos Position to start walking from.
  */
 export declare const walkOut: ($startPos: ResolvedPos) => ResolvedPos;
-/**
- * Finds the height of a tree-like structure, given any position inside it.
- *
- * Traverses from the top of the tree to all leaf nodes, and returns the length
- * of the longest path.
- *
- * This means you can use it with things like taskList, which
- * do not nest themselves inside taskItems but rather as adjacent children.
- *
- * @param $pos Any position inside the tree.
- * @param types The node types to consider traversable
- */
-export declare const subtreeHeight: ($from: ResolvedPos, $to: ResolvedPos, types: NodeType[]) => number;
 /**
  * Determines if the current selection is inside an empty taskItem, decisionItem, or blockTaskItem.
  *

package/dist/types/ui/quick-insert/TasksAndDecisionsQuickInsertMenuItem.d.ts

@@ -1,10 +1,12 @@
 import React from 'react';
+import { type QuickInsertMenuItemProps } from '@atlaskit/editor-common/quick-insert/menu-item';
 import type { ExtractInjectionAPI } from '@atlaskit/editor-common/types';
 import type { TasksAndDecisionsPlugin } from '../../tasksAndDecisionsPluginType';
 import type { TaskDecisionListType } from '../../types';
 type Props = {
     api: ExtractInjectionAPI<TasksAndDecisionsPlugin> | undefined;
     item: TaskDecisionListType;
+    previewImageUrls?: QuickInsertMenuItemProps['previewImageUrls'];
 };
-export declare const TasksAndDecisionsQuickInsertMenuItem: ({ api, item }: Props) => React.JSX.Element;
+export declare const TasksAndDecisionsQuickInsertMenuItem: ({ api, item, previewImageUrls, }: Props) => React.JSX.Element;
 export {};

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@atlaskit/editor-plugin-tasks-and-decisions",
-	"version": "21.0.10",
+	"version": "22.0.0",
 	"description": "Tasks and decisions plugin for @atlaskit/editor-core",
 	"author": "Atlassian Pty Ltd",
 	"license": "Apache-2.0",
@@ -8,6 +8,11 @@
 		"registry": "https://registry.npmjs.org/"
 	},
 	"atlassian": {
+		"website": {
+			"tags": [
+				"platform-labs"
+			]
+		},
 		"team": "Editor: AI",
 		"singleton": true
 	},
@@ -24,14 +29,14 @@
 		"@atlaskit/adf-schema": "^57.5.0",
 		"@atlaskit/analytics-namespaced-context": "^8.2.0",
 		"@atlaskit/css": "^1.1.0",
-		"@atlaskit/editor-plugin-analytics": "^18.0.0",
-		"@atlaskit/editor-plugin-block-menu": "^17.0.0",
-		"@atlaskit/editor-plugin-context-identifier": "^18.0.0",
-		"@atlaskit/editor-plugin-editor-viewmode": "^20.0.0",
-		"@atlaskit/editor-plugin-selection": "^18.0.0",
-		"@atlaskit/editor-plugin-toolbar": "^15.0.0",
-		"@atlaskit/editor-plugin-type-ahead": "^19.0.0",
-		"@atlaskit/editor-prosemirror": "^8.0.0",
+		"@atlaskit/editor-plugin-analytics": "^19.0.0",
+		"@atlaskit/editor-plugin-block-menu": "^18.0.0",
+		"@atlaskit/editor-plugin-context-identifier": "^19.0.0",
+		"@atlaskit/editor-plugin-editor-viewmode": "^21.0.0",
+		"@atlaskit/editor-plugin-selection": "^19.0.0",
+		"@atlaskit/editor-plugin-toolbar": "^16.0.0",
+		"@atlaskit/editor-plugin-type-ahead": "^20.0.0",
+		"@atlaskit/editor-prosemirror": "^9.0.0",
 		"@atlaskit/editor-shared-styles": "^4.3.0",
 		"@atlaskit/editor-toolbar": "^2.6.0",
 		"@atlaskit/editor-toolbar-model": "^1.2.0",
@@ -42,14 +47,14 @@
 		"@atlaskit/primitives": "^22.5.0",
 		"@atlaskit/prosemirror-input-rules": "^4.1.0",
 		"@atlaskit/task-decision": "^21.10.0",
-		"@atlaskit/tmp-editor-statsig": "^198.0.0",
-		"@atlaskit/tokens": "^17.0.0",
+		"@atlaskit/tmp-editor-statsig": "^199.0.0",
+		"@atlaskit/tokens": "^18.2.0",
 		"@babel/runtime": "^7.0.0",
 		"@compiled/react": "^1.0.2",
 		"bind-event-listener": "^3.0.0"
 	},
 	"peerDependencies": {
-		"@atlaskit/editor-common": "^122.10.0",
+		"@atlaskit/editor-common": "^123.0.0",
 		"react": "^18.2.0 || ^19.2.0",
 		"react-dom": "^18.2.0 || ^19.2.0",
 		"react-intl": "^5.25.1 || ^6.0.0 || ^7.0.0"
@@ -71,9 +76,6 @@
 		"platform_editor_element_browser_analytic": {
 			"type": "boolean"
 		},
-		"platform_editor_flexible_list_normalization_fix": {
-			"type": "boolean"
-		},
 		"platform_editor_markdown_compatible_toolbar": {
 			"type": "boolean"
 		}

package/dist/cjs/pm-plugins/transforms.js

@@ -1,150 +0,0 @@
-"use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.applyTaskListNormalisationFixes = applyTaskListNormalisationFixes;
-var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
-var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
-var _transform = require("@atlaskit/editor-prosemirror/transform");
-var _expValEqualsNoExposure = require("@atlaskit/tmp-editor-statsig/exp-val-equals-no-exposure");
-function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
-function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
-function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
-function getAffectedTaskListsFromTransactions(transactions, doc, schema) {
-  var taskList = schema.nodes.taskList;
-  if (!taskList) {
-    return new Map();
-  }
-  var result = new Map();
-  var _iterator = _createForOfIteratorHelper(transactions),
-    _step;
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var tr = _step.value;
-      var _iterator2 = _createForOfIteratorHelper(tr.steps),
-        _step2;
-      try {
-        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-          var step = _step2.value;
-          // ReplaceStep and ReplaceAroundStep both have from/to — other step types are skipped.
-          if (!(step instanceof _transform.ReplaceStep) && !(step instanceof _transform.ReplaceAroundStep)) {
-            continue;
-          }
-          // Check both the start and end of each changed range, mapped to post-transaction positions.
-          for (var _i = 0, _arr = [step.from, step.to]; _i < _arr.length; _i++) {
-            var rawPos = _arr[_i];
-            var mappedPos = Math.min(tr.mapping.map(rawPos), doc.content.size - 1);
-            var $pos = doc.resolve(mappedPos);
-            // Walk ancestors from inner to outer, recording the outermost taskList node.
-            // Once we find a taskList and then exit list structure (hit a non-taskList ancestor),
-            // break early — prevents container nodes (e.g. panel) from causing us to
-            // return an outer taskList in a different structural context.
-            var rootTaskListPos = null;
-            var rootTaskListNode = null;
-            for (var depth = $pos.depth; depth >= 0; depth--) {
-              var node = $pos.node(depth);
-              if (node.type === taskList) {
-                rootTaskListPos = $pos.before(depth);
-                rootTaskListNode = node;
-              } else if (rootTaskListNode !== null && node.type !== schema.nodes.taskItem) {
-                // We've exited the taskList structure — stop walking.
-                break;
-              }
-            }
-            if (rootTaskListPos !== null && rootTaskListNode !== null) {
-              result.set(rootTaskListPos, rootTaskListNode);
-            }
-          }
-        }
-      } catch (err) {
-        _iterator2.e(err);
-      } finally {
-        _iterator2.f();
-      }
-    }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
-  }
-  return result;
-}
-function applyTaskListNormalisationFixes(_ref) {
-  var doc = _ref.doc,
-    schema = _ref.schema,
-    tr = _ref.tr,
-    transactions = _ref.transactions;
-  var _schema$nodes = schema.nodes,
-    taskList = _schema$nodes.taskList,
-    taskItem = _schema$nodes.taskItem;
-  if (!taskList || !taskItem) {
-    return tr;
-  }
-  var affectedTaskLists = getAffectedTaskListsFromTransactions(transactions, doc, schema);
-  if (affectedTaskLists.size === 0) {
-    return tr;
-  }
-
-  // Sort by position descending so we process deeper/later positions first,
-  // preventing earlier insertions from shifting later positions.
-  var sortedEntries = (0, _toConsumableArray2.default)(affectedTaskLists.entries()).sort(function (_ref2, _ref3) {
-    var _ref4 = (0, _slicedToArray2.default)(_ref2, 1),
-      a = _ref4[0];
-    var _ref5 = (0, _slicedToArray2.default)(_ref3, 1),
-      b = _ref5[0];
-    return b - a;
-  });
-  var _iterator3 = _createForOfIteratorHelper(sortedEntries),
-    _step3;
-  try {
-    var _loop = function _loop() {
-      var _step3$value = (0, _slicedToArray2.default)(_step3.value, 1),
-        taskListPos = _step3$value[0];
-      // Re-resolve the taskList node from the current transaction doc (post-operation state).
-      var mappedTaskListPos = tr.mapping.map(taskListPos);
-      var currentTaskListNode = tr.doc.nodeAt(mappedTaskListPos);
-      if (!currentTaskListNode) {
-        return 1; // continue
-      }
-      if (!(0, _expValEqualsNoExposure.expValEqualsNoExposure)('platform_editor_flexible_list_indentation', 'isEnabled', true)) {
-        // Collect positions of all taskList nodes (at any depth) whose direct children
-        // include a taskList — this is the invalid structure. The taskList schema requires
-        // taskItem as children, not nested taskLists directly.
-        // Process in reverse order so higher-position insertions don't shift lower positions.
-        var invalidTaskListPositions = [];
-        currentTaskListNode.descendants(function (node, offsetPos) {
-          if (node.type === taskList) {
-            // A taskList as the FIRST child of another taskList is invalid — it means a
-            // delete or paste removed the leading taskItem, leaving a bare nested list.
-            // A taskList that follows a taskItem is valid (that's normal indentation).
-            var firstChild = node.firstChild;
-            if (firstChild && firstChild.type === taskList) {
-              var pos = mappedTaskListPos + 1 + offsetPos + 1;
-              invalidTaskListPositions.push(pos);
-            }
-          }
-          return true;
-        });
-
-        // Process in reverse (highest positions first).
-        for (var i = invalidTaskListPositions.length - 1; i >= 0; i--) {
-          var remappedPos = tr.mapping.map(invalidTaskListPositions[i]);
-          var emptyTaskItem = taskItem.createAndFill();
-          if (emptyTaskItem) {
-            tr.insert(remappedPos, emptyTaskItem);
-          }
-        }
-      }
-    };
-    for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
-      if (_loop()) continue;
-    }
-  } catch (err) {
-    _iterator3.e(err);
-  } finally {
-    _iterator3.f();
-  }
-  return tr;
-}

package/dist/es2019/pm-plugins/transforms.js

@@ -1,104 +0,0 @@
-import { ReplaceAroundStep, ReplaceStep } from '@atlaskit/editor-prosemirror/transform';
-import { expValEqualsNoExposure } from '@atlaskit/tmp-editor-statsig/exp-val-equals-no-exposure';
-function getAffectedTaskListsFromTransactions(transactions, doc, schema) {
-  const {
-    taskList
-  } = schema.nodes;
-  if (!taskList) {
-    return new Map();
-  }
-  const result = new Map();
-  for (const tr of transactions) {
-    for (const step of tr.steps) {
-      // ReplaceStep and ReplaceAroundStep both have from/to — other step types are skipped.
-      if (!(step instanceof ReplaceStep) && !(step instanceof ReplaceAroundStep)) {
-        continue;
-      }
-      // Check both the start and end of each changed range, mapped to post-transaction positions.
-      for (const rawPos of [step.from, step.to]) {
-        const mappedPos = Math.min(tr.mapping.map(rawPos), doc.content.size - 1);
-        const $pos = doc.resolve(mappedPos);
-        // Walk ancestors from inner to outer, recording the outermost taskList node.
-        // Once we find a taskList and then exit list structure (hit a non-taskList ancestor),
-        // break early — prevents container nodes (e.g. panel) from causing us to
-        // return an outer taskList in a different structural context.
-        let rootTaskListPos = null;
-        let rootTaskListNode = null;
-        for (let depth = $pos.depth; depth >= 0; depth--) {
-          const node = $pos.node(depth);
-          if (node.type === taskList) {
-            rootTaskListPos = $pos.before(depth);
-            rootTaskListNode = node;
-          } else if (rootTaskListNode !== null && node.type !== schema.nodes.taskItem) {
-            // We've exited the taskList structure — stop walking.
-            break;
-          }
-        }
-        if (rootTaskListPos !== null && rootTaskListNode !== null) {
-          result.set(rootTaskListPos, rootTaskListNode);
-        }
-      }
-    }
-  }
-  return result;
-}
-export function applyTaskListNormalisationFixes({
-  doc,
-  schema,
-  tr,
-  transactions
-}) {
-  const {
-    taskList,
-    taskItem
-  } = schema.nodes;
-  if (!taskList || !taskItem) {
-    return tr;
-  }
-  const affectedTaskLists = getAffectedTaskListsFromTransactions(transactions, doc, schema);
-  if (affectedTaskLists.size === 0) {
-    return tr;
-  }
-
-  // Sort by position descending so we process deeper/later positions first,
-  // preventing earlier insertions from shifting later positions.
-  const sortedEntries = [...affectedTaskLists.entries()].sort(([a], [b]) => b - a);
-  for (const [taskListPos] of sortedEntries) {
-    // Re-resolve the taskList node from the current transaction doc (post-operation state).
-    const mappedTaskListPos = tr.mapping.map(taskListPos);
-    const currentTaskListNode = tr.doc.nodeAt(mappedTaskListPos);
-    if (!currentTaskListNode) {
-      continue;
-    }
-    if (!expValEqualsNoExposure('platform_editor_flexible_list_indentation', 'isEnabled', true)) {
-      // Collect positions of all taskList nodes (at any depth) whose direct children
-      // include a taskList — this is the invalid structure. The taskList schema requires
-      // taskItem as children, not nested taskLists directly.
-      // Process in reverse order so higher-position insertions don't shift lower positions.
-      const invalidTaskListPositions = [];
-      currentTaskListNode.descendants((node, offsetPos) => {
-        if (node.type === taskList) {
-          // A taskList as the FIRST child of another taskList is invalid — it means a
-          // delete or paste removed the leading taskItem, leaving a bare nested list.
-          // A taskList that follows a taskItem is valid (that's normal indentation).
-          const firstChild = node.firstChild;
-          if (firstChild && firstChild.type === taskList) {
-            const pos = mappedTaskListPos + 1 + offsetPos + 1;
-            invalidTaskListPositions.push(pos);
-          }
-        }
-        return true;
-      });
-
-      // Process in reverse (highest positions first).
-      for (let i = invalidTaskListPositions.length - 1; i >= 0; i--) {
-        const remappedPos = tr.mapping.map(invalidTaskListPositions[i]);
-        const emptyTaskItem = taskItem.createAndFill();
-        if (emptyTaskItem) {
-          tr.insert(remappedPos, emptyTaskItem);
-        }
-      }
-    }
-  }
-  return tr;
-}

package/dist/esm/pm-plugins/transforms.js

@@ -1,143 +0,0 @@
-import _slicedToArray from "@babel/runtime/helpers/slicedToArray";
-import _toConsumableArray from "@babel/runtime/helpers/toConsumableArray";
-function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
-function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
-function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
-import { ReplaceAroundStep, ReplaceStep } from '@atlaskit/editor-prosemirror/transform';
-import { expValEqualsNoExposure } from '@atlaskit/tmp-editor-statsig/exp-val-equals-no-exposure';
-function getAffectedTaskListsFromTransactions(transactions, doc, schema) {
-  var taskList = schema.nodes.taskList;
-  if (!taskList) {
-    return new Map();
-  }
-  var result = new Map();
-  var _iterator = _createForOfIteratorHelper(transactions),
-    _step;
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var tr = _step.value;
-      var _iterator2 = _createForOfIteratorHelper(tr.steps),
-        _step2;
-      try {
-        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-          var step = _step2.value;
-          // ReplaceStep and ReplaceAroundStep both have from/to — other step types are skipped.
-          if (!(step instanceof ReplaceStep) && !(step instanceof ReplaceAroundStep)) {
-            continue;
-          }
-          // Check both the start and end of each changed range, mapped to post-transaction positions.
-          for (var _i = 0, _arr = [step.from, step.to]; _i < _arr.length; _i++) {
-            var rawPos = _arr[_i];
-            var mappedPos = Math.min(tr.mapping.map(rawPos), doc.content.size - 1);
-            var $pos = doc.resolve(mappedPos);
-            // Walk ancestors from inner to outer, recording the outermost taskList node.
-            // Once we find a taskList and then exit list structure (hit a non-taskList ancestor),
-            // break early — prevents container nodes (e.g. panel) from causing us to
-            // return an outer taskList in a different structural context.
-            var rootTaskListPos = null;
-            var rootTaskListNode = null;
-            for (var depth = $pos.depth; depth >= 0; depth--) {
-              var node = $pos.node(depth);
-              if (node.type === taskList) {
-                rootTaskListPos = $pos.before(depth);
-                rootTaskListNode = node;
-              } else if (rootTaskListNode !== null && node.type !== schema.nodes.taskItem) {
-                // We've exited the taskList structure — stop walking.
-                break;
-              }
-            }
-            if (rootTaskListPos !== null && rootTaskListNode !== null) {
-              result.set(rootTaskListPos, rootTaskListNode);
-            }
-          }
-        }
-      } catch (err) {
-        _iterator2.e(err);
-      } finally {
-        _iterator2.f();
-      }
-    }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
-  }
-  return result;
-}
-export function applyTaskListNormalisationFixes(_ref) {
-  var doc = _ref.doc,
-    schema = _ref.schema,
-    tr = _ref.tr,
-    transactions = _ref.transactions;
-  var _schema$nodes = schema.nodes,
-    taskList = _schema$nodes.taskList,
-    taskItem = _schema$nodes.taskItem;
-  if (!taskList || !taskItem) {
-    return tr;
-  }
-  var affectedTaskLists = getAffectedTaskListsFromTransactions(transactions, doc, schema);
-  if (affectedTaskLists.size === 0) {
-    return tr;
-  }
-
-  // Sort by position descending so we process deeper/later positions first,
-  // preventing earlier insertions from shifting later positions.
-  var sortedEntries = _toConsumableArray(affectedTaskLists.entries()).sort(function (_ref2, _ref3) {
-    var _ref4 = _slicedToArray(_ref2, 1),
-      a = _ref4[0];
-    var _ref5 = _slicedToArray(_ref3, 1),
-      b = _ref5[0];
-    return b - a;
-  });
-  var _iterator3 = _createForOfIteratorHelper(sortedEntries),
-    _step3;
-  try {
-    var _loop = function _loop() {
-      var _step3$value = _slicedToArray(_step3.value, 1),
-        taskListPos = _step3$value[0];
-      // Re-resolve the taskList node from the current transaction doc (post-operation state).
-      var mappedTaskListPos = tr.mapping.map(taskListPos);
-      var currentTaskListNode = tr.doc.nodeAt(mappedTaskListPos);
-      if (!currentTaskListNode) {
-        return 1; // continue
-      }
-      if (!expValEqualsNoExposure('platform_editor_flexible_list_indentation', 'isEnabled', true)) {
-        // Collect positions of all taskList nodes (at any depth) whose direct children
-        // include a taskList — this is the invalid structure. The taskList schema requires
-        // taskItem as children, not nested taskLists directly.
-        // Process in reverse order so higher-position insertions don't shift lower positions.
-        var invalidTaskListPositions = [];
-        currentTaskListNode.descendants(function (node, offsetPos) {
-          if (node.type === taskList) {
-            // A taskList as the FIRST child of another taskList is invalid — it means a
-            // delete or paste removed the leading taskItem, leaving a bare nested list.
-            // A taskList that follows a taskItem is valid (that's normal indentation).
-            var firstChild = node.firstChild;
-            if (firstChild && firstChild.type === taskList) {
-              var pos = mappedTaskListPos + 1 + offsetPos + 1;
-              invalidTaskListPositions.push(pos);
-            }
-          }
-          return true;
-        });
-
-        // Process in reverse (highest positions first).
-        for (var i = invalidTaskListPositions.length - 1; i >= 0; i--) {
-          var remappedPos = tr.mapping.map(invalidTaskListPositions[i]);
-          var emptyTaskItem = taskItem.createAndFill();
-          if (emptyTaskItem) {
-            tr.insert(remappedPos, emptyTaskItem);
-          }
-        }
-      }
-    };
-    for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
-      if (_loop()) continue;
-    }
-  } catch (err) {
-    _iterator3.e(err);
-  } finally {
-    _iterator3.f();
-  }
-  return tr;
-}

package/dist/types/pm-plugins/transforms.d.ts

@@ -1,10 +0,0 @@
-import type { Node, Schema } from '@atlaskit/editor-prosemirror/model';
-import type { Transaction } from '@atlaskit/editor-prosemirror/state';
-interface ApplyTaskListNormalisationFixesOptions {
-    doc: Node;
-    schema: Schema;
-    tr: Transaction;
-    transactions: readonly Transaction[];
-}
-export declare function applyTaskListNormalisationFixes({ doc, schema, tr, transactions, }: ApplyTaskListNormalisationFixesOptions): Transaction;
-export {};