jodit-pro 4.6.15 → 4.6.16

package/es2015/jodit.js

@@ -1,7 +1,7 @@
 /*!
  * jodit-pro - PRO Version of Jodit Editor
  * Author: Chupurnov Valeriy <chupurnov@gmail.com>
- * Version: v4.6.15
+ * Version: v4.6.16
  * Url: https://xdsoft.net/jodit/pro/
  * License(s): SEE LICENSE IN LICENSE.md
  */
@@ -12120,6 +12120,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   alreadyLoadedList: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.EW; },
 /* harmony export */   appendScriptAsync: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.w4; },
 /* harmony export */   appendStyleAsync: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.S5; },
+/* harmony export */   applyArrayReconciliation: function() { return /* reexport safe */ _array_index_js__WEBPACK_IMPORTED_MODULE_0__.ft; },
 /* harmony export */   applyStyles: function() { return /* reexport safe */ _html_index_js__WEBPACK_IMPORTED_MODULE_4__.ZM; },
 /* harmony export */   asArray: function() { return /* reexport safe */ _array_index_js__WEBPACK_IMPORTED_MODULE_0__._j; },
 /* harmony export */   assert: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.vA; },
@@ -12214,6 +12215,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   parseQuery: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.Vc; },
 /* harmony export */   position: function() { return /* reexport safe */ _size_index_js__WEBPACK_IMPORTED_MODULE_6__.G1; },
 /* harmony export */   previewBox: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.u_; },
+/* harmony export */   reconcileArrays: function() { return /* reexport safe */ _array_index_js__WEBPACK_IMPORTED_MODULE_0__.j5; },
 /* harmony export */   refs: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.DY; },
 /* harmony export */   reset: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.cL; },
 /* harmony export */   resolveElement: function() { return /* reexport safe */ _utils_index_js__WEBPACK_IMPORTED_MODULE_8__.tI; },
@@ -21611,6 +21613,121 @@ function uniqueMax(array) {
 }
 
 
+/***/ }),
+
+/***/ 39942:
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   f: function() { return /* binding */ applyArrayReconciliation; },
+/* harmony export */   j: function() { return /* binding */ reconcileArrays; }
+/* harmony export */ });
+/*!
+ * Jodit Editor (https://xdsoft.net/jodit/)
+ * Released under MIT see LICENSE.txt in the project root for license information.
+ * Copyright (c) 2013-2025 Valeriy Chupurnov. All rights reserved. https://xdsoft.net
+ */ /**
+ * Reconciles two arrays and returns the differences
+ * @param oldArray - The original array
+ * @param newArray - The new array to compare against
+ * @param keyFn - Optional function to generate unique keys for items (for object comparison)
+ * @returns Object containing added, removed, kept and moved items
+ *
+ * @example
+ * ```typescript
+ * const old = [1, 2, 3, 4];
+ * const new = [2, 4, 5, 1];
+ * const result = reconcileArrays(old, new);
+ * // result.added = [5]
+ * // result.removed = [3]
+ * // result.kept = [2, 4, 1]
+ * // result.moved = [{item: 1, from: 0, to: 3}]
+ * ```
+ *
+ * @example
+ * ```typescript
+ * const old = [{id: 1, name: 'a'}, {id: 2, name: 'b'}];
+ * const new = [{id: 2, name: 'b'}, {id: 3, name: 'c'}];
+ * const result = reconcileArrays(old, new, item => item.id);
+ * // result.added = [{id: 3, name: 'c'}]
+ * // result.removed = [{id: 1, name: 'a'}]
+ * ```
+ */ function reconcileArrays(oldArray, newArray, keyFn) {
+    const getKey = keyFn || ((item)=>item);
+    const oldMap = new Map();
+    const newMap = new Map();
+    oldArray.forEach((item, index)=>{
+        oldMap.set(getKey(item), {
+            item,
+            index
+        });
+    });
+    newArray.forEach((item, index)=>{
+        newMap.set(getKey(item), {
+            item,
+            index
+        });
+    });
+    const added = [];
+    const removed = [];
+    const kept = [];
+    const moved = [];
+    // Find removed items
+    oldMap.forEach((value, key)=>{
+        if (!newMap.has(key)) {
+            removed.push(value.item);
+        }
+    });
+    // Find added items and track kept/moved items
+    newMap.forEach((value, key)=>{
+        const oldItem = oldMap.get(key);
+        if (!oldItem) {
+            added.push(value.item);
+        } else {
+            kept.push(value.item);
+            if (oldItem.index !== value.index) {
+                moved.push({
+                    item: value.item,
+                    from: oldItem.index,
+                    to: value.index
+                });
+            }
+        }
+    });
+    return {
+        added,
+        removed,
+        kept,
+        moved
+    };
+}
+/**
+ * Applies reconciliation patches to transform one array into another
+ * @param oldArray - The original array to transform
+ * @param newArray - The target array structure
+ * @param keyFn - Optional function to generate unique keys for items
+ * @returns New array matching the structure of newArray
+ */ function applyArrayReconciliation(oldArray, newArray, keyFn) {
+    const result = reconcileArrays(oldArray, newArray, keyFn);
+    const output = [];
+    // Build the new array based on newArray order
+    newArray.forEach((item)=>{
+        const key = keyFn ? keyFn(item) : item;
+        const isNew = result.added.some((addedItem)=>(keyFn ? keyFn(addedItem) : addedItem) === key);
+        if (isNew) {
+            output.push(item);
+        } else {
+            // Use the old item reference if it exists
+            const oldItem = oldArray.find((oldItem)=>(keyFn ? keyFn(oldItem) : oldItem) === key);
+            if (oldItem !== undefined) {
+                output.push(oldItem);
+            }
+        }
+    });
+    return output;
+}
+
+
 /***/ }),
 
 /***/ 39955:
