amis-core 6.14.0-beta.11 → 6.14.0-beta.13

package/lib/utils/findDomCompat.js

@@ -0,0 +1,262 @@
+/**
+ * amis-core v6.14.0-beta.13
+ * Copyright 2018-2025 fex
+ */
+
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var ReactDom = require('react-dom');
+
+function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }
+
+var ReactDom__default = /*#__PURE__*/_interopDefaultLegacy(ReactDom);
+
+// React Fiber tag types - only the ones we use
+var HostRoot = 3;
+var HostComponent = 5;
+var HostText = 6;
+var HostHoistable = 26;
+var HostSingleton = 27;
+// React Fiber flag types - only the ones we use
+var NoFlags = /*                      */ 0;
+var Placement = /*                    */ 2;
+var Hydrating = /*                    */ 4096;
+/**
+ * 从 React 组件实例获取关联的 DOM 节点
+ * 基于 React 内部 Fiber 结构实现
+ *
+ * 原理：
+ * - React 组件实例上存储了一个隐藏的 Fiber 引用
+ * - Fiber 树包含了组件与 DOM 的映射关系
+ * - 通过遍历 Fiber 树可以找到关联的 DOM 节点
+ */
+function getDOMNode(instance) {
+    if (!instance) {
+        return null;
+    }
+    if (instance instanceof HTMLElement) {
+        return instance;
+    }
+    if (instance instanceof Text) {
+        return null;
+    }
+    // 尝试从组件实例获取 Fiber 引用
+    // React 在不同版本中存储 Fiber 的属性名不同：
+    // - React 18+: instance._reactInternals (React Element 实例上的 Fiber)
+    // - React 16-17: instance._reactInternalFiber (旧版本的 Fiber 属性)
+    var fiber = instance._reactInternals || instance._reactInternalFiber;
+    if (!fiber) {
+        if (ReactDom__default["default"].findDOMNode) {
+            return ReactDom__default["default"].findDOMNode(instance);
+        }
+        throw new Error('Cannot support the current React version. Please report an issue.');
+    }
+    var hostFiber = findCurrentHostFiber(fiber);
+    if (hostFiber === null) {
+        return null;
+    }
+    return hostFiber.stateNode;
+}
+var findDomCompat = getDOMNode;
+// -----------------------------
+// 以下代码来自 react-reconciler 库的实现
+function findCurrentHostFiber(parent) {
+    var currentParent = findCurrentFiberUsingSlowPath(parent);
+    return currentParent !== null
+        ? findCurrentHostFiberImpl(currentParent)
+        : null;
+}
+function findCurrentFiberUsingSlowPath(fiber) {
+    var alternate = fiber.alternate;
+    if (!alternate) {
+        // If there is no alternate, then we only need to check if it is mounted.
+        var nearestMounted = getNearestMountedFiber(fiber);
+        if (nearestMounted === null) {
+            throw new Error('Unable to find node on an unmounted component.');
+        }
+        if (nearestMounted !== fiber) {
+            return null;
+        }
+        return fiber;
+    }
+    // If we have two possible branches, we'll walk backwards up to the root
+    // to see what path the root points to. On the way we may hit one of the
+    // special cases and we'll deal with them.
+    var a = fiber;
+    var b = alternate;
+    while (true) {
+        var parentA = a.return;
+        if (parentA === null) {
+            // We're at the root.
+            break;
+        }
+        var parentB = parentA.alternate;
+        if (parentB === null) {
+            // There is no alternate. This is an unusual case. Currently, it only
+            // happens when a Suspense component is hidden. An extra fragment fiber
+            // is inserted in between the Suspense fiber and its children. Skip
+            // over this extra fragment fiber and proceed to the next parent.
+            var nextParent = parentA.return;
+            if (nextParent !== null) {
+                a = b = nextParent;
+                continue;
+            }
+            // If there's no parent, we're at the root.
+            break;
+        }
+        // If both copies of the parent fiber point to the same child, we can
+        // assume that the child is current. This happens when we bailout on low
+        // priority: the bailed out fiber's child reuses the current child.
+        if (parentA.child === parentB.child) {
+            var child = parentA.child;
+            while (child) {
+                if (child === a) {
+                    // We've determined that A is the current branch.
+                    assertIsMounted(parentA);
+                    return fiber;
+                }
+                if (child === b) {
+                    // We've determined that B is the current branch.
+                    assertIsMounted(parentA);
+                    return alternate;
+                }
+                child = child.sibling;
+            }
+            // We should never have an alternate for any mounting node. So the only
+            // way this could possibly happen is if this was unmounted, if at all.
+            throw new Error('Unable to find node on an unmounted component.');
+        }
+        if (a.return !== b.return) {
+            // The return pointer of A and the return pointer of B point to different
+            // fibers. We assume that return pointers never criss-cross, so A must
+            // belong to the child set of A.return, and B must belong to the child
+            // set of B.return.
+            a = parentA;
+            b = parentB;
+        }
+        else {
+            // The return pointers point to the same fiber. We'll have to use the
+            // default, slow path: scan the child sets of each parent alternate to see
+            // which child belongs to which set.
+            //
+            // Search parent A's child set
+            var didFindChild = false;
+            var child = parentA.child;
+            while (child) {
+                if (child === a) {
+                    didFindChild = true;
+                    a = parentA;
+                    b = parentB;
+                    break;
+                }
+                if (child === b) {
+                    didFindChild = true;
+                    b = parentA;
+                    a = parentB;
+                    break;
+                }
+                child = child.sibling;
+            }
+            if (!didFindChild) {
+                // Search parent B's child set
+                child = parentB.child;
+                while (child) {
+                    if (child === a) {
+                        didFindChild = true;
+                        a = parentB;
+                        b = parentA;
+                        break;
+                    }
+                    if (child === b) {
+                        didFindChild = true;
+                        b = parentB;
+                        a = parentA;
+                        break;
+                    }
+                    child = child.sibling;
+                }
+                if (!didFindChild) {
+                    throw new Error('Child was not found in either parent set. This indicates a bug ' +
+                        'in React related to the return pointer. Please file an issue.');
+                }
+            }
+        }
+        if (a.alternate !== b) {
+            throw new Error("Return fibers should always be each others' alternates. " +
+                'This error is likely caused by a bug in React. Please file an issue.');
+        }
+    }
+    // If the root is not a host container, we're in a disconnected tree. I.e.
+    // unmounted.
+    if (a.tag !== HostRoot) {
+        throw new Error('Unable to find node on an unmounted component.');
+    }
+    if (a.stateNode.current === a) {
+        // We've determined that A is the current branch.
+        return fiber;
+    }
+    // Otherwise B has to be current branch.
+    return alternate;
+}
+function findCurrentHostFiberImpl(node) {
+    // Next we'll drill down this component to find the first HostComponent/Text.
+    var tag = node.tag;
+    if (tag === HostComponent ||
+        tag === HostHoistable ||
+        tag === HostSingleton ||
+        tag === HostText) {
+        return node;
+    }
+    var child = node.child;
+    while (child !== null) {
+        var match = findCurrentHostFiberImpl(child);
+        if (match !== null) {
+            return match;
+        }
+        child = child.sibling;
+    }
+    return null;
+}
+function getNearestMountedFiber(fiber) {
+    var node = fiber;
+    var nearestMounted = fiber;
+    if (!fiber.alternate) {
+        // If there is no alternate, this might be a new tree that isn't inserted
+        // yet. If it is, then it will have a pending insertion effect on it.
+        var nextNode = node;
+        do {
+            node = nextNode;
+            if ((node.flags & (Placement | Hydrating)) !== NoFlags) {
+                // This is an insertion or in-progress hydration. The nearest possible
+                // mounted fiber is the parent but we need to continue to figure out
+                // if that one is still mounted.
+                nearestMounted = node.return;
+            }
+            // $FlowFixMe[incompatible-type] we bail out when we get a null
+            nextNode = node.return;
+        } while (nextNode);
+    }
+    else {
+        while (node.return) {
+            node = node.return;
+        }
+    }
+    if (node.tag === HostRoot) {
+        // TODO: Check if this was a nested HostRoot when used with
+        // renderContainerIntoSubtree.
+        return nearestMounted;
+    }
+    // If we didn't hit the root, that means that we're in an disconnected tree
+    // that has been unmounted.
+    return null;
+}
+function assertIsMounted(fiber) {
+    if (getNearestMountedFiber(fiber) !== fiber) {
+        throw new Error('Unable to find node on an unmounted component.');
+    }
+}
+
+exports.findCurrentHostFiber = findCurrentHostFiber;
+exports.findDomCompat = findDomCompat;

