tinybase 2.0.0 → 2.1.0-beta.0

package/lib/checkpoints.js

@@ -1 +1 @@
-const e=(e,t)=>e.includes(t),t=(e,t)=>e.forEach(t),n=e=>e.length,r=e=>0==n(e),o=(e,...t)=>e.push(...t),s=e=>e.pop(),l=e=>e.shift(),c=e=>null==e,i=(e,t,n)=>c(e)?n?.():t(e),d=(e,t)=>e?.has(t)??!1,a=e=>c(e)||0==(e=>e.size)(e),u=(e,t)=>e?.forEach(t),h=(e,t)=>e?.delete(t),p=e=>new Map(e),C=(e,t)=>e?.get(t),g=(e,t,n)=>c(n)?(h(e,t),e):e?.set(t,n),k=(e,t,n)=>(d(e,t)||g(e,t,n()),C(e,t)),f=(e,t,r,o,s=0)=>i((r?k:C)(e,t[s],s>n(t)-2?r:p),(l=>{if(s>n(t)-2)return o?.(l)&&g(e,t[s]),l;const c=f(l,t,r,o,s+1);return a(l)&&g(e,t[s]),c})),v=e=>new Set(e),L=/^\d+$/,w=e=>{let r;const[s,d]=(()=>{const e=[];let t=0;return[()=>l(e)??""+t++,t=>{L.test(t)&&n(e)<1e3&&o(e,t)}]})(),k=p();return[(t,n,o)=>{r??=e();const l=s();var c,i;return g(k,l,[t,n,o]),c=f(n,o??[""],v),i=l,c?.add(i),l},(e,s,...l)=>t(((e,r=[""])=>{const s=[],l=(e,c)=>c==n(r)?o(s,e):null===r[c]?u(e,(e=>l(e,c+1))):t([r[c],null],(t=>l(C(e,t),c+1)));return l(e,0),s})(e,s),(e=>u(e,(e=>C(k,e)[0](r,...s??[],...l))))),e=>i(C(k,e),(([,t,n])=>(f(t,n??[""],void 0,(t=>(h(t,e),a(t)?1:0))),g(k,e),d(e),n))),(e,o,s)=>i(C(k,e),(([e,,l=[]])=>{const i=(...d)=>{const a=n(d);a==n(l)?e(r,...d,...s(d)):c(l[a])?t(o[a](...d),(e=>i(...d,e))):i(...d,l[a])};i()}))]},S=Object.freeze,z=(e=>{const t=new WeakMap;return n=>(t.has(n)||t.set(n,e(n)),t.get(n))})((h=>{let f,v,L,z=100,E=p(),I=1;const M=p(),b=p(),[j,x,y]=w((()=>Q)),B=p(),F=p(),O=[],T=[],W=(e,t)=>{I=0,h.transaction((()=>u(C(B,t),((t,n)=>u(t,((t,r)=>u(t,((t,o)=>((e,t,n,r,o)=>c(o)?e.delCell(t,n,r,!0):e.setCell(t,n,r,o))(h,n,r,o,t[e]))))))))),I=1},$=e=>{g(B,e),g(F,e),x(b,[e])},m=(e,r)=>t(((e,t)=>e.splice(0,t))(e,r??n(e)),$),q=()=>m(O,n(O)-z),A=h.addCellListener(null,null,null,((e,t,n,r,l,c)=>{if(I){i(f,(()=>{o(O,f),q(),m(T),f=void 0,L=1}));const e=k(E,t,p),d=k(e,n,p),u=k(d,r,(()=>[c,void 0]));u[1]=l,u[0]===l&&a(g(d,r))&&a(g(e,n))&&a(g(E,t))&&(f=s(O),L=1),J()}})),D=(e="")=>(c(f)&&(f=""+v++,g(B,f,E),N(f,e),E=p(),L=1),f),G=()=>{r(O)||(T.unshift(D()),W(0,f),f=s(O),L=1)},H=()=>{r(T)||(o(O,f),f=l(T),W(1,f),L=1)},J=()=>{L&&(x(M),L=0)},K=e=>{const t=D(e);return J(),t},N=(e,t)=>(P(e)&&C(F,e)!==t&&(g(F,e,t),x(b,[e])),Q),P=e=>d(B,e),Q={setSize:e=>(z=e,q(),Q),addCheckpoint:K,setCheckpoint:N,getStore:()=>h,getCheckpointIds:()=>[[...O],f,[...T]],forEachCheckpoint:e=>{return t=e,u(F,((e,n)=>t(n,e)));var t},hasCheckpoint:P,getCheckpoint:e=>C(F,e),goBackward:()=>(G(),J(),Q),goForward:()=>(H(),J(),Q),goTo:t=>{const n=e(O,t)?G:e(T,t)?H:null;for(;!c(n)&&t!=f;)n();return J(),Q},addCheckpointIdsListener:e=>j(e,M),addCheckpointListener:(e,t)=>j(t,b,[e]),delListener:e=>(y(e),Q),clear:()=>(m(O),m(T),c(f)||$(f),f=void 0,v=0,K(),Q),destroy:()=>{h.delListener(A)},getListenerStats:()=>({})};return S(Q.clear())}));export{z as createCheckpoints};
+const e=(e,t)=>e.includes(t),t=(e,t)=>e.forEach(t),n=e=>e.length,r=e=>0==n(e),s=(e,...t)=>e.push(...t),o=e=>e.pop(),l=e=>e.shift(),c=e=>null==e,i=(e,t,n)=>c(e)?n?.():t(e),a=(e,t)=>e?.has(t)??!1,d=e=>c(e)||0==(e=>e.size)(e),u=(e,t)=>e?.forEach(t),h=(e,t)=>e?.delete(t),p=e=>new Map(e),C=(e,t)=>e?.get(t),g=(e,t,n)=>c(n)?(h(e,t),e):e?.set(t,n),k=(e,t,n)=>(a(e,t)||g(e,t,n()),C(e,t)),f=(e,t,r,s,o=0)=>i((r?k:C)(e,t[o],o>n(t)-2?r:p),(l=>{if(o>n(t)-2)return s?.(l)&&g(e,t[o]),l;const c=f(l,t,r,s,o+1);return d(l)&&g(e,t[o]),c})),v=e=>new Set(Array.isArray(e)||c(e)?e:[e]),L=/^\d+$/,w=e=>{let r;const[o,a]=(()=>{const e=[];let t=0;return[()=>l(e)??""+t++,t=>{L.test(t)&&n(e)<1e3&&s(e,t)}]})(),k=p();return[(t,n,s)=>{r??=e();const l=o();var c,i;return g(k,l,[t,n,s]),c=f(n,s??[""],v),i=l,c?.add(i),l},(e,o,...l)=>t(((e,r=[""])=>{const o=[],l=(e,c)=>c==n(r)?s(o,e):null===r[c]?u(e,(e=>l(e,c+1))):t([r[c],null],(t=>l(C(e,t),c+1)));return l(e,0),o})(e,o),(e=>u(e,(e=>C(k,e)[0](r,...o??[],...l))))),e=>i(C(k,e),(([,t,n])=>(f(t,n??[""],void 0,(t=>(h(t,e),d(t)?1:0))),g(k,e),a(e),n))),(e,s,o)=>i(C(k,e),(([e,,l=[]])=>{const i=(...a)=>{const d=n(a);d==n(l)?e(r,...a,...o(a)):c(l[d])?t(s[d](...a),(e=>i(...a,e))):i(...a,l[d])};i()}))]},S=Object.freeze,y=(e=>{const t=new WeakMap;return n=>(t.has(n)||t.set(n,e(n)),t.get(n))})((h=>{let f,v,L,y=100,z=p(),E=1;const A=p(),I=p(),[M,b,j]=w((()=>Q)),x=p(),B=p(),F=[],O=[],T=(e,t)=>{E=0,h.transaction((()=>u(C(x,t),((t,n)=>u(t,((t,r)=>u(t,((t,s)=>((e,t,n,r,s)=>c(s)?e.delCell(t,n,r,!0):e.setCell(t,n,r,s))(h,n,r,s,t[e]))))))))),E=1},W=e=>{g(x,e),g(B,e),b(I,[e])},$=(e,r)=>t(((e,t)=>e.splice(0,t))(e,r??n(e)),W),m=()=>$(F,n(F)-y),q=h.addCellListener(null,null,null,((e,t,n,r,l,c)=>{if(E){i(f,(()=>{s(F,f),m(),$(O),f=void 0,L=1}));const e=k(z,t,p),a=k(e,n,p),u=k(a,r,(()=>[c,void 0]));u[1]=l,u[0]===l&&d(g(a,r))&&d(g(e,n))&&d(g(z,t))&&(f=o(F),L=1),J()}})),D=(e="")=>(c(f)&&(f=""+v++,g(x,f,z),N(f,e),z=p(),L=1),f),G=()=>{r(F)||(O.unshift(D()),T(0,f),f=o(F),L=1)},H=()=>{r(O)||(s(F,f),f=l(O),T(1,f),L=1)},J=()=>{L&&(b(A),L=0)},K=e=>{const t=D(e);return J(),t},N=(e,t)=>(P(e)&&C(B,e)!==t&&(g(B,e,t),b(I,[e])),Q),P=e=>a(x,e),Q={setSize:e=>(y=e,m(),Q),addCheckpoint:K,setCheckpoint:N,getStore:()=>h,getCheckpointIds:()=>[[...F],f,[...O]],forEachCheckpoint:e=>{return t=e,u(B,((e,n)=>t(n,e)));var t},hasCheckpoint:P,getCheckpoint:e=>C(B,e),goBackward:()=>(G(),J(),Q),goForward:()=>(H(),J(),Q),goTo:t=>{const n=e(F,t)?G:e(O,t)?H:null;for(;!c(n)&&t!=f;)n();return J(),Q},addCheckpointIdsListener:e=>M(e,A),addCheckpointListener:(e,t)=>M(t,I,[e]),delListener:e=>(j(e),Q),clear:()=>($(F),$(O),c(f)||W(f),f=void 0,v=0,K(),Q),destroy:()=>{h.delListener(q)},getListenerStats:()=>({})};return S(Q.clear())}));export{y as createCheckpoints};

