mirror of
https://github.com/larvit/adf-codec.git
synced 2026-11-19 06:35:44 +01:00
43 lines
2.0 KiB
TypeScript
43 lines
2.0 KiB
TypeScript
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. 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']
|
|
|
|
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`, [])
|
|
}
|
|
|
|
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 tooLong()
|
|
kept.push(piece)
|
|
}
|
|
return success(kept.join(''))
|
|
}
|
|
|
|
// 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()
|
|
} catch (error) {
|
|
// A stack overflow is a bug (docs/decisions.md §Nothing recurses unbounded), so it stays a throw.
|
|
if (!(error instanceof Error)) throw error
|
|
const thrown = `${error.name}: ${error.message}`
|
|
if (pastLongestString.includes(thrown)) return tooLong()
|
|
if (!pastEngineLimit.includes(thrown)) throw error
|
|
return failure('unsupported-node-shape', `the output would be longer than the longest string or array this JavaScript engine builds (${error.message})`, [])
|
|
}
|
|
}
|