securemark 0.300.6 → 0.300.8

package/CHANGELOG.md

@@ -1,5 +1,13 @@
 # Changelog
 
+## 0.300.8
+
+- Refactoring.
+
+## 0.300.7
+
+- Refactoring.
+
 ## 0.300.6
 
 - Refactoring.

package/dist/index.js

@@ -1,4 +1,4 @@
-/*! securemark v0.300.6 https://github.com/falsandtru/securemark | (c) 2017, falsandtru | UNLICENSED License */
+/*! securemark v0.300.8 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"));
@@ -2785,7 +2785,7 @@ function* parse(source, opts = {}, options) {
   if (options.id?.match(/[^0-9a-z/-]/i)) throw new Error('Invalid ID: ID must be alphanumeric');
   if (options.host?.origin === 'null') throw new Error(`Invalid host: ${options.host.href}`);
   const output = new parser_1.Output();
-  for (const _ of (0, parser_1.run)(document_1.document, new context_1.Input(options, source), output)) yield;
+  yield* (0, parser_1.run)(document_1.document, new context_1.Input(options, source), output);
   return output.peek().head.value;
 }
 exports.parse = parse;
@@ -6414,7 +6414,6 @@ exports.input = input;
 class Input extends parser_1.Input {
   constructor(options = {}, source) {
     super(options);
-    this.recursion = new RecursionCounter(2);
     const {
       segment,
       header,
@@ -6434,7 +6433,10 @@ class Input extends parser_1.Input {
       recursions: [
       // DOMの垂直的追加の繰り返しが加速的に異常に重くなる。
       // ブラウザの問題でありアルゴリズムの計算量は問題ない。
-      10 || 0 /* Recursion.document */, 100 || 0 /* Recursion.block */, 100 || 0 /* Recursion.inline */, 100 || 0 /* Recursion.bracket */]
+      // HTMLでなくDOMでレンダリングすること自体に限界があると思われる。
+      10 || 0 /* Recursion.document */,
+      // スタックでも意外と低速化するため制限しておく。
+      100 || 0 /* Recursion.block */, 100 || 0 /* Recursion.inline */, 100 || 0 /* Recursion.bracket */]
     };
     this.segment = segment ?? 0 /* Segment.unknown */;
     this.header = header ?? true;
@@ -6449,23 +6451,6 @@ class Input extends parser_1.Input {
   }
 }
 exports.Input = Input;
-class RecursionCounter {
-  constructor(limit) {
-    this.limit = limit;
-    this.stack = [];
-    this.index = 0;
-  }
-  add(depth) {
-    const {
-      stack
-    } = this;
-    for (; this.index > 0 && stack[this.index - 1] >= depth; --this.index);
-    stack[this.index] = depth;
-    ++this.index;
-    // 内側から数えるので無効化処理できない。
-    return this.index <= this.limit;
-  }
-}
 
 /***/ },
 
@@ -6729,9 +6714,7 @@ exports.annotation = (0, combinator_1.lazy)(() => (0, combinator_1.constraint)(1
   const {
     position,
     linebreak,
-    range,
-    recursion,
-    resources
+    range
   } = input;
   if (linebreak !== 0 || nodes.length === 0 || lead === 0 || follow % 2 === 0) {
     nodes.unshift(new parser_1.Node('('));
@@ -6741,21 +6724,21 @@ exports.annotation = (0, combinator_1.lazy)(() => (0, combinator_1.constraint)(1
     }, (0, dom_1.defrag)((0, util_1.unwrap)(nodes))))]);
   }
   input.position += 1;
