tinybase 5.4.6 → 5.4.8

package/umd/es6/indexes/index.js

@@ -14,9 +14,13 @@
   const STRING = getTypeOf(EMPTY_STRING);
   const id = (key) => EMPTY_STRING + key;
 
-  const isUndefined = (thing) => thing == undefined;
+  const isUndefined = (thing) => thing == void 0;
   const ifNotUndefined = (value, then, otherwise) =>
-    isUndefined(value) ? undefined : then(value);
+    isUndefined(value)
+      ? otherwise == null
+        ? void 0
+        : otherwise()
+      : then(value);
   const isString = (thing) => getTypeOf(thing) == STRING;
   const isArray = (thing) => Array.isArray(thing);
   const size = (arrayOrString) => arrayOrString.length;
@@ -50,13 +54,13 @@
     );
   const collSize = (coll) => {
     var _a;
-    return (_a = coll == null ? undefined : coll.size) != null ? _a : 0;
+    return (_a = coll == null ? void 0 : coll.size) != null ? _a : 0;
   };
   const collSize2 = collSizeN(collSize);
   const collSize3 = collSizeN(collSize2);
   const collHas = (coll, keyOrValue) => {
     var _a;
-    return (_a = coll == null ? undefined : coll.has(keyOrValue)) != null
+    return (_a = coll == null ? void 0 : coll.has(keyOrValue)) != null
       ? _a
       : false;
   };
@@ -64,34 +68,33 @@
   const collValues = (coll) => {
     var _a;
     return [
-      ...((_a = coll == null ? undefined : coll.values()) != null ? _a : []),
+      ...((_a = coll == null ? void 0 : coll.values()) != null ? _a : []),
     ];
   };
   const collClear = (coll) => coll.clear();
-  const collForEach = (coll, cb) =>
-    coll == null ? undefined : coll.forEach(cb);
+  const collForEach = (coll, cb) => (coll == null ? void 0 : coll.forEach(cb));
   const collDel = (coll, keyOrValue) =>
-    coll == null ? undefined : coll.delete(keyOrValue);
+    coll == null ? void 0 : coll.delete(keyOrValue);
 
   const mapNew = (entries) => new Map(entries);
   const mapKeys = (map) => {
     var _a;
-    return [...((_a = map == null ? undefined : map.keys()) != null ? _a : [])];
+    return [...((_a = map == null ? void 0 : map.keys()) != null ? _a : [])];
   };
-  const mapGet = (map, key) => (map == null ? undefined : map.get(key));
+  const mapGet = (map, key) => (map == null ? void 0 : map.get(key));
   const mapForEach = (map, cb) =>
     collForEach(map, (value, key) => cb(key, value));
   const mapSet = (map, key, value) =>
     isUndefined(value)
       ? (collDel(map, key), map)
       : map == null
-        ? undefined
+        ? void 0
         : map.set(key, value);
   const mapEnsure = (map, key, getDefaultValue, hadExistingValue) => {
     if (!collHas(map, key)) {
       mapSet(map, key, getDefaultValue());
     } else {
-      hadExistingValue == null ? undefined : hadExistingValue(mapGet(map, key));
+      hadExistingValue == null ? void 0 : hadExistingValue(mapGet(map, key));
     }
     return mapGet(map, key);
   };
