3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-17 13:50:25 +01:00

Answer stability round 2: 1 🔴, 1 🟡 (0 misread); carry pairs spanning the same nodes together, file item 161 for em sharing a run with strong

This commit is contained in:
2026-10-30 11:45:10 +01:00
committed by Lillem4n
parent 4834e802d9
commit dee5f8093d
4 changed files with 38 additions and 9 deletions
+3 -1
View File
@@ -10,7 +10,7 @@ test('spells a line alike taking every fallback a pass finds or the first alone'
fc.property(markedLine, lineContainer, (nodes, container) => {
assert.deepEqual(emitInlineLine(nodes, container, [], 'lossless'), emitInlineLine(nodes, container, [], 'lossless', 'first'))
}),
// Lines the fixed seed rarely generates: carrying one run lets a neighbour read as written, or one pass carries every copy of a repeated mark run.
// Lines the fixed seed rarely generates: carrying one run lets a neighbour or its holder read as written, or one pass carries every copy of a repeated mark run.
{
...propertyRuns(3000),
examples: [
@@ -21,6 +21,8 @@ test('spells a line alike taking every fallback a pass finds or the first alone'
[[{ text: 'un', type: 'text' }, { marks: [{ type: 'em' }, { type: 'strong' }], text: '-r', type: 'text' }, { marks: [{ type: 'strike' }], text: 'un', type: 'text' }, { marks: [{ type: 'strike' }, { type: 'em' }, { type: 'strong' }], text: '-r', type: 'text' }, { text: 'z', type: 'text' }], 'paragraph'],
[[{ marks: [{ type: 'strike' }], text: ' b', type: 'text' }, { marks: [{ type: 'em' }], text: '!-', type: 'text' }], 'paragraph'],
[[{ marks: [{ type: 'strike' }], text: 'r', type: 'text' }, { marks: [{ type: 'strike' }, { type: 'strong' }, { type: 'em' }], text: '[ ', type: 'text' }, ...[1, 2, 3, 4, 5].map(() => ({ marks: [{ type: 'strike' }], text: ' ', type: 'text' }))], 'heading'],
[[{ text: 'a', type: 'text' }, { marks: [{ type: 'em' }, { type: 'strike' }], text: '(', type: 'text' }, { marks: [{ type: 'em' }], text: 'a', type: 'text' }], 'paragraph'],
[[{ text: 'b', type: 'text' }, { marks: [{ type: 'strong' }], text: '(a', type: 'text' }, { marks: [{ type: 'em' }], text: '(b', type: 'text' }, { text: 'c', type: 'text' }], 'paragraph'],
],
},
)
+12 -5
View File
@@ -351,7 +351,7 @@ function holdsAlike({ fallen, pairs }: PairSweep, judged: number, character: str
return false
}
// A carry splits every pair holding it, so a pair falls cleanly under a carry only where it holds no pair closing before it, and under a drop only where no run merges at its ends.
// A carry splits every pair holding it, so a pair falls cleanly under a carry only where it holds no pair spanning fewer nodes, and under a drop only where no run merges at its ends.
function fallsCleanly({ fallback, merging, pairs }: PairSweep, judged: number): boolean {
const pair = pairs[judged]
if (pair === undefined) return false
@@ -409,7 +409,8 @@ function pairStanding({ fallback, fallen, first, merging, pairs }: PairSweep, ju
if (other === judged) return 'there'
if (pair === undefined || mergesAt(merging, pair)) return undefined
if (other > judged && judged > first) return 'there'
if (fallback.kind === 'carry') return undefined
// Under a carry, pairs spanning the same nodes stand and fall together.
if (fallback.kind === 'carry') return spansAlike(pair, pairs[judged]) ? 'there' : undefined
return fallen[other] === 1 ? 'gone' : 'either'
}
@@ -448,10 +449,16 @@ function wordBeside(sweep: PairSweep, judged: number, from: number, step: -1 | 1
}
}
// Pairs close in order, so a pair holding any pair that closes before the judged one holds the one just before it.
// Whether the pair holds one a carry may take before the judged one. Pairs close in order, so the judged pair, or one holding it, holds such a pair only where it holds the last of them to close.
function holdsEarlier(pairs: readonly EmphasisPair[], judged: number, pair: EmphasisPair): boolean {
const earlier = pairs[judged - 1]
return earlier !== undefined && pair.nodes.first <= earlier.nodes.first && earlier.nodes.last <= pair.nodes.last
let earlier = judged - 1
while (spansAlike(pairs[earlier], pairs[judged])) earlier -= 1
const held = pairs[earlier]
return held !== undefined && pair.nodes.first <= held.nodes.first && held.nodes.last <= pair.nodes.last
}
function spansAlike(pair: EmphasisPair | undefined, other: EmphasisPair | undefined): boolean {
return pair !== undefined && other !== undefined && pair.nodes.first === other.nodes.first && pair.nodes.last === other.nodes.last
}
function highlightFlanks(output: string, start: number, role: DelimiterRole): boolean {