earthsdk3 3.11.2 → 3.11.3-beta.1

package/dist/earthsdk3.js

@@ -43,7 +43,7 @@ function to(n) {
 }
 let Ni;
 try {
-  const n = "earthsdk3", i = "3.11.2", e = "2026-08-14T01:44:25.000Z", t = "北京西部世界科技有限公司", s = "地球可视化实验室 (EarthSDK&CesiumLab) https://www.bjxbsj.cn", r = "96c00e37006fd8a610c7b19b647f2b40a48e8846", l = ((Date.now() - 1786671865e3) / 36e5).toFixed(1), h = `%c🌏 ${n}%c ${i}.${r.slice(0, 8)}.${e} (距今${l}个小时)
+  const n = "earthsdk3", i = "3.11.3-beta.1", e = "2026-09-09T06:37:16.000Z", t = "北京西部世界科技有限公司", s = "地球可视化实验室 (EarthSDK&CesiumLab) https://www.bjxbsj.cn", r = "d983ef6edbe46624b3bae491829389ea6120258b", l = ((Date.now() - 1788935836e3) / 36e5).toFixed(1), h = `%c🌏 ${n}%c ${i}.${r.slice(0, 8)}.${e} (距今${l}个小时)
 %c${s ? s + `
 ` : ""}当前网站正在使用${n}，此软件版权归${t}所有
 `;
@@ -57,7 +57,7 @@ try {
     },
     // @ts-ignore
     get gituri() {
-      return GITURI_ && GITURI_.replace("${commitId}", "96c00e37006fd8a610c7b19b647f2b40a48e8846");
+      return GITURI_ && GITURI_.replace("${commitId}", "d983ef6edbe46624b3bae491829389ea6120258b");
     },
     // @ts-ignore
     get info() {
@@ -65,7 +65,7 @@ try {
     },
     // @ts-ignore
     get date() {
-      return "2026-08-14T01:44:25.000Z";
+      return "2026-09-09T06:37:16.000Z";
     },
     // @ts-ignore
     get author() {
@@ -73,7 +73,7 @@ try {
     },
     // @ts-ignore
     get version() {
-      return "3.11.2";
+      return "3.11.3-beta.1";
     },
     // @ts-ignore
     get name() {
@@ -81,7 +81,7 @@ try {
     },
     // @ts-ignore
     get commitId() {
-      return "96c00e37006fd8a610c7b19b647f2b40a48e8846";
+      return "d983ef6edbe46624b3bae491829389ea6120258b";
     },
     /**
      * 打印版权信息到控制台
@@ -4855,6 +4855,11 @@ class Sd extends E {
     ));
     a(this, "_containerScrollTop", this.disposeVar(y(0)));
     a(this, "_containerClientHeight", this.disposeVar(y(-1)));
+    // 可选的筛选函数：非空时，树中只显示匹配的节点及其祖先链（祖先自动展开）
+    // 注意：节点改名不会触发重绘，筛选期间改名后需调用 tree.forceRedraw() 刷新
+    a(this, "_filterFunc", this.disposeVar(
+      y(void 0)
+    ));
     a(this, "_container", this.disposeVar(
       y(void 0)
     ));
@@ -4882,16 +4887,15 @@ class Sd extends E {
         this._tree.itemsChanged,
         t.changed,
         s.changed,
-        r
+        r,
+        this._filterFunc.changed
       )
-    ), { redrawInfo: l } = this, h = (d) => {
-      const u = d.uiTreeObject;
-      return !!d.children && (!u || !u.collapsed);
-    };
+    ), { redrawInfo: l } = this;
     this.dispose(
       o.disposableOn(() => {
+        const c = this._createTraverseFunc();
         if (l.topFreeSpaceHeight = 0, l.topUnvisibleItemNum = 0, l.middleTreeItems.length = 0, l.bottomFreeSpaceHeight = 0, l.bottomUnvisibleItemNum = 0, this._containerClientHeight.value >= 0) {
-          const d = Wl(this._tree.getDescendants(h)), u = this._tree.itemDivHeight, p = u * d, f = os([
+          const d = Wl(this._tree.getDescendants(c)), u = this._tree.itemDivHeight, p = u * d, f = os([
             Ls([
               os([p - t.value, 0]),
               s.value
@@ -4903,7 +4907,7 @@ class Sd extends E {
           _ > 0 && (l.topUnvisibleItemNum = _, l.topFreeSpaceHeight = _ * this._tree.itemDivHeight);
           const S = _ + b;
           let P = 0;
-          for (let V of this._tree.getDescendants(h)) {
+          for (let V of this._tree.getDescendants(c)) {
             if (P >= S)
               break;
             P >= _ && l.middleTreeItems.push(V), ++P;
@@ -4911,25 +4915,34 @@ class Sd extends E {
           const R = d - _ - b;
           R > 0 && (l.bottomUnvisibleItemNum = R, l.bottomFreeSpaceHeight = R * this._tree.itemDivHeight);
         } else
-          for (let d of this._tree.getDescendants(h))
+          for (let d of this._tree.getDescendants(c))
             l.middleTreeItems.push(d);
         this._redrawEvent.emit(l);
       })
     );
-    let c;
+    let h;
     this.dispose(
-      () => c && (c.destroy(), c = void 0)
+      () => h && (h.destroy(), h = void 0)
     ), this.dispose(
-      this.containerChanged.disposableOn((d) => {
-        c && (c.destroy(), c = void 0), d && (c = Bn(), c.start(() => {
-          const { scrollTop: u, clientHeight: p } = d;
-          typeof u > "u" || typeof p > "u" ? Ji(
+      this.containerChanged.disposableOn((c) => {
+        h && (h.destroy(), h = void 0), c && (h = Bn(), h.start(() => {
+          const { scrollTop: d, clientHeight: u } = c;
+          typeof d > "u" || typeof u > "u" ? Ji(
             "createUiTreeWithContainer error: conainter has no scrollTop or clientHeight property!"
-          ) : (this.containerScrollTop = u, this.containerClientHeight = p);
+          ) : (this.containerScrollTop = d, this.containerClientHeight = u);
         }));
       })
     );
   }
+  get filterFunc() {
+    return this._filterFunc.value;
+  }
+  set filterFunc(e) {
+    this._filterFunc.value = e;
+  }
+  get filterFuncChanged() {
+    return this._filterFunc.changed;
+  }
   get container() {
     return this._container.value;
   }
@@ -4942,11 +4955,31 @@ class Sd extends E {
   get redrawInfo() {
     return this._redrawInfo;
   }
-  getTreeItemPos(e) {
-    const t = (o) => {
-      const l = o.uiTreeObject;
-      return !!o.children && (!l || !l.collapsed);
+  /**
+   * 生成遍历用的 traverseFunc（决定 getDescendants 是否下钻）
+   * 无筛选时按 collapsed 状态下钻；有筛选时先 DFS 计算可见集（匹配节点及其祖先链），
+   * 只下钻存在可见后代的节点，忽略 collapsed（不修改节点的折叠状态）。
+   * redraw 与 getTreeItemPos 必须共用此方法，保证虚拟滚动与定位一致。
+   */
+  _createTraverseFunc() {
+    const e = this._filterFunc.value;
+    if (!e)
+      return (r) => {
+        const o = r.uiTreeObject;
+        return !!r.children && (!o || !o.collapsed);
+      };
+    const t = /* @__PURE__ */ new Set(), s = (r) => {
+      let o = !1;
+      if (r.children)
+        for (let h of r.children)
+          s(h) && (o = !0);
+      const l = !!e(r) || o;
+      return l && o && t.add(r), l;
     };
+    return s(this._tree.root), (r) => !!r.children && t.has(r);
+  }
+  getTreeItemPos(e) {
+    const t = this._createTraverseFunc();
     let s = 0, r = !1;
     for (let o of this._tree.getDescendants(t)) {
       if (o === e) {