@aiao/rxdb-plugin-tree 0.0.0-stage → 0.0.28

package/dist/index.js

@@ -0,0 +1,564 @@
+import { n as e, r as t, t as n } from "./constants-DRludxr-.js";
+import { Entity as r, EntityBase as i, Repository as a, RxDBPluginBase as o, SyncType as s, applyExternalEntityUpdate as c, assertOptionalNonNegativeSafeInteger as l, getEntityId as u, getFingerprintByEntities as d, getFingerprintPrimitive as f, isEntityMatchWhere as p, isStaleEntityEvent as m, isStaleEntityRemoveEvent as h, prepareIncrementalUpdate as g, queryNeedRefreshCreate as _, queryNeedRefreshRemove as v, queryNeedRefreshUpdate as y } from "@aiao/rxdb";
+import { switchMap as b, tap as x } from "rxjs";
+//#region \0@oxc-project+runtime@0.152.0/helpers/esm/decorate.js
+function S(e, t, n, r) {
+	var i = arguments.length, a = i < 3 ? t : r === null ? r = Object.getOwnPropertyDescriptor(t, n) : r, o;
+	if (typeof Reflect == "object" && typeof Reflect.decorate == "function") a = Reflect.decorate(e, t, n, r);
+	else for (var s = e.length - 1; s >= 0; s--) (o = e[s]) && (a = (i < 3 ? o(a) : i > 3 ? o(t, n, a) : o(t, n)) || a);
+	return i > 3 && a && Object.defineProperty(t, n, a), a;
+}
+//#endregion
+//#region src/entity/tree-entity-base.ts
+var C = class extends i {
+	parentId;
+};
+C = S([r(n)], C);
+//#endregion
+//#region src/entity/tree-entity.decorator.ts
+var w = (e) => {
+	let t = e.features?.tree ?? {};
+	return r({
+		...e,
+		features: {
+			...e.features,
+			tree: {
+				...t,
+				type: t.type ?? "adjacency-list",
+				hasChildren: t.hasChildren ?? !1
+			}
+		},
+		repository: e.repository ?? "TreeRepository"
+	});
+}, T = (e) => e ? Reflect.get(e, "parentId") ?? null : null, E = (e) => "parentId" in e.patch && T(e.patch) !== T(e.inversePatch);
+function* D(e, t, n = {}) {
+	let { maxLevel: r, maxDepth: i } = n, a = /* @__PURE__ */ new Set(), o = T(e), s = 1;
+	for (; o !== null && !a.has(o) && (i === void 0 || a.size < i);) {
+		a.add(o);
+		let e = t.get(o);
+		if (!e || r !== void 0 && s > r) break;
+		yield {
+			entity: e,
+			level: s
+		}, o = T(e), s++;
+	}
+}
+function O(e, t, n, r) {
+	if (t == null) {
+		let t = /* @__PURE__ */ new Set(), i = e, a = 0;
+		for (; r === void 0 || a <= r;) {
+			let e = T(i);
+			if (e === null) return !0;
+			if (t.has(e)) return !1;
+			t.add(e);
+			let r = n.get(e);
+			if (!r) return !1;
+			i = r, a++;
+		}
+		return !1;
+	}
+	let i = /* @__PURE__ */ new Set(), a = T(e), o = 1;
+	for (; a !== null && !i.has(a);) {
+		if (a === t) return r === void 0 || o <= r;
+		i.add(a), o++;
+		let e = n.get(a);
+		if (e) a = T(e);
+		else break;
+	}
+	return !1;
+}
+function k(e, t, n, r) {
+	if (t == null) return !1;
+	let i = n.get(t);
+	if (!i) return !1;
+	for (let { entity: t } of D(i, n, { maxLevel: r })) if (Reflect.get(t, "id") === Reflect.get(e, "id")) return !0;
+	return !1;
+}
+function* A(...e) {
+	for (let t of e) yield* t;
+}
+function j(e, t) {
+	let n = /* @__PURE__ */ new Map();
+	for (let r of e) {
+		let e = t(r);
+		e != null && n.set(e, r);
+	}
+	return n;
+}
+//#endregion
+//#region src/query/merge_create.ts
+var M = (e, t) => {
+	let n = e.options.where, r = t.filter((e) => !n || p(e.patch, n));
+	if (r.length === 0) return;
+	let i = r.map((t) => e.serialize(t));
+	switch (e.type) {
+		case "findDescendants": {
+			let t = e.options, n = j(A(e.resultEntitySet, i), (e) => e.id), r = i.filter((e) => e.id === t.entityId || O(e, t.entityId, n, t.level));
+			if (r.length === 0) return;
+			r.forEach((t) => e.resultEntitySet.add(t)), e.next(Array.from(e.resultEntitySet.values()), !0);
+			break;
+		}
+		case "findAncestors": {
+			let t = e.options, n = j(A(e.resultEntitySet, i), (e) => e.id), r = i.filter((e) => e.id === t.entityId || k(e, t.entityId, n, t.level));
+			if (r.length === 0) return;
+			r.forEach((t) => e.resultEntitySet.add(t)), e.next(Array.from(e.resultEntitySet.values()), !0);
+			break;
+		}
+	}
+}, N = (t, n) => {
+	if (!e.has(t.type)) return;
+	if (t.result === void 0) {
+		t.refresh();
+		return;
+	}
+	if (n.some((e) => m(t.rxdb, e))) {
+		t.refresh();
+		return;
+	}
+	let r = [], i = [];
+	switch (t.type) {
+		case "findDescendants":
+		case "findAncestors":
+			i.push(["match_where", "not_match_relation_where"]), r.push(["match_relation_where"]);
+			break;
+		case "countDescendants":
+		case "countAncestors": r.push(["match_where"], ["match_relation_where"]);
+	}
+	let a = _(t, n, r, i);
+	a.refresh ? t.refresh() : a.recalculate && M(t, a.current_entities);
+}, P = (e, t) => {
+	let n = new Set(t.map((e) => e.id));
+	switch (e.type) {
+		case "findDescendants": {
+			let t = Array.from(e.resultEntitySet.values()), r = j(t, (e) => e.id), i = /* @__PURE__ */ new Map(), a = (e) => {
+				let t = i.get(e.id);
+				if (t !== void 0) return t;
+				let a = [e.id], o = n.has(e.id);
+				if (!o) for (let { entity: t } of D(e, r)) {
+					let e = i.get(t.id);
+					if (e !== void 0) {
+						o = e;
+						break;
+					}
+					if (n.has(t.id)) {
+						o = !0;
+						break;
+					}
+					a.push(t.id);
+				}
+				for (let e of a) i.set(e, o);
+				return o;
+			}, o = t.filter((e) => !a(e));
+			if (o.length === t.length) return;
+			e.next(o, !0);
+			break;
+		}
+		case "findAncestors": {
+			let t = Array.from(e.resultEntitySet.values()), r = t.filter((e) => !n.has(e.id));
+			if (r.length === t.length) return;
+			let { entityId: i } = e.options;
+			if (i == null) {
+				e.next(r, !0);
+				break;
+			}
+			let a = j(r, (e) => e.id), o = [], s = a.get(i);
+			if (s) {
+				o.push(s);
+				for (let { entity: e } of D(s, a)) o.push(e);
+			}
+			e.next(o, !0);
+			break;
+		}
+	}
+}, F = (t, n) => {
+	if (!e.has(t.type)) return;
+	if (t.result === void 0) {
+		t.refresh();
+		return;
+	}
+	let r = n.filter((e) => !h(t.rxdb, e));
+	if (r.length === 0) return;
+	let i = [], a = [];
+	switch (t.type) {
+		case "findAncestors":
+			a.push(["result_contains"]), i.push(["match_relation_where"]);
+			break;
+		case "findDescendants":
+			a.push(["result_contains"], ["match_where"]), i.push(["match_relation_where"]);
+			break;
+		case "countDescendants":
+		case "countAncestors": i.push(["match_where"], ["match_relation_where"]);
+	}
+	let o = v(t, r, i, a);
+	o.refresh ? t.refresh() : o.recalculate && P(t, o.current_entities);
+}, I = (e, t) => {
+	let n = u(t);
+	if (n !== void 0) return e.ids.has(n) ? !0 : !e.complete && void 0;
+}, L = class {
+	cache;
+	oldResultMap;
+	constructor(e, t) {
+		this.cache = e, this.oldResultMap = t;
+	}
+	resolveParentEntity(e) {
+		let t = this.cache.getSerializedUpdate(e);
+		return t ? (this.oldResultMap.set(e, t), t) : this.oldResultMap.get(e);
+	}
+	isEntityDescendant(e, t) {
+		if (t == null) {
+			let t = T(e), n = 0, r = /* @__PURE__ */ new Set();
+			for (; t !== null && !r.has(t);) {
+				n++, r.add(t);
+				let e = this.resolveParentEntity(t);
+				if (e) t = T(e);
+				else break;
+			}
+			return {
+				isDescendant: !0,
+				level: n
+			};
+		}
+		let n = T(e), r = /* @__PURE__ */ new Set(), i = 0;
+		for (; n !== null && !r.has(n);) {
+			if (i++, n === t) return {
+				isDescendant: !0,
+				level: i
+			};
+			r.add(n);
+			let e = this.resolveParentEntity(n);
+			if (e) n = T(e);
+			else break;
+		}
+		return {
+			isDescendant: !1,
+			level: 0
+		};
+	}
+	isEntityAncestor(e, t, n) {
+		let r = u(t);
+		if (r === void 0 || r === u(e)) return !1;
+		let i = T(e), a = /* @__PURE__ */ new Set(), o = 0;
+		for (; i !== null && !a.has(i);) {
+			if (o++, n !== void 0 && o > n) return !1;
+			if (i === r) return !0;
+			a.add(i);
+			let e = this.resolveParentEntity(i);
+			if (e) i = T(e);
+			else break;
+		}
+		return !1;
+	}
+	isEntityDescendantForCount(e, t) {
+		if (!e) return;
+		if (t == null) return !0;
+		let n = T(e), r = /* @__PURE__ */ new Set();
+		for (; n !== null && !r.has(n);) {
+			if (n === t) return !0;
+			r.add(n);
+			let e = this.cache.getSerializedUpdate(n);
+			if (e) n = T(e);
+			else return;
+		}
+		return !1;
+	}
+	descendantDepthForCount(e, t) {
+		if (!e) return;
+		let n = t == null, r = T(e), i = /* @__PURE__ */ new Set(), a = 0;
+		for (; r !== null && !i.has(r);) {
+			if (a++, !n && r === t) return {
+				isDescendant: !0,
+				depth: a
+			};
+			i.add(r);
+			let e = this.cache.getSerializedUpdate(r);
+			if (!e) return;
+			r = T(e);
+		}
+		return n ? {
+			isDescendant: !0,
+			depth: a
+		} : {
+			isDescendant: !1,
+			depth: a
+		};
+	}
+	collectAncestorIdsForCount(e, t) {
+		let n = /* @__PURE__ */ new Set(), r = T(e), i = 0;
+		for (; r !== null && !n.has(r);) {
+			if (i++, t !== void 0 && i > t) return {
+				ids: n,
+				complete: !0
+			};
+			n.add(r);
+			let e = this.cache.getSerializedUpdate(r);
+			if (!e) return {
+				ids: n,
+				complete: !1
+			};
+			r = T(e);
+		}
+		return {
+			ids: n,
+			complete: !0
+		};
+	}
+}, R = (e, t, n, r) => {
+	let i = e.options, a = i.entityId, o = i.level, s = Array.from(e.resultEntitySet.values()), l = /* @__PURE__ */ new Map();
+	s.forEach((e) => {
+		let t = u(e);
+		t !== void 0 && l.set(t, e);
+	});
+	let d = new Set(l.keys()), f = new L(r, l), p = !1, m = /* @__PURE__ */ new Set(), h = (e, t) => a == null ? T(t) === null : e === a, g = (e, t) => {
+		if (!n.updatedIds.has(e) || h(e, r.getSerializedUpdate(e) ?? t)) return "keep";
+		if (n.newlyUnmatchedIds.has(e)) return "drop";
+		if (!n.matchNowIds.has(e)) return "keep";
+		let i = r.getData(e);
+		if (!i || !E(i)) return "keep";
+		let s = r.getSerializedUpdate(e);
+		if (!s) return "refresh";
+		let { isDescendant: c, level: l } = f.isEntityDescendant(s, a);
+		return c && (o === void 0 || l <= o) ? "keep" : "drop";
+	}, _ = !1, v = s.filter((e) => {
+		let t = u(e);
+		if (t === void 0) return !0;
+		let n = g(t, e);
+		return n === "refresh" ? (_ = !0, !0) : n === "keep" || (m.add(t), p = !0, !1);
+	});
+	if (_) {
+		e.refresh();
+		return;
+	}
+	let y = v.map((e) => {
+		let t = u(e);
+		if (t !== void 0 && n.updatedIds.has(t)) {
+			let n = r.getData(t);
+			n && (c(e, n.patch), p = !0);
+		}
+		return e;
+	}), b = y;
+	if (m.size > 0) {
+		let e = /* @__PURE__ */ new Map();
+		y.forEach((t) => {
+			let n = u(t);
+			n !== void 0 && e.set(n, t);
+		});
+		let t = (t) => r.getSerializedUpdate(t) ?? e.get(t) ?? l.get(t), n = /* @__PURE__ */ new Map(), i = (e) => {
+			let r = u(e), i = r === void 0 ? void 0 : n.get(r);
+			if (i !== void 0) return i;
+			let o = r === void 0 ? [] : [r], s = !1, c = T(e), l = /* @__PURE__ */ new Set();
+			for (; c !== null && !l.has(c);) {
+				let e = n.get(c);
+				if (e !== void 0) {
+					s = e;
+					break;
+				}
+				if (m.has(c)) {
+					s = !0;
+					break;
+				}
+				if (c === a) break;
+				l.add(c), o.push(c);
+				let r = t(c);
+				if (!r) break;
+				c = T(r);
+			}
+			for (let e of o) n.set(e, s);
+			return s;
+		};
+		b = y.filter((e) => {
+			let t = u(e);
+			return t !== void 0 && !h(t, e) && i(e) ? (p = !0, !1) : !0;
+		});
+	}
+	let x = t.filter((e) => {
+		let t = e.id;
+		return !n.matchNowIds.has(t) || d.has(t) ? !1 : n.newlyMatchedIds.has(t) || E(e);
+	});
+	for (let t of x) {
+		let n = r.getSerializedUpdate(t.id);
+		if (!n) continue;
+		let { isDescendant: i, level: s } = f.isEntityDescendant(n, a);
+		if (i && (o === void 0 || s <= o)) {
+			e.refresh();
+			return;
+		}
+	}
+	p && e.next(b, !0);
+}, z = (e, t, n, r) => {
+	let i = e.options, a = i.entityId, o = i.level, s = Array.from(e.resultEntitySet.values()), l = /* @__PURE__ */ new Map();
+	s.forEach((e) => {
+		let t = u(e);
+		t !== void 0 && l.set(t, e);
+	});
+	let d = new Set(l.keys()), f = new L(r, l), p = () => a == null ? void 0 : r.getSerializedUpdate(a) || l.get(a);
+	if (t.some(E)) {
+		e.refresh();
+		return;
+	}
+	let m = p(), h = (e) => {
+		if (e === a) return !1;
+		if (d.has(e)) return !0;
+		let t = r.getSerializedUpdate(e);
+		return !!m && !!t && f.isEntityAncestor(m, t, o);
+	};
+	if ([...n.newlyMatchedIds, ...n.newlyUnmatchedIds].some(h)) {
+		e.refresh();
+		return;
+	}
+	let g = !1, _ = s.map((e) => {
+		let t = u(e);
+		if (t !== void 0 && n.updatedIds.has(t)) {
+			let n = r.getData(t);
+			n && (c(e, n.patch), g = !0);
+		}
+		return e;
+	});
+	if (m) {
+		let e = u(m);
+		e !== void 0 && (_.some((t) => u(t) === e) || (g = !0, _.push(m)));
+	}
+	g && e.next(_, !0);
+}, B = (e, t, n, r) => {
+	let i = e.options, a = i.entityId, { level: o } = i, s = new L(r, /* @__PURE__ */ new Map()), c = (e) => {
+		if (o === void 0) return s.isEntityDescendantForCount(e, a);
+		let t = s.descendantDepthForCount(e, a);
+		if (t !== void 0) return t.isDescendant && t.depth <= o;
+	}, l = (e) => a == null && !!e && T(e) === null;
+	t.some((e) => {
+		let t = e.id, i = n.matchBeforeIds.has(t) !== n.matchNowIds.has(t), a = E(e);
+		if (!i && !a) return !1;
+		let o = r.getSerializedBefore(t, e.inversePatch), s = r.getSerializedUpdate(t);
+		if (l(o) && l(s)) return !1;
+		let u = c(o), d = a ? c(s) : u;
+		return u !== !1 || d !== !1;
+	}) && e.refresh();
+}, V = (e, t, n, r) => {
+	let i = e.options, a = i.entityId, { level: o } = i;
+	if (a == null) {
+		e.refresh();
+		return;
+	}
+	let s = r.getData(a);
+	if (!s) {
+		e.refresh();
+		return;
+	}
+	let c = new L(r, /* @__PURE__ */ new Map()), l = r.getSerializedBefore(s.id, s.inversePatch), u = r.getSerializedUpdate(s.id);
+	if (!l || !u) {
+		e.refresh();
+		return;
+	}
+	if (T(l) !== T(u)) {
+		e.refresh();
+		return;
+	}
+	let d = c.collectAncestorIdsForCount(u, o);
+	t.some((e) => {
+		let t = e.id;
+		if (t === a || n.matchBeforeIds.has(t) === n.matchNowIds.has(t) && !E(e)) return !1;
+		let i = r.getSerializedBefore(t, e.inversePatch), o = I(d, i), s = I(d, r.getSerializedUpdate(t));
+		return o !== !1 || s !== !1;
+	}) && e.refresh();
+}, H = (e, t) => {
+	let { cache: n, classification: r } = g(e, t);
+	switch (e.type) {
+		case "findDescendants":
+			R(e, t, r, n);
+			break;
+		case "findAncestors":
+			z(e, t, r, n);
+			break;
+		case "countDescendants":
+			B(e, t, r, n);
+			break;
+		case "countAncestors": V(e, t, r, n);
+	}
+}, U = (t, n) => {
+	if (!e.has(t.type)) return;
+	if (t.result === void 0) {
+		t.refresh();
+		return;
+	}
+	if (t.type === "findAncestors" && n.some(E)) {
+		t.refresh();
+		return;
+	}
+	let r = [], i = [];
+	switch (t.type) {
+		case "findDescendants":
+			i.push(["result_contains", "not_match_relation_where"], ["match_where", "not_match_relation_where"], ["match_where_before", "not_match_relation_where"]), r.push(["match_relation_where"]);
+			break;
+		case "findAncestors":
+			i.push(["result_contains", "not_match_relation_where"], ["match_where", "not_match_relation_where"]), r.push(["match_relation_where"]);
+			break;
+		case "countDescendants":
+		case "countAncestors": i.push(["match_where", "not_match_relation_where"], ["match_where_before", "not_match_relation_where"]), r.push(["match_relation_where"]);
+	}
+	let a = y(t, n, r, i);
+	a.refresh ? t.refresh() : a.recalculate && H(t, n);
+}, W = (e) => l(e, `tree query 'level' must be a non-negative integer, received: ${String(e)}`), G = class extends a {
+	static _STATIC_METHODS = [...super._STATIC_METHODS, ...t];
+	constructor(t, n) {
+		super(t, n), e.forEach((e) => {
+			this.queryManager.registerMergeCreateFn(e, N), this.queryManager.registerMergeUpdateFn(e, U), this.queryManager.registerMergeRemoveFn(e, F);
+		});
+	}
+	findDescendants(e) {
+		return e = this.#e(e), this.queryManager.createTask({
+			options: {
+				type: "findDescendants",
+				options: e
+			},
+			runner: () => this.primary$.pipe(b((t) => t.findDescendants(e)), x(this._setLocals)),
+			getFingerprint: d
+		}).result$;
+	}
+	countDescendants(e) {
+		return e = this.#e(e), this.queryManager.createTask({
+			options: {
+				type: "countDescendants",
+				options: e
+			},
+			runner: () => this.primary$.pipe(b((t) => t.countDescendants(e))),
+			getFingerprint: f
+		}).result$;
+	}
+	findAncestors(e) {
+		return e = this.#e(e), this.queryManager.createTask({
+			options: {
+				type: "findAncestors",
+				options: e
+			},
+			runner: () => this.primary$.pipe(b((t) => t.findAncestors(e)), x(this._setLocals)),
+			getFingerprint: d
+		}).result$;
+	}
+	countAncestors(e) {
+		return e = this.#e(e), this.queryManager.createTask({
+			options: {
+				type: "countAncestors",
+				options: e
+			},
+			runner: () => this.primary$.pipe(b((t) => t.countAncestors(e))),
+			getFingerprint: f
+		}).result$;
+	}
+	#e(e) {
+		return {
+			...e,
+			level: W(e.level),
+			entityId: e.entityId ?? null
+		};
+	}
+}, K = class extends o {
+	lifecycle = "scoped";
+	name = "tree";
+	install(e) {
+		this.rxdb.repository("TreeRepository", {
+			class: G,
+			unsupportedSyncTypes: { [s.QueryCache]: "树查询依赖本地完整的祖先链，而缓存只覆盖查过的 where 命中的行，递归会在缺口处静默截断。改用 SyncType.Full / Filter，或把该实体换成普通 Repository。" }
+		}, e);
+	}
+}, q = (e) => new K(e);
+//#endregion
+export { K as RxDBPluginTree, n as TREE_ADJACENCY_LIST_ENTITY_BASE_OPTIONS, e as TREE_QUERY_TYPES, t as TREE_QUERY_TYPE_LIST, C as TreeAdjacencyListEntityBase, w as TreeEntity, G as TreeRepository, W as assertTreeLevel, q as rxDBPluginTree };

