securemark 0.300.2 → 0.300.4

package/CHANGELOG.md

@@ -1,5 +1,13 @@
 # Changelog
 
+## 0.300.4
+
+- Refactoring.
+
+## 0.300.3
+
+- Refactoring.
+
 ## 0.300.2
 
 - Refactoring.

package/dist/index.js

@@ -1,4 +1,4 @@
-/*! securemark v0.300.2 https://github.com/falsandtru/securemark | (c) 2017, falsandtru | UNLICENSED License */
+/*! securemark v0.300.4 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"));
@@ -2528,8 +2528,7 @@ function bind(target, settings) {
     };
     for (const el of (0, figure_1.figure)(next(0)?.parentNode ?? target, settings.notes, options)) {
       el ? yield {
-        type: 'figure',
-        value: el
+        type: 'figure'
       } : yield {
         type: 'break',
         value: 'figure'
@@ -6355,7 +6354,7 @@ class Input extends parser_1.Input {
     this.resources ??= {
       clock: -1,
       interval: 200,
-      recursions: [10 || 0 /* Recursion.document */, 100 || 0 /* Recursion.block */, 100 || 0 /* Recursion.inline */, 100 || 0 /* Recursion.bracket */]
+      recursions: [20 || 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;
@@ -6413,29 +6412,37 @@ exports.document = (() => {
   const loop = (0, parser_2.build)(segment_1.parser, block_1.block);
   return (0, combinator_1.always)([(input, output) => {
     input.id = input.id === '' ? '' : input.local ? (0, util_1.randomID)() : input.id;
-    input.memory = input.notes ?? {
-      interpolation: true,
-      references: (0, dom_1.html)('ol', {
+    input.memory = {
+      interpolation: !input.notes,
+      references: input.notes?.references ?? (0, dom_1.html)('ol', {
         class: 'references'
       })
     };
     output.push();
     return output.context;
   }, (0, combinator_1.recursion)(0 /* Recursion.document */, (0, combinator_1.force)(() => loop)), (input, output) => {
-    const doc = (0, dom_1.frag)((0, util_1.unwrap)(output.pop()));
+    const {
+      memory
+    } = input;
+    const doc = memory.doc = (0, dom_1.frag)((0, util_1.unwrap)(output.pop()));
     output.append(new parser_1.Node(doc));
-    if (input.test && !input.local) return output.context;
+    if (input.test && !input.local) return parser_1.Result.skip;
+    memory.orphan = !memory.references.parentNode;
+    memory.orphan && doc.appendChild(memory.references);
+    return output.context;
+  }, input => conv((0, figure_1.figure)(input.memory.doc, input.memory, input)), input => conv((0, note_1.note)(input.memory.doc, input.memory, input)), (input, output) => {
     const {
       memory
     } = input;
-    const orphan = !memory.references.parentNode;
-    orphan && doc.appendChild(memory.references);
-    for (const _ of (0, figure_1.figure)(doc, memory, input));
-    for (const _ of (0, note_1.note)(doc, memory, input));
-    orphan && !memory.interpolation && memory.references.remove();
+    memory.orphan && !memory.interpolation && memory.references.remove();
     return output.context;
   }]);
 })();
+function conv(iterable) {
+  const iter = iterable[Symbol.iterator]();
+  const cont = [(_, output) => iter.next().done ? output.context : cont];
+  return cont;
+}
 
 /***/ },
 
@@ -8569,6 +8576,7 @@ function repeat(opener, after, closer, recursion, parser, cons, termination = (n
     const {
       source,
       position,
+      linebreak,
       resources: {
         recursions
       }
@@ -8581,16 +8589,18 @@ function repeat(opener, after, closer, recursion, parser, cons, termination = (n
       input.position = position;
       return parser_1.Result.skip;
     }
-    let depth = i / opener.length + 1 | 0;
+    const depth = i / opener.length + 1 | 0;
     (0, combinator_1.recur)(output, recursions, recursion, depth, true);
     input.memory = {
       position,
+      linebreak,
       i,
       lead: 0,
       follow: 0,
       state: false,
       depth
     };
+    input.linebreak = 0;
     output.push();
     return loop;
   }, (input, output) => {
@@ -8603,6 +8613,7 @@ function repeat(opener, after, closer, recursion, parser, cons, termination = (n
     } = input;
     (0, combinator_1.recur)(output, recursions, recursion, -m.depth);
     m.depth = 0;
+    input.linebreak ||= m.linebreak;
     const prefix = m.i;
     m.i = 0;
     for (let len = (0, alias_1.min)(prefix, source.length - input.position); m.i < len && source[input.position + m.i] === closer[0];) {
@@ -8633,6 +8644,7 @@ function repeat(opener, after, closer, recursion, parser, cons, termination = (n
           const advance = input.position - pos;
           m.i -= advance;
           m.follow -= advance;
+          (0, combinator_1.recur)(output, recursions, recursion, -(advance / closer.length | 0));
           m.depth -= advance / closer.length | 0;
         }
         continue;
@@ -8643,7 +8655,10 @@ function repeat(opener, after, closer, recursion, parser, cons, termination = (n
   }, parser, (input, output) => {
     const {
       source,
-      memory: m
+      memory: m,
+      resources: {
+        recursions
+      }
     } = input;
     const {
       lead
@@ -8671,6 +8686,7 @@ function repeat(opener, after, closer, recursion, parser, cons, termination = (n
           const advance = input.position - pos;
           m.i -= advance;
           m.follow -= advance;
+          (0, combinator_1.recur)(output, recursions, recursion, -(advance / closer.length | 0));
           m.depth -= advance / closer.length | 0;
         }
         m.i -= opener.length, m.follow -= closer.length;
@@ -9637,7 +9653,7 @@ function* figure(target, notes, opts = {}) {
   let base = '0';
   let bases = base.split('.');
   for (let defs = target instanceof Element ? target.querySelectorAll(`:scope > ${selector}`) : target.querySelectorAll(`:not(* > *)${selector}`), len = defs.length, i = 0; i < len; ++i) {
-    yield;
+    if (~i << 32 - 8 === 0) yield;
     const def = defs[i];
     const {
       tagName
@@ -9710,7 +9726,7 @@ function* figure(target, notes, opts = {}) {
         (0, util_1.unmarkInvalid)(ref);
       }
       if (ref.hash.slice(1) === def.id && ref.innerText === figindex) continue;
-      yield (0, dom_1.define)(ref, {
+      (0, dom_1.define)(ref, {
         class: opts.local ? `${ref.className} local` : undefined,
         href: opts.id !== '' ? `#${def.id}` : undefined
       }, figindex);
@@ -9720,7 +9736,6 @@ function* figure(target, notes, opts = {}) {
     if (opts.id !== '' && !ref.classList.contains('invalid')) {
       (0, util_1.markInvalid)(ref, 'label', 'reference', messages.reference);
     }
-    yield ref;
   }
 }
 exports.figure = figure;
@@ -9812,14 +9827,17 @@ function build(syntax, list, selector, marker, splitter = '') {
     let format;
     let refIndex = 0;
     for (let len = refs.length, i = 0; i < len; ++i) {
+      if (~i << 32 - 8 === 0) yield;
       const ref = refs[i];
       if (splitter) for (let splitter; splitter = splitters[iSplitters]; ++iSplitters) {
         const pos = splitter?.compareDocumentPosition(ref) ?? 0;
         if (pos & (Node.DOCUMENT_POSITION_PRECEDING | Node.DOCUMENT_POSITION_DISCONNECTED)) break;
         if (~iSplitters << 32 - 8 === 0) yield;
         if (splitter.classList.contains(list) && splitter.nextElementSibling !== splitters[iSplitters + 1]) {
-          yield* proc(splitter);
-          splitter.remove();
+          const note = splitter;
+          proc(note);
+          note.remove();
+          yield note;
           continue;
         }
         if (defs.size > 0) {
@@ -9827,7 +9845,8 @@ function build(syntax, list, selector, marker, splitter = '') {
           const note = splitter.classList.contains(list) ? splitter : target.insertBefore((0, dom_1.html)('ol', {
             class: list
           }), splitter);
-          yield* proc(note, defs);
+          proc(note, defs);
+          yield note;
         }
       }
       const {
@@ -9889,31 +9908,33 @@ function build(syntax, list, selector, marker, splitter = '') {
         href: refId && `#${refId}`,
         title: abbr && text || undefined
       }, `^${++refIndex}`));
-      yield;
     }
     if (note || defs.size > 0) {
       const splitter = splitters[iSplitters++];
       note ??= splitter?.classList.contains(list) ? splitter : target.insertBefore((0, dom_1.html)('ol', {
         class: list
       }), splitter ?? bottom);
-      yield* proc(note, defs);
+      proc(note, defs);
+      yield note;
     }
     if (splitter) for (let splitter; splitter = splitters[iSplitters]; ++iSplitters) {
       if (~iSplitters << 32 - 8 === 0) yield;
       if (splitter.classList.contains(list)) {
-        yield* proc(splitter);
+        const note = splitter;
+        proc(note);
         splitter.remove();
+        yield note;
       }
     }
   };
 }
-function* proc(note, defs) {
+function proc(note, defs) {
   for (let defs = note.children, i = defs.length; i--;) {
-    yield note.removeChild(defs[i]);
+    note.removeChild(defs[i]);
   }
   if (!defs) return;
   for (const [, def] of defs) {
-    yield note.appendChild(def);
+    note.appendChild(def);
   }
   defs.clear();
 }

package/index.d.ts

@@ -42,8 +42,8 @@ export interface ParserSettings {
 export type Progress =
   | { readonly type: 'segment'; readonly value: string; }
   | { readonly type: 'block'; readonly value: HTMLElement; }
-  | { readonly type: 'figure'; readonly value: HTMLAnchorElement; }
-  | { readonly type: 'note'; readonly value: HTMLLIElement | HTMLElement; }
+  | { readonly type: 'figure'; }
+  | { readonly type: 'note'; readonly value: HTMLOListElement; }
   | { readonly type: 'break'; readonly value: 'segment' | 'block' | 'parser' | 'figure' | 'note'; }
   | { readonly type: 'cancel'; };
 

package/package.json

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

package/src/api/bind.test.ts

@@ -10,8 +10,10 @@ describe('Unit: api/bind', () => {
         const result = iter.next();
         if (result.done) break;
         switch (result.value.type) {
-          case 'break':
           case 'segment':
+          case 'figure':
+          case 'note':
+          case 'break':
             --i;
             continue;
           case 'block':

package/src/api/bind.ts

@@ -129,7 +129,7 @@ export function bind(target: DocumentFragment | HTMLElement | ShadowRoot, settin
     for (const el of figure(next(0)?.parentNode ?? target, settings.notes, options)) {
       assert(rev === revision);
       el
-        ? yield { type: 'figure', value: el }
+        ? yield { type: 'figure' }
         : yield { type: 'break', value: 'figure' };
       if (rev !== revision) return yield { type: 'cancel' };
     }

package/src/parser/context.ts

@@ -28,7 +28,7 @@ export class Input<M extends object = object> extends Ipt<M> {
       clock: -1,
       interval: 200,
       recursions: [
-        10 || Recursion.document,
+        20 || Recursion.document,
         100 || Recursion.block,
         100 || Recursion.inline,
         100 || Recursion.bracket,

package/src/parser/document.ts

@@ -1,6 +1,6 @@
 import { MarkdownParser } from '../../markdown';
 import { Input, Recursion } from './context';
-import { Parser, Node } from '../combinator/parser';
+import { Parser, Result, Node } from '../combinator/parser';
 import { always, force, recursion } from '../combinator';
 import { build } from './parser';
 import { parser as segment } from './segment';
@@ -12,8 +12,10 @@ import { frag, html } from 'typed-dom/dom';
 
 export const document: MarkdownParser = (() => {
   interface Memory {
-    readonly interpolation?: boolean;
+    readonly interpolation: boolean;
     readonly references: HTMLOListElement;
+    doc?: DocumentFragment;
+    orphan?: boolean;
   }
   const loop = build(segment, block);
   return always<Parser<DocumentFragment | HTMLElement, Input<Memory>>>([
@@ -22,9 +24,9 @@ export const document: MarkdownParser = (() => {
         input.id === '' ? '' :
         input.local ? randomID() :
         input.id;
-      input.memory = input.notes ?? {
-        interpolation: true,
-        references: html('ol', { class: 'references' }),
+      input.memory = {
+        interpolation: !input.notes,
+        references: input.notes?.references ?? html('ol', { class: 'references' }),
       };
       output.push();
       return output.context;
@@ -32,17 +34,34 @@ export const document: MarkdownParser = (() => {
     recursion(Recursion.document, force(() => loop)),
     (input, output) => {
       assert(input.position === input.source.length);
-      const doc = frag(unwrap(output.pop()));
+      const { memory } = input;
+      const doc = memory.doc = frag(unwrap(output.pop()));
       output.append(new Node(doc));
       assert(input.id !== '' || !doc.querySelector('[id], .index[href], .label[href], .annotation > a[href], .reference > a[href]'));
-      if (input.test && !input.local) return output.context;
+      if (input.test && !input.local) return Result.skip;
+      memory.orphan = !memory.references.parentNode;
+      memory.orphan && doc.appendChild(memory.references);
+      return output.context;
+    },
+    input =>
+      conv(figure(input.memory.doc!, input.memory, input)),
+    input =>
+      conv(note(input.memory.doc!, input.memory, input)),
+    (input, output) => {
       const { memory } = input;
-      const orphan = !memory.references.parentNode;
-      orphan && doc.appendChild(memory.references);
-      for (const _ of figure(doc, memory, input));
-      for (const _ of note(doc, memory, input));
-      orphan && !memory.interpolation && memory.references.remove();
+      memory.orphan && !memory.interpolation && memory.references.remove();
       return output.context;
     },
   ]);
 })();
+
+function conv<T>(iterable: Iterable<T>): Result<never> {
+  const iter = iterable[Symbol.iterator]();
+  const cont: Result<T> = [
+    (_, output) =>
+      iter.next().done
+        ? output.context
+        : cont,
+  ];
+  return cont;
+}

package/src/parser/inline.test.ts

@@ -142,6 +142,7 @@ describe('Unit: parser/inline', () => {
       assert.deepStrictEqual(inspect(parser, input('(([:a\n]')), [['<span class="bracket">(<span class="bracket">(<span class="invalid">[:a\n]</span></span></span>'], '']);
       assert.deepStrictEqual(inspect(parser, input('(({{\n}}')), [['<span class="bracket">(<span class="bracket">(<span class="template">{{<br>}}</span></span></span>'], '']);
       assert.deepStrictEqual(inspect(parser, input('"((""))')), [['"', '<span class="paren">(<span class="paren">(</span></span>', '"', '"', ')', ')'], '']);
+      assert.deepStrictEqual(inspect(parser, input('0\n((a))')), [['0', '<br>', '<sup class="annotation"><span>a</span></sup>'], '']);
       assert.deepStrictEqual(inspect(parser, input('[[[a]]')), [['[', '<sup class="reference"><span>a</span></sup>'], '']);
       assert.deepStrictEqual(inspect(parser, input('[[[[a]]')), [['[', '[', '<sup class="reference"><span>a</span></sup>'], '']);
       assert.deepStrictEqual(inspect(parser, input('[[[[a]]]]')), [['<sup class="reference"><span>[[a]]</span></sup>'], '']);

package/src/parser/repeat.ts

@@ -34,6 +34,7 @@ export function repeat<T extends HTMLElement | string>(
   const test = tester(after, false);
   interface Memory {
     readonly position: number;
+    linebreak: number;
     i: number;
     lead: number;
     follow: number;
@@ -42,7 +43,7 @@ export function repeat<T extends HTMLElement | string>(
   }
   const cont: Result<T, Input<Memory>> = [
     (input, output) => {
-      const { source, position, resources: { recursions } } = input;
+      const { source, position, linebreak, resources: { recursions } } = input;
       if (!source.startsWith(opener, input.position)) return Result.skip;
       let i = opener.length;
       for (; source[input.position + i] === source[input.position];) ++i;
@@ -51,16 +52,18 @@ export function repeat<T extends HTMLElement | string>(
         input.position = position;
         return Result.skip;
       }
-      let depth = i / opener.length + 1 | 0;
+      const depth = i / opener.length + 1 | 0;
       recur(output, recursions, recursion, depth, true);
       input.memory = {
         position,
+        linebreak,
         i,
         lead: 0,
         follow: 0,
         state: false,
         depth,
       };
+      input.linebreak = 0;
       output.push();
       return loop;
     },
@@ -68,6 +71,7 @@ export function repeat<T extends HTMLElement | string>(
       const { source, memory: m, resources: { recursions } } = input;
       recur(output, recursions, recursion, -m.depth);
       m.depth = 0;
+      input.linebreak ||= m.linebreak;
       const prefix = m.i;
       m.i = 0;
       for (let len = min(prefix, source.length - input.position); m.i < len && source[input.position + m.i] === closer[0];) {
@@ -94,6 +98,7 @@ export function repeat<T extends HTMLElement | string>(
             const advance = input.position - pos;
             m.i -= advance;
             m.follow -= advance;
+            recur(output, recursions, recursion, -(advance / closer.length | 0));
             m.depth -= advance / closer.length | 0;
           }
           continue;
@@ -104,7 +109,7 @@ export function repeat<T extends HTMLElement | string>(
     },
     parser,
     (input, output) => {
-      const { source, memory: m } = input;
+      const { source, memory: m, resources: { recursions } } = input;
       const { lead } = m;
       input.range = input.position - m.position - m.i + opener.length;
       if (!output.state) return;
@@ -131,6 +136,7 @@ export function repeat<T extends HTMLElement | string>(
             const advance = input.position - pos;
             m.i -= advance;
             m.follow -= advance;
+            recur(output, recursions, recursion, -(advance / closer.length | 0));
             m.depth -= advance / closer.length | 0;
           }
           m.i -= opener.length, m.follow -= closer.length;

package/src/processor/figure.ts

@@ -11,7 +11,7 @@ export function* figure(
     readonly id?: string;
     readonly local?: boolean;
   } = {},
-): Generator<HTMLAnchorElement | undefined, undefined, undefined> {
+): Generator<undefined, undefined, undefined> {
   const selector = ':is(figure[data-label], h1, h2)';
   const refs = new MultiQueue<string, HTMLAnchorElement>(
     !notes || notes.references.parentNode === target
@@ -34,7 +34,7 @@ export function* figure(
           ? target.querySelectorAll(`:scope > ${selector}`)
           : target.querySelectorAll(`:not(* > *)${selector}`),
         len = defs.length, i = 0; i < len; ++i) {
-    yield;
+    if (~i << 32 - 8 === 0) yield;
     const def = defs[i];
     assert(def.parentNode === target || !def.parentNode);
     const { tagName } = def;
@@ -127,7 +127,7 @@ export function* figure(
         unmarkInvalid(ref);
       }
       if (ref.hash.slice(1) === def.id && ref.innerText === figindex) continue;
-      yield define(ref,
+      define(ref,
         {
           class: opts.local ? `${ref.className} local` : undefined,
           href: opts.id !== '' ? `#${def.id}` : undefined,
@@ -139,7 +139,6 @@ export function* figure(
     if (opts.id !== '' && !ref.classList.contains('invalid')) {
       markInvalid(ref, 'label', 'reference', messages.reference);
     }
-    yield ref;
   }
   assert(opts.id !== '' || !target.querySelector('[id], .index[href], .label[href], .annotation > a[href], .reference > a[href]'));
   assert(opts.id !== '' || !notes?.references.querySelector('[id], .index[href], .label[href]'));

package/src/processor/note.test.ts

@@ -18,7 +18,7 @@ describe('Unit: processor/note', () => {
     it('1', () => {
       const target = run(parse('((a b))'));
       for (let i = 0; i < 3; ++i) {
-        assert.deepStrictEqual([...note(target)].length, i === 0 ? 2 : 3);
+        assert.deepStrictEqual([...note(target)].length, 1);
         assert.deepStrictEqual(
           [...target.children].map(el => normalize(el.outerHTML)),
           [
@@ -40,7 +40,7 @@ describe('Unit: processor/note', () => {
     it('2', () => {
       const target = run(parse('((1))((12345678901234567890))'));
       for (let i = 0; i < 3; ++i) {
-        assert.deepStrictEqual([...note(target)].length, i === 0 ? 4 : 6);
+        assert.deepStrictEqual([...note(target)].length, 1);
         assert.deepStrictEqual(
           [...target.children].map(el => normalize(el.outerHTML)),
           [
@@ -203,7 +203,7 @@ describe('Unit: processor/note', () => {
     it('id', () => {
       const target = run(parse('((a b))'));
       for (let i = 0; i < 3; ++i) {
-        assert.deepStrictEqual([...note(target, undefined, { id: '0' })].length, i === 0 ? 2 : 3);
+        assert.deepStrictEqual([...note(target, undefined, { id: '0' })].length, 1);
         assert.deepStrictEqual(
           [...target.children].map(el => normalize(el.outerHTML)),
           [

package/src/processor/note.ts

@@ -14,7 +14,7 @@ export function* note(
     readonly local?: boolean;
   } = {},
   bottom: Node | null = null,
-): Generator<HTMLAnchorElement | HTMLLIElement | undefined, undefined, undefined> {
+): Generator<HTMLOListElement | undefined, undefined, undefined> {
   const referenceRefMemory = referenceRefsMemoryCaller(target);
   const annotationRefMemory = annotationRefsMemoryCaller(target);
   for (const memory of [referenceRefMemory, annotationRefMemory]) {
@@ -77,7 +77,7 @@ function build(
       readonly local?: boolean;
     } = {},
     bottom: Node | null = null,
-  ): Generator<HTMLAnchorElement | HTMLLIElement | undefined, undefined, undefined> {
+  ): Generator<HTMLOListElement | undefined, undefined, undefined> {
     const refInfoCaller = memoize((ref: HTMLElement) => {
       const content = ref.firstElementChild!;
       const abbr = ref.getAttribute('data-abbr') ?? '';
@@ -119,6 +119,7 @@ function build(
     let format: 'number' | 'abbr';
     let refIndex = 0;
     for (let len = refs.length, i = 0; i < len; ++i) {
+      if (~i << 32 - 8 === 0) yield;
       const ref = refs[i];
       if (splitter) for (let splitter; splitter = splitters[iSplitters]; ++iSplitters) {
         assert(splitter.parentNode === target || !splitter.parentNode);
@@ -126,8 +127,10 @@ function build(
         if (pos & (Node.DOCUMENT_POSITION_PRECEDING | Node.DOCUMENT_POSITION_DISCONNECTED)) break;
         if (~iSplitters << 32 - 8 === 0) yield;
         if (splitter.classList.contains(list) && splitter.nextElementSibling !== splitters[iSplitters + 1]) {
-          yield* proc(splitter as HTMLOListElement);
-          splitter.remove();
+          const note = splitter as HTMLOListElement;
+          proc(note);
+          note.remove();
+          yield note;
           continue;
         }
         if (defs.size > 0) {
@@ -137,8 +140,9 @@ function build(
             ? splitter as HTMLOListElement
             : target.insertBefore(html('ol', { class: list }), splitter);
           assert(note.parentNode);
-          yield* proc(note, defs);
+          proc(note, defs);
           assert(defs.size === 0);
+          yield note;
         }
       }
       const { content, identifier, abbr, text } = refInfoCaller(ref);
@@ -209,21 +213,23 @@ function build(
             title: abbr && text || undefined,
           },
           `^${++refIndex}`));
-      yield;
     }
     if (note || defs.size > 0) {
       const splitter = splitters[iSplitters++];
       note ??= splitter?.classList.contains(list)
         ? splitter as HTMLOListElement
         : target.insertBefore(html('ol', { class: list }), splitter ?? bottom);
-      yield* proc(note, defs);
+      proc(note, defs);
       assert(defs.size === 0);
+      yield note;
     }
     if (splitter) for (let splitter; splitter = splitters[iSplitters]; ++iSplitters) {
       if (~iSplitters << 32 - 8 === 0) yield;
       if (splitter.classList.contains(list)) {
-        yield* proc(splitter as HTMLOListElement);
+        const note = splitter as HTMLOListElement;
+        proc(note);
         splitter.remove();
+        yield note;
       }
     }
     assert(opts.id !== '' || !target.querySelector('[id], .index[href], .label[href], .annotation > a[href], .reference > a[href]'));
@@ -231,13 +237,13 @@ function build(
   };
 }
 
-function* proc(note: HTMLOListElement, defs?: Map<string, HTMLLIElement>): Generator<HTMLLIElement | undefined, undefined, undefined> {
+function proc(note: HTMLOListElement, defs?: Map<string, HTMLLIElement>): void {
   for (let defs = note.children, i = defs.length; i--;) {
-    yield note.removeChild(defs[i] as HTMLLIElement);
+    note.removeChild(defs[i] as HTMLLIElement);
   }
   if (!defs) return;
   for (const [, def] of defs) {
-    yield note.appendChild(def);
+    note.appendChild(def);
   }
   defs.clear();
 }