package/lib/utils/formatDuration.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/formula.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/getPageId.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/getVariable.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/grammar.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/handleAction.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/helper.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/highlight.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/icon.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/image.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/index.d.ts

@@ -61,5 +61,6 @@ export * from './resolveCondition';
 export * from './arraySlice';
 export * from './math';
 export * from './memoryParse';
+export * from './findDomCompat';
 import animation from './Animation';
 export { animation };

package/lib/utils/index.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/isPureVariable.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/json-schema-2-amis-schema.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/keyToPath.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/labelToString.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/loopTooMuch.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/makeSorter.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/math.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/memoryParse.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/normalizeLink.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/normalizeOptions.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/object.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/offset.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/offsetParent.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/optionValueCompare.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/position.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/prettyBytes.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/printElement.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/renderer-event.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/replaceText.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/resize-sensor.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/resolveCondition.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/resolveVariable.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/resolveVariableAndFilter.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/resolveVariableAndFilterForAsync.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/scrollPosition.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/string2regExp.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/stripNumber.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/style-helper.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/style.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/toNumber.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/tokenize.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/tpl-builtin.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/tpl-lodash.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/tpl.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/uncontrollable.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */
 

package/lib/utils/validateId.js

@@ -1,5 +1,5 @@
 /**
- * amis-core v6.14.0-beta.11
+ * amis-core v6.14.0-beta.13
  * Copyright 2018-2025 fex
  */