@harperfast/harper 5.3.0-beta.4 → 5.3.0

package/dist/validation/searchValidator.js

@@ -44,7 +44,22 @@ const hdbUtils = __importStar(require("../utility/common_utils.js"));
 const common_validators_ts_1 = require("./common_validators.js");
 const hdbError_ts_1 = require("../utility/errors/hdbError.js");
 const databases_ts_1 = require("../resources/databases.js");
+const fullTextQueryProtocol_ts_1 = require("../resources/indexes/fullTextQueryProtocol.js");
 const { HTTP_STATUS_CODES } = hdbError_ts_1.hdbErrors;
+const FULL_TEXT_COMPARATOR_SET = new Set(fullTextQueryProtocol_ts_1.FULL_TEXT_COMPARATORS);
+const SEARCH_BY_CONDITIONS_COMPARATORS = [
+    'equals',
+    'contains',
+    'starts_with',
+    'ends_with',
+    'greater_than',
+    'greater_than_equal',
+    'less_than',
+    'less_than_equal',
+    'between',
+    'not_equal',
+    ...fullTextQueryProtocol_ts_1.FULL_TEXT_COMPARATORS,
+];
 const searchByValueSchema = joi_1.default.object({
     database: common_validators_ts_1.hdbDatabase,
     schema: common_validators_ts_1.hdbDatabase,
@@ -73,8 +88,12 @@ const searchByConditionsSchema = joi_1.default.object({
         .items(joi_1.default.alternatives(joi_1.default.object({ operator: joi_1.default.string().valid('and', 'or').default('and').lowercase(), conditions: joi_1.default.array() }), joi_1.default.object({
         attribute: joi_1.default.alternatives(common_validators_ts_1.hdbSchemaTable, joi_1.default.array().min(1)),
         comparator: joi_1.default.string()
-            .valid('equals', 'contains', 'starts_with', 'ends_with', 'greater_than', 'greater_than_equal', 'less_than', 'less_than_equal', 'between', 'not_equal')
+            .valid(...SEARCH_BY_CONDITIONS_COMPARATORS)
             .optional(),
+        fields: joi_1.default.array().min(1).items(common_validators_ts_1.hdbSchemaTable).optional(),
+        includeHighlights: joi_1.default.bool().optional(),
+        maxIndexLagMilliseconds: joi_1.default.number().min(0).optional(),
+        waitForIndexMilliseconds: joi_1.default.number().min(0).max(30_000).optional(),
         value: joi_1.default.when('comparator', {
             switch: [
                 { is: 'equals', then: joi_1.default.any() },
@@ -150,7 +169,8 @@ function default_1(searchObject, type) {
             for (const condition of searchObject.conditions) {
                 if (condition.conditions)
                     addConditions(condition);
-                else
+                // Table.search resolves full-text names together with source-field authorization.
+                else if (!FULL_TEXT_COMPARATOR_SET.has(condition.comparator))
                     checkAttributes.push(condition.attribute);
             }
         };

package/dist/validation/searchValidator.js.map

@@ -1 +1 @@
-{"version":3,"file":"searchValidator.js","sourceRoot":"","sources":["../../validation/searchValidator.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyEA,4BA6FC;AAtKD,0CAA4B;AAC5B,kEAAoD;AACpD,8CAAsB;AACtB,qEAAuD;AACvD,iEAAgG;AAChG,+DAA0E;AAC1E,4DAAyD;AAEzD,MAAM,EAAE,iBAAiB,EAAE,GAAG,uBAAS,CAAC;AAExC,MAAM,mBAAmB,GAAG,aAAG,CAAC,MAAM,CAAC;IACtC,QAAQ,EAAE,kCAAW;IACrB,MAAM,EAAE,kCAAW;IACnB,KAAK,EAAE,+BAAQ;IACf,SAAS,EAAE,qCAAc;IACzB,KAAK,EAAE,aAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC3B,cAAc,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAG,CAAC,YAAY,CAAC,qCAAc,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE;IACnG,IAAI,EAAE,aAAG,CAAC,IAAI,EAAE;IAChB,KAAK,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;CACrC,CAAC,CAAC;AAEH,MAAM,wBAAwB,GAAG,aAAG,CAAC,MAAM,CAAC;IAC3C,QAAQ,EAAE,kCAAW;IACrB,MAAM,EAAE,kCAAW;IACnB,KAAK,EAAE,+BAAQ;IACf,QAAQ,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE;IACpE,MAAM,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,KAAK,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,cAAc,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAG,CAAC,YAAY,CAAC,qCAAc,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE;IACnG,IAAI,EAAE,aAAG,CAAC,MAAM,CAAC;QAChB,SAAS,EAAE,aAAG,CAAC,YAAY,CAAC,qCAAc,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,UAAU,EAAE,aAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE;KACjC,CAAC,CAAC,QAAQ,EAAE;IACb,UAAU,EAAE,aAAG,CAAC,KAAK,EAAE;SACrB,GAAG,CAAC,CAAC,CAAC;SACN,KAAK,CACL,aAAG,CAAC,YAAY,CACf,aAAG,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,UAAU,EAAE,aAAG,CAAC,KAAK,EAAE,EAAE,CAAC,EAC7G,aAAG,CAAC,MAAM,CAAC;QACV,SAAS,EAAE,aAAG,CAAC,YAAY,CAAC,qCAAc,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,UAAU,EAAE,aAAG,CAAC,MAAM,EAAE;aACtB,KAAK,CACL,QAAQ,EACR,UAAU,EACV,aAAa,EACb,WAAW,EACX,cAAc,EACd,oBAAoB,EACpB,WAAW,EACX,iBAAiB,EACjB,SAAS,EACT,WAAW,CACX;aACA,QAAQ,EAAE;QACZ,KAAK,EAAE,aAAG,CAAC,IAAI,CAAC,YAAY,EAAE;YAC7B,MAAM,EAAE;gBACP,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,aAAG,CAAC,GAAG,EAAE,EAAE;gBACjC;oBACC,EAAE,EAAE,SAAS;oBACb,IAAI,EAAE,aAAG,CAAC,KAAK,EAAE;yBACf,KAAK,CAAC,aAAG,CAAC,YAAY,CAAC,CAAC,aAAG,CAAC,MAAM,EAAE,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;yBACrD,MAAM,CAAC,CAAC,CAAC;iBACX;aACD;YACD,SAAS,EAAE,aAAG,CAAC,YAAY,CAAC,aAAG,CAAC,MAAM,EAAE,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC;SACvD,CAAC,CAAC,QAAQ,EAAE;KACb,CAAC,CACF,CACD;SACA,QAAQ,EAAE;CACZ,CAAC,CAAC;AAEH,mBAAyB,YAAiB,EAAE,IAAS;IACpD,IAAI,eAAe,GAAG,IAAI,CAAC;IAC3B,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,OAAO;YACX,eAAe,GAAG,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;YAChF,MAAM;QACP,KAAK,QAAQ;YACZ,IAAI,MAAM,CAAC;YACX,QAAQ,CAAC,IAAA,sCAAe,EAAC,UAAU,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3D,QAAQ,CAAC,IAAA,sCAAe,EAAC,OAAO,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,YAAY,CAAC,WAAW;gBAAE,QAAQ,CAAC,2BAA2B,CAAC,CAAC;iBAChE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,WAAW,CAAC;gBAAE,QAAQ,CAAC,gCAAgC,CAAC,CAAC;iBACzF,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,CAAC;gBAC1G,QAAQ,CAAC,0CAA0C,CAAC,CAAC;YACtD,IAAI,CAAC,YAAY,CAAC,cAAc;gBAAE,QAAQ,CAAC,8BAA8B,CAAC,CAAC;iBACtE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,cAAc,CAAC;gBAAE,QAAQ,CAAC,mCAAmC,CAAC,CAAC;iBAC/F,IAAI,YAAY,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;gBAAE,QAAQ,CAAC,+CAA+C,CAAC,CAAC;iBACxG,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,CAAC;gBAC7G,QAAQ,CAAC,6CAA6C,CAAC,CAAC;YACzD,SAAS,QAAQ,CAAC,KAAK;gBACtB,IAAI,MAAM;oBAAE,MAAM,IAAI,IAAI,GAAG,KAAK,CAAC;;oBAC9B,MAAM,GAAG,KAAK,CAAC;YACrB,CAAC;YACD,IAAI,MAAM;gBAAE,eAAe,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YACvD,MAAM;QACP,KAAK,YAAY;YAChB,eAAe,GAAG,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,wBAAwB,CAAC,CAAC;YACrF,MAAM;QACP;YACC,MAAM,IAAI,KAAK,CAAC,0CAA0C,IAAI,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,6DAA6D;IAC7D,IAAI,CAAC,eAAe,IAAI,YAAY,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC1D,oCAAoC;QACpC,kDAAkD;QAClD,IAAI,gBAAgB,GAAG,QAAQ,CAAC,sBAAsB,CAAC,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;QAChG,IAAI,gBAAgB,EAAE,CAAC;YACtB,OAAO,IAAA,4BAAc,EAAC,IAAI,KAAK,EAAE,EAAE,gBAAgB,EAAE,iBAAiB,CAAC,SAAS,CAAC,CAAC;QACnF,CAAC;QAED,IAAI,WAAW,GAAG,IAAA,2BAAY,GAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC1E,IAAI,kBAAkB,GAAG,WAAW,CAAC,UAAU,CAAC;QAEhD,sCAAsC;QACtC,IAAI,eAAe,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAE1F,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YACtB,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9C,CAAC;QAED,+EAA+E;QAC/E,MAAM,aAAa,GAAG,CAAC,YAAY,EAAE,EAAE;YACtC,mEAAmE;YACnE,KAAK,MAAM,SAAS,IAAI,YAAY,CAAC,UAAU,EAAE,CAAC;gBACjD,IAAI,SAAS,CAAC,UAAU;oBAAE,aAAa,CAAC,SAAS,CAAC,CAAC;;oBAC9C,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YAChD,CAAC;QACF,CAAC,CAAC;QACF,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;YAC3B,aAAa,CAAC,YAAY,CAAC,CAAC;QAC7B,CAAC;QAED,IAAI,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAC/B,eAAe,EACf,CAAC,SAAS,EAAE,EAAE,CACb,SAAS,KAAK,GAAG;YACjB,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,IAAI,kBAAkB;YAClD,SAAS,CAAC,SAAS,KAAK,GAAG,IAAI,oCAAoC;YACnE,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;YACzB,CAAC,SAAS,CAAC,IAAI,IAAI,mBAAmB;YACtC,CAAC,CAAC,CAAC,IAAI,CACN,kBAAkB,EAClB,CACC,cAAmB,CAAC,wDAAwD;cAC3E,EAAE,CACH,cAAc,KAAK,SAAS;gBAC5B,cAAc,CAAC,SAAS,KAAK,SAAS;gBACtC,cAAc,CAAC,SAAS,KAAM,SAAiB,CAAC,SAAS,CAC1D,CACF,CAAC;QAEF,qJAAqJ;QACrJ,uEAAuE;QACvE,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvD,iEAAiE;YACjE,IAAI,QAAQ,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YACnD,OAAO,IAAI,KAAK,CAAC,sBAAsB,QAAQ,GAAG,CAAC,CAAC;QACrD,CAAC;IACF,CAAC;IAED,OAAO,eAAe,CAAC;AACxB,CAAC"}
+{"version":3,"file":"searchValidator.js","sourceRoot":"","sources":["../../validation/searchValidator.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiFA,4BA8FC;AA/KD,0CAA4B;AAC5B,kEAAoD;AACpD,8CAAsB;AACtB,qEAAuD;AACvD,iEAAgG;AAChG,+DAA0E;AAC1E,4DAAyD;AACzD,4FAAsF;AAEtF,MAAM,EAAE,iBAAiB,EAAE,GAAG,uBAAS,CAAC;AACxC,MAAM,wBAAwB,GAAG,IAAI,GAAG,CAAS,gDAAqB,CAAC,CAAC;AACxE,MAAM,gCAAgC,GAAG;IACxC,QAAQ;IACR,UAAU;IACV,aAAa;IACb,WAAW;IACX,cAAc;IACd,oBAAoB;IACpB,WAAW;IACX,iBAAiB;IACjB,SAAS;IACT,WAAW;IACX,GAAG,gDAAqB;CACf,CAAC;AAEX,MAAM,mBAAmB,GAAG,aAAG,CAAC,MAAM,CAAC;IACtC,QAAQ,EAAE,kCAAW;IACrB,MAAM,EAAE,kCAAW;IACnB,KAAK,EAAE,+BAAQ;IACf,SAAS,EAAE,qCAAc;IACzB,KAAK,EAAE,aAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC3B,cAAc,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAG,CAAC,YAAY,CAAC,qCAAc,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE;IACnG,IAAI,EAAE,aAAG,CAAC,IAAI,EAAE;IAChB,KAAK,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,MAAM,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;CACrC,CAAC,CAAC;AAEH,MAAM,wBAAwB,GAAG,aAAG,CAAC,MAAM,CAAC;IAC3C,QAAQ,EAAE,kCAAW;IACrB,MAAM,EAAE,kCAAW;IACnB,KAAK,EAAE,+BAAQ;IACf,QAAQ,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE;IACpE,MAAM,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,KAAK,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,cAAc,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,aAAG,CAAC,YAAY,CAAC,qCAAc,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE;IACnG,IAAI,EAAE,aAAG,CAAC,MAAM,CAAC;QAChB,SAAS,EAAE,aAAG,CAAC,YAAY,CAAC,qCAAc,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,UAAU,EAAE,aAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE;KACjC,CAAC,CAAC,QAAQ,EAAE;IACb,UAAU,EAAE,aAAG,CAAC,KAAK,EAAE;SACrB,GAAG,CAAC,CAAC,CAAC;SACN,KAAK,CACL,aAAG,CAAC,YAAY,CACf,aAAG,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,UAAU,EAAE,aAAG,CAAC,KAAK,EAAE,EAAE,CAAC,EAC7G,aAAG,CAAC,MAAM,CAAC;QACV,SAAS,EAAE,aAAG,CAAC,YAAY,CAAC,qCAAc,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,UAAU,EAAE,aAAG,CAAC,MAAM,EAAE;aACtB,KAAK,CAAC,GAAG,gCAAgC,CAAC;aAC1C,QAAQ,EAAE;QACZ,MAAM,EAAE,aAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,qCAAc,CAAC,CAAC,QAAQ,EAAE;QAC3D,iBAAiB,EAAE,aAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE;QACxC,uBAAuB,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE;QACvD,wBAAwB,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE;QACpE,KAAK,EAAE,aAAG,CAAC,IAAI,CAAC,YAAY,EAAE;YAC7B,MAAM,EAAE;gBACP,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,aAAG,CAAC,GAAG,EAAE,EAAE;gBACjC;oBACC,EAAE,EAAE,SAAS;oBACb,IAAI,EAAE,aAAG,CAAC,KAAK,EAAE;yBACf,KAAK,CAAC,aAAG,CAAC,YAAY,CAAC,CAAC,aAAG,CAAC,MAAM,EAAE,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;yBACrD,MAAM,CAAC,CAAC,CAAC;iBACX;aACD;YACD,SAAS,EAAE,aAAG,CAAC,YAAY,CAAC,aAAG,CAAC,MAAM,EAAE,EAAE,aAAG,CAAC,MAAM,EAAE,CAAC;SACvD,CAAC,CAAC,QAAQ,EAAE;KACb,CAAC,CACF,CACD;SACA,QAAQ,EAAE;CACZ,CAAC,CAAC;AAEH,mBAAyB,YAAiB,EAAE,IAAS;IACpD,IAAI,eAAe,GAAG,IAAI,CAAC;IAC3B,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,OAAO;YACX,eAAe,GAAG,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;YAChF,MAAM;QACP,KAAK,QAAQ;YACZ,IAAI,MAAM,CAAC;YACX,QAAQ,CAAC,IAAA,sCAAe,EAAC,UAAU,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3D,QAAQ,CAAC,IAAA,sCAAe,EAAC,OAAO,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,YAAY,CAAC,WAAW;gBAAE,QAAQ,CAAC,2BAA2B,CAAC,CAAC;iBAChE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,WAAW,CAAC;gBAAE,QAAQ,CAAC,gCAAgC,CAAC,CAAC;iBACzF,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,CAAC;gBAC1G,QAAQ,CAAC,0CAA0C,CAAC,CAAC;YACtD,IAAI,CAAC,YAAY,CAAC,cAAc;gBAAE,QAAQ,CAAC,8BAA8B,CAAC,CAAC;iBACtE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,cAAc,CAAC;gBAAE,QAAQ,CAAC,mCAAmC,CAAC,CAAC;iBAC/F,IAAI,YAAY,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;gBAAE,QAAQ,CAAC,+CAA+C,CAAC,CAAC;iBACxG,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,CAAC;gBAC7G,QAAQ,CAAC,6CAA6C,CAAC,CAAC;YACzD,SAAS,QAAQ,CAAC,KAAK;gBACtB,IAAI,MAAM;oBAAE,MAAM,IAAI,IAAI,GAAG,KAAK,CAAC;;oBAC9B,MAAM,GAAG,KAAK,CAAC;YACrB,CAAC;YACD,IAAI,MAAM;gBAAE,eAAe,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YACvD,MAAM;QACP,KAAK,YAAY;YAChB,eAAe,GAAG,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,wBAAwB,CAAC,CAAC;YACrF,MAAM;QACP;YACC,MAAM,IAAI,KAAK,CAAC,0CAA0C,IAAI,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,6DAA6D;IAC7D,IAAI,CAAC,eAAe,IAAI,YAAY,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC1D,oCAAoC;QACpC,kDAAkD;QAClD,IAAI,gBAAgB,GAAG,QAAQ,CAAC,sBAAsB,CAAC,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;QAChG,IAAI,gBAAgB,EAAE,CAAC;YACtB,OAAO,IAAA,4BAAc,EAAC,IAAI,KAAK,EAAE,EAAE,gBAAgB,EAAE,iBAAiB,CAAC,SAAS,CAAC,CAAC;QACnF,CAAC;QAED,IAAI,WAAW,GAAG,IAAA,2BAAY,GAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC1E,IAAI,kBAAkB,GAAG,WAAW,CAAC,UAAU,CAAC;QAEhD,sCAAsC;QACtC,IAAI,eAAe,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAE1F,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YACtB,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9C,CAAC;QAED,+EAA+E;QAC/E,MAAM,aAAa,GAAG,CAAC,YAAY,EAAE,EAAE;YACtC,mEAAmE;YACnE,KAAK,MAAM,SAAS,IAAI,YAAY,CAAC,UAAU,EAAE,CAAC;gBACjD,IAAI,SAAS,CAAC,UAAU;oBAAE,aAAa,CAAC,SAAS,CAAC,CAAC;gBACnD,kFAAkF;qBAC7E,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,UAAU,CAAC;oBAAE,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;YACzG,CAAC;QACF,CAAC,CAAC;QACF,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;YAC3B,aAAa,CAAC,YAAY,CAAC,CAAC;QAC7B,CAAC;QAED,IAAI,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAC/B,eAAe,EACf,CAAC,SAAS,EAAE,EAAE,CACb,SAAS,KAAK,GAAG;YACjB,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,IAAI,kBAAkB;YAClD,SAAS,CAAC,SAAS,KAAK,GAAG,IAAI,oCAAoC;YACnE,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;YACzB,CAAC,SAAS,CAAC,IAAI,IAAI,mBAAmB;YACtC,CAAC,CAAC,CAAC,IAAI,CACN,kBAAkB,EAClB,CACC,cAAmB,CAAC,wDAAwD;cAC3E,EAAE,CACH,cAAc,KAAK,SAAS;gBAC5B,cAAc,CAAC,SAAS,KAAK,SAAS;gBACtC,cAAc,CAAC,SAAS,KAAM,SAAiB,CAAC,SAAS,CAC1D,CACF,CAAC;QAEF,qJAAqJ;QACrJ,uEAAuE;QACvE,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvD,iEAAiE;YACjE,IAAI,QAAQ,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YACnD,OAAO,IAAI,KAAK,CAAC,sBAAsB,QAAQ,GAAG,CAAC,CAAC;QACrD,CAAC;IACF,CAAC;IAED,OAAO,eAAe,CAAC;AACxB,CAAC"}

package/npm-shrinkwrap.json

@@ -1,12 +1,12 @@
 {
   "name": "harper",
-  "version": "5.3.0-beta.4",
+  "version": "5.3.0",
   "lockfileVersion": 3,
   "requires": true,
   "packages": {
     "": {
       "name": "harper",
-      "version": "5.3.0-beta.4",
+      "version": "5.3.0",
       "license": "Apache-2.0",
       "dependencies": {
         "@endo/static-module-record": "^1.1.2",
@@ -100,7 +100,7 @@
         "node": "^22.18.0 || >=24.0.0"
       },
       "optionalDependencies": {
-        "@harperfast/fulltext": "0.1.2",
+        "@harperfast/fulltext": "0.3.0",
         "@harperfast/hnsw": "0.4.0",
         "bufferutil": "4.1.0",
         "segfault-handler": "1.3.0",
@@ -696,25 +696,25 @@
       "license": "Apache-2.0"
     },
     "node_modules/@harperfast/fulltext": {
-      "version": "0.1.2",
-      "resolved": "https://registry.npmjs.org/@harperfast/fulltext/-/fulltext-0.1.2.tgz",
-      "integrity": "sha512-weaxC7SAjDr2u7ZLk+7RKOOtXNRtbavobx56r2QuHdK5M3v3pRpTFQosEkCnRghGxbwYS+ZFjkAMzlAW/kk3qw==",
+      "version": "0.3.0",
+      "resolved": "https://registry.npmjs.org/@harperfast/fulltext/-/fulltext-0.3.0.tgz",
+      "integrity": "sha512-co/h26nQ3JTpUx63MzhIxoKU0q1Ygkn5/JDmH8oNnVwhHuvEPP6qAoRemf08wficV0qOWM7LN/CPOvkE+OOajw==",
       "license": "Apache-2.0",
       "optional": true,
       "engines": {
         "node": "^22.18.0 || >=24.0.0"
       },
       "optionalDependencies": {
-        "@harperfast/fulltext-darwin-arm64": "0.1.2",
-        "@harperfast/fulltext-linux-arm64-gnu": "0.1.2",
-        "@harperfast/fulltext-linux-x64-gnu": "0.1.2",
-        "@harperfast/fulltext-win32-x64-msvc": "0.1.2"
+        "@harperfast/fulltext-darwin-arm64": "0.3.0",
+        "@harperfast/fulltext-linux-arm64-gnu": "0.3.0",
+        "@harperfast/fulltext-linux-x64-gnu": "0.3.0",
+        "@harperfast/fulltext-win32-x64-msvc": "0.3.0"
       }
     },
     "node_modules/@harperfast/fulltext-darwin-arm64": {
-      "version": "0.1.2",
-      "resolved": "https://registry.npmjs.org/@harperfast/fulltext-darwin-arm64/-/fulltext-darwin-arm64-0.1.2.tgz",
-      "integrity": "sha512-ULtqTCp1UkqcYXkqDMdycTby1Olcl+WOJMBjMEA6oBNm4YuadX7W+LeEkvo/uS/A+HpXjk9hp+bwiWeuG8Gaog==",
+      "version": "0.3.0",
+      "resolved": "https://registry.npmjs.org/@harperfast/fulltext-darwin-arm64/-/fulltext-darwin-arm64-0.3.0.tgz",
+      "integrity": "sha512-B/m088dRD87veV9BsFdFm5texc4R0VR2Gq7UKxySPX6eaBH1L1xFH3M1cx1c+xgVWfdSxoLMDl+gX8Xs8ANVcA==",
       "cpu": [
         "arm64"
       ],
@@ -728,9 +728,9 @@
       }
     },
     "node_modules/@harperfast/fulltext-linux-arm64-gnu": {
-      "version": "0.1.2",
-      "resolved": "https://registry.npmjs.org/@harperfast/fulltext-linux-arm64-gnu/-/fulltext-linux-arm64-gnu-0.1.2.tgz",
-      "integrity": "sha512-ycx9dpvQ9N4O2nb2xnys8LqWt7K14ZpvbF2p8UjA9Dulq3bDkEAi0Ct/qigNrH1/VcJgjJU8Xq7VXa/Hmiv2Sg==",
+      "version": "0.3.0",
+      "resolved": "https://registry.npmjs.org/@harperfast/fulltext-linux-arm64-gnu/-/fulltext-linux-arm64-gnu-0.3.0.tgz",
+      "integrity": "sha512-Lt35OD+FA/TOXlWnoNKCv6hhZtvWOg37TjDfRuHyRMVCy8hrrTwR63pfkl/UPya5YN6RaDZGEw8XWYwk1KqFCA==",
       "cpu": [
         "arm64"
       ],
@@ -747,9 +747,9 @@
       }
     },
     "node_modules/@harperfast/fulltext-linux-x64-gnu": {
-      "version": "0.1.2",
-      "resolved": "https://registry.npmjs.org/@harperfast/fulltext-linux-x64-gnu/-/fulltext-linux-x64-gnu-0.1.2.tgz",
-      "integrity": "sha512-gMPh9I0V7igap0O1IBedo3DdknzRCKQWmpXfLGWBUNxOPDyl1QA8dH7YX9o1CHF4AnfRE/ZPyFeVl6/BH8Fc1Q==",
+      "version": "0.3.0",
+      "resolved": "https://registry.npmjs.org/@harperfast/fulltext-linux-x64-gnu/-/fulltext-linux-x64-gnu-0.3.0.tgz",
+      "integrity": "sha512-+jw4/wwfDMwRJeAnxwG8gGkDKLU8a9vYudGWJCwSMLpCSDymPikn7bhN0q/9i1qYEouQwbx6eqWiM2/k30gAeA==",
       "cpu": [
         "x64"
       ],
@@ -766,9 +766,9 @@
       }
     },
     "node_modules/@harperfast/fulltext-win32-x64-msvc": {
-      "version": "0.1.2",
-      "resolved": "https://registry.npmjs.org/@harperfast/fulltext-win32-x64-msvc/-/fulltext-win32-x64-msvc-0.1.2.tgz",
-      "integrity": "sha512-hUK9N8/1WE3QLbpzU9oIHCc7iJIWS65Emu+3cdSfEsMBUyrNuzG3WOqWdr9oHktCUQkcTjFHyf2KssQekXtFOA==",
+      "version": "0.3.0",
+      "resolved": "https://registry.npmjs.org/@harperfast/fulltext-win32-x64-msvc/-/fulltext-win32-x64-msvc-0.3.0.tgz",
+      "integrity": "sha512-eUgin3y67xJ0RwKho7QeNAQFtNi9UnJ4t6SVUZqpZfVxzXmh5di2npYVV9S4Sku+R53pSvm8szcqd42cT2PBaw==",
       "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.3.0-beta.4",
+	"version": "5.3.0",
 	"license": "Apache-2.0",
 	"homepage": "https://harper.fast",
 	"bugs": {
@@ -151,7 +151,6 @@
 		"@types/sinon": "^22.0.0",
 		"@types/tar-fs": "^2.0.4",
 		"@types/tar-stream": "^3.1.4",
-		"@typescript-eslint/parser": "^8.48.1",
 		"axios": "1.20.0",
 		"chai": "^6.2.0",
 		"chai-as-promised": "^8.0.2",
@@ -175,7 +174,6 @@
 		"supertest": "^7.1.4",
 		"tsx": "^4.20.6",
 		"typescript": "^5.8.2",
-		"typescript-eslint": "^8.45.0",
 		"undici": "^7.24.4",
 		"uWebSockets.js": "https://github.com/uNetworking/uWebSockets.js/archive/624987739d4da0acb628aaf2a10fc43e7ce27c5c.tar.gz",
 		"why-is-node-still-running": "^1.0.0"
@@ -271,7 +269,7 @@
 		}
 	},
 	"optionalDependencies": {
-		"@harperfast/fulltext": "0.1.2",
+		"@harperfast/fulltext": "0.3.0",
 		"@harperfast/hnsw": "0.4.0",
 		"bufferutil": "4.1.0",
 		"segfault-handler": "1.3.0",

package/resources/DESIGN.md

@@ -34,6 +34,19 @@ The Resource layer is Harper's universal abstraction: all queryable/mutable thin
 
 ---
 
+## Full-text declarations and reader snapshots
+
+User-facing syntax: [Full-text search](FULL_TEXT.md).
+
+- Compile `name: FullText @fullText(...)` into `fullTextIndexes` and the internal durable `fullTextFields` name set. Programmatic declarations default that name set to every index name. Keep write/projection guards independent of query-reader readiness; the name set does not distinguish earlier declarations from new ones. Never add the declaration to `attributes` or record `properties`: it has no stored, computed, or selectable value. Source fields own permissions.
+- Accept only field placement with its name supplied by the field. Reject a `name` argument, table-level declarations, and index names that collide with current stored attributes. Earlier beta declarations and indexes have no supported upgrade path.
+- Hold one reader lease for the entire search, including every native result page and highlight trace. Reload only an idle reader. Publication during an active query opens a replacement for subsequent queries and retires the old reader after its lease drains. Offset paging across different native snapshots can duplicate or skip hits; deduplication cannot recover skipped hits.
+- Native fulltext owns commits and reader snapshots. Harper owns audit coverage, worker epochs, readiness, and publication notifications. A stable native snapshot does not imply a global record snapshot during concurrent writes; source versions are checked when hydrating hits.
+
+Sources: [schema parser](graphql.ts), [declaration compiler and generation identity](fullTextSchema.ts), [table read/write guards](Table.ts), [reader leases and paging](indexes/fullTextQueryIndex.ts), [publication-between-pages regression](../unitTests/resources/fullTextQueryIndex.test.js).
+
+---
+
 ## `Resource.ts` — base class
 
 Static methods are protocol entry points (each wrapped in `transactional()`); instance methods are the per-resource behavior hooks subclasses override.
@@ -100,7 +113,7 @@ One giant `makeTable()` factory that returns a `TableResource extends Resource`
 | How does a URL path map to a Resource?                                         | `Resources.ts → getMatch` (exact/prefix fast path) then `matchParamRoute` (parameterised routes); see "Path routing" below                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                               |
 | What do chained conditions (`a=ge=X&=le=Y`) mean over array values?            | SAME-ELEMENT scoping: `prepareConditions` (`Table.ts → search`) collapses the chain into one range comparator (`gele`/`gtlt`/…) before execution, so the indexed path (per-element index entries, one range scan) and the unindexed path (`search.ts → attributeComparator`, per-element `some` over the collapsed predicate) agree. Repeating the attribute as two independent conditions is independently existential (different elements may satisfy different legs). Only a single `and`-chained leg is supported — `\|=` and a second `&=` are rejected. An indexed scan whose range spans more than one indexed value collapses to one result per record before paging (`search.ts → distinctRecords`, #2434), so `limit`/`offset` count records rather than index entries; element equality stays uncollapsed because `[indexedValue, primaryKey]` is already unique. Pinned by `unitTests/resources/query-array-scoping.test.js`; known gaps: chained-leg values are never type-coerced (#2433), an undeclared (untyped) indexed attribute holding an array still repeats per entry, error paths (#2435).                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        |
 | How does HNSW keep the graph connected on delete?                              | `indexes/HierarchicalNavigableSmallWorld.ts → index()` delete path: zero-degree orphans reindexed via `needsReindexing`; severed multi-node islands detected and reconnected by `repairSeveredNeighbors` (#1712)                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         |
-| How is a filter applied _during_ a vector search?                              | Predicate-aware traversal (#1241): `search.ts → executeConditions` composes companion AND conditions with request `vectorFilter` / `rowFilter` predicates into one `(primaryKey) => boolean` (`composeRecordFilter`) and passes it to `HierarchicalNavigableSmallWorld.search(cond, ctx, { filter })`. The filter gates result admission at layer 0 only (routing ignores it, ACORN-style); a visit budget (`filterExpansion`) bounds the under-filled/selective case. Very selective _condition_ filters are instead diverted to the exact brute-force path by the query planner's `estimateCountAsSort` ordering.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      |
+| How is a filter applied _during_ a vector search?                              | Predicate-aware traversal (#1241): `search.ts → executeConditions` composes companion AND conditions with request `vectorFilter` / `rowFilter` predicates into one `(primaryKey) => boolean` (`composeRecordFilter`) and passes it to `HierarchicalNavigableSmallWorld.search(cond, ctx, { filter })`. The filter gates result admission at layer 0 only (routing ignores it, ACORN-style); a visit budget (`filterExpansion`) bounds the under-filled/selective case. Companion conditions an index range answers exactly (equality, `gt`/`ge`, `between`, nested AND/OR over those, when the record predicate rejects every value the index cannot supply: a missing value, and a `0` that may have been written as `-0`) are additionally planned into a key-only scan (`planCandidateKeys`, #2688) and passed as `{ candidateKeys }`; the index admits from that key set instead of loading a record per visited node, and drops the predicate entirely when the set covers every pushed-down condition and no `rowFilter`/`vectorFilter` is in play. Very selective _condition_ filters are instead diverted to the exact brute-force path by the query planner's `estimateCountAsSort` ordering.                                                                                                                                                                                                                                                                                                                                                                                                                                   |
 | How does post-ordering resolve vector distances safely?                        | Each comparator owns its `Sort`, passes it directly to the custom-index resolver, and caches distances by that immutable per-query sort object.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          |
 | How is application row filtering applied?                                      | Authorization admission happens in the resource operation before query work. The legacy `allow*` hook, when armed by the protocol, is evaluated once with its historical receiver semantics; overriding it never changes its scope. An operation override may add indexed conditions and/or attach the JavaScript-only synchronous `target.rowFilter(record, context)`. `Table.search` composes it with query filters and rechecks the final materialized cache/source record. `SubscriptionRequest.rowFilter` covers full-row events; `eventFilter(event, context)` explicitly handles tombstones/messages/raw events. Prefer indexed conditions because an opaque predicate may inspect every admitted candidate and `limit` applies after filtering.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  |
 
@@ -365,8 +378,10 @@ Tests: `../unitTests/resources/defineResource.test.js`, `../unitTests/resources/
   - **The override makes the access-control decision.** No `allow*` predicate runs for it. An override that is not meant to be public must check authorization itself.
 - **FK-side relationship accessors (`relationship.from`) are a synchronous contract** (v4 parity). The resolvers built in `Table.updatedAttributes` must read through `getSync`/`getEntry` (which block on a RocksDB block-cache miss, like v4's LMDB page faults) — never `get()`, whose `async: true` path returns a Promise on a cache miss and would leak an intermittent value-or-Promise to `record.<relation>` in user code. Pinned by the "relationship property access is synchronous" test in `../unitTests/resources/query.test.js`, which stubs `store.get` to throw.
   - **Known gap, not covered by that test:** the `.to` side (one-to-many/many-to-many, resolved via `relatedTable.search(...).asArray`) is synchronous for a local read, but `asArray` can still hand back a Promise when the search lands on a **caching** table whose row needs source revalidation — `transformEntryForSelect` returns `loadingFromSource.then(transform)` for an expired/invalidated entry. Same bug class this PR closes on the FK side; not yet fixed here.
+- **A combined `@relationship(from, to)` joins `related[to] == local[from]`, never the local primary key**, and only on an array-typed attribute (a scalar one is logged and gets no resolver). Four paths read `from` independently and must stay in step: the array resolver in `Table.updatedAttributes`, the index-driven join in `searchByIndex` (`joinTo` then `joinFrom`), the join-filtered select in `Table.transformEntryForSelect` (`resolver.from`), and a join filter's switch to an id set in `filterByType`. Pinned by the "@relationship with both from and to" block in `../unitTests/resources/query.test.js`, which uses a related record keyed by the local primary key as a decoy. Two more readers (`drivesRebuildingIndex`, the join estimate's `fromIndex` weighting in `estimateCondition`) affect only condition ordering, not join results, so they are not pinned by that block.
 - When adding a new early-return path inside a commit handler in `_writeUpdate`, follow the blob-cleanup protocol in "Blob orphan cleanup" below.
 - If you add a new top-level section to `Table.ts`, drop a `// #section: <name>` marker at its start and add a row to the section map above.
+- **The table class's published type is the explicit `TableResourceClass` / `TableResourceInstance` pair in `Table.ts`, not the inferred class.** Both are deliberately unexported: the declaration file still carries them, but the user-facing name stays `Table`. TypeScript 6.0+ cannot write a declaration for the class `makeTable()` returns (TS4094 on its `#private` members, so no `Table.d.ts`), and 5.9 leaked those members as `"__#private@…"` keys. A new public member, static or changed signature on the class must be mirrored in the interfaces: the `_TableResourceMatchesItsDeclaredTypes` guard after the class fails `tsc` naming the member, comparing exact types (`resources/typeParity.ts`) because assignability lets `any`, dropped overloads and bivariant parameters through. `#private` state and closure variables need no entry. `unitTests/types/tableClass.type-test.ts` pins the consumer side (subclass overrides, typed statics, no private keys).
 - Tests for this layer live in `../unitTests/resources/`.
 
 ---
@@ -466,6 +481,7 @@ Opt-in deflate compression for file-backed blobs (harper#2443) has three load-be
 - **Write-bearing request transactions are aborted and poisoned** (issue #1407). The monitor calls `abortDueToTimeout()`, which sets `timedOut`, forces `open = CLOSED` (so `doneReadTxn` takes the discard path instead of re-entering `commit()` via the `LINGERING` branch — which would now throw), then `abort()`s. `addWrite`/`commit` both guard on `timedOut` and throw `transactionOpenTooLongError` (503), so the in-flight request rolls back cleanly rather than the monitor silently force-committing a partial write set (atomicity violation + orphaned secondary-index entries that only a full rebuild repairs). The old behavior `commit()`d and reused the still-open transaction.
 - **`hasPendingWrites()` walks the `next` chain.** Writes to a second database live on `transaction.next` (see `txnForContext`), so a transaction that reads database A (head, tracked via its read snapshot, empty `writes`) and writes database B (`next`) is still write-bearing. Without the walk the head looks read-only and the monitor's force-commit path would cascade-commit B. `abortDueToTimeout()` poisons + aborts the whole chain.
 - **Read-only, `sourceApply`, and `isReplay` transactions keep the prior force-commit behavior.** Read-only long transactions (large scans/exports) have no atomicity/index risk and must not have their ongoing reads poisoned. Canonical-source applies (replication peer / external caching source) and crash-recovery replay have no resubscribe/resume path: aborting a write would drop it while the resume cursor advances past it — a permanent divergence (harper-pro#348). `sourceApply` is propagated down the `next` chain in `txnForContext`, so gating on the head suffices. (Replay is additionally synchronous, so the async monitor can't fire mid-replay anyway.)
+- **The owner's commit waits for the monitor's force-commit.** That commit claims every staged write, marks the transaction `CLOSED`, and detaches its handle, so the owner's later `commit()` finds nothing to do. The monitor therefore stores the promise it got back as `monitorCommit`: `commit()` chains on it and the monitor clears it on success. A failure is kept until the owner's final (`doneWriting`) commit rejects with it and releases the context, since the monitor itself only logs it. That release is deliberately not `abort()`: a multi-store commit can fail after its head store landed, and `abort()`'s blob cleanup would unlink files the head's audit entries still reference. A landed store always finishes its own bookkeeping (writes cleared, record locks released) before a chained store's failure surfaces, including a synchronous throw from `next.commit()`.
 
 - **A transaction parked in its commit phase is spared, not poisoned** (issue #2062). `commit()` sets `committing` around its pre-commit await (the `before`/`beforeIntermediate` completions — in practice a blob's durable file write) and the monitor logs instead of aborting while it is set. The limit polices an _application_ holding a transaction open with an unfinished write set; once `commit()` is entered the write set is sealed and the caller is awaiting the commit, so the time is core's own I/O, and a multi-tens-of-MB deploy payload legitimately outruns the limit. Poisoning there was actively destructive: `abort()` cleared the write set and unlinked the write's pre-saved blobs, and the resumed commit then found nothing to write and resolved as **success** — the caller was told its write landed, and was left holding a blob whose file was gone but whose `fileId` was still set, so its next `put` silently minted a reference to a destroyed file (the deploy-payload case: `Blob file not found` on the peer, unrecoverably). The grace is bounded — `COMMIT_PHASE_GRACE` over-limit ticks, ~10 min at the 30s default, since sparing re-arms `timeout` — because the transaction still pins a read snapshot; a source that stalls rather than finishing falls through to the normal abort. `sourceApply`/`isReplay` are spared without a bound: they may be neither aborted (harper-pro#348) nor force-committed mid-write (that would durably commit a replica record whose blob file is still being written), and their blob sources are bounded by the receive-side idle watchdog instead.
 - **Resuming from that await re-checks that the transaction is still alive.** `timedOut` (monitor poison, including via the `next` chain) throws `transactionOpenTooLongError`; a write set cleared with the handle released — a plain `abort()` in the same window — throws `Transaction was aborted while its commit was waiting on pre-commit work`. Without both, either path resolves as a phantom commit. `LMDBTransaction.commit` carries the same pair around its own `before` phase.
@@ -692,12 +708,13 @@ The additive-only rule above repairs the _consumer_ of a partial peer snapshot;
 
 ## Audit-store `'committed'` notification batching (`transactionBroadcast.ts`)
 
-The cross-thread subscription path (default `crossThreads`) drives every `Table.subscribe()` consumer. When the database's audit store emits `'committed'`, we walk the audit log via a reusable iterator and dispatch matching records to subscribers. Three properties of this path are easy to break and worth knowing about before changing it:
+The cross-thread subscription path (default `crossThreads`) drives every `Table.subscribe()` consumer. When the database's audit store emits `'committed'`, we walk the audit log via a reusable iterator and dispatch matching records to subscribers. These properties of this path are easy to break and worth knowing about before changing it:
 
 - **`databaseSubscriptions.activeCount`** is the count of live `Subscription` instances on a database. It is incremented at the end of `addSubscription` (after the Subscription is created, so the `scope: 'full-database'` early-return path correctly skips counting) and decremented in `Subscription.end()`. `notifyFromTransactionData` short-circuits when this is zero — the reusable rocksdb iterator stays put and resumes from its position the next time a subscriber arrives. Without this short-circuit, an idle database with no subscribers still pays the audit-log iteration cost on every commit during replication backlog catch-up.
 - **`notifyScheduled` + `setImmediate`** in the `'committed'` listener defers the iteration off the commit microtask. Multiple `'committed'` events that land in the same event-loop turn collapse into one notify pass. `notifyScheduled` stays set for the entire drain — including across yield-and-resume turns — so a re-entry from a new `'committed'` event cannot spawn a second concurrent notify on the same iterator.
 - **Batched yielding** in `notifyFromTransactionData` (`NOTIFY_BATCH_SIZE`) is gated by `allowYield`. The `'committed'` path passes `allowYield = true`; the `listenToCommits` (same-thread `aftercommit`) path does not, because that path holds an inter-thread `'thread-local-writes'` lock that must not span event-loop turns. `subscribersWithTxns` is carried across yields via `subscriptions.pendingTxnSubscribers` so the `end_txn` signal fires exactly once when the iterator truly drains. When `activeCount` drops to zero mid-yield, the next continuation drops the carry-over to avoid invoking ended subscribers' listeners.
 - **The ancestor key walk must strictly shrink.** `notifyFromTransactionData` notifies a changed key and then each `/`-delimited ancestor (`a/b/c` → `a/b/` → `a/` → the `null` root). It stops when the computed parent equals the current key, because a key rooted at `/` otherwise yields `/` as its own parent forever, and this loop is synchronous inside the notify pass with the batch yield outside it, so a single non-terminating walk seizes every worker holding a subscription on the table (harper#2687). Any change to the parent computation must keep a `/`, `/foo`, or `//x` key terminating in `unitTests/resources/transactionBroadcastKeyWalk.test.js`.
+- **Ending a subscription never reshapes a subscriber array a delivery loop is walking.** Listeners run synchronously inside the fan-out and can end their own or any other subscription there: a throwing `rowFilter`/`eventFilter` closes one through `failSubscription`, and a `'data'` listener can call `end()`. Splicing in place shifted the next subscriber past the loop, which then silently missed that record (harper#2771). `Subscription.end()` therefore marks the subscription ended at once — it nulls `subscriptions`, the liveness signal `Table.subscribe` also reads, and decrements `activeCount` — but when its key's array is being walked it only sets the array's `hasEnded`. Each array counts the loops walking it in `traversals`, and the loop that brings the count back to zero compacts the ended entries out, detaching an emptied key and table as `end()` would. Outside a walk, `end()` removes the subscription immediately. Each loop walks only the array's length at its start, so a subscription added to a key during that key's delivery starts with the next record. The `reload` walk visits at most as many keys as the table had when it started (a key added during the walk can take the place of one that left). Without both bounds, a listener that ends and re-subscribes extends the loop forever. The per-key, `reload` and `end_txn` loops all skip a subscription whose `subscriptions` is null. A new loop over these arrays needs the same count, bound and check (`unitTests/resources/transactionBroadcastEndDuringDelivery.test.js`).
 
 ## Audit-entry removal loops must track every `removeAuditEntry()`/`removeEntry()` promise
 

package/resources/DatabaseTransaction.ts

@@ -737,6 +737,9 @@ export class DatabaseTransaction implements Transaction {
 	// open-transaction limit. Once poisoned, any further addWrite/commit throws transactionOpenTooLongError
 	// so the request rolls back cleanly instead of silently committing a partial write set (issue #1407).
 	declare timedOut?: boolean;
+	// The monitor's force-commit, which the owner's commit joins (resources/DESIGN.md). Kept after a failure
+	// until a final commit reports it: the monitor only logs it.
+	declare monitorCommit?: Promise<CommitResolution>;
 	// Set once the retained read handle's write intents have been released (see commit()'s
 	// outstanding-iterators branch), so a retry round cannot re-fire the release.
 	declare writesAbandoned?: boolean;
@@ -1420,6 +1423,19 @@ export class DatabaseTransaction implements Transaction {
 	 */
 	commit(options: CommitOptions = {}): MaybePromise<CommitResolution> {
 		if (this.timedOut) throw transactionOpenTooLongError();
+		if (this.monitorCommit && !options.transaction) {
+			return this.monitorCommit.then(
+				() => this.commit(options),
+				(error) => {
+					// The failed commit ran its terminal cleanup, but as a non-final commit it kept the context.
+					if (options.doneWriting) {
+						this.monitorCommit = undefined;
+						this.releaseContext(true);
+					}
+					throw error;
+				}
+			);
+		}
 		// reused across retries — the native layer resets it in place (fresh snapshot) on IsBusy/TryAgain —
 		// but reassigned to a fresh replay transaction when outstanding read iterators retain this.transaction
 		let transaction = options.transaction ?? this.transaction;
@@ -1669,9 +1685,15 @@ export class DatabaseTransaction implements Transaction {
 							if (this.next) {
 								// never forward options.transaction (a retry/replay round's HEAD-store handle) to
 								// the next store — it must commit its own writes through its own transaction
-								completions.push(
-									this.next.commit(options.transaction ? { ...options, transaction: undefined } : options)
-								);
+								let nextCommit: MaybePromise<CommitResolution>;
+								try {
+									nextCommit = this.next.commit(options.transaction ? { ...options, transaction: undefined } : options);
+								} catch (error) {
+									// This store has landed; its bookkeeping below must run before the failure surfaces.
+									nextCommit = Promise.reject(error);
+									nextCommit.catch(() => {}); // still rejects Promise.all, even if bookkeeping throws first
+								}
+								completions.push(nextCommit);
 							}
 							if (options?.flush) {
 								completions.push(this.writes[0].store.flushed);
@@ -2483,15 +2505,23 @@ function startMonitoringTxns() {
 					// Read-only long transaction (no atomicity/index risk — e.g. a large scan or export), or a
 					// canonical-source apply/replay that must never drop a write: preserve the prior behavior of
 					// committing to close out the snapshot without poisoning the transaction.
+					let result: MaybePromise<CommitResolution>;
 					try {
-						const result = txn.commit();
-						if ((result as any)?.then) {
-							(result as any).catch((error) => {
-								harperLogger.debug?.(`Error committing timed out transaction: ${error.message}`);
-							});
-						}
+						result = txn.commit();
 					} catch (error) {
-						harperLogger.debug?.(`Error committing timed out transaction: ${error.message}`);
+						result = Promise.reject(error);
+					}
+					if ((result as any)?.then) {
+						const monitorCommit = result as Promise<CommitResolution>;
+						txn.monitorCommit = monitorCommit;
+						monitorCommit.then(
+							() => {
+								if (txn.monitorCommit === monitorCommit) txn.monitorCommit = undefined;
+							},
+							(error) => {
+								harperLogger.debug?.(`Error committing timed out transaction: ${error.message}`);
+							}
+						);
 					}
 					txn.timeout = Math.max(txnExpiration, txn.timeoutBudget ?? 0);
 				}

package/resources/FULL_TEXT.md

@@ -0,0 +1,97 @@
+# Full-text search
+
+Declare a `FullText` field to name an index over stored text sources. Search that field with a full-text comparator; read the original source fields and optional search metadata in the results.
+
+## Declare an index
+
+```graphql
+type Product @table(audit: true) @export {
+	id: ID @primaryKey
+	title: String
+	description: String
+	tags: [String]
+	catalogSearch: FullText
+		@fullText(
+			fields: [{ name: "title", weight: 3, highlight: true }, { name: "description" }, { name: "tags" }]
+			highlighting: { maxFragments: 2, fragmentLength: 120 }
+		)
+}
+```
+
+The field name, `catalogSearch`, identifies the index. `@fullText` accepts no `name` argument and is supported only on a `FullText` field. Keep the source order stable: reordering the `fields` entries is treated as a storage configuration change and rebuilds the index.
+
+Sources may be stored `String`, `[String]`, or `Blob` fields. A Blob source requires `mediaType: "text/plain"` in its `fields` entry. Computed fields, relationships, and other full-text fields cannot be sources. Weights must be positive finite numbers and default to `1`.
+
+The supported analyzer is `english@2`. `stopWords`, `positions`, and `surfaceTerms` default to `true`. Phrase queries require positions; prefix and fuzzy-prefix queries require surface terms. Highlighting also requires surface terms, a `highlighting` configuration, and at least one source with `highlight: true`.
+
+## Search
+
+From an authenticated Resource handler, request table permission checks and pass its context through to `Product.search()`:
+
+```javascript
+return Product.search(
+	{
+		checkPermission: true,
+		conditions: [
+			{
+				attribute: 'catalogSearch',
+				comparator: 'matches',
+				value: 'trail shoes',
+				maxIndexLagMilliseconds: 0,
+				waitForIndexMilliseconds: 30_000,
+			},
+		],
+		select: ['id', 'title', '$score', '$highlights'],
+		limit: 20,
+	},
+	this.getContext()
+);
+```
+
+Selecting `$highlights` requests highlighting; a structured condition may also set `includeHighlights: true`. `$score` contains the relevance score. Highlights are grouped by source field and value, with character spans and optional fragments. Only sources configured with `highlight: true` contribute highlights.
+
+A REST search uses the exported table path:
+
+```text
+GET /Product/?catalogSearch=matches=trail%20shoes&select(id,title,$score,$highlights)&limit(20)
+```
+
+| Comparator             | Query mode      |
+| ---------------------- | --------------- |
+| `matches`              | Any query term  |
+| `matches_all`          | All query terms |
+| `matches_phrase`       | Phrase          |
+| `matches_prefix`       | Prefix          |
+| `matches_fuzzy`        | Fuzzy           |
+| `matches_fuzzy_prefix` | Fuzzy prefix    |
+
+Use `fields: ['title']` on a structured condition to search a subset of an index's sources. Combine ordinary record filters with full-text conditions using `and`. Full-text Boolean groups must use one index; an `or` group cannot mix full-text and ordinary record conditions. Negated full-text conditions require at least one positive full-text condition.
+
+Full-text predicates must name an index directly on the queried table; relationship and nested-path full-text predicates are unsupported.
+
+Indexes follow committed record changes asynchronously. `maxIndexLagMilliseconds` defaults to `3000`; set it to `0` to require current coverage. `waitForIndexMilliseconds` defaults to `0` and may be set as high as `30000` to wait for writes committed before the search begins. A query can fail while its index is unavailable, rebuilding, or behind the requested coverage. A non-waiting REST response includes `Harper-Index-Coverage`. Waiting for coverage does not promise a global snapshot across concurrent record changes.
+
+## Fields, permissions, and results
+
+`FullText` is declaration-only: `catalogSearch` has no stored or selectable record value. Records written under this schema and record input/output schemas omit it. Selecting it, sorting on it, comparing it as an ordinary scalar, or writing it returns an error. New-write protection also applies to unsealed tables and persists while the index is unavailable. Use `$score` and `$highlights` for search results.
+
+A read-through source must also omit the declaration-only name. A source response that includes it fails with a 502 response and is not returned, cached, indexed, or audited.
+On HTTP-sourced caching tables, avoid index names that collide with response wrapper fields: `data`, `headers`, `body`, and `status`.
+
+Use the nullable `FullText` type exactly. Lists, non-null forms, and additional directives such as `@computed`, `@indexed`, or `@allow` are rejected. `FullText` without `@fullText` is also invalid.
+
+Authorization uses the searched source fields. A caller must be allowed to read every source searched by the condition; specifying `fields` narrows that set. Configure permissions on sources such as `title`, not on `catalogSearch`. A permission entry for the virtual index name does not grant access to its sources. Normal table authorization and application row filters still apply. Internal calls without a user or explicit permissions are trusted. Custom endpoints must preserve the authenticated context and set `checkPermission: true` when delegating to the table; context propagation alone does not request its table permission check.
+
+`describe_table` exposes the declaration under `full_text_indexes`, including its name, source configuration, supported query modes, and readiness. Source lists are filtered by the caller's read permissions. The declaration is absent from the ordinary `attributes` list and record schemas, including generated OpenAPI and MCP schemas.
+
+Weight and highlighting changes preserve the physical index and refresh query readers. Changing source membership, order, or media type, or changing the analyzer, stop words, synonyms, positions, or surface terms requires rebuilding. Renaming the index creates a new identity.
+
+## Native package and limits
+
+Harper pins `@harperfast/fulltext` to **0.3.0** and validates the native runtime capabilities before activation. Full-text activation requires RocksDB and an audited table. Declare new schema tables with `@table(audit: true)` and keep audit logging enabled while an index is declared. LMDB is rejected. A missing or incompatible native package prevents activation.
+
+Earlier beta declarations and indexes are unsupported. This field-only API does not provide a compatibility or upgrade path for them.
+
+Native queries have finite result windows and execution budgets. Reduce the requested offset/limit or narrow the query when a window is exceeded; filtering can also exhaust the window. Prefix modes use the native autocomplete window. Highlight tracing has separate record and source-byte bounds. These are functional constraints, not catalog-scale performance guarantees.
+
+For implementation details, see the [full-text invariants in the Resource design guide](DESIGN.md#full-text-declarations-and-reader-snapshots). The schema contract lives in [schema.graphql](../schema.graphql); the compiler and generation rules are in [fullTextSchema.ts](fullTextSchema.ts).

package/resources/ResourceInterface.ts

@@ -5,6 +5,7 @@ import { IterableEventQueue } from './IterableEventQueue.ts';
 import type { Entry, RecordObject } from './RecordEncoder.ts';
 import { RequestTarget } from './RequestTarget.ts';
 import type { RecordLockOptions } from './recordLock.ts';
+import { FULL_TEXT_COMPARATORS } from './indexes/fullTextQueryProtocol.ts';
 
 export interface ResourceInterface<Record extends object = any>
 	extends Partial<RecordObject>, Pick<UpdatableRecord<Record>, 'addTo' | 'subtractFrom'> {
@@ -185,6 +186,7 @@ export const COMPARATORS = [
 	'in',
 	'less_than',
 	'less_than_equal',
+	...FULL_TEXT_COMPARATORS,
 	'ne',
 	'not_equal',
 	'starts_with',
@@ -201,7 +203,11 @@ interface TypedDirectCondition<Record extends object, Property extends keyof Rec
 	search_type?: Comparator;
 	value?: Record[Property] | Record[Property][];
 	search_value?: Record[Property] | Record[Property][];
-	/** Native HNSW coverage tolerance in milliseconds; defaults to 3000, with 0 requiring current coverage. */
+	/** Optional source-field restriction for a named full-text index. */
+	fields?: string[];
+	/** Return configured full-text match spans and snippets; disabled by default. */
+	includeHighlights?: boolean;
+	/** Native derived-index coverage tolerance in milliseconds; defaults to 3000, with 0 requiring current coverage. */
 	maxIndexLagMilliseconds?: number;
 	/** Wait for coverage of prior committed writes, up to 30,000 ms; 0 (default) does not wait. */
 	waitForIndexMilliseconds?: number;
@@ -215,7 +221,7 @@ interface TypedDirectCondition<Record extends object, Property extends keyof Rec
 	 * companion conditions and caller `vectorFilter`/`rowFilter` predicates, pushed into a filterable
 	 * custom index (HNSW) so filtering happens during traversal. Not part of the public query surface.
 	 */
-	recordFilter?: (primaryKey: Id) => boolean;
+	recordFilter?: (primaryKey: Id, entry?: unknown) => boolean;
 }
 
 interface ConditionGroup<Record extends object = any> {