securemark 0.298.5 → 0.298.6

package/CHANGELOG.md

@@ -1,5 +1,9 @@
 # Changelog
 
+## 0.298.6
+
+- Refactoring.
+
 ## 0.298.5
 
 - Refactoring.

package/dist/index.js

@@ -1,4 +1,4 @@
-/*! securemark v0.298.5 https://github.com/falsandtru/securemark | (c) 2017, falsandtru | UNLICENSED License */
+/*! securemark v0.298.6 https://github.com/falsandtru/securemark | (c) 2017, falsandtru | UNLICENSED License */
 (function webpackUniversalModuleDefinition(root, factory) {
 	if(typeof exports === 'object' && typeof module === 'object')
 		module.exports = factory(require("Prism"), require("DOMPurify"));
@@ -3376,16 +3376,24 @@ class Delimiters {
 exports.Delimiters = Delimiters;
 function matcher(pattern, advance, after) {
   const count = typeof pattern === 'object' ? /[^^\\*+][*+]|{\d+,}/.test(pattern.source) : false;
+  let sid = 0,
+    pos = 0,
+    index = -1;
   switch (typeof pattern) {
     case 'string':
       if (pattern === '') return () => new parser_1.List([new parser_1.Node(pattern)]);
       return input => {
         const context = input;
         const {
+          SID,
           source,
           position
         } = context;
-        if (!source.startsWith(pattern, position)) return;
+        const hit = SID === sid && position === pos;
+        index = hit ? index : source.startsWith(pattern, position) ? position : -1;
+        sid = SID;
+        pos = position;
+        if (index === -1) return;
         if (advance) {
           context.position += pattern.length;
         }
@@ -3396,15 +3404,20 @@ function matcher(pattern, advance, after) {
       return input => {
         const context = input;
         const {
+          SID,
           source,
           position
         } = context;
+        const hit = SID === sid && position === pos;
         pattern.lastIndex = position;
-        if (!pattern.test(source)) return;
-        const src = source.slice(position, pattern.lastIndex);
-        count && (0, context_1.consume)(src.length, context);
+        index = hit ? index : pattern.test(source) ? pattern.lastIndex : -1;
+        sid = SID;
+        pos = position;
+        if (index === -1) return;
+        const src = source.slice(position, index);
+        count && !hit && (0, context_1.consume)(src.length, context);
         if (advance) {
-          context.position += src.length;
+          context.position = index;
         }
         const next = after?.(input);
         return after ? next && new parser_1.List([new parser_1.Node(src)]).import(next) : new parser_1.List([new parser_1.Node(src)]);
@@ -3414,16 +3427,24 @@ function matcher(pattern, advance, after) {
 exports.matcher = matcher;
 function tester(pattern, advance, after) {
   const count = typeof pattern === 'object' ? /[^^\\*+][*+]|{\d+,}/.test(pattern.source) : false;
+  let sid = 0,
+    pos = 0,
+    index = -1;
   switch (typeof pattern) {
     case 'string':
       if (pattern === '') return () => new parser_1.List();
       return input => {
         const context = input;
         const {
+          SID,
           source,
           position
         } = context;
-        if (!source.startsWith(pattern, position)) return;
+        const hit = SID === sid && position === pos;
+        index = hit ? index : source.startsWith(pattern, position) ? position : -1;
+        sid = SID;
+        pos = position;
+        if (index === -1) return;
         if (advance) {
           context.position += pattern.length;
         }
@@ -3434,15 +3455,20 @@ function tester(pattern, advance, after) {
       return input => {
         const context = input;
         const {
+          SID,
           source,
           position
         } = context;
+        const hit = SID === sid && position === pos;
         pattern.lastIndex = position;
-        if (!pattern.test(source)) return;
-        const len = pattern.lastIndex - position;
-        count && (0, context_1.consume)(len, context);
+        index = hit ? index : pattern.test(source) ? pattern.lastIndex : -1;
+        sid = SID;
+        pos = position;
+        if (index === -1) return;
+        const len = index - position;
+        count && !hit && (0, context_1.consume)(len, context);
         if (advance) {
-          context.position += len;
+          context.position = index;
         }
         if (after && after(input) === undefined) return;
         return new parser_1.List();
@@ -3625,6 +3651,10 @@ class Node {
   }
 }
 exports.Node = Node;
+let SID = 0;
+function sid() {
+  return SID = ++SID >>> 0 || 1;
+}
 class Context {
   constructor({
     source,
@@ -3639,6 +3669,7 @@ class Context {
     offset,
     backtracks
   } = {}) {
+    this.SID = sid();
     this.source = source ?? '';
     this.position = position ?? 0;
     this.segment = segment ?? 0;
@@ -3654,6 +3685,7 @@ class Context {
 }
 exports.Context = Context;
 function input(source, context) {
+  context.SID = sid();
   context.source = source;
   context.position = 0;
   return context;
@@ -3662,6 +3694,7 @@ exports.input = input;
 function subinput(source, context) {
   return {
     ...context,
+    SID: sid(),
     source,
     position: 0,
     offset: 0,
@@ -3808,13 +3841,15 @@ function recursions(rs, parser) {
     } = resources;
     for (const recursion of rs) {
       const rec = (0, alias_1.min)(recursion, recursions.length - 1);
-      if (rec >= 0 && recursions[rec] < 1) throw new Error('Too much recursion');
-      rec >= 0 && --recursions[rec];
+      if (rec === -1) continue;
+      if (recursions[rec] < 1) throw new Error('Too much recursion');
+      --recursions[rec];
     }
     const result = parser(input);
     for (const recursion of rs) {
       const rec = (0, alias_1.min)(recursion, recursions.length - 1);
-      rec >= 0 && ++recursions[rec];
+      if (rec === -1) continue;
+      ++recursions[rec];
     }
     return result;
   };
@@ -3975,8 +4010,10 @@ function some(parser, delimiter, after, delimiters, limit = -1) {
     for (const len = source.length; context.position < len;) {
       if (match(input)) break;
       if (context.delimiters.test(input)) break;
+      const pos = context.position;
       const result = parser(input);
       if (result === undefined) break;
+      if (context.position === pos) break;
       nodes = nodes?.import(result) ?? result;
       if (limit >= 0 && context.position - position > limit) break;
     }
@@ -4043,7 +4080,7 @@ function union(parsers) {
     case 1:
       return parsers[0];
     default:
-      return eval(['((', parsers.map((_, i) => `parser${i},`).join(''), ') =>', 'input =>', parsers.map((_, i) => `|| parser${i}(input)`).join('').slice(2), ')'].join(''))(...parsers);
+      return eval(['(', parsers.map((_, i) => `parser${i},`).join(''), ') =>', 'input =>', parsers.map((_, i) => `|| parser${i}(input)`).join('').slice(2)].join(''))(...parsers);
   }
 }
 exports.union = union;
@@ -6790,11 +6827,11 @@ const inline_1 = __webpack_require__(7973);
 const visibility_1 = __webpack_require__(6364);
 const util_1 = __webpack_require__(4992);
 const dom_1 = __webpack_require__(394);
-exports.deletion = (0, combinator_1.lazy)(() => (0, combinator_1.precedence)(0, (0, util_1.repeat)('~~', '', (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(inline_1.inline, (0, visibility_1.blankWith)('\n', '~~')), (0, combinator_1.open)('\n', (0, combinator_1.some)(inline_1.inline, '~'), true)])), '~~', false, [], ([, bs], {
+exports.deletion = (0, combinator_1.lazy)(() => (0, util_1.repeat)('~~', '', (0, combinator_1.precedence)(0, (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(inline_1.inline, (0, visibility_1.blankWith)('\n', '~~')), (0, combinator_1.open)('\n', (0, combinator_1.some)(inline_1.inline, '~'), true)])), '~~', false, [], ([, bs], {
   buffer
 }) => buffer.import(bs), ([, bs], {
   buffer
-}) => bs && buffer.import(bs).push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer)), nodes => new parser_1.List([new parser_1.Node((0, dom_1.html)('del', (0, dom_1.defrag)((0, util_1.unwrap)(nodes))))]))));
+}) => bs && buffer.import(bs).push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer))), nodes => new parser_1.List([new parser_1.Node((0, dom_1.html)('del', (0, dom_1.defrag)((0, util_1.unwrap)(nodes))))])));
 
 /***/ },
 
@@ -6844,7 +6881,7 @@ const subemphasis = (0, combinator_1.lazy)(() => (0, combinator_1.some)((0, comb
 // 開閉が明示的でない構文は開閉の不明確な記号による再帰的適用を行わず
 // 可能な限り早く閉じるよう解析しなければならない。
 // このため終端記号の後ろを見て終端を中止し同じ構文を再帰的に適用してはならない。
-exports.emstrong = (0, combinator_1.lazy)(() => (0, combinator_1.precedence)(0, (0, util_1.repeat)('***', visibility_1.beforeNonblank, (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(inline_1.inline, '*', visibility_1.afterNonblank)])), (0, source_1.strs)('*', 1, 3), false, [], ([, bs, cs], context) => {
+exports.emstrong = (0, combinator_1.lazy)(() => (0, util_1.repeat)('***', visibility_1.beforeNonblank, (0, combinator_1.precedence)(0, (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(inline_1.inline, '*', visibility_1.afterNonblank)])), (0, source_1.strs)('*', 1, 3), false, [], ([, bs, cs], context) => {
   const {
     buffer
   } = context;
@@ -6888,7 +6925,7 @@ exports.emstrong = (0, combinator_1.lazy)(() => (0, combinator_1.precedence)(0,
   }
 }, ([, bs], {
   buffer
-}) => bs && buffer.import(bs) && buffer.push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer)),
+}) => bs && buffer.import(bs) && buffer.push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer))),
 // 3以上の`*`に対してemの適用を保証する
 nodes => new parser_1.List([new parser_1.Node((0, dom_1.html)('em', [(0, dom_1.html)('strong', (0, dom_1.defrag)((0, util_1.unwrap)(nodes)))]))]), (nodes, context, prefix, postfix, state) => {
   context.position += postfix;
@@ -6943,7 +6980,7 @@ nodes => new parser_1.List([new parser_1.Node((0, dom_1.html)('em', [(0, dom_1.h
     nodes = prepend('*'.repeat(prefix - postfix), nodes);
   }
   return nodes;
-})));
+}));
 function prepend(prefix, nodes) {
   if (typeof nodes.head?.value === 'string') {
     nodes.head.value = prefix + nodes.head.value;
@@ -7416,11 +7453,11 @@ const inline_1 = __webpack_require__(7973);
 const visibility_1 = __webpack_require__(6364);
 const util_1 = __webpack_require__(4992);
 const dom_1 = __webpack_require__(394);
-exports.insertion = (0, combinator_1.lazy)(() => (0, combinator_1.precedence)(0, (0, util_1.repeat)('++', '', (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(inline_1.inline, (0, visibility_1.blankWith)('\n', '++')), (0, combinator_1.open)('\n', (0, combinator_1.some)(inline_1.inline, '+'), true)])), '++', false, [], ([, bs], {
+exports.insertion = (0, combinator_1.lazy)(() => (0, util_1.repeat)('++', '', (0, combinator_1.precedence)(0, (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(inline_1.inline, (0, visibility_1.blankWith)('\n', '++')), (0, combinator_1.open)('\n', (0, combinator_1.some)(inline_1.inline, '+'), true)])), '++', false, [], ([, bs], {
   buffer
 }) => buffer.import(bs), ([, bs], {
   buffer
-}) => bs && buffer.import(bs).push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer)), nodes => new parser_1.List([new parser_1.Node((0, dom_1.html)('ins', (0, dom_1.defrag)((0, util_1.unwrap)(nodes))))]))));
+}) => bs && buffer.import(bs).push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer))), nodes => new parser_1.List([new parser_1.Node((0, dom_1.html)('ins', (0, dom_1.defrag)((0, util_1.unwrap)(nodes))))])));
 
 /***/ },
 
@@ -7443,11 +7480,11 @@ const dom_1 = __webpack_require__(394);
 // 可読性のため実際にはオブリーク体を指定する。
 // 斜体は単語に使うとかえって見づらく読み飛ばしやすくなるため使わないべきであり
 // ある程度の長さのある文に使うのが望ましい。
-exports.italic = (0, combinator_1.lazy)(() => (0, combinator_1.precedence)(0, (0, util_1.repeat)('///', visibility_1.beforeNonblank, (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([inline_1.inline]), '///', visibility_1.afterNonblank), '///', false, [], ([, bs], {
+exports.italic = (0, combinator_1.lazy)(() => (0, util_1.repeat)('///', visibility_1.beforeNonblank, (0, combinator_1.precedence)(0, (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([inline_1.inline]), '///', visibility_1.afterNonblank), '///', false, [], ([, bs], {
   buffer
 }) => buffer.import(bs), ([, bs], {
   buffer
-}) => bs && buffer.import(bs).push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer)), nodes => new parser_1.List([new parser_1.Node((0, dom_1.html)('i', (0, dom_1.defrag)((0, util_1.unwrap)(nodes))))]))));
+}) => bs && buffer.import(bs).push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer))), nodes => new parser_1.List([new parser_1.Node((0, dom_1.html)('i', (0, dom_1.defrag)((0, util_1.unwrap)(nodes))))])));
 
 /***/ },
 