@@ -32519,8 +32636,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _decorators_index_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(65478);
 /* harmony import */ var _dom_dom_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(2748);
 /* harmony import */ var _helpers_index_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(21537);
-/* harmony import */ var _helpers_utils_assert_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(38837);
-/* harmony import */ var _element_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(48538);
+/* harmony import */ var _element_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(48538);
 /*!
  * Jodit Editor (https://xdsoft.net/jodit/)
  * Released under MIT see LICENSE.txt in the project root for license information.
@@ -32537,8 +32653,7 @@ var UIGroup_1;
 
 
 
-
-let UIGroup = UIGroup_1 = class UIGroup extends _element_js__WEBPACK_IMPORTED_MODULE_5__/* .UIElement */ .D {
+let UIGroup = UIGroup_1 = class UIGroup extends _element_js__WEBPACK_IMPORTED_MODULE_4__/* .UIElement */ .D {
     className() {
         return 'UIGroup';
     }
@@ -32567,23 +32682,33 @@ let UIGroup = UIGroup_1 = class UIGroup extends _element_js__WEBPACK_IMPORTED_MO
         this.elements.forEach((elm)=>elm.update());
         this.setMod('size', this.buttonSize);
     }
-    /**
-     * Append new element into group
-     */ append(elm, distElement) {
-        if ((0,_helpers_index_js__WEBPACK_IMPORTED_MODULE_3__.isArray)(elm)) {
-            elm.forEach((item)=>this.append(item, distElement));
+    append(elms, distElementOrIndex) {
+        if ((0,_helpers_index_js__WEBPACK_IMPORTED_MODULE_3__.isArray)(elms)) {
+            if (typeof distElementOrIndex === 'number') {
+                throw new Error('You can not use index when append array of elements');
+            }
+            elms.forEach((item)=>this.append(item, distElementOrIndex));
             return this;
         }
-        this.elements.push(elm);
+        const elm = elms;
+        let index = undefined;
+        if (typeof distElementOrIndex === 'number') {
+            index = Math.min(Math.max(0, distElementOrIndex), this.elements.length);
+            this.elements.splice(index, 0, elm);
+        } else {
+            this.elements.push(elm);
+        }
         if (elm.name) {
             elm.container.classList.add(this.getFullElName(elm.name));
         }
-        if (distElement) {
-            const distElm = this.getElm(distElement);
-            (0,_helpers_utils_assert_js__WEBPACK_IMPORTED_MODULE_4__/* .assert */ .v)(distElm != null, 'Element does not exist');
+        if (distElementOrIndex && typeof distElementOrIndex === 'string') {
+            const distElm = this.getElm(distElementOrIndex);
+            if (distElm == null) {
+                throw new Error('Element does not exist');
+            }
             distElm.appendChild(elm.container);
         } else {
-            this.appendChildToContainer(elm.container);
+            this.appendChildToContainer(elm.container, index);
         }
         elm.parentElement = this;
         return this;
@@ -32595,8 +32720,12 @@ let UIGroup = UIGroup_1 = class UIGroup extends _element_js__WEBPACK_IMPORTED_MO
     }
     /**
      * Allow set another container for the box of all children
-     */ appendChildToContainer(childContainer) {
-        this.container.appendChild(childContainer);
+     */ appendChildToContainer(childContainer, index) {
+        if (index === undefined || index < 0 || index > this.elements.length - 1 || this.container.children[index] == null) {
+            this.container.appendChild(childContainer);
+        } else {
+            this.container.insertBefore(childContainer, this.container.children[index]);
+        }
     }
     /**
      * Remove element from group
@@ -39220,13 +39349,16 @@ __webpack_require__.r(__webpack_exports__);
 /***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
 
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   $r: function() { return /* reexport safe */ _to_array_js__WEBPACK_IMPORTED_MODULE_2__.$; },
+/* harmony export */   $r: function() { return /* reexport safe */ _to_array_js__WEBPACK_IMPORTED_MODULE_3__.$; },
 /* harmony export */   _j: function() { return /* reexport safe */ _as_array_js__WEBPACK_IMPORTED_MODULE_0__._; },
-/* harmony export */   uM: function() { return /* reexport safe */ _split_array_js__WEBPACK_IMPORTED_MODULE_1__.u; }
+/* harmony export */   ft: function() { return /* reexport safe */ _reconcile_arrays_js__WEBPACK_IMPORTED_MODULE_1__.f; },
+/* harmony export */   j5: function() { return /* reexport safe */ _reconcile_arrays_js__WEBPACK_IMPORTED_MODULE_1__.j; },
+/* harmony export */   uM: function() { return /* reexport safe */ _split_array_js__WEBPACK_IMPORTED_MODULE_2__.u; }
 /* harmony export */ });
 /* harmony import */ var _as_array_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(29999);
-/* harmony import */ var _split_array_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(46559);
-/* harmony import */ var _to_array_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(4510);
+/* harmony import */ var _reconcile_arrays_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(39942);
+/* harmony import */ var _split_array_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(46559);
+/* harmony import */ var _to_array_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(4510);
 /*!
  * Jodit Editor (https://xdsoft.net/jodit/)
  * Released under MIT see LICENSE.txt in the project root for license information.
@@ -39238,6 +39370,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /***/ }),
 
 /***/ 77183:
@@ -44454,7 +44587,7 @@ __webpack_require__.r(__webpack_exports__);
  * ```
  * @packageDocumentation
  * @module constants
- */ const APP_VERSION = "4.6.15";
+ */ const APP_VERSION = "4.6.16";
 // prettier-ignore
 const ES = "es2015";
 const IS_ES_MODERN = true;