package/dist/plugin.d.ts

@@ -0,0 +1,84 @@
+import { IRxDBPlugin, Plugin, RxDBPluginBase } from '@aiao/rxdb';
+import { LifecycleScope } from '@aiao/utils';
+import { EntityMetadataTreeFeatures } from './entity/tree-metadata.interface.js';
+import { TreeRepository } from './repository/TreeRepository.js';
+/**
+ * {@link rxDBPluginTree} 的选项。
+ *
+ * @remarks
+ * 目前无可配项：树的所有行为都由实体元数据（`features.tree`）和查询选项决定，
+ * 没有需要在装配期敲定的开关。保留这个类型是为了让 `Plugin<…>` 的形参具名 ——
+ * 将来加选项时是加字段，不是改签名。
+ */
+type RxDBPluginTreeOptions = object;
+/**
+ * 树形结构插件。
+ *
+ * @remarks
+ * 只做一件事：把 {@link TreeRepository} 登记到 `rxdb` 的仓储注册表，并声明它撑不住
+ * `SyncType.QueryCache`。登记是 **scoped** 的 —— 连接断开时随 scope 一起撤销，
+ * 不会把指向已拆纪元的仓储留在 `rxdb` 上。
+ *
+ * 四个树查询（`findDescendants` / `countDescendants` / `findAncestors` / `countAncestors`）
+ * 与它们的增量 merge 都挂在 `TreeRepository` 上，不装本插件的应用连 `QueryOptions`
+ * 里都没有这四支。
+ *
+ * 一般不直接 `new`，用工厂 {@link rxDBPluginTree} 交给 `.use()`。
+ *
+ * @example
+ * ```typescript
+ * import { rxDBPluginTree } from '@aiao/rxdb-plugin-tree';
+ *
+ * const rxdb = new RxDB({ entities: [Category] }).use(rxDBPluginTree);
+ * ```
+ */
+export declare class RxDBPluginTree extends RxDBPluginBase implements IRxDBPlugin {
+    readonly lifecycle: "scoped";
+    name: Uncapitalize<string>;
+    install(scope: LifecycleScope): void;
+}
+declare module '@aiao/rxdb' {
+    interface RxDB {
+        tree: RxDBPluginTree;
+    }
+    /**
+     * 把 `TreeRepository` 登进门面轴注册表
+     *
+     * @remarks
+     * 与上面 `install()` 里的 `rxdb.repository('TreeRepository', …)` 成对：
+     * 那一处是运行期登记，这一处是类型登记。少了它，`@Entity({ repository: 'TreeRepository' })`
+     * 只能落到 `RxDBRepositoryName` 的 `(string & {})` 那一支，补全里一个字都没有。
+     */
+    interface RxDBRepositories {
+        TreeRepository: typeof TreeRepository;
+    }
+    /**
+     * 扩展 EntityMetadataFeatures，添加 tree 字段
+     */
+    interface EntityMetadataFeatures {
+        /**
+         * 树形特性配置
+         * 由 rxdb-plugin-tree 插件提供
+         */
+        tree?: EntityMetadataTreeFeatures;
+    }
+}
+/**
+ * {@link RxDBPluginTree} 的工厂，交给 `RxDB.use()`。
+ *
+ * @remarks
+ * 注册树实体（继承 `TreeAdjacencyListEntityBase` 或 `@TreeEntity` 标注）的应用**必须**
+ * 装它：没装时 `repository: 'TreeRepository'` 在注册期找不到仓储，实体初始化直接抛错
+ * （契约见 `__tests__/contracts/missing-plugin-error.spec.ts`），不会静默降级成普通仓储。
+ *
+ * @param db - 宿主 `RxDB` 实例，由 `use()` 注入
+ * @returns 插件实例
+ *
+ * @example
+ * ```typescript
+ * const rxdb = new RxDB({ entities: [Category] }).use(rxDBPluginTree);
+ * ```
+ */
+export declare const rxDBPluginTree: Plugin<RxDBPluginTreeOptions>;
+export {};
+//# sourceMappingURL=plugin.d.ts.map

