@harperfast/harper 5.2.10 → 5.2.13

package/dist/utility/errors/hdbError.js

@@ -39,6 +39,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.hdbErrors = exports.AccessViolation = exports.Violation = exports.ValidationError = exports.IndexRebuildingError = exports.ServerError = exports.ClientError = exports.HdbError = void 0;
 exports.handleHDBError = handleHDBError;
 exports.isHDBError = isHDBError;
+exports.appendErrorContext = appendErrorContext;
 const harper_logger_ts_1 = __importDefault(require("../logging/harper_logger.js"));
 const hdbErrors = __importStar(require("./commonErrors.js"));
 exports.hdbErrors = hdbErrors;
@@ -205,4 +206,32 @@ exports.AccessViolation = AccessViolation;
 function isHDBError(e) {
     return e.__proto__.constructor.name === HdbError.name;
 }
+/**
+ * Append context to an error's message, tolerating errors whose `message` cannot be assigned.
+ *
+ * A `DOMException` - what `fetch` rejects with when an `AbortSignal.timeout` fires - inherits
+ * `message` as a getter-only accessor, so a plain assignment throws under strict mode. Callers use
+ * this where losing the context is acceptable but throwing from a catch block is not.
+ */
+function appendErrorContext(error, context) {
+    try {
+        if (typeof error?.message !== 'string')
+            return;
+        const annotated = `${error.message}${context}`;
+        try {
+            error.message = annotated;
+        }
+        catch {
+            // A getter-only `message` (DOMException) takes an own property instead.
+            Object.defineProperty(error, 'message', {
+                value: annotated,
+                writable: true,
+                configurable: true,
+            });
+        }
+    }
+    catch {
+        /* frozen, or a throwing accessor - the original message still propagates */
+    }
+}
 //# sourceMappingURL=hdbError.js.map

package/dist/utility/errors/hdbError.js.map

