clearai-dsh 0.2.0 → 0.2.2

package/lib/domain-language.js

@@ -431,20 +431,20 @@ export function graphProjection(state) {
 	}
 	const terms = [...lexicon.terms].sort((a, b) => (a.id < b.id ? -1 : 1))
 	const predicates = [...lexicon.predicates].sort((a, b) => (a.id < b.id ? -1 : 1))
-	for (const term of terms) nodes.push({ id: `term:${term.id}`, kind: 'concept', ref: term.id, label: term.label ?? term.id, status: term.status ?? 'admitted', parent: text(term.parent) === '' ? null : text(term.parent), uses: uses.get(term.id) ?? 0, depth: depthOf(term) })
+	for (const term of terms) nodes.push({ id: `term:${term.id}`, kind: 'concept', layer: 'ontology', ref: term.id, label: term.label ?? term.id, status: term.status ?? 'admitted', parent: text(term.parent) === '' ? null : text(term.parent), uses: uses.get(term.id) ?? 0, depth: depthOf(term) })
 	const formsUsed = VALUE_FORMS.filter((form) => predicates.some((item) => text(item.range?.form) === form))
-	for (const [index, form] of formsUsed.entries()) nodes.push({ id: `form:${form}`, kind: 'value_type', ref: form, label: form, status: 'admitted', uses: 0, depth: 0, formIndex: index })
+	for (const [index, form] of formsUsed.entries()) nodes.push({ id: `form:${form}`, kind: 'value_type', layer: 'ontology', ref: form, label: form, status: 'admitted', uses: 0, depth: 0, formIndex: index })
 	for (const term of terms) {
 		if (text(term.parent) === '') continue
 		if (!termById.has(text(term.parent))) continue
-		edges.push({ id: `is_a:${term.id}`, kind: 'is_a', predicate: null, label: 'is_a', from: `term:${term.id}`, to: `term:${term.parent}`, status: term.status ?? 'admitted' })
+		edges.push({ id: `is_a:${term.id}`, kind: 'is_a', layer: 'ontology', predicate: null, label: 'is_a', from: `term:${term.id}`, to: `term:${term.parent}`, status: term.status ?? 'admitted' })
 	}
 	for (const predicate of predicates) {
 		const range = isPlainObject(predicate.range) ? predicate.range : {}
 		const rangeTerm = text(range.term)
 		const form = text(range.form)
 		const to = rangeTerm !== '' ? `term:${rangeTerm}` : form !== '' ? `form:${form}` : null
-		if (to !== null) edges.push({ id: `predicate:${predicate.id}`, kind: 'predicate', predicate: predicate.id, label: predicate.label ?? predicate.id, from: text(predicate.domain) === '' ? null : `term:${text(predicate.domain)}`, to, status: predicate.status ?? 'admitted', functional: predicate.functional === true })
+		if (to !== null) edges.push({ id: `predicate:${predicate.id}`, kind: 'predicate', layer: 'ontology', predicate: predicate.id, label: predicate.label ?? predicate.id, from: text(predicate.domain) === '' ? null : `term:${text(predicate.domain)}`, to, status: predicate.status ?? 'admitted', functional: predicate.functional === true })
 	}
 	const instances = new Map()
 	for (const fact of facts) {
@@ -454,7 +454,7 @@ export function graphProjection(state) {
 			const subjectId = text(subject.id)
 			if (subjectId === '') continue
 			const key = `${text(subject.type)}|${subjectId}`
-			if (!instances.has(key)) instances.set(key, { id: key, kind: 'instance', ref: subjectId, label: subjectId, type: text(subject.type) === '' ? null : text(subject.type), facts: [] })
+			if (!instances.has(key)) instances.set(key, { id: key, kind: 'instance', layer: 'entity', ref: subjectId, label: subjectId, type: text(subject.type) === '' ? null : text(subject.type), facts: [] })
 			instances.get(key).facts.push(fact.id ?? null)
 			const predicateId = text(assertion?.predicate)
 			const object = isPlainObject(assertion?.object) ? assertion.object : {}
@@ -465,48 +465,66 @@ export function graphProjection(state) {
 				const objectType = text(object.type) === '' ? text(predicateById.get(predicateId)?.range?.term) : text(object.type)
 				const objectKeyId = `${objectType}|${objectLabel}`
 				if (objectLabel !== '') {
-					if (!instances.has(objectKeyId)) instances.set(objectKeyId, { id: objectKeyId, kind: 'instance', ref: objectLabel, label: objectLabel, type: objectType === '' ? null : objectType, facts: [] })
+					if (!instances.has(objectKeyId)) instances.set(objectKeyId, { id: objectKeyId, kind: 'instance', layer: 'entity', ref: objectLabel, label: objectLabel, type: objectType === '' ? null : objectType, facts: [] })
 					instances.get(objectKeyId).facts.push(fact.id ?? null)
 					to = objectKeyId
 				}
 			} else if (predicateId !== '') {
 				const literalId = `${predicateId}:${objectKey(assertion.object)}`
-				if (!instances.has(literalId)) instances.set(literalId, { id: literalId, kind: 'literal', ref: objectKey(assertion.object), label: formatObject(object), type: null, facts: [] })
+				if (!instances.has(literalId)) instances.set(literalId, { id: literalId, kind: 'literal', layer: 'entity', ref: objectKey(assertion.object), label: formatObject(object), type: null, facts: [] })
 				instances.get(literalId).facts.push(fact.id ?? null)
 				to = literalId
 			}
-			if (to !== null) edges.push({ id: `assertion:${fact.id ?? ''}:${predicateId}:${subjectKey(assertion)}`, kind: 'assertion', predicate: predicateId, label: text(lexicon.predicates.find((item) => item.id === predicateId)?.label) || predicateId, from: key, to, status, level: fact.level ?? null, fact: fact.id ?? null, scope: fact.scope ?? null })
+			if (to !== null) edges.push({ id: `assertion:${fact.id ?? ''}:${predicateId}:${subjectKey(assertion)}`, kind: 'assertion', layer: 'entity', predicate: predicateId, label: text(lexicon.predicates.find((item) => item.id === predicateId)?.label) || predicateId, from: key, to, status, level: fact.level ?? null, fact: fact.id ?? null, scope: fact.scope ?? null, claim: text(fact.hypothesis) === '' ? null : text(fact.hypothesis) })
 		}
 	}
 	for (const instance of [...instances.values()].sort((a, b) => (a.id < b.id ? -1 : 1))) nodes.push(instance)
