larvit/adf-codec
3
0
Fork 0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-12 11:48:29 +01:00
Code Activity

Answer prose round 1: 0 🔴, 2 🟡 (0 misread); cut two comments to the lines the code cannot show

Browse Source
This commit is contained in:
Lilleman auf Larv
2026-11-09 01:09:30 +01:00
parent 1d48a1a14e
commit 9a8f8b337c
1 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/markdown/inline-content.ts
+3 -5
View File
@@ -514,7 +514,7 @@ function resolveNodes(pieces: readonly Piece[], scan: Scan, highlights: boolean)
return nodes.ok ? success(mergeReadText(nodes.value.flat())) : nodes return nodes.ok ? success(mergeReadText(nodes.value.flat())) : nodes
} }
// The result's `[index]` holds piece `index`'s nodes. // Entry `index` of the result holds piece `index`'s nodes.
function markedNodes(pieces: readonly Piece[], scan: Scan, highlights: boolean): Result<Inline[][]> { function markedNodes(pieces: readonly Piece[], scan: Scan, highlights: boolean): Result<Inline[][]> {
const runs = delimiterRuns(pieces) const runs = delimiterRuns(pieces)
const pairings = matchEmphasis(runs) const pairings = matchEmphasis(runs)
@@ -547,7 +547,7 @@ function mergeReadText(items: readonly Inline[]): Inline[] {
} }
// The image arm is an image inside an image's description or a link's text, which reads as its plain alt text. // The image arm is an image inside an image's description or a link's text, which reads as its plain alt text.
// A highlight delimiter is the text `==` until it pairs, so the emphasis around it marks it. // An unpaired highlight delimiter stays the text `==`, under the emphasis around it.
function pieceNodes(piece: Piece): Inline[] { function pieceNodes(piece: Piece): Inline[] {
switch (piece.kind) { switch (piece.kind) {
case 'ownMarks': case 'ownMarks':
@@ -592,7 +592,6 @@ function writeUnpaired(nodes: Inline[][], runs: readonly Run[], pairings: readon
} }
// Pairings nest, so one walk holding the open ones on a stack gives each piece its marks, outermost first (spec/flavour.md, Marks). // Pairings nest, so one walk holding the open ones on a stack gives each piece its marks, outermost first (spec/flavour.md, Marks).
// It is `undefined` where an own-marks node stands inside a mark.
function pairingMarks(pieces: readonly Piece[], pairings: readonly Pairing[]): AdfMark[][] | undefined { function pairingMarks(pieces: readonly Piece[], pairings: readonly Pairing[]): AdfMark[][] | undefined {
const opening = pairingsByOpener(pairings) const opening = pairingsByOpener(pairings)
const open: { closer: number; marks: AdfMark[] }[] = [] const open: { closer: number; marks: AdfMark[] }[] = []
@@ -661,7 +660,7 @@ function pairedHighlights(pieces: readonly Piece[], nodes: readonly Inline[][],
return paired return paired
} }
// A pair's delimiters leave, and the nodes between them take the highlight. // A node holds one highlight, and a rebuilt node would lose its attributes.
function markHighlights(nodes: Inline[][], paired: readonly HighlightPair[]): void { function markHighlights(nodes: Inline[][], paired: readonly HighlightPair[]): void {
for (const { closer, opener } of paired) { for (const { closer, opener } of paired) {
nodes[opener] = [] nodes[opener] = []
@@ -670,7 +669,6 @@ function markHighlights(nodes: Inline[][], paired: readonly HighlightPair[]): vo
} }
} }
// A node holds one highlight, and a rebuilt node would lose its attributes.
function highlighted(node: Inline): Inline { function highlighted(node: Inline): Inline {
if (!isNode(node)) return node if (!isNode(node)) return node
const marks = nodeMarks(node) const marks = nodeMarks(node)