@@ -1 +1 @@
-{"version":3,"file":"hdbError.js","sourceRoot":"","sources":["../../../utility/errors/hdbError.ts"],"names":[],"mappings":"AAAA,YAAY,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoIb,wCAoBC;AAkCD,gCAEC;AA3LD,mFAAiD;AACjD,6DAA+C;AA4LtC,8BAAS;AA3LlB,yDAA2C;AAE3C;;;;GAIG;AACH,MAAa,QAAS,SAAQ,KAAK;IAClC,UAAU,CAAS;IACnB,aAAa,CAAS;IACtB,IAAI,CAAS;IACb,QAAQ,CAAS;IACjB;;;;;;OAMG;IACH,YAAY,OAAY,EAAE,OAAa,EAAE,QAAiB,EAAE,QAAiB,EAAE,MAAe;QAC7F,KAAK,EAAE,CAAC;QAER,mHAAmH;QACnH,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QAE9C,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,qBAAqB,CAAC;QAC1F,IAAI,CAAC,aAAa,GAAG,OAAO;YAC3B,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC;gBACvC,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC;gBACxC,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,SAAS,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,CAAC;QACpF,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QACtE,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,IAAI,QAAQ;YAAE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAEvC,yGAAyG;QACzG,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC5B,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACZ,0BAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;IACF,CAAC;CACD;AArCD,4BAqCC;AACD,MAAa,WAAY,SAAQ,KAAK;IACrC,UAAU,CAAS;IACnB,YAAY,OAAuB,EAAE,UAAmB;QACvD,IAAI,OAAO,YAAY,KAAK,EAAE,CAAC;YAC7B,OAAe,CAAC,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC;YAChD,OAAO,OAAc,CAAC;QACvB,CAAC;QACD,KAAK,CAAC,OAAc,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC;IACrC,CAAC;CACD;AAVD,kCAUC;AAED,MAAa,WAAY,SAAQ,KAAK;IACrC,UAAU,CAAS;IACnB,YAAY,OAAuB,EAAE,UAAmB;QACvD,KAAK,CAAC,OAAc,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC;IACrC,CAAC;CACD;AAND,kCAMC;AAED;;;;;GAKG;AACH,MAAa,oBAAqB,SAAQ,WAAW;IACpD,IAAI,CAAS;IACb,SAAS,CAAU;IACnB,YAAY,OAAe;QAC1B,KAAK,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACpB,wFAAwF;QACxF,wFAAwF;QACxF,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;QACnC,IAAI,CAAC,IAAI,GAAG,kBAAkB,CAAC;QAC/B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACvB,CAAC;CACD;AAXD,oDAWC;AAYD;;;;;GAKG;AACH,MAAa,eAAgB,SAAQ,WAAW;IAC/C,MAAM,CAAoB;IAC1B,MAAM,CAAoB;IAC1B,IAAI,CAAS;IACb,YAAY,MAAyB,EAAE,OAAgB;QACtD,KAAK,CAAC,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/E,+FAA+F;QAC/F,yCAAyC;QACzC,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,iFAAiF;QACjF,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;CACD;AAdD,0CAcC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,cAAc,CAC7B,CAAM,EACN,OAAa,EACb,QAAiB,EACjB,WAAoB,QAAgB,CAAC,UAAU,CAAC,KAAK,EACrD,SAAc,IAAI,EAClB,cAAuB,KAAK;IAE5B,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC;IACV,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAEnE,8FAA8F;IAC9F,IAAI,WAAW,EAAE,CAAC;QACjB,OAAO,KAAK,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAa,SAAU,SAAQ,KAAK;IACnC,YAAY,OAAe;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;IACnC,CAAC;CACD;AALD,8BAKC;AAED;;;;GAIG;AACH,MAAa,eAAgB,SAAQ,SAAS;IAC7C,UAAU,CAAS;IACnB,YAAY,IAAU;QACrB,IAAI,IAAI,EAAE,CAAC;YACV,KAAK,CAAC,iCAAiC,CAAC,CAAC;YACzC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACvB,CAAC;aAAM,CAAC;YACP,KAAK,CAAC,YAAY,CAAC,CAAC;YACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;YACtB,0DAA0D;QAC3D,CAAC;IACF,CAAC;CACD;AAZD,0CAYC;AAED,SAAgB,UAAU,CAAC,CAAM;IAChC,OAAO,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC;AACvD,CAAC"}
+{"version":3,"file":"hdbError.js","sourceRoot":"","sources":["../../../utility/errors/hdbError.ts"],"names":[],"mappings":"AAAA,YAAY,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoIb,wCAoBC;AAkCD,gCAEC;AASD,gDAiBC;AArND,mFAAiD;AACjD,6DAA+C;AAsNtC,8BAAS;AArNlB,yDAA2C;AAE3C;;;;GAIG;AACH,MAAa,QAAS,SAAQ,KAAK;IAClC,UAAU,CAAS;IACnB,aAAa,CAAS;IACtB,IAAI,CAAS;IACb,QAAQ,CAAS;IACjB;;;;;;OAMG;IACH,YAAY,OAAY,EAAE,OAAa,EAAE,QAAiB,EAAE,QAAiB,EAAE,MAAe;QAC7F,KAAK,EAAE,CAAC;QAER,mHAAmH;QACnH,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QAE9C,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,qBAAqB,CAAC;QAC1F,IAAI,CAAC,aAAa,GAAG,OAAO;YAC3B,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC;gBACvC,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC;gBACxC,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,SAAS,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,CAAC;QACpF,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QACtE,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,IAAI,QAAQ;YAAE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAEvC,yGAAyG;QACzG,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC5B,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACZ,0BAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;IACF,CAAC;CACD;AArCD,4BAqCC;AACD,MAAa,WAAY,SAAQ,KAAK;IACrC,UAAU,CAAS;IACnB,YAAY,OAAuB,EAAE,UAAmB;QACvD,IAAI,OAAO,YAAY,KAAK,EAAE,CAAC;YAC7B,OAAe,CAAC,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC;YAChD,OAAO,OAAc,CAAC;QACvB,CAAC;QACD,KAAK,CAAC,OAAc,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC;IACrC,CAAC;CACD;AAVD,kCAUC;AAED,MAAa,WAAY,SAAQ,KAAK;IACrC,UAAU,CAAS;IACnB,YAAY,OAAuB,EAAE,UAAmB;QACvD,KAAK,CAAC,OAAc,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC;IACrC,CAAC;CACD;AAND,kCAMC;AAED;;;;;GAKG;AACH,MAAa,oBAAqB,SAAQ,WAAW;IACpD,IAAI,CAAS;IACb,SAAS,CAAU;IACnB,YAAY,OAAe;QAC1B,KAAK,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACpB,wFAAwF;QACxF,wFAAwF;QACxF,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;QACnC,IAAI,CAAC,IAAI,GAAG,kBAAkB,CAAC;QAC/B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACvB,CAAC;CACD;AAXD,oDAWC;AAYD;;;;;GAKG;AACH,MAAa,eAAgB,SAAQ,WAAW;IAC/C,MAAM,CAAoB;IAC1B,MAAM,CAAoB;IAC1B,IAAI,CAAS;IACb,YAAY,MAAyB,EAAE,OAAgB;QACtD,KAAK,CAAC,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/E,+FAA+F;QAC/F,yCAAyC;QACzC,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,iFAAiF;QACjF,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;CACD;AAdD,0CAcC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,cAAc,CAC7B,CAAM,EACN,OAAa,EACb,QAAiB,EACjB,WAAoB,QAAgB,CAAC,UAAU,CAAC,KAAK,EACrD,SAAc,IAAI,EAClB,cAAuB,KAAK;IAE5B,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC;IACV,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAEnE,8FAA8F;IAC9F,IAAI,WAAW,EAAE,CAAC;QACjB,OAAO,KAAK,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAa,SAAU,SAAQ,KAAK;IACnC,YAAY,OAAe;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;IACnC,CAAC;CACD;AALD,8BAKC;AAED;;;;GAIG;AACH,MAAa,eAAgB,SAAQ,SAAS;IAC7C,UAAU,CAAS;IACnB,YAAY,IAAU;QACrB,IAAI,IAAI,EAAE,CAAC;YACV,KAAK,CAAC,iCAAiC,CAAC,CAAC;YACzC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACvB,CAAC;aAAM,CAAC;YACP,KAAK,CAAC,YAAY,CAAC,CAAC;YACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;YACtB,0DAA0D;QAC3D,CAAC;IACF,CAAC;CACD;AAZD,0CAYC;AAED,SAAgB,UAAU,CAAC,CAAM;IAChC,OAAO,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC;AACvD,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,kBAAkB,CAAC,KAAc,EAAE,OAAe;IACjE,IAAI,CAAC;QACJ,IAAI,OAAQ,KAAa,EAAE,OAAO,KAAK,QAAQ;YAAE,OAAO;QACxD,MAAM,SAAS,GAAG,GAAI,KAAe,CAAC,OAAO,GAAG,OAAO,EAAE,CAAC;QAC1D,IAAI,CAAC;YACH,KAAe,CAAC,OAAO,GAAG,SAAS,CAAC;QACtC,CAAC;QAAC,MAAM,CAAC;YACR,wEAAwE;YACxE,MAAM,CAAC,cAAc,CAAC,KAAe,EAAE,SAAS,EAAE;gBACjD,KAAK,EAAE,SAAS;gBAChB,QAAQ,EAAE,IAAI;gBACd,YAAY,EAAE,IAAI;aAClB,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IAAC,MAAM,CAAC;QACR,4EAA4E;IAC7E,CAAC;AACF,CAAC"}

