securemark 0.280.7 → 0.280.8

package/CHANGELOG.md

@@ -1,5 +1,9 @@
 # Changelog
 
+## 0.280.8
+
+- Fix dependencies.
+
 ## 0.280.7
 
 - Refactoring.

package/design.md

@@ -285,7 +285,7 @@ CodeMirrorが素では速いがVimModeでは数万文字程度でも耐え難く
 
 ### バックトラック
 
-SecuremarkのAnnotation構文に典型的であるように文脈を変更する構文の中にその文脈に依存し変更される他の構文が存在する場合一般に文脈の相違から解析結果を再利用不能な(`αA'β | αAB`)バックトラックが生じる。文脈依存構文の解析中に文脈により解釈の異なる字句(`[a((`)または現在の文脈を終了する字句(ただの括弧がスコープを作らない場合の`(([a))`)に遭遇したとき、現在の文脈での解析の継続を試行する解析方法はメモ化なしではバックトラックが再帰的に生じ線形時間で解析できず、現在の文脈での解析を中止し直前の文脈を継続または新たな文脈を開始する解析方法はバックトラックなしで線形時間で解析できる。
+SecuremarkのAnnotation構文に典型的であるように文脈を変更する構文の中にその文脈に依存し変更される他の構文が存在する場合一般に文脈の相違から解析結果を再利用不能な(`αA'β | αAB`)バックトラックが生じる。文脈依存構文の解析中に文脈により解釈の異なる字句(`[a((`)または現在の文脈を終了する字句(ただの括弧がスコープを作らない場合の`(([a))`)に遭遇したとき、現在の文脈での解析の継続を試行する解析方法はメモ化なしではバックトラックが再帰的に生じ線形時間で解析できず、現在の文脈での解析を中止し直前の文脈を継続または新たな文脈を開始する解析方法はバックトラックなしで線形時間で解析できる(バッファまたは解析試行ログを使用して解釈を変更する実装方法があるが開始記号の一部が重複しないよう構文が制限される場合がある)。
 CommonMarkはLink構文から明らかなように後者の解析方法により再帰的バックトラックなし(Markdown(2n)＋正規表現(1n)で最悪計算量3n程度)で解析できる言語であるが同時にこれは文脈依存構文の正当な入れ子表現を解析できず文脈依存構文の存在する数に応じて多項式的(おそらく$n^{2+c}$)に構文の壊れやすさの増す脆く拡張性の低い言語であることを意味する。この問題はおそらくメモ化により解決できるがCommonMarkは実行性能追及のためメモ化を廃止しているためメモ化により性能を低下させてまで解決するつもりはないと思われる(すなわちCommonMarkは機械を至上とし人間に制約を課す低水準の言語であり人間の需要を至上とするSecuremarkとは対極に位置する)。
 従って現在の再帰的バックトラックなしで解析可能な文法に制約されるCommonMarkには文脈依存構文を入れ子表現の広範な制限ならびに構文の可読性および開始記号の信頼性の多項式的な低下と引き換えにしか追加できないという拡張性の欠陥が存在する。CommonMarkの仕様策定者が構文の拡張に(名称を維持するか否かにかかわらず)不自然なまでに消極的または進展がないのは正当な理由や怠慢からでなく文脈依存構文を追加するにつれて構文解析戦略の欠陥が明白になっていくためおよび現在の高い実行性能を低下させたくないためである。`~~a~~`のような文脈自由構文は容易に追加できるがこうしたマージンを失えばもはや後はない。CommonMarkは小さく単純であるがゆえに正しくいられる象牙の塔であり仕様策定者はこの正しさを失わず正しいままでいたいがために象牙の塔に引きこもり小さな完全性を固持し続けているのである(でなければ何年も隠さず速やかにこの拡張性の欠如を公表して助力を求めていなければならない)。
 Securemarkは線形時間で解析不能な前者の解析方法をメモ化によりおおよそ4n以下の最悪計算量に改善しさらに解析時間と解析範囲の局限により一定時間内で解析不能な入力の影響を局限することでこれらの問題を解決している。この解析方法はほとんどの自然な入力に対して1nに近い時間で効率的に動作し、最悪計算量で低速に動作させる少数の機械的攻撃入力に対してもサーバーで多数のユーザーのリクエストに応じるには低速で脆弱性となる可能性があるがクライアントで単一のユーザーの操作に応じるには十分高速であるためクライアントで解析する限り解析の効率または速度が実用上問題となることはない。

package/dist/index.js

