lib0 0.2.116 → 1.0.0-0

package/dist/list.cjs

@@ -1,266 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-var _function = require('./function-314580f7.cjs');
-var error = require('./error-0c1f634f.cjs');
-var equality = require('./equality.cjs');
-require('./array-78849c95.cjs');
-require('./set-5b47859e.cjs');
-require('./object-c0c9435b.cjs');
-
-class ListNode {
-  constructor () {
-    /**
-     * @type {this|null}
-     */
-    this.next = null;
-    /**
-     * @type {this|null}
-     */
-    this.prev = null;
-  }
-}
-
-/**
- * @template {ListNode} N
- */
-class List {
-  constructor () {
-    /**
-     * @type {N | null}
-     */
-    this.start = null;
-    /**
-     * @type {N | null}
-     */
-    this.end = null;
-    this.len = 0;
-  }
-
-  * [Symbol.iterator] () {
-    let n = this.start;
-    while (n) {
-      yield n;
-      n = n.next;
-    }
-  }
-
-  toArray () {
-    return map(this, _function.id)
-  }
-
-  /**
-   * @param {function(N):any} f
-   */
-  forEach (f) {
-    forEach(this, f);
-  }
-
-  /**
-   * @template M
-   * @param {function(N):M} f
-   * @return {Array<M>}
-   */
-  map (f) {
-    return map(this, f)
-  }
-
-  /**
-   * @param {List<any>} other
-   */
-  [equality.EqualityTraitSymbol] (other) {
-    let n = this.start;
-    let m = other.start;
-    while (n && m) {
-      if (!equality.equals(n, m)) return false
-      n = n.next;
-      m = m.next;
-    }
-    return n === m // only true iff n == null && m == null
-  }
-}
-
-/**
- * @note The queue implementation is experimental and unfinished.
- * Don't use this in production yet.
- *
- * @template {ListNode} N
- *
- * @return {List<N>}
- */
-const create = () => new List();
-
-/**
- * @template {ListNode} N
- *
- * @param {List<N>} queue
- */
-const isEmpty = queue => queue.start === null;
-
-/**
- * Remove a single node from the queue. Only works with Queues that operate on Doubly-linked lists of nodes.
- *
- * @template {ListNode} N
- *
- * @param {List<N>} list
- * @param {N} node
- */
-const remove = (list, node) => {
-  const prev = node.prev;
-  const next = node.next;
-  if (prev) {
-    prev.next = next;
-  } else {
-    list.start = next;
-  }
-  if (next) {
-    next.prev = prev;
-  } else {
-    list.end = prev;
-  }
-  list.len--;
-  return node
-};
-
-/**
- * @deprecated @todo remove in next major release
- */
-const removeNode = remove;
-
-/**
- * @template {ListNode} N
- *
- * @param {List<N>} queue
- * @param {N| null} left
- * @param {N| null} right
- * @param {N} node
- */
-const insertBetween = (queue, left, right, node) => {
-  /* c8 ignore start */
-  if (left != null && left.next !== right) {
-    throw error.unexpectedCase()
-  }
-  /* c8 ignore stop */
-  if (left) {
-    left.next = node;
-  } else {
-    queue.start = node;
-  }
-  if (right) {
-    right.prev = node;
-  } else {
-    queue.end = node;
-  }
-  node.prev = left;
-  node.next = right;
-  queue.len++;
-};
-
-/**
- * Remove a single node from the queue. Only works with Queues that operate on Doubly-linked lists of nodes.
- *
- * @template {ListNode} N
- *
- * @param {List<N>} queue
- * @param {N} node
- * @param {N} newNode
- */
-const replace = (queue, node, newNode) => {
-  insertBetween(queue, node, node.next, newNode);
-  remove(queue, node);
-};
-
-/**
- * @template {ListNode} N
- *
- * @param {List<N>} queue
- * @param {N} n
- */
-const pushEnd = (queue, n) =>
-  insertBetween(queue, queue.end, null, n);
-
-/**
- * @template {ListNode} N
- *
- * @param {List<N>} queue
- * @param {N} n
- */
-const pushFront = (queue, n) =>
-  insertBetween(queue, null, queue.start, n);
-
-/**
- * @template {ListNode} N
- *
- * @param {List<N>} list
- * @return {N| null}
- */
-const popFront = list =>
-  list.start ? removeNode(list, list.start) : null;
-
-/**
- * @template {ListNode} N
- *
- * @param {List<N>} list
- * @return {N| null}
- */
-const popEnd = list =>
-  list.end ? removeNode(list, list.end) : null;
-
-/**
- * @template {ListNode} N
- * @template M
- *
- * @param {List<N>} list
- * @param {function(N):M} f
- * @return {Array<M>}
- */
-const map = (list, f) => {
-  /**
-   * @type {Array<M>}
-   */
-  const arr = [];
-  let n = list.start;
-  while (n) {
-    arr.push(f(n));
-    n = n.next;
-  }
-  return arr
-};
-
-/**
- * @template {ListNode} N
- *
- * @param {List<N>} list
- */
-const toArray = list => map(list, _function.id);
-
-/**
- * @template {ListNode} N
- * @param {List<N>} list
- * @param {function(N):any} f
- */
-const forEach = (list, f) => {
-  let n = list.start;
-  while (n) {
-    f(n);
-    n = n.next;
-  }
-};
-
-exports.List = List;
-exports.ListNode = ListNode;
-exports.create = create;
-exports.forEach = forEach;
-exports.insertBetween = insertBetween;
-exports.isEmpty = isEmpty;
-exports.map = map;
-exports.popEnd = popEnd;
-exports.popFront = popFront;
-exports.pushEnd = pushEnd;
-exports.pushFront = pushFront;
-exports.remove = remove;
-exports.removeNode = removeNode;
-exports.replace = replace;
-exports.toArray = toArray;
-//# sourceMappingURL=list.cjs.map