package/npm-shrinkwrap.json

@@ -1,12 +1,12 @@
 {
   "name": "harper",
-  "version": "5.2.10",
+  "version": "5.2.13",
   "lockfileVersion": 3,
   "requires": true,
   "packages": {
     "": {
       "name": "harper",
-      "version": "5.2.10",
+      "version": "5.2.13",
       "license": "Apache-2.0",
       "dependencies": {
         "@aws-sdk/client-s3": "^3.1012.0",
@@ -17,7 +17,7 @@
         "@fastify/cors": "^11.2.0",
         "@fastify/static": "^9.1.3",
         "@harperfast/extended-iterable": "1.0.3",
-        "@harperfast/rocksdb-js": "2.9.0",
+        "@harperfast/rocksdb-js": "2.9.1",
         "@harperfast/skills": "^1.10.8",
         "@turf/area": "6.5.0",
         "@turf/boolean-contains": "6.5.0",
@@ -1063,9 +1063,9 @@
       "license": "Apache-2.0"
     },
     "node_modules/@harperfast/rocksdb-js": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js/-/rocksdb-js-2.9.0.tgz",
-      "integrity": "sha512-EOQnnDo4aoxLidosuQGZ2xO4kDCqwridUQdJ7UF7Ui7d5gTh6tUfTkqRSYk2CbFehVJDgU1qQLJZePGsXRRaEg==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js/-/rocksdb-js-2.9.1.tgz",
+      "integrity": "sha512-zWTY44pgmup0Owuvy7FAnY4yYI85cwvhVwvacisTDizDboytXaX49y3vmt21w81NEwkcpaA8lO9oH6BPCCpjEA==",
       "license": "Apache-2.0",
       "dependencies": {
         "@harperfast/extended-iterable": "^1.0.3",
@@ -1079,20 +1079,20 @@
         "node": "^22.18.0 || >=24.0.0"
       },
       "optionalDependencies": {
-        "@harperfast/rocksdb-js-darwin-arm64": "2.9.0",
-        "@harperfast/rocksdb-js-darwin-x64": "2.9.0",
-        "@harperfast/rocksdb-js-linux-arm64-glibc": "2.9.0",
-        "@harperfast/rocksdb-js-linux-arm64-musl": "2.9.0",
-        "@harperfast/rocksdb-js-linux-x64-glibc": "2.9.0",
-        "@harperfast/rocksdb-js-linux-x64-musl": "2.9.0",
-        "@harperfast/rocksdb-js-win32-arm64": "2.9.0",
-        "@harperfast/rocksdb-js-win32-x64": "2.9.0"
+        "@harperfast/rocksdb-js-darwin-arm64": "2.9.1",
+        "@harperfast/rocksdb-js-darwin-x64": "2.9.1",
+        "@harperfast/rocksdb-js-linux-arm64-glibc": "2.9.1",
+        "@harperfast/rocksdb-js-linux-arm64-musl": "2.9.1",
+        "@harperfast/rocksdb-js-linux-x64-glibc": "2.9.1",
+        "@harperfast/rocksdb-js-linux-x64-musl": "2.9.1",
+        "@harperfast/rocksdb-js-win32-arm64": "2.9.1",
+        "@harperfast/rocksdb-js-win32-x64": "2.9.1"
       }
     },
     "node_modules/@harperfast/rocksdb-js-darwin-arm64": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-darwin-arm64/-/rocksdb-js-darwin-arm64-2.9.0.tgz",
-      "integrity": "sha512-zgBjJKkHlyjiKJP+FkstFj1znZ/O8qXE9yIXIyKhTtxDeayobFY2x6M/KOWd9N1kaa8GrAQXGawUEXZnV1U+qw==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-darwin-arm64/-/rocksdb-js-darwin-arm64-2.9.1.tgz",
+      "integrity": "sha512-PQupgyuFYEIDHkQLBGWd0T20TJAHF9u3E7JmcbnhSqEIu4TyvUB3bT5CsMofvNlSvkmuc/CFEkVDCZBjmW3jIg==",
       "cpu": [
         "arm64"
       ],
@@ -1106,9 +1106,9 @@
       }
     },
     "node_modules/@harperfast/rocksdb-js-darwin-x64": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-darwin-x64/-/rocksdb-js-darwin-x64-2.9.0.tgz",