@@ -1,4 +1,4 @@
-/*! securemark v0.280.7 https://github.com/falsandtru/securemark | (c) 2017, falsandtru | UNLICENSED License */
+/*! securemark v0.280.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"));
@@ -395,13 +395,13 @@ DWCはこの最適化を行っても状態数の多さに比例して増加し
 
 */
 class Entry {
-  constructor(key, value, size, partition, affiliation, expiration) {
+  constructor(key, value, size, expiration, partition, affiliation) {
     this.key = key;
     this.value = value;
     this.size = size;
+    this.expiration = expiration;
     this.partition = partition;
     this.affiliation = affiliation;
-    this.expiration = expiration;
     this.enode = undefined;
     this.next = undefined;
     this.prev = undefined;
@@ -631,7 +631,7 @@ class Cache {
     if (entry.partition === 'LRU') {
       if (entry.affiliation === 'LRU') {
         // For memoize.
-        // Strict checks are ineffective for OLTP.
+        // Strict checks are ineffective with OLTP.
         if (entry === LRU.head) return;
         entry.affiliation = 'LFU';
       } else {
@@ -690,7 +690,7 @@ class Cache {
       return true;
     }
     this.$size += size;
-    const entry = new Entry(key, value, size, 'LRU', 'LRU', expiration);
+    const entry = new Entry(key, value, size, expiration, 'LRU', 'LRU');
     LRU.unshift(entry);
     this.dict.set(key, entry);
     if (this.expiration && this.expirations !== undefined && expiration !== Infinity) {
@@ -768,7 +768,6 @@ class Cache {
     } of this.LFU) {
       yield [key, value];
     }
-    return;
   }
 }
 exports.Cache = Cache;
@@ -843,7 +842,6 @@ class Sweeper {
   }
   isActive() {
     if (this.threshold === 0) return false;
-    if (this.prevWindowHits === 0 && this.prevWindowMisses === 0) return false;
     return this.active ??= this.ratioWindow() < (0, alias_1.max)(this.ratioRoom() * this.ratio / 100, this.threshold);
   }
   ratioWindow() {
@@ -907,6 +905,7 @@ function ratio(window, targets, remains, offset) {
   const currRatio = currTotal * 100 / window - offset;
   if (currRatio <= 0) return prevRate * 100 | 0;
   const currRate = currHits && currHits * 100 / currTotal;
+  if (prevTotal === 0) return currRate * 100 | 0;
   const prevRatio = 100 - currRatio;
   return currRate * currRatio + prevRate * prevRatio | 0;
 }
@@ -1051,21 +1050,27 @@ class Clock {
       capacity,
       refs
     } = this;
-    let hand = this.hand;
-    for (let i = hand >>> DIGIT, r = hand & MASK, len = refs.length;;) {
+    for (let {
+        hand
+      } = this, i = hand >>> DIGIT, r = hand & MASK;;) {
       const b = refs[i];
       if (b >>> r === ~0 >>> r) {
-        hand += BASE - r;
+        hand = hand + BASE - r;
         refs[i] = 0;
         r = 0;
-        if (++i === len) {
+        if (hand < capacity) {
+          ++i;
+        } else {
+          hand -= capacity;
           i = 0;
         }
         continue;
       }
       const l = search(b, r);
-      refs[i] = b & ~((1 << l) - 1 >>> r << r);
-      hand = (hand + l - r) % capacity;
+      if (l !== r) {
+        refs[i] = b & ~((1 << l) - 1 >>> r << r);
+        hand += l - r;
+      }
       this.locate(hand, key, value);
       return hand;
     }
@@ -1107,10 +1112,12 @@ class Clock {
     const v = values[index] = values[hand];
     keys[hand] = undefined;
     values[hand] = empty;
-    this.unmark(index);
-    if (index === hand || v === empty) return true;
+    if (index === hand || v === empty) {
+      this.unmark(index);
+      return true;
+    }
     dict.set(k, index);
-    refs[index >>> DIGIT] |= (refs[hand >>> DIGIT] & 1 << (hand & MASK)) === 0 ? 0 : 1 << (index & MASK);
+    (refs[hand >>> DIGIT] & 1 << (hand & MASK)) === 0 ? this.unmark(index) : this.mark(index);
     this.unmark(hand);
     return true;
   }
@@ -1118,9 +1125,10 @@ class Clock {
     this.dict = new Map();
     this.keys = [];
     this.values = [];
-    this.refs = new Uint32Array(this.refs.length);
+    this.refs.fill(0);
     this.hand = 0;
     this.$length = 0;
+    this.initial = 1;
   }
   *[Symbol.iterator]() {
     const {
@@ -1130,7 +1138,6 @@ class Clock {
     for (const index of this.dict.values()) {
       yield [keys[index], values[index]];
     }
-    return;
   }
 }
 exports.Clock = Clock;
@@ -1832,17 +1839,38 @@ Object.defineProperty(exports, "__esModule", ({
 exports.reduce = exports.memoize = void 0;
 const alias_1 = __webpack_require__(5406);
 const compare_1 = __webpack_require__(5529);
-function memoize(f, identify = (...as) => as[0], memory) {
-  if (typeof identify === 'object') return memoize(f, undefined, identify);
-  return (0, alias_1.isArray)(memory) || memory?.constructor === Object ? memoizeRecord(f, identify, memory) : memoizeDict(f, identify, memory ?? new Map());
+function memoize(f, identify, memory) {
+  if (typeof identify === 'object') {
+    memory = identify;
+    identify = undefined;
+  }
+  identify ??= (...as) => as[0];
+  switch (true) {
+    case (0, alias_1.isArray)(memory):
+      return memoizeArray(f, identify, memory);
+    case memory?.constructor === Object:
+      return memoizeObject(f, identify, memory);
+    default:
+      return memoizeDict(f, identify, memory ?? new Map());
+  }
 }
 exports.memoize = memoize;
-function memoizeRecord(f, identify, memory) {
+function memoizeArray(f, identify, memory) {
+  return (...as) => {
+    const b = identify(...as);
+    let z = memory[b];
+    if (z !== undefined) return z;
+    z = f(...as);
+    memory[b] = z;
+    return z;
+  };
+}
+function memoizeObject(f, identify, memory) {
   let nullable = false;
   return (...as) => {
     const b = identify(...as);
     let z = memory[b];
-    if (z !== undefined || nullable && memory[b] !== undefined) return z;
+    if (z !== undefined || nullable && b in memory) return z;
     z = f(...as);
     nullable ||= z === undefined;
     memory[b] = z;
@@ -1943,7 +1971,6 @@ class Queue {
     while (!this.isEmpty()) {
       yield this.pop();
     }
-    return;
   }
 }
 exports.Queue = Queue;
@@ -2026,7 +2053,6 @@ class PriorityQueue {
     while (!this.isEmpty()) {
       yield this.pop();
     }
-    return;
   }
 }
 exports.PriorityQueue = PriorityQueue;
@@ -2106,7 +2132,6 @@ class MultiQueue {
         yield [k, vs.pop()];
       }
     }
-    return;
   }
 }
 exports.MultiQueue = MultiQueue;
@@ -2122,7 +2147,7 @@ exports.MultiQueue = MultiQueue;
 Object.defineProperty(exports, "__esModule", ({
   value: true
 }));
-exports.pcg32 = exports.xorshift = exports.unique = exports.rndAf = exports.rndAP = exports.rnd0_ = exports.rnd0Z = exports.rnd0v = exports.rnd0f = exports.rnd64 = exports.rnd62 = exports.rnd32 = exports.rnd16 = void 0;
+exports.pcg32 = exports.xorshift = exports.unique = exports.rndAf = exports.rndAP = exports.rnd0_ = exports.rnd0Z = exports.rnd0z = exports.rnd0v = exports.rnd0f = exports.rnd64 = exports.rnd62 = exports.rnd36 = exports.rnd32 = exports.rnd16 = void 0;
 const bases = Object.freeze([...Array(7)].map((_, i) => 1 << i));
 const masks = Object.freeze(bases.map(radix => radix - 1));
 const dict0_ = [...[...Array(36)].map((_, i) => i.toString(36)), ...[...Array(36)].map((_, i) => i.toString(36).toUpperCase()).slice(-26), '-', '_'].join('');
@@ -2135,10 +2160,12 @@ const dictAz = [...[...Array(36)].map((_, i) => i.toString(36).toUpperCase()).sl
 
 exports.rnd16 = cons(16);
 exports.rnd32 = cons(32);
+exports.rnd36 = cons(36);
 exports.rnd62 = cons(62);
 exports.rnd64 = cons(64);
 exports.rnd0f = conv(exports.rnd16, dict0_);
 exports.rnd0v = conv(exports.rnd32, dict0_);
+exports.rnd0z = conv(exports.rnd36, dict0_);
 exports.rnd0Z = conv(exports.rnd62, dict0_);
 exports.rnd0_ = conv(exports.rnd64, dict0_);
 exports.rndAP = conv(exports.rnd16, dictAz);
@@ -2219,14 +2246,14 @@ function xorshift(seed = xorshift.seed()) {
   return () => {
     let x = seed;
     x ^= x << 13;
-    x ^= x >> 17;
+    x ^= x >>> 17;
     x ^= x << 15;
     return seed = x >>> 0;
   };
 }
 exports.xorshift = xorshift;
 (function (xorshift) {
-  const max = -1 >>> 0;
+  const max = ~0 >>> 0;
   function seed() {
     return Math.random() * max + 1 >>> 0;
   }
@@ -2334,7 +2361,6 @@ class Stack {
     while (!this.isEmpty()) {
       yield this.pop();
     }
-    return;
   }
 }
 exports.Stack = Stack;
@@ -2413,26 +2439,29 @@ Object.defineProperty(exports, "__esModule", ({
   value: true
 }));
 exports.URL = exports.ReadonlyURL = exports.standardize = void 0;
-const format_1 = __webpack_require__(137);
-var format_2 = __webpack_require__(137);
+const internal_1 = __webpack_require__(2560);
+var internal_2 = __webpack_require__(2560);
 Object.defineProperty(exports, "standardize", ({
   enumerable: true,
   get: function () {
-    return format_2.standardize;
+    return internal_2.standardize;
   }
 }));
-var format_3 = __webpack_require__(137);
+var internal_3 = __webpack_require__(2560);
 Object.defineProperty(exports, "ReadonlyURL", ({
   enumerable: true,
   get: function () {
-    return format_3.ReadonlyURL;
+    return internal_3.ReadonlyURL;
   }
 }));
 class URL {
   constructor(source, base) {
+    source = source.trim();
+    base = base?.trim();
+    this.url = new internal_1.ReadonlyURL(source, base);
+    this.params = undefined;
     this.source = source;
     this.base = base;
-    this.url = new format_1.ReadonlyURL(source, base);
 
     //assert(this.href.startsWith(this.resource));
   }
@@ -2447,7 +2476,7 @@ class URL {
     return this.url.origin;
   }
   get scheme() {
-    return this.url.protocol.slice(0, -1);
+    return this.url.scheme;
   }
   get protocol() {
     return this.url.protocol;
@@ -2489,17 +2518,17 @@ class URL {
     return this.params ??= new URLSearchParams(this.search);
   }
   toString() {
-    return this.href;
+    return this.url.toString();
   }
   toJSON() {
-    return this.href;
+    return this.url.toJSON();
   }
 }
 exports.URL = URL;
 
 /***/ }),
 
-/***/ 137:
+/***/ 2560:
 /***/ ((__unused_webpack_module, exports, __webpack_require__) => {
 
 "use strict";
@@ -2508,28 +2537,37 @@ exports.URL = URL;
 Object.defineProperty(exports, "__esModule", ({
   value: true
 }));
-exports.ReadonlyURL = exports._encode = exports.standardize = void 0;
+exports.ReadonlyURL = exports.encode = exports.standardize = void 0;
 __webpack_require__(4128);
 const memoize_1 = __webpack_require__(1808);
 const cache_1 = __webpack_require__(9210);
 function standardize(url, base) {
-  const u = new ReadonlyURL(url, base);
-  url = u.origin === 'null' ? u.protocol.toLowerCase() + u.href.slice(u.protocol.length) : u.origin.toLowerCase() + u.href.slice(u.origin.length);
+  const {
+    origin,
+    protocol,
+    href
+  } = new ReadonlyURL(url, base);
+  url = origin === 'null' ? protocol.toLowerCase() + href.slice(protocol.length) : origin.toLowerCase() + href.slice(origin.length);
   return encode(url);
 }
 exports.standardize = standardize;
 function encode(url) {
-  return url
-  // Percent-encoding
-  .replace(/[\uD800-\uDBFF][\uDC00-\uDFFF]?|[\uDC00-\uDFFF]/g, str => str.length === 2 ? str : '').replace(/%(?![0-9A-F]{2})|[^%\[\]]+/ig, encodeURI).replace(/\?[^#]+/, query => '?' + query.slice(1).replace(/%[0-9A-F]{2}|%|[^=&]+/ig, str => str[0] === '%' && str.length === 3 ? str : encodeURIComponent(str)))
-  // Use uppercase letters within percent-encoding triplets
-  .replace(/%[0-9A-F]{2}/ig, str => str.toUpperCase()).replace(/#.+/, url.slice(url.indexOf('#')));
-}
-exports._encode = encode;
+  url = url.replace(/[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?<![\uD800-\uDBFF])[\uDC00-\uDFFF]/g, '');
+  const {
+    1: base,
+    2: hash
+  } = url.match(/^([^#]*)(.*)$/s);
+  const {
+    1: path,
+    2: query
+  } = base.replace(/(?:%(?:[0-9][a-f]|[a-f][0-9a-fA-F]|[A-F][0-9a-f]))+/g, str => str.toUpperCase()).match(/^([^?]*)(.*)$/s);
+  return '' + path.replace(/(?:[^%[\]]|%(?![0-9A-F]{2}))+/ig, encodeURI) + query.replace(/(?!^)(?:[^%=&]|%(?![0-9A-F]{2}))+/ig, encodeURIComponent) + hash;
+}
+exports.encode = encode;
 class ReadonlyURL {
   constructor(source, base) {
-    this.source = source;
-    this.base = base;
+    source = source.trim();
+    base = base?.trim();
     switch (source.slice(0, source.lastIndexOf('://', 9) + 1).toLowerCase()) {
       case 'http:':
       case 'https:':
@@ -2544,60 +2582,66 @@ class ReadonlyURL {
               base = base.slice(0, i);
             }
             const j = base.indexOf('?');
-            if (i > -1 && source.indexOf('#') === -1) {
+            if (j > -1 && source !== '' && source[0] !== '#') {
               base = base.slice(0, j);
             }
         }
     }
-    this.share = ReadonlyURL.get(source, base);
+    this.cache = ReadonlyURL.get(source, base);
+    this.params = undefined;
+    this.source = source;
+    this.base = base;
   }
   get href() {
-    return this.share.href ??= this.share.url.href;
+    return this.cache.href ??= this.cache.url.href;
   }
   get resource() {
-    return this.share.resource ??= this.href.slice(0, -this.fragment.length - this.query.length || this.href.length) + this.search;
+    return this.cache.resource ??= this.href.slice(0, this.href.search(/[?#]|$/)) + this.search;
   }
   get origin() {
-    return this.share.origin ??= this.share.url.origin;
+    return this.cache.origin ??= this.cache.url.origin;
+  }
+  get scheme() {
+    return this.cache.scheme ??= this.protocol.slice(0, -1);
   }
   get protocol() {
-    return this.share.protocol ??= this.share.url.protocol;
+    return this.cache.protocol ??= this.cache.url.protocol;
   }
   get username() {
-    return this.share.username ??= this.share.url.username;
+    return this.cache.username ??= this.cache.url.username;
   }
   get password() {
-    return this.share.password ??= this.share.url.password;
+    return this.cache.password ??= this.cache.url.password;
   }
   get host() {
-    return this.share.host ??= this.share.url.host;
+    return this.cache.host ??= this.cache.url.host;
   }
   get hostname() {
-    return this.share.hostname ??= this.share.url.hostname;
+    return this.cache.hostname ??= this.cache.url.hostname;
   }
   get port() {
-    return this.share.port ??= this.share.url.port;
+    return this.cache.port ??= this.cache.url.port;
   }
   get path() {
-    return this.share.path ??= `${this.pathname}${this.search}`;
+    return this.cache.path ??= `${this.pathname}${this.search}`;
   }
   get pathname() {
-    return this.share.pathname ??= this.share.url.pathname;
+    return this.cache.pathname ??= this.cache.url.pathname;
   }
   get search() {
-    return this.share.search ??= this.share.url.search;
+    return this.cache.search ??= this.cache.url.search;
   }
   get query() {
-    return this.share.query ??= this.search || this.href[this.href.length - this.fragment.length - 1] === '?' && '?' || '';
+    return this.cache.query ??= this.search || this.href[this.href.length - this.fragment.length - 1] === '?' && '?' || '';
   }
   get hash() {
-    return this.share.hash ??= this.share.url.hash;
+    return this.cache.hash ??= this.cache.url.hash;
   }
   get fragment() {
-    return this.share.fragment ??= this.hash || this.href[this.href.length - 1] === '#' && '#' || '';
+    return this.cache.fragment ??= this.hash || this.href[this.href.length - 1] === '#' && '#' || '';
   }
   get searchParams() {
-    return this.params ??= new URLSearchParams(this.search);
+    return this.params ??= new ReadonlyURLSearchParams(this.search);
   }
   toString() {
     return this.href;
@@ -2614,6 +2658,26 @@ exports.ReadonlyURL = ReadonlyURL;
 ReadonlyURL.get = (0, memoize_1.memoize)((url, base) => ({
   url: new __webpack_require__.g.URL(url, base)
 }), (url, base = '') => `${base.indexOf('\n') > -1 ? base.replace(/\n+/g, '') : base}\n${url}`, new cache_1.Cache(10000));
+class ReadonlyURLSearchParams extends URLSearchParams {
+  append(name, value) {
+    this.sort();
+    name;
+    value;
+  }
+  delete(name, value) {
+    this.sort();
+    name;
+    value;
+  }
+  set(name, value) {
+    this.sort();
+    name;
+    value;
+  }
+  sort() {
+    throw new Error('Spica: URL: Cannot use mutable methods with ReadonlyURLSearchParams');
+  }
+}
 
 /***/ }),
 
@@ -4159,11 +4223,12 @@ Object.defineProperty(exports, "__esModule", ({
 }));
 exports.caches = void 0;
 const cache_1 = __webpack_require__(9210);
+const clock_1 = __webpack_require__(7681);
 // For rerendering in editing.
 exports.caches = {
-  code: new cache_1.Cache(1000),
-  math: new cache_1.Cache(10000),
-  media: new cache_1.Cache(100)
+  code: new clock_1.Clock(1000),
+  math: new cache_1.Cache(1000),
+  media: new clock_1.Clock(100)
 };
 
 /***/ }),
@@ -7310,31 +7375,31 @@ function build(syntax, marker, splitter = '') {
       }
     }
   };
-  function* proc(defs, note) {
-    const {
-      children
-    } = note;
-    const size = defs.size;
-    let count = 0;
-    let length = children.length;
-    I: for (const [key, def] of defs) {
-      defs.delete(key);
-      ++count;
-      while (length > size) {
-        const node = children[count - 1];
-        if (equal(node, def)) continue I;
-        yield note.removeChild(node);
-        --length;
-      }
-      const node = count <= length ? children[count - 1] : null;
-      if (node && equal(node, def)) continue;
-      yield note.insertBefore(def, node);
-      ++length;
-    }
+}
+function* proc(defs, note) {
+  const {
+    children
+  } = note;
+  const size = defs.size;
+  let count = 0;
+  let length = children.length;
+  I: for (const [key, def] of defs) {
+    defs.delete(key);
+    ++count;
     while (length > size) {
-      yield note.removeChild(children[size]);
+      const node = children[count - 1];
+      if (equal(node, def)) continue I;
+      yield note.removeChild(node);
       --length;
     }
+    const node = count <= length ? children[count - 1] : null;
+    if (node && equal(node, def)) continue;
+    yield note.insertBefore(def, node);
+    ++length;
+  }
+  while (length > size) {
+    yield note.removeChild(children[size]);
+    --length;
   }
 }
 function equal(a, b) {
@@ -8530,7 +8595,7 @@ function unlink(h) {
 /***/ 3252:
 /***/ (function(module) {
 
-/*! typed-dom v0.0.336 https://github.com/falsandtru/typed-dom | (c) 2016, falsandtru | (Apache-2.0 AND MPL-2.0) License */
+/*! typed-dom v0.0.348 https://github.com/falsandtru/typed-dom | (c) 2016, falsandtru | (Apache-2.0 AND MPL-2.0) License */
 (function webpackUniversalModuleDefinition(root, factory) {
 	if(true)
 		module.exports = factory();
@@ -8590,17 +8655,38 @@ Object.defineProperty(exports, "__esModule", ({
 exports.reduce = exports.memoize = void 0;
 const alias_1 = __nested_webpack_require_3150__(5406);
 const compare_1 = __nested_webpack_require_3150__(5529);
-function memoize(f, identify = (...as) => as[0], memory) {
-  if (typeof identify === 'object') return memoize(f, undefined, identify);
-  return (0, alias_1.isArray)(memory) || memory?.constructor === Object ? memoizeRecord(f, identify, memory) : memoizeDict(f, identify, memory ?? new Map());
+function memoize(f, identify, memory) {
+  if (typeof identify === 'object') {
+    memory = identify;
+    identify = undefined;
+  }
+  identify ??= (...as) => as[0];
+  switch (true) {
+    case (0, alias_1.isArray)(memory):
+      return memoizeArray(f, identify, memory);
+    case memory?.constructor === Object:
+      return memoizeObject(f, identify, memory);
+    default:
+      return memoizeDict(f, identify, memory ?? new Map());
+  }
 }
 exports.memoize = memoize;
-function memoizeRecord(f, identify, memory) {
+function memoizeArray(f, identify, memory) {
+  return (...as) => {
+    const b = identify(...as);
+    let z = memory[b];
+    if (z !== undefined) return z;
+    z = f(...as);
+    memory[b] = z;
+    return z;
+  };
+}
+function memoizeObject(f, identify, memory) {
   let nullable = false;
   return (...as) => {
     const b = identify(...as);
     let z = memory[b];
-    if (z !== undefined || nullable && memory[b] !== undefined) return z;
+    if (z !== undefined || nullable && b in memory) return z;
     z = f(...as);
     nullable ||= z === undefined;
     memory[b] = z;
@@ -8636,7 +8722,7 @@ exports.reduce = reduce;
 /***/ }),
 
 /***/ 7521:
-/***/ ((__unused_webpack_module, exports, __nested_webpack_require_4668__) => {
+/***/ ((__unused_webpack_module, exports, __nested_webpack_require_5013__) => {
 
 
 
@@ -8644,10 +8730,11 @@ Object.defineProperty(exports, "__esModule", ({
   value: true
 }));
 exports.defrag = exports.prepend = exports.append = exports.isChildren = exports.define = exports.element = exports.text = exports.math = exports.svg = exports.html = exports.frag = exports.shadow = void 0;
-const alias_1 = __nested_webpack_require_4668__(5406);
-const memoize_1 = __nested_webpack_require_4668__(1808);
+const alias_1 = __nested_webpack_require_5013__(5406);
+const memoize_1 = __nested_webpack_require_5013__(1808);
 var caches;
 (function (caches) {
+  // Closed only.
   caches.shadows = new WeakMap();
   caches.shadow = (0, memoize_1.memoize)((el, opts) => el.attachShadow(opts), caches.shadows);
   caches.fragment = document.createDocumentFragment();
@@ -8659,7 +8746,7 @@ function shadow(el, opts, children, factory = exports.html) {
   if (isChildren(opts)) return shadow(el, undefined, opts, factory);
   return defineChildren(!opts ? el.shadowRoot ?? caches.shadows.get(el) ?? el.attachShadow({
     mode: 'open'
-  }) : opts.mode === 'open' ? el.shadowRoot ?? el.attachShadow(opts) : caches.shadows.get(el) ?? caches.shadow(el, opts), children);
+  }) : opts.mode === 'open' ? el.shadowRoot ?? el.attachShadow(opts) : caches.shadow(el, opts), children);
 }
 exports.shadow = shadow;
 function frag(children) {
@@ -8680,7 +8767,7 @@ function element(context, ns) {
 }
 exports.element = element;
 function elem(context, ns, tag, attrs) {
-  if (!('createElement' in context)) throw new Error(`TypedDOM: Scoped custom elements are not supported on this browser`);
+  if (!('createElement' in context)) throw new Error(`Typed-DOM: Scoped custom elements are not supported on this browser`);
   const opts = 'is' in attrs ? {
     is: attrs['is']
   } : undefined;
@@ -8731,10 +8818,10 @@ function defineAttrs(el, attrs) {
         }
         continue;
       case 'function':
-        if (name.length < 3) throw new Error(`TypedDOM: Attribute names for event listeners must have an event name but got "${name}"`);
+        if (name.length < 3) throw new Error(`Typed-DOM: Attribute names for event listeners must have an event name but got "${name}"`);
         const names = name.split(/\s+/);
         for (const name of names) {
-          if (!name.startsWith('on')) throw new Error(`TypedDOM: Attribute names for event listeners must start with "on" but got "${name}"`);
+          if (!name.startsWith('on')) throw new Error(`Typed-DOM: Attribute names for event listeners must start with "on" but got "${name}"`);
           const type = name.slice(2).toLowerCase();
           el.addEventListener(type, value, {
             passive: ['wheel', 'mousewheel', 'touchstart', 'touchmove', 'touchend', 'touchcancel'].includes(type)
@@ -8766,7 +8853,7 @@ function defineChildren(node, children) {
   if (children === undefined) return node;
   if (typeof children === 'string') {
     node.textContent = children;
-  } else if ((0, alias_1.isArray)(children) && !node.firstChild) {
+  } else if (((0, alias_1.isArray)(children) || !(Symbol.iterator in children)) && !node.firstChild) {
     for (let i = 0; i < children.length; ++i) {
       const child = children[i];
       typeof child === 'object' ? node.appendChild(child) : node.append(child);
@@ -8784,6 +8871,11 @@ function append(node, children) {
   if (children === undefined) return node;
   if (typeof children === 'string') {
     node.append(children);
+  } else if ((0, alias_1.isArray)(children) || !(Symbol.iterator in children)) {
+    for (let i = 0; i < children.length; ++i) {
+      const child = children[i];
+      typeof child === 'object' ? node.appendChild(child) : node.append(child);
+    }
   } else {
     for (const child of children) {
       typeof child === 'object' ? node.appendChild(child) : node.append(child);
@@ -8796,6 +8888,11 @@ function prepend(node, children) {
   if (children === undefined) return node;
   if (typeof children === 'string') {
     node.prepend(children);
+  } else if ((0, alias_1.isArray)(children) || !(Symbol.iterator in children)) {
+    for (let i = 0; i < children.length; ++i) {
+      const child = children[i];
+      typeof child === 'object' ? node.insertBefore(child, null) : node.prepend(child);
+    }
   } else {
     for (const child of children) {
       typeof child === 'object' ? node.insertBefore(child, null) : node.prepend(child);
@@ -8829,7 +8926,7 @@ exports.defrag = defrag;
 /******/ 	var __webpack_module_cache__ = {};
 /******/ 	
 /******/ 	// The require function
-/******/ 	function __nested_webpack_require_11654__(moduleId) {
+/******/ 	function __nested_webpack_require_12534__(moduleId) {
 /******/ 		// Check if module is in cache
 /******/ 		var cachedModule = __webpack_module_cache__[moduleId];
 /******/ 		if (cachedModule !== undefined) {
@@ -8843,7 +8940,7 @@ exports.defrag = defrag;
 /******/ 		};
 /******/ 	
 /******/ 		// Execute the module function
-/******/ 		__webpack_modules__[moduleId](module, module.exports, __nested_webpack_require_11654__);
+/******/ 		__webpack_modules__[moduleId](module, module.exports, __nested_webpack_require_12534__);
 /******/ 	
 /******/ 		// Return the exports of the module
 /******/ 		return module.exports;
@@ -8854,7 +8951,7 @@ exports.defrag = defrag;
 /******/ 	// startup
 /******/ 	// Load entry module and return exports
 /******/ 	// This entry module is referenced by other modules so it can't be inlined
-/******/ 	var __nested_webpack_exports__ = __nested_webpack_require_11654__(7521);
+/******/ 	var __nested_webpack_exports__ = __nested_webpack_require_12534__(7521);
 /******/ 	
 /******/ 	return __nested_webpack_exports__;
 /******/ })()
@@ -8866,7 +8963,7 @@ exports.defrag = defrag;
 /***/ 6120:
 /***/ (function(module) {
 
-/*! typed-dom v0.0.336 https://github.com/falsandtru/typed-dom | (c) 2016, falsandtru | (Apache-2.0 AND MPL-2.0) License */
+/*! typed-dom v0.0.348 https://github.com/falsandtru/typed-dom | (c) 2016, falsandtru | (Apache-2.0 AND MPL-2.0) License */
 (function webpackUniversalModuleDefinition(root, factory) {
 	if(true)
 		module.exports = factory();

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "securemark",
-  "version": "0.280.7",
+  "version": "0.280.8",
   "description": "Secure markdown renderer working on browsers for user input data.",
   "private": false,
   "homepage": "https://github.com/falsandtru/securemark",
@@ -27,37 +27,39 @@
     "NOTICE",
     "LICENSE"
   ],
+  "dependencies": {
+    "spica": "0.0.761"
+  },
   "devDependencies": {
-    "@types/dompurify": "3.0.2",
-    "@types/jquery": "3.5.16",
-    "@types/mathjax": "0.0.37",
-    "@types/mocha": "10.0.1",
-    "@types/power-assert": "1.5.8",
-    "@types/prismjs": "1.26.0",
-    "@typescript-eslint/parser": "^5.59.9",
-    "babel-loader": "^9.1.2",
+    "@types/dompurify": "3.0.4",
+    "@types/jquery": "3.5.26",
+    "@types/mathjax": "0.0.39",
+    "@types/mocha": "10.0.3",
+    "@types/power-assert": "1.5.10",
+    "@types/prismjs": "1.26.2",
+    "@typescript-eslint/parser": "^6.10.0",
+    "babel-loader": "^9.1.3",
     "babel-plugin-unassert": "^3.2.0",
-    "concurrently": "^8.1.0",
-    "eslint": "^8.42.0",
+    "concurrently": "^8.2.2",
+    "eslint": "^8.53.0",
     "eslint-plugin-redos": "^4.4.5",
     "eslint-webpack-plugin": "^4.0.1",
-    "glob": "^10.2.7",
+    "glob": "^10.3.10",
     "karma": "^6.4.2",
     "karma-chrome-launcher": "^3.2.0",
-    "karma-coverage": "^2.2.0",
+    "karma-coverage": "^2.2.1",
     "karma-firefox-launcher": "^2.1.2",
     "karma-mocha": "^2.0.1",
     "karma-power-assert": "^1.0.0",
     "mocha": "^10.2.0",
-    "npm-check-updates": "^16.10.12",
-    "semver": "^7.5.1",
-    "spica": "0.0.732",
-    "ts-loader": "^9.4.3",
-    "typed-dom": "0.0.336",
-    "typescript": "5.1.3",
-    "webpack": "^5.85.1",
-    "webpack-cli": "^5.1.3",
-    "webpack-merge": "^5.9.0"
+    "npm-check-updates": "^16.14.6",
+    "semver": "^7.5.4",
+    "ts-loader": "^9.5.0",
+    "typed-dom": "0.0.348",
+    "typescript": "5.2.2",
+    "webpack": "^5.89.0",
+    "webpack-cli": "^5.1.4",
+    "webpack-merge": "^5.10.0"
   },
   "scripts": {
     "update": "ncu -u && npm i --no-shrinkwrap && bundle update",

package/src/parser/api/cache.ts

@@ -1,10 +1,11 @@
 import { Caches } from '../../..';
 import { Cache } from 'spica/cache';
+import { Clock } from 'spica/clock';
 
 // For rerendering in editing.
 
 export const caches: Caches = {
-  code: new Cache<string, HTMLElement>(1000),
-  math: new Cache<string, HTMLElement>(10000),
-  media: new Cache<string, HTMLElement>(100),
+  code: new Clock<string, HTMLElement>(1000),
+  math: new Cache<string, HTMLElement>(1000),
+  media: new Clock<string, HTMLElement>(100),
 } as const;

package/src/parser/processor/note.ts

@@ -180,37 +180,37 @@ function build(
       }
     }
   }
+}
 
-  function* proc(defs: Map<string, HTMLLIElement>, note: HTMLOListElement): Generator<HTMLLIElement | undefined, undefined, undefined> {
-    const { children } = note;
-    const size = defs.size;
-    let count = 0;
-    let length = children.length;
-    I:
-    for (const [key, def] of defs) {
-      defs.delete(key);
-      ++count;
-      while (length > size) {
-        const node = children[count - 1] as HTMLLIElement;
-        if (equal(node, def)) continue I;
-        yield note.removeChild(node);
-        --length;
-        assert(children.length === length);
-      }
-      const node = count <= length
-        ? children[count - 1]
-        : null;
-      if (node && equal(node, def)) continue;
-      assert(def.parentNode !== note);
-      yield note.insertBefore(def, node);
-      ++length;
-      assert(children.length === length);
-    }
+function* proc(defs: Map<string, HTMLLIElement>, note: HTMLOListElement): Generator<HTMLLIElement | undefined, undefined, undefined> {
+  const { children } = note;
+  const size = defs.size;
+  let count = 0;
+  let length = children.length;
+  I:
+  for (const [key, def] of defs) {
+    defs.delete(key);
+    ++count;
     while (length > size) {
-      yield note.removeChild(children[size] as HTMLLIElement);
+      const node = children[count - 1] as HTMLLIElement;
+      if (equal(node, def)) continue I;
+      yield note.removeChild(node);
       --length;
       assert(children.length === length);
     }
+    const node = count <= length
+      ? children[count - 1]
+      : null;
+    if (node && equal(node, def)) continue;
+    assert(def.parentNode !== note);
+    yield note.insertBefore(def, node);
+    ++length;
+    assert(children.length === length);
+  }
+  while (length > size) {
+    yield note.removeChild(children[size] as HTMLLIElement);
+    --length;
+    assert(children.length === length);
   }
 }