@tko/utils 4.0.0-beta1.0 → 4.0.0

package/dist/array.js

@@ -1,8 +1,9 @@
-// @tko/utils 🥊 4.0.0-beta1.0 ESM
+// @tko/utils 🥊 4.0.0 ESM
+"use strict";
 const { isArray } = Array;
-export function arrayForEach(array, action, thisArg) {
+export function arrayForEach(array, action, actionOwner) {
   if (arguments.length > 2) {
-    action = action.bind(thisArg);
+    action = action.bind(actionOwner);
   }
   for (let i = 0, j = array.length; i < j; ++i) {
     action(array[i], i, array);
@@ -14,30 +15,30 @@ export function arrayIndexOf(array, item) {
 export function arrayFirst(array, predicate, predicateOwner) {
   return (isArray(array) ? array : [...array]).find(predicate, predicateOwner);
 }
-export function arrayMap(array = [], mapping, thisArg) {
+export function arrayMap(array, mapping, thisArg) {
   if (arguments.length > 2) {
     mapping = mapping.bind(thisArg);
   }
   return array === null ? [] : Array.from(array, mapping);
 }
 export function arrayRemoveItem(array, itemToRemove) {
-  var index = arrayIndexOf(array, itemToRemove);
+  const index = arrayIndexOf(array, itemToRemove);
   if (index > 0) {
     array.splice(index, 1);
   } else if (index === 0) {
     array.shift();
   }
 }
-export function arrayGetDistinctValues(array = []) {
+export function arrayGetDistinctValues(array) {
   const seen = /* @__PURE__ */ new Set();
   if (array === null) {
     return [];
   }
   return (isArray(array) ? array : [...array]).filter((item) => seen.has(item) ? false : seen.add(item));
 }
-export function arrayFilter(array, predicate, thisArg) {
+export function arrayFilter(array, predicate, predicateOwner) {
   if (arguments.length > 2) {
-    predicate = predicate.bind(thisArg);
+    predicate = predicate.bind(predicateOwner);
   }
   return array === null ? [] : (isArray(array) ? array : [...array]).filter(predicate);
 }
@@ -45,14 +46,14 @@ export function arrayPushAll(array, valuesToPush) {
   if (isArray(valuesToPush)) {
     array.push.apply(array, valuesToPush);
   } else {
-    for (var i = 0, j = valuesToPush.length; i < j; i++) {
+    for (let i = 0, j = valuesToPush.length; i < j; i++) {
       array.push(valuesToPush[i]);
     }
   }
   return array;
 }
 export function addOrRemoveItem(array, value, included) {
-  var existingEntryIndex = arrayIndexOf(typeof array.peek === "function" ? array.peek() : array, value);
+  const existingEntryIndex = arrayIndexOf(typeof array.peek === "function" ? array.peek() : array, value);
   if (existingEntryIndex < 0) {
     if (included) {
       array.push(value);
@@ -67,17 +68,17 @@ export function makeArray(arrayLikeObject) {
   return Array.from(arrayLikeObject);
 }
 export function range(min, max) {
-  min = typeof min === "function" ? min() : min;
-  max = typeof max === "function" ? max() : max;
-  var result = [];
-  for (var i = min; i <= max; i++) {
+  const minimum = typeof min === "function" ? min() : min;
+  const maximum = typeof max === "function" ? max() : max;
+  const result = [];
+  for (let i = minimum; i <= maximum; i++) {
     result.push(i);
   }
   return result;
 }
 export function findMovesInArrayComparison(left, right, limitFailedCompares) {
   if (left.length && right.length) {
-    var failedCompares, l, r, leftItem, rightItem;
+    let failedCompares, l, r, leftItem, rightItem;
     for (failedCompares = l = 0; (!limitFailedCompares || failedCompares < limitFailedCompares) && (leftItem = left[l]); ++l) {
       for (r = 0; rightItem = right[r]; ++r) {
         if (leftItem.value === rightItem.value) {
@@ -105,10 +106,10 @@ export function compareArrays(oldArray, newArray, options) {
   }
 }
 function compareSmallArrayToBigArray(smlArray, bigArray, statusNotInSml, statusNotInBig, options) {
-  var myMin = Math.min, myMax = Math.max, editDistanceMatrix = [], smlIndex, smlIndexMax = smlArray.length, bigIndex, bigIndexMax = bigArray.length, compareRange = bigIndexMax - smlIndexMax || 1, maxDistance = smlIndexMax + bigIndexMax + 1, thisRow, lastRow, bigIndexMaxForRow, bigIndexMinForRow;
+  let myMin = Math.min, myMax = Math.max, editDistanceMatrix = new Array(), smlIndex, smlIndexMax = smlArray.length, bigIndex, bigIndexMax = bigArray.length, compareRange = bigIndexMax - smlIndexMax || 1, maxDistance = smlIndexMax + bigIndexMax + 1, thisRow, lastRow, bigIndexMaxForRow, bigIndexMinForRow;
   for (smlIndex = 0; smlIndex <= smlIndexMax; smlIndex++) {
     lastRow = thisRow;
-    editDistanceMatrix.push(thisRow = []);
+    editDistanceMatrix.push(thisRow = new Array());
     bigIndexMaxForRow = myMin(bigIndexMax, smlIndex + compareRange);
     bigIndexMinForRow = myMax(0, smlIndex - 1);
     for (bigIndex = bigIndexMinForRow; bigIndex <= bigIndexMaxForRow; bigIndex++) {
@@ -119,35 +120,38 @@ function compareSmallArrayToBigArray(smlArray, bigArray, statusNotInSml, statusN
       } else if (smlArray[smlIndex - 1] === bigArray[bigIndex - 1]) {
         thisRow[bigIndex] = lastRow[bigIndex - 1];
       } else {
-        var northDistance = lastRow[bigIndex] || maxDistance;
-        var westDistance = thisRow[bigIndex - 1] || maxDistance;
+        const northDistance = lastRow[bigIndex] || maxDistance;
+        const westDistance = thisRow[bigIndex - 1] || maxDistance;
         thisRow[bigIndex] = myMin(northDistance, westDistance) + 1;
       }
     }
   }
-  var editScript = [], meMinusOne, notInSml = [], notInBig = [];
+  let editScript = new Array(), meMinusOne, notInSml = new Array(), notInBig = new Array();
   for (smlIndex = smlIndexMax, bigIndex = bigIndexMax; smlIndex || bigIndex; ) {
     meMinusOne = editDistanceMatrix[smlIndex][bigIndex] - 1;
     if (bigIndex && meMinusOne === editDistanceMatrix[smlIndex][bigIndex - 1]) {
-      notInSml.push(editScript[editScript.length] = {
-        "status": statusNotInSml,
-        "value": bigArray[--bigIndex],
-        "index": bigIndex
-      });
+      notInSml.push(
+        editScript[editScript.length] = {
+          // added
+          status: statusNotInSml,
+          value: bigArray[--bigIndex],
+          index: bigIndex
+        }
+      );
     } else if (smlIndex && meMinusOne === editDistanceMatrix[smlIndex - 1][bigIndex]) {
-      notInBig.push(editScript[editScript.length] = {
-        "status": statusNotInBig,
-        "value": smlArray[--smlIndex],
-        "index": smlIndex
-      });
+      notInBig.push(
+        editScript[editScript.length] = {
+          // deleted
+          status: statusNotInBig,
+          value: smlArray[--smlIndex],
+          index: smlIndex
+        }
+      );
     } else {
       --bigIndex;
       --smlIndex;
-      if (!options.sparse) {
-        editScript.push({
-          "status": "retained",
-          "value": bigArray[bigIndex]
-        });
+      if (!options?.sparse) {
+        editScript.push({ status: "retained", value: bigArray[bigIndex] });
       }
     }
   }

package/dist/array.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/array.ts"],
-  "sourcesContent": ["//\n// Array utilities\n//\n// Note that the array functions may be called with\n// Array-like things, such as NodeList.\n\nconst {isArray} = Array\n\nexport function arrayForEach (array, action, thisArg) {\n  if (arguments.length > 2) { action = action.bind(thisArg) }\n  for (let i = 0, j = array.length; i < j; ++i) {\n    action(array[i], i, array)\n  }\n}\n\nexport function arrayIndexOf (array, item) {\n  return (isArray(array) ? array : [...array]).indexOf(item)\n}\n\nexport function arrayFirst (array, predicate, predicateOwner) {\n  return (isArray(array) ? array : [...array])\n    .find(predicate, predicateOwner)\n}\n\nexport function arrayMap (array = [], mapping, thisArg) {\n  if (arguments.length > 2) { mapping = mapping.bind(thisArg) }\n  return array === null ? [] : Array.from(array, mapping)\n}\n\nexport function arrayRemoveItem (array, itemToRemove) {\n  var index = arrayIndexOf(array, itemToRemove)\n  if (index > 0) {\n    array.splice(index, 1)\n  } else if (index === 0) {\n    array.shift()\n  }\n}\n\nexport function arrayGetDistinctValues (array = []) {\n  const seen = new Set()\n  if (array === null) { return [] }\n  return (isArray(array) ? array : [...array])\n    .filter(item => seen.has(item) ? false : seen.add(item))\n}\n\nexport function arrayFilter (array, predicate, thisArg) {\n  if (arguments.length > 2) { predicate = predicate.bind(thisArg) }\n  return array === null ? [] : (isArray(array) ? array : [...array]).filter(predicate)\n}\n\nexport function arrayPushAll (array, valuesToPush) {\n  if (isArray(valuesToPush)) {\n    array.push.apply(array, valuesToPush)\n  } else {\n    for (var i = 0, j = valuesToPush.length; i < j; i++) { array.push(valuesToPush[i]) }\n  }\n  return array\n}\n\nexport function addOrRemoveItem (array, value, included) {\n  var existingEntryIndex = arrayIndexOf(typeof array.peek === 'function' ? array.peek() : array, value)\n  if (existingEntryIndex < 0) {\n    if (included) { array.push(value) }\n  } else {\n    if (!included) { array.splice(existingEntryIndex, 1) }\n  }\n}\n\nexport function makeArray (arrayLikeObject) {\n  return Array.from(arrayLikeObject)\n}\n\nexport function range (min, max) {\n  min = typeof min === 'function' ? min() : min\n  max = typeof max === 'function' ? max() : max\n  var result = []\n  for (var i = min; i <= max; i++) { result.push(i) }\n  return result\n}\n\n// Go through the items that have been added and deleted and try to find matches between them.\nexport function findMovesInArrayComparison (left, right, limitFailedCompares) {\n  if (left.length && right.length) {\n    var failedCompares, l, r, leftItem, rightItem\n    for (failedCompares = l = 0; (!limitFailedCompares || failedCompares < limitFailedCompares) && (leftItem = left[l]); ++l) {\n      for (r = 0; rightItem = right[r]; ++r) {\n        if (leftItem.value === rightItem.value) {\n          leftItem.moved = rightItem.index\n          rightItem.moved = leftItem.index\n          right.splice(r, 1)         // This item is marked as moved; so remove it from right list\n          failedCompares = r = 0     // Reset failed compares count because we're checking for consecutive failures\n          break\n        }\n      }\n      failedCompares += r\n    }\n  }\n}\n\nconst statusNotInOld = 'added'\nconst statusNotInNew = 'deleted'\n\n    // Simple calculation based on Levenshtein distance.\nexport function compareArrays (oldArray, newArray, options) {\n    // For backward compatibility, if the third arg is actually a bool, interpret\n    // it as the old parameter 'dontLimitMoves'. Newer code should use { dontLimitMoves: true }.\n  options = (typeof options === 'boolean') ? { dontLimitMoves: options } : (options || {})\n  oldArray = oldArray || []\n  newArray = newArray || []\n\n  if (oldArray.length < newArray.length) { return compareSmallArrayToBigArray(oldArray, newArray, statusNotInOld, statusNotInNew, options) } else { return compareSmallArrayToBigArray(newArray, oldArray, statusNotInNew, statusNotInOld, options) }\n}\n\nfunction compareSmallArrayToBigArray (smlArray, bigArray, statusNotInSml, statusNotInBig, options) {\n  var myMin = Math.min,\n    myMax = Math.max,\n    editDistanceMatrix = [],\n    smlIndex, smlIndexMax = smlArray.length,\n    bigIndex, bigIndexMax = bigArray.length,\n    compareRange = (bigIndexMax - smlIndexMax) || 1,\n    maxDistance = smlIndexMax + bigIndexMax + 1,\n    thisRow, lastRow,\n    bigIndexMaxForRow, bigIndexMinForRow\n\n  for (smlIndex = 0; smlIndex <= smlIndexMax; smlIndex++) {\n    lastRow = thisRow\n    editDistanceMatrix.push(thisRow = [])\n    bigIndexMaxForRow = myMin(bigIndexMax, smlIndex + compareRange)\n    bigIndexMinForRow = myMax(0, smlIndex - 1)\n    for (bigIndex = bigIndexMinForRow; bigIndex <= bigIndexMaxForRow; bigIndex++) {\n      if (!bigIndex) {\n        thisRow[bigIndex] = smlIndex + 1\n      } else if (!smlIndex) {\n         // Top row - transform empty array into new array via additions\n        thisRow[bigIndex] = bigIndex + 1\n      } else if (smlArray[smlIndex - 1] === bigArray[bigIndex - 1]) {\n        thisRow[bigIndex] = lastRow[bigIndex - 1]\n      } else {                  // copy value (no edit)\n        var northDistance = lastRow[bigIndex] || maxDistance       // not in big (deletion)\n        var westDistance = thisRow[bigIndex - 1] || maxDistance    // not in small (addition)\n        thisRow[bigIndex] = myMin(northDistance, westDistance) + 1\n      }\n    }\n  }\n\n  var editScript = [], meMinusOne, notInSml = [], notInBig = []\n  for (smlIndex = smlIndexMax, bigIndex = bigIndexMax; smlIndex || bigIndex;) {\n    meMinusOne = editDistanceMatrix[smlIndex][bigIndex] - 1\n    if (bigIndex && meMinusOne === editDistanceMatrix[smlIndex][bigIndex - 1]) {\n      notInSml.push(editScript[editScript.length] = {     // added\n        'status': statusNotInSml,\n        'value': bigArray[--bigIndex],\n        'index': bigIndex })\n    } else if (smlIndex && meMinusOne === editDistanceMatrix[smlIndex - 1][bigIndex]) {\n      notInBig.push(editScript[editScript.length] = {     // deleted\n        'status': statusNotInBig,\n        'value': smlArray[--smlIndex],\n        'index': smlIndex })\n    } else {\n      --bigIndex\n      --smlIndex\n      if (!options.sparse) {\n        editScript.push({\n          'status': 'retained',\n          'value': bigArray[bigIndex] })\n      }\n    }\n  }\n\n    // Set a limit on the number of consecutive non-matching comparisons; having it a multiple of\n    // smlIndexMax keeps the time complexity of this algorithm linear.\n  findMovesInArrayComparison(notInBig, notInSml, !options.dontLimitMoves && smlIndexMax * 10)\n\n  return editScript.reverse()\n}\n"],
-  "mappings": ";AAMA,MAAM,EAAC,YAAW;AAEX,6BAAuB,OAAO,QAAQ,SAAS;AACpD,MAAI,UAAU,SAAS,GAAG;AAAE,aAAS,OAAO,KAAK,OAAO;AAAA,EAAE;AAC1D,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAI,GAAG,EAAE,GAAG;AAC5C,WAAO,MAAM,IAAI,GAAG,KAAK;AAAA,EAC3B;AACF;AAEO,6BAAuB,OAAO,MAAM;AACzC,SAAQ,SAAQ,KAAK,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG,QAAQ,IAAI;AAC3D;AAEO,2BAAqB,OAAO,WAAW,gBAAgB;AAC5D,SAAQ,SAAQ,KAAK,IAAI,QAAQ,CAAC,GAAG,KAAK,GACvC,KAAK,WAAW,cAAc;AACnC;AAEO,yBAAmB,QAAQ,CAAC,GAAG,SAAS,SAAS;AACtD,MAAI,UAAU,SAAS,GAAG;AAAE,cAAU,QAAQ,KAAK,OAAO;AAAA,EAAE;AAC5D,SAAO,UAAU,OAAO,CAAC,IAAI,MAAM,KAAK,OAAO,OAAO;AACxD;AAEO,gCAA0B,OAAO,cAAc;AACpD,MAAI,QAAQ,aAAa,OAAO,YAAY;AAC5C,MAAI,QAAQ,GAAG;AACb,UAAM,OAAO,OAAO,CAAC;AAAA,EACvB,WAAW,UAAU,GAAG;AACtB,UAAM,MAAM;AAAA,EACd;AACF;AAEO,uCAAiC,QAAQ,CAAC,GAAG;AAClD,QAAM,OAAO,oBAAI,IAAI;AACrB,MAAI,UAAU,MAAM;AAAE,WAAO,CAAC;AAAA,EAAE;AAChC,SAAQ,SAAQ,KAAK,IAAI,QAAQ,CAAC,GAAG,KAAK,GACvC,OAAO,UAAQ,KAAK,IAAI,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAC;AAC3D;AAEO,4BAAsB,OAAO,WAAW,SAAS;AACtD,MAAI,UAAU,SAAS,GAAG;AAAE,gBAAY,UAAU,KAAK,OAAO;AAAA,EAAE;AAChE,SAAO,UAAU,OAAO,CAAC,IAAK,SAAQ,KAAK,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG,OAAO,SAAS;AACrF;AAEO,6BAAuB,OAAO,cAAc;AACjD,MAAI,QAAQ,YAAY,GAAG;AACzB,UAAM,KAAK,MAAM,OAAO,YAAY;AAAA,EACtC,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAI,GAAG,KAAK;AAAE,YAAM,KAAK,aAAa,EAAE;AAAA,IAAE;AAAA,EACrF;AACA,SAAO;AACT;AAEO,gCAA0B,OAAO,OAAO,UAAU;AACvD,MAAI,qBAAqB,aAAa,OAAO,MAAM,SAAS,aAAa,MAAM,KAAK,IAAI,OAAO,KAAK;AACpG,MAAI,qBAAqB,GAAG;AAC1B,QAAI,UAAU;AAAE,YAAM,KAAK,KAAK;AAAA,IAAE;AAAA,EACpC,OAAO;AACL,QAAI,CAAC,UAAU;AAAE,YAAM,OAAO,oBAAoB,CAAC;AAAA,IAAE;AAAA,EACvD;AACF;AAEO,0BAAoB,iBAAiB;AAC1C,SAAO,MAAM,KAAK,eAAe;AACnC;AAEO,sBAAgB,KAAK,KAAK;AAC/B,QAAM,OAAO,QAAQ,aAAa,IAAI,IAAI;AAC1C,QAAM,OAAO,QAAQ,aAAa,IAAI,IAAI;AAC1C,MAAI,SAAS,CAAC;AACd,WAAS,IAAI,KAAK,KAAK,KAAK,KAAK;AAAE,WAAO,KAAK,CAAC;AAAA,EAAE;AAClD,SAAO;AACT;AAGO,2CAAqC,MAAM,OAAO,qBAAqB;AAC5E,MAAI,KAAK,UAAU,MAAM,QAAQ;AAC/B,QAAI,gBAAgB,GAAG,GAAG,UAAU;AACpC,SAAK,iBAAiB,IAAI,GAAI,EAAC,uBAAuB,iBAAiB,wBAAyB,YAAW,KAAK,KAAK,EAAE,GAAG;AACxH,WAAK,IAAI,GAAG,YAAY,MAAM,IAAI,EAAE,GAAG;AACrC,YAAI,SAAS,UAAU,UAAU,OAAO;AACtC,mBAAS,QAAQ,UAAU;AAC3B,oBAAU,QAAQ,SAAS;AAC3B,gBAAM,OAAO,GAAG,CAAC;AACjB,2BAAiB,IAAI;AACrB;AAAA,QACF;AAAA,MACF;AACA,wBAAkB;AAAA,IACpB;AAAA,EACF;AACF;AAEA,MAAM,iBAAiB;AACvB,MAAM,iBAAiB;AAGhB,8BAAwB,UAAU,UAAU,SAAS;AAG1D,YAAW,OAAO,YAAY,YAAa,EAAE,gBAAgB,QAAQ,IAAK,WAAW,CAAC;AACtF,aAAW,YAAY,CAAC;AACxB,aAAW,YAAY,CAAC;AAExB,MAAI,SAAS,SAAS,SAAS,QAAQ;AAAE,WAAO,4BAA4B,UAAU,UAAU,gBAAgB,gBAAgB,OAAO;AAAA,EAAE,OAAO;AAAE,WAAO,4BAA4B,UAAU,UAAU,gBAAgB,gBAAgB,OAAO;AAAA,EAAE;AACpP;AAEA,qCAAsC,UAAU,UAAU,gBAAgB,gBAAgB,SAAS;AACjG,MAAI,QAAQ,KAAK,KACf,QAAQ,KAAK,KACb,qBAAqB,CAAC,GACtB,UAAU,cAAc,SAAS,QACjC,UAAU,cAAc,SAAS,QACjC,eAAgB,cAAc,eAAgB,GAC9C,cAAc,cAAc,cAAc,GAC1C,SAAS,SACT,mBAAmB;AAErB,OAAK,WAAW,GAAG,YAAY,aAAa,YAAY;AACtD,cAAU;AACV,uBAAmB,KAAK,UAAU,CAAC,CAAC;AACpC,wBAAoB,MAAM,aAAa,WAAW,YAAY;AAC9D,wBAAoB,MAAM,GAAG,WAAW,CAAC;AACzC,SAAK,WAAW,mBAAmB,YAAY,mBAAmB,YAAY;AAC5E,UAAI,CAAC,UAAU;AACb,gBAAQ,YAAY,WAAW;AAAA,MACjC,WAAW,CAAC,UAAU;AAEpB,gBAAQ,YAAY,WAAW;AAAA,MACjC,WAAW,SAAS,WAAW,OAAO,SAAS,WAAW,IAAI;AAC5D,gBAAQ,YAAY,QAAQ,WAAW;AAAA,MACzC,OAAO;AACL,YAAI,gBAAgB,QAAQ,aAAa;AACzC,YAAI,eAAe,QAAQ,WAAW,MAAM;AAC5C,gBAAQ,YAAY,MAAM,eAAe,YAAY,IAAI;AAAA,MAC3D;AAAA,IACF;AAAA,EACF;AAEA,MAAI,aAAa,CAAC,GAAG,YAAY,WAAW,CAAC,GAAG,WAAW,CAAC;AAC5D,OAAK,WAAW,aAAa,WAAW,aAAa,YAAY,YAAW;AAC1E,iBAAa,mBAAmB,UAAU,YAAY;AACtD,QAAI,YAAY,eAAe,mBAAmB,UAAU,WAAW,IAAI;AACzE,eAAS,KAAK,WAAW,WAAW,UAAU;AAAA,QAC5C,UAAU;AAAA,QACV,SAAS,SAAS,EAAE;AAAA,QACpB,SAAS;AAAA,MAAS,CAAC;AAAA,IACvB,WAAW,YAAY,eAAe,mBAAmB,WAAW,GAAG,WAAW;AAChF,eAAS,KAAK,WAAW,WAAW,UAAU;AAAA,QAC5C,UAAU;AAAA,QACV,SAAS,SAAS,EAAE;AAAA,QACpB,SAAS;AAAA,MAAS,CAAC;AAAA,IACvB,OAAO;AACL,QAAE;AACF,QAAE;AACF,UAAI,CAAC,QAAQ,QAAQ;AACnB,mBAAW,KAAK;AAAA,UACd,UAAU;AAAA,UACV,SAAS,SAAS;AAAA,QAAU,CAAC;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAIA,6BAA2B,UAAU,UAAU,CAAC,QAAQ,kBAAkB,cAAc,EAAE;AAE1F,SAAO,WAAW,QAAQ;AAC5B;",
+  "sourcesContent": ["//\n// Array utilities\n//\n// Note that the array functions may be called with\n// Array-like things, such as NodeList.\n\nconst { isArray } = Array\n\nexport function arrayForEach<T = any>(\n  array: T[],\n  action: (item: T, index?: number, array?: T[]) => void,\n  actionOwner?: any\n): void {\n  if (arguments.length > 2) {\n    action = action.bind(actionOwner)\n  }\n  for (let i = 0, j = array.length; i < j; ++i) {\n    action(array[i], i, array)\n  }\n}\n\nexport function arrayIndexOf<T = any>(array: Array<T>, item: T): number {\n  return (isArray(array) ? array : [...array]).indexOf(item)\n}\n\nexport function arrayFirst<T = any>(\n  array: T[],\n  predicate: (item: T, index?: number) => boolean,\n  predicateOwner?: any\n): T | undefined {\n  return (isArray(array) ? array : [...array]).find(predicate, predicateOwner)\n}\n\nexport function arrayMap<T = any, U = any>(array: ArrayLike<T>, mapping: (item: T, index?: number) => U, thisArg?) {\n  if (arguments.length > 2) {\n    mapping = mapping.bind(thisArg)\n  }\n  return array === null ? [] : Array.from(array, mapping)\n}\n\nexport function arrayRemoveItem<T = any>(array: Array<T>, itemToRemove: T): void {\n  const index = arrayIndexOf(array, itemToRemove)\n  if (index > 0) {\n    array.splice(index, 1)\n  } else if (index === 0) {\n    array.shift()\n  }\n}\n\nexport function arrayGetDistinctValues<T = any>(array: T[]): T[] {\n  const seen = new Set()\n  if (array === null) {\n    return []\n  }\n  return (isArray(array) ? array : [...array]).filter(item => (seen.has(item) ? false : seen.add(item)))\n}\n\nexport function arrayFilter<T = any>(\n  array: T[],\n  predicate: (item: T, index?: number) => boolean,\n  predicateOwner?: any\n): T[] {\n  if (arguments.length > 2) {\n    predicate = predicate.bind(predicateOwner)\n  }\n  return array === null ? [] : (isArray(array) ? array : [...array]).filter(predicate)\n}\n\nexport function arrayPushAll<T = any>(array: Array<T>, valuesToPush: ArrayLike<T>): T[] {\n  if (isArray(valuesToPush)) {\n    array.push.apply(array, valuesToPush)\n  } else {\n    for (let i = 0, j = valuesToPush.length; i < j; i++) {\n      array.push(valuesToPush[i])\n    }\n  }\n  return array\n}\n\nexport function addOrRemoveItem(array, value, included: boolean) {\n  const existingEntryIndex = arrayIndexOf(typeof array.peek === 'function' ? array.peek() : array, value)\n  if (existingEntryIndex < 0) {\n    if (included) {\n      array.push(value)\n    }\n  } else {\n    if (!included) {\n      array.splice(existingEntryIndex, 1)\n    }\n  }\n}\n\nexport function makeArray<T = any>(arrayLikeObject: ArrayLike<T>): T[] {\n  return Array.from(arrayLikeObject)\n}\n\n//TODO May be MaybeSubscribable<number> -> I actually don't want the dependency\nexport function range(min: () => number | number, max: () => number | number): number[] {\n  const minimum = typeof min === 'function' ? (min as () => number)() : (min as number)\n  const maximum = typeof max === 'function' ? (max as () => number)() : (max as number)\n  const result: number[] = []\n  for (let i = minimum as number; i <= maximum; i++) {\n    result.push(i)\n  }\n  return result\n}\n\n// Go through the items that have been added and deleted and try to find matches between them.\nexport function findMovesInArrayComparison(left, right, limitFailedCompares?: number | boolean) {\n  if (left.length && right.length) {\n    let failedCompares, l, r, leftItem, rightItem\n    for (\n      failedCompares = l = 0;\n      (!limitFailedCompares || failedCompares < limitFailedCompares) && (leftItem = left[l]);\n      ++l\n    ) {\n      for (r = 0; (rightItem = right[r]); ++r) {\n        if (leftItem.value === rightItem.value) {\n          leftItem.moved = rightItem.index\n          rightItem.moved = leftItem.index\n          right.splice(r, 1) // This item is marked as moved; so remove it from right list\n          failedCompares = r = 0 // Reset failed compares count because we're checking for consecutive failures\n          break\n        }\n      }\n      failedCompares += r\n    }\n  }\n}\n\nconst statusNotInOld = 'added'\nconst statusNotInNew = 'deleted'\n\nexport interface ArrayChange<T = any> {\n  status: 'added' | 'deleted' | 'retained'\n  value: T\n  index: number\n  moved?: number\n}\n\nexport type ArrayChanges<T = any> = ArrayChange<T>[]\n\nexport interface CompareArraysOptions {\n  dontLimitMoves?: boolean\n  sparse?: boolean\n}\n\n// Simple calculation based on Levenshtein distance.\nexport function compareArrays<T = any>(\n  oldArray: T[],\n  newArray: T[],\n  options?: CompareArraysOptions | boolean\n): ArrayChanges<T> {\n  // For backward compatibility, if the third arg is actually a bool, interpret\n  // it as the old parameter 'dontLimitMoves'. Newer code should use { dontLimitMoves: true }.\n  options = typeof options === 'boolean' ? { dontLimitMoves: options } : options || {}\n  oldArray = oldArray || []\n  newArray = newArray || []\n\n  if (oldArray.length < newArray.length) {\n    return compareSmallArrayToBigArray(oldArray, newArray, statusNotInOld, statusNotInNew, options)\n  } else {\n    return compareSmallArrayToBigArray(newArray, oldArray, statusNotInNew, statusNotInOld, options)\n  }\n}\n\nfunction compareSmallArrayToBigArray<T = any>(\n  smlArray: T[],\n  bigArray: T[],\n  statusNotInSml: 'added' | 'deleted',\n  statusNotInBig: 'added' | 'deleted',\n  options: CompareArraysOptions\n): ArrayChanges<T> {\n  let myMin = Math.min,\n    myMax = Math.max,\n    editDistanceMatrix = new Array(),\n    smlIndex,\n    smlIndexMax = smlArray.length,\n    bigIndex,\n    bigIndexMax = bigArray.length,\n    compareRange = bigIndexMax - smlIndexMax || 1,\n    maxDistance = smlIndexMax + bigIndexMax + 1,\n    thisRow,\n    lastRow,\n    bigIndexMaxForRow,\n    bigIndexMinForRow\n\n  for (smlIndex = 0; smlIndex <= smlIndexMax; smlIndex++) {\n    lastRow = thisRow\n    editDistanceMatrix.push((thisRow = new Array()))\n    bigIndexMaxForRow = myMin(bigIndexMax, smlIndex + compareRange)\n    bigIndexMinForRow = myMax(0, smlIndex - 1)\n    for (bigIndex = bigIndexMinForRow; bigIndex <= bigIndexMaxForRow; bigIndex++) {\n      if (!bigIndex) {\n        thisRow[bigIndex] = smlIndex + 1\n      } else if (!smlIndex) {\n        // Top row - transform empty array into new array via additions\n        thisRow[bigIndex] = bigIndex + 1\n      } else if (smlArray[smlIndex - 1] === bigArray[bigIndex - 1]) {\n        thisRow[bigIndex] = lastRow[bigIndex - 1]\n      } else {\n        // copy value (no edit)\n        const northDistance = lastRow[bigIndex] || maxDistance // not in big (deletion)\n        const westDistance = thisRow[bigIndex - 1] || maxDistance // not in small (addition)\n        thisRow[bigIndex] = myMin(northDistance, westDistance) + 1\n      }\n    }\n  }\n\n  let editScript = new Array(),\n    meMinusOne,\n    notInSml = new Array(),\n    notInBig = new Array()\n  for (smlIndex = smlIndexMax, bigIndex = bigIndexMax; smlIndex || bigIndex; ) {\n    meMinusOne = editDistanceMatrix[smlIndex][bigIndex] - 1\n    if (bigIndex && meMinusOne === editDistanceMatrix[smlIndex][bigIndex - 1]) {\n      notInSml.push(\n        (editScript[editScript.length] = {\n          // added\n          status: statusNotInSml,\n          value: bigArray[--bigIndex],\n          index: bigIndex\n        })\n      )\n    } else if (smlIndex && meMinusOne === editDistanceMatrix[smlIndex - 1][bigIndex]) {\n      notInBig.push(\n        (editScript[editScript.length] = {\n          // deleted\n          status: statusNotInBig,\n          value: smlArray[--smlIndex],\n          index: smlIndex\n        })\n      )\n    } else {\n      --bigIndex\n      --smlIndex\n      if (!options?.sparse) {\n        editScript.push({ status: 'retained', value: bigArray[bigIndex] })\n      }\n    }\n  }\n\n  // Set a limit on the number of consecutive non-matching comparisons; having it a multiple of\n  // smlIndexMax keeps the time complexity of this algorithm linear.\n  findMovesInArrayComparison(notInBig, notInSml, !options.dontLimitMoves && smlIndexMax * 10)\n\n  return editScript.reverse()\n}\n"],
+  "mappings": ";;AAMA,MAAM,EAAE,QAAQ,IAAI;AAEb,gBAAS,aACd,OACA,QACA,aACM;AACN,MAAI,UAAU,SAAS,GAAG;AACxB,aAAS,OAAO,KAAK,WAAW;AAAA,EAClC;AACA,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAI,GAAG,EAAE,GAAG;AAC5C,WAAO,MAAM,CAAC,GAAG,GAAG,KAAK;AAAA,EAC3B;AACF;AAEO,gBAAS,aAAsB,OAAiB,MAAiB;AACtE,UAAQ,QAAQ,KAAK,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG,QAAQ,IAAI;AAC3D;AAEO,gBAAS,WACd,OACA,WACA,gBACe;AACf,UAAQ,QAAQ,KAAK,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG,KAAK,WAAW,cAAc;AAC7E;AAEO,gBAAS,SAA2B,OAAqB,SAAyC,SAAU;AACjH,MAAI,UAAU,SAAS,GAAG;AACxB,cAAU,QAAQ,KAAK,OAAO;AAAA,EAChC;AACA,SAAO,UAAU,OAAO,CAAC,IAAI,MAAM,KAAK,OAAO,OAAO;AACxD;AAEO,gBAAS,gBAAyB,OAAiB,cAAuB;AAC/E,QAAM,QAAQ,aAAa,OAAO,YAAY;AAC9C,MAAI,QAAQ,GAAG;AACb,UAAM,OAAO,OAAO,CAAC;AAAA,EACvB,WAAW,UAAU,GAAG;AACtB,UAAM,MAAM;AAAA,EACd;AACF;AAEO,gBAAS,uBAAgC,OAAiB;AAC/D,QAAM,OAAO,oBAAI,IAAI;AACrB,MAAI,UAAU,MAAM;AAClB,WAAO,CAAC;AAAA,EACV;AACA,UAAQ,QAAQ,KAAK,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG,OAAO,UAAS,KAAK,IAAI,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAE;AACvG;AAEO,gBAAS,YACd,OACA,WACA,gBACK;AACL,MAAI,UAAU,SAAS,GAAG;AACxB,gBAAY,UAAU,KAAK,cAAc;AAAA,EAC3C;AACA,SAAO,UAAU,OAAO,CAAC,KAAK,QAAQ,KAAK,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG,OAAO,SAAS;AACrF;AAEO,gBAAS,aAAsB,OAAiB,cAAiC;AACtF,MAAI,QAAQ,YAAY,GAAG;AACzB,UAAM,KAAK,MAAM,OAAO,YAAY;AAAA,EACtC,OAAO;AACL,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAI,GAAG,KAAK;AACnD,YAAM,KAAK,aAAa,CAAC,CAAC;AAAA,IAC5B;AAAA,EACF;AACA,SAAO;AACT;AAEO,gBAAS,gBAAgB,OAAO,OAAO,UAAmB;AAC/D,QAAM,qBAAqB,aAAa,OAAO,MAAM,SAAS,aAAa,MAAM,KAAK,IAAI,OAAO,KAAK;AACtG,MAAI,qBAAqB,GAAG;AAC1B,QAAI,UAAU;AACZ,YAAM,KAAK,KAAK;AAAA,IAClB;AAAA,EACF,OAAO;AACL,QAAI,CAAC,UAAU;AACb,YAAM,OAAO,oBAAoB,CAAC;AAAA,IACpC;AAAA,EACF;AACF;AAEO,gBAAS,UAAmB,iBAAoC;AACrE,SAAO,MAAM,KAAK,eAAe;AACnC;AAGO,gBAAS,MAAM,KAA4B,KAAsC;AACtF,QAAM,UAAU,OAAO,QAAQ,aAAc,IAAqB,IAAK;AACvE,QAAM,UAAU,OAAO,QAAQ,aAAc,IAAqB,IAAK;AACvE,QAAM,SAAmB,CAAC;AAC1B,WAAS,IAAI,SAAmB,KAAK,SAAS,KAAK;AACjD,WAAO,KAAK,CAAC;AAAA,EACf;AACA,SAAO;AACT;AAGO,gBAAS,2BAA2B,MAAM,OAAO,qBAAwC;AAC9F,MAAI,KAAK,UAAU,MAAM,QAAQ;AAC/B,QAAI,gBAAgB,GAAG,GAAG,UAAU;AACpC,SACE,iBAAiB,IAAI,IACpB,CAAC,uBAAuB,iBAAiB,yBAAyB,WAAW,KAAK,CAAC,IACpF,EAAE,GACF;AACA,WAAK,IAAI,GAAI,YAAY,MAAM,CAAC,GAAI,EAAE,GAAG;AACvC,YAAI,SAAS,UAAU,UAAU,OAAO;AACtC,mBAAS,QAAQ,UAAU;AAC3B,oBAAU,QAAQ,SAAS;AAC3B,gBAAM,OAAO,GAAG,CAAC;AACjB,2BAAiB,IAAI;AACrB;AAAA,QACF;AAAA,MACF;AACA,wBAAkB;AAAA,IACpB;AAAA,EACF;AACF;AAEA,MAAM,iBAAiB;AACvB,MAAM,iBAAiB;AAiBhB,gBAAS,cACd,UACA,UACA,SACiB;AAGjB,YAAU,OAAO,YAAY,YAAY,EAAE,gBAAgB,QAAQ,IAAI,WAAW,CAAC;AACnF,aAAW,YAAY,CAAC;AACxB,aAAW,YAAY,CAAC;AAExB,MAAI,SAAS,SAAS,SAAS,QAAQ;AACrC,WAAO,4BAA4B,UAAU,UAAU,gBAAgB,gBAAgB,OAAO;AAAA,EAChG,OAAO;AACL,WAAO,4BAA4B,UAAU,UAAU,gBAAgB,gBAAgB,OAAO;AAAA,EAChG;AACF;AAEA,SAAS,4BACP,UACA,UACA,gBACA,gBACA,SACiB;AACjB,MAAI,QAAQ,KAAK,KACf,QAAQ,KAAK,KACb,qBAAqB,IAAI,MAAM,GAC/B,UACA,cAAc,SAAS,QACvB,UACA,cAAc,SAAS,QACvB,eAAe,cAAc,eAAe,GAC5C,cAAc,cAAc,cAAc,GAC1C,SACA,SACA,mBACA;AAEF,OAAK,WAAW,GAAG,YAAY,aAAa,YAAY;AACtD,cAAU;AACV,uBAAmB,KAAM,UAAU,IAAI,MAAM,CAAE;AAC/C,wBAAoB,MAAM,aAAa,WAAW,YAAY;AAC9D,wBAAoB,MAAM,GAAG,WAAW,CAAC;AACzC,SAAK,WAAW,mBAAmB,YAAY,mBAAmB,YAAY;AAC5E,UAAI,CAAC,UAAU;AACb,gBAAQ,QAAQ,IAAI,WAAW;AAAA,MACjC,WAAW,CAAC,UAAU;AAEpB,gBAAQ,QAAQ,IAAI,WAAW;AAAA,MACjC,WAAW,SAAS,WAAW,CAAC,MAAM,SAAS,WAAW,CAAC,GAAG;AAC5D,gBAAQ,QAAQ,IAAI,QAAQ,WAAW,CAAC;AAAA,MAC1C,OAAO;AAEL,cAAM,gBAAgB,QAAQ,QAAQ,KAAK;AAC3C,cAAM,eAAe,QAAQ,WAAW,CAAC,KAAK;AAC9C,gBAAQ,QAAQ,IAAI,MAAM,eAAe,YAAY,IAAI;AAAA,MAC3D;AAAA,IACF;AAAA,EACF;AAEA,MAAI,aAAa,IAAI,MAAM,GACzB,YACA,WAAW,IAAI,MAAM,GACrB,WAAW,IAAI,MAAM;AACvB,OAAK,WAAW,aAAa,WAAW,aAAa,YAAY,YAAY;AAC3E,iBAAa,mBAAmB,QAAQ,EAAE,QAAQ,IAAI;AACtD,QAAI,YAAY,eAAe,mBAAmB,QAAQ,EAAE,WAAW,CAAC,GAAG;AACzE,eAAS;AAAA,QACN,WAAW,WAAW,MAAM,IAAI;AAAA;AAAA,UAE/B,QAAQ;AAAA,UACR,OAAO,SAAS,EAAE,QAAQ;AAAA,UAC1B,OAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF,WAAW,YAAY,eAAe,mBAAmB,WAAW,CAAC,EAAE,QAAQ,GAAG;AAChF,eAAS;AAAA,QACN,WAAW,WAAW,MAAM,IAAI;AAAA;AAAA,UAE/B,QAAQ;AAAA,UACR,OAAO,SAAS,EAAE,QAAQ;AAAA,UAC1B,OAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF,OAAO;AACL,QAAE;AACF,QAAE;AACF,UAAI,CAAC,SAAS,QAAQ;AACpB,mBAAW,KAAK,EAAE,QAAQ,YAAY,OAAO,SAAS,QAAQ,EAAE,CAAC;AAAA,MACnE;AAAA,IACF;AAAA,EACF;AAIA,6BAA2B,UAAU,UAAU,CAAC,QAAQ,kBAAkB,cAAc,EAAE;AAE1F,SAAO,WAAW,QAAQ;AAC5B;",
   "names": []
 }

package/dist/async.js

@@ -1,7 +1,8 @@
-// @tko/utils 🥊 4.0.0-beta1.0 ESM
+// @tko/utils 🥊 4.0.0 ESM
+"use strict";
 import { safeSetTimeout } from "./error";
 export function throttle(callback, timeout) {
-  var timeoutInstance;
+  let timeoutInstance;
   return function(...args) {
     if (!timeoutInstance) {
       timeoutInstance = safeSetTimeout(function() {
@@ -12,7 +13,7 @@ export function throttle(callback, timeout) {
   };
 }
 export function debounce(callback, timeout) {
-  var timeoutInstance;
+  let timeoutInstance;
   return function(...args) {
     clearTimeout(timeoutInstance);
     timeoutInstance = safeSetTimeout(() => callback(...args), timeout);

package/dist/async.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/async.ts"],
-  "sourcesContent": ["//\n// Asynchronous functionality\n// ---\nimport { safeSetTimeout } from './error'\n\nexport function throttle (callback, timeout) {\n  var timeoutInstance\n  return function (...args) {\n    if (!timeoutInstance) {\n      timeoutInstance = safeSetTimeout(function () {\n        timeoutInstance = undefined\n        callback(...args)\n      }, timeout)\n    }\n  }\n}\n\nexport function debounce (callback, timeout) {\n  var timeoutInstance\n  return function (...args) {\n    clearTimeout(timeoutInstance)\n    timeoutInstance = safeSetTimeout(() => callback(...args), timeout)\n  }\n}\n"],
-  "mappings": ";AAGA;AAEO,yBAAmB,UAAU,SAAS;AAC3C,MAAI;AACJ,SAAO,YAAa,MAAM;AACxB,QAAI,CAAC,iBAAiB;AACpB,wBAAkB,eAAe,WAAY;AAC3C,0BAAkB;AAClB,iBAAS,GAAG,IAAI;AAAA,MAClB,GAAG,OAAO;AAAA,IACZ;AAAA,EACF;AACF;AAEO,yBAAmB,UAAU,SAAS;AAC3C,MAAI;AACJ,SAAO,YAAa,MAAM;AACxB,iBAAa,eAAe;AAC5B,sBAAkB,eAAe,MAAM,SAAS,GAAG,IAAI,GAAG,OAAO;AAAA,EACnE;AACF;",
+  "sourcesContent": ["//\n// Asynchronous functionality\n// ---\nimport { safeSetTimeout } from './error'\n\nexport function throttle(callback, timeout) {\n  let timeoutInstance: ReturnType<typeof setTimeout> | undefined\n  return function (...args) {\n    if (!timeoutInstance) {\n      timeoutInstance = safeSetTimeout(function () {\n        timeoutInstance = undefined\n        callback(...args)\n      }, timeout)\n    }\n  }\n}\n\nexport function debounce(callback, timeout: number) {\n  let timeoutInstance: ReturnType<typeof setTimeout>\n  return function (...args) {\n    clearTimeout(timeoutInstance)\n    timeoutInstance = safeSetTimeout(() => callback(...args), timeout)\n  }\n}\n"],
+  "mappings": ";;AAGA,SAAS,sBAAsB;AAExB,gBAAS,SAAS,UAAU,SAAS;AAC1C,MAAI;AACJ,SAAO,YAAa,MAAM;AACxB,QAAI,CAAC,iBAAiB;AACpB,wBAAkB,eAAe,WAAY;AAC3C,0BAAkB;AAClB,iBAAS,GAAG,IAAI;AAAA,MAClB,GAAG,OAAO;AAAA,IACZ;AAAA,EACF;AACF;AAEO,gBAAS,SAAS,UAAU,SAAiB;AAClD,MAAI;AACJ,SAAO,YAAa,MAAM;AACxB,iBAAa,eAAe;AAC5B,sBAAkB,eAAe,MAAM,SAAS,GAAG,IAAI,GAAG,OAAO;AAAA,EACnE;AACF;",
   "names": []
 }

package/dist/css.js

@@ -1,8 +1,9 @@
-// @tko/utils 🥊 4.0.0-beta1.0 ESM
+// @tko/utils 🥊 4.0.0 ESM
+"use strict";
 import { arrayForEach, addOrRemoveItem } from "./array";
-var cssClassNameRegex = /\S+/g;
+const cssClassNameRegex = /\S+/g;
 function toggleDomNodeCssClass(node, classNames, shouldHaveClass) {
-  var addOrRemoveFn;
+  let addOrRemoveFn;
   if (!classNames) {
     return;
   }
@@ -18,7 +19,7 @@ function toggleDomNodeCssClass(node, classNames, shouldHaveClass) {
   }
 }
 function toggleObjectClassPropertyString(obj, prop, classNames, shouldHaveClass) {
-  var currentClassNames = obj[prop].match(cssClassNameRegex) || [];
+  const currentClassNames = obj[prop].match(cssClassNameRegex) || [];
   arrayForEach(classNames.match(cssClassNameRegex), function(className) {
     addOrRemoveItem(currentClassNames, className, shouldHaveClass);
   });

package/dist/css.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/css.ts"],
-  "sourcesContent": ["//\n// DOM - CSS\n//\n\nimport { arrayForEach, addOrRemoveItem } from './array'\n\n// For details on the pattern for changing node classes\n// see: https://github.com/knockout/knockout/issues/1597\nvar cssClassNameRegex = /\\S+/g\n\nfunction toggleDomNodeCssClass (node, classNames, shouldHaveClass) {\n  var addOrRemoveFn\n  if (!classNames) { return }\n  if (typeof node.classList === 'object') {\n    addOrRemoveFn = node.classList[shouldHaveClass ? 'add' : 'remove']\n    arrayForEach(classNames.match(cssClassNameRegex), function (className) {\n      addOrRemoveFn.call(node.classList, className)\n    })\n  } else if (typeof node.className['baseVal'] === 'string') {\n        // SVG tag .classNames is an SVGAnimatedString instance\n    toggleObjectClassPropertyString(node.className, 'baseVal', classNames, shouldHaveClass)\n  } else {\n        // node.className ought to be a string.\n    toggleObjectClassPropertyString(node, 'className', classNames, shouldHaveClass)\n  }\n}\n\nfunction toggleObjectClassPropertyString (obj, prop, classNames, shouldHaveClass) {\n    // obj/prop is either a node/'className' or a SVGAnimatedString/'baseVal'.\n  var currentClassNames = obj[prop].match(cssClassNameRegex) || []\n  arrayForEach(classNames.match(cssClassNameRegex), function (className) {\n    addOrRemoveItem(currentClassNames, className, shouldHaveClass)\n  })\n  obj[prop] = currentClassNames.join(' ')\n}\n\nexport { toggleDomNodeCssClass }\n"],
-  "mappings": ";AAIA;AAIA,IAAI,oBAAoB;AAExB,+BAAgC,MAAM,YAAY,iBAAiB;AACjE,MAAI;AACJ,MAAI,CAAC,YAAY;AAAE;AAAA,EAAO;AAC1B,MAAI,OAAO,KAAK,cAAc,UAAU;AACtC,oBAAgB,KAAK,UAAU,kBAAkB,QAAQ;AACzD,iBAAa,WAAW,MAAM,iBAAiB,GAAG,SAAU,WAAW;AACrE,oBAAc,KAAK,KAAK,WAAW,SAAS;AAAA,IAC9C,CAAC;AAAA,EACH,WAAW,OAAO,KAAK,UAAU,eAAe,UAAU;AAExD,oCAAgC,KAAK,WAAW,WAAW,YAAY,eAAe;AAAA,EACxF,OAAO;AAEL,oCAAgC,MAAM,aAAa,YAAY,eAAe;AAAA,EAChF;AACF;AAEA,yCAA0C,KAAK,MAAM,YAAY,iBAAiB;AAEhF,MAAI,oBAAoB,IAAI,MAAM,MAAM,iBAAiB,KAAK,CAAC;AAC/D,eAAa,WAAW,MAAM,iBAAiB,GAAG,SAAU,WAAW;AACrE,oBAAgB,mBAAmB,WAAW,eAAe;AAAA,EAC/D,CAAC;AACD,MAAI,QAAQ,kBAAkB,KAAK,GAAG;AACxC;AAEA;",
+  "sourcesContent": ["//\n// DOM - CSS\n//\n\nimport { arrayForEach, addOrRemoveItem } from './array'\n\n// For details on the pattern for changing node classes\n// see: https://github.com/knockout/knockout/issues/1597\nconst cssClassNameRegex = /\\S+/g\n\nfunction toggleDomNodeCssClass(node: Element, classNames: string, shouldHaveClass?: boolean): void {\n  let addOrRemoveFn\n  if (!classNames) {\n    return\n  }\n  if (typeof node.classList === 'object') {\n    addOrRemoveFn = node.classList[shouldHaveClass ? 'add' : 'remove']\n    arrayForEach(classNames.match(cssClassNameRegex)!, function (className) {\n      addOrRemoveFn.call(node.classList, className)\n    })\n  } else if (typeof node.className['baseVal'] === 'string') {\n    // SVG tag .classNames is an SVGAnimatedString instance\n    toggleObjectClassPropertyString(node.className, 'baseVal', classNames, shouldHaveClass)\n  } else {\n    // node.className ought to be a string.\n    toggleObjectClassPropertyString(node, 'className', classNames, shouldHaveClass)\n  }\n}\n\nfunction toggleObjectClassPropertyString(obj, prop, classNames, shouldHaveClass) {\n  // obj/prop is either a node/'className' or a SVGAnimatedString/'baseVal'.\n  const currentClassNames = obj[prop].match(cssClassNameRegex) || []\n  arrayForEach(classNames.match(cssClassNameRegex), function (className) {\n    addOrRemoveItem(currentClassNames, className, shouldHaveClass)\n  })\n  obj[prop] = currentClassNames.join(' ')\n}\n\nexport { toggleDomNodeCssClass }\n"],
+  "mappings": ";;AAIA,SAAS,cAAc,uBAAuB;AAI9C,MAAM,oBAAoB;AAE1B,SAAS,sBAAsB,MAAe,YAAoB,iBAAiC;AACjG,MAAI;AACJ,MAAI,CAAC,YAAY;AACf;AAAA,EACF;AACA,MAAI,OAAO,KAAK,cAAc,UAAU;AACtC,oBAAgB,KAAK,UAAU,kBAAkB,QAAQ,QAAQ;AACjE,iBAAa,WAAW,MAAM,iBAAiB,GAAI,SAAU,WAAW;AACtE,oBAAc,KAAK,KAAK,WAAW,SAAS;AAAA,IAC9C,CAAC;AAAA,EACH,WAAW,OAAO,KAAK,UAAU,SAAS,MAAM,UAAU;AAExD,oCAAgC,KAAK,WAAW,WAAW,YAAY,eAAe;AAAA,EACxF,OAAO;AAEL,oCAAgC,MAAM,aAAa,YAAY,eAAe;AAAA,EAChF;AACF;AAEA,SAAS,gCAAgC,KAAK,MAAM,YAAY,iBAAiB;AAE/E,QAAM,oBAAoB,IAAI,IAAI,EAAE,MAAM,iBAAiB,KAAK,CAAC;AACjE,eAAa,WAAW,MAAM,iBAAiB,GAAG,SAAU,WAAW;AACrE,oBAAgB,mBAAmB,WAAW,eAAe;AAAA,EAC/D,CAAC;AACD,MAAI,IAAI,IAAI,kBAAkB,KAAK,GAAG;AACxC;AAEA,SAAS;",
   "names": []
 }

package/dist/dom/data.js

@@ -1,63 +1,53 @@
-// @tko/utils 🥊 4.0.0-beta1.0 ESM
-import { ieVersion } from "../ie";
-const datastoreTime = new Date().getTime();
+// @tko/utils 🥊 4.0.0 ESM
+"use strict";
+const datastoreTime = (/* @__PURE__ */ new Date()).getTime();
 const dataStoreKeyExpandoPropertyName = `__ko__${datastoreTime}`;
-const dataStoreSymbol = Symbol("Knockout data");
-var dataStore;
+const dataStoreSymbol = /* @__PURE__ */ Symbol("Knockout data");
+const dataStore = {};
 let uniqueId = 0;
-const modern = {
-  getDataForNode(node, createIfNotFound) {
-    let dataForNode = node[dataStoreSymbol];
-    if (!dataForNode && createIfNotFound) {
-      dataForNode = node[dataStoreSymbol] = {};
-    }
-    return dataForNode;
-  },
-  clear(node) {
-    if (node[dataStoreSymbol]) {
-      delete node[dataStoreSymbol];
-      return true;
-    }
-    return false;
+function isSafeKey(key) {
+  return key !== "__proto__" && key !== "constructor" && key !== "prototype";
+}
+function getDataForNode(node, createIfNotFound) {
+  let dataForNode = node[dataStoreSymbol];
+  if (!dataForNode && createIfNotFound) {
+    dataForNode = node[dataStoreSymbol] = {};
   }
-};
-const IE = {
-  getDataforNode(node, createIfNotFound) {
-    let dataStoreKey = node[dataStoreKeyExpandoPropertyName];
-    const hasExistingDataStore = dataStoreKey && dataStoreKey !== "null" && dataStore[dataStoreKey];
-    if (!hasExistingDataStore) {
-      if (!createIfNotFound) {
-        return void 0;
-      }
-      dataStoreKey = node[dataStoreKeyExpandoPropertyName] = "ko" + uniqueId++;
-      dataStore[dataStoreKey] = {};
-    }
-    return dataStore[dataStoreKey];
-  },
-  clear(node) {
-    const dataStoreKey = node[dataStoreKeyExpandoPropertyName];
-    if (dataStoreKey) {
-      delete dataStore[dataStoreKey];
-      node[dataStoreKeyExpandoPropertyName] = null;
-      return true;
-    }
-    return false;
+  return dataForNode;
+}
+function clear(node) {
+  if (node[dataStoreSymbol]) {
+    delete node[dataStoreSymbol];
+    return true;
   }
-};
-const { getDataForNode, clear } = ieVersion ? IE : modern;
+  return false;
+}
 export function nextKey() {
   return uniqueId++ + dataStoreKeyExpandoPropertyName;
 }
 function get(node, key) {
+  if (!isSafeKey(key)) throw new Error("Unsafe key for DOM data: " + key);
   const dataForNode = getDataForNode(node, false);
   return dataForNode && dataForNode[key];
 }
 function set(node, key, value) {
-  var dataForNode = getDataForNode(node, value !== void 0);
-  dataForNode && (dataForNode[key] = value);
+  if (!isSafeKey(key)) throw new Error("Unsafe key for DOM data: " + key);
+  const dataForNode = getDataForNode(
+    node,
+    value !== void 0
+    /* createIfNotFound */
+  );
+  if (dataForNode) {
+    dataForNode[key] = value;
+  }
 }
 function getOrSet(node, key, value) {
-  const dataForNode = getDataForNode(node, true);
+  if (!isSafeKey(key)) throw new Error("Unsafe key for DOM data: " + key);
+  const dataForNode = getDataForNode(
+    node,
+    true
+    /* createIfNotFound */
+  );
   return dataForNode[key] || (dataForNode[key] = value);
 }
 export { get, set, getOrSet, clear };

package/dist/dom/data.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/dom/data.ts"],
-  "sourcesContent": ["//\n// DOM node data\n//\nimport { ieVersion } from '../ie'\n\nconst datastoreTime = new Date().getTime()\nconst dataStoreKeyExpandoPropertyName = `__ko__${datastoreTime}`\nconst dataStoreSymbol = Symbol('Knockout data')\nvar dataStore\nlet uniqueId = 0\n\n/*\n * We considered using WeakMap, but it has a problem in IE 11 and Edge that\n * prevents using it cross-window, so instead we just store the data directly\n * on the node. See https://github.com/knockout/knockout/issues/2141\n */\nconst modern = {\n  getDataForNode (node, createIfNotFound) {\n    let dataForNode = node[dataStoreSymbol]\n    if (!dataForNode && createIfNotFound) {\n      dataForNode = node[dataStoreSymbol] = {}\n    }\n    return dataForNode\n  },\n\n  clear (node) {\n    if (node[dataStoreSymbol]) {\n      delete node[dataStoreSymbol]\n      return true\n    }\n    return false\n  }\n}\n\n/**\n * Old IE versions have memory issues if you store objects on the node, so we\n * use a separate data storage and link to it from the node using a string key.\n */\nconst IE = {\n  getDataforNode (node, createIfNotFound) {\n    let dataStoreKey = node[dataStoreKeyExpandoPropertyName]\n    const hasExistingDataStore = dataStoreKey && (dataStoreKey !== 'null') && dataStore[dataStoreKey]\n    if (!hasExistingDataStore) {\n      if (!createIfNotFound) {\n        return undefined\n      }\n      dataStoreKey = node[dataStoreKeyExpandoPropertyName] = 'ko' + uniqueId++\n      dataStore[dataStoreKey] = {}\n    }\n    return dataStore[dataStoreKey]\n  },\n\n  clear (node) {\n    const dataStoreKey = node[dataStoreKeyExpandoPropertyName]\n    if (dataStoreKey) {\n      delete dataStore[dataStoreKey]\n      node[dataStoreKeyExpandoPropertyName] = null\n      return true // Exposing 'did clean' flag purely so specs can infer whether things have been cleaned up as intended\n    }\n    return false\n  }\n}\n\nconst {getDataForNode, clear} = ieVersion ? IE : modern\n\n/**\n * Create a unique key-string identifier.\n */\nexport function nextKey () {\n  return (uniqueId++) + dataStoreKeyExpandoPropertyName\n}\n\nfunction get (node, key) {\n  const dataForNode = getDataForNode(node, false)\n  return dataForNode && dataForNode[key]\n}\n\nfunction set (node, key, value) {\n  // Make sure we don't actually create a new domData key if we are actually deleting a value\n  var dataForNode = getDataForNode(node, value !== undefined /* createIfNotFound */)\n  dataForNode && (dataForNode[key] = value)\n}\n\nfunction getOrSet (node, key, value) {\n  const dataForNode = getDataForNode(node, true, /* createIfNotFound */)\n  return dataForNode[key] || (dataForNode[key] = value)\n}\n\nexport { get, set, getOrSet, clear }\n"],
-  "mappings": ";AAGA;AAEA,MAAM,gBAAgB,IAAI,KAAK,EAAE,QAAQ;AACzC,MAAM,kCAAkC,SAAS;AACjD,MAAM,kBAAkB,OAAO,eAAe;AAC9C,IAAI;AACJ,IAAI,WAAW;AAOf,MAAM,SAAS;AAAA,EACb,eAAgB,MAAM,kBAAkB;AACtC,QAAI,cAAc,KAAK;AACvB,QAAI,CAAC,eAAe,kBAAkB;AACpC,oBAAc,KAAK,mBAAmB,CAAC;AAAA,IACzC;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAO,MAAM;AACX,QAAI,KAAK,kBAAkB;AACzB,aAAO,KAAK;AACZ,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACF;AAMA,MAAM,KAAK;AAAA,EACT,eAAgB,MAAM,kBAAkB;AACtC,QAAI,eAAe,KAAK;AACxB,UAAM,uBAAuB,gBAAiB,iBAAiB,UAAW,UAAU;AACpF,QAAI,CAAC,sBAAsB;AACzB,UAAI,CAAC,kBAAkB;AACrB,eAAO;AAAA,MACT;AACA,qBAAe,KAAK,mCAAmC,OAAO;AAC9D,gBAAU,gBAAgB,CAAC;AAAA,IAC7B;AACA,WAAO,UAAU;AAAA,EACnB;AAAA,EAEA,MAAO,MAAM;AACX,UAAM,eAAe,KAAK;AAC1B,QAAI,cAAc;AAChB,aAAO,UAAU;AACjB,WAAK,mCAAmC;AACxC,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACF;AAEA,MAAM,EAAC,gBAAgB,UAAS,YAAY,KAAK;AAK1C,0BAAoB;AACzB,SAAQ,aAAc;AACxB;AAEA,aAAc,MAAM,KAAK;AACvB,QAAM,cAAc,eAAe,MAAM,KAAK;AAC9C,SAAO,eAAe,YAAY;AACpC;AAEA,aAAc,MAAM,KAAK,OAAO;AAE9B,MAAI,cAAc,eAAe,MAAM,UAAU,MAAgC;AACjF,iBAAgB,aAAY,OAAO;AACrC;AAEA,kBAAmB,MAAM,KAAK,OAAO;AACnC,QAAM,cAAc,eAAe,MAAM,IAA4B;AACrE,SAAO,YAAY,QAAS,aAAY,OAAO;AACjD;AAEA;",
+  "sourcesContent": ["//\n// DOM node data\n//\n\nconst datastoreTime = new Date().getTime()\nconst dataStoreKeyExpandoPropertyName = `__ko__${datastoreTime}`\nconst dataStoreSymbol = Symbol('Knockout data')\nconst dataStore = {}\nlet uniqueId = 0\n\n// Prevent prototype pollution by restricting special property names\nfunction isSafeKey(key: string): boolean {\n  return key !== '__proto__' && key !== 'constructor' && key !== 'prototype'\n}\n\n/*\n * We considered using WeakMap, but it has a problem in IE 11 and Edge that\n * prevents using it cross-window, so instead we just store the data directly\n * on the node. See https://github.com/knockout/knockout/issues/2141\n */\nfunction getDataForNode(node: Node, createIfNotFound: boolean): any {\n  let dataForNode = node[dataStoreSymbol]\n  if (!dataForNode && createIfNotFound) {\n    dataForNode = node[dataStoreSymbol] = {}\n  }\n  return dataForNode\n}\n\nfunction clear(node: Node): boolean {\n  if (node[dataStoreSymbol]) {\n    delete node[dataStoreSymbol]\n    return true\n  }\n  return false\n}\n\n/**\n * Create a unique key-string identifier.\n */\nexport function nextKey() {\n  return uniqueId++ + dataStoreKeyExpandoPropertyName\n}\n\nfunction get(node: Node, key: string) {\n  if (!isSafeKey(key)) throw new Error('Unsafe key for DOM data: ' + key)\n\n  const dataForNode = getDataForNode(node, false)\n  return dataForNode && dataForNode[key]\n}\n\nfunction set(node: Node, key: string, value: any) {\n  if (!isSafeKey(key)) throw new Error('Unsafe key for DOM data: ' + key)\n  // Make sure we don't actually create a new domData key if we are actually deleting a value\n  const dataForNode = getDataForNode(node, value !== undefined /* createIfNotFound */)\n  if (dataForNode) {\n    dataForNode[key] = value\n  }\n}\n\nfunction getOrSet(node: Node, key: string, value: any) {\n  if (!isSafeKey(key)) throw new Error('Unsafe key for DOM data: ' + key)\n  const dataForNode = getDataForNode(node, true /* createIfNotFound */)\n  return dataForNode[key] || (dataForNode[key] = value)\n}\n\nexport { get, set, getOrSet, clear }\n"],
+  "mappings": ";;AAIA,MAAM,iBAAgB,oBAAI,KAAK,GAAE,QAAQ;AACzC,MAAM,kCAAkC,SAAS,aAAa;AAC9D,MAAM,kBAAkB,uBAAO,eAAe;AAC9C,MAAM,YAAY,CAAC;AACnB,IAAI,WAAW;AAGf,SAAS,UAAU,KAAsB;AACvC,SAAO,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ;AACjE;AAOA,SAAS,eAAe,MAAY,kBAAgC;AAClE,MAAI,cAAc,KAAK,eAAe;AACtC,MAAI,CAAC,eAAe,kBAAkB;AACpC,kBAAc,KAAK,eAAe,IAAI,CAAC;AAAA,EACzC;AACA,SAAO;AACT;AAEA,SAAS,MAAM,MAAqB;AAClC,MAAI,KAAK,eAAe,GAAG;AACzB,WAAO,KAAK,eAAe;AAC3B,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKO,gBAAS,UAAU;AACxB,SAAO,aAAa;AACtB;AAEA,SAAS,IAAI,MAAY,KAAa;AACpC,MAAI,CAAC,UAAU,GAAG,EAAG,OAAM,IAAI,MAAM,8BAA8B,GAAG;AAEtE,QAAM,cAAc,eAAe,MAAM,KAAK;AAC9C,SAAO,eAAe,YAAY,GAAG;AACvC;AAEA,SAAS,IAAI,MAAY,KAAa,OAAY;AAChD,MAAI,CAAC,UAAU,GAAG,EAAG,OAAM,IAAI,MAAM,8BAA8B,GAAG;AAEtE,QAAM,cAAc;AAAA,IAAe;AAAA,IAAM,UAAU;AAAA;AAAA,EAAgC;AACnF,MAAI,aAAa;AACf,gBAAY,GAAG,IAAI;AAAA,EACrB;AACF;AAEA,SAAS,SAAS,MAAY,KAAa,OAAY;AACrD,MAAI,CAAC,UAAU,GAAG,EAAG,OAAM,IAAI,MAAM,8BAA8B,GAAG;AACtE,QAAM,cAAc;AAAA,IAAe;AAAA,IAAM;AAAA;AAAA,EAA2B;AACpE,SAAO,YAAY,GAAG,MAAM,YAAY,GAAG,IAAI;AACjD;AAEA,SAAS,KAAK,KAAK,UAAU;",
   "names": []
 }

package/dist/dom/disposal.js

@@ -1,15 +1,15 @@
-// @tko/utils 🥊 4.0.0-beta1.0 ESM
+// @tko/utils 🥊 4.0.0 ESM
+"use strict";
 import * as domData from "./data";
 import { default as options } from "../options";
 import { arrayRemoveItem, arrayIndexOf } from "../array";
-import { jQueryInstance } from "../jquery";
-var domDataKey = domData.nextKey();
-var cleanableNodeTypes = { 1: true, 8: true, 9: true };
-var cleanableNodeTypesWithDescendants = { 1: true, 9: true };
+const domDataKey = domData.nextKey();
+const cleanableNodeTypes = { 1: true, 8: true, 9: true };
+const cleanableNodeTypesWithDescendants = { 1: true, 9: true };
 function getDisposeCallbacksCollection(node, createIfNotFound) {
-  var allDisposeCallbacks = domData.get(node, domDataKey);
+  let allDisposeCallbacks = domData.get(node, domDataKey);
   if (allDisposeCallbacks === void 0 && createIfNotFound) {
-    allDisposeCallbacks = [];
+    allDisposeCallbacks = new Array();
     domData.set(node, domDataKey, allDisposeCallbacks);
   }
   return allDisposeCallbacks;
@@ -18,7 +18,7 @@ function destroyCallbacksCollection(node) {
   domData.set(node, domDataKey, void 0);
 }
 function cleanSingleNode(node) {
-  var callbacks = getDisposeCallbacksCollection(node, false);
+  let callbacks = getDisposeCallbacksCollection(node, false);
   if (callbacks) {
     callbacks = callbacks.slice(0);
     for (let i = 0; i < callbacks.length; i++) {
@@ -33,14 +33,18 @@ function cleanSingleNode(node) {
     options.cleanExternalData(node);
   }
   if (cleanableNodeTypesWithDescendants[node.nodeType]) {
-    cleanNodesInList(node.childNodes, true);
+    cleanNodesInList(
+      node.childNodes,
+      true
+      /* onlyComments */
+    );
   }
 }
 function cleanNodesInList(nodeList, onlyComments) {
-  const cleanedNodes = [];
+  const cleanedNodes = new Array();
   let lastCleanedNode;
-  for (var i = 0; i < nodeList.length; i++) {
-    if (!onlyComments || nodeList[i].nodeType === 8) {
+  for (let i = 0; i < nodeList.length; i++) {
+    if (!onlyComments || nodeList[i].nodeType === Node.COMMENT_NODE) {
       cleanSingleNode(cleanedNodes[cleanedNodes.length] = lastCleanedNode = nodeList[i]);
       if (nodeList[i] !== lastCleanedNode) {
         while (i-- && arrayIndexOf(cleanedNodes, nodeList[i]) === -1) {
@@ -56,7 +60,7 @@ export function addDisposeCallback(node, callback) {
   getDisposeCallbacksCollection(node, true).push(callback);
 }
 export function removeDisposeCallback(node, callback) {
-  var callbacksCollection = getDisposeCallbacksCollection(node, false);
+  const callbacksCollection = getDisposeCallbacksCollection(node, false);
   if (callbacksCollection) {
     arrayRemoveItem(callbacksCollection, callback);
     if (callbacksCollection.length === 0) {
@@ -67,19 +71,22 @@ export function removeDisposeCallback(node, callback) {
 export function cleanNode(node) {
   if (cleanableNodeTypes[node.nodeType]) {
     cleanSingleNode(node);
-    if (cleanableNodeTypesWithDescendants[node.nodeType]) {
+    if (cleanableNodeTypesWithDescendants[node.nodeType] && node instanceof Element) {
       cleanNodesInList(node.getElementsByTagName("*"));
     }
   }
   return node;
 }
 export function removeNode(node) {
+  if (!node) {
+    return;
+  }
   cleanNode(node);
   if (node.parentNode) {
     node.parentNode.removeChild(node);
   }
 }
-export const otherNodeCleanerFunctions = [];
+export const otherNodeCleanerFunctions = new Array();
 export function addCleaner(fn) {
   otherNodeCleanerFunctions.push(fn);
 }
@@ -90,7 +97,7 @@ export function removeCleaner(fn) {
   }
 }
 export function cleanjQueryData(node) {
-  var jQueryCleanNodeFn = jQueryInstance ? jQueryInstance.cleanData : null;
+  const jQueryCleanNodeFn = options.jQuery ? options.jQuery.cleanData : null;
   if (jQueryCleanNodeFn) {
     jQueryCleanNodeFn([node]);
   }

package/dist/dom/disposal.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/dom/disposal.ts"],
-  "sourcesContent": ["//\n// DOM node disposal\n//\n/* eslint no-cond-assign: 0 */\nimport * as domData from './data'\nimport { default as options } from '../options'\nimport {arrayRemoveItem, arrayIndexOf} from '../array'\nimport {jQueryInstance} from '../jquery'\n\nvar domDataKey = domData.nextKey()\n// Node types:\n// 1: Element\n// 8: Comment\n// 9: Document\nvar cleanableNodeTypes = { 1: true, 8: true, 9: true }\nvar cleanableNodeTypesWithDescendants = { 1: true, 9: true }\n\nfunction getDisposeCallbacksCollection (node, createIfNotFound) {\n  var allDisposeCallbacks = domData.get(node, domDataKey)\n  if ((allDisposeCallbacks === undefined) && createIfNotFound) {\n    allDisposeCallbacks = []\n    domData.set(node, domDataKey, allDisposeCallbacks)\n  }\n  return allDisposeCallbacks\n}\nfunction destroyCallbacksCollection (node) {\n  domData.set(node, domDataKey, undefined)\n}\n\nfunction cleanSingleNode (node) {\n    // Run all the dispose callbacks\n  var callbacks = getDisposeCallbacksCollection(node, false)\n  if (callbacks) {\n    callbacks = callbacks.slice(0) // Clone, as the array may be modified during iteration (typically, callbacks will remove themselves)\n    for (let i = 0; i < callbacks.length; i++) { callbacks[i](node) }\n  }\n\n    // Erase the DOM data\n  domData.clear(node)\n\n    // Perform cleanup needed by external libraries (currently only jQuery, but can be extended)\n  for (let i = 0, j = otherNodeCleanerFunctions.length; i < j; ++i) {\n    otherNodeCleanerFunctions[i](node)\n  }\n\n  if (options.cleanExternalData) {\n    options.cleanExternalData(node)\n  }\n\n    // Clear any immediate-child comment nodes, as these wouldn't have been found by\n    // node.getElementsByTagName('*') in cleanNode() (comment nodes aren't elements)\n  if (cleanableNodeTypesWithDescendants[node.nodeType]) {\n    cleanNodesInList(node.childNodes, true /* onlyComments */)\n  }\n}\n\nfunction cleanNodesInList (nodeList, onlyComments) {\n  const cleanedNodes = []\n  let lastCleanedNode\n  for (var i = 0; i < nodeList.length; i++) {\n    if (!onlyComments || nodeList[i].nodeType === 8) {\n      cleanSingleNode(cleanedNodes[cleanedNodes.length] = lastCleanedNode = nodeList[i]);\n      if (nodeList[i] !== lastCleanedNode) {\n        while (i-- && arrayIndexOf(cleanedNodes, nodeList[i]) === -1) {}\n      }\n    }\n  }\n}\n\n// Exports\nexport function addDisposeCallback (node, callback) {\n  if (typeof callback !== 'function') { throw new Error('Callback must be a function') }\n  getDisposeCallbacksCollection(node, true).push(callback)\n}\n\nexport function removeDisposeCallback (node, callback) {\n  var callbacksCollection = getDisposeCallbacksCollection(node, false)\n  if (callbacksCollection) {\n    arrayRemoveItem(callbacksCollection, callback)\n    if (callbacksCollection.length === 0) { destroyCallbacksCollection(node) }\n  }\n}\n\nexport function cleanNode (node) {\n  // First clean this node, where applicable\n  if (cleanableNodeTypes[node.nodeType]) {\n    cleanSingleNode(node)\n\n    // ... then its descendants, where applicable\n    if (cleanableNodeTypesWithDescendants[node.nodeType]) {\n      cleanNodesInList(node.getElementsByTagName(\"*\"))\n    }\n  }\n  return node\n}\n\nexport function removeNode (node) {\n  cleanNode(node)\n  if (node.parentNode) { node.parentNode.removeChild(node) }\n}\n\n// Expose supplemental node cleaning functions.\nexport const otherNodeCleanerFunctions = []\n\nexport function addCleaner (fn) {\n  otherNodeCleanerFunctions.push(fn)\n}\n\nexport function removeCleaner (fn) {\n  const fnIndex = otherNodeCleanerFunctions.indexOf(fn)\n  if (fnIndex >= 0) { otherNodeCleanerFunctions.splice(fnIndex, 1) }\n}\n\n// Special support for jQuery here because it's so commonly used.\n// Many jQuery plugins (including jquery.tmpl) store data using jQuery's equivalent of domData\n// so notify it to tear down any resources associated with the node & descendants here.\nexport function cleanjQueryData (node) {\n  var jQueryCleanNodeFn = jQueryInstance ? jQueryInstance.cleanData : null\n\n  if (jQueryCleanNodeFn) {\n    jQueryCleanNodeFn([node])\n  }\n}\n\notherNodeCleanerFunctions.push(cleanjQueryData)\n"],
-  "mappings": ";AAIA;AACA;AACA;AACA;AAEA,IAAI,aAAa,QAAQ,QAAQ;AAKjC,IAAI,qBAAqB,EAAE,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK;AACrD,IAAI,oCAAoC,EAAE,GAAG,MAAM,GAAG,KAAK;AAE3D,uCAAwC,MAAM,kBAAkB;AAC9D,MAAI,sBAAsB,QAAQ,IAAI,MAAM,UAAU;AACtD,MAAK,wBAAwB,UAAc,kBAAkB;AAC3D,0BAAsB,CAAC;AACvB,YAAQ,IAAI,MAAM,YAAY,mBAAmB;AAAA,EACnD;AACA,SAAO;AACT;AACA,oCAAqC,MAAM;AACzC,UAAQ,IAAI,MAAM,YAAY,MAAS;AACzC;AAEA,yBAA0B,MAAM;AAE9B,MAAI,YAAY,8BAA8B,MAAM,KAAK;AACzD,MAAI,WAAW;AACb,gBAAY,UAAU,MAAM,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAAE,gBAAU,GAAG,IAAI;AAAA,IAAE;AAAA,EAClE;AAGA,UAAQ,MAAM,IAAI;AAGlB,WAAS,IAAI,GAAG,IAAI,0BAA0B,QAAQ,IAAI,GAAG,EAAE,GAAG;AAChE,8BAA0B,GAAG,IAAI;AAAA,EACnC;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,YAAQ,kBAAkB,IAAI;AAAA,EAChC;AAIA,MAAI,kCAAkC,KAAK,WAAW;AACpD,qBAAiB,KAAK,YAAY,IAAuB;AAAA,EAC3D;AACF;AAEA,0BAA2B,UAAU,cAAc;AACjD,QAAM,eAAe,CAAC;AACtB,MAAI;AACJ,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,QAAI,CAAC,gBAAgB,SAAS,GAAG,aAAa,GAAG;AAC/C,sBAAgB,aAAa,aAAa,UAAU,kBAAkB,SAAS,EAAE;AACjF,UAAI,SAAS,OAAO,iBAAiB;AACnC,eAAO,OAAO,aAAa,cAAc,SAAS,EAAE,MAAM,IAAI;AAAA,QAAC;AAAA,MACjE;AAAA,IACF;AAAA,EACF;AACF;AAGO,mCAA6B,MAAM,UAAU;AAClD,MAAI,OAAO,aAAa,YAAY;AAAE,UAAM,IAAI,MAAM,6BAA6B;AAAA,EAAE;AACrF,gCAA8B,MAAM,IAAI,EAAE,KAAK,QAAQ;AACzD;AAEO,sCAAgC,MAAM,UAAU;AACrD,MAAI,sBAAsB,8BAA8B,MAAM,KAAK;AACnE,MAAI,qBAAqB;AACvB,oBAAgB,qBAAqB,QAAQ;AAC7C,QAAI,oBAAoB,WAAW,GAAG;AAAE,iCAA2B,IAAI;AAAA,IAAE;AAAA,EAC3E;AACF;AAEO,0BAAoB,MAAM;AAE/B,MAAI,mBAAmB,KAAK,WAAW;AACrC,oBAAgB,IAAI;AAGpB,QAAI,kCAAkC,KAAK,WAAW;AACpD,uBAAiB,KAAK,qBAAqB,GAAG,CAAC;AAAA,IACjD;AAAA,EACF;AACA,SAAO;AACT;AAEO,2BAAqB,MAAM;AAChC,YAAU,IAAI;AACd,MAAI,KAAK,YAAY;AAAE,SAAK,WAAW,YAAY,IAAI;AAAA,EAAE;AAC3D;AAGO,aAAM,4BAA4B,CAAC;AAEnC,2BAAqB,IAAI;AAC9B,4BAA0B,KAAK,EAAE;AACnC;AAEO,8BAAwB,IAAI;AACjC,QAAM,UAAU,0BAA0B,QAAQ,EAAE;AACpD,MAAI,WAAW,GAAG;AAAE,8BAA0B,OAAO,SAAS,CAAC;AAAA,EAAE;AACnE;AAKO,gCAA0B,MAAM;AACrC,MAAI,oBAAoB,iBAAiB,eAAe,YAAY;AAEpE,MAAI,mBAAmB;AACrB,sBAAkB,CAAC,IAAI,CAAC;AAAA,EAC1B;AACF;AAEA,0BAA0B,KAAK,eAAe;",
+  "sourcesContent": ["//\n// DOM node disposal\n//\n/* eslint no-cond-assign: 0 */\nimport * as domData from './data'\nimport { default as options } from '../options'\nimport { arrayRemoveItem, arrayIndexOf } from '../array'\n\nconst domDataKey = domData.nextKey()\n// Node types:\n// 1: Element\n// 8: Comment\n// 9: Document\nconst cleanableNodeTypes = { 1: true, 8: true, 9: true }\nconst cleanableNodeTypesWithDescendants = { 1: true, 9: true }\n\nfunction getDisposeCallbacksCollection(node: Node, createIfNotFound: boolean) {\n  let allDisposeCallbacks = domData.get(node, domDataKey)\n  if (allDisposeCallbacks === undefined && createIfNotFound) {\n    allDisposeCallbacks = new Array()\n    domData.set(node, domDataKey, allDisposeCallbacks)\n  }\n  return allDisposeCallbacks\n}\nfunction destroyCallbacksCollection(node: Node) {\n  domData.set(node, domDataKey, undefined)\n}\n\nfunction cleanSingleNode(node: Node) {\n  // Run all the dispose callbacks\n  let callbacks = getDisposeCallbacksCollection(node, false)\n  if (callbacks) {\n    callbacks = callbacks.slice(0) // Clone, as the array may be modified during iteration (typically, callbacks will remove themselves)\n    for (let i = 0; i < callbacks.length; i++) {\n      callbacks[i](node)\n    }\n  }\n\n  // Erase the DOM data\n  domData.clear(node)\n\n  // Perform cleanup needed by external libraries (currently only jQuery, but can be extended)\n  for (let i = 0, j = otherNodeCleanerFunctions.length; i < j; ++i) {\n    otherNodeCleanerFunctions[i](node)\n  }\n\n  if (options.cleanExternalData) {\n    options.cleanExternalData(node)\n  }\n\n  // Clear any immediate-child comment nodes, as these wouldn't have been found by\n  // node.getElementsByTagName('*') in cleanNode() (comment nodes aren't elements)\n  if (cleanableNodeTypesWithDescendants[node.nodeType]) {\n    cleanNodesInList(node.childNodes, true /* onlyComments */)\n  }\n}\n\nfunction cleanNodesInList(nodeList: NodeList | HTMLCollectionBase, onlyComments?: boolean) {\n  const cleanedNodes = new Array<Node>()\n  let lastCleanedNode\n  for (let i = 0; i < nodeList.length; i++) {\n    if (!onlyComments || nodeList[i].nodeType === Node.COMMENT_NODE) {\n      cleanSingleNode((cleanedNodes[cleanedNodes.length] = lastCleanedNode = nodeList[i]))\n      if (nodeList[i] !== lastCleanedNode) {\n        while (i-- && arrayIndexOf(cleanedNodes, nodeList[i]) === -1) {}\n      }\n    }\n  }\n}\n\n// Exports\nexport function addDisposeCallback(node: Node, callback: (node: Node) => void) {\n  if (typeof callback !== 'function') {\n    throw new Error('Callback must be a function')\n  }\n  getDisposeCallbacksCollection(node, true).push(callback)\n}\n\nexport function removeDisposeCallback(node: Node, callback: (node: Node) => void) {\n  const callbacksCollection = getDisposeCallbacksCollection(node, false)\n  if (callbacksCollection) {\n    arrayRemoveItem(callbacksCollection, callback)\n    if (callbacksCollection.length === 0) {\n      destroyCallbacksCollection(node)\n    }\n  }\n}\n\nexport function cleanNode(node: Node): typeof node {\n  // First clean this node, where applicable\n  if (cleanableNodeTypes[node.nodeType]) {\n    cleanSingleNode(node)\n\n    // ... then its descendants, where applicable\n    if (cleanableNodeTypesWithDescendants[node.nodeType] && node instanceof Element) {\n      cleanNodesInList(node.getElementsByTagName('*'))\n    }\n  }\n  return node\n}\n\nexport function removeNode(node: Node | null) {\n  if (!node) {\n    return\n  }\n\n  cleanNode(node)\n  if (node.parentNode) {\n    node.parentNode.removeChild(node)\n  }\n}\n\n// Expose supplemental node cleaning functions.\nexport const otherNodeCleanerFunctions = new Array<Function>()\n\nexport function addCleaner(fn: Function) {\n  otherNodeCleanerFunctions.push(fn)\n}\n\nexport function removeCleaner(fn: Function) {\n  const fnIndex = otherNodeCleanerFunctions.indexOf(fn)\n  if (fnIndex >= 0) {\n    otherNodeCleanerFunctions.splice(fnIndex, 1)\n  }\n}\n\n// Special support for jQuery here because it's so commonly used.\n// Many jQuery plugins (including jquery.tmpl) store data using jQuery's equivalent of domData\n// so notify it to tear down any resources associated with the node & descendants here.\nexport function cleanjQueryData(node: Node) {\n  const jQueryCleanNodeFn = options.jQuery ? options.jQuery.cleanData : null\n\n  if (jQueryCleanNodeFn) {\n    jQueryCleanNodeFn([node])\n  }\n}\n\notherNodeCleanerFunctions.push(cleanjQueryData)\n"],
+  "mappings": ";;AAIA,YAAY,aAAa;AACzB,SAAS,WAAW,eAAe;AACnC,SAAS,iBAAiB,oBAAoB;AAE9C,MAAM,aAAa,QAAQ,QAAQ;AAKnC,MAAM,qBAAqB,EAAE,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK;AACvD,MAAM,oCAAoC,EAAE,GAAG,MAAM,GAAG,KAAK;AAE7D,SAAS,8BAA8B,MAAY,kBAA2B;AAC5E,MAAI,sBAAsB,QAAQ,IAAI,MAAM,UAAU;AACtD,MAAI,wBAAwB,UAAa,kBAAkB;AACzD,0BAAsB,IAAI,MAAM;AAChC,YAAQ,IAAI,MAAM,YAAY,mBAAmB;AAAA,EACnD;AACA,SAAO;AACT;AACA,SAAS,2BAA2B,MAAY;AAC9C,UAAQ,IAAI,MAAM,YAAY,MAAS;AACzC;AAEA,SAAS,gBAAgB,MAAY;AAEnC,MAAI,YAAY,8BAA8B,MAAM,KAAK;AACzD,MAAI,WAAW;AACb,gBAAY,UAAU,MAAM,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,gBAAU,CAAC,EAAE,IAAI;AAAA,IACnB;AAAA,EACF;AAGA,UAAQ,MAAM,IAAI;AAGlB,WAAS,IAAI,GAAG,IAAI,0BAA0B,QAAQ,IAAI,GAAG,EAAE,GAAG;AAChE,8BAA0B,CAAC,EAAE,IAAI;AAAA,EACnC;AAEA,MAAI,QAAQ,mBAAmB;AAC7B,YAAQ,kBAAkB,IAAI;AAAA,EAChC;AAIA,MAAI,kCAAkC,KAAK,QAAQ,GAAG;AACpD;AAAA,MAAiB,KAAK;AAAA,MAAY;AAAA;AAAA,IAAuB;AAAA,EAC3D;AACF;AAEA,SAAS,iBAAiB,UAAyC,cAAwB;AACzF,QAAM,eAAe,IAAI,MAAY;AACrC,MAAI;AACJ,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,QAAI,CAAC,gBAAgB,SAAS,CAAC,EAAE,aAAa,KAAK,cAAc;AAC/D,sBAAiB,aAAa,aAAa,MAAM,IAAI,kBAAkB,SAAS,CAAC,CAAE;AACnF,UAAI,SAAS,CAAC,MAAM,iBAAiB;AACnC,eAAO,OAAO,aAAa,cAAc,SAAS,CAAC,CAAC,MAAM,IAAI;AAAA,QAAC;AAAA,MACjE;AAAA,IACF;AAAA,EACF;AACF;AAGO,gBAAS,mBAAmB,MAAY,UAAgC;AAC7E,MAAI,OAAO,aAAa,YAAY;AAClC,UAAM,IAAI,MAAM,6BAA6B;AAAA,EAC/C;AACA,gCAA8B,MAAM,IAAI,EAAE,KAAK,QAAQ;AACzD;AAEO,gBAAS,sBAAsB,MAAY,UAAgC;AAChF,QAAM,sBAAsB,8BAA8B,MAAM,KAAK;AACrE,MAAI,qBAAqB;AACvB,oBAAgB,qBAAqB,QAAQ;AAC7C,QAAI,oBAAoB,WAAW,GAAG;AACpC,iCAA2B,IAAI;AAAA,IACjC;AAAA,EACF;AACF;AAEO,gBAAS,UAAU,MAAyB;AAEjD,MAAI,mBAAmB,KAAK,QAAQ,GAAG;AACrC,oBAAgB,IAAI;AAGpB,QAAI,kCAAkC,KAAK,QAAQ,KAAK,gBAAgB,SAAS;AAC/E,uBAAiB,KAAK,qBAAqB,GAAG,CAAC;AAAA,IACjD;AAAA,EACF;AACA,SAAO;AACT;AAEO,gBAAS,WAAW,MAAmB;AAC5C,MAAI,CAAC,MAAM;AACT;AAAA,EACF;AAEA,YAAU,IAAI;AACd,MAAI,KAAK,YAAY;AACnB,SAAK,WAAW,YAAY,IAAI;AAAA,EAClC;AACF;AAGO,aAAM,4BAA4B,IAAI,MAAgB;AAEtD,gBAAS,WAAW,IAAc;AACvC,4BAA0B,KAAK,EAAE;AACnC;AAEO,gBAAS,cAAc,IAAc;AAC1C,QAAM,UAAU,0BAA0B,QAAQ,EAAE;AACpD,MAAI,WAAW,GAAG;AAChB,8BAA0B,OAAO,SAAS,CAAC;AAAA,EAC7C;AACF;AAKO,gBAAS,gBAAgB,MAAY;AAC1C,QAAM,oBAAoB,QAAQ,SAAS,QAAQ,OAAO,YAAY;AAEtE,MAAI,mBAAmB;AACrB,sBAAkB,CAAC,IAAI,CAAC;AAAA,EAC1B;AACF;AAEA,0BAA0B,KAAK,eAAe;",
   "names": []
 }