mirror of
https://github.com/larvit/adf-codec.git
synced 2026-11-19 14:45:44 +01:00
Answer architecture round 5: the builders keep main's spelling, each writer's result and the CommonMark ask's spelling are held to the bound once built, and the engines' own overflows refuse alike
This commit is contained in:
@@ -1,9 +1,9 @@
|
||||
import { failure, type Result } from '../result.ts'
|
||||
import { failure, success, type Result } from '../result.ts'
|
||||
|
||||
// V8's longest string, held on every engine so a document converts alike everywhere (docs/decisions.md §Markdown past V8's longest string is refused on every engine).
|
||||
export const longestMarkdown = 2 ** 29 - 24
|
||||
|
||||
// Measured on Firefox 155, Node 24 and Bun 1.4. The first two say a string passed longestMarkdown, so they refuse as tooLong; the others name the engine's own limit.
|
||||
// Measured on Firefox 155, Node 24 and Bun 1.4. SpiderMonkey's overflow and V8's string overflow both mean a string past longestMarkdown; the other two name the engine's own limit.
|
||||
const pastLongestString = ['InternalError: allocation size overflow', 'RangeError: Invalid string length']
|
||||
const pastEngineLimit = ['RangeError: Invalid array length', 'RangeError: Out of memory']
|
||||
|
||||
@@ -11,33 +11,23 @@ export function tooLong<T>(): Result<T> {
|
||||
return failure('unsupported-node-shape', `spelled as markdown, this would be longer than ${longestMarkdown} characters, the longest string V8 holds`, [])
|
||||
}
|
||||
|
||||
// The pieces joined, or `undefined` once their length passes longestMarkdown, so nothing past it is built.
|
||||
export function joinedWithin(pieces: Iterable<string>): string | undefined {
|
||||
export function withinLongest(text: string): Result<string> {
|
||||
return text.length > longestMarkdown ? tooLong() : success(text)
|
||||
}
|
||||
|
||||
// Joins the pieces as they come, so a spelling that grows far past its input stops at the bound unbuilt.
|
||||
export function joinedWithin(pieces: Iterable<string>): Result<string> {
|
||||
const kept: string[] = []
|
||||
let length = 0
|
||||
for (const piece of pieces) {
|
||||
length += piece.length
|
||||
if (length > longestMarkdown) return undefined
|
||||
if (length > longestMarkdown) return tooLong()
|
||||
kept.push(piece)
|
||||
}
|
||||
return kept.join('')
|
||||
return success(kept.join(''))
|
||||
}
|
||||
|
||||
// The refusal where a bounded builder stopped, else what `next` makes of what it built.
|
||||
export function boundedThen<T, U>(built: T | undefined, next: (built: T) => Result<U>): Result<U> {
|
||||
return built === undefined ? tooLong() : next(built)
|
||||
}
|
||||
|
||||
export function* separatedBy(separator: string, parts: Iterable<Iterable<string>>): Generator<string> {
|
||||
let first = true
|
||||
for (const part of parts) {
|
||||
if (!first) yield separator
|
||||
first = false
|
||||
yield* part
|
||||
}
|
||||
}
|
||||
|
||||
// A builder this module does not bound can still pass an engine's longest string or array, so this wraps a whole conversion.
|
||||
// Any concatenation can pass an engine's longest string or array, so this wraps a whole conversion.
|
||||
export function withinEngineLimits<T>(convert: () => Result<T>): Result<T> {
|
||||
try {
|
||||
return convert()
|
||||
|
||||
Reference in New Issue
Block a user