version

Author: julienmalard

package.json

@@ -1,6 +1,6 @@
 {
   "name": "@orbitdb/ordered-keyvalue-db",
-  "version": "1.3.1",
+  "version": "1.3.2",
   "description": "Ordered keyvalue database type for orbit-db.",
   "author": "Julien Jean Malard-Adam",
   "keywords": [

src/utils.ts

@@ -33,7 +33,9 @@ export const getScalePosition = async ({
   // Insert to beginning of list if there is no preceding entry
   // Note: use Math.random() rather than mean to reduce risk of collisions in concurrent edits
   if (beforePosition === undefined)
-    return (afterPosition === undefined ? Math.random() : afterPosition - Math.random());
+    return afterPosition === undefined
+      ? Math.random()
+      : afterPosition - Math.random();
 
   // Insert to end of list if there is no following entry, or somewhere between adjacent entries
   return afterPosition === undefined

src/version.ts

@@ -1,2 +1,2 @@
 // Generated by genversion.
-export const version = "1.3.1";
+export const version = "1.3.2";

test/ordered-keyvalue.spec.ts

@@ -377,12 +377,10 @@ describe("OrderedKeyValue Database", () => {
 
       const actual = await db.all();
 
-      // Here we only check the middle value, because we don't know if key0 or key1 was 
+      // Here we only check the middle value, because we don't know if key0 or key1 was
       // added first due to the race condition we intentionally introduced above
-      expect(actual[1]).to.deep.equal(
-        { value: "between", key: "in", hash },
-      );
-    })
+      expect(actual[1]).to.deep.equal({ value: "between", key: "in", hash });
+    });
 
     it("returns all values", async () => {
       const keyvalue: {

test/utils.ts

@@ -1,7 +1,7 @@
-export const sortPosition = <T>(array: (T & { position: number})[]): T[] => {
-  const sorted = array.toSorted((a, b) => a.position - b.position)
-  return sorted.map(x=>{
-    delete (x as T & { position?: number})["position"]
-    return x
-  })
-}
+export const sortPosition = <T>(array: (T & { position: number })[]): T[] => {
+  const sorted = array.toSorted((a, b) => a.position - b.position);
+  return sorted.map((x) => {
+    delete (x as T & { position?: number })["position"];
+    return x;
+  });
+};