@peerbit/shared-log 10.3.8 → 10.3.9-17e5d15

package/package.json

@@ -1,72 +1,72 @@
 {
-	"name": "@peerbit/shared-log",
-	"version": "10.3.8",
-	"description": "Shared log",
-	"sideEffects": false,
-	"type": "module",
-	"types": "./dist/src/index.d.ts",
-	"typesVersions": {
-		"*": {
-			"*": [
-				"*",
-				"dist/*",
-				"dist/src/*",
-				"dist/src/*/index"
-			],
-			"src/*": [
-				"*",
-				"dist/*",
-				"dist/src/*",
-				"dist/src/*/index"
-			]
-		}
-	},
-	"files": [
-		"src",
-		"dist",
-		"!dist/e2e",
-		"!dist/test",
-		"!**/*.tsbuildinfo"
-	],
-	"exports": {
-		".": {
-			"types": "./dist/src/index.d.ts",
-			"import": "./dist/src/index.js"
-		}
-	},
-	"eslintConfig": {
-		"extends": "peerbit",
-		"parserOptions": {
-			"project": true,
-			"sourceType": "module"
-		},
-		"ignorePatterns": [
-			"!.aegir.js",
-			"test/ts-use",
-			"*.d.ts"
-		]
-	},
-	"publishConfig": {
-		"access": "public"
-	},
-	"scripts": {
-		"clean": "aegir clean",
-		"build": "aegir build --no-bundle",
-		"test": "aegir test --target node",
-		"lint": "aegir lint"
-	},
-	"author": "dao.xyz",
-	"license": "MIT",
-	"dependencies": {
-		"@dao-xyz/borsh": "^5.2.3",
-		"@peerbit/logger": "1.0.3",
-		"@peerbit/program": "5.1.2",
-		"@peerbit/log": "4.0.30",
-		"@peerbit/rpc": "5.0.28",
-		"@peerbit/time": "2.0.7",
-		"@peerbit/riblt": "1.0.4"
-	},
-	"devDependencies": {
-		"@peerbit/test-utils": "^2.1.18"
-	}
+  "name": "@peerbit/shared-log",
+  "version": "10.3.9-17e5d15",
+  "description": "Shared log",
+  "sideEffects": false,
+  "type": "module",
+  "types": "./dist/src/index.d.ts",
+  "typesVersions": {
+    "*": {
+      "*": [
+        "*",
+        "dist/*",
+        "dist/src/*",
+        "dist/src/*/index"
+      ],
+      "src/*": [
+        "*",
+        "dist/*",
+        "dist/src/*",
+        "dist/src/*/index"
+      ]
+    }
+  },
+  "files": [
+    "src",
+    "dist",
+    "!dist/e2e",
+    "!dist/test",
+    "!**/*.tsbuildinfo"
+  ],
+  "exports": {
+    ".": {
+      "types": "./dist/src/index.d.ts",
+      "import": "./dist/src/index.js"
+    }
+  },
+  "eslintConfig": {
+    "extends": "peerbit",
+    "parserOptions": {
+      "project": true,
+      "sourceType": "module"
+    },
+    "ignorePatterns": [
+      "!.aegir.js",
+      "test/ts-use",
+      "*.d.ts"
+    ]
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "clean": "aegir clean",
+    "build": "aegir build --no-bundle",
+    "test": "aegir test --target node",
+    "lint": "aegir lint"
+  },
+  "author": "dao.xyz",
+  "license": "MIT",
+  "dependencies": {
+    "@dao-xyz/borsh": "^5.2.3",
+    "@peerbit/logger": "1.0.3-17e5d15",
+    "@peerbit/program": "5.1.2-17e5d15",
+    "@peerbit/log": "4.0.30-17e5d15",
+    "@peerbit/rpc": "5.0.28-17e5d15",
+    "@peerbit/time": "2.0.7-17e5d15",
+    "@peerbit/riblt": "1.0.4-17e5d15"
+  },
+  "devDependencies": {
+    "@peerbit/test-utils": "2.1.18-17e5d15"
+  }
 }

package/src/index.ts

@@ -87,6 +87,7 @@ import {
 	ReplicationRangeIndexableU64,
 	ReplicationRangeMessage,
 	appromixateCoverage,
+	calculateCoverage,
 	countCoveringRangesSameOwner,
 	debounceAggregationChanges,
 	getAllMergeCandiates,
@@ -2589,6 +2590,13 @@ export class SharedLog<
 		});
 	}
 