-  if (!recursion.add(resources?.recursions[2 /* Recursion.inline */] ?? resources?.recursions.at(-1))) {
-    return new parser_1.List([new parser_1.Node((0, dom_1.html)('span', {
-      class: 'invalid',
-      ...(0, util_1.invalid)('annotation', 'syntax', 'Recursions must be two or fewer')
-    }, (0, dom_1.defrag)((0, util_1.unwrap)((0, visibility_1.trimBlankNodeEnd)(nodes)))))]);
-  }
   const el = (0, dom_1.html)('sup', {
     class: 'annotation'
   }, [(0, dom_1.html)('span', (0, dom_1.defrag)((0, util_1.unwrap)((0, visibility_1.trimBlankNodeEnd)(nodes))))]);
   for (let list = output.annotations.at(-1), node = list.last, pos = position - range, i = 0;; node = node.prev, ++i) {
-    if (node && node.position > pos) continue;
-    i === list.length ? list.unshift(new parser_1.Node(el, pos)) : list.insert(new parser_1.Node(el, pos), node?.next);
-    break;
+    if (node && node.position > pos) {
+      if (~node.flags & 2 /* Node.Flag.nested */) continue;
+      return new parser_1.List([new parser_1.Node((0, dom_1.define)(el.firstElementChild, {
+        class: 'invalid',
+        ...(0, util_1.invalid)('annotation', 'syntax', 'Recursions must be two or fewer')
+      }))]);
+    }
+    const flag = i === 0 ? 0 /* Node.Flag.none */ : 2 /* Node.Flag.nested */;
+    i === list.length ? list.unshift(new parser_1.Node(el, pos, flag)) : list.insert(new parser_1.Node(el, pos, flag), node?.next);
+    return new parser_1.List([new parser_1.Node(el)]);
   }
