3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-21 07:32:58 +01:00

Answer auto-reviewer round 1: 0 🔴, 1 🟡; pack the backtick run index into one typed array off the JS heap

This commit is contained in:
2026-10-18 11:06:09 +02:00
committed by Lillem4n
parent 5e3f4c688c
commit a9cdd70365
+30 -14
View File
@@ -7,23 +7,31 @@ export function backtickRun(text: string, index: number): number {
// Where the first run of exactly `opener` backticks at or after `from` begins, `from` never inside a run. Ask with // Where the first run of exactly `opener` backticks at or after `from` begins, `from` never inside a run. Ask with
// `from` rising, so each length's cursor only moves forward and a walk stays linear; an earlier `from` rescans that length. // `from` rising, so each length's cursor only moves forward and a walk stays linear; an earlier `from` rescans that length.
export function backtickCloser(text: string): (from: number, opener: number) => number | undefined { export function backtickCloser(text: string): (from: number, opener: number) => number | undefined {
const cursors = new Map<number, number>() const counts = new Map<number, number>()
const starts = new Map<number, number[]>() eachRun(text, (_, length) => counts.set(length, (counts.get(length) ?? 0) + 1))
for (let start = text.indexOf('`'); start !== -1; ) { const firsts = new Map<number, number>()
const length = runLength(text, start) let total = 0
const known = starts.get(length) for (const [length, count] of counts) {
if (known === undefined) starts.set(length, [start]) firsts.set(length, total)
else known.push(start) total += count
start = text.indexOf('`', start + length)
} }
// Each length's starts in order, packed off the JS heap: a text near V8's longest string holds a run every two characters.
const starts = new Int32Array(total)
const ends = new Map(firsts)
eachRun(text, (start, length) => {
const at = ends.get(length) ?? 0
starts[at] = start
ends.set(length, at + 1)
})
const cursors = new Map<number, number>()
return (from, opener) => { return (from, opener) => {
const runs = starts.get(opener) const first = firsts.get(opener) ?? 0
if (runs === undefined) return undefined const end = ends.get(opener) ?? 0
let at = cursors.get(opener) ?? 0 let at = cursors.get(opener) ?? first
if ((runs[at - 1] ?? -1) >= from) at = 0 if (at > first && (starts[at - 1] ?? -1) >= from) at = first
while ((runs[at] ?? Infinity) < from) at += 1 while (at < end && (starts[at] ?? Infinity) < from) at += 1
cursors.set(opener, at) cursors.set(opener, at)
return runs[at] return at < end ? starts[at] : undefined
} }
} }
@@ -53,3 +61,11 @@ export function longestBacktickRun(text: string): number {
} }
return longest return longest
} }
function eachRun(text: string, visit: (start: number, length: number) => void): void {
for (let start = text.indexOf('`'); start !== -1; ) {
const length = runLength(text, start)
visit(start, length)
start = text.indexOf('`', start + length)
}
}