-      "integrity": "sha512-OfAtdB7GDjkKYaq6Db3mDfoRKnrnjXS1X4OaF4xFsQUoZRtmMvF3OTP9w4N8c2vvEff2kjlGqpj2Dewab1uGNQ==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-darwin-x64/-/rocksdb-js-darwin-x64-2.9.1.tgz",
+      "integrity": "sha512-zo53r+Y7mdb/yjlcCcAA0ASYD4Xue7SVgNVJuNrMB13iLCftpITqe3uEBm60P9TArDO+Ug0bSU8skMb0NfFP9A==",
       "cpu": [
         "x64"
       ],
@@ -1122,9 +1122,9 @@
       }
     },
     "node_modules/@harperfast/rocksdb-js-linux-arm64-glibc": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-linux-arm64-glibc/-/rocksdb-js-linux-arm64-glibc-2.9.0.tgz",
-      "integrity": "sha512-/CnIr6vy+D5M4c2WOAyoC9/2TKSEYCvvsyzz0AoWw3taUmEX6fR308eHMA0iKFHPp7xSI3fyz0fBOd+3TO250A==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-linux-arm64-glibc/-/rocksdb-js-linux-arm64-glibc-2.9.1.tgz",
+      "integrity": "sha512-gbpMzMVxcPQ2IDSI+/8zv3zqLgdqOQ4xJkVIeANoIFfhClzbx8ZFG+VdszbMZq7wUsqO62XPydEWj9Fx4iSawQ==",
       "cpu": [
         "arm64"
       ],
@@ -1141,9 +1141,9 @@
       }
     },
     "node_modules/@harperfast/rocksdb-js-linux-arm64-musl": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-linux-arm64-musl/-/rocksdb-js-linux-arm64-musl-2.9.0.tgz",
-      "integrity": "sha512-MBM4Vv4ERdRgbmXZXQrGPhgmTmb0EX22dwDEFrq57mpn5IEuuXU4S/RXGAcsoEmYqYb86lvtukD5AnvxcefoSA==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-linux-arm64-musl/-/rocksdb-js-linux-arm64-musl-2.9.1.tgz",
+      "integrity": "sha512-edj0Mj9+Vq7rTp0JBVUNHHRVzeu/WINgg/fnTB5Dvvn3HZQAtCQXb3YIqDOu1h4WPJXjSPZPH5gl26CuVX5hdg==",
       "cpu": [
         "arm64"
       ],
@@ -1160,9 +1160,9 @@
       }
     },
     "node_modules/@harperfast/rocksdb-js-linux-x64-glibc": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-linux-x64-glibc/-/rocksdb-js-linux-x64-glibc-2.9.0.tgz",
-      "integrity": "sha512-rhIoInrDAzwMx7N2H0K1mM8x/hY2D/NF2rhd8ERT2w2GoK4NqdBtPldVY8ein8fmtDdYaS6CpHmRSmq+xlhqhw==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-linux-x64-glibc/-/rocksdb-js-linux-x64-glibc-2.9.1.tgz",
+      "integrity": "sha512-x2NdHcr4WU7WvJWbBkwa4fdtN5E4WZIlPtGn6TEH97x0zGe/r61Bwnxpr4+SgjG7ooFT66Jqv/lbSOi08xBTGA==",
       "cpu": [
         "x64"
       ],
@@ -1179,9 +1179,9 @@
       }
     },
     "node_modules/@harperfast/rocksdb-js-linux-x64-musl": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-linux-x64-musl/-/rocksdb-js-linux-x64-musl-2.9.0.tgz",