package/dist/list.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.cjs","sources":["../list.js"],"sourcesContent":["import { id } from './function.js'\nimport * as error from './error.js'\nimport * as equalityTrait from './trait/equality.js'\nimport * as f from './function.js'\n\nexport class ListNode {\n  constructor () {\n    /**\n     * @type {this|null}\n     */\n    this.next = null\n    /**\n     * @type {this|null}\n     */\n    this.prev = null\n  }\n}\n\n/**\n * @template {ListNode} N\n */\nexport class List {\n  constructor () {\n    /**\n     * @type {N | null}\n     */\n    this.start = null\n    /**\n     * @type {N | null}\n     */\n    this.end = null\n    this.len = 0\n  }\n\n  * [Symbol.iterator] () {\n    let n = this.start\n    while (n) {\n      yield n\n      n = n.next\n    }\n  }\n\n  toArray () {\n    return map(this, f.id)\n  }\n\n  /**\n   * @param {function(N):any} f\n   */\n  forEach (f) {\n    forEach(this, f)\n  }\n\n  /**\n   * @template M\n   * @param {function(N):M} f\n   * @return {Array<M>}\n   */\n  map (f) {\n    return map(this, f)\n  }\n\n  /**\n   * @param {List<any>} other\n   */\n  [equalityTrait.EqualityTraitSymbol] (other) {\n    let n = this.start\n    let m = other.start\n    while (n && m) {\n      if (!equalityTrait.equals(n, m)) return false\n      n = n.next\n      m = m.next\n    }\n    return n === m // only true iff n == null && m == null\n  }\n}\n\n/**\n * @note The queue implementation is experimental and unfinished.\n * Don't use this in production yet.\n *\n * @template {ListNode} N\n *\n * @return {List<N>}\n */\nexport const create = () => new List()\n\n/**\n * @template {ListNode} N\n *\n * @param {List<N>} queue\n */\nexport const isEmpty = queue => queue.start === null\n\n/**\n * Remove a single node from the queue. Only works with Queues that operate on Doubly-linked lists of nodes.\n *\n * @template {ListNode} N\n *\n * @param {List<N>} list\n * @param {N} node\n */\nexport const remove = (list, node) => {\n  const prev = node.prev\n  const next = node.next\n  if (prev) {\n    prev.next = next\n  } else {\n    list.start = next\n  }\n  if (next) {\n    next.prev = prev\n  } else {\n    list.end = prev\n  }\n  list.len--\n  return node\n}\n\n/**\n * @deprecated @todo remove in next major release\n */\nexport const removeNode = remove\n\n/**\n * @template {ListNode} N\n *\n * @param {List<N>} queue\n * @param {N| null} left\n * @param {N| null} right\n * @param {N} node\n */\nexport const insertBetween = (queue, left, right, node) => {\n  /* c8 ignore start */\n  if (left != null && left.next !== right) {\n    throw error.unexpectedCase()\n  }\n  /* c8 ignore stop */\n  if (left) {\n    left.next = node\n  } else {\n    queue.start = node\n  }\n  if (right) {\n    right.prev = node\n  } else {\n    queue.end = node\n  }\n  node.prev = left\n  node.next = right\n  queue.len++\n}\n\n/**\n * Remove a single node from the queue. Only works with Queues that operate on Doubly-linked lists of nodes.\n *\n * @template {ListNode} N\n *\n * @param {List<N>} queue\n * @param {N} node\n * @param {N} newNode\n */\nexport const replace = (queue, node, newNode) => {\n  insertBetween(queue, node, node.next, newNode)\n  remove(queue, node)\n}\n\n/**\n * @template {ListNode} N\n *\n * @param {List<N>} queue\n * @param {N} n\n */\nexport const pushEnd = (queue, n) =>\n  insertBetween(queue, queue.end, null, n)\n\n/**\n * @template {ListNode} N\n *\n * @param {List<N>} queue\n * @param {N} n\n */\nexport const pushFront = (queue, n) =>\n  insertBetween(queue, null, queue.start, n)\n\n/**\n * @template {ListNode} N\n *\n * @param {List<N>} list\n * @return {N| null}\n */\nexport const popFront = list =>\n  list.start ? removeNode(list, list.start) : null\n\n/**\n * @template {ListNode} N\n *\n * @param {List<N>} list\n * @return {N| null}\n */\nexport const popEnd = list =>\n  list.end ? removeNode(list, list.end) : null\n\n/**\n * @template {ListNode} N\n * @template M\n *\n * @param {List<N>} list\n * @param {function(N):M} f\n * @return {Array<M>}\n */\nexport const map = (list, f) => {\n  /**\n   * @type {Array<M>}\n   */\n  const arr = []\n  let n = list.start\n  while (n) {\n    arr.push(f(n))\n    n = n.next\n  }\n  return arr\n}\n\n/**\n * @template {ListNode} N\n *\n * @param {List<N>} list\n */\nexport const toArray = list => map(list, id)\n\n/**\n * @template {ListNode} N\n * @param {List<N>} list\n * @param {function(N):any} f\n */\nexport const forEach = (list, f) => {\n  let n = list.start\n  while (n) {\n    f(n)\n    n = n.next\n  }\n}\n"],"names":["f.id","equalityTrait.EqualityTraitSymbol","equalityTrait.equals","error.unexpectedCase","id"],"mappings":";;;;;;;;;;;AAKO,MAAM,QAAQ,CAAC;AACtB,EAAE,WAAW,CAAC,GAAG;AACjB;AACA;AACA;AACA,IAAI,IAAI,CAAC,IAAI,GAAG,KAAI;AACpB;AACA;AACA;AACA,IAAI,IAAI,CAAC,IAAI,GAAG,KAAI;AACpB,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACO,MAAM,IAAI,CAAC;AAClB,EAAE,WAAW,CAAC,GAAG;AACjB;AACA;AACA;AACA,IAAI,IAAI,CAAC,KAAK,GAAG,KAAI;AACrB;AACA;AACA;AACA,IAAI,IAAI,CAAC,GAAG,GAAG,KAAI;AACnB,IAAI,IAAI,CAAC,GAAG,GAAG,EAAC;AAChB,GAAG;AACH;AACA,EAAE,GAAG,MAAM,CAAC,QAAQ,EAAE,GAAG;AACzB,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,MAAK;AACtB,IAAI,OAAO,CAAC,EAAE;AACd,MAAM,MAAM,EAAC;AACb,MAAM,CAAC,GAAG,CAAC,CAAC,KAAI;AAChB,KAAK;AACL,GAAG;AACH;AACA,EAAE,OAAO,CAAC,GAAG;AACb,IAAI,OAAO,GAAG,CAAC,IAAI,EAAEA,YAAI,CAAC;AAC1B,GAAG;AACH;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE;AACd,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,EAAC;AACpB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE;AACV,IAAI,OAAO,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;AACvB,GAAG;AACH;AACA;AACA;AACA;AACA,EAAE,CAACC,4BAAiC,EAAE,CAAC,KAAK,EAAE;AAC9C,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,MAAK;AACtB,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC,MAAK;AACvB,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE;AACnB,MAAM,IAAI,CAACC,eAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,KAAK;AACnD,MAAM,CAAC,GAAG,CAAC,CAAC,KAAI;AAChB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAI;AAChB,KAAK;AACL,IAAI,OAAO,CAAC,KAAK,CAAC;AAClB,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,MAAM,IAAI,IAAI,GAAE;AACtC;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,OAAO,GAAG,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,KAAI;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,CAAC,IAAI,EAAE,IAAI,KAAK;AACtC,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAI;AACxB,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAI;AACxB,EAAE,IAAI,IAAI,EAAE;AACZ,IAAI,IAAI,CAAC,IAAI,GAAG,KAAI;AACpB,GAAG,MAAM;AACT,IAAI,IAAI,CAAC,KAAK,GAAG,KAAI;AACrB,GAAG;AACH,EAAE,IAAI,IAAI,EAAE;AACZ,IAAI,IAAI,CAAC,IAAI,GAAG,KAAI;AACpB,GAAG,MAAM;AACT,IAAI,IAAI,CAAC,GAAG,GAAG,KAAI;AACnB,GAAG;AACH,EAAE,IAAI,CAAC,GAAG,GAAE;AACZ,EAAE,OAAO,IAAI;AACb,EAAC;AACD;AACA;AACA;AACA;AACY,MAAC,UAAU,GAAG,OAAM;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,aAAa,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,KAAK;AAC3D;AACA,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE;AAC3C,IAAI,MAAMC,oBAAoB,EAAE;AAChC,GAAG;AACH;AACA,EAAE,IAAI,IAAI,EAAE;AACZ,IAAI,IAAI,CAAC,IAAI,GAAG,KAAI;AACpB,GAAG,MAAM;AACT,IAAI,KAAK,CAAC,KAAK,GAAG,KAAI;AACtB,GAAG;AACH,EAAE,IAAI,KAAK,EAAE;AACb,IAAI,KAAK,CAAC,IAAI,GAAG,KAAI;AACrB,GAAG,MAAM;AACT,IAAI,KAAK,CAAC,GAAG,GAAG,KAAI;AACpB,GAAG;AACH,EAAE,IAAI,CAAC,IAAI,GAAG,KAAI;AAClB,EAAE,IAAI,CAAC,IAAI,GAAG,MAAK;AACnB,EAAE,KAAK,CAAC,GAAG,GAAE;AACb,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,OAAO,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,KAAK;AACjD,EAAE,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,EAAC;AAChD,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAC;AACrB,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC;AAChC,EAAE,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,EAAC;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,SAAS,GAAG,CAAC,KAAK,EAAE,CAAC;AAClC,EAAE,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,EAAC;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,QAAQ,GAAG,IAAI;AAC5B,EAAE,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,KAAI;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,IAAI;AAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,KAAI;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK;AAChC;AACA;AACA;AACA,EAAE,MAAM,GAAG,GAAG,GAAE;AAChB,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAK;AACpB,EAAE,OAAO,CAAC,EAAE;AACZ,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC;AAClB,IAAI,CAAC,GAAG,CAAC,CAAC,KAAI;AACd,GAAG;AACH,EAAE,OAAO,GAAG;AACZ,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,OAAO,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,EAAEC,YAAE,EAAC;AAC5C;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,OAAO,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK;AACpC,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAK;AACpB,EAAE,OAAO,CAAC,EAAE;AACZ,IAAI,CAAC,CAAC,CAAC,EAAC;AACR,IAAI,CAAC,GAAG,CAAC,CAAC,KAAI;AACd,GAAG;AACH;;;;;;;;;;;;;;;;;;"}

package/dist/list.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../list.js"],"names":[],"mappings":"AAKA;IAEI;;OAEG;IACH,MAFU,IAAI,GAAC,IAAI,CAEH;IAChB;;OAEG;IACH,MAFU,IAAI,GAAC,IAAI,CAEH;CAEnB;AAED;;GAEG;AACH,kBAFwB,CAAC,SAAX,QAAS;IAInB;;OAEG;IACH,OAFU,CAAC,GAAG,IAAI,CAED;IACjB;;OAEG;IACH,KAFU,CAAC,GAAG,IAAI,CAEH;IACf,YAAY;IAWd,eAEC;IAED;;OAEG;IACH,WAFW,CAAS,IAAC,EAAD,CAAC,KAAE,GAAG,QAIzB;IAED;;;;OAIG;IACH,IAJa,CAAC,KACH,CAAS,IAAC,EAAD,CAAC,KAAE,CAAC,GACZ,KAAK,CAAC,CAAC,CAAC,CAInB;IA1BD,iDAMC;IAsBD;;OAEG;IACH,2CAFW,IAAI,CAAC,GAAG,CAAC,WAWnB;CACF;AAUM,uBAJiB,CAAC,SAAX,QAAS,KAEX,IAAI,CAAC,CAAC,CAAC,CAEmB;AAO/B,wBAJiB,CAAC,SAAX,QAAS,SAEZ,IAAI,CAAC,CAAC,CAAC,WAEkC;AAU7C,uBALiB,CAAC,SAAX,QAAS,QAEZ,IAAI,CAAC,CAAC,CAAC,QACP,CAAC,KAiBX;AAfM,2BALiB,CAAC,SAAX,QAAS,QAEZ,IAAI,CAAC,CAAC,CAAC,QACP,CAAC,KAiBX;AAeM,8BAPiB,CAAC,SAAX,QAAS,SAEZ,IAAI,CAAC,CAAC,CAAC,QACP,CAAC,GAAE,IAAI,SACP,CAAC,GAAE,IAAI,QACP,CAAC,QAqBX;AAWM,wBANiB,CAAC,SAAX,QAAS,SAEZ,IAAI,CAAC,CAAC,CAAC,QACP,CAAC,WACD,CAAC,QAKX;AAQM,wBALiB,CAAC,SAAX,QAAS,SAEZ,IAAI,CAAC,CAAC,CAAC,KACP,CAAC,QAG8B;AAQnC,0BALiB,CAAC,SAAX,QAAS,SAEZ,IAAI,CAAC,CAAC,CAAC,KACP,CAAC,QAGgC;AAQrC,yBALiB,CAAC,SAAX,QAAS,QAEZ,IAAI,CAAC,CAAC,CAAC,GACN,CAAC,GAAE,IAAI,CAG+B;AAQ3C,uBALiB,CAAC,SAAX,QAAS,QAEZ,IAAI,CAAC,CAAC,CAAC,GACN,CAAC,GAAE,IAAI,CAG2B;AAUvC,oBAPiB,CAAC,SAAX,QAAS,EACV,CAAC,QAEH,IAAI,CAAC,CAAC,CAAC,KACP,CAAS,IAAC,EAAD,CAAC,KAAE,CAAC,GACZ,KAAK,CAAC,CAAC,CAAC,CAanB;AAOM,wBAJiB,CAAC,SAAX,QAAS,QAEZ,IAAI,CAAC,CAAC,CAAC,OAE0B;AAOrC,wBAJiB,CAAC,SAAX,QAAS,QACZ,IAAI,CAAC,CAAC,CAAC,KACP,CAAS,IAAC,EAAD,CAAC,KAAE,GAAG,QAQzB;+BAhP8B,qBAAqB"}

package/dist/list.test.d.ts

@@ -1,6 +0,0 @@
-export function testAssignability(_tc: t.TestCase): void;
-export function testEnqueueDequeue(_tc: t.TestCase): void;
-export function testSelectivePop(_tc: t.TestCase): void;
-export function testEquality(): void;
-import * as t from './testing.js';
-//# sourceMappingURL=list.test.d.ts.map

package/dist/list.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.test.d.ts","sourceRoot":"","sources":["../list.test.js"],"names":[],"mappings":"AA2BO,uCAFI,CAAC,CAAC,QAAQ,QAcpB;AAKM,wCAFI,CAAC,CAAC,QAAQ,QA8BpB;AAKM,sCAFI,CAAC,CAAC,QAAQ,QAiCpB;AAEM,qCAgBN;mBA9HkB,cAAc"}