markdown2typst 0.1.7 → 0.1.9

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "markdown2typst",
-  "version": "0.1.7",
+  "version": "0.1.9",
   "description": "A comprehensive JavaScript library for converting Markdown to Typst code",
   "type": "module",
   "main": "./dist/markdown2typst.js",

package/src/parser.ts

@@ -28,6 +28,12 @@ import { ErrorSeverity } from './types.js';
  */
 export function parseMarkdown(markdown: string, onError?: ErrorCallback): Root {
 	try {
+		// remark-math requires a blank line before display math. Accept a
+		// standalone $$ block immediately after a paragraph as well.
+		const normalizedMarkdown = markdown.replace(
+			/([^\n])\n(\$\$)/g,
+			'$1\n\n$2'
+		);
 		const processor = unified()
 			.use(remarkParse)
 			.use(remarkFrontmatter, ['yaml'])
@@ -35,7 +41,7 @@ export function parseMarkdown(markdown: string, onError?: ErrorCallback): Root {
 			.use(remarkMath)
 			.use(remarkFixAdjacentMath);
 
-		const parsedTree = processor.parse(markdown);
+		const parsedTree = processor.parse(normalizedMarkdown);
 		const tree = processor.runSync(parsedTree) as Root;
 		
 		return tree;

package/src/remark-fix-math.ts

@@ -1,6 +1,8 @@
 import { visit } from 'unist-util-visit';
 import { unified } from 'unified';
 import remarkParse from 'remark-parse';
+import remarkMath from 'remark-math';
+import remarkGfm from 'remark-gfm';
 
 /**
  * Remark plugin to fix math blocks that swallowed adjacent text because 
@@ -35,13 +37,20 @@ export function remarkFixAdjacentMath() {
 				
 				// We need to append the remainder as new parsed markdown nodes after this node
 				if (remainder.trim().length > 0) {
-					// Parse the remainder
-					const processor = unified().use(remarkParse);
+					// Parse the remainder with full features
+					const processor = unified()
+						.use(remarkParse)
+						.use(remarkGfm, { singleTilde: false })
+						.use(remarkMath)
+						// Notice we also recursively apply this plugin in case the remainder has more adjacent math
+						.use(remarkFixAdjacentMath);
+					
 					const remainderAst = processor.parse(remainder.trim());
+					const remainderTree = processor.runSync(remainderAst);
 					
 					// Store the nodes to be inserted
 					node.data = node.data || {};
-					node.data.insertAfter = remainderAst.children;
+					node.data.insertAfter = (remainderTree as any).children;
 				}
 			} else {
 				node.value = value.trim();