-      "integrity": "sha512-D/MfsqycP7ijIAAptUcITsMMzn7cnawdL3H1XUqe+h9fgNP7+y0gXk/9KxVA5D6cKPw1TkEDaeLuuBsiI2vFUA==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-linux-x64-musl/-/rocksdb-js-linux-x64-musl-2.9.1.tgz",
+      "integrity": "sha512-OmhRNdT9JS+jMe3UMk0SN7fgMo2RZMaU0j67HY636kNMTPdtrJesUjp9IbekmE+NZzJnQvPucvgGxNDk+mm0Pg==",
       "cpu": [
         "x64"
       ],
@@ -1198,9 +1198,9 @@
       }
     },
     "node_modules/@harperfast/rocksdb-js-win32-arm64": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-win32-arm64/-/rocksdb-js-win32-arm64-2.9.0.tgz",
-      "integrity": "sha512-76PILBAErw0R9enoprg83FdyHk0UNG63pII4klFV5Xlrfj0gmJ0iqLEbocEwC+d2RTGkpgkUPjoNMw4BbMpyTA==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-win32-arm64/-/rocksdb-js-win32-arm64-2.9.1.tgz",
+      "integrity": "sha512-Tn66YO/6e8BOwKLERig9GkBftLqgqLpCv0MkpIjc9WcVMHObeZmosTyhXzvU3KtxBDRQs6nAC+VgYSH8LJAOnw==",
       "cpu": [
         "arm64"
       ],