@@ -7624,11 +7661,11 @@ const indexee_1 = __webpack_require__(7610);
 const visibility_1 = __webpack_require__(6364);
 const util_1 = __webpack_require__(4992);
 const dom_1 = __webpack_require__(394);
-exports.mark = (0, combinator_1.lazy)(() => (0, combinator_1.precedence)(0, (0, util_1.repeat)('==', visibility_1.beforeNonblank, (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.state)(2 /* State.mark */, (0, combinator_1.some)((0, combinator_1.union)([inline_1.inline]), '==', visibility_1.afterNonblank)), '==', false, [], ([, bs], {
+exports.mark = (0, combinator_1.lazy)(() => (0, util_1.repeat)('==', visibility_1.beforeNonblank, (0, combinator_1.precedence)(0, (0, combinator_1.recursion)(3 /* Recursion.inline */, (0, combinator_1.surround)('', (0, combinator_1.state)(2 /* State.mark */, (0, combinator_1.some)((0, combinator_1.union)([inline_1.inline]), '==', visibility_1.afterNonblank)), '==', false, [], ([, bs], {
   buffer
 }) => buffer.import(bs), ([, bs], {
   buffer
-}) => bs && buffer.import(bs).push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer)), (nodes, {
+}) => bs && buffer.import(bs).push(new parser_1.Node("\u0018" /* Command.Cancel */)) && buffer))), (nodes, {
   id,
   state
 }, nest) => {
@@ -7640,7 +7677,7 @@ exports.mark = (0, combinator_1.lazy)(() => (0, combinator_1.precedence)(0, (0,
   return el.id ? new parser_1.List([new parser_1.Node(el), new parser_1.Node((0, dom_1.html)('a', {
     href: `#${el.id}`
   }))]) : new parser_1.List([new parser_1.Node(el)]);
-})));
+}));
 
 /***/ },
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "securemark",
-  "version": "0.298.5",
+  "version": "0.298.6",
   "description": "Secure markdown renderer working on browsers for user input data.",
   "private": false,
   "homepage": "https://github.com/falsandtru/securemark",

package/src/combinator/data/delimiter.ts

@@ -161,13 +161,20 @@ export function matcher(pattern: string | RegExp, advance: boolean, after?: Pars
   const count = typeof pattern === 'object'
     ? /[^^\\*+][*+]|{\d+,}/.test(pattern.source)
     : false;
+  let sid = 0, pos = 0, index = -1;
   switch (typeof pattern) {
     case 'string':
       if (pattern === '') return () => new List([new Node(pattern)]);
       return input => {
         const context = input;
-        const { source, position } = context;
-        if (!source.startsWith(pattern, position)) return;
+        const { SID, source, position } = context;
+        const hit = SID === sid && position === pos;
+        index = hit
+          ? index
+          : source.startsWith(pattern, position) ? position : -1;
+        sid = SID;
+        pos = position;
+        if (index === -1) return;
         if (advance) {
           context.position += pattern.length;
         }
@@ -180,13 +187,19 @@ export function matcher(pattern: string | RegExp, advance: boolean, after?: Pars
       assert(pattern.sticky);
       return input => {
         const context = input;
-        const { source, position } = context;
+        const { SID, source, position } = context;
+        const hit = SID === sid && position === pos;
         pattern.lastIndex = position;
-        if (!pattern.test(source)) return;
-        const src = source.slice(position, pattern.lastIndex);
-        count && consume(src.length, context);
+        index = hit
+          ? index
+          : pattern.test(source) ? pattern.lastIndex : -1;
+        sid = SID;
+        pos = position;
+        if (index === -1) return;
+        const src = source.slice(position, index);
+        count && !hit && consume(src.length, context);
         if (advance) {
-          context.position += src.length;
+          context.position = index;
         }
         const next = after?.(input);
         return after
@@ -201,13 +214,20 @@ export function tester(pattern: string | RegExp, advance: boolean, after?: Parse
   const count = typeof pattern === 'object'
     ? /[^^\\*+][*+]|{\d+,}/.test(pattern.source)
     : false;
+  let sid = 0, pos = 0, index = -1;
   switch (typeof pattern) {
     case 'string':
       if (pattern === '') return () => new List();
       return input => {
         const context = input;
-        const { source, position } = context;
-        if (!source.startsWith(pattern, position)) return;
+        const { SID, source, position } = context;
+        const hit = SID === sid && position === pos;
+        index = hit
+          ? index
+          : source.startsWith(pattern, position) ? position : -1;
+        sid = SID;
+        pos = position;
+        if (index === -1) return;
         if (advance) {
           context.position += pattern.length;
         }
@@ -218,13 +238,19 @@ export function tester(pattern: string | RegExp, advance: boolean, after?: Parse
       assert(pattern.sticky);
       return input => {
         const context = input;
-        const { source, position } = context;
+        const { SID, source, position } = context;
+        const hit = SID === sid && position === pos;
         pattern.lastIndex = position;
-        if (!pattern.test(source)) return;
-        const len = pattern.lastIndex - position;
-        count && consume(len, context);
+        index = hit
+          ? index
+          : pattern.test(source) ? pattern.lastIndex : -1;
+        sid = SID;
+        pos = position;
+        if (index === -1) return;
+        const len = index - position;
+        count && !hit && consume(len, context);
         if (advance) {
-          context.position += len;
+          context.position = index;
         }
         if (after && after(input) === undefined) return;
         return new List();

package/src/combinator/data/parser/context.ts

@@ -122,13 +122,15 @@ export function recursions(rs: readonly number[], parser: Parser): Parser {
     assert(recursions.length > 0);
     for (const recursion of rs) {
       const rec = min(recursion, recursions.length - 1);
-      if (rec >= 0 && recursions[rec] < 1) throw new Error('Too much recursion');
-      rec >= 0 && --recursions[rec];
+      if (rec === -1) continue;
+      if (recursions[rec] < 1) throw new Error('Too much recursion');
+      --recursions[rec];
     }
     const result = parser(input);
     for (const recursion of rs) {
       const rec = min(recursion, recursions.length - 1);
-      rec >= 0 && ++recursions[rec];
+      if (rec === -1) continue;
+      ++recursions[rec];
     }
     return result;
   };

package/src/combinator/data/parser/some.ts

@@ -38,8 +38,10 @@ export function some<N>(parser: Parser<N>, delimiter?: number | string | RegExp
     for (const len = source.length; context.position < len;) {
       if (match(input)) break;
       if (context.delimiters.test(input)) break;
+      const pos = context.position;
       const result = parser(input);
       if (result === undefined) break;
+      if (context.position === pos) break;
       nodes = nodes?.import(result) ?? result;
       if (limit >= 0 && context.position - position > limit) break;
     }

package/src/combinator/data/parser/union.ts

@@ -10,12 +10,9 @@ export function union<N, D extends Parser<N>[]>(parsers: D): Parser<N, Context,
       return parsers[0];
     default:
       return eval([
-        '((',
-        parsers.map((_, i) => `parser${i},`).join(''),
-        ') =>',
+        '(', parsers.map((_, i) => `parser${i},`).join(''), ') =>',
         'input =>',
         parsers.map((_, i) => `|| parser${i}(input)`).join('').slice(2),
-        ')',
       ].join(''))(...parsers);
   }
 }

package/src/combinator/data/parser.ts

@@ -26,6 +26,10 @@ export class Node<N> implements List.Node {
   public next?: this = undefined;
   public prev?: this = undefined;
 }
+let SID = 0;
+function sid(): number {
+  return SID = ++SID >>> 0 || 1;
+}
 export class Context {
   constructor(
     {
@@ -54,6 +58,7 @@ export class Context {
     this.offset = offset ?? 0;
     this.backtracks = backtracks ?? {};
   }
+  public SID: number = sid();
   public source: string;
   public position: number;
   public segment: number;
@@ -110,6 +115,7 @@ export const enum Segment {
 }
 
 export function input<C extends Context>(source: string, context: C): Input<C> {
+  context.SID = sid();
   context.source = source;
   context.position = 0;
   return context;
@@ -118,6 +124,7 @@ export function input<C extends Context>(source: string, context: C): Input<C> {
 export function subinput<C extends Context>(source: string, context: C): Input<C> {
   return {
     ...context,
+    SID: sid(),
     source,
     position: 0,
     offset: 0,

package/src/parser/inline/autolink/url.test.ts

@@ -83,6 +83,7 @@ describe('Unit: parser/inline/autolink/url', () => {
       assert.deepStrictEqual(inspect(parser, input(' http://host>', new Context())), [['<a class="url" href="http://host" target="_blank">http://host</a>'], '>']);
       assert.deepStrictEqual(inspect(parser, input(' http://host（', new Context())), [['<a class="url" href="http://host" target="_blank">http://host</a>'], '（']);
       assert.deepStrictEqual(inspect(parser, input(' http://host）', new Context())), [['<a class="url" href="http://host" target="_blank">http://host</a>'], '）']);
+      assert.deepStrictEqual(inspect(parser, input(` http://host${'+'.repeat(5e5)}`, new Context())), [['<a class="url" href="http://host" target="_blank">http://host</a>'], '+'.repeat(5e5)]);
     });
 
     it('trailing entities', () => {

package/src/parser/inline/deletion.ts

@@ -8,7 +8,7 @@ import { unwrap, repeat } from '../util';
 import { html, defrag } from 'typed-dom/dom';
 
 export const deletion: DeletionParser = lazy(() =>
-  precedence(0, repeat('~~', '', recursion(Recursion.inline, surround(
+  repeat('~~', '', precedence(0, recursion(Recursion.inline, surround(
     '',
     some(union([
       some(inline, blankWith('\n', '~~')),
@@ -17,5 +17,5 @@ export const deletion: DeletionParser = lazy(() =>
     '~~',
     false, [],
     ([, bs], { buffer }) => buffer.import(bs),
-    ([, bs], { buffer }) => bs && buffer.import(bs).push(new Node(Command.Cancel)) && buffer)),
-    nodes => new List([new Node(html('del', defrag(unwrap(nodes))))]))));
+    ([, bs], { buffer }) => bs && buffer.import(bs).push(new Node(Command.Cancel)) && buffer))),
+    nodes => new List([new Node(html('del', defrag(unwrap(nodes))))])));

package/src/parser/inline/emstrong.ts

@@ -23,7 +23,7 @@ const subemphasis: Parser.IntermediateParser<EmphasisParser> = lazy(() => some(u
 // 可能な限り早く閉じるよう解析しなければならない。
 // このため終端記号の後ろを見て終端を中止し同じ構文を再帰的に適用してはならない。
 export const emstrong: EmStrongParser = lazy(() =>
-  precedence(0, repeat('***', beforeNonblank, recursion(Recursion.inline, surround(
+  repeat('***', beforeNonblank, precedence(0, recursion(Recursion.inline, surround(
     '',
     some(union([some(inline, '*', afterNonblank)])),
     strs('*', 1, 3),
@@ -75,7 +75,7 @@ export const emstrong: EmStrongParser = lazy(() =>
       }
       assert(false);
     },
-    ([, bs], { buffer }) => bs && buffer.import(bs) && buffer.push(new Node(Command.Cancel)) && buffer)),
+    ([, bs], { buffer }) => bs && buffer.import(bs) && buffer.push(new Node(Command.Cancel)) && buffer))),
     // 3以上の`*`に対してemの適用を保証する
     nodes => new List([new Node(html('em', [html('strong', defrag(unwrap(nodes)))]))]),
     (nodes, context, prefix, postfix, state) => {
@@ -137,7 +137,7 @@ export const emstrong: EmStrongParser = lazy(() =>
         nodes = prepend('*'.repeat(prefix - postfix), nodes);
       }
       return nodes;
-    })));
+    }));
 
 function prepend<N>(prefix: string, nodes: List<Node<N>>): List<Node<N>> {
   if (typeof nodes.head?.value === 'string') {

package/src/parser/inline/insertion.ts

@@ -8,7 +8,7 @@ import { unwrap, repeat } from '../util';
 import { html, defrag } from 'typed-dom/dom';
 
 export const insertion: InsertionParser = lazy(() =>
-  precedence(0, repeat('++', '', recursion(Recursion.inline, surround(
+  repeat('++', '', precedence(0, recursion(Recursion.inline, surround(
     '',
     some(union([
       some(inline, blankWith('\n', '++')),
@@ -17,5 +17,5 @@ export const insertion: InsertionParser = lazy(() =>
     '++',
     false, [],
     ([, bs], { buffer }) => buffer.import(bs),
-    ([, bs], { buffer }) => bs && buffer.import(bs).push(new Node(Command.Cancel)) && buffer)),
-    nodes => new List([new Node(html('ins', defrag(unwrap(nodes))))]))));
+    ([, bs], { buffer }) => bs && buffer.import(bs).push(new Node(Command.Cancel)) && buffer))),
+    nodes => new List([new Node(html('ins', defrag(unwrap(nodes))))])));

package/src/parser/inline/italic.ts

@@ -11,11 +11,11 @@ import { html, defrag } from 'typed-dom/dom';
 // 斜体は単語に使うとかえって見づらく読み飛ばしやすくなるため使わないべきであり
 // ある程度の長さのある文に使うのが望ましい。
 export const italic: ItalicParser = lazy(() =>
-  precedence(0, repeat('///', beforeNonblank, recursion(Recursion.inline, surround(
+  repeat('///', beforeNonblank, precedence(0, recursion(Recursion.inline, surround(
     '',
     some(union([inline]), '///', afterNonblank),
     '///',
     false, [],
     ([, bs], { buffer }) => buffer.import(bs),
-    ([, bs], { buffer }) => bs && buffer.import(bs).push(new Node(Command.Cancel)) && buffer)),
-    nodes => new List([new Node(html('i', defrag(unwrap(nodes))))]))));
+    ([, bs], { buffer }) => bs && buffer.import(bs).push(new Node(Command.Cancel)) && buffer))),
+    nodes => new List([new Node(html('i', defrag(unwrap(nodes))))])));

package/src/parser/inline/mark.ts

@@ -9,13 +9,13 @@ import { unwrap, repeat } from '../util';
 import { html, define, defrag } from 'typed-dom/dom';
 
 export const mark: MarkParser = lazy(() =>
-  precedence(0, repeat('==', beforeNonblank, recursion(Recursion.inline, surround(
+  repeat('==', beforeNonblank, precedence(0, recursion(Recursion.inline, surround(
     '',
     state(State.mark, some(union([inline]), '==', afterNonblank)),
     '==',
     false, [],
     ([, bs], { buffer }) => buffer.import(bs),
-    ([, bs], { buffer }) => bs && buffer.import(bs).push(new Node(Command.Cancel)) && buffer)),
+    ([, bs], { buffer }) => bs && buffer.import(bs).push(new Node(Command.Cancel)) && buffer))),
     (nodes, { id, state }, nest) => {
       const el = html('mark', defrag(unwrap(nodes)));
       if (state & State.linkers || nest) return new List([new Node(el)]);
@@ -23,4 +23,4 @@ export const mark: MarkParser = lazy(() =>
       return el.id
         ? new List([new Node(el), new Node(html('a', { href: `#${el.id}` }))])
         : new List([new Node(el)]);
-    })));
+    }));