@@ -104,7 +107,7 @@
       ),
       (nodeOrLeaf) => {
         if (p > size(path) - 2) {
-          if (pruneLeaf == null ? undefined : pruneLeaf(nodeOrLeaf)) {
+          if (pruneLeaf == null ? void 0 : pruneLeaf(nodeOrLeaf)) {
             mapSet(node, path[p]);
           }
           return nodeOrLeaf;
@@ -123,7 +126,7 @@
         ? entryOrEntries
         : [entryOrEntries],
     );
-  const setAdd = (set, value) => (set == null ? undefined : set.add(value));
+  const setAdd = (set, value) => (set == null ? void 0 : set.add(value));
 
   const getDefinableFunctions = (
     store,
@@ -194,7 +197,7 @@
         const oldRowValue = mapGet(rowValues, rowId);
         const newRowValue = hasRow(tableId, rowId)
           ? validateRowValue(getRowValue(getCell, rowId))
-          : undefined;
+          : void 0;
         if (
           !(
             oldRowValue === newRowValue ||
@@ -209,7 +212,7 @@
           const oldSortKey = mapGet(sortKeys, rowId);
           const newSortKey = hasRow(tableId, rowId)
             ? getSortKey(getCell, rowId)
-            : undefined;
+            : void 0;
           if (oldSortKey != newSortKey) {
             mapSet(changedSortKeys, rowId, newSortKey);
           }
@@ -376,7 +379,7 @@
         visitTree(
           idSetNode,
           idOrNulls != null ? idOrNulls : [EMPTY_STRING],
-          undefined,
+          void 0,
           (idSet) => {
             collDel(idSet, id);
             return collIsEmpty(idSet) ? 1 : 0;
@@ -399,7 +402,7 @@
               arrayForEach(
                 (_b =
                   (_a = pathGetters[index]) == null
-                    ? undefined
+                    ? void 0
                     : _a.call(pathGetters, ...ids)) != null
                   ? _b
                   : [],
@@ -456,7 +459,7 @@
       rowIdSorter = defaultSorter,
     ) => {
       const sliceIdArraySorter = isUndefined(sliceIdSorter)
-        ? undefined
+        ? void 0
         : ([id1], [id2]) => sliceIdSorter(id1, id2);
       setDefinitionAndListen(
         indexId,

package/umd/es6/indexes/with-schemas/index.js

@@ -14,9 +14,13 @@
   const STRING = getTypeOf(EMPTY_STRING);
   const id = (key) => EMPTY_STRING + key;
 
-  const isUndefined = (thing) => thing == undefined;
+  const isUndefined = (thing) => thing == void 0;
   const ifNotUndefined = (value, then, otherwise) =>
-    isUndefined(value) ? undefined : then(value);
+    isUndefined(value)
+      ? otherwise == null
+        ? void 0
+        : otherwise()
+      : then(value);
   const isString = (thing) => getTypeOf(thing) == STRING;
   const isArray = (thing) => Array.isArray(thing);
   const size = (arrayOrString) => arrayOrString.length;
@@ -50,13 +54,13 @@
     );
   const collSize = (coll) => {
     var _a;
-    return (_a = coll == null ? undefined : coll.size) != null ? _a : 0;
+    return (_a = coll == null ? void 0 : coll.size) != null ? _a : 0;
   };
   const collSize2 = collSizeN(collSize);
   const collSize3 = collSizeN(collSize2);
   const collHas = (coll, keyOrValue) => {
     var _a;
-    return (_a = coll == null ? undefined : coll.has(keyOrValue)) != null
+    return (_a = coll == null ? void 0 : coll.has(keyOrValue)) != null
       ? _a
       : false;
   };
@@ -64,34 +68,33 @@
   const collValues = (coll) => {
     var _a;
     return [
-      ...((_a = coll == null ? undefined : coll.values()) != null ? _a : []),
+      ...((_a = coll == null ? void 0 : coll.values()) != null ? _a : []),
     ];
   };
   const collClear = (coll) => coll.clear();
-  const collForEach = (coll, cb) =>
-    coll == null ? undefined : coll.forEach(cb);
+  const collForEach = (coll, cb) => (coll == null ? void 0 : coll.forEach(cb));
   const collDel = (coll, keyOrValue) =>
-    coll == null ? undefined : coll.delete(keyOrValue);
+    coll == null ? void 0 : coll.delete(keyOrValue);
 
   const mapNew = (entries) => new Map(entries);
   const mapKeys = (map) => {
     var _a;
-    return [...((_a = map == null ? undefined : map.keys()) != null ? _a : [])];
+    return [...((_a = map == null ? void 0 : map.keys()) != null ? _a : [])];
   };
-  const mapGet = (map, key) => (map == null ? undefined : map.get(key));
+  const mapGet = (map, key) => (map == null ? void 0 : map.get(key));
   const mapForEach = (map, cb) =>
     collForEach(map, (value, key) => cb(key, value));
   const mapSet = (map, key, value) =>
     isUndefined(value)
       ? (collDel(map, key), map)
       : map == null
-        ? undefined
+        ? void 0
         : map.set(key, value);
   const mapEnsure = (map, key, getDefaultValue, hadExistingValue) => {
     if (!collHas(map, key)) {
       mapSet(map, key, getDefaultValue());
     } else {
-      hadExistingValue == null ? undefined : hadExistingValue(mapGet(map, key));
+      hadExistingValue == null ? void 0 : hadExistingValue(mapGet(map, key));
     }
     return mapGet(map, key);
   };
@@ -104,7 +107,7 @@
       ),
       (nodeOrLeaf) => {
         if (p > size(path) - 2) {
-          if (pruneLeaf == null ? undefined : pruneLeaf(nodeOrLeaf)) {
+          if (pruneLeaf == null ? void 0 : pruneLeaf(nodeOrLeaf)) {
             mapSet(node, path[p]);
           }
           return nodeOrLeaf;
@@ -123,7 +126,7 @@
         ? entryOrEntries
         : [entryOrEntries],
     );
-  const setAdd = (set, value) => (set == null ? undefined : set.add(value));
+  const setAdd = (set, value) => (set == null ? void 0 : set.add(value));
 
   const getDefinableFunctions = (
     store,
@@ -194,7 +197,7 @@
         const oldRowValue = mapGet(rowValues, rowId);
         const newRowValue = hasRow(tableId, rowId)
           ? validateRowValue(getRowValue(getCell, rowId))
-          : undefined;
+          : void 0;
         if (
           !(
             oldRowValue === newRowValue ||
@@ -209,7 +212,7 @@
           const oldSortKey = mapGet(sortKeys, rowId);
           const newSortKey = hasRow(tableId, rowId)
             ? getSortKey(getCell, rowId)
-            : undefined;
+            : void 0;
           if (oldSortKey != newSortKey) {
             mapSet(changedSortKeys, rowId, newSortKey);
           }
@@ -376,7 +379,7 @@
         visitTree(
           idSetNode,
           idOrNulls != null ? idOrNulls : [EMPTY_STRING],
-          undefined,
+          void 0,
           (idSet) => {
             collDel(idSet, id);
             return collIsEmpty(idSet) ? 1 : 0;
@@ -399,7 +402,7 @@
               arrayForEach(
                 (_b =
                   (_a = pathGetters[index]) == null
-                    ? undefined
+                    ? void 0
                     : _a.call(pathGetters, ...ids)) != null
                   ? _b
                   : [],
@@ -456,7 +459,7 @@
       rowIdSorter = defaultSorter,
     ) => {
       const sliceIdArraySorter = isUndefined(sliceIdSorter)
-        ? undefined
+        ? void 0
         : ([id1], [id2]) => sliceIdSorter(id1, id2);
       setDefinitionAndListen(
         indexId,