3
0
mirror of https://github.com/larvit/adf-codec.git synced 2026-11-19 14:45:44 +01:00

Answer product-owner round 1: 0 🔴, 1 🟡; say a deeply nested list is still refused, only sooner

This commit is contained in:
2026-10-18 11:31:11 +02:00
committed by Lillem4n
parent ddccd00243
commit 0e1233b6d4
+5 -5
View File
@@ -20,11 +20,11 @@
`<![CDATA[` or `<!` openers without a terminator, or many unclosed backtick runs outside a `<![CDATA[` or `<!` openers without a terminator, or many unclosed backtick runs outside a
directive's `[content]`. Such a text took time quadratic in its length: 160000 characters of `<?` directive's `[content]`. Such a text took time quadratic in its length: 160000 characters of `<?`
took seven seconds each way, now 50 ms. took seven seconds each way, now 50 ms.
- Every reader takes time linear in the markdown when it holds many unclosed backtick runs inside an - Every reader takes time linear in the markdown when it holds blank lines under list items nested
inline directive's `[content]`, or blank lines or indented lines under list items nested deeply. deeply, and `losslessMarkdownToAdf` when it holds many unclosed backtick runs inside an inline
640000 characters of backtick runs in a directive took one second, now 100 ms; 20000 nested items directive's `[content]`. Such a list is still refused as `unsupported-nesting-depth`, now after
and as many blank lines took 10.7 seconds before they were refused as `unsupported-nesting-depth`, 40 ms where 20000 nested items and as many blank lines took 10.7 seconds; 640000 characters of
now 40 ms. backtick runs in a directive took one second, now 100 ms.
- The README compares the package with seven other ADF converters, each checked against its - The README compares the package with seven other ADF converters, each checked against its
published version. published version.