securemark 0.299.1 → 0.299.3

package/dist/index.js

@@ -1,4 +1,4 @@
-/*! securemark v0.299.1 https://github.com/falsandtru/securemark | (c) 2017, falsandtru | UNLICENSED License */
+/*! securemark v0.299.3 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"));
@@ -2605,7 +2605,7 @@ function fence(opener, limit, separation = true) {
     opener.lastIndex = position;
     const matches = opener.exec(source);
     if (!matches) return;
-    (0, combinator_1.consume)(matches[0].length, context);
+    (0, combinator_1.spend)(context, matches[0].length);
     const delim = matches[1];
     if (matches[0].includes(delim, delim.length)) return;
     context.position += matches[0].length;
@@ -2727,7 +2727,7 @@ function match(pattern, f) {
     pattern.lastIndex = position;
     const params = pattern.exec(source);
     if (!params) return;
-    count && (0, combinator_1.consume)(params[0].length, context);
+    count && (0, combinator_1.spend)(context, params[0].length);
     const result = f(params)(input);
     context.position += result ? context.position === position ? params[0].length : 0 : context.position - position;
     return result;
@@ -3239,7 +3239,7 @@ function matcher(pattern, advance, after) {
         pos = position;
         if (index === -1) return;
         const src = source.slice(position, index);
-        count && !hit && (0, context_1.consume)(src.length, context);
+        count && !hit && (0, context_1.spend)(context, src.length);
         if (advance) {
           context.position = index;
         }
@@ -3290,7 +3290,7 @@ function tester(pattern, advance, after) {
         pos = position;
         if (index === -1) return;
         const len = index - position;
-        count && !hit && (0, context_1.consume)(len, context);
+        count && !hit && (0, context_1.spend)(context, len);
         if (advance) {
           context.position = index;
         }
@@ -3547,35 +3547,28 @@ exports.failsafe = failsafe;
 Object.defineProperty(exports, "__esModule", ({
   value: true
 }));
-exports.constraint = exports.state = exports.precedence = exports.recursions = exports.recursion = exports.consume = exports.creation = void 0;
+exports.constraint = exports.state = exports.precedence = exports.recur = exports.recursion = exports.spend = exports.creation = void 0;
 const alias_1 = __webpack_require__(5413);
 function creation(cost, parser) {
   return input => {
     const context = input;
-    const resources = context.resources ?? {
-      clock: cost || 1,
-      recursions: [1]
-    };
-    const {
-      recursions
-    } = resources;
     const result = parser(input);
     if (result === undefined) return;
-    consume(cost, context);
+    spend(context, cost);
     return result;
   };
 }
 exports.creation = creation;
-function consume(cost, context) {
-  const {
-    resources
-  } = context;
-  if (!resources) return;
+function spend(context, cost) {
+  const resources = context.resources ?? {
+    clock: cost || 1,
+    recursions: [1]
+  };
   if (resources.clock < cost) throw new Error('Too many creations');
   resources.clock -= cost;
 }
-exports.consume = consume;
-function recursion(recursion, parser) {
+exports.spend = spend;
+function recursion(index, parser) {
   return input => {
     const context = input;
     const resources = context.resources ?? {
@@ -3585,41 +3578,19 @@ function recursion(recursion, parser) {
     const {
       recursions
     } = resources;
-    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];
+    recur(recursions, index, 1);
     const result = parser(input);
-    rec >= 0 && ++recursions[rec];
+    recur(recursions, index, -1);
     return result;
   };
 }
 exports.recursion = recursion;
-function recursions(rs, parser) {
-  return input => {
-    const context = input;
-    const resources = context.resources ?? {
-      clock: 1,
-      recursions: [4]
-    };
-    const {
-      recursions
-    } = resources;
-    for (const recursion of rs) {
-      const rec = (0, alias_1.min)(recursion, recursions.length - 1);
-      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);
-      if (rec === -1) continue;
-      ++recursions[rec];
-    }
-    return result;
-  };
+function recur(recursions, index, size, force = false) {
+  index = (0, alias_1.min)(index, recursions.length && recursions.length - 1);
+  if (recursions[index] < size - +force) throw new Error('Too much recursion');
+  recursions[index] -= size;
 }
-exports.recursions = recursions;
+exports.recur = recur;
 function precedence(precedence, parser) {
   return input => {
     const context = input;
@@ -3745,16 +3716,21 @@ Object.defineProperty(exports, "__esModule", ({
 }));
 exports.some = void 0;
 const delimiter_1 = __webpack_require__(385);
-function some(parser, delimiter, after, delimiters, limit = -1) {
+function some(parser, delimiter, after, delimiters, limit = 0) {
   if (typeof delimiter === 'number') {
     limit = delimiter;
+    delimiters = undefined;
     delimiter = undefined;
   } else if (Array.isArray(delimiter)) {
+    limit = after;
     delimiters = delimiter;
     delimiter = undefined;
   } else if (after === undefined || Array.isArray(after)) {
+    limit = delimiters;
     delimiters = after;
     after = undefined;
+  } else {
+    delimiters = delimiters;
   }
   const match = delimiter_1.Delimiters.tester(delimiter, after);
   const delims = delimiters?.map(([delimiter, precedence]) => ({
@@ -3768,7 +3744,6 @@ function some(parser, delimiter, after, delimiters, limit = -1) {
       source,
       position
     } = context;
-    //assert(context.backtracks ??= {});
     let nodes;
     delims && context.delimiters.push(delims);
     // whileは数倍遅い
@@ -3780,7 +3755,8 @@ function some(parser, delimiter, after, delimiters, limit = -1) {
       if (result === undefined) break;
       if (context.position === pos) break;
       nodes = nodes?.import(result) ?? result;
-      if (limit >= 0 && context.position - position > limit) break;
+      // 次にパースに成功すれば確実に制限値を超えるので制限値ちょうどでも中止する
+      if (limit > 0 && context.position - position >= limit) break;
     }
     delims && context.delimiters.pop(delims.length);
     return context.position > position ? nodes : undefined;
@@ -4201,7 +4177,11 @@ function header(source) {
 exports.header = header;
 function headers(source) {
   const [el] = parse(source);
-  return el?.textContent.trimEnd().slice(el.firstChild.firstChild.textContent.length).split(/\r?\n/) ?? [];
+  const acc = [];
+  for (let field = el?.firstChild?.firstChild; field = field?.nextSibling;) {
+    acc.push(field.textContent);
+  }
+  return acc;
 }
 exports.headers = headers;
 function parse(source) {
@@ -4458,7 +4438,7 @@ exports.block = error((0, combinator_1.union)([source_1.emptysegment, input => {
     case '(':
       return (0, olist_1.olist)(input);
     default:
-      if ('0' <= char && char <= '9') return (0, olist_1.olist)(input);
+      if (char <= '9' && '0' <= char) return (0, olist_1.olist)(input);
   }
 }, paragraph_1.paragraph]));
 function error(parser) {
@@ -4502,7 +4482,7 @@ const indent = (0, combinator_1.open)(opener, (0, combinator_1.some)(source_1.co
 const unindent = source => source.replace(/(?<=^|\n)>(?: |(?=>*(?:$|[ \r\n])))|\r?\n$/g, '');
 const source = (0, combinator_1.lazy)(() => (0, combinator_1.fmap)((0, combinator_1.recursion)(1 /* Recursion.blockquote */, (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.rewrite)(indent, (0, combinator_1.convert)(unindent, source)), (0, combinator_1.rewrite)((0, combinator_1.some)(source_1.contentline, opener), (0, combinator_1.convert)(unindent, (0, combinator_1.fmap)(autolink_1.autolink, ns => new parser_1.List([new parser_1.Node((0, dom_1.html)('pre', (0, dom_1.defrag)((0, util_1.unwrap)(ns))))]))))]))), ns => new parser_1.List([new parser_1.Node((0, dom_1.html)('blockquote', (0, util_1.unwrap)(ns)))])));
 const markdown = (0, combinator_1.lazy)(() => (0, combinator_1.fmap)((0, combinator_1.recursion)(1 /* Recursion.blockquote */, (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.rewrite)(indent, (0, combinator_1.convert)(unindent, markdown)), (0, combinator_1.rewrite)((0, combinator_1.some)(source_1.contentline, opener), (0, combinator_1.convert)(unindent, context => {
-  (0, combinator_1.consume)(10, context);
+  (0, combinator_1.spend)(context, 10);
   const {
     source
   } = context;
@@ -5813,7 +5793,7 @@ exports.MAX_INPUT_SIZE = exports.MAX_SEGMENT_SIZE * 10;
 class Context extends parser_1.Context {
   constructor(options = {}) {
     super(options);
-    this.recursion = new RecursionCounter('annotation', 2);
+    this.recursion = new RecursionCounter(2);
     const {
       segment,
       local,
@@ -5825,9 +5805,9 @@ class Context extends parser_1.Context {
       id,
       caches
     } = options;
-    this.resources ??= {
+    this.resources = options.resources ?? {
       // バックトラックのせいで文字数制限を受けないようにする。
-      clock: exports.MAX_SEGMENT_SIZE * (6 + 1),
+      clock: exports.MAX_SEGMENT_SIZE * (5 + 1),
       recursions: [5 || 0 /* Recursion.block */, 20 || 0 /* Recursion.blockquote */, 40 || 0 /* Recursion.listitem */, 20 || 0 /* Recursion.inline */, 20 || 0 /* Recursion.bracket */, 20 || 0 /* Recursion.terminal */]
     };
     this.segment = segment ?? 0 /* Segment.unknown */;
@@ -5843,8 +5823,7 @@ class Context extends parser_1.Context {
 }
 exports.Context = Context;
 class RecursionCounter {
-  constructor(syntax, limit) {
-    this.syntax = syntax;
+  constructor(limit) {
     this.limit = limit;
     this.stack = [];
     this.index = 0;
@@ -5855,7 +5834,7 @@ class RecursionCounter {
     } = this;
     for (; this.index > 0 && stack[this.index - 1] <= depth; --this.index);
     // 内側から数えるので無効化処理できずエラーを投げるしかない。
-    if (this.index === this.limit) throw new Error(`Too much ${this.syntax} recursion`);
+    if (this.index === this.limit) throw new Error(`Too much recursion`);
     stack[this.index] = depth;
     ++this.index;
   }
@@ -5881,7 +5860,7 @@ const combinator_1 = __webpack_require__(3484);
 const source_1 = __webpack_require__(8745);
 const util_1 = __webpack_require__(4992);
 const dom_1 = __webpack_require__(394);
-exports.header = (0, combinator_1.lazy)(() => (0, combinator_1.validate)(/---+[^\S\r\n]*\r?\n(?=\S)/y, (0, combinator_1.inits)([(0, combinator_1.block)((0, combinator_1.union)([(0, combinator_1.validate)(context => context.header, (0, combinator_1.focus)(/(---+)[^\S\r\n]*\r?\n(?:[a-z][0-9a-z]*(?:-[0-9a-z]+)*:[ \t]+\S[^\r\n]*\r?\n){1,100}\1[^\S\r\n]*(?:$|\r?\n)/yi, (0, combinator_1.convert)(source => source.slice(source.indexOf('\n') + 1, source.trimEnd().lastIndexOf('\n')), (0, combinator_1.fmap)((0, combinator_1.some)((0, combinator_1.union)([field])), ns => new parser_1.List([new parser_1.Node((0, dom_1.html)('aside', {
+exports.header = (0, combinator_1.lazy)(() => (0, combinator_1.validate)(/---+[^\S\r\n]*\r?\n(?=\S)/y, (0, combinator_1.inits)([(0, combinator_1.block)((0, combinator_1.union)([(0, combinator_1.validate)(context => context.header, (0, combinator_1.focus)(/(---+)[^\S\r\n]*\r?\n(?:[a-z][0-9a-z]*(?:-[0-9a-z]+)*:[ \t]+\S[^\r\n]*\r?\n){1,32}\1[^\S\r\n]*(?:$|\r?\n)/yi, (0, combinator_1.convert)(source => source.slice(source.indexOf('\n') + 1, source.trimEnd().lastIndexOf('\n')), (0, combinator_1.fmap)((0, combinator_1.some)((0, combinator_1.union)([field])), ns => new parser_1.List([new parser_1.Node((0, dom_1.html)('aside', {
   class: 'header'
 }, [(0, dom_1.html)('details', {
   open: ''
@@ -5903,7 +5882,7 @@ const field = (0, combinator_1.line)(({
 }) => {
   const name = source.slice(position, source.indexOf(':', position));
   const value = source.slice(position + name.length + 1).trim();
-  return new parser_1.List([new parser_1.Node((0, dom_1.html)('span', {
+  return new parser_1.List([new parser_1.Node((0, dom_1.html)('div', {
     class: 'field',
     'data-name': name.toLowerCase(),
     'data-value': value
@@ -5911,7 +5890,7 @@ const field = (0, combinator_1.line)(({
     class: 'field-name'
   }, name), ': ', (0, dom_1.html)('span', {
     class: 'field-value'
-  }, value), '\n']))]);
+  }, value)]))]);
 });
 
 /***/ },
@@ -6057,7 +6036,7 @@ Object.defineProperty(exports, "lineshortmedia", ({
   }
 }));
 function isAlphabet(char) {
-  return 'a' <= char && char <= 'z';
+  return char <= 'z' && 'a' <= char;
 }
 
 /***/ },
@@ -6095,7 +6074,7 @@ const dom_1 = __webpack_require__(394);
 // 修正する必要があるためほぼ完全な二重処理が必要になり三重以上の注釈という不適切な使用のために
 // 常に非常に非効率な処理を行い常時低速化するより三重以上の注釈を禁止して効率性を維持するのが妥当である。
 const MAX_DEPTH = 20;
-exports.annotation = (0, combinator_1.lazy)(() => (0, combinator_1.constraint)(128 /* State.annotation */, (0, repeat_1.repeat)('(', visibility_1.beforeNonblank, ')', [4 /* Recursion.bracket */], (0, combinator_1.precedence)(1, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([inline_1.inline]), ')', [[')', 1]]), ')', false, [], ([, bs], {
+exports.annotation = (0, combinator_1.lazy)(() => (0, combinator_1.constraint)(128 /* State.annotation */, (0, repeat_1.repeat)('(', visibility_1.beforeNonblank, ')', 4 /* Recursion.bracket */, (0, combinator_1.precedence)(1, (0, combinator_1.surround)('', (0, combinator_1.some)((0, combinator_1.union)([inline_1.inline]), ')', [[')', 1]]), ')', false, [], ([, bs], {
   buffer
 }) => buffer.import(bs), ([, bs], {
   buffer
@@ -6359,10 +6338,9 @@ Object.defineProperty(exports, "__esModule", ({
 exports.lineurl = exports.url = void 0;
 const parser_1 = __webpack_require__(605);
 const combinator_1 = __webpack_require__(3484);
-const inline_1 = __webpack_require__(7973);
 const link_1 = __webpack_require__(3628);
 const source_1 = __webpack_require__(8745);
-exports.url = (0, combinator_1.lazy)(() => (0, combinator_1.rewrite)((0, combinator_1.open)(/(?<![0-9A-Za-z][.+-]?|[@#])https?:\/\/(?=[\x21-\x7E])/y, (0, combinator_1.precedence)(0, (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(source_1.unescsource, /(?<![-+*=~^_,.;:!?]|\/{3})(?:[-+*=~^_,.;:!?]|\/{3,}(?!\/))*(?=[\\$"`\[\](){}<>（）［］｛｝|]|[^\x21-\x7E]|$)/y), (0, combinator_1.precedence)(1, bracket)]), [[/[^\x21-\x7E]|\$/y, 9]])), false, [3 | 8 /* Backtrack.unescapable */]), (0, combinator_1.union)([(0, combinator_1.constraint)(1 /* State.autolink */, (0, combinator_1.state)(1 /* State.autolink */, context => new parser_1.List([new parser_1.Node((0, link_1.parse)(new parser_1.List(), new parser_1.List([new parser_1.Node(context.source)]), context))]))), (0, combinator_1.open)((0, source_1.str)(/[^:]+/y), (0, combinator_1.some)(inline_1.inline))])));
+exports.url = (0, combinator_1.lazy)(() => (0, combinator_1.rewrite)((0, combinator_1.open)(/(?<![0-9A-Za-z][.+-]?|[@#])https?:\/\/(?=[[0-9A-Za-z])/y, (0, combinator_1.precedence)(0, (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(source_1.unescsource, /(?<![-+*=~^_,.;:!?]|\/{3})(?:[-+*=~^_,.;:!?]|\/{3,}(?!\/))*(?=[\\$"`\[\](){}<>（）［］｛｝|]|[^\x21-\x7E]|$)/y), (0, combinator_1.precedence)(1, bracket)]), [[/[^\x21-\x7E]|\$/y, 9]])), false, [3 | 8 /* Backtrack.unescapable */]), (0, combinator_1.union)([(0, combinator_1.constraint)(1 /* State.autolink */, (0, combinator_1.state)(1 /* State.autolink */, context => new parser_1.List([new parser_1.Node((0, link_1.parse)(new parser_1.List(), new parser_1.List([new parser_1.Node(context.source)]), context))]))), context => new parser_1.List([new parser_1.Node(context.source)])])));
 exports.lineurl = (0, combinator_1.lazy)(() => (0, combinator_1.focus)(/(?<=^|[\r\n])!?https?:\/\/\S+(?=[^\S\r\n]*(?=$|\r?\n))/y, (0, combinator_1.tails)([(0, source_1.str)('!'), (0, combinator_1.union)([(0, combinator_1.constraint)(1 /* State.autolink */, (0, combinator_1.state)(1 /* State.autolink */, context => {
   const {
     source,
@@ -6370,7 +6348,7 @@ exports.lineurl = (0, combinator_1.lazy)(() => (0, combinator_1.focus)(/(?<=^|[\
   } = context;
   context.position -= source[0] === '!' ? 1 : 0;
   return new parser_1.List([new parser_1.Node((0, link_1.parse)(new parser_1.List(), new parser_1.List([new parser_1.Node(source.slice(position))]), context))]);
-})), (0, source_1.str)(/[^:]+/y)])])));
+})), context => new parser_1.List([new parser_1.Node(context.source)])])])));
 const bracket = (0, combinator_1.lazy)(() => (0, combinator_1.union)([(0, combinator_1.surround)((0, source_1.str)('('), (0, combinator_1.recursion)(5 /* Recursion.terminal */, (0, combinator_1.some)((0, combinator_1.union)([bracket, source_1.unescsource]), ')')), (0, source_1.str)(')'), true, [3 | 8 /* Backtrack.unescapable */]), (0, combinator_1.surround)((0, source_1.str)('['), (0, combinator_1.recursion)(5 /* Recursion.terminal */, (0, combinator_1.some)((0, combinator_1.union)([bracket, source_1.unescsource]), ']')), (0, source_1.str)(']'), true, [3 | 8 /* Backtrack.unescapable */]), (0, combinator_1.surround)((0, source_1.str)('{'), (0, combinator_1.recursion)(5 /* Recursion.terminal */, (0, combinator_1.some)((0, combinator_1.union)([bracket, source_1.unescsource]), '}')), (0, source_1.str)('}'), true, [3 | 8 /* Backtrack.unescapable */]), (0, combinator_1.surround)((0, source_1.str)('"'), (0, combinator_1.precedence)(2, (0, combinator_1.recursion)(5 /* Recursion.terminal */, (0, combinator_1.some)(source_1.unescsource, '"'))), (0, source_1.str)('"'), true, [3 | 8 /* Backtrack.unescapable */])]));
 
 /***/ },
@@ -6510,7 +6488,7 @@ const repeat_1 = __webpack_require__(8019);
 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, repeat_1.repeat)('~~', '', '~~', [3 /* Recursion.inline */], (0, combinator_1.precedence)(0, (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, repeat_1.repeat)('~~', '', '~~', 3 /* Recursion.inline */, (0, combinator_1.precedence)(0, (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
@@ -6565,7 +6543,7 @@ const subemphasis = (0, combinator_1.lazy)(() => (0, combinator_1.some)((0, comb
 // 開閉が明示的でない構文は開閉の不明確な記号による再帰的適用を行わず
 // 可能な限り早く閉じるよう解析しなければならない。
 // このため終端記号の後ろを見て終端を中止し同じ構文を再帰的に適用してはならない。
-exports.emstrong = (0, combinator_1.lazy)(() => (0, repeat_1.repeat)('***', visibility_1.beforeNonblank, '***', [3 /* Recursion.inline */], (0, combinator_1.precedence)(0, (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, repeat_1.repeat)('***', visibility_1.beforeNonblank, '***', 3 /* Recursion.inline */, (0, combinator_1.precedence)(0, (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;
@@ -7144,7 +7122,7 @@ const repeat_1 = __webpack_require__(8019);
 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, repeat_1.repeat)('++', '', '++', [3 /* Recursion.inline */], (0, combinator_1.precedence)(0, (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, repeat_1.repeat)('++', '', '++', 3 /* Recursion.inline */, (0, combinator_1.precedence)(0, (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
@@ -7172,7 +7150,7 @@ const dom_1 = __webpack_require__(394);
 // 可読性のため実際にはオブリーク体を指定する。
 // 斜体は単語に使うとかえって見づらく読み飛ばしやすくなるため使わないべきであり
 // ある程度の長さのある文に使うのが望ましい。
-exports.italic = (0, combinator_1.lazy)(() => (0, repeat_1.repeat)('///', visibility_1.beforeNonblank, '///', [3 /* Recursion.inline */], (0, combinator_1.precedence)(0, (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, repeat_1.repeat)('///', visibility_1.beforeNonblank, '///', 3 /* Recursion.inline */, (0, combinator_1.precedence)(0, (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
@@ -7247,7 +7225,7 @@ exports.uri = (0, combinator_1.union)([(0, combinator_1.open)(' ', (0, source_1.
 exports.option = (0, combinator_1.union)([(0, combinator_1.fmap)((0, source_1.str)(/ nofollow(?=[ }])/y), () => new parser_1.List([new parser_1.Node(' rel="nofollow"')])), (0, source_1.str)(/ [a-z]+(?:-[a-z]+)*(?:="(?:\\[^\r\n]|[^\\\r\n"])*")?(?=[ }])/yi), (0, source_1.str)(/ [^\s{}]+/y)]);
 function parse(content, params, context) {
   const INSECURE_URI = params.shift().value;
-  (0, combinator_1.consume)(10, context);
+  (0, combinator_1.spend)(context, 10);
   let uri;
   try {
     uri = new url_1.ReadonlyURL(resolve(INSECURE_URI, context.host ?? location, context.url ?? context.host ?? location), context.host?.href || location.href);
@@ -7354,7 +7332,7 @@ const repeat_1 = __webpack_require__(8019);
 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, repeat_1.repeat)('==', visibility_1.beforeNonblank, '==', [3 /* Recursion.inline */], (0, combinator_1.precedence)(0, (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, repeat_1.repeat)('==', visibility_1.beforeNonblank, '==', 3 /* Recursion.inline */, (0, combinator_1.precedence)(0, (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
@@ -7389,8 +7367,8 @@ const combinator_1 = __webpack_require__(3484);
 const source_1 = __webpack_require__(8745);
 const util_1 = __webpack_require__(4992);
 const dom_1 = __webpack_require__(394);
-const forbiddenCommand = /\\(?:begin|tiny|huge|large)(?![a-z])|:\/\//i;
-exports.math = (0, combinator_1.lazy)(() => (0, combinator_1.rewrite)((0, combinator_1.union)([(0, combinator_1.surround)(/\$(?={)/y, (0, combinator_1.precedence)(4, bracket), '$', false, [3 | 16 /* Backtrack.escapable */]), (0, combinator_1.surround)(/\$(?![\s{}])/y, (0, combinator_1.precedence)(2, (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(source_1.escsource, /\$|[`"{}\r\n]/y), (0, combinator_1.precedence)(4, bracket)]))), /(?<!\s)\$(?![-0-9A-Za-z])/y, false, [3 | 16 /* Backtrack.escapable */])]), ({
+const forbiddenCommand = /\\(?:begin|tiny|huge|large)(?![a-z])/i;
+exports.math = (0, combinator_1.lazy)(() => (0, combinator_1.rewrite)((0, combinator_1.union)([(0, combinator_1.surround)(/\$(?={)/y, (0, combinator_1.precedence)(4, bracket), '$', false, [3 | 16 /* Backtrack.escapable */]), (0, combinator_1.surround)(/\$(?![\s{}])/y, (0, combinator_1.precedence)(2, (0, combinator_1.some)((0, combinator_1.union)([(0, combinator_1.some)(source_1.escsource, /[`"{}$\r\n]|(?<=[0-9A-Za-z]):\/\/[[0-9A-Za-z]/y), (0, combinator_1.precedence)(4, bracket)]))), /(?<!\s)\$(?![-0-9A-Za-z])/y, false, [3 | 16 /* Backtrack.escapable */])]), ({
   source,
   caches: {
     math: cache
@@ -7404,7 +7382,7 @@ exports.math = (0, combinator_1.lazy)(() => (0, combinator_1.rewrite)((0, combin
   translate: 'no',
   ...(0, util_1.invalid)('math', 'content', `"${source.match(forbiddenCommand)[0]}" command is forbidden`)
 }, source))])));
-const bracket = (0, combinator_1.lazy)(() => (0, combinator_1.surround)((0, source_1.str)('{'), (0, combinator_1.recursion)(5 /* Recursion.terminal */, (0, combinator_1.some)((0, combinator_1.union)([bracket, (0, combinator_1.some)(source_1.escsource, /[{}$\r\n]/y)]))), (0, source_1.str)('}'), true));
+const bracket = (0, combinator_1.lazy)(() => (0, combinator_1.surround)((0, source_1.str)('{'), (0, combinator_1.recursion)(5 /* Recursion.terminal */, (0, combinator_1.some)((0, combinator_1.union)([bracket, (0, combinator_1.some)(source_1.escsource, /[{}$\r\n]|(?<=[0-9A-Za-z]):\/\/[[0-9A-Za-z]/y)]))), (0, source_1.str)('}'), true));
 
 /***/ },
 
@@ -7456,7 +7434,7 @@ exports.media = (0, combinator_1.lazy)(() => (0, combinator_1.constraint)(4 /* S
     text = text.trim();
     if (text === '' || text[0] !== tmp[0]) return;
   }
-  (0, combinator_1.consume)(100, context);
+  (0, combinator_1.spend)(context, 100);
   if (params.last.value === "\u0018" /* Command.Cancel */) {
     params.pop();
     return new parser_1.List([new parser_1.Node((0, dom_1.html)('span', {
@@ -7666,14 +7644,14 @@ const dom_1 = __webpack_require__(394);
 exports.ruby = (0, combinator_1.lazy)(() => (0, combinator_1.bind)((0, combinator_1.inits)([(0, combinator_1.dup)((0, combinator_1.surround)('[', text, ']', false, [1 | 4 /* Backtrack.common */, 3 | 32 /* Backtrack.ruby */], ([, ns]) => {
   ns && ns.last?.value === '' && ns.pop();
   return (0, visibility_1.isNonblankNodeStart)(ns) ? ns : undefined;
-})), (0, combinator_1.dup)((0, combinator_1.surround)('(', text, ')', false, [3 | 32 /* Backtrack.ruby */]))]), ([{
+})), (0, combinator_1.dup)((0, combinator_1.surround)('(', text, ')', false))]), ([{
   value: texts
 }, {
   value: rubies = undefined
 } = {}], context) => {
   if (rubies === undefined) {
     const head = context.position - context.range;
-    return void (0, combinator_1.setBacktrack)(context, 2 | 32 /* Backtrack.ruby */, head);
+    return void (0, combinator_1.setBacktrack)(context, 2 | 64 /* Backtrack.link */ | 32 /* Backtrack.ruby */, head);
   }
   switch (true) {
     case texts.length >= rubies.length:
@@ -8148,8 +8126,9 @@ Object.defineProperty(exports, "__esModule", ({
 exports.repeat = void 0;
 const parser_1 = __webpack_require__(605);
 const delimiter_1 = __webpack_require__(385);
+const combinator_1 = __webpack_require__(3484);
 const alias_1 = __webpack_require__(5413);
-function repeat(opener, after, closer, rs, parser, cons, termination = (nodes, context, prefix, postfix) => {
+function repeat(opener, after, closer, recursion, parser, cons, termination = (nodes, context, prefix, postfix) => {
   const acc = new parser_1.List();
   if (prefix > 0) {
     acc.push(new parser_1.Node(opener[0].repeat(prefix)));
@@ -8175,7 +8154,7 @@ function repeat(opener, after, closer, rs, parser, cons, termination = (nodes, c
       position,
       resources: {
         recursions
-      } = {}
+      }
     } = context;
     if (!source.startsWith(opener, context.position)) return;
     let nodes = new parser_1.List();
@@ -8187,20 +8166,11 @@ function repeat(opener, after, closer, rs, parser, cons, termination = (nodes, c
       return;
     }
     let depth = i / opener.length + 1 | 0;
-    if (recursions) for (const recursion of rs) {
-      const rec = (0, alias_1.min)(recursion, recursions.length - 1);
-      if (rec === -1) continue;
-      if (recursions[rec] < depth - 1) throw new Error('Too much recursion');
-      recursions[rec] -= depth;
-    }
+    (0, combinator_1.recur)(recursions, recursion, depth, true);
     let state = false;
     let follow = 0;
     for (; i >= opener.length; i -= opener.length, follow -= closer.length) {
-      if (recursions) for (const recursion of rs) {
-        const rec = (0, alias_1.min)(recursion, recursions.length - 1);
-        if (rec === -1) continue;
-        recursions[rec] += 1;
-      }
+      (0, combinator_1.recur)(recursions, recursion, -1);
       depth -= 1;
       const lead = i - opener.length;
       if (source.startsWith(closer, context.position)) {
@@ -8209,10 +8179,10 @@ function repeat(opener, after, closer, rs, parser, cons, termination = (nodes, c
         follow = follow > 0 ? follow : countFollows(source, pos, closer, lead / opener.length | 0);
         nodes = cons(nodes, context, lead, follow);
         if (context.position > pos) {
-          const advance = opener.length * (context.position - pos) / closer.length | 0;
+          const advance = context.position - pos;
           i -= advance;
           follow -= advance;
-          depth -= advance;
+          depth -= advance / closer.length | 0;
         }
         continue;
       }
@@ -8239,20 +8209,16 @@ function repeat(opener, after, closer, rs, parser, cons, termination = (nodes, c
           nodes = cons(nodes, context, lead, follow);
           state = true;
           if (context.position > pos) {
-            const advance = opener.length * (context.position - pos) / closer.length | 0;
+            const advance = context.position - pos;
             i -= advance;
             follow -= advance;
-            depth -= advance;
+            depth -= advance / closer.length | 0;
           }
           continue;
       }
       break;
     }
-    if (recursions) for (let i = 0; i < depth; ++i) for (const recursion of rs) {
-      const rec = (0, alias_1.min)(recursion, recursions.length - 1);
-      if (rec === -1) continue;
-      recursions[rec] += depth;
-    }
+    (0, combinator_1.recur)(recursions, recursion, -depth);
     depth = 0;
     const prefix = i;
     i = 0;
@@ -8431,22 +8397,19 @@ Object.defineProperty(exports, "__esModule", ({
 exports.escsource = void 0;
 const parser_1 = __webpack_require__(605);
 const combinator_1 = __webpack_require__(3484);
-const text_1 = __webpack_require__(5655);
 const dom_1 = __webpack_require__(394);
-const delimiter = /(?=[\\$"`\[\](){}\r\n]|\s\$|:\/\/)/g;
 const escsource = context => {
   const {
     source,
-    position,
-    state
+    position
   } = context;
   if (position === source.length) return;
   const char = source[position];
-  (0, combinator_1.consume)(1, context);
+  (0, combinator_1.spend)(context, 1);
   context.position += 1;
   switch (char) {
     case "\u001B" /* Command.Escape */:
-      (0, combinator_1.consume)(1, context);
+      (0, combinator_1.spend)(context, 1);
       context.position += 1;
       return new parser_1.List([new parser_1.Node(source.slice(position + 1, position + 2))]);
     case '\\':
@@ -8456,7 +8419,7 @@ const escsource = context => {
         case '\n':
           return new parser_1.List([new parser_1.Node(char)]);
         default:
-          (0, combinator_1.consume)(1, context);
+          (0, combinator_1.spend)(context, 1);
           context.position += 1;
           return new parser_1.List([new parser_1.Node(source.slice(position, position + 2))]);
       }
@@ -8467,14 +8430,38 @@ const escsource = context => {
       return new parser_1.List([new parser_1.Node((0, dom_1.html)('br'), 1 /* Flag.blank */)]);
     default:
       if (context.sequential) return new parser_1.List([new parser_1.Node(char)]);
-      let i = (0, text_1.next)(source, position, state, delimiter);
+      let i = seek(source, position);
       i -= position;
-      (0, combinator_1.consume)(i - 1, context);
+      (0, combinator_1.spend)(context, i - 1);
       context.position += i - 1;
       return new parser_1.List([new parser_1.Node(source.slice(position, context.position))]);
   }
 };
 exports.escsource = escsource;
+function seek(source, position) {
+  for (let i = position + 1; i < source.length; ++i) {
+    const char = source[i];
+    switch (char) {
+      case '\\':
+      case '$':
+      case '"':
+      case '`':
+      case ':':
+      case '[':
+      case ']':
+      case '(':
+      case ')':
+      case '{':
+      case '}':
+      case '\r':
+      case '\n':
+        return i;
+      default:
+        continue;
+    }
+  }
+  return source.length;
+}
 
 /***/ },
 
@@ -8604,7 +8591,7 @@ exports.strs = strs;
 Object.defineProperty(exports, "__esModule", ({
   value: true
 }));
-exports.isAlphanumeric = exports.next = exports.canSkip = exports.txt = exports.text = exports.nonWhitespace = void 0;
+exports.isAlphanumeric = exports.backToEmailHead = exports.backToUrlHead = exports.canSkip = exports.txt = exports.text = exports.nonWhitespace = void 0;
 const parser_1 = __webpack_require__(605);
 const combinator_1 = __webpack_require__(3484);
 const dom_1 = __webpack_require__(394);
@@ -8618,7 +8605,7 @@ const text = input => {
   } = context;
   if (position === source.length) return;
   const char = source[position];
-  (0, combinator_1.consume)(1, context);
+  (0, combinator_1.spend)(context, 1);
   context.position += 1;
   switch (char) {
     case "\u001B" /* Command.Escape */:
@@ -8630,7 +8617,7 @@ const text = input => {
         case '\n':
           return new parser_1.List();
         default:
-          (0, combinator_1.consume)(1, context);
+          (0, combinator_1.spend)(context, 1);
           context.position += 1;
           return new parser_1.List([new parser_1.Node(source.slice(position + 1, context.position))]);
       }
@@ -8647,7 +8634,7 @@ const text = input => {
       const lineend =  false || s && i === source.length || s && source[i] === '\r' || s && source[i] === '\n';
       i -= position;
       i = lineend ? i : i - +s || 1;
-      (0, combinator_1.consume)(i - 1, context);
+      (0, combinator_1.spend)(context, i - 1);
       context.position += i - 1;
       const linestart = position === 0 || source[position - 1] === '\n';
       if (position === context.position || s && !linestart || lineend) return new parser_1.List();
@@ -8675,23 +8662,16 @@ function isWhitespace(char, linebreak) {
       return false;
   }
 }
-function next(source, position, state, delimiter) {
-  let index;
-  if (delimiter) {
-    delimiter.lastIndex = position + 1;
-    delimiter.test(source);
-    index = delimiter.lastIndex || position;
-  } else {
-    index = seek(source, position, state);
-  }
-  if (index === position || index === source.length) return source.length;
+function next(source, position, state) {
+  let index = seek(source, position, state);
+  if (index === source.length) return index;
   const char = source[index];
   switch (char) {
     case '%':
-      index += !delimiter && index - 1 > position ? -1 : 0;
+      index += index - 1 > position ? -1 : 0;
       break;
     case '[':
-      index += !delimiter && index - 1 > position && source.startsWith(' [|', index - 1) ? -1 : 0;
+      index += index - 1 > position && source.startsWith(' [|', index - 1) ? -1 : 0;
       break;
     case ':':
       index = source.startsWith('//', index + 1) ? backToUrlHead(source, position, index) : index;
@@ -8702,7 +8682,6 @@ function next(source, position, state, delimiter) {
   }
   return index;
 }
-exports.next = next;
 function backToUrlHead(source, position, index) {
   const delim = index;
   let state = false;
@@ -8724,6 +8703,7 @@ function backToUrlHead(source, position, index) {
   }
   return index === position || source[index] !== 'h' ? delim : index;
 }
+exports.backToUrlHead = backToUrlHead;
 function backToEmailHead(source, position, index) {
   const delim = index;
   let state = false;
@@ -8746,9 +8726,11 @@ function backToEmailHead(source, position, index) {
   }
   return index === position ? delim : index;
 }
+exports.backToEmailHead = backToEmailHead;
 function isAlphanumeric(char) {
-  if (char < '0' || '\x7F' < char) return false;
-  return '0' <= char && char <= '9' || 'A' <= char && char <= 'Z' || 'a' <= char && char <= 'z';
+  if (char < '0' || 'z' < char) return false;
+  if (char <= '9' || 'a' <= char) return true;
+  return 'A' <= char && char <= 'Z';
 }
 exports.isAlphanumeric = isAlphanumeric;
 function seek(source, position, state) {
@@ -8841,12 +8823,11 @@ function seek(source, position, state) {
 Object.defineProperty(exports, "__esModule", ({
   value: true
 }));
-exports.unescsource = exports.delimiter = void 0;
+exports.unescsource = void 0;
 const parser_1 = __webpack_require__(605);
 const combinator_1 = __webpack_require__(3484);
 const text_1 = __webpack_require__(5655);
 const dom_1 = __webpack_require__(394);
-exports.delimiter = /(?=(?=[\x00-\x7F])[^0-9A-Za-z]|(?<=[\x00-\x7F])[^\x00-\x7F])/g;
 const unescsource = context => {
   const {
     source,
@@ -8855,11 +8836,11 @@ const unescsource = context => {
   } = context;
   if (position === source.length) return;
   const char = source[position];
-  (0, combinator_1.consume)(1, context);
+  (0, combinator_1.spend)(context, 1);
   context.position += 1;
   switch (char) {
     case "\u001B" /* Command.Escape */:
-      (0, combinator_1.consume)(1, context);
+      (0, combinator_1.spend)(context, 1);
       context.position += 1;
       return new parser_1.List([new parser_1.Node(source.slice(position + 1, position + 2))]);
     case '\r':
@@ -8870,14 +8851,87 @@ const unescsource = context => {
     default:
       if (context.sequential) return new parser_1.List([new parser_1.Node(char)]);
       text_1.nonWhitespace.lastIndex = position + 1;
-      let i = (0, text_1.canSkip)(source, position) ? text_1.nonWhitespace.test(source) ? text_1.nonWhitespace.lastIndex - 1 : source.length : (0, text_1.next)(source, position, state, exports.delimiter);
+      let i = (0, text_1.canSkip)(source, position) ? text_1.nonWhitespace.test(source) ? text_1.nonWhitespace.lastIndex - 1 : source.length : next(source, position, state);
       i -= position;
-      (0, combinator_1.consume)(i - 1, context);
+      (0, combinator_1.spend)(context, i - 1);
       context.position += i - 1;
       return new parser_1.List([new parser_1.Node(source.slice(position, context.position))]);
   }
 };
 exports.unescsource = unescsource;
+function next(source, position, state) {
+  let index = seek(source, position, state);
+  if (index === source.length) return index;
+  const char = source[index];
+  switch (char) {
+    case ':':
+      index = source.startsWith('//', index + 1) ? (0, text_1.backToUrlHead)(source, position, index) : index;
+      break;
+    case '@':
+      index = ~state & 1 /* State.autolink */ ? (0, text_1.backToEmailHead)(source, position, index) : index;
+      break;
+  }
+  return index;
+}
+function seek(source, position, state) {
+  const cat = category(source[position]);
+  for (let i = position + 1; i < source.length; ++i) {
+    const char = source[i];
+    switch (char) {
+      case '\\':
+      case '!':
+      case '$':
+      case '"':
+      case '`':
+      case '[':
+      case ']':
+      case '(':
+      case ')':
+      case '{':
+      case '}':
+      case '<':
+      case '>':
+      case '（':
+      case '）':
+      case '［':
+      case '］':
+      case '｛':
+      case '｝':
+      case '-':
+      case '+':
+      case '*':
+      case '=':
+      case '~':
+      case '^':
+      case '_':
+      case ',':
+      case '.':
+      case ';':
+      case ':':
+      case '!':
+      case '?':
+      case '/':
+      case '|':
+      case '\r':
+      case '\n':
+        return i;
+      case '@':
+      case '#':
+        if (~state & 1 /* State.autolink */) return i;
+        continue;
+      case ':':
+        if (source[i + 1] === '/' && source[i + 2] === '/') return i;
+        continue;
+      default:
+        if (cat && !category(char)) return i;
+        continue;
+    }
+  }
+  return source.length;
+}
+function category(char) {
+  return char <= '\x7E' && '\x21' <= char;
+}
 
 /***/ },