@@ -1214,9 +1214,9 @@
       }
     },
     "node_modules/@harperfast/rocksdb-js-win32-x64": {
-      "version": "2.9.0",
-      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-win32-x64/-/rocksdb-js-win32-x64-2.9.0.tgz",
-      "integrity": "sha512-BRPIzbvx1NlOhA6vwAnUwFYuIQykmdsjGxnblb5ejvdf9HFw0b6durdKQfPyk8L+RO2uiXqpfkK4Da8V0vhgdQ==",
+      "version": "2.9.1",
+      "resolved": "https://registry.npmjs.org/@harperfast/rocksdb-js-win32-x64/-/rocksdb-js-win32-x64-2.9.1.tgz",
+      "integrity": "sha512-vgsNVv7mwXpGPlba11fgcLgM3cLubwxr8aUIN9RoXx+PWLcoQLEQJ/fhSrtctdlkIWNGHjM5i3gvuv0jbqWxmw==",
       "cpu": [
         "x64"
       ],

package/package.json

@@ -1,7 +1,7 @@
 {
 	"name": "@harperfast/harper",
 	"description": "Harper is an open-source Node.js performance platform that unifies database, cache, application, and messaging layers into one in-memory process.",
-	"version": "5.2.10",
+	"version": "5.2.13",
 	"license": "Apache-2.0",
 	"homepage": "https://harper.fast",
 	"bugs": {
@@ -179,7 +179,7 @@
 		"@fastify/cors": "^11.2.0",
 		"@fastify/static": "^9.1.3",
 		"@harperfast/extended-iterable": "1.0.3",
-		"@harperfast/rocksdb-js": "2.9.0",
+		"@harperfast/rocksdb-js": "2.9.1",
 		"@harperfast/skills": "^1.10.8",
 		"@turf/area": "6.5.0",
 		"@turf/boolean-contains": "6.5.0",

package/resources/Table.ts

@@ -49,6 +49,7 @@ import {
 	ServerError,
 	AccessViolation,
 	ValidationError,
+	appendErrorContext,
 	type ValidationIssue,
 } from '../utility/errors/hdbError.ts';
 import * as signalling from '../utility/signalling.ts';
@@ -139,6 +140,20 @@ const EVICTION_BATCH_SIZE = 100;
 // letting an unbounded number of open transactions (and their snapshots) accumulate.
 const MAX_INFLIGHT_EVICTION_BATCHES = 4;
 const CACHEABLE_STATUS_CODES = new Set([200, 203, 204, 206, 300, 301, 308, 404, 405, 410, 414, 501]);
+// Smallest forward sample `getRecordCount` will extrapolate a record rate from; below it the scan runs
+// to completion and reports an exact count.
+const MIN_ESTIMATOR_SAMPLE = 1_000;
+// Budget intervals the forward scan may spend before it must estimate rather than keep scanning.
+const MAX_ESTIMATE_CHECKPOINTS = 20;
+// A store estimate's `count`, or 0 when the store answered with a shape that cannot be trusted --
+// DESIGN.md's invariant for this API family is that such an answer degrades rather than poisons.
+function usableCount(estimate: any): number {
+	const { count, confidence } = estimate ?? {};
+	// `confidence` needs its own finiteness check, not just the range: `null >= 0 && null <= 1` is true
+	if (!Number.isFinite(count) || count < 0 || !Number.isFinite(confidence) || confidence < 0 || confidence > 1)
+		return 0;
+	return count;
+}
 envMngr.initSync();
 const LMDB_PREFETCH_WRITES = envMngr.get(CONFIG_PARAMS.STORAGE_PREFETCHWRITES);
 const LOCK_TIMEOUT = 10000;
@@ -1595,8 +1610,7 @@ export function makeTable(options) {
 					records: './', // an href to the records themselves
 					name: tableName,
 					database: databaseName,
-					auditSize:
-						auditStore instanceof RocksDatabase ? auditStore.getKeysCount() : auditStore?.getStats().entryCount,
+					auditSize: auditStore?.getStats().entryCount,
 					attributes,
 					recordCount: undefined,
 					estimatedRecordRange: undefined,
@@ -4896,82 +4910,174 @@ export function makeTable(options) {
 			const exactCount = options?.exactCount;
 			const TIME_LIMIT = options?.timeLimit ?? 1000 / 2; // one second time limit, enforced by seeing if we are halfway through at 500ms
 			const start = performance.now();
-			// `entryCount` (the exact key count) is only needed once the scan blows the time budget --
-			// to decide whether to estimate and as the extrapolation base. On RocksDB it is a full
-			// key-only scan, so we defer it: tables that finish within budget (the common case) and
-			// `exact_count` requests never pay for it. `halfway`/`entryCount` stay 0 until first computed.
 			let entryCount = 0;
-			let halfway = 0;
-			let counted = false;
-			let completeForExact = false;
+			let remainderPhysical = 0;
+			let estimator;
+			// feature-detected per DESIGN.md's invariant for this API family; LMDB stores do not implement it
+			const canEstimate =
+				typeof primaryStore.createCountEstimator === 'function' && typeof primaryStore.estimateCount === 'function';
+			let estimatorFailed = false;
+			let warnedNoBase = false;
+			let checkpoints = 0;
+			let checkpointedEntries = 0;
 			let recordCount = 0;
 			let entriesScanned = 0;
+			let lastKey;
 			let limit: number;
-			for (const { value } of primaryStore.getRange({ start: true, lazy: true, snapshot: false })) {
+			let nextCheckAt = start + TIME_LIMIT;
+			for (const { key, value } of primaryStore.getRange({ start: true, lazy: true, snapshot: false })) {
 				if (value != null) recordCount++;
 				entriesScanned++;
+				lastKey = key;
 				await rest();
-				if (!exactCount && !completeForExact && performance.now() - start > TIME_LIMIT) {
-					if (!counted) {
-						counted = true;
-						entryCount = isRocksDB
-							? primaryStore.getKeysCount({ start: undefined })
-							: primaryStore.getStats().entryCount;
-						halfway = Math.floor(entryCount / 2);
+				// a table too small to reach the floor is small enough to finish exactly
+				if (exactCount || entriesScanned < MIN_ESTIMATOR_SAMPLE) continue;
+				const now = performance.now();
+				if (now <= nextCheckAt) continue;
+				nextCheckAt = now + TIME_LIMIT;
+				checkpoints++;
+				if (canEstimate && !estimatorFailed) {
+					try {
+						estimator ??= primaryStore.createCountEstimator({ start: true });
+						estimator.advance(lastKey, entriesScanned - checkpointedEntries);
+						checkpointedEntries = entriesScanned;
+						entryCount = usableCount(estimator.estimate());
+					} catch (error) {
+						// a store closing concurrently -- drop_table can, while this scan is parked in a yield
+						logger.debug?.('Count estimator unavailable, falling back to an exact scan', error);
+						estimatorFailed = true;
+						estimator = undefined;
+						entryCount = 0;
 					}
-					if (entriesScanned < halfway) {
-						// it is taking too long, so we will just take this sample and a sample from the end to estimate
-						limit = entriesScanned;
-						break;
+				} else if (!canEstimate) {
+					// `canEstimate` false is not the same as "LMDB": a RocksDB store whose native module predates
+					// the estimator API lands here too, and `RocksDatabase.getStats()` carries no `entryCount`.
+					try {
+						const stats = primaryStore.getStats?.();
+						entryCount = Number.isFinite(stats?.entryCount) && stats.entryCount > 0 ? stats.entryCount : 0;
+					} catch {
+						entryCount = 0;
 					}
-					// Past the halfway point already: finishing the scan for an exact count is cheaper
-					// than estimating. Set the flag so we stop re-evaluating the budget on each remaining iteration.
-					completeForExact = true;
+				}
+				if (!entryCount && canEstimate && !estimatorFailed) {
+					// Range estimates are block-granular and can report 0 for a store whose entries are still
+					// in the memtable. Without a base the escape cannot fire at all, so fall back to the
+					// whole-store property rather than silently walking the table.
+					try {
+						const wholeStore = primaryStore.getEstimatedKeyCount();
+						entryCount = Number.isFinite(wholeStore) && wholeStore > 0 ? wholeStore : 0;
+					} catch {
+						entryCount = 0;
+					}
+					if (!entryCount && !warnedNoBase) {
+						warnedNoBase = true;
+						logger.debug?.(`No usable key-count estimate for ${tableName}; counting records by full scan`);
+					}
+				}
+				// Zero is "no usable base": degrade to the exact scan. The checkpoint ceiling is what stops a
+				// base that keeps undershooting from holding the halfway test false forever and walking the
+				// whole table; the reverse sample is bounded by `limit` in turn.
+				if (
+					entryCount > 0 &&
+					(checkpoints >= MAX_ESTIMATE_CHECKPOINTS || entriesScanned < Math.floor(entryCount / 2))
+				) {
+					if (canEstimate) {
+						try {
+							const remaining = primaryStore.estimateCount({ start: lastKey, exclusiveStart: true });
+							// widened by its own reported untrustworthiness: block-granular, so it can land below
+							// the live count it is meant to bound
+							const remainingCount = usableCount(remaining);
+							remainderPhysical = remainingCount > 0 ? remainingCount * (2 - remaining.confidence) : 0;
+						} catch {
+							remainderPhysical = 0;
+						}
+						// A zero or unusable remainder is valid -- entries still in the memtable read as none
+						// through range statistics -- but it would leave `baseMax` resting on the sampled ends
+						// alone. The whole-store property is a separate, non-range source, so fall back to it.
+						if (!remainderPhysical) {
+							try {
+								const wholeStore = primaryStore.getEstimatedKeyCount();
+								if (Number.isFinite(wholeStore)) remainderPhysical = Math.max(wholeStore - entriesScanned, 0);
+							} catch {
+								remainderPhysical = 0;
+							}
+						}
+					}
+					limit = entriesScanned;
+					break;
 				}
 			}
 			if (limit) {
 				// in this case we are going to make an estimate of the table count using the first thousand
 				// entries and last thousand entries
 				const firstRecordCount = recordCount;
+				const firstKey = lastKey;
 				recordCount = 0;
 				// Bound the reverse scan explicitly. The getRange `limit` option is honored by lmdb-js but
 				// ignored by rocksdb-js; without this break the scan reads the whole table, so `recordRate`
 				// blows up to ~entryCount/(2*limit) and the estimate scales with entryCount^2 -- the source
 				// of the wildly inflated `record_count` (e.g. 20,000,000 for ~105k rows) on large RocksDB
-				// tables. The early-exit above guarantees limit < entryCount/2, so the two samples stay disjoint.
+				// tables.
 				let reverseScanned = 0;
-				for (const { value } of primaryStore.getRange({
+				// Sized independently of the forward scan. `entriesScanned` is whatever the forward pass
+				// covered before it escaped, and the checkpoint ceiling lets that run twenty budget
+				// intervals when the base keeps undershooting; matching it here would read that same count
+				// again and double the wall clock of the call this path exists to bound.
+				const reverseLimit = Math.min(limit, MIN_ESTIMATOR_SAMPLE);
+				// Disjointness is enforced against the forward scan's own last key rather than inferred from
+				// the base, which is an estimate that can overshoot by more than 2x.
+				let sampledWholeTable = false;
+				for (const { key, value } of primaryStore.getRange({
 					start: '\uffff',
 					reverse: true,
 					lazy: true,
-					limit,
+					limit: reverseLimit,
 					snapshot: false,
 				})) {
+					if (compareKeys(key, firstKey) <= 0) {
+						sampledWholeTable = true;
+						break;
+					}
 					if (value != null) recordCount++;
 					reverseScanned++;
 					await rest();
-					if (reverseScanned >= limit) break;
+					if (reverseScanned >= reverseLimit) break;
 				}
+				// the samples met, so between them they covered every entry
+				if (sampledWholeTable) return { recordCount: recordCount + firstRecordCount };
 				// Use the actual entries sampled, not limit*2: the reverse scan can yield fewer than `limit`
 				// (concurrent deletions under snapshot:false, or an overestimated entryCount), and counting
 				// those un-scanned slots would inflate the denominator and underestimate the rate.
-				const sampleSize = limit + reverseScanned;
-				const recordRate = (recordCount + firstRecordCount) / sampleSize;
-				const variance =
-					Math.pow((recordCount - firstRecordCount + 1) / limit / 2, 2) + // variance between samples
-					(recordRate * (1 - recordRate)) / sampleSize;
-				const sd = Math.max(Math.sqrt(variance) * entryCount, 1);
-				const estimatedRecordCount = Math.round(recordRate * entryCount);
-				// TODO: This uses a normal/Wald interval, but a binomial confidence interval is probably better calculated using
-				// Wilson score interval or Agresti-Coull interval (I think the latter is a little easier to calculate/implement).
-				const lowerCiLimit = Math.max(estimatedRecordCount - 1.96 * sd, recordCount + firstRecordCount);
-				const upperCiLimit = Math.min(estimatedRecordCount + 1.96 * sd, entryCount);
-				let significantUnit = Math.pow(10, Math.round(Math.log10(sd)));
-				if (significantUnit > estimatedRecordCount) significantUnit = significantUnit / 10;
-				recordCount = Math.round(estimatedRecordCount / significantUnit) * significantUnit;
+				const sampledRecords = recordCount + firstRecordCount;
+				const recordRate = sampledRecords / (limit + reverseScanned);
+				// Endpoints for the extrapolation base, spanning both ways an estimated base can be wrong:
+				// every remaining entry superseded (only what was sampled is live) through every remaining
+				// entry live (the uncalibrated physical count). Churn concentrated outside the sampled ends
+				// calibrates to nothing, so an interval derived from the estimator's confidence would sit
+				// narrowly around the wrong number. Both endpoints are themselves estimates on RocksDB, so
+				// this is a widened heuristic interval, not a guaranteed bound on the live count.
+				const baseMin = entriesScanned + reverseScanned;
+				const baseMax = Math.max(entriesScanned + remainderPhysical, entryCount, baseMin);
+				const estimatedRecordCount = Math.round(recordRate * Math.max(entryCount, baseMin));
+				// The samples counted these directly, and the entries between them can only add; everything
+				// outside the samples could be live. A statistical interval inside those endpoints would be
+				// narrowest exactly where the ends are least representative of the middle -- sampled ends
+				// that are all deletion entries give a rate of 0, collapsing an upper end to ~0 with live
+				// rows in between -- so the endpoints are the evidence itself.
+				const lower = sampledRecords;
+				const upper = Math.round(baseMax);
+				// Report only the precision the interval supports, but never so coarse a unit that the
+				// estimate rounds away: `baseMax` is physical and can exceed a calibrated estimate by
+				// orders of magnitude, which a single division cannot walk back.
+				let significantUnit = Math.pow(10, Math.round(Math.log10(Math.max((upper - lower) / 2, 1))));
+				while (significantUnit > estimatedRecordCount && significantUnit > 1) significantUnit /= 10;
+				recordCount = Math.min(
+					Math.max(Math.round(estimatedRecordCount / significantUnit) * significantUnit, lower),
+					upper
+				);
 				return {
 					recordCount,
-					estimatedRange: [Math.round(lowerCiLimit), Math.round(upperCiLimit)],
+					estimatedRange: [lower, upper],
 				};
 			}
 			return {
@@ -6089,25 +6195,34 @@ export function makeTable(options) {
 					}
 					resolve(resolvedEntry);
 				} catch (error) {
-					error.message += ` while resolving record ${id} for ${tableName}`;
-					if (
-						existingRecord &&
-						(((error.code === 'ECONNRESET' || error.code === 'ECONNREFUSED' || error.code === 'EAI_AGAIN') &&
-							!context?.mustRevalidate) ||
-							(context?.staleIfError &&
-								(error.statusCode === 500 ||
-									error.statusCode === 502 ||
-									error.statusCode === 503 ||
-									error.statusCode === 504)))
-					) {
-						// these are conditions under which we can use stale data after an error
-						resolve({
-							key: id,
-							version: existingVersion,
-							value: existingRecord,
-						} as any);
-						logger.trace?.(error.message, '(returned stale record)');
-					} else reject(error);
+					// A source may reject with anything at all, so deciding how to settle is itself
+					// fallible: `message` is not assignable on every error (a DOMException from
+					// AbortSignal.timeout), and a nullish rejection makes the reads below throw.
+					// Leaving this promise unsettled hangs the caller forever, so every path here
+					// has to end in resolve() or reject().
+					try {
+						appendErrorContext(error, ` while resolving record ${id} for ${tableName}`);
+						if (
+							existingRecord &&
+							(((error.code === 'ECONNRESET' || error.code === 'ECONNREFUSED' || error.code === 'EAI_AGAIN') &&
+								!context?.mustRevalidate) ||
+								(context?.staleIfError &&
+									(error.statusCode === 500 ||
+										error.statusCode === 502 ||
+										error.statusCode === 503 ||
+										error.statusCode === 504)))
+						) {
+							// these are conditions under which we can use stale data after an error
+							resolve({
+								key: id,
+								version: existingVersion,
+								value: existingRecord,
+							} as any);
+							logger.trace?.((error as Error)?.message, '(returned stale record)');
+						} else reject(error);
+					} catch (settlingError) {
+						reject(error ?? settlingError);
+					}
 					const resolveDuration = performance.now() - start;
 					recordAction(resolveDuration, 'cache-resolution', tableName, null, 'fail');
 					if (responseHeaders)