package/dist/plugin.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"plugin.d.ts","sourceRoot":"","sources":["../src/plugin.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,EAAQ,cAAc,EAAY,MAAM,YAAY,CAAC;AACjF,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAE,0BAA0B,EAAE,MAAM,qCAAqC,CAAC;AACjF,OAAO,EAAE,cAAc,EAAE,MAAM,gCAAgC,CAAC;AAEhE;;;;;;;GAOG;AACH,KAAK,qBAAqB,GAAG,MAAM,CAAC;AAEpC;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,cAAe,SAAQ,cAAe,YAAW,WAAW;IACvE,QAAQ,CAAC,SAAS,EAAG,QAAQ,CAAU;IACvC,IAAI,EAAE,YAAY,CAAC,MAAM,CAAC,CAAU;IAEpC,OAAO,CAAC,KAAK,EAAE,cAAc;CAkB9B;AAED,OAAO,QAAQ,YAAY,CAAC;IAC1B,UAAU,IAAI;QACZ,IAAI,EAAE,cAAc,CAAC;KACtB;IACD;;;;;;;OAOG;IACH,UAAU,gBAAgB;QACxB,cAAc,EAAE,OAAO,cAAc,CAAC;KACvC;IACD;;OAEG;IACH,UAAU,sBAAsB;QAC9B;;;WAGG;QACH,IAAI,CAAC,EAAE,0BAA0B,CAAC;KACnC;CACF;AAED;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,cAAc,EAAE,MAAM,CAAC,qBAAqB,CAAwC,CAAC"}