-	const maxDepth = nodes.reduce((best, node) => (node.kind === 'concept' ? Math.max(best, node.depth) : best), 0)
+	/**
+	 * **确定性布局:按层分段,层内折行。**
+	 *
+	 * 「层」= `is_a` 深度(概念)、值形态、实例/字面值各成一段,段与段依次向下排。
+	 * 关键的一步是**折行**:早先每一层只铺一行,于是一堆没有父概念的根被排成一条
+	 * 极宽极扁的带子(真数据:23 个节点铺出 3800×180),任何视口里都只能缩到看不清。
+	 * 折行之后同一层在有限宽度内往下堆,整体接近屏幕比例,读得清。
+	 *
+	 * 它仍然是**纯函数、确定性**:同一份账本永远算出同一套坐标(层内按 id 排,不靠遍历顺序)。
+	 */
 	const COLUMN = 220
 	const ROW = 132
+	const PER_ROW = 6
+	let cursorY = 0
+	const band = (list) => {
+		const top = cursorY
+		cursorY += Math.max(1, Math.ceil(list.length / PER_ROW)) * ROW
+		return top
+	}
+	const place = (list, top) => {
+		list.forEach((node, index) => {
+			node.x = (index % PER_ROW) * COLUMN
+			node.y = top + Math.floor(index / PER_ROW) * ROW
+		})
+	}
 	const byDepth = new Map()
 	for (const node of nodes.filter((item) => item.kind === 'concept')) {
 		const list = byDepth.get(node.depth) ?? []
 		list.push(node)
 		byDepth.set(node.depth, list)
 	}
-	const widest = Math.max(...[...byDepth.values()].map((list) => list.length), 1)
-	for (const [depth, list] of byDepth) {
-		list.forEach((node, index) => {
-			node.x = Math.round(index * COLUMN + (widest - list.length) * (COLUMN / 2))
-			node.y = depth * ROW
-		})
+	/** 深度小的在上(父在上、子在下),同深度内按 id——两条都为了确定性。 */
+	for (const depth of [...byDepth.keys()].sort((left, right) => left - right)) {
+		const list = byDepth.get(depth)
+		place(list, band(list))
 	}
-	nodes.filter((item) => item.kind === 'value_type').forEach((node) => {
-		node.x = Math.round(node.formIndex * COLUMN)
-		node.y = (maxDepth + 1) * ROW
-	})
-	const instanceBand = (maxDepth + 2) * ROW
-	const perRow = 6
-	nodes.filter((item) => item.kind === 'instance' || item.kind === 'literal').forEach((node, index) => {
-		node.x = (index % perRow) * COLUMN
-		node.y = instanceBand + Math.floor(index / perRow) * ROW
-	})
+	const forms = nodes.filter((item) => item.kind === 'value_type')
+	if (forms.length > 0) place(forms, band(forms))
+	const leaves = nodes.filter((item) => item.kind === 'instance' || item.kind === 'literal')
+	if (leaves.length > 0) place(leaves, band(leaves))
 	const width = Math.max(...nodes.map((node) => (typeof node.x === 'number' ? node.x : 0)), 0) + COLUMN
 	const height = Math.max(...nodes.map((node) => (typeof node.y === 'number' ? node.y : 0)), 0) + ROW
+	/**
+	 * 返回的是**纯语义**:节点、边、包围盒。视口该画哪一块、先画谁、怎么缩放,
+	 * 都是渲染层的事(现在是 React Flow)——投影不再替渲染做决定。
+	 */
 	return { nodes, edges, bounds: { width, height } }
 }