Refuse a cyclic input as not-an-adf-document
CI / gate (push) Successful in 53s
CI / publish (push) Has been skipped

This commit is contained in:
2026-10-04 16:57:51 +02:00
parent 9c1573ce02
commit f9f863fb28
5 changed files with 58 additions and 36 deletions
+20
View File
@@ -82,3 +82,23 @@ test("reads a node's siblings as a walk rather than as one call's arguments", ()
assert.equal(isAdfDocument(wide), true)
assert.equal(fault(wide), 'accepted')
})
test('refuses a document that holds itself, and accepts one sharing a node or a mark', () => {
const notANode = "an ADF document's content holds ADF nodes: one of them is not"
const paragraph: { content: unknown[]; type: string } = { content: [], type: 'paragraph' }
paragraph.content.push(paragraph)
assert.equal(fault({ content: [paragraph], type: 'doc', version: 1 }), notANode)
const document: { content: unknown[]; type: string; version: number } = { content: [], type: 'doc', version: 1 }
document.content.push(document)
assert.equal(fault(document), notANode)
const attrs: Record<string, unknown> = {}
attrs['a'] = [attrs]
assert.equal(fault({ content: [{ attrs, type: 'paragraph' }], type: 'doc', version: 1 }), notANode)
assert.equal(fault({ content: [{ marks: [{ attrs, type: 'link' }], text: 'x', type: 'text' }], type: 'doc', version: 1 }), notANode)
assert.equal(isAdfDocument({ content: [{ attrs, type: 'paragraph' }], type: 'doc', version: 1 }), false)
const bold = { type: 'strong' }
const text = { marks: [bold], text: 'x', type: 'text' }
const shared = { content: [text, text], type: 'paragraph' }
const values = { b: 1 }
assert.equal(fault({ content: [shared, shared, { attrs: { a: [values, values] }, type: 'paragraph' }], type: 'doc', version: 1 }), 'accepted')
})
+11 -16
View File
@@ -1,5 +1,5 @@
import type { ConvertFault } from '../result.ts'
import { isJsonValue, overNested, type JsonValue } from '../json-value.ts'
import { everyInTree, isJsonValue, overNested, type JsonValue } from '../json-value.ts'
import { largestNesting } from '../nesting.ts'
import { serializeCanonicalJson } from '../canonical-json.ts'
@@ -123,21 +123,16 @@ export function nodeMarks(node: { marks?: AdfMark[] }): readonly AdfMark[] {
}
function isNodeArray(value: readonly unknown[]): value is readonly AdfNode[] {
const pending: unknown[] = [...value]
while (pending.length > 0) {
const node = pending.pop()
if (!isRecord(node) || !holdsOnly(node, nodeKeys)) return false
if (typeof node['type'] !== 'string') return false
if ('attrs' in node && !isAttributes(node['attrs'])) return false
if ('marks' in node && !isArrayOf(node['marks'], isAdfMark)) return false
if ('text' in node && typeof node['text'] !== 'string') return false
if ('content' in node) {
const content = node['content']
if (!Array.isArray(content)) return false
for (const child of content) pending.push(child)
}
}
return true
return everyInTree(value, (node) => {
if (!isRecord(node) || !holdsOnly(node, nodeKeys)) return undefined
if (typeof node['type'] !== 'string') return undefined
if ('attrs' in node && !isAttributes(node['attrs'])) return undefined
if ('marks' in node && !isArrayOf(node['marks'], isAdfMark)) return undefined
if ('text' in node && typeof node['text'] !== 'string') return undefined
if (!('content' in node)) return []
const content = node['content']
return Array.isArray(content) ? [...content] : undefined
})
}
function marksKey(marks: readonly AdfMark[]): string {
+25 -12
View File
@@ -2,23 +2,36 @@ import { largestNesting } from './nesting.ts'
export type JsonValue = JsonValue[] | boolean | null | number | string | { [key: string]: JsonValue }
export function isJsonValue(value: unknown): value is JsonValue {
const pending: unknown[] = [value]
// Tracks ancestors alone: a tree may share an object, but one holding itself would walk forever.
export function everyInTree(roots: readonly unknown[], children: (item: unknown) => readonly unknown[] | undefined): boolean {
const pending = Array.from(roots, (item) => ({ depth: 0, item }))
const ancestors: unknown[] = []
const onPath = new Set<unknown>()
while (pending.length > 0) {
const item = pending.pop()
if (item === null || typeof item === 'boolean' || typeof item === 'string') continue
if (typeof item === 'number') {
if (!Number.isFinite(item)) return false
continue
}
// A hole is not a JSON value, and Array.prototype methods skip holes — spreading materialises them.
if (Array.isArray(item)) for (const child of [...item]) pending.push(child)
else if (typeof item === 'object') for (const child of Object.values(item)) pending.push(child)
else return false
const entry = pending.pop()
if (entry === undefined) continue
while (ancestors.length > entry.depth) onPath.delete(ancestors.pop())
if (onPath.has(entry.item)) return false
const held = children(entry.item)
if (held === undefined) return false
if (held.length === 0) continue
ancestors.push(entry.item)
onPath.add(entry.item)
for (const child of held) pending.push({ depth: entry.depth + 1, item: child })
}
return true
}
export function isJsonValue(value: unknown): value is JsonValue {
return everyInTree([value], (item) => {
if (item === null || typeof item === 'boolean' || typeof item === 'string') return []
if (typeof item === 'number') return Number.isFinite(item) ? [] : undefined
// A hole is not a JSON value, and Array.prototype methods skip holes — spreading materialises them.
if (Array.isArray(item)) return [...item]
return typeof item === 'object' ? Object.values(item) : undefined
})
}
export function nestingDepth(value: unknown): number {
const pending: { depth: number; item: unknown }[] = [{ depth: 0, item: value }]
let deepest = 0