+	async calculateCoverage() {
+		return calculateCoverage({
+			numbers: this.indexableDomain.numbers,
+			peers: this.replicationIndex,
+		});
+	}
+
 	/* async calculateTotalParticipation() {
 		const sum = await this.replicationIndex.sum({ key: "width" });
 		return Number(sum) / MAX_U32;

package/src/integers.ts

@@ -48,6 +48,7 @@ export interface Numbers<T extends "u32" | "u64"> {
 	divRound: (a: NumberFromType<T>, b: number | bigint) => NumberFromType<T>;
 	abs: (a: NumberFromType<T>) => NumberFromType<T>;
 	min: (a: NumberFromType<T>, b: NumberFromType<T>) => NumberFromType<T>;
+	max: (a: NumberFromType<T>, b: NumberFromType<T>) => NumberFromType<T>;
 	denormalize: (value: number) => NumberFromType<T>;
 	bytesToNumber: (bytes: Uint8Array) => NumberFromType<T>;
 }
@@ -81,6 +82,7 @@ export const createNumbers = <N extends "u32" | "u64">(
 			divRound: (a, b) => Math.round(a / Number(b)) as any,
 			abs: (a) => Math.abs(a as number),
 			min: (a, b) => Math.min(a as number, b as number),
+			max: (a, b) => Math.max(a as number, b as number),
 			denormalize: denormalizerFn,
 			bytesToNumber: bytesToNumber(resolution),
 		} as Numbers<N>;
@@ -93,6 +95,7 @@ export const createNumbers = <N extends "u32" | "u64">(
 			divRound: (a, b) => (a as bigint) / BigInt(b),
 			abs: (a) => (a < 0n ? -a : a),
 			min: (a, b) => (a < b ? a : b),
+			max: (a, b) => (a > b ? a : b),
 			denormalize: denormalizerFn,
 			bytesToNumber: bytesToNumber(resolution),
 		} as Numbers<N>;

package/src/ranges.ts

@@ -1355,6 +1355,66 @@ export const appromixateCoverage = async <R extends "u32" | "u64">(properties: {
 	return hits / properties.samples;
 };
 
+export const calculateCoverage = async <R extends "u32" | "u64">(properties: {
+	peers: Index<ReplicationRangeIndexable<R>>;
+	numbers: Numbers<R>;
+}): Promise<number> => {
+	const contentStart = properties.numbers.zero;
+	const contentEnd = properties.numbers.maxValue;
+	const endpoints: { point: NumberFromType<R>; delta: -1 | 1 }[] = [];
+	let lastPoint = contentStart;
+
+	// For each range, record its start and end as events.
+	for (const r of await properties.peers.iterate().all()) {
+		endpoints.push({ point: r.value.start1, delta: +1 });
+		endpoints.push({ point: r.value.end1, delta: -1 });
+
+		if (r.value.start1 !== r.value.start2) {
+			endpoints.push({ point: r.value.start2, delta: +1 });
+			endpoints.push({ point: r.value.end2, delta: -1 });
+		}
+	}
+
+	// Sort endpoints.
+	// When points are equal, process a start (delta +1) before an end (delta -1)
+	endpoints.sort((a, b) => {
+		if (a.point === b.point) return b.delta - a.delta;
+		return Number(a.point - b.point);
+	});
+
+	let currentCoverage = 0;
+	let minCoverage = Infinity;
+
+	// If the very start of the content space isn’t covered, return 0.
+	if (endpoints.length === 0 || endpoints[0].point > contentStart) {
+		return 0;
+	}
+
+	// Process each endpoint, updating the current coverage.
+	for (const e of endpoints) {
+		// If there is an interval from lastPoint to this endpoint,
+		// then the coverage in that entire segment was currentCoverage.
+		if (e.point > lastPoint) {
+			// Restrict to our content space.
+			const segStart = properties.numbers.max(lastPoint, contentStart);
+			const segEnd = properties.numbers.min(e.point, contentEnd);
+			if (segStart < segEnd) {
+				minCoverage = Math.min(minCoverage, currentCoverage);
+			}
+			lastPoint = e.point;
+		}
+		currentCoverage += e.delta;
+	}
+
+	// Check if the last endpoint left a tail inside the content space.
+	if (lastPoint < contentEnd) {
+		minCoverage = Math.min(minCoverage, currentCoverage);
+	}
+
+	// If any segment has zero coverage or nothing was covered, return 0.
+	return minCoverage === Infinity || minCoverage <= 0 ? 0 : minCoverage;
+};
+
 const getClosest = <S extends Shape | undefined, R extends "u32" | "u64">(
 	direction: "above" | "below",
 	rects: Index<ReplicationRangeIndexable<R>>,

package/src/sync/rateless-iblt.ts

@@ -476,7 +476,11 @@ export class RatelessIBLTSynchronizer<
 					try {
 						decoder.try_decode();
 					} catch (error: any) {
-						if (error?.message === "Invalid degree") {
+						if (
+							error?.message === "Invalid degree" ||
+							error === "Invalid degree"
+						) {
+							// TODO in some way test this code path
 							logger.error(error?.message);
 							return false;
 						} else {