package/lib/common.js

@@ -1 +1 @@
-const o=(o,t)=>o<t?-1:1,t=o=>""+o;export{o as defaultSorter,t as id};
+const o=(o,t)=>o<t?-1:1;export{o as defaultSorter};

package/lib/debug/checkpoints.js

@@ -13,6 +13,7 @@ const arrayShift = (array) => array.shift();
 const isUndefined = (thing) => thing == void 0;
 const ifNotUndefined = (value, then, otherwise) =>
   isUndefined(value) ? otherwise?.() : then(value);
+const isArray = (thing) => Array.isArray(thing);
 
 const collSizeN = (collSizer) => (coll) =>
   arrayReduce(collValues(coll), (total, coll2) => total + collSizer(coll2), 0);
@@ -58,7 +59,12 @@ const visitTree = (node, path, ensureLeaf, pruneLeaf, p = 0) =>
     },
   );
 
-const setNew = (entries) => new Set(entries);
+const setNew = (entryOrEntries) =>
+  new Set(
+    isArray(entryOrEntries) || isUndefined(entryOrEntries)
+      ? entryOrEntries
+      : [entryOrEntries],
+  );
 const setAdd = (set, value) => set?.add(value);
 
 const getCreateFunction = (getFunction) => {

package/lib/debug/common.js

@@ -1,6 +1,3 @@
-const EMPTY_STRING = '';
-
 const defaultSorter = (sortKey1, sortKey2) => (sortKey1 < sortKey2 ? -1 : 1);
-const id = (key) => EMPTY_STRING + key;
 
-export {defaultSorter, id};
+export {defaultSorter};

package/lib/debug/indexes.d.ts

@@ -1,6 +1,6 @@
 /**
- * The indexes module of the TinyBase project provides the ability to create
- * and track indexes of the data in Store objects.
+ * The indexes module of the TinyBase project provides the ability to create and
+ * track indexes of the data in Store objects.
  *
  * The main entry point to this module is the createIndexes function, which
  * returns a new Indexes object. From there, you can create new Index
@@ -209,11 +209,12 @@ export interface Indexes {
    * derived string value in common, as described by this method. Those values
    * are used as the key for each Slice in the overall Index object.
    *
-   * Without the third `getSliceId` parameter, the Index will simply have a
+   * Without the third `getSliceIdOrIds` parameter, the Index will simply have a
    * single Slice, keyed by an empty string. But more often you will specify a
    * Cell value containing the Slice Id that the Row should belong to.
    * Alternatively, a custom function can be provided that produces your own
-   * Slice Id from the local Row as a whole.
+   * Slice Id from the local Row as a whole. Since v2.1, the custom function can
+   * return an array of Slice Ids, each of which the Row will then belong to.
    *
    * The fourth `getSortKey` parameter specifies a Cell Id to get a value (or a
    * function that processes a whole Row to get a value) that is used to sort
@@ -241,11 +242,13 @@ export interface Indexes {
    *
    * @param indexId The Id of the Index to define.
    * @param tableId The Id of the Table the Index will be generated from.
-   * @param getSliceId Either the Id of the Cell containing, or a function that
-   * produces, the Id that is used to indicate which Slice in the Index the Row
-   * Id should be in. Defaults to a function that returns `''` (meaning that if
-   * this `getSliceId` parameter is omitted, the Index will simply contain a
-   * single Slice containing all the Row Ids in the Table).
+   * @param getSliceIdOrIds Either the Id of the Cell containing, or a function
+   * that produces, the Id that is used to indicate which Slice in the Index the
+   * Row Id should be in. Defaults to a function that returns `''` (meaning that
+   * if this `getSliceIdOrIds` parameter is omitted, the Index will simply
+   * contain a single Slice containing all the Row Ids in the Table). Since
+   * v2.1, this can return an array of Slice Ids, each of which the Row will
+   * then belong to.
    * @param getSortKey Either the Id of the Cell containing, or a function that
    * produces, the value that is used to sort the Row Ids in each Slice.
    * @param sliceIdSorter A function that takes two Slice Id values and returns
@@ -294,6 +297,29 @@ export interface Indexes {
    * ```
    * @example
    * This example creates a Store, creates an Indexes object, and defines an
+   * Index based on each of the letters present in the pets' names.
+   *
+   * ```js
+   * const store = createStore().setTable('pets', {
+   *   fido: {species: 'dog'},
+   *   felix: {species: 'cat'},
+   *   rex: {species: 'dog'},
+   * });
+   *
+   * const indexes = createIndexes(store);
+   * indexes.setIndexDefinition('containsLetter', 'pets', (_, rowId) =>
+   *   rowId.split(''),
+   * );
+   *
+   * console.log(indexes.getSliceIds('containsLetter'));
+   * // -> ['f', 'i', 'd', 'o', 'e', 'l', 'x', 'r']
+   * console.log(indexes.getSliceRowIds('containsLetter', 'i'));
+   * // -> ['fido', 'felix']
+   * console.log(indexes.getSliceRowIds('containsLetter', 'x'));
+   * // -> ['felix', 'rex']
+   * ```
+   * @example
+   * This example creates a Store, creates an Indexes object, and defines an
    * Index based on the first letter of the pets' names. The Slice Ids (and Row
    * Ids within them) are alphabetically sorted.
    *
@@ -324,7 +350,7 @@ export interface Indexes {
   setIndexDefinition(
     indexId: Id,
     tableId: Id,
-    getSliceId?: Id | ((getCell: GetCell, rowId: Id) => Id),
+    getSliceIdOrIds?: Id | ((getCell: GetCell, rowId: Id) => Id | Ids),
     getSortKey?: Id | ((getCell: GetCell, rowId: Id) => SortKey),
     sliceIdSorter?: (sliceId1: Id, sliceId2: Id) => number,
     rowIdSorter?: (sortKey1: SortKey, sortKey2: SortKey, sliceId: Id) => number,

package/lib/debug/indexes.js

@@ -1,8 +1,12 @@
 const getTypeOf = (thing) => typeof thing;
 const EMPTY_STRING = '';
 const STRING = getTypeOf(EMPTY_STRING);
+const id = (key) => EMPTY_STRING + key;
 
 const arrayEvery = (array, cb) => array.every(cb);
+const arrayIsEqual = (array1, array2) =>
+  arrayLength(array1) === arrayLength(array2) &&
+  arrayEvery(array1, (value1, index) => array2[index] === value1);
 const arrayIsSorted = (array, sorter) =>
   arrayEvery(
     array,
@@ -10,6 +14,7 @@ const arrayIsSorted = (array, sorter) =>
   );
 const arraySort = (array, sorter) => array.sort(sorter);
 const arrayForEach = (array, cb) => array.forEach(cb);
+const arrayMap = (array, cb) => array.map(cb);
 const arrayLength = (array) => array.length;
 const arrayIsEmpty = (array) => arrayLength(array) == 0;
 const arrayReduce = (array, cb, initial) => array.reduce(cb, initial);
@@ -20,6 +25,7 @@ const isUndefined = (thing) => thing == void 0;
 const ifNotUndefined = (value, then, otherwise) =>
   isUndefined(value) ? otherwise?.() : then(value);
 const isString = (thing) => getTypeOf(thing) == STRING;
+const isArray = (thing) => Array.isArray(thing);
 
 const collSizeN = (collSizer) => (coll) =>
   arrayReduce(collValues(coll), (total, coll2) => total + collSizer(coll2), 0);
@@ -68,7 +74,12 @@ const visitTree = (node, path, ensureLeaf, pruneLeaf, p = 0) =>
     },
   );
 
-const setNew = (entries) => new Set(entries);
+const setNew = (entryOrEntries) =>
+  new Set(
+    isArray(entryOrEntries) || isUndefined(entryOrEntries)
+      ? entryOrEntries
+      : [entryOrEntries],
+  );
 const setAdd = (set, value) => set?.add(value);
 
 const getDefinableFunctions = (store, getDefaultThing, validateRowValue) => {
@@ -133,7 +144,14 @@ const getDefinableFunctions = (store, getDefaultThing, validateRowValue) => {
       const newRowValue = hasRow(tableId, rowId)
         ? validateRowValue(getRowValue(getCell, rowId))
         : void 0;
-      if (oldRowValue != newRowValue) {
+      if (
+        !(
+          oldRowValue === newRowValue ||
+          (isArray(oldRowValue) &&
+            isArray(newRowValue) &&
+            arrayIsEqual(oldRowValue, newRowValue))
+        )
+      ) {
         mapSet(changedRowValues, rowId, [oldRowValue, newRowValue]);
       }
       if (!isUndefined(getSortKey)) {
@@ -312,7 +330,11 @@ const createIndexes = getCreateFunction((store) => {
     delDefinition,
     destroy,
   ] = getDefinableFunctions(store, mapNew, (value) =>
-    isUndefined(value) ? EMPTY_STRING : value + EMPTY_STRING,
+    isUndefined(value)
+      ? EMPTY_STRING
+      : isArray(value)
+      ? arrayMap(value, id)
+      : id(value),
   );
   const [addListener, callListeners, delListenerImpl] = getListenerFunctions(
     () => indexes,
@@ -321,7 +343,7 @@ const createIndexes = getCreateFunction((store) => {
   const setIndexDefinition = (
     indexId,
     tableId,
-    getSliceId,
+    getSliceIdOrIds,
     getSortKey,
     sliceIdSorter,
     rowIdSorter = defaultSorter,
@@ -337,29 +359,39 @@ const createIndexes = getCreateFunction((store) => {
         const changedSlices = setNew();
         const unsortedSlices = setNew();
         const index = getIndex(indexId);
-        collForEach(changedSliceIds, ([oldSliceId, newSliceId], rowId) => {
-          if (!isUndefined(oldSliceId)) {
-            setAdd(changedSlices, oldSliceId);
-            ifNotUndefined(mapGet(index, oldSliceId), (oldSlice) => {
-              collDel(oldSlice, rowId);
-              if (collIsEmpty(oldSlice)) {
-                mapSet(index, oldSliceId);
+        collForEach(
+          changedSliceIds,
+          ([oldSliceIdOrIds, newSliceIdOrIds], rowId) => {
+            const oldSliceIds = setNew(oldSliceIdOrIds);
+            const newSliceIds = setNew(newSliceIdOrIds);
+            collForEach(oldSliceIds, (oldSliceId) =>
+              collDel(newSliceIds, oldSliceId)
+                ? collDel(oldSliceIds, oldSliceId)
+                : 0,
+            );
+            collForEach(oldSliceIds, (oldSliceId) => {
+              setAdd(changedSlices, oldSliceId);
+              ifNotUndefined(mapGet(index, oldSliceId), (oldSlice) => {
+                collDel(oldSlice, rowId);
+                if (collIsEmpty(oldSlice)) {
+                  mapSet(index, oldSliceId);
+                  sliceIdsChanged = 1;
+                }
+              });
+            });
+            collForEach(newSliceIds, (newSliceId) => {
+              setAdd(changedSlices, newSliceId);
+              if (!collHas(index, newSliceId)) {
+                mapSet(index, newSliceId, setNew());
                 sliceIdsChanged = 1;
               }
+              setAdd(mapGet(index, newSliceId), rowId);
+              if (!isUndefined(getSortKey)) {
+                setAdd(unsortedSlices, newSliceId);
+              }
             });
-          }
-          if (!isUndefined(newSliceId)) {
-            setAdd(changedSlices, newSliceId);
-            if (!collHas(index, newSliceId)) {
-              mapSet(index, newSliceId, setNew());
-              sliceIdsChanged = 1;
-            }
-            setAdd(mapGet(index, newSliceId), rowId);
-            if (!isUndefined(getSortKey)) {
-              setAdd(unsortedSlices, newSliceId);
-            }
-          }
-        });
+          },
+        );
         change();
         if (!collIsEmpty(sortKeys)) {
           if (force) {
@@ -408,7 +440,7 @@ const createIndexes = getCreateFunction((store) => {
           callListeners(sliceRowIdsListeners, [indexId, sliceId]),
         );
       },
-      getRowCellFunction(getSliceId),
+      getRowCellFunction(getSliceIdOrIds),
       ifNotUndefined(getSortKey, getRowCellFunction),
     );
     return indexes;

package/lib/debug/metrics.d.ts

@@ -210,7 +210,7 @@ export type MetricsListenerStats = {
  *
  * @example
  * This example shows a very simple lifecycle of a Metrics object: from
- * creation, to adding a definition, getting an Metric, and then registering and
+ * creation, to adding a definition, getting a Metric, and then registering and
  * removing a listener for it.
  *
  * ```js

package/lib/debug/metrics.js

@@ -7,6 +7,10 @@ const AVG = 'avg';
 const MIN = 'min';
 const MAX = 'max';
 
+const arrayEvery = (array, cb) => array.every(cb);
+const arrayIsEqual = (array1, array2) =>
+  arrayLength(array1) === arrayLength(array2) &&
+  arrayEvery(array1, (value1, index) => array2[index] === value1);
 const arrayForEach = (array, cb) => array.forEach(cb);
 const arraySum = (array) => arrayReduce(array, (i, j) => i + j, 0);
 const arrayLength = (array) => array.length;
@@ -23,6 +27,7 @@ const ifNotUndefined = (value, then, otherwise) =>
   isUndefined(value) ? otherwise?.() : then(value);
 const isString = (thing) => getTypeOf(thing) == STRING;
 const isFunction = (thing) => getTypeOf(thing) == FUNCTION;
+const isArray = (thing) => Array.isArray(thing);
 const getUndefined = () => void 0;
 
 const collSizeN = (collSizer) => (coll) =>
@@ -140,7 +145,12 @@ const getAggregateValue = (
     : aggregateValue;
 };
 
-const setNew = (entries) => new Set(entries);
+const setNew = (entryOrEntries) =>
+  new Set(
+    isArray(entryOrEntries) || isUndefined(entryOrEntries)
+      ? entryOrEntries
+      : [entryOrEntries],
+  );
 const setAdd = (set, value) => set?.add(value);
 
 const getDefinableFunctions = (store, getDefaultThing, validateRowValue) => {
@@ -205,7 +215,14 @@ const getDefinableFunctions = (store, getDefaultThing, validateRowValue) => {
       const newRowValue = hasRow(tableId, rowId)
         ? validateRowValue(getRowValue(getCell, rowId))
         : void 0;
-      if (oldRowValue != newRowValue) {
+      if (
+        !(
+          oldRowValue === newRowValue ||
+          (isArray(oldRowValue) &&
+            isArray(newRowValue) &&
+            arrayIsEqual(oldRowValue, newRowValue))
+        )
+      ) {
         mapSet(changedRowValues, rowId, [oldRowValue, newRowValue]);
       }
       if (!isUndefined(getSortKey)) {

package/lib/debug/persisters.d.ts

@@ -509,7 +509,7 @@ export interface Persister {
 }
 
 /**
- * The createSessionPersister function creates an Persister object that can
+ * The createSessionPersister function creates a Persister object that can
  * persist the Store to the browser's session storage.
  *
  * As well as providing a reference to the Store to persist, you must provide a
@@ -542,7 +542,7 @@ export function createSessionPersister(
 ): Persister;
 
 /**
- * The createLocalPersister function creates an Persister object that can
+ * The createLocalPersister function creates a Persister object that can
  * persist the Store to the browser's local storage.
  *
  * As well as providing a reference to the Store to persist, you must provide a
@@ -575,7 +575,7 @@ export function createLocalPersister(
 ): Persister;
 
 /**
- * The createRemotePersister function creates an Persister object that can
+ * The createRemotePersister function creates a Persister object that can
  * persist the Store to a remote server.
  *
  * As well as providing a reference to the Store to persist, you must provide
@@ -624,7 +624,7 @@ export function createRemotePersister(
 ): Persister;
 
 /**
- * The createFilePersister function creates an Persister object that can persist
+ * The createFilePersister function creates a Persister object that can persist
  * the Store to a local file (in an appropriate environment).
  *
  * As well as providing a reference to the Store to persist, you must provide
@@ -654,7 +654,7 @@ export function createRemotePersister(
 export function createFilePersister(store: Store, filePath: string): Persister;
 
 /**
- * The createCustomPersister function creates an Persister object that you can
+ * The createCustomPersister function creates a Persister object that you can
  * configure to persist the Store in any way you wish.
  *
  * As well as providing a reference to the Store to persist, you must provide

package/lib/debug/queries.js

@@ -20,6 +20,9 @@ const CELL_IDS = 'CellIds';
 const CELL = 'Cell';
 
 const arrayEvery = (array, cb) => array.every(cb);
+const arrayIsEqual = (array1, array2) =>
+  arrayLength(array1) === arrayLength(array2) &&
+  arrayEvery(array1, (value1, index) => array2[index] === value1);
 const arrayForEach = (array, cb) => array.forEach(cb);
 const arraySum = (array) => arrayReduce(array, (i, j) => i + j, 0);
 const arrayLength = (array) => array.length;
@@ -36,6 +39,7 @@ const ifNotUndefined = (value, then, otherwise) =>
   isUndefined(value) ? otherwise?.() : then(value);
 const isTypeStringOrBoolean = (type) => type == STRING || type == BOOLEAN;
 const isFunction = (thing) => getTypeOf(thing) == FUNCTION;
+const isArray = (thing) => Array.isArray(thing);
 const getUndefined = () => void 0;
 
 const collSize = (coll) => coll.size;
@@ -81,7 +85,12 @@ const visitTree = (node, path, ensureLeaf, pruneLeaf, p = 0) =>
     },
   );
 
-const setNew = (entries) => new Set(entries);
+const setNew = (entryOrEntries) =>
+  new Set(
+    isArray(entryOrEntries) || isUndefined(entryOrEntries)
+      ? entryOrEntries
+      : [entryOrEntries],
+  );
 const setAdd = (set, value) => set?.add(value);
 
 const numericAggregators = mapNew([
@@ -226,7 +235,14 @@ const getDefinableFunctions = (store, getDefaultThing, validateRowValue) => {
       const newRowValue = hasRow(tableId, rowId)
         ? validateRowValue(getRowValue(getCell, rowId))
         : void 0;
-      if (oldRowValue != newRowValue) {
+      if (
+        !(
+          oldRowValue === newRowValue ||
+          (isArray(oldRowValue) &&
+            isArray(newRowValue) &&
+            arrayIsEqual(oldRowValue, newRowValue))
+        )
+      ) {
         mapSet(changedRowValues, rowId, [oldRowValue, newRowValue]);
       }
       if (!isUndefined(getSortKey)) {

package/lib/debug/relationships.d.ts

@@ -1091,7 +1091,7 @@ export interface Relationships {
    * the underlying Store are removed and it can be correctly garbage collected.
    *
    * @example
-   * This example creates a Store, adds an Relationships object with a
+   * This example creates a Store, adds a Relationships object with a
    * definition (that registers a RowListener with the underlying Store),
    * and then destroys it again, removing the listener.
    *
@@ -1167,7 +1167,7 @@ export interface Relationships {
 }
 
 /**
- * The createRelationships function creates an Relationships object, and is the
+ * The createRelationships function creates a Relationships object, and is the
  * main entry point into the relationships module.
  *
  * It is trivially simple.
@@ -1179,7 +1179,7 @@ export interface Relationships {
  * @param store The Store for which to register Relationships.
  * @returns A reference to the new Relationships object.
  * @example
- * This example creates an Relationships object.
+ * This example creates a Relationships object.
  *
  * ```js
  * const store = createStore();

package/lib/debug/relationships.js

@@ -2,6 +2,10 @@ const getTypeOf = (thing) => typeof thing;
 const EMPTY_STRING = '';
 const STRING = getTypeOf(EMPTY_STRING);
 
+const arrayEvery = (array, cb) => array.every(cb);
+const arrayIsEqual = (array1, array2) =>
+  arrayLength(array1) === arrayLength(array2) &&
+  arrayEvery(array1, (value1, index) => array2[index] === value1);
 const arrayForEach = (array, cb) => array.forEach(cb);
 const arrayLength = (array) => array.length;
 const arrayIsEmpty = (array) => arrayLength(array) == 0;
@@ -13,6 +17,7 @@ const isUndefined = (thing) => thing == void 0;
 const ifNotUndefined = (value, then, otherwise) =>
   isUndefined(value) ? otherwise?.() : then(value);
 const isString = (thing) => getTypeOf(thing) == STRING;
+const isArray = (thing) => Array.isArray(thing);
 
 const collSizeN = (collSizer) => (coll) =>
   arrayReduce(collValues(coll), (total, coll2) => total + collSizer(coll2), 0);
@@ -61,7 +66,12 @@ const visitTree = (node, path, ensureLeaf, pruneLeaf, p = 0) =>
     },
   );
 
-const setNew = (entries) => new Set(entries);
+const setNew = (entryOrEntries) =>
+  new Set(
+    isArray(entryOrEntries) || isUndefined(entryOrEntries)
+      ? entryOrEntries
+      : [entryOrEntries],
+  );
 const setAdd = (set, value) => set?.add(value);
 
 const getDefinableFunctions = (store, getDefaultThing, validateRowValue) => {
@@ -126,7 +136,14 @@ const getDefinableFunctions = (store, getDefaultThing, validateRowValue) => {
       const newRowValue = hasRow(tableId, rowId)
         ? validateRowValue(getRowValue(getCell, rowId))
         : void 0;
-      if (oldRowValue != newRowValue) {
+      if (
+        !(
+          oldRowValue === newRowValue ||
+          (isArray(oldRowValue) &&
+            isArray(newRowValue) &&
+            arrayIsEqual(oldRowValue, newRowValue))
+        )
+      ) {
         mapSet(changedRowValues, rowId, [oldRowValue, newRowValue]);
       }
       if (!isUndefined(getSortKey)) {

package/lib/debug/store.js

@@ -16,6 +16,7 @@ const ROW_IDS = 'RowIds';
 const ROW = 'Row';
 const CELL_IDS = 'CellIds';
 const CELL = 'Cell';
+const id = (key) => EMPTY_STRING + key;
 
 const arrayHas = (array, value) => array.includes(value);
 const arrayEvery = (array, cb) => array.every(cb);
@@ -54,6 +55,7 @@ const ifNotUndefined = (value, then, otherwise) =>
   isUndefined(value) ? otherwise?.() : then(value);
 const isTypeStringOrBoolean = (type) => type == STRING || type == BOOLEAN;
 const isFunction = (thing) => getTypeOf(thing) == FUNCTION;
+const isArray = (thing) => Array.isArray(thing);
 
 const collSizeN = (collSizer) => (coll) =>
   arrayReduce(collValues(coll), (total, coll2) => total + collSizer(coll2), 0);
@@ -133,7 +135,12 @@ const objForEach = (obj, cb) =>
   arrayForEach(object.entries(obj), ([id, value]) => cb(value, id));
 const objIsEmpty = (obj) => arrayIsEmpty(objIds(obj));
 
-const setNew = (entries) => new Set(entries);
+const setNew = (entryOrEntries) =>
+  new Set(
+    isArray(entryOrEntries) || isUndefined(entryOrEntries)
+      ? entryOrEntries
+      : [entryOrEntries],
+  );
 const setAdd = (set, value) => set?.add(value);
 
 const INTEGER = /^\d+$/;
@@ -221,7 +228,6 @@ const setOrDelCell = (store, tableId, rowId, cellId, cell) =>
     : store.setCell(tableId, rowId, cellId, cell);
 
 const defaultSorter = (sortKey1, sortKey2) => (sortKey1 < sortKey2 ? -1 : 1);
-const id = (key) => EMPTY_STRING + key;
 
 const transformMap = (map, toBeLikeObject, setId, delId = mapSet) => {
   const idsToDelete = arrayFilter(