-  return new parser_1.List([new parser_1.Node(el)]);
 }, (nodes, input, output, prefix, postfix) => {
   for (let i = 0; i < prefix; ++i) {
     nodes.unshift(new parser_1.Node('('));
@@ -8690,6 +8673,7 @@ function repeat(opener, after, closer, recursion, parser, cons, termination = (n
         input.position += closer.length;
         const pos = input.position;
         m.follow = m.follow > 0 ? m.follow : countFollows(source, pos, closer, lead / opener.length | 0);
+        input.range = input.position - m.position - m.i + opener.length;
         output.push(cons(output.pop(), input, output, lead, m.follow));
         if (input.position > pos) {
           const advance = input.position - pos;

package/package.json

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

package/src/api/parse.ts

@@ -29,7 +29,7 @@ export function* parse(source: string, opts: Opts = {}, options?: Options): Gene
   assert(output.labels[0] = opts.labels ?? output.labels[0]);
   assert(output.annotations[0] = opts.annotations ?? output.annotations[0]);
   assert(output.references[0] = opts.references ?? output.references[0]);
-  for (const _ of run(document, new Input(options, source), output)) yield;
+  yield* run(document, new Input(options, source), output);
   assert(output.data.length === 1);
   assert(output.peek().length === 1);
   return output.peek().head!.value;

package/src/combinator/parser/list.ts

@@ -159,6 +159,7 @@ export class Node<T> implements List.Node {
 export namespace Node {
   export const enum Flag {
     none,
-    blank,
+    blank = 1 << 0,
+    nested = 1 << 1,
   }
 }

package/src/parser/context.ts

@@ -30,7 +30,9 @@ export class Input<M extends object = object> extends Ipt<M> {
       recursions: [
         // DOMの垂直的追加の繰り返しが加速的に異常に重くなる。
         // ブラウザの問題でありアルゴリズムの計算量は問題ない。
+        // HTMLでなくDOMでレンダリングすること自体に限界があると思われる。
         10 || Recursion.document,
+        // スタックでも意外と低速化するため制限しておく。
         100 || Recursion.block,
         100 || Recursion.inline,
         100 || Recursion.bracket,
@@ -56,7 +58,6 @@ export class Input<M extends object = object> extends Ipt<M> {
   public header: boolean;
   public local: boolean;
   public whitespace: boolean;
-  public recursion = new RecursionCounter(2);
   public readonly host?: URL;
   public readonly url?: URL;
   public id?: string;
@@ -72,23 +73,6 @@ export class Input<M extends object = object> extends Ipt<M> {
 }
 export type Options = Partial<Input>;
 
-class RecursionCounter {
-  constructor(
-    private readonly limit: number,
-  ) {
-  }
-  private readonly stack: number[] = [];
-  private index = 0;
-  public add(depth: number): boolean {
-    const { stack } = this
-    for (; this.index > 0 && stack[this.index - 1] >= depth; --this.index);
-    stack[this.index] = depth;
-    ++this.index;
-    // 内側から数えるので無効化処理できない。
-    return this.index <= this.limit;
-  }
-}
-
 export const enum Segment {
   unknown = 0,
   read = 0,

package/src/parser/inline/annotation.test.ts

@@ -86,6 +86,9 @@ describe('Unit: parser/inline/annotation', () => {
       assert.deepStrictEqual(
         inspect(parser, input(`${'(('.repeat(3)}0))((1))))))`)),
         [['<span class="invalid"><sup class="annotation"><span><sup class="annotation"><span>0</span></sup><sup class="annotation"><span>1</span></sup></span></sup></span>'], '']);
+      assert.deepStrictEqual(
+        inspect(parser, input(`${'(0'.repeat(4)}((0${'))'.repeat(3)}${'(('.repeat(2)}0${'))'.repeat(2)}`)),
+        [['<span class="paren">(0<span class="paren">(0<span class="paren">(0<span class="paren">(0<sup class="annotation"><span>0</span></sup>)</span>)</span>)</span>)</span>', '<sup class="annotation"><span><sup class="annotation"><span>0</span></sup></span></sup>'], '']);
     });
 
   });

package/src/parser/inline/annotation.ts

@@ -7,7 +7,7 @@ import { bracketname } from './bracket';
 import { repeat } from '../repeat';
 import { beforeNonblank, trimBlankNodeEnd } from '../visibility';
 import { unwrap, invalid } from '../util';
-import { html, defrag } from 'typed-dom/dom';
+import { html, define, defrag } from 'typed-dom/dom';
 
 // シグネチャ等生成のために構文木のツリーウォークを再帰的に行い指数計算量にならないよう
 // 動的計画法を適用するか再帰数を制限する必要がある。
@@ -32,7 +32,7 @@ export const annotation: AnnotationParser = lazy(() => constraint(State.annotati
     ([, bs], _, output) => output.import(bs),
     ([, bs], _, output) => bs && output.import(bs.push(new Node(Command.Cancel)))))),
     (nodes, input, output, lead, follow) => {
-      const { position, linebreak, range, recursion, resources } = input;
+      const { position, linebreak, range } = input;
       if (linebreak !== 0 || nodes.length === 0 || lead === 0 || follow % 2 === 0) {
         nodes.unshift(new Node('('));
         nodes.push(new Node(')'));
@@ -41,25 +41,26 @@ export const annotation: AnnotationParser = lazy(() => constraint(State.annotati
         ]);
       }
       input.position += 1;
-      if (!recursion.add(resources?.recursions[Recursion.inline] ?? resources?.recursions.at(-1))) {
-        return new List([new Node(html('span',
-          {
-            class: 'invalid',
-            ...invalid('annotation', 'syntax', 'Recursions must be two or fewer')
-          },
-          defrag(unwrap(trimBlankNodeEnd(nodes)))))]);
-      }
       const el = html('sup', { class: 'annotation' }, [
         html('span', defrag(unwrap(trimBlankNodeEnd(nodes))))
       ]);
       for (let list = output.annotations.at(-1)!, node = list.last, pos = position - range, i = 0; ; node = node!.prev, ++i) {
-        if (node && node.position > pos) continue;
+        if (node && node.position > pos) {
+          if (~node.flags & Node.Flag.nested) continue;
+          return new List([
+            new Node(define(el.firstElementChild as HTMLElement,
+              {
+                class: 'invalid',
+                ...invalid('annotation', 'syntax', 'Recursions must be two or fewer')
+              }))
+          ]);
+        }
+        const flag = i === 0 ? Node.Flag.none : Node.Flag.nested;
         i === list.length
-          ? list.unshift(new Node(el, pos))
-          : list.insert(new Node(el, pos), node?.next);
-        break;
+          ? list.unshift(new Node(el, pos, flag))
+          : list.insert(new Node(el, pos, flag), node?.next);
+        return new List([new Node(el)]);
       }
-      return new List([new Node(el)]);
     },
     (nodes, input, output, prefix, postfix) => {
       assert(postfix === 0);

package/src/parser/repeat.ts

@@ -93,6 +93,7 @@ export function repeat<T extends HTMLElement | string>(
           input.position += closer.length;
           const pos = input.position;
           m.follow = m.follow > 0 ? m.follow : countFollows(source, pos, closer, lead / opener.length | 0);
+          input.range = input.position - m.position - m.i + opener.length;
           output.push(cons(output.pop(), input, output, lead, m.follow));
           if (input.position > pos) {
             const advance = input.position - pos;