import {Tree, NodeProp} from "@lezer/common"
import {parser as html} from "@lezer/html"
import ist from "ist"
import {parser, parseCode} from "../dist/index.js"
let full = parser.configure(parseCode({
codeParser(str) { return !str || str == "html" ? html : null },
htmlParser: html.configure({dialect: "noMatch"})
}))
function findMounts(tree: Tree) {
let result = []
for (let cur = tree.cursor(); cur.next();) {
let mount = cur.tree?.prop(NodeProp.mounted)
if (mount) result.push({at: cur.from, mount})
}
return result
}
function test(doc: string, ...nest: [string, ...number[]][]) {
return () => {
let tree = full.parse(doc), mounts = findMounts(tree)
ist(mounts.length, nest.length)
nest.forEach(([repr, ...ranges], i) => {
let {mount, at} = mounts[i]
ist(mount.tree.toString(), "Document(" + repr + ")")
ist(mount.overlay!.map(r => (r.from + at) + "," + (r.to + at)).join(), ranges.join())
})
}
}
describe("Code parsing", () => {
it("parses HTML blocks", test(`
Paragraph
Hello & goodbye
`, ["Element(OpenTag(StartTag,TagName,Attribute(AttributeName,Is,UnquotedAttributeValue),EndTag),Text,EntityReference,Text,CloseTag(StartCloseTag,TagName,EndTag))", 12, 51]))
it("parses inline HTML", test(
`Paragraph with inline tags in it.`,
["Element(OpenTag(StartTag,TagName,EndTag))", 15, 19],
["CloseTag(StartCloseTag,TagName,EndTag)", 30, 35]))
it("parses indented code", test(`
Paragraph.
Hi
`, ["DoctypeDecl,Text", 17, 33, 37, 39]))
it("parses fenced code", test(`
Okay
~~~
Hey
~~~`, ["Element(OpenTag(StartTag,TagName,EndTag),Text,CloseTag(StartCloseTag,TagName,EndTag))", 11, 25]))
it("allows gaps in fenced code", test(`
- >~~~
>
>yay
> ~~~`, ["DoctypeDecl,Text", 11, 27, 30, 33]))
it("passes fenced code info", test(`
~~~html
»
~~~
~~~python
False
~~~`, ["EntityReference", 9, 16]))
it("can parse disjoint ranges", () => {
let tree = parser.parse(`==foo\n==\n==ba==r\n==`, undefined,
[{from: 2, to: 6}, {from: 8, to: 9}, {from: 11, to: 13}, {from: 15, to: 17}])
ist(tree.toString(), "Document(Paragraph,Paragraph)")
ist(tree.length, 15)
ist(tree.topNode.firstChild!.from, 0)
ist(tree.topNode.firstChild!.to, 3)
ist(tree.topNode.lastChild!.from, 9)
ist(tree.topNode.lastChild!.to, 14)
})
})