@venizia/ignis-connectors 0.4.0 → 0.4.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (193) hide show
  1. package/dist/cjs/common/scope-filter.d.ts +1 -1
  2. package/dist/cjs/common/scope-filter.d.ts.map +1 -1
  3. package/dist/cjs/common/scope-filter.js +33 -7
  4. package/dist/cjs/common/scope-filter.js.map +1 -1
  5. package/dist/cjs/http/repository.d.ts +23 -23
  6. package/dist/cjs/http/repository.d.ts.map +1 -1
  7. package/dist/cjs/http/repository.js.map +1 -1
  8. package/dist/cjs/relational/core/datasources/base.d.ts.map +1 -1
  9. package/dist/cjs/relational/core/datasources/base.js +1 -1
  10. package/dist/cjs/relational/core/datasources/base.js.map +1 -1
  11. package/dist/cjs/relational/core/migrations/runner.js +3 -3
  12. package/dist/cjs/relational/core/migrations/runner.js.map +1 -1
  13. package/dist/cjs/relational/core/models/base.js +1 -1
  14. package/dist/cjs/relational/core/models/base.js.map +1 -1
  15. package/dist/cjs/relational/core/repositories/common/scope-write-guard.d.ts +50 -0
  16. package/dist/cjs/relational/core/repositories/common/scope-write-guard.d.ts.map +1 -0
  17. package/dist/cjs/relational/core/repositories/common/scope-write-guard.js +248 -0
  18. package/dist/cjs/relational/core/repositories/common/scope-write-guard.js.map +1 -0
  19. package/dist/cjs/relational/core/repositories/core/base.d.ts +35 -20
  20. package/dist/cjs/relational/core/repositories/core/base.d.ts.map +1 -1
  21. package/dist/cjs/relational/core/repositories/core/base.js +29 -4
  22. package/dist/cjs/relational/core/repositories/core/base.js.map +1 -1
  23. package/dist/cjs/relational/core/repositories/core/persistable.d.ts.map +1 -1
  24. package/dist/cjs/relational/core/repositories/core/persistable.js +6 -1
  25. package/dist/cjs/relational/core/repositories/core/persistable.js.map +1 -1
  26. package/dist/cjs/relational/core/repositories/core/readable.d.ts +17 -17
  27. package/dist/cjs/relational/core/repositories/core/readable.d.ts.map +1 -1
  28. package/dist/cjs/relational/core/repositories/core/readable.js +8 -2
  29. package/dist/cjs/relational/core/repositories/core/readable.js.map +1 -1
  30. package/dist/cjs/relational/core/repositories/core/soft-deletable.d.ts +9 -9
  31. package/dist/cjs/relational/core/repositories/core/soft-deletable.d.ts.map +1 -1
  32. package/dist/cjs/relational/core/repositories/core/soft-deletable.js.map +1 -1
  33. package/dist/cjs/relational/core/repositories/dialect/filter.d.ts +2 -2
  34. package/dist/cjs/relational/core/repositories/dialect/filter.js +6 -6
  35. package/dist/cjs/relational/core/repositories/dialect/filter.js.map +1 -1
  36. package/dist/cjs/relational/core/repositories/dialect/relations/one.d.ts.map +1 -1
  37. package/dist/cjs/relational/core/repositories/dialect/relations/one.js +7 -7
  38. package/dist/cjs/relational/core/repositories/dialect/relations/one.js.map +1 -1
  39. package/dist/cjs/relational/core/repositories/sqls/recursive-tree.d.ts +9 -0
  40. package/dist/cjs/relational/core/repositories/sqls/recursive-tree.d.ts.map +1 -1
  41. package/dist/cjs/relational/core/repositories/sqls/recursive-tree.js +17 -6
  42. package/dist/cjs/relational/core/repositories/sqls/recursive-tree.js.map +1 -1
  43. package/dist/cjs/relational/postgres/drivers/pglite.js +2 -2
  44. package/dist/cjs/relational/postgres/drivers/pglite.js.map +1 -1
  45. package/dist/cjs/relational/postgres/repositories/dialect/query.js +1 -1
  46. package/dist/cjs/relational/postgres/repositories/dialect/query.js.map +1 -1
  47. package/dist/cjs/relational/sqlite/drivers/libsql.js +2 -2
  48. package/dist/cjs/relational/sqlite/drivers/libsql.js.map +1 -1
  49. package/dist/cjs/relational/sqlite/repositories/dialect/internal/json-path.js +3 -3
  50. package/dist/cjs/relational/sqlite/repositories/dialect/internal/json-path.js.map +1 -1
  51. package/dist/cjs/search/core/connector.js +2 -2
  52. package/dist/cjs/search/core/connector.js.map +1 -1
  53. package/dist/cjs/search/core/controllers/abstract.d.ts +4 -0
  54. package/dist/cjs/search/core/controllers/abstract.d.ts.map +1 -1
  55. package/dist/cjs/search/core/controllers/abstract.js +15 -1
  56. package/dist/cjs/search/core/controllers/abstract.js.map +1 -1
  57. package/dist/cjs/search/core/controllers/factory.d.ts +14 -0
  58. package/dist/cjs/search/core/controllers/factory.d.ts.map +1 -1
  59. package/dist/cjs/search/core/controllers/factory.js +7 -1
  60. package/dist/cjs/search/core/controllers/factory.js.map +1 -1
  61. package/dist/cjs/search/core/controllers/scope.d.ts +28 -0
  62. package/dist/cjs/search/core/controllers/scope.d.ts.map +1 -0
  63. package/dist/cjs/search/core/controllers/scope.js +68 -0
  64. package/dist/cjs/search/core/controllers/scope.js.map +1 -0
  65. package/dist/cjs/search/core/datasources/base.js +2 -2
  66. package/dist/cjs/search/core/datasources/base.js.map +1 -1
  67. package/dist/cjs/search/core/models/define-search-collection.js +3 -3
  68. package/dist/cjs/search/core/models/define-search-collection.js.map +1 -1
  69. package/dist/cjs/search/core/models/zod-derivation.js +1 -1
  70. package/dist/cjs/search/core/models/zod-derivation.js.map +1 -1
  71. package/dist/cjs/search/core/repositories/common/dialect-helpers.js +1 -1
  72. package/dist/cjs/search/core/repositories/common/dialect-helpers.js.map +1 -1
  73. package/dist/cjs/search/core/repositories/core/base.js +2 -2
  74. package/dist/cjs/search/core/repositories/core/base.js.map +1 -1
  75. package/dist/cjs/search/core/repositories/core/readable.d.ts +17 -17
  76. package/dist/cjs/search/core/repositories/core/readable.d.ts.map +1 -1
  77. package/dist/cjs/search/core/repositories/core/readable.js +4 -4
  78. package/dist/cjs/search/core/repositories/core/readable.js.map +1 -1
  79. package/dist/cjs/search/meilisearch/compiler.js +4 -4
  80. package/dist/cjs/search/meilisearch/compiler.js.map +1 -1
  81. package/dist/cjs/search/meilisearch/connector.js +22 -22
  82. package/dist/cjs/search/meilisearch/connector.js.map +1 -1
  83. package/dist/cjs/search/meilisearch/internal/connector-internal.js +1 -1
  84. package/dist/cjs/search/meilisearch/internal/connector-internal.js.map +1 -1
  85. package/dist/cjs/search/meilisearch/repositories/dialect/query-dialect.js +6 -6
  86. package/dist/cjs/search/meilisearch/repositories/dialect/query-dialect.js.map +1 -1
  87. package/dist/cjs/search/typesense/compiler.js +8 -8
  88. package/dist/cjs/search/typesense/compiler.js.map +1 -1
  89. package/dist/cjs/search/typesense/connector.js +23 -23
  90. package/dist/cjs/search/typesense/connector.js.map +1 -1
  91. package/dist/cjs/search/typesense/internal/mappers.js +1 -1
  92. package/dist/cjs/search/typesense/internal/mappers.js.map +1 -1
  93. package/dist/cjs/search/typesense/internal/pagination-windows.js +3 -3
  94. package/dist/cjs/search/typesense/internal/pagination-windows.js.map +1 -1
  95. package/dist/cjs/search/typesense/repositories/dialect/query-dialect.js +7 -7
  96. package/dist/cjs/search/typesense/repositories/dialect/query-dialect.js.map +1 -1
  97. package/dist/esm/common/scope-filter.d.ts +1 -1
  98. package/dist/esm/common/scope-filter.d.ts.map +1 -1
  99. package/dist/esm/common/scope-filter.js +34 -8
  100. package/dist/esm/common/scope-filter.js.map +1 -1
  101. package/dist/esm/http/repository.d.ts +23 -23
  102. package/dist/esm/http/repository.d.ts.map +1 -1
  103. package/dist/esm/http/repository.js.map +1 -1
  104. package/dist/esm/relational/core/datasources/base.d.ts.map +1 -1
  105. package/dist/esm/relational/core/datasources/base.js +1 -1
  106. package/dist/esm/relational/core/datasources/base.js.map +1 -1
  107. package/dist/esm/relational/core/migrations/runner.js +3 -3
  108. package/dist/esm/relational/core/migrations/runner.js.map +1 -1
  109. package/dist/esm/relational/core/models/base.js +1 -1
  110. package/dist/esm/relational/core/models/base.js.map +1 -1
  111. package/dist/esm/relational/core/repositories/common/scope-write-guard.d.ts +50 -0
  112. package/dist/esm/relational/core/repositories/common/scope-write-guard.d.ts.map +1 -0
  113. package/dist/esm/relational/core/repositories/common/scope-write-guard.js +244 -0
  114. package/dist/esm/relational/core/repositories/common/scope-write-guard.js.map +1 -0
  115. package/dist/esm/relational/core/repositories/core/base.d.ts +35 -20
  116. package/dist/esm/relational/core/repositories/core/base.d.ts.map +1 -1
  117. package/dist/esm/relational/core/repositories/core/base.js +29 -4
  118. package/dist/esm/relational/core/repositories/core/base.js.map +1 -1
  119. package/dist/esm/relational/core/repositories/core/persistable.d.ts.map +1 -1
  120. package/dist/esm/relational/core/repositories/core/persistable.js +6 -1
  121. package/dist/esm/relational/core/repositories/core/persistable.js.map +1 -1
  122. package/dist/esm/relational/core/repositories/core/readable.d.ts +17 -17
  123. package/dist/esm/relational/core/repositories/core/readable.d.ts.map +1 -1
  124. package/dist/esm/relational/core/repositories/core/readable.js +8 -2
  125. package/dist/esm/relational/core/repositories/core/readable.js.map +1 -1
  126. package/dist/esm/relational/core/repositories/core/soft-deletable.d.ts +9 -9
  127. package/dist/esm/relational/core/repositories/core/soft-deletable.d.ts.map +1 -1
  128. package/dist/esm/relational/core/repositories/core/soft-deletable.js.map +1 -1
  129. package/dist/esm/relational/core/repositories/dialect/filter.d.ts +2 -2
  130. package/dist/esm/relational/core/repositories/dialect/filter.js +6 -6
  131. package/dist/esm/relational/core/repositories/dialect/filter.js.map +1 -1
  132. package/dist/esm/relational/core/repositories/dialect/relations/one.d.ts.map +1 -1
  133. package/dist/esm/relational/core/repositories/dialect/relations/one.js +7 -7
  134. package/dist/esm/relational/core/repositories/dialect/relations/one.js.map +1 -1
  135. package/dist/esm/relational/core/repositories/sqls/recursive-tree.d.ts +9 -0
  136. package/dist/esm/relational/core/repositories/sqls/recursive-tree.d.ts.map +1 -1
  137. package/dist/esm/relational/core/repositories/sqls/recursive-tree.js +18 -7
  138. package/dist/esm/relational/core/repositories/sqls/recursive-tree.js.map +1 -1
  139. package/dist/esm/relational/postgres/drivers/pglite.js +2 -2
  140. package/dist/esm/relational/postgres/drivers/pglite.js.map +1 -1
  141. package/dist/esm/relational/postgres/repositories/dialect/query.js +1 -1
  142. package/dist/esm/relational/postgres/repositories/dialect/query.js.map +1 -1
  143. package/dist/esm/relational/sqlite/drivers/libsql.js +2 -2
  144. package/dist/esm/relational/sqlite/drivers/libsql.js.map +1 -1
  145. package/dist/esm/relational/sqlite/repositories/dialect/internal/json-path.js +3 -3
  146. package/dist/esm/relational/sqlite/repositories/dialect/internal/json-path.js.map +1 -1
  147. package/dist/esm/search/core/connector.js +2 -2
  148. package/dist/esm/search/core/connector.js.map +1 -1
  149. package/dist/esm/search/core/controllers/abstract.d.ts +4 -0
  150. package/dist/esm/search/core/controllers/abstract.d.ts.map +1 -1
  151. package/dist/esm/search/core/controllers/abstract.js +15 -1
  152. package/dist/esm/search/core/controllers/abstract.js.map +1 -1
  153. package/dist/esm/search/core/controllers/factory.d.ts +14 -0
  154. package/dist/esm/search/core/controllers/factory.d.ts.map +1 -1
  155. package/dist/esm/search/core/controllers/factory.js +7 -1
  156. package/dist/esm/search/core/controllers/factory.js.map +1 -1
  157. package/dist/esm/search/core/controllers/scope.d.ts +28 -0
  158. package/dist/esm/search/core/controllers/scope.d.ts.map +1 -0
  159. package/dist/esm/search/core/controllers/scope.js +64 -0
  160. package/dist/esm/search/core/controllers/scope.js.map +1 -0
  161. package/dist/esm/search/core/datasources/base.js +2 -2
  162. package/dist/esm/search/core/datasources/base.js.map +1 -1
  163. package/dist/esm/search/core/models/define-search-collection.js +3 -3
  164. package/dist/esm/search/core/models/define-search-collection.js.map +1 -1
  165. package/dist/esm/search/core/models/zod-derivation.js +1 -1
  166. package/dist/esm/search/core/models/zod-derivation.js.map +1 -1
  167. package/dist/esm/search/core/repositories/common/dialect-helpers.js +1 -1
  168. package/dist/esm/search/core/repositories/common/dialect-helpers.js.map +1 -1
  169. package/dist/esm/search/core/repositories/core/base.js +2 -2
  170. package/dist/esm/search/core/repositories/core/base.js.map +1 -1
  171. package/dist/esm/search/core/repositories/core/readable.d.ts +17 -17
  172. package/dist/esm/search/core/repositories/core/readable.d.ts.map +1 -1
  173. package/dist/esm/search/core/repositories/core/readable.js +4 -4
  174. package/dist/esm/search/core/repositories/core/readable.js.map +1 -1
  175. package/dist/esm/search/meilisearch/compiler.js +4 -4
  176. package/dist/esm/search/meilisearch/compiler.js.map +1 -1
  177. package/dist/esm/search/meilisearch/connector.js +22 -22
  178. package/dist/esm/search/meilisearch/connector.js.map +1 -1
  179. package/dist/esm/search/meilisearch/internal/connector-internal.js +1 -1
  180. package/dist/esm/search/meilisearch/internal/connector-internal.js.map +1 -1
  181. package/dist/esm/search/meilisearch/repositories/dialect/query-dialect.js +6 -6
  182. package/dist/esm/search/meilisearch/repositories/dialect/query-dialect.js.map +1 -1
  183. package/dist/esm/search/typesense/compiler.js +8 -8
  184. package/dist/esm/search/typesense/compiler.js.map +1 -1
  185. package/dist/esm/search/typesense/connector.js +23 -23
  186. package/dist/esm/search/typesense/connector.js.map +1 -1
  187. package/dist/esm/search/typesense/internal/mappers.js +1 -1
  188. package/dist/esm/search/typesense/internal/mappers.js.map +1 -1
  189. package/dist/esm/search/typesense/internal/pagination-windows.js +3 -3
  190. package/dist/esm/search/typesense/internal/pagination-windows.js.map +1 -1
  191. package/dist/esm/search/typesense/repositories/dialect/query-dialect.js +7 -7
  192. package/dist/esm/search/typesense/repositories/dialect/query-dialect.js.map +1 -1
  193. package/package.json +7 -7
@@ -38,7 +38,7 @@ export const mergeWindowedResults = (results) => {
38
38
  found: first.found,
39
39
  // AND-folded: the total is only exact if EVERY window ran to completion. One cut-off window
40
40
  // makes the merged count an estimate, and saying otherwise would relaunch the bug above.
41
- isFoundExact: results.every(result => result.isFoundExact),
41
+ isFoundExact: results.every((result) => result.isFoundExact),
42
42
  };
43
43
  if (first.outOf !== undefined) {
44
44
  merged.outOf = first.outOf;
@@ -46,7 +46,7 @@ export const mergeWindowedResults = (results) => {
46
46
  // MAX, not sum: this field is read as latency, and the windows travel in ONE round trip. Summing
47
47
  // would make a windowed query graph at several times its actual wall-clock.
48
48
  const timings = results
49
- .map(result => result.searchTimeMs)
49
+ .map((result) => result.searchTimeMs)
50
50
  .filter((value) => typeof value === 'number');
51
51
  if (timings.length > 0) {
52
52
  merged.searchTimeMs = Math.max(...timings);
@@ -54,7 +54,7 @@ export const mergeWindowedResults = (results) => {
54
54
  if (first.facetCounts) {
55
55
  merged.facetCounts = first.facetCounts;
56
56
  }
57
- const hits = results.flatMap(result => result.hits ?? []);
57
+ const hits = results.flatMap((result) => result.hits ?? []);
58
58
  if (hits.length > 0) {
59
59
  merged.hits = hits;
60
60
  }
@@ -1 +1 @@
1
- {"version":3,"file":"pagination-windows.js","sourceRoot":"","sources":["../../../../../src/search/typesense/internal/pagination-windows.ts"],"names":[],"mappings":"AAEA,oLAAoL;AACpL,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAErC,+KAA+K;AAC/K,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC;AAQ3C;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,IAAuC,EAAmB,EAAE;IAC1F,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IAE/B,IAAI,KAAK,IAAI,iBAAiB,EAAE,CAAC;QAC/B,OAAO,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,iBAAiB,EAAE,CAAC;QAC9D,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9F,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,OAAmC,EACT,EAAE;IAC5B,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;IAExB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAA6B;QACvC,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,4FAA4F;QAC5F,yFAAyF;QACzF,YAAY,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC;KAC3D,CAAC;IAEF,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC7B,CAAC;IAED,iGAAiG;IACjG,4EAA4E;IAC5E,MAAM,OAAO,GAAG,OAAO;SACpB,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC;SAClC,MAAM,CAAC,CAAC,KAAK,EAAmB,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC;IACjE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QACtB,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;IACzC,CAAC;IAED,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAC1D,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,MAA+B,EAA6B,EAAE;IAC9F,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChF,MAAM,OAAO,GAAG,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxF,MAAM,cAAc,GAAG,KAAK,IAAI,OAAO,CAAC;IAExC,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,MAAM,GAAG,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACnF,MAAM,IAAI,GAAG,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7E,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzF,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC;AAC5D,CAAC,CAAC;AAEF,oKAAoK;AACpK,MAAM,CAAC,MAAM,wBAAwB,GAAG,GAAY,EAAE;IACpD,MAAM,QAAQ,GAA4B,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAC1E,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACvB,QAAQ,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;IAC/B,QAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC;IAChC,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC","sourcesContent":["import type { ISearchResult } from '@/search/core';\n\n/** `--max-per-page`: Typesense refuses a page larger than this, so a bigger caller limit is served as consecutive windows of one multi_search call rather than as several calls. */\nexport const MAX_HITS_PER_PAGE = 250;\n\n/** `limit_multi_searches`: entries permitted in ONE multi_search call, which bounds windowing at 50 x 250 = 12,500 hits. Exceeding it is refused, never silently truncated. */\nexport const MAX_MULTI_SEARCH_ENTRIES = 50;\n\n/** One window of a split page: an entry differs from its siblings only in where it starts. */\nexport interface ISearchWindow {\n offset: number;\n limit: number;\n}\n\n/**\n * Splits a requested page into windows the engine will accept.\n *\n * Windows are expressed as `offset`/`limit` rather than `page`/`per_page` because only offset\n * arithmetic can start a window anywhere - which is also what lets a caller's `skip` land off a\n * page boundary. Exactly one pagination pair is ever sent: Typesense documents `offset`/`limit`\n * and `page`/`per_page` as alternatives and does not state which wins if both appear, so the\n * question is designed out rather than answered.\n */\nexport const toSearchWindows = (opts: { offset: number; limit: number }): ISearchWindow[] => {\n const { offset, limit } = opts;\n\n if (limit <= MAX_HITS_PER_PAGE) {\n return [{ offset, limit }];\n }\n\n const windows: ISearchWindow[] = [];\n for (let start = 0; start < limit; start += MAX_HITS_PER_PAGE) {\n windows.push({ offset: offset + start, limit: Math.min(MAX_HITS_PER_PAGE, limit - start) });\n }\n\n return windows;\n};\n\n/**\n * Folds windowed responses into the single result the caller asked for.\n *\n * `found`/`outOf` come from the first window because every window ran the same filter and reports\n * the same total. `facetCounts` likewise: facets are computed over the whole result set, not the\n * page, so concatenating them would multiply every count by the window count.\n */\nexport const mergeWindowedResults = <TDocument extends object>(\n results: ISearchResult<TDocument>[],\n): ISearchResult<TDocument> => {\n const [first] = results;\n\n if (results.length === 1) {\n return first;\n }\n\n const merged: ISearchResult<TDocument> = {\n found: first.found,\n // AND-folded: the total is only exact if EVERY window ran to completion. One cut-off window\n // makes the merged count an estimate, and saying otherwise would relaunch the bug above.\n isFoundExact: results.every(result => result.isFoundExact),\n };\n\n if (first.outOf !== undefined) {\n merged.outOf = first.outOf;\n }\n\n // MAX, not sum: this field is read as latency, and the windows travel in ONE round trip. Summing\n // would make a windowed query graph at several times its actual wall-clock.\n const timings = results\n .map(result => result.searchTimeMs)\n .filter((value): value is number => typeof value === 'number');\n if (timings.length > 0) {\n merged.searchTimeMs = Math.max(...timings);\n }\n\n if (first.facetCounts) {\n merged.facetCounts = first.facetCounts;\n }\n\n const hits = results.flatMap(result => result.hits ?? []);\n if (hits.length > 0) {\n merged.hits = hits;\n }\n\n return merged;\n};\n\n/**\n * Reads the requested page out of engine-native params, whichever pair the caller used.\n *\n * `mode: 'raw'` hands these params through untouched, so both spellings have to be understood\n * here; the caller is never asked to normalize.\n */\nexport const readRequestedPage = (params: Record<string, unknown>): ISearchWindow | undefined => {\n const limit = typeof params['limit'] === 'number' ? params['limit'] : undefined;\n const perPage = typeof params['per_page'] === 'number' ? params['per_page'] : undefined;\n const effectiveLimit = limit ?? perPage;\n\n if (effectiveLimit === undefined) {\n return undefined;\n }\n\n const offset = typeof params['offset'] === 'number' ? params['offset'] : undefined;\n const page = typeof params['page'] === 'number' ? params['page'] : undefined;\n const effectiveOffset = offset ?? (page !== undefined ? (page - 1) * effectiveLimit : 0);\n\n return { offset: effectiveOffset, limit: effectiveLimit };\n};\n\n/** Empty TSearchResponse shape returned when search() tolerates a missing collection; built via bracket assignment so no snake_case identifier is declared here. */\nexport const buildEmptySearchResponse = (): unknown => {\n const response: Record<string, unknown> = { found: 0, page: 1, hits: [] };\n response['out_of'] = 0;\n response['search_time_ms'] = 0;\n response['request_params'] = {};\n return response;\n};\n"]}
1
+ {"version":3,"file":"pagination-windows.js","sourceRoot":"","sources":["../../../../../src/search/typesense/internal/pagination-windows.ts"],"names":[],"mappings":"AAEA,oLAAoL;AACpL,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAErC,+KAA+K;AAC/K,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC;AAQ3C;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,IAAuC,EAAmB,EAAE;IAC1F,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IAE/B,IAAI,KAAK,IAAI,iBAAiB,EAAE,CAAC;QAC/B,OAAO,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,iBAAiB,EAAE,CAAC;QAC9D,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9F,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,OAAmC,EACT,EAAE;IAC5B,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;IAExB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAA6B;QACvC,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,4FAA4F;QAC5F,yFAAyF;QACzF,YAAY,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC;KAC7D,CAAC;IAEF,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC7B,CAAC;IAED,iGAAiG;IACjG,4EAA4E;IAC5E,MAAM,OAAO,GAAG,OAAO;SACpB,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC;SACpC,MAAM,CAAC,CAAC,KAAK,EAAmB,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC;IACjE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QACtB,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;IACzC,CAAC;IAED,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAC5D,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,MAA+B,EAA6B,EAAE;IAC9F,MAAM,KAAK,GAAG,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChF,MAAM,OAAO,GAAG,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxF,MAAM,cAAc,GAAG,KAAK,IAAI,OAAO,CAAC;IAExC,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,MAAM,GAAG,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACnF,MAAM,IAAI,GAAG,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7E,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzF,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC;AAC5D,CAAC,CAAC;AAEF,oKAAoK;AACpK,MAAM,CAAC,MAAM,wBAAwB,GAAG,GAAY,EAAE;IACpD,MAAM,QAAQ,GAA4B,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IAC1E,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACvB,QAAQ,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;IAC/B,QAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC;IAChC,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC","sourcesContent":["import type { ISearchResult } from '@/search/core';\n\n/** `--max-per-page`: Typesense refuses a page larger than this, so a bigger caller limit is served as consecutive windows of one multi_search call rather than as several calls. */\nexport const MAX_HITS_PER_PAGE = 250;\n\n/** `limit_multi_searches`: entries permitted in ONE multi_search call, which bounds windowing at 50 x 250 = 12,500 hits. Exceeding it is refused, never silently truncated. */\nexport const MAX_MULTI_SEARCH_ENTRIES = 50;\n\n/** One window of a split page: an entry differs from its siblings only in where it starts. */\nexport interface ISearchWindow {\n offset: number;\n limit: number;\n}\n\n/**\n * Splits a requested page into windows the engine will accept.\n *\n * Windows are expressed as `offset`/`limit` rather than `page`/`per_page` because only offset\n * arithmetic can start a window anywhere - which is also what lets a caller's `skip` land off a\n * page boundary. Exactly one pagination pair is ever sent: Typesense documents `offset`/`limit`\n * and `page`/`per_page` as alternatives and does not state which wins if both appear, so the\n * question is designed out rather than answered.\n */\nexport const toSearchWindows = (opts: { offset: number; limit: number }): ISearchWindow[] => {\n const { offset, limit } = opts;\n\n if (limit <= MAX_HITS_PER_PAGE) {\n return [{ offset, limit }];\n }\n\n const windows: ISearchWindow[] = [];\n for (let start = 0; start < limit; start += MAX_HITS_PER_PAGE) {\n windows.push({ offset: offset + start, limit: Math.min(MAX_HITS_PER_PAGE, limit - start) });\n }\n\n return windows;\n};\n\n/**\n * Folds windowed responses into the single result the caller asked for.\n *\n * `found`/`outOf` come from the first window because every window ran the same filter and reports\n * the same total. `facetCounts` likewise: facets are computed over the whole result set, not the\n * page, so concatenating them would multiply every count by the window count.\n */\nexport const mergeWindowedResults = <TDocument extends object>(\n results: ISearchResult<TDocument>[],\n): ISearchResult<TDocument> => {\n const [first] = results;\n\n if (results.length === 1) {\n return first;\n }\n\n const merged: ISearchResult<TDocument> = {\n found: first.found,\n // AND-folded: the total is only exact if EVERY window ran to completion. One cut-off window\n // makes the merged count an estimate, and saying otherwise would relaunch the bug above.\n isFoundExact: results.every((result) => result.isFoundExact),\n };\n\n if (first.outOf !== undefined) {\n merged.outOf = first.outOf;\n }\n\n // MAX, not sum: this field is read as latency, and the windows travel in ONE round trip. Summing\n // would make a windowed query graph at several times its actual wall-clock.\n const timings = results\n .map((result) => result.searchTimeMs)\n .filter((value): value is number => typeof value === 'number');\n if (timings.length > 0) {\n merged.searchTimeMs = Math.max(...timings);\n }\n\n if (first.facetCounts) {\n merged.facetCounts = first.facetCounts;\n }\n\n const hits = results.flatMap((result) => result.hits ?? []);\n if (hits.length > 0) {\n merged.hits = hits;\n }\n\n return merged;\n};\n\n/**\n * Reads the requested page out of engine-native params, whichever pair the caller used.\n *\n * `mode: 'raw'` hands these params through untouched, so both spellings have to be understood\n * here; the caller is never asked to normalize.\n */\nexport const readRequestedPage = (params: Record<string, unknown>): ISearchWindow | undefined => {\n const limit = typeof params['limit'] === 'number' ? params['limit'] : undefined;\n const perPage = typeof params['per_page'] === 'number' ? params['per_page'] : undefined;\n const effectiveLimit = limit ?? perPage;\n\n if (effectiveLimit === undefined) {\n return undefined;\n }\n\n const offset = typeof params['offset'] === 'number' ? params['offset'] : undefined;\n const page = typeof params['page'] === 'number' ? params['page'] : undefined;\n const effectiveOffset = offset ?? (page !== undefined ? (page - 1) * effectiveLimit : 0);\n\n return { offset: effectiveOffset, limit: effectiveLimit };\n};\n\n/** Empty TSearchResponse shape returned when search() tolerates a missing collection; built via bracket assignment so no snake_case identifier is declared here. */\nexport const buildEmptySearchResponse = (): unknown => {\n const response: Record<string, unknown> = { found: 0, page: 1, hits: [] };\n response['out_of'] = 0;\n response['search_time_ms'] = 0;\n response['request_params'] = {};\n return response;\n};\n"]}
@@ -112,7 +112,7 @@ class SearchWireKeys {
112
112
  SearchWireKeys.QUERY_BY_WEIGHTS,
113
113
  ]; }
114
114
  /** camelCase field -> wire key, built once from ENTRIES so `wireKey` is O(1) per lookup, not O(n) per field per query. */
115
- static { this.WIRE_BY_FIELD = Object.fromEntries(SearchWireKeys.ENTRIES.map(entry => [entry.from, entry.to])); }
115
+ static { this.WIRE_BY_FIELD = Object.fromEntries(SearchWireKeys.ENTRIES.map((entry) => [entry.from, entry.to])); }
116
116
  /** Resolves a camelCase field to its wire key; unmapped keys (`page`, `offset`) pass through. */
117
117
  static wireKey(field) {
118
118
  return SearchWireKeys.WIRE_BY_FIELD[field] ?? field;
@@ -243,7 +243,7 @@ export class TypesenseQueryDialect extends BaseHelper {
243
243
  buildVectorClause(opts) {
244
244
  const { field, nearVector, k, alpha, distanceThreshold, ef } = opts;
245
245
  const vectorCsv = (nearVector ?? [])
246
- .map(value => this.escapeValue({ field, value }))
246
+ .map((value) => this.escapeValue({ field, value }))
247
247
  .join(', ');
248
248
  let clause = `${field}:([${vectorCsv}]`;
249
249
  if (k !== undefined) {
@@ -362,7 +362,7 @@ export class TypesenseQueryDialect extends BaseHelper {
362
362
  const combined = reduceCompiled({ clauses, isDisjunction: false, joiner: ' && ' });
363
363
  // Parenthesised once two clauses actually join, reproducing byte-for-byte what the previous
364
364
  // `{ and: [defaultWhere, where] }` merge emitted through the logical-group path.
365
- return clauses.filter(clause => clause.outcome === SearchFilterOutcomes.FILTER).length > 1
365
+ return clauses.filter((clause) => clause.outcome === SearchFilterOutcomes.FILTER).length > 1
366
366
  ? parenthesize(combined)
367
367
  : combined;
368
368
  }
@@ -374,7 +374,7 @@ export class TypesenseQueryDialect extends BaseHelper {
374
374
  });
375
375
  }
376
376
  return order
377
- .map(entry => {
377
+ .map((entry) => {
378
378
  const { field, direction } = parseOrderEntry({ entry });
379
379
  assertKnownField({ field, engine: ENGINE, capabilities, method: 'toOrderBy' });
380
380
  return `${field}:${direction}`;
@@ -385,7 +385,7 @@ export class TypesenseQueryDialect extends BaseHelper {
385
385
  compileLogicalGroup(opts) {
386
386
  const { value, capabilities, isDisjunction } = opts;
387
387
  const items = Array.isArray(value) ? value : [value];
388
- const clauses = items.map(item => this.compileWhere({ where: item, capabilities }));
388
+ const clauses = items.map((item) => this.compileWhere({ where: item, capabilities }));
389
389
  // An empty member (`{}`) compiles to matchAll and the algebra absorbs it correctly: identity
390
390
  // under `and`, absorbing under `or`. Dropping it by string-length, as this once did, is what
391
391
  // turned `or: []` into "no constraint".
@@ -408,7 +408,7 @@ export class TypesenseQueryDialect extends BaseHelper {
408
408
  const combined = reduceCompiled({ clauses, isDisjunction: false, joiner: ' && ' });
409
409
  // Parenthesised only when more than one operator actually contributed a filter, preserving the
410
410
  // exact shape callers already assert on for the single-operator case.
411
- return clauses.filter(clause => clause.outcome === SearchFilterOutcomes.FILTER).length > 1
411
+ return clauses.filter((clause) => clause.outcome === SearchFilterOutcomes.FILTER).length > 1
412
412
  ? parenthesize(combined)
413
413
  : combined;
414
414
  }
@@ -541,7 +541,7 @@ export class TypesenseQueryDialect extends BaseHelper {
541
541
  message: `[TypesenseQueryDialect][toWhere] search() expected an array value | field: '${field}' | value: ${JSON.stringify(value)}`,
542
542
  });
543
543
  }
544
- return value.map(item => this.escapeValue({ field, value: item })).join(',');
544
+ return value.map((item) => this.escapeValue({ field, value: item })).join(',');
545
545
  }
546
546
  /** Shared by `between` and `notBetween` so the two cannot disagree on what a valid range is. */
547
547
  assertBetweenTuple(opts) {
@@ -1 +1 @@
1
- {"version":3,"file":"query-dialect.js","sourceRoot":"","sources":["../../../../../../src/search/typesense/repositories/dialect/query-dialect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAQpD,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AACtF,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,YAAY,EACZ,cAAc,EACd,wBAAwB,EACxB,WAAW,EACX,cAAc,GACf,MAAM,mDAAmD,CAAC;AAE3D,OAAO,EAAE,eAAe,EAAE,cAAc,EAA6B,MAAM,uBAAuB,CAAC;AACnG,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAKnE,yEAAyE;AACzE,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B,0IAA0I;AAC1I,MAAM,MAAM,GAAG,WAAW,CAAC;AAE3B;;;;;;GAMG;AACH,MAAM,cAAc,GAClB,4KAA4K,CAAC;AAE/K;;;;GAIG;AACH,MAAM,WAAW,GAA4B;IAC3C,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAC1B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAC1B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAE1B,oGAAoG;IACpG,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,KAAK;IAC5B,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,KAAK;IAChC,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,KAAK;IAC7B,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,KAAK;IACjC,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,KAAK;IAC9B,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,KAAK;IAE/B,qGAAqG;IACrG,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,IAAI;IAE7B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAC1B,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAE1B,yFAAyF;IACzF,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,KAAK;IAC9B,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE,KAAK;IAElC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,IAAI;IAC9B,4EAA4E;IAC5E,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE,IAAI;IAClC,kDAAkD;IAClD,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,KAAK;IAC9B,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE,KAAK;IAElC,+GAA+G;IAC/G,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,KAAK;IAChC,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE,KAAK;IACpC,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,KAAK;IAEhC,iGAAiG;IACjG,gGAAgG;IAChG,uDAAuD;IACvD,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,KAAK;IAE3B,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAC1B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;CAC1B,CAAC;AAEF,sIAAsI;AACtI,MAAM,cAAc;aACF,UAAK,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;aACnC,cAAS,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;aAClD,YAAO,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;aAC5C,aAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;aAC/C,mBAAc,GAAG,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC;aACjE,mBAAc,GAAG,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC;aACjE,aAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;aAC/C,iBAAY,GAAG,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;aAC3D,aAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;aAC/C,gBAAW,GAAG,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC;aACxD,qBAAgB,GAAG,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,kBAAkB,EAAE,CAAC;aACtE,qBAAgB,GAAG,EAAE,IAAI,EAAE,iBAAiB,EAAE,EAAE,EAAE,kBAAkB,EAAE,CAAC;aACvE,0BAAqB,GAAG;QACtC,IAAI,EAAE,qBAAqB;QAC3B,EAAE,EAAE,uBAAuB;KAC5B,CAAC;aACc,wBAAmB,GAAG,EAAE,IAAI,EAAE,mBAAmB,EAAE,EAAE,EAAE,qBAAqB,EAAE,CAAC;aAC/E,sBAAiB,GAAG,EAAE,IAAI,EAAE,iBAAiB,EAAE,EAAE,EAAE,mBAAmB,EAAE,CAAC;aACzE,sBAAiB,GAAG,EAAE,IAAI,EAAE,kBAAkB,EAAE,EAAE,EAAE,mBAAmB,EAAE,CAAC;aAC1E,aAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;aAC/C,gBAAW,GAAG,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC;aACxD,yBAAoB,GAAG;QACrC,IAAI,EAAE,oBAAoB;QAC1B,EAAE,EAAE,sBAAsB;KAC3B,CAAC;aACc,qBAAgB,GAAG,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,kBAAkB,EAAE,CAAC;aAE9D,YAAO,GAAG;QAChC,cAAc,CAAC,KAAK;QACpB,cAAc,CAAC,SAAS;QACxB,cAAc,CAAC,OAAO;QACtB,cAAc,CAAC,QAAQ;QACvB,cAAc,CAAC,cAAc;QAC7B,cAAc,CAAC,cAAc;QAC7B,cAAc,CAAC,QAAQ;QACvB,cAAc,CAAC,YAAY;QAC3B,cAAc,CAAC,QAAQ;QACvB,cAAc,CAAC,WAAW;QAC1B,cAAc,CAAC,gBAAgB;QAC/B,cAAc,CAAC,gBAAgB;QAC/B,cAAc,CAAC,qBAAqB;QACpC,cAAc,CAAC,mBAAmB;QAClC,cAAc,CAAC,iBAAiB;QAChC,cAAc,CAAC,iBAAiB;QAChC,cAAc,CAAC,QAAQ;QACvB,cAAc,CAAC,WAAW;QAC1B,cAAc,CAAC,oBAAoB;QACnC,cAAc,CAAC,gBAAgB;KAChC,CAAC;IAEF,0HAA0H;aAClG,kBAAa,GAA2B,MAAM,CAAC,WAAW,CAChF,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAC5D,CAAC;IAEF,iGAAiG;IACjG,MAAM,CAAC,OAAO,CAAC,KAAa;QAC1B,OAAO,cAAc,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;IACtD,CAAC;;AAGH,gQAAgQ;AAChQ,MAAM,OAAO,qBAAsB,SAAQ,UAAU;IACnD;QACE,KAAK,CAAC,EAAE,KAAK,EAAE,qBAAqB,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,IAIL;QACC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;QAEpD,0MAA0M;QAC1M,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,EAAE,CAAC;QAE5E,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,QAAQ,CAAC;gBACb,OAAO,EACL,2HAA2H;aAC9H,CAAC,CAAC;QACL,CAAC;QAED,MAAM,KAAK,GAA0B,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QAEpD,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC;YAE5D,IAAI,QAAQ,CAAC,OAAO,KAAK,oBAAoB,CAAC,MAAM,EAAE,CAAC;gBACrD,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;YACrC,CAAC;iBAAM,IAAI,QAAQ,CAAC,OAAO,KAAK,oBAAoB,CAAC,UAAU,EAAE,CAAC;gBAChE,yFAAyF;gBACzF,2FAA2F;gBAC3F,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC;YACzB,CAAC;QACH,CAAC;QAED,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC;QACzD,CAAC;QAED,4FAA4F;QAC5F,4FAA4F;QAC5F,+FAA+F;QAC/F,yFAAyF;QACzF,6FAA6F;QAC7F,eAAe;QACf,MAAM,aAAa,GAAG,IAAI,IAAI,MAAM,CAAC;QAErC,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;YAChC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC;YAE7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACtB,CAAC;QACH,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;QAChD,CAAC;QAED,IAAI,YAAY,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5C,KAAK,CAAC,aAAa,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/C,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8MAA8M;IAC9M,YAAY,CAAC,IAAsC;QACjD,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QACvB,MAAM,EAAE,YAAY,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC;QAExC,4FAA4F;QAC5F,6EAA6E;QAC7E,OAAO,IAAI,CAAC,SAAS,CAAC;QAEtB,MAAM,IAAI,GAA4B,EAAE,CAAC;QAEzC,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YAED,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC5C,CAAC;QAED,OAAO,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,YAAY,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5D,CAAC;IAED,6LAA6L;IAC7L,gBAAgB,CAAC,IAA8D;QAC7E,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,KAA8B,CAAC;QAExD,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC;gBACzB,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAChB,WAAW,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;gBAClC,CAAC;gBAED,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;oBAClB,WAAW,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAChD,CAAC;gBACD,MAAM;YACR,CAAC;YACD,KAAK,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC1B,2KAA2K;gBAC3K,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;gBAE3B,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;oBACrB,WAAW,CAAC,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;oBACzF,MAAM;gBACR,CAAC;gBAED,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;oBACrB,MAAM,QAAQ,CAAC;wBACb,OAAO,EAAE,8FAA8F;qBACxG,CAAC,CAAC;gBACL,CAAC;gBAED,2FAA2F;gBAC3F,WAAW,CAAC,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC;gBACpC,WAAW,CAAC,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC;gBACxC,WAAW,CAAC,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;gBACzF,MAAM;YACR,CAAC;YACD,KAAK,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;gBACxB,8FAA8F;gBAC9F,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;gBAC3B,WAAW,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;gBAEhC,8GAA8G;gBAC9G,WAAW,CAAC,OAAO,GAAG,KAAK,CAAC,UAAU;oBACpC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;oBACzB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAEpD,WAAW,CAAC,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;gBACzF,MAAM;YACR,CAAC;YACD,OAAO,CAAC,CAAC,CAAC;gBACR,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,iBAAiB,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,0OAA0O;IAClO,iBAAiB,CAAC,IAOzB;QACC,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,iBAAiB,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;QAEpE,MAAM,SAAS,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC;aACjC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;aAChD,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,IAAI,MAAM,GAAG,GAAG,KAAK,MAAM,SAAS,GAAG,CAAC;QAExC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,QAAQ,CAAC,EAAE,CAAC;QACxB,CAAC;QAED,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,YAAY,KAAK,EAAE,CAAC;QAChC,CAAC;QAED,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACpC,MAAM,IAAI,yBAAyB,iBAAiB,EAAE,CAAC;QACzD,CAAC;QAED,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,SAAS,EAAE,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,IAAI,GAAG,CAAC;QAEd,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,0LAA0L;IAClL,iBAAiB,CAAC,IAGzB;QACC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAE9B,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACnC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QACtC,CAAC;QAED,IAAI,KAAK,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YACvC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC;QAC9C,CAAC;QAED,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;YAC1B,KAAK,CAAC,eAAe,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC;QAED,IAAI,KAAK,CAAC,mBAAmB,EAAE,CAAC;YAC9B,KAAK,CAAC,mBAAmB,GAAG,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClE,CAAC;QAED,IAAI,KAAK,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;YAC1C,KAAK,CAAC,iBAAiB,GAAG,KAAK,CAAC,iBAAiB,CAAC;QACpD,CAAC;QAED,IAAI,KAAK,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;YACxC,KAAK,CAAC,eAAe,GAAG,KAAK,CAAC,eAAe,CAAC;QAChD,CAAC;QAED,IAAI,KAAK,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;YACzC,KAAK,CAAC,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,CAAC;QAClD,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACnC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QACtC,CAAC;QAED,IAAI,KAAK,CAAC,kBAAkB,KAAK,SAAS,EAAE,CAAC;YAC3C,KAAK,CAAC,kBAAkB,GAAG,KAAK,CAAC,kBAAkB,CAAC;QACtD,CAAC;QAED,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;YACzB,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC;QAED,2KAA2K;QAC3K,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvB,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;QAC1C,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAuB;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAE1D,QAAQ,QAAQ,CAAC,OAAO,EAAE,CAAC;YACzB,KAAK,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjC,OAAO,QAAQ,CAAC,QAAQ,CAAC;YAC3B,CAAC;YACD,KAAK,oBAAoB,CAAC,SAAS,CAAC,CAAC,CAAC;gBACpC,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,OAAO,CAAC,CAAC,CAAC;gBACR,MAAM,QAAQ,CAAC;oBACb,KAAK,EAAE,YAAY,CAAC,oBAAoB;oBACxC,OAAO,EAAE,6HAA6H,MAAM,+GAA+G;iBAC5P,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,gIAAgI;IAChI,YAAY,CAAC,IAAkE;QAC7E,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;QACrC,MAAM,OAAO,GAAqB,EAAE,CAAC;QAErC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,mJAAmJ;YACnJ,MAAM,KAAK,GAAY,KAAK,CAAC,GAAG,CAAC,CAAC;YAElC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YAED,QAAQ,GAAG,EAAE,CAAC;gBACZ,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;oBACxB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;oBACtF,MAAM;gBACR,CAAC;gBACD,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;oBACrF,MAAM;gBACR,CAAC;gBACD,OAAO,CAAC,CAAC,CAAC;oBACR,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;gBAC7E,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,cAAc,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC3E,CAAC;IAED,0CAA0C;IAC1C,UAAU,CAAC,IAA0B;QACnC,OAAO,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;IAC7C,CAAC;IAED,uCAAuC;IACvC,OAAO,CAAC,IAAmC;QACzC,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;QACzB,MAAM,QAAQ,GAAG,cAAc,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAEnF,4FAA4F;QAC5F,iFAAiF;QACjF,OAAO,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,OAAO,KAAK,oBAAoB,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC;YACxF,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC;YACxB,CAAC,CAAC,QAAQ,CAAC;IACf,CAAC;IAEO,SAAS,CAAC,IAAoE;QACpF,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;QAErC,IAAI,KAAK,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;YACnC,MAAM,QAAQ,CAAC;gBACb,OAAO,EAAE,oEAAoE,eAAe,kBAAkB,KAAK,CAAC,MAAM,EAAE;aAC7H,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK;aACT,GAAG,CAAC,KAAK,CAAC,EAAE;YACX,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,eAAe,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAExD,gBAAgB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;YAE/E,OAAO,GAAG,KAAK,IAAI,SAAS,EAAE,CAAC;QACjC,CAAC,CAAC;aACD,IAAI,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,4GAA4G;IACpG,mBAAmB,CAAC,IAI3B;QACC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC;QACpD,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAErD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,IAAc,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QAE9F,6FAA6F;QAC7F,6FAA6F;QAC7F,wCAAwC;QACxC,OAAO,YAAY,CACjB,cAAc,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CACpF,CAAC;IACJ,CAAC;IAEO,kBAAkB,CAAC,IAI1B;QACC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;QAE5C,gBAAgB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;QAE1D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,yFAAyF;YACzF,qEAAqE;YACrE,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC;gBACvB,CAAC,CAAC,EAAE,OAAO,EAAE,oBAAoB,CAAC,UAAU,EAAE;gBAC9C,CAAC,CAAC,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1E,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAC1D,IAAI,CAAC,qBAAqB,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAC1D,CAAC;QAEF,MAAM,QAAQ,GAAG,cAAc,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAEnF,+FAA+F;QAC/F,sEAAsE;QACtE,OAAO,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,OAAO,KAAK,oBAAoB,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC;YACxF,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC;YACxB,CAAC,CAAC,QAAQ,CAAC;IACf,CAAC;IAEO,qBAAqB,CAAC,IAI7B;QACC,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAElC,QAAQ,EAAE,EAAE,CAAC;YACX,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,cAAc,CAAC,GAAG,CAAC;YACxB,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,yIAAyI;gBACzI,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,IAAI,CAAC,MAAM;yBACR,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;yBACpC,IAAI,CACH,2EAA2E,EAC3E,EAAE,EACF,KAAK,EACL,MAAM,EACN,cAAc,CACf,CAAC;oBACJ,OAAO,wBAAwB,CAAC;wBAC9B,QAAQ,EAAE,EAAE;wBACZ,KAAK;wBACL,MAAM,EAAE,MAAM;wBACd,MAAM,EAAE,cAAc;qBACvB,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3B,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,IAAI,CAAC,MAAM;yBACR,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;yBACpC,IAAI,CACH,2EAA2E,EAC3E,EAAE,EACF,KAAK,EACL,MAAM,EACN,cAAc,CACf,CAAC;oBACJ,OAAO,wBAAwB,CAAC;wBAC9B,QAAQ,EAAE,EAAE;wBACZ,KAAK;wBACL,MAAM,EAAE,MAAM;wBACd,MAAM,EAAE,cAAc;qBACvB,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,cAAc,CAAC,EAAE,CAAC;YACvB,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,6EAA6E;gBAC7E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC/C,OAAO,EAAE,OAAO,EAAE,oBAAoB,CAAC,UAAU,EAAE,CAAC;gBACtD,CAAC;gBACD,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YAC7E,CAAC;YACD,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,0EAA0E;gBAC1E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC/C,OAAO,EAAE,OAAO,EAAE,oBAAoB,CAAC,SAAS,EAAE,CAAC;gBACrD,CAAC;gBACD,OAAO,cAAc,CAAC,GAAG,KAAK,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9E,CAAC;YACD,KAAK,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC5B,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9E,CAAC;YACD,KAAK,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC;gBAChC,uFAAuF;gBACvF,kEAAkE;gBAClE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC7D,OAAO,cAAc,CACnB,IAAI,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,CACjH,CAAC;YACJ,CAAC;YACD,KAAK,cAAc,CAAC,MAAM,CAAC;YAC3B,KAAK,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC;gBAC/B,sEAAsE;gBACtE,IAAI,CAAC,MAAM;qBACR,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;qBACpC,IAAI,CACH,2EAA2E,EAC3E,EAAE,EACF,KAAK,EACL,MAAM,EACN,cAAc,CACf,CAAC;gBACJ,OAAO,wBAAwB,CAAC;oBAC9B,QAAQ,EAAE,EAAE;oBACZ,KAAK;oBACL,MAAM,EAAE,MAAM;oBACd,MAAM,EAAE,cAAc;iBACvB,CAAC,CAAC;YACL,CAAC;YACD,OAAO,CAAC,CAAC,CAAC;gBACR,IAAI,CAAC,MAAM;qBACR,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;qBACpC,IAAI,CAAC,8DAA8D,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC3F,OAAO,wBAAwB,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;IACH,CAAC;IAEO,WAAW,CAAC,IAAwC;QAC1D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAE9B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,QAAQ,CAAC;oBACb,OAAO,EAAE,6GAA6G,KAAK,eAAe,KAAK,GAAG;iBACnJ,CAAC,CAAC;YACL,CAAC;YAED,OAAO,KAAK,KAAK,IAAI,CAAC;QACxB,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,uHAAuH;YACvH,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,QAAQ,CAAC;oBACb,OAAO,EAAE,0GAA0G,KAAK,cAAc,KAAK,EAAE;iBAC9I,CAAC,CAAC;YACL,CAAC;YAED,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC;YAC/B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,QAAQ,CAAC;YACb,OAAO,EAAE,wFAAwF,KAAK,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;SAC5I,CAAC,CAAC;IACL,CAAC;IAEO,WAAW,CAAC,IAAwC;QAC1D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAE9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,QAAQ,CAAC;gBACb,OAAO,EAAE,+EAA+E,KAAK,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;aACnI,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/E,CAAC;IAED,gGAAgG;IACxF,kBAAkB,CAAC,IAAwC;QACjE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAE9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,QAAQ,CAAC;gBACb,OAAO,EAAE,6FAA6F,KAAK,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;aACjJ,CAAC,CAAC;QACL,CAAC;QAED,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAEO,aAAa,CAAC,IAAwC;QAC5D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAC9B,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAE7D,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IAClG,CAAC;CACF","sourcesContent":["import { SearchErrors } from '@/search/core/common';\nimport type {\n ISearchCompileCapabilities,\n ISearchQuery,\n ISearchQueryDialect,\n TCompiledWhere,\n TSearchInput,\n} from '@/search/core/repositories/common';\nimport { SearchFilterOutcomes, SearchModes } from '@/search/core/repositories/common';\nimport {\n assertKnownField,\n isOperatorObject,\n parenthesize,\n reduceCompiled,\n throwUnsupportedOperator,\n toFieldsCsv,\n toFilterClause,\n} from '@/search/core/repositories/common/dialect-helpers';\nimport type { ITypesenseSearchQuery } from '@/search/typesense/repositories/common';\nimport { parseOrderEntry, QueryOperators, type TFilter, type TWhere } from '@venizia/ignis-filter';\nimport { BaseHelper, getError } from '@venizia/ignis-helpers/core';\n\n/** The non-raw search inputs the dialect translates; `raw` bypasses the dialect entirely. */\ntype TTranslatableSearchInput = Exclude<TSearchInput, { mode: typeof SearchModes.RAW }>;\n\n/** Maximum number of `order` entries Typesense `sort_by` can express. */\nconst MAX_SORT_FIELDS = 3;\n\n/** Names the engine in every rejection, so a caller reading the error knows it is the ENGINE CHOICE that decided it, not the operator. */\nconst ENGINE = 'Typesense';\n\n/**\n * Typesense has no null: an optional field is either present with a value or absent, and\n * `filter_by` cannot test which. That single fact is why `is: null`, `isn: null`, `exists` and\n * `notExists` are all unexpressible - they are one limitation, not four. The only documented\n * workaround is an INDEXING-time placeholder (write a sentinel, add it to `symbols_to_index`),\n * which is a schema decision the caller owns; a dialect cannot synthesise it.\n */\nconst NO_NULL_REASON =\n 'Typesense has no null representation - an optional field is either present or absent, and filter_by cannot test presence; model it with an explicit sentinel value instead';\n\n/**\n * Which neutral operators this engine can express. EVERY member of `QueryOperators.SCHEME_SET`\n * has a cell - `canExpress` asserts that at construction, so an operator added to the vocabulary\n * cannot reach an engine unclassified and start silently falling through to a default branch.\n */\nconst CAN_EXPRESS: Record<string, boolean> = {\n [QueryOperators.EQ]: true,\n [QueryOperators.NE]: true,\n [QueryOperators.NEQ]: true,\n [QueryOperators.GT]: true,\n [QueryOperators.GTE]: true,\n [QueryOperators.LT]: true,\n [QueryOperators.LTE]: true,\n\n // Pattern matching is a RELEVANCE concern in Typesense - it lives in `q`/`query_by`, not filter_by.\n [QueryOperators.LIKE]: false,\n [QueryOperators.NOT_LIKE]: false,\n [QueryOperators.ILIKE]: false,\n [QueryOperators.NOT_ILIKE]: false,\n [QueryOperators.REGEXP]: false,\n [QueryOperators.IREGEXP]: false,\n\n // Expressible against a VALUE; the `: null` form is refused at the value level (see NO_NULL_REASON).\n [QueryOperators.IS]: true,\n [QueryOperators.IS_NOT]: true,\n\n [QueryOperators.IN]: true,\n [QueryOperators.INQ]: true,\n [QueryOperators.NIN]: true,\n\n // See NO_NULL_REASON - the same limitation as `is: null`, deliberately not solved twice.\n [QueryOperators.EXISTS]: false,\n [QueryOperators.NOT_EXISTS]: false,\n\n [QueryOperators.BETWEEN]: true,\n // Rewritten by De Morgan into `< min OR > max` - see compileOperatorClause.\n [QueryOperators.NOT_BETWEEN]: true,\n // A SQL subquery has no search-engine equivalent.\n [QueryOperators.IN_SQL]: false,\n [QueryOperators.NOT_IN_SQL]: false,\n\n // Postgres array-containment semantics; Typesense array fields match by value, which is not the same question.\n [QueryOperators.CONTAINS]: false,\n [QueryOperators.CONTAINED_BY]: false,\n [QueryOperators.OVERLAPS]: false,\n\n // Negating an ARBITRARY subtree needs De Morgan through the whole tree. Partial support would be\n // worse than none: `not: 'x'` would work and `not: { and: [...] }` would not, with no way for a\n // caller to tell which shape they had until it failed.\n [QueryOperators.NOT]: false,\n\n [QueryOperators.AND]: true,\n [QueryOperators.OR]: true,\n};\n\n/** camelCase `ISearchQuery` field -> Typesense wire (snake_case) field; the snake_case strings are values only, never identifiers. */\nclass SearchWireKeys {\n static readonly QUERY = { from: 'query', to: 'q' };\n static readonly FILTER_BY = { from: 'filterBy', to: 'filter_by' };\n static readonly SORT_BY = { from: 'sortBy', to: 'sort_by' };\n static readonly PER_PAGE = { from: 'perPage', to: 'per_page' };\n static readonly INCLUDE_FIELDS = { from: 'includeFields', to: 'include_fields' };\n static readonly EXCLUDE_FIELDS = { from: 'excludeFields', to: 'exclude_fields' };\n static readonly QUERY_BY = { from: 'queryBy', to: 'query_by' };\n static readonly VECTOR_QUERY = { from: 'vectorQuery', to: 'vector_query' };\n static readonly FACET_BY = { from: 'facetBy', to: 'facet_by' };\n static readonly FACET_QUERY = { from: 'facetQuery', to: 'facet_query' };\n static readonly MAX_FACET_VALUES = { from: 'maxFacetValues', to: 'max_facet_values' };\n static readonly HIGHLIGHT_FIELDS = { from: 'highlightFields', to: 'highlight_fields' };\n static readonly HIGHLIGHT_FULL_FIELDS = {\n from: 'highlightFullFields',\n to: 'highlight_full_fields',\n };\n static readonly HIGHLIGHT_START_TAG = { from: 'highlightStartTag', to: 'highlight_start_tag' };\n static readonly HIGHLIGHT_END_TAG = { from: 'highlightEndTag', to: 'highlight_end_tag' };\n static readonly SNIPPET_THRESHOLD = { from: 'snippetThreshold', to: 'snippet_threshold' };\n static readonly GROUP_BY = { from: 'groupBy', to: 'group_by' };\n static readonly GROUP_LIMIT = { from: 'groupLimit', to: 'group_limit' };\n static readonly GROUP_MISSING_VALUES = {\n from: 'groupMissingValues',\n to: 'group_missing_values',\n };\n static readonly QUERY_BY_WEIGHTS = { from: 'queryByWeights', to: 'query_by_weights' };\n\n private static readonly ENTRIES = [\n SearchWireKeys.QUERY,\n SearchWireKeys.FILTER_BY,\n SearchWireKeys.SORT_BY,\n SearchWireKeys.PER_PAGE,\n SearchWireKeys.INCLUDE_FIELDS,\n SearchWireKeys.EXCLUDE_FIELDS,\n SearchWireKeys.QUERY_BY,\n SearchWireKeys.VECTOR_QUERY,\n SearchWireKeys.FACET_BY,\n SearchWireKeys.FACET_QUERY,\n SearchWireKeys.MAX_FACET_VALUES,\n SearchWireKeys.HIGHLIGHT_FIELDS,\n SearchWireKeys.HIGHLIGHT_FULL_FIELDS,\n SearchWireKeys.HIGHLIGHT_START_TAG,\n SearchWireKeys.HIGHLIGHT_END_TAG,\n SearchWireKeys.SNIPPET_THRESHOLD,\n SearchWireKeys.GROUP_BY,\n SearchWireKeys.GROUP_LIMIT,\n SearchWireKeys.GROUP_MISSING_VALUES,\n SearchWireKeys.QUERY_BY_WEIGHTS,\n ];\n\n /** camelCase field -> wire key, built once from ENTRIES so `wireKey` is O(1) per lookup, not O(n) per field per query. */\n private static readonly WIRE_BY_FIELD: Record<string, string> = Object.fromEntries(\n SearchWireKeys.ENTRIES.map(entry => [entry.from, entry.to]),\n );\n\n /** Resolves a camelCase field to its wire key; unmapped keys (`page`, `offset`) pass through. */\n static wireKey(field: string): string {\n return SearchWireKeys.WIRE_BY_FIELD[field] ?? field;\n }\n}\n\n/** Translates repository-level TFilter/TWhere into Typesense search params - pure string building, no dependency on the `typesense` package. Untranslatable shapes (relations, pattern/regex) throw, as does any field name the collection does not declare. */\nexport class TypesenseQueryDialect extends BaseHelper implements ISearchQueryDialect {\n constructor() {\n super({ scope: TypesenseQueryDialect.name });\n }\n\n build(opts: {\n filter?: TFilter;\n hiddenFields?: string[];\n capabilities?: ISearchCompileCapabilities;\n }): ITypesenseSearchQuery {\n const { filter, hiddenFields, capabilities } = opts;\n\n // No early return on a missing filter: `search({ mode: 'keyword', query: 'john' })` carries none, and short-circuiting here skips the exclude-fields block below, leaking the model's `hiddenProperties`.\n const { where, fields, order, limit, skip, offset, include } = filter ?? {};\n\n if (include) {\n throw getError({\n message:\n '[TypesenseQueryDialect][build] search() does not support \"include\" - relations cannot be translated to a Typesense filter',\n });\n }\n\n const query: ITypesenseSearchQuery = { query: '*' };\n\n if (where) {\n const compiled = this.compileWhere({ where, capabilities });\n\n if (compiled.outcome === SearchFilterOutcomes.FILTER) {\n query.filterBy = compiled.filterBy;\n } else if (compiled.outcome === SearchFilterOutcomes.MATCH_NONE) {\n // Marked, never expressed as a filter: Typesense has no match-nothing primitive, and the\n // repository answers empty without a round-trip rather than sending something approximate.\n query.matchNone = true;\n }\n }\n\n if (order) {\n query.sortBy = this.toOrderBy({ order, capabilities });\n }\n\n // Native offset, not a page number. `toSearchPage` refuses a skip that is not a multiple of\n // limit, so `skip: 15, limit: 10` was rejected - a rule Typesense never imposed and one the\n // relational reference never had either (relational/.../filter.ts:283-287 passes skip straight\n // through to Drizzle). Exactly one pagination pair reaches the engine, because Typesense\n // documents offset/limit and page/per_page as alternatives without saying which wins if both\n // are present.\n const effectiveSkip = skip ?? offset;\n\n if (effectiveSkip === undefined) {\n if (limit !== undefined) {\n query.perPage = limit;\n }\n } else {\n query.offset = effectiveSkip;\n\n if (limit !== undefined) {\n query.limit = limit;\n }\n }\n\n if (fields) {\n query.includeFields = toFieldsCsv({ fields });\n }\n\n if (hiddenFields && hiddenFields.length > 0) {\n query.excludeFields = hiddenFields.join(',');\n }\n\n return query;\n }\n\n /** Maps a camelCase `ISearchQuery` onto Typesense's snake_case wire params via `SearchWireKeys.wireKey`; unmapped keys (`page`, `offset`) pass through unchanged and `engineParams` merges last, verbatim. */\n toWireParams(opts: { query: Partial<ISearchQuery> }): Record<string, unknown> {\n const { query } = opts;\n const { engineParams, ...rest } = query;\n\n // `matchNone` is a repository-tier instruction, not a search param - dropped here so it can\n // never reach Typesense as an unknown key. `rest` is already a fresh object.\n delete rest.matchNone;\n\n const wire: Record<string, unknown> = {};\n\n const restEntries = Object.entries(rest);\n for (const [key, value] of restEntries) {\n if (value === undefined) {\n continue;\n }\n\n wire[SearchWireKeys.wireKey(key)] = value;\n }\n\n return engineParams ? { ...wire, ...engineParams } : wire;\n }\n\n /** Writes the mode dispatch, the vector clause and the `prefix` default onto `query`; everything engine-specific about a non-raw search lives here, so the repository tier stays neutral. */\n applySearchInput(opts: { query: ISearchQuery; input: TTranslatableSearchInput }): void {\n const { input } = opts;\n const searchQuery = opts.query as ITypesenseSearchQuery;\n\n switch (input.mode) {\n case SearchModes.KEYWORD: {\n if (input.query) {\n searchQuery.query = input.query;\n }\n\n if (input.queryBy) {\n searchQuery.queryBy = input.queryBy.join(',');\n }\n break;\n }\n case SearchModes.SEMANTIC: {\n // Vector search: prefix matching is meaningless and remote embedders reject it outright, so it defaults off - applyCommonParams still lets an explicit caller override it.\n searchQuery.prefix = false;\n\n if (input.nearVector) {\n searchQuery.vectorQuery = this.buildVectorClause({ ...input, field: input.vectorField });\n break;\n }\n\n if (!input.queryText) {\n throw getError({\n message: `[TypesenseQueryDialect][applySearchInput] semantic mode requires 'nearVector' or 'queryText'`,\n });\n }\n\n // Auto-embed: the engine vectorizes queryText against vectorField; vector_query carries k.\n searchQuery.query = input.queryText;\n searchQuery.queryBy = input.vectorField;\n searchQuery.vectorQuery = this.buildVectorClause({ ...input, field: input.vectorField });\n break;\n }\n case SearchModes.HYBRID: {\n // Same as semantic: the embedded query hits the remote embedder, which rejects prefix search.\n searchQuery.prefix = false;\n searchQuery.query = input.query;\n\n // Auto-embed (no nearVector) needs the embedding field in query_by; a supplied vector keeps text fields only.\n searchQuery.queryBy = input.nearVector\n ? input.queryBy.join(',')\n : [...input.queryBy, input.vectorField].join(',');\n\n searchQuery.vectorQuery = this.buildVectorClause({ ...input, field: input.vectorField });\n break;\n }\n default: {\n break;\n }\n }\n\n this.applyCommonParams({ query: searchQuery, input });\n }\n\n /** Builds Typesense's `<field>:([v1, v2, ...], k: N, alpha: A)` vector-search clause; an omitted `nearVector` emits an empty `[]`, Typesense's server-side auto-embed path, rather than requiring the caller to already hold a vector. */\n private buildVectorClause(opts: {\n field: string;\n nearVector?: number[];\n k?: number;\n alpha?: number;\n distanceThreshold?: number;\n ef?: number;\n }): string {\n const { field, nearVector, k, alpha, distanceThreshold, ef } = opts;\n\n const vectorCsv = (nearVector ?? [])\n .map(value => this.escapeValue({ field, value }))\n .join(', ');\n\n let clause = `${field}:([${vectorCsv}]`;\n\n if (k !== undefined) {\n clause += `, k: ${k}`;\n }\n\n if (alpha !== undefined) {\n clause += `, alpha: ${alpha}`;\n }\n\n if (distanceThreshold !== undefined) {\n clause += `, distance_threshold: ${distanceThreshold}`;\n }\n\n if (ef !== undefined) {\n clause += `, ef: ${ef}`;\n }\n\n clause += ')';\n\n return clause;\n }\n\n /** Copies faceting/highlighting/grouping/tuning params (shared by keyword/semantic/hybrid, absent from `raw`) onto the query; arrays are comma-joined as `build` joins queryBy/fields. */\n private applyCommonParams(opts: {\n query: ITypesenseSearchQuery;\n input: TTranslatableSearchInput;\n }): void {\n const { query, input } = opts;\n\n if (input.facetBy) {\n query.facetBy = input.facetBy.join(',');\n }\n\n if (input.facetQuery !== undefined) {\n query.facetQuery = input.facetQuery;\n }\n\n if (input.maxFacetValues !== undefined) {\n query.maxFacetValues = input.maxFacetValues;\n }\n\n if (input.highlightFields) {\n query.highlightFields = input.highlightFields.join(',');\n }\n\n if (input.highlightFullFields) {\n query.highlightFullFields = input.highlightFullFields.join(',');\n }\n\n if (input.highlightStartTag !== undefined) {\n query.highlightStartTag = input.highlightStartTag;\n }\n\n if (input.highlightEndTag !== undefined) {\n query.highlightEndTag = input.highlightEndTag;\n }\n\n if (input.snippetThreshold !== undefined) {\n query.snippetThreshold = input.snippetThreshold;\n }\n\n if (input.groupBy) {\n query.groupBy = input.groupBy.join(',');\n }\n\n if (input.groupLimit !== undefined) {\n query.groupLimit = input.groupLimit;\n }\n\n if (input.groupMissingValues !== undefined) {\n query.groupMissingValues = input.groupMissingValues;\n }\n\n if (input.queryByWeights) {\n query.queryByWeights = input.queryByWeights.join(',');\n }\n\n // engineParams carries Typesense's own wire-keyed tuning params, merged verbatim by toWireParams; copied onto the query here so the single-search path reaches that merge.\n if (input.engineParams) {\n query.engineParams = input.engineParams;\n }\n }\n\n /**\n * this returned `''` for it - indistinguishable from \"no constraint\", which is precisely how an\n * empty `or` came to widen the query it was written to narrow. It now throws on that input.\n */\n toWhere(opts: { where: TWhere }): string {\n const compiled = this.compileWhere({ where: opts.where });\n\n switch (compiled.outcome) {\n case SearchFilterOutcomes.FILTER: {\n return compiled.filterBy;\n }\n case SearchFilterOutcomes.MATCH_ALL: {\n return '';\n }\n default: {\n throw getError({\n error: SearchErrors.UNSUPPORTED_OPERATOR,\n message: `[TypesenseQueryDialect][toWhere] This where compiles to MATCH-NOTHING, which a filter_by string cannot express | engine: '${ENGINE}' | returning '' here would match EVERYTHING - call compileWhere() and honour its 'matchNone' outcome instead`,\n });\n }\n }\n }\n\n /** Compiles a `TWhere` into a Typesense `filter_by` expression or one of the two absorbing outcomes. Top-level keys conjoin. */\n compileWhere(opts: { where: TWhere; capabilities?: ISearchCompileCapabilities }): TCompiledWhere {\n const { where, capabilities } = opts;\n const clauses: TCompiledWhere[] = [];\n\n for (const key in where) {\n // TWhere<T = any> is a mapped-over-`any` type with no narrower runtime shape to recover here; `unknown` is the honest type for a `for...in` value.\n const value: unknown = where[key];\n\n if (value === undefined) {\n continue;\n }\n\n switch (key) {\n case QueryOperators.AND: {\n clauses.push(this.compileLogicalGroup({ value, capabilities, isDisjunction: false }));\n break;\n }\n case QueryOperators.OR: {\n clauses.push(this.compileLogicalGroup({ value, capabilities, isDisjunction: true }));\n break;\n }\n default: {\n clauses.push(this.compileFieldClause({ field: key, value, capabilities }));\n }\n }\n }\n\n return reduceCompiled({ clauses, isDisjunction: false, joiner: ' && ' });\n }\n\n /** @see ISearchQueryDialect.canExpress */\n canExpress(opts: { operator: string }): boolean {\n return CAN_EXPRESS[opts.operator] ?? false;\n }\n\n /** @see ISearchQueryDialect.conjoin */\n conjoin(opts: { clauses: TCompiledWhere[] }): TCompiledWhere {\n const { clauses } = opts;\n const combined = reduceCompiled({ clauses, isDisjunction: false, joiner: ' && ' });\n\n // Parenthesised once two clauses actually join, reproducing byte-for-byte what the previous\n // `{ and: [defaultWhere, where] }` merge emitted through the logical-group path.\n return clauses.filter(clause => clause.outcome === SearchFilterOutcomes.FILTER).length > 1\n ? parenthesize(combined)\n : combined;\n }\n\n private toOrderBy(opts: { order: string[]; capabilities?: ISearchCompileCapabilities }): string {\n const { order, capabilities } = opts;\n\n if (order.length > MAX_SORT_FIELDS) {\n throw getError({\n message: `[TypesenseQueryDialect][build] search() sort_by supports at most ${MAX_SORT_FIELDS} fields | got: ${order.length}`,\n });\n }\n\n return order\n .map(entry => {\n const { field, direction } = parseOrderEntry({ entry });\n\n assertKnownField({ field, engine: ENGINE, capabilities, method: 'toOrderBy' });\n\n return `${field}:${direction}`;\n })\n .join(',');\n }\n\n /** A logical group always parenthesises, so precedence never depends on where the group sat in the tree. */\n private compileLogicalGroup(opts: {\n value: unknown;\n capabilities?: ISearchCompileCapabilities;\n isDisjunction: boolean;\n }): TCompiledWhere {\n const { value, capabilities, isDisjunction } = opts;\n const items = Array.isArray(value) ? value : [value];\n\n const clauses = items.map(item => this.compileWhere({ where: item as TWhere, capabilities }));\n\n // An empty member (`{}`) compiles to matchAll and the algebra absorbs it correctly: identity\n // under `and`, absorbing under `or`. Dropping it by string-length, as this once did, is what\n // turned `or: []` into \"no constraint\".\n return parenthesize(\n reduceCompiled({ clauses, isDisjunction, joiner: isDisjunction ? ' || ' : ' && ' }),\n );\n }\n\n private compileFieldClause(opts: {\n field: string;\n value: unknown;\n capabilities?: ISearchCompileCapabilities;\n }): TCompiledWhere {\n const { field, value, capabilities } = opts;\n\n assertKnownField({ field, engine: ENGINE, capabilities });\n\n if (Array.isArray(value)) {\n // Mirrors relational `buildValueCondition`: an empty IN-list can match nothing, so it is\n // absorbing false - NOT the malformed `field:=[]` this used to emit.\n return value.length === 0\n ? { outcome: SearchFilterOutcomes.MATCH_NONE }\n : toFilterClause(`${field}:=[${this.escapeArray({ field, value })}]`);\n }\n\n if (!isOperatorObject(value)) {\n return toFilterClause(`${field}:=${this.escapeValue({ field, value })}`);\n }\n\n const clauses = Object.entries(value).map(([op, opValue]) =>\n this.compileOperatorClause({ field, op, value: opValue }),\n );\n\n const combined = reduceCompiled({ clauses, isDisjunction: false, joiner: ' && ' });\n\n // Parenthesised only when more than one operator actually contributed a filter, preserving the\n // exact shape callers already assert on for the single-operator case.\n return clauses.filter(clause => clause.outcome === SearchFilterOutcomes.FILTER).length > 1\n ? parenthesize(combined)\n : combined;\n }\n\n private compileOperatorClause(opts: {\n field: string;\n op: string;\n value: unknown;\n }): TCompiledWhere {\n const { field, op, value } = opts;\n\n switch (op) {\n case QueryOperators.EQ: {\n return toFilterClause(`${field}:=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.NEQ:\n case QueryOperators.NE: {\n return toFilterClause(`${field}:!=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.IS: {\n // Mirrors PostgresQueryOperators.FNS[IS] (maps null to isNull(column)) for a real value; the null form is the NO_NULL_REASON limitation.\n if (value === null) {\n this.logger\n .for(this.compileOperatorClause.name)\n .warn(\n 'Unsupported operator | operator: %s | field: %s | engine: %s | reason: %s',\n op,\n field,\n ENGINE,\n NO_NULL_REASON,\n );\n return throwUnsupportedOperator({\n operator: op,\n field,\n engine: ENGINE,\n reason: NO_NULL_REASON,\n });\n }\n return toFilterClause(`${field}:=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.IS_NOT: {\n if (value === null) {\n this.logger\n .for(this.compileOperatorClause.name)\n .warn(\n 'Unsupported operator | operator: %s | field: %s | engine: %s | reason: %s',\n op,\n field,\n ENGINE,\n NO_NULL_REASON,\n );\n return throwUnsupportedOperator({\n operator: op,\n field,\n engine: ENGINE,\n reason: NO_NULL_REASON,\n });\n }\n return toFilterClause(`${field}:!=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.GT: {\n return toFilterClause(`${field}:>${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.GTE: {\n return toFilterClause(`${field}:>=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.LT: {\n return toFilterClause(`${field}:<${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.LTE: {\n return toFilterClause(`${field}:<=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.IN:\n case QueryOperators.INQ: {\n // Relational: `inq: []` -> sql`false`. Nothing is a member of the empty set.\n if (Array.isArray(value) && value.length === 0) {\n return { outcome: SearchFilterOutcomes.MATCH_NONE };\n }\n return toFilterClause(`${field}:=[${this.escapeArray({ field, value })}]`);\n }\n case QueryOperators.NIN: {\n // Relational: `nin: []` -> sql`true`. Excluding nothing excludes nothing.\n if (Array.isArray(value) && value.length === 0) {\n return { outcome: SearchFilterOutcomes.MATCH_ALL };\n }\n return toFilterClause(`${field}:!=[${this.escapeArray({ field, value })}]`);\n }\n case QueryOperators.BETWEEN: {\n return toFilterClause(`${field}:[${this.escapeBetween({ field, value })}]`);\n }\n case QueryOperators.NOT_BETWEEN: {\n // De Morgan: NOT (min <= x <= max) is (x < min) OR (x > max). Typesense has no negated\n // range, but the rewrite is exact for any field that HAS a value.\n const [min, max] = this.assertBetweenTuple({ field, value });\n return toFilterClause(\n `(${field}:<${this.escapeValue({ field, value: min })} || ${field}:>${this.escapeValue({ field, value: max })})`,\n );\n }\n case QueryOperators.EXISTS:\n case QueryOperators.NOT_EXISTS: {\n // The same limitation as `is: null` - stated once, in NO_NULL_REASON.\n this.logger\n .for(this.compileOperatorClause.name)\n .warn(\n 'Unsupported operator | operator: %s | field: %s | engine: %s | reason: %s',\n op,\n field,\n ENGINE,\n NO_NULL_REASON,\n );\n return throwUnsupportedOperator({\n operator: op,\n field,\n engine: ENGINE,\n reason: NO_NULL_REASON,\n });\n }\n default: {\n this.logger\n .for(this.compileOperatorClause.name)\n .warn('Unsupported operator | operator: %s | field: %s | engine: %s', op, field, ENGINE);\n return throwUnsupportedOperator({ operator: op, field, engine: ENGINE });\n }\n }\n }\n\n private escapeValue(opts: { field?: string; value: unknown }): string {\n const { field, value } = opts;\n\n if (typeof value === 'string') {\n if (value.includes('`')) {\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() cannot safely represent a value containing a backtick | field: '${field}' | value: '${value}'`,\n });\n }\n\n return `\\`${value}\\``;\n }\n\n if (typeof value === 'number') {\n // NaN/Infinity would silently produce an unparseable filter_by token (e.g. 'price:>NaN') instead of a clear rejection.\n if (!Number.isFinite(value)) {\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() does not support non-finite numbers (NaN/Infinity) | field: '${field}' | value: ${value}`,\n });\n }\n\n return String(value);\n }\n\n if (typeof value === 'boolean') {\n return String(value);\n }\n\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() does not support this value type | field: '${field}' | value: ${JSON.stringify(value)}`,\n });\n }\n\n private escapeArray(opts: { field?: string; value: unknown }): string {\n const { field, value } = opts;\n\n if (!Array.isArray(value)) {\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() expected an array value | field: '${field}' | value: ${JSON.stringify(value)}`,\n });\n }\n\n return value.map(item => this.escapeValue({ field, value: item })).join(',');\n }\n\n /** Shared by `between` and `notBetween` so the two cannot disagree on what a valid range is. */\n private assertBetweenTuple(opts: { field?: string; value: unknown }): [unknown, unknown] {\n const { field, value } = opts;\n\n if (!Array.isArray(value) || value.length !== 2) {\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() 'between' requires a [min, max] tuple | field: '${field}' | value: ${JSON.stringify(value)}`,\n });\n }\n\n return [value[0], value[1]];\n }\n\n private escapeBetween(opts: { field?: string; value: unknown }): string {\n const { field, value } = opts;\n const [min, max] = this.assertBetweenTuple({ field, value });\n\n return `${this.escapeValue({ field, value: min })}..${this.escapeValue({ field, value: max })}`;\n }\n}\n"]}
1
+ {"version":3,"file":"query-dialect.js","sourceRoot":"","sources":["../../../../../../src/search/typesense/repositories/dialect/query-dialect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAQpD,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AACtF,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,YAAY,EACZ,cAAc,EACd,wBAAwB,EACxB,WAAW,EACX,cAAc,GACf,MAAM,mDAAmD,CAAC;AAE3D,OAAO,EAAE,eAAe,EAAE,cAAc,EAA6B,MAAM,uBAAuB,CAAC;AACnG,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAKnE,yEAAyE;AACzE,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B,0IAA0I;AAC1I,MAAM,MAAM,GAAG,WAAW,CAAC;AAE3B;;;;;;GAMG;AACH,MAAM,cAAc,GAClB,4KAA4K,CAAC;AAE/K;;;;GAIG;AACH,MAAM,WAAW,GAA4B;IAC3C,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAC1B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAC1B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAE1B,oGAAoG;IACpG,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,KAAK;IAC5B,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,KAAK;IAChC,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,KAAK;IAC7B,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,KAAK;IACjC,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,KAAK;IAC9B,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,KAAK;IAE/B,qGAAqG;IACrG,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,IAAI;IAE7B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;IACzB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAC1B,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAE1B,yFAAyF;IACzF,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,KAAK;IAC9B,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE,KAAK;IAElC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,IAAI;IAC9B,4EAA4E;IAC5E,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE,IAAI;IAClC,kDAAkD;IAClD,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,KAAK;IAC9B,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE,KAAK;IAElC,+GAA+G;IAC/G,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,KAAK;IAChC,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE,KAAK;IACpC,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,KAAK;IAEhC,iGAAiG;IACjG,gGAAgG;IAChG,uDAAuD;IACvD,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,KAAK;IAE3B,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,IAAI;IAC1B,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI;CAC1B,CAAC;AAEF,sIAAsI;AACtI,MAAM,cAAc;aACF,UAAK,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;aACnC,cAAS,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC;aAClD,YAAO,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;aAC5C,aAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;aAC/C,mBAAc,GAAG,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC;aACjE,mBAAc,GAAG,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC;aACjE,aAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;aAC/C,iBAAY,GAAG,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC;aAC3D,aAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;aAC/C,gBAAW,GAAG,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC;aACxD,qBAAgB,GAAG,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,kBAAkB,EAAE,CAAC;aACtE,qBAAgB,GAAG,EAAE,IAAI,EAAE,iBAAiB,EAAE,EAAE,EAAE,kBAAkB,EAAE,CAAC;aACvE,0BAAqB,GAAG;QACtC,IAAI,EAAE,qBAAqB;QAC3B,EAAE,EAAE,uBAAuB;KAC5B,CAAC;aACc,wBAAmB,GAAG,EAAE,IAAI,EAAE,mBAAmB,EAAE,EAAE,EAAE,qBAAqB,EAAE,CAAC;aAC/E,sBAAiB,GAAG,EAAE,IAAI,EAAE,iBAAiB,EAAE,EAAE,EAAE,mBAAmB,EAAE,CAAC;aACzE,sBAAiB,GAAG,EAAE,IAAI,EAAE,kBAAkB,EAAE,EAAE,EAAE,mBAAmB,EAAE,CAAC;aAC1E,aAAQ,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;aAC/C,gBAAW,GAAG,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC;aACxD,yBAAoB,GAAG;QACrC,IAAI,EAAE,oBAAoB;QAC1B,EAAE,EAAE,sBAAsB;KAC3B,CAAC;aACc,qBAAgB,GAAG,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,kBAAkB,EAAE,CAAC;aAE9D,YAAO,GAAG;QAChC,cAAc,CAAC,KAAK;QACpB,cAAc,CAAC,SAAS;QACxB,cAAc,CAAC,OAAO;QACtB,cAAc,CAAC,QAAQ;QACvB,cAAc,CAAC,cAAc;QAC7B,cAAc,CAAC,cAAc;QAC7B,cAAc,CAAC,QAAQ;QACvB,cAAc,CAAC,YAAY;QAC3B,cAAc,CAAC,QAAQ;QACvB,cAAc,CAAC,WAAW;QAC1B,cAAc,CAAC,gBAAgB;QAC/B,cAAc,CAAC,gBAAgB;QAC/B,cAAc,CAAC,qBAAqB;QACpC,cAAc,CAAC,mBAAmB;QAClC,cAAc,CAAC,iBAAiB;QAChC,cAAc,CAAC,iBAAiB;QAChC,cAAc,CAAC,QAAQ;QACvB,cAAc,CAAC,WAAW;QAC1B,cAAc,CAAC,oBAAoB;QACnC,cAAc,CAAC,gBAAgB;KAChC,CAAC;IAEF,0HAA0H;aAClG,kBAAa,GAA2B,MAAM,CAAC,WAAW,CAChF,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAC9D,CAAC;IAEF,iGAAiG;IACjG,MAAM,CAAC,OAAO,CAAC,KAAa;QAC1B,OAAO,cAAc,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;IACtD,CAAC;;AAGH,gQAAgQ;AAChQ,MAAM,OAAO,qBAAsB,SAAQ,UAAU;IACnD;QACE,KAAK,CAAC,EAAE,KAAK,EAAE,qBAAqB,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,IAIL;QACC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;QAEpD,0MAA0M;QAC1M,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,EAAE,CAAC;QAE5E,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,QAAQ,CAAC;gBACb,OAAO,EACL,2HAA2H;aAC9H,CAAC,CAAC;QACL,CAAC;QAED,MAAM,KAAK,GAA0B,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QAEpD,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC;YAE5D,IAAI,QAAQ,CAAC,OAAO,KAAK,oBAAoB,CAAC,MAAM,EAAE,CAAC;gBACrD,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;YACrC,CAAC;iBAAM,IAAI,QAAQ,CAAC,OAAO,KAAK,oBAAoB,CAAC,UAAU,EAAE,CAAC;gBAChE,yFAAyF;gBACzF,2FAA2F;gBAC3F,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC;YACzB,CAAC;QACH,CAAC;QAED,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC;QACzD,CAAC;QAED,4FAA4F;QAC5F,4FAA4F;QAC5F,+FAA+F;QAC/F,yFAAyF;QACzF,6FAA6F;QAC7F,eAAe;QACf,MAAM,aAAa,GAAG,IAAI,IAAI,MAAM,CAAC;QAErC,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;YAChC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,MAAM,GAAG,aAAa,CAAC;YAE7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACtB,CAAC;QACH,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;QAChD,CAAC;QAED,IAAI,YAAY,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5C,KAAK,CAAC,aAAa,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/C,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8MAA8M;IAC9M,YAAY,CAAC,IAAsC;QACjD,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QACvB,MAAM,EAAE,YAAY,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC;QAExC,4FAA4F;QAC5F,6EAA6E;QAC7E,OAAO,IAAI,CAAC,SAAS,CAAC;QAEtB,MAAM,IAAI,GAA4B,EAAE,CAAC;QAEzC,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YAED,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC5C,CAAC;QAED,OAAO,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,YAAY,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5D,CAAC;IAED,6LAA6L;IAC7L,gBAAgB,CAAC,IAA8D;QAC7E,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,KAA8B,CAAC;QAExD,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC;gBACzB,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAChB,WAAW,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;gBAClC,CAAC;gBAED,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;oBAClB,WAAW,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAChD,CAAC;gBACD,MAAM;YACR,CAAC;YACD,KAAK,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC1B,2KAA2K;gBAC3K,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;gBAE3B,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;oBACrB,WAAW,CAAC,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;oBACzF,MAAM;gBACR,CAAC;gBAED,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;oBACrB,MAAM,QAAQ,CAAC;wBACb,OAAO,EAAE,8FAA8F;qBACxG,CAAC,CAAC;gBACL,CAAC;gBAED,2FAA2F;gBAC3F,WAAW,CAAC,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC;gBACpC,WAAW,CAAC,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC;gBACxC,WAAW,CAAC,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;gBACzF,MAAM;YACR,CAAC;YACD,KAAK,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;gBACxB,8FAA8F;gBAC9F,WAAW,CAAC,MAAM,GAAG,KAAK,CAAC;gBAC3B,WAAW,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;gBAEhC,8GAA8G;gBAC9G,WAAW,CAAC,OAAO,GAAG,KAAK,CAAC,UAAU;oBACpC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;oBACzB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAEpD,WAAW,CAAC,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;gBACzF,MAAM;YACR,CAAC;YACD,OAAO,CAAC,CAAC,CAAC;gBACR,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,iBAAiB,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,0OAA0O;IAClO,iBAAiB,CAAC,IAOzB;QACC,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,iBAAiB,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;QAEpE,MAAM,SAAS,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC;aACjC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;aAClD,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,IAAI,MAAM,GAAG,GAAG,KAAK,MAAM,SAAS,GAAG,CAAC;QAExC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,QAAQ,CAAC,EAAE,CAAC;QACxB,CAAC;QAED,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,YAAY,KAAK,EAAE,CAAC;QAChC,CAAC;QAED,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACpC,MAAM,IAAI,yBAAyB,iBAAiB,EAAE,CAAC;QACzD,CAAC;QAED,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,SAAS,EAAE,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,IAAI,GAAG,CAAC;QAEd,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,0LAA0L;IAClL,iBAAiB,CAAC,IAGzB;QACC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAE9B,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACnC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QACtC,CAAC;QAED,IAAI,KAAK,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YACvC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC;QAC9C,CAAC;QAED,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;YAC1B,KAAK,CAAC,eAAe,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC;QAED,IAAI,KAAK,CAAC,mBAAmB,EAAE,CAAC;YAC9B,KAAK,CAAC,mBAAmB,GAAG,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClE,CAAC;QAED,IAAI,KAAK,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;YAC1C,KAAK,CAAC,iBAAiB,GAAG,KAAK,CAAC,iBAAiB,CAAC;QACpD,CAAC;QAED,IAAI,KAAK,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;YACxC,KAAK,CAAC,eAAe,GAAG,KAAK,CAAC,eAAe,CAAC;QAChD,CAAC;QAED,IAAI,KAAK,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;YACzC,KAAK,CAAC,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,CAAC;QAClD,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACnC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QACtC,CAAC;QAED,IAAI,KAAK,CAAC,kBAAkB,KAAK,SAAS,EAAE,CAAC;YAC3C,KAAK,CAAC,kBAAkB,GAAG,KAAK,CAAC,kBAAkB,CAAC;QACtD,CAAC;QAED,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;YACzB,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC;QAED,2KAA2K;QAC3K,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvB,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;QAC1C,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAuB;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAE1D,QAAQ,QAAQ,CAAC,OAAO,EAAE,CAAC;YACzB,KAAK,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjC,OAAO,QAAQ,CAAC,QAAQ,CAAC;YAC3B,CAAC;YACD,KAAK,oBAAoB,CAAC,SAAS,CAAC,CAAC,CAAC;gBACpC,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,OAAO,CAAC,CAAC,CAAC;gBACR,MAAM,QAAQ,CAAC;oBACb,KAAK,EAAE,YAAY,CAAC,oBAAoB;oBACxC,OAAO,EAAE,6HAA6H,MAAM,+GAA+G;iBAC5P,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,gIAAgI;IAChI,YAAY,CAAC,IAAkE;QAC7E,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;QACrC,MAAM,OAAO,GAAqB,EAAE,CAAC;QAErC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,mJAAmJ;YACnJ,MAAM,KAAK,GAAY,KAAK,CAAC,GAAG,CAAC,CAAC;YAElC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YAED,QAAQ,GAAG,EAAE,CAAC;gBACZ,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;oBACxB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;oBACtF,MAAM;gBACR,CAAC;gBACD,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;oBACrF,MAAM;gBACR,CAAC;gBACD,OAAO,CAAC,CAAC,CAAC;oBACR,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;gBAC7E,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,cAAc,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC3E,CAAC;IAED,0CAA0C;IAC1C,UAAU,CAAC,IAA0B;QACnC,OAAO,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;IAC7C,CAAC;IAED,uCAAuC;IACvC,OAAO,CAAC,IAAmC;QACzC,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;QACzB,MAAM,QAAQ,GAAG,cAAc,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAEnF,4FAA4F;QAC5F,iFAAiF;QACjF,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,KAAK,oBAAoB,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC;YAC1F,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC;YACxB,CAAC,CAAC,QAAQ,CAAC;IACf,CAAC;IAEO,SAAS,CAAC,IAAoE;QACpF,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;QAErC,IAAI,KAAK,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;YACnC,MAAM,QAAQ,CAAC;gBACb,OAAO,EAAE,oEAAoE,eAAe,kBAAkB,KAAK,CAAC,MAAM,EAAE;aAC7H,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK;aACT,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACb,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,eAAe,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAExD,gBAAgB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;YAE/E,OAAO,GAAG,KAAK,IAAI,SAAS,EAAE,CAAC;QACjC,CAAC,CAAC;aACD,IAAI,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,4GAA4G;IACpG,mBAAmB,CAAC,IAI3B;QACC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC;QACpD,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAErD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,IAAc,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QAEhG,6FAA6F;QAC7F,6FAA6F;QAC7F,wCAAwC;QACxC,OAAO,YAAY,CACjB,cAAc,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CACpF,CAAC;IACJ,CAAC;IAEO,kBAAkB,CAAC,IAI1B;QACC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,IAAI,CAAC;QAE5C,gBAAgB,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;QAE1D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,yFAAyF;YACzF,qEAAqE;YACrE,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC;gBACvB,CAAC,CAAC,EAAE,OAAO,EAAE,oBAAoB,CAAC,UAAU,EAAE;gBAC9C,CAAC,CAAC,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1E,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAC1D,IAAI,CAAC,qBAAqB,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAC1D,CAAC;QAEF,MAAM,QAAQ,GAAG,cAAc,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAEnF,+FAA+F;QAC/F,sEAAsE;QACtE,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,KAAK,oBAAoB,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC;YAC1F,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC;YACxB,CAAC,CAAC,QAAQ,CAAC;IACf,CAAC;IAEO,qBAAqB,CAAC,IAI7B;QACC,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAElC,QAAQ,EAAE,EAAE,CAAC;YACX,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,cAAc,CAAC,GAAG,CAAC;YACxB,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,yIAAyI;gBACzI,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,IAAI,CAAC,MAAM;yBACR,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;yBACpC,IAAI,CACH,2EAA2E,EAC3E,EAAE,EACF,KAAK,EACL,MAAM,EACN,cAAc,CACf,CAAC;oBACJ,OAAO,wBAAwB,CAAC;wBAC9B,QAAQ,EAAE,EAAE;wBACZ,KAAK;wBACL,MAAM,EAAE,MAAM;wBACd,MAAM,EAAE,cAAc;qBACvB,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3B,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,IAAI,CAAC,MAAM;yBACR,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;yBACpC,IAAI,CACH,2EAA2E,EAC3E,EAAE,EACF,KAAK,EACL,MAAM,EACN,cAAc,CACf,CAAC;oBACJ,OAAO,wBAAwB,CAAC;wBAC9B,QAAQ,EAAE,EAAE;wBACZ,KAAK;wBACL,MAAM,EAAE,MAAM;wBACd,MAAM,EAAE,cAAc;qBACvB,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,cAAc,CAAC,EAAE,CAAC;YACvB,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,6EAA6E;gBAC7E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC/C,OAAO,EAAE,OAAO,EAAE,oBAAoB,CAAC,UAAU,EAAE,CAAC;gBACtD,CAAC;gBACD,OAAO,cAAc,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YAC7E,CAAC;YACD,KAAK,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxB,0EAA0E;gBAC1E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC/C,OAAO,EAAE,OAAO,EAAE,oBAAoB,CAAC,SAAS,EAAE,CAAC;gBACrD,CAAC;gBACD,OAAO,cAAc,CAAC,GAAG,KAAK,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9E,CAAC;YACD,KAAK,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC5B,OAAO,cAAc,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9E,CAAC;YACD,KAAK,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC;gBAChC,uFAAuF;gBACvF,kEAAkE;gBAClE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC7D,OAAO,cAAc,CACnB,IAAI,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,KAAK,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,CACjH,CAAC;YACJ,CAAC;YACD,KAAK,cAAc,CAAC,MAAM,CAAC;YAC3B,KAAK,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC;gBAC/B,sEAAsE;gBACtE,IAAI,CAAC,MAAM;qBACR,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;qBACpC,IAAI,CACH,2EAA2E,EAC3E,EAAE,EACF,KAAK,EACL,MAAM,EACN,cAAc,CACf,CAAC;gBACJ,OAAO,wBAAwB,CAAC;oBAC9B,QAAQ,EAAE,EAAE;oBACZ,KAAK;oBACL,MAAM,EAAE,MAAM;oBACd,MAAM,EAAE,cAAc;iBACvB,CAAC,CAAC;YACL,CAAC;YACD,OAAO,CAAC,CAAC,CAAC;gBACR,IAAI,CAAC,MAAM;qBACR,GAAG,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC;qBACpC,IAAI,CAAC,8DAA8D,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC3F,OAAO,wBAAwB,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;IACH,CAAC;IAEO,WAAW,CAAC,IAAwC;QAC1D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAE9B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,QAAQ,CAAC;oBACb,OAAO,EAAE,6GAA6G,KAAK,eAAe,KAAK,GAAG;iBACnJ,CAAC,CAAC;YACL,CAAC;YAED,OAAO,KAAK,KAAK,IAAI,CAAC;QACxB,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,uHAAuH;YACvH,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,QAAQ,CAAC;oBACb,OAAO,EAAE,0GAA0G,KAAK,cAAc,KAAK,EAAE;iBAC9I,CAAC,CAAC;YACL,CAAC;YAED,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC;YAC/B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,QAAQ,CAAC;YACb,OAAO,EAAE,wFAAwF,KAAK,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;SAC5I,CAAC,CAAC;IACL,CAAC;IAEO,WAAW,CAAC,IAAwC;QAC1D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAE9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,QAAQ,CAAC;gBACb,OAAO,EAAE,+EAA+E,KAAK,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;aACnI,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjF,CAAC;IAED,gGAAgG;IACxF,kBAAkB,CAAC,IAAwC;QACjE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAE9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,QAAQ,CAAC;gBACb,OAAO,EAAE,6FAA6F,KAAK,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;aACjJ,CAAC,CAAC;QACL,CAAC;QAED,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAEO,aAAa,CAAC,IAAwC;QAC5D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;QAC9B,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAE7D,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IAClG,CAAC;CACF","sourcesContent":["import { SearchErrors } from '@/search/core/common';\nimport type {\n ISearchCompileCapabilities,\n ISearchQuery,\n ISearchQueryDialect,\n TCompiledWhere,\n TSearchInput,\n} from '@/search/core/repositories/common';\nimport { SearchFilterOutcomes, SearchModes } from '@/search/core/repositories/common';\nimport {\n assertKnownField,\n isOperatorObject,\n parenthesize,\n reduceCompiled,\n throwUnsupportedOperator,\n toFieldsCsv,\n toFilterClause,\n} from '@/search/core/repositories/common/dialect-helpers';\nimport type { ITypesenseSearchQuery } from '@/search/typesense/repositories/common';\nimport { parseOrderEntry, QueryOperators, type TFilter, type TWhere } from '@venizia/ignis-filter';\nimport { BaseHelper, getError } from '@venizia/ignis-helpers/core';\n\n/** The non-raw search inputs the dialect translates; `raw` bypasses the dialect entirely. */\ntype TTranslatableSearchInput = Exclude<TSearchInput, { mode: typeof SearchModes.RAW }>;\n\n/** Maximum number of `order` entries Typesense `sort_by` can express. */\nconst MAX_SORT_FIELDS = 3;\n\n/** Names the engine in every rejection, so a caller reading the error knows it is the ENGINE CHOICE that decided it, not the operator. */\nconst ENGINE = 'Typesense';\n\n/**\n * Typesense has no null: an optional field is either present with a value or absent, and\n * `filter_by` cannot test which. That single fact is why `is: null`, `isn: null`, `exists` and\n * `notExists` are all unexpressible - they are one limitation, not four. The only documented\n * workaround is an INDEXING-time placeholder (write a sentinel, add it to `symbols_to_index`),\n * which is a schema decision the caller owns; a dialect cannot synthesise it.\n */\nconst NO_NULL_REASON =\n 'Typesense has no null representation - an optional field is either present or absent, and filter_by cannot test presence; model it with an explicit sentinel value instead';\n\n/**\n * Which neutral operators this engine can express. EVERY member of `QueryOperators.SCHEME_SET`\n * has a cell - `canExpress` asserts that at construction, so an operator added to the vocabulary\n * cannot reach an engine unclassified and start silently falling through to a default branch.\n */\nconst CAN_EXPRESS: Record<string, boolean> = {\n [QueryOperators.EQ]: true,\n [QueryOperators.NE]: true,\n [QueryOperators.NEQ]: true,\n [QueryOperators.GT]: true,\n [QueryOperators.GTE]: true,\n [QueryOperators.LT]: true,\n [QueryOperators.LTE]: true,\n\n // Pattern matching is a RELEVANCE concern in Typesense - it lives in `q`/`query_by`, not filter_by.\n [QueryOperators.LIKE]: false,\n [QueryOperators.NOT_LIKE]: false,\n [QueryOperators.ILIKE]: false,\n [QueryOperators.NOT_ILIKE]: false,\n [QueryOperators.REGEXP]: false,\n [QueryOperators.IREGEXP]: false,\n\n // Expressible against a VALUE; the `: null` form is refused at the value level (see NO_NULL_REASON).\n [QueryOperators.IS]: true,\n [QueryOperators.IS_NOT]: true,\n\n [QueryOperators.IN]: true,\n [QueryOperators.INQ]: true,\n [QueryOperators.NIN]: true,\n\n // See NO_NULL_REASON - the same limitation as `is: null`, deliberately not solved twice.\n [QueryOperators.EXISTS]: false,\n [QueryOperators.NOT_EXISTS]: false,\n\n [QueryOperators.BETWEEN]: true,\n // Rewritten by De Morgan into `< min OR > max` - see compileOperatorClause.\n [QueryOperators.NOT_BETWEEN]: true,\n // A SQL subquery has no search-engine equivalent.\n [QueryOperators.IN_SQL]: false,\n [QueryOperators.NOT_IN_SQL]: false,\n\n // Postgres array-containment semantics; Typesense array fields match by value, which is not the same question.\n [QueryOperators.CONTAINS]: false,\n [QueryOperators.CONTAINED_BY]: false,\n [QueryOperators.OVERLAPS]: false,\n\n // Negating an ARBITRARY subtree needs De Morgan through the whole tree. Partial support would be\n // worse than none: `not: 'x'` would work and `not: { and: [...] }` would not, with no way for a\n // caller to tell which shape they had until it failed.\n [QueryOperators.NOT]: false,\n\n [QueryOperators.AND]: true,\n [QueryOperators.OR]: true,\n};\n\n/** camelCase `ISearchQuery` field -> Typesense wire (snake_case) field; the snake_case strings are values only, never identifiers. */\nclass SearchWireKeys {\n static readonly QUERY = { from: 'query', to: 'q' };\n static readonly FILTER_BY = { from: 'filterBy', to: 'filter_by' };\n static readonly SORT_BY = { from: 'sortBy', to: 'sort_by' };\n static readonly PER_PAGE = { from: 'perPage', to: 'per_page' };\n static readonly INCLUDE_FIELDS = { from: 'includeFields', to: 'include_fields' };\n static readonly EXCLUDE_FIELDS = { from: 'excludeFields', to: 'exclude_fields' };\n static readonly QUERY_BY = { from: 'queryBy', to: 'query_by' };\n static readonly VECTOR_QUERY = { from: 'vectorQuery', to: 'vector_query' };\n static readonly FACET_BY = { from: 'facetBy', to: 'facet_by' };\n static readonly FACET_QUERY = { from: 'facetQuery', to: 'facet_query' };\n static readonly MAX_FACET_VALUES = { from: 'maxFacetValues', to: 'max_facet_values' };\n static readonly HIGHLIGHT_FIELDS = { from: 'highlightFields', to: 'highlight_fields' };\n static readonly HIGHLIGHT_FULL_FIELDS = {\n from: 'highlightFullFields',\n to: 'highlight_full_fields',\n };\n static readonly HIGHLIGHT_START_TAG = { from: 'highlightStartTag', to: 'highlight_start_tag' };\n static readonly HIGHLIGHT_END_TAG = { from: 'highlightEndTag', to: 'highlight_end_tag' };\n static readonly SNIPPET_THRESHOLD = { from: 'snippetThreshold', to: 'snippet_threshold' };\n static readonly GROUP_BY = { from: 'groupBy', to: 'group_by' };\n static readonly GROUP_LIMIT = { from: 'groupLimit', to: 'group_limit' };\n static readonly GROUP_MISSING_VALUES = {\n from: 'groupMissingValues',\n to: 'group_missing_values',\n };\n static readonly QUERY_BY_WEIGHTS = { from: 'queryByWeights', to: 'query_by_weights' };\n\n private static readonly ENTRIES = [\n SearchWireKeys.QUERY,\n SearchWireKeys.FILTER_BY,\n SearchWireKeys.SORT_BY,\n SearchWireKeys.PER_PAGE,\n SearchWireKeys.INCLUDE_FIELDS,\n SearchWireKeys.EXCLUDE_FIELDS,\n SearchWireKeys.QUERY_BY,\n SearchWireKeys.VECTOR_QUERY,\n SearchWireKeys.FACET_BY,\n SearchWireKeys.FACET_QUERY,\n SearchWireKeys.MAX_FACET_VALUES,\n SearchWireKeys.HIGHLIGHT_FIELDS,\n SearchWireKeys.HIGHLIGHT_FULL_FIELDS,\n SearchWireKeys.HIGHLIGHT_START_TAG,\n SearchWireKeys.HIGHLIGHT_END_TAG,\n SearchWireKeys.SNIPPET_THRESHOLD,\n SearchWireKeys.GROUP_BY,\n SearchWireKeys.GROUP_LIMIT,\n SearchWireKeys.GROUP_MISSING_VALUES,\n SearchWireKeys.QUERY_BY_WEIGHTS,\n ];\n\n /** camelCase field -> wire key, built once from ENTRIES so `wireKey` is O(1) per lookup, not O(n) per field per query. */\n private static readonly WIRE_BY_FIELD: Record<string, string> = Object.fromEntries(\n SearchWireKeys.ENTRIES.map((entry) => [entry.from, entry.to]),\n );\n\n /** Resolves a camelCase field to its wire key; unmapped keys (`page`, `offset`) pass through. */\n static wireKey(field: string): string {\n return SearchWireKeys.WIRE_BY_FIELD[field] ?? field;\n }\n}\n\n/** Translates repository-level TFilter/TWhere into Typesense search params - pure string building, no dependency on the `typesense` package. Untranslatable shapes (relations, pattern/regex) throw, as does any field name the collection does not declare. */\nexport class TypesenseQueryDialect extends BaseHelper implements ISearchQueryDialect {\n constructor() {\n super({ scope: TypesenseQueryDialect.name });\n }\n\n build(opts: {\n filter?: TFilter;\n hiddenFields?: string[];\n capabilities?: ISearchCompileCapabilities;\n }): ITypesenseSearchQuery {\n const { filter, hiddenFields, capabilities } = opts;\n\n // No early return on a missing filter: `search({ mode: 'keyword', query: 'john' })` carries none, and short-circuiting here skips the exclude-fields block below, leaking the model's `hiddenProperties`.\n const { where, fields, order, limit, skip, offset, include } = filter ?? {};\n\n if (include) {\n throw getError({\n message:\n '[TypesenseQueryDialect][build] search() does not support \"include\" - relations cannot be translated to a Typesense filter',\n });\n }\n\n const query: ITypesenseSearchQuery = { query: '*' };\n\n if (where) {\n const compiled = this.compileWhere({ where, capabilities });\n\n if (compiled.outcome === SearchFilterOutcomes.FILTER) {\n query.filterBy = compiled.filterBy;\n } else if (compiled.outcome === SearchFilterOutcomes.MATCH_NONE) {\n // Marked, never expressed as a filter: Typesense has no match-nothing primitive, and the\n // repository answers empty without a round-trip rather than sending something approximate.\n query.matchNone = true;\n }\n }\n\n if (order) {\n query.sortBy = this.toOrderBy({ order, capabilities });\n }\n\n // Native offset, not a page number. `toSearchPage` refuses a skip that is not a multiple of\n // limit, so `skip: 15, limit: 10` was rejected - a rule Typesense never imposed and one the\n // relational reference never had either (relational/.../filter.ts:283-287 passes skip straight\n // through to Drizzle). Exactly one pagination pair reaches the engine, because Typesense\n // documents offset/limit and page/per_page as alternatives without saying which wins if both\n // are present.\n const effectiveSkip = skip ?? offset;\n\n if (effectiveSkip === undefined) {\n if (limit !== undefined) {\n query.perPage = limit;\n }\n } else {\n query.offset = effectiveSkip;\n\n if (limit !== undefined) {\n query.limit = limit;\n }\n }\n\n if (fields) {\n query.includeFields = toFieldsCsv({ fields });\n }\n\n if (hiddenFields && hiddenFields.length > 0) {\n query.excludeFields = hiddenFields.join(',');\n }\n\n return query;\n }\n\n /** Maps a camelCase `ISearchQuery` onto Typesense's snake_case wire params via `SearchWireKeys.wireKey`; unmapped keys (`page`, `offset`) pass through unchanged and `engineParams` merges last, verbatim. */\n toWireParams(opts: { query: Partial<ISearchQuery> }): Record<string, unknown> {\n const { query } = opts;\n const { engineParams, ...rest } = query;\n\n // `matchNone` is a repository-tier instruction, not a search param - dropped here so it can\n // never reach Typesense as an unknown key. `rest` is already a fresh object.\n delete rest.matchNone;\n\n const wire: Record<string, unknown> = {};\n\n const restEntries = Object.entries(rest);\n for (const [key, value] of restEntries) {\n if (value === undefined) {\n continue;\n }\n\n wire[SearchWireKeys.wireKey(key)] = value;\n }\n\n return engineParams ? { ...wire, ...engineParams } : wire;\n }\n\n /** Writes the mode dispatch, the vector clause and the `prefix` default onto `query`; everything engine-specific about a non-raw search lives here, so the repository tier stays neutral. */\n applySearchInput(opts: { query: ISearchQuery; input: TTranslatableSearchInput }): void {\n const { input } = opts;\n const searchQuery = opts.query as ITypesenseSearchQuery;\n\n switch (input.mode) {\n case SearchModes.KEYWORD: {\n if (input.query) {\n searchQuery.query = input.query;\n }\n\n if (input.queryBy) {\n searchQuery.queryBy = input.queryBy.join(',');\n }\n break;\n }\n case SearchModes.SEMANTIC: {\n // Vector search: prefix matching is meaningless and remote embedders reject it outright, so it defaults off - applyCommonParams still lets an explicit caller override it.\n searchQuery.prefix = false;\n\n if (input.nearVector) {\n searchQuery.vectorQuery = this.buildVectorClause({ ...input, field: input.vectorField });\n break;\n }\n\n if (!input.queryText) {\n throw getError({\n message: `[TypesenseQueryDialect][applySearchInput] semantic mode requires 'nearVector' or 'queryText'`,\n });\n }\n\n // Auto-embed: the engine vectorizes queryText against vectorField; vector_query carries k.\n searchQuery.query = input.queryText;\n searchQuery.queryBy = input.vectorField;\n searchQuery.vectorQuery = this.buildVectorClause({ ...input, field: input.vectorField });\n break;\n }\n case SearchModes.HYBRID: {\n // Same as semantic: the embedded query hits the remote embedder, which rejects prefix search.\n searchQuery.prefix = false;\n searchQuery.query = input.query;\n\n // Auto-embed (no nearVector) needs the embedding field in query_by; a supplied vector keeps text fields only.\n searchQuery.queryBy = input.nearVector\n ? input.queryBy.join(',')\n : [...input.queryBy, input.vectorField].join(',');\n\n searchQuery.vectorQuery = this.buildVectorClause({ ...input, field: input.vectorField });\n break;\n }\n default: {\n break;\n }\n }\n\n this.applyCommonParams({ query: searchQuery, input });\n }\n\n /** Builds Typesense's `<field>:([v1, v2, ...], k: N, alpha: A)` vector-search clause; an omitted `nearVector` emits an empty `[]`, Typesense's server-side auto-embed path, rather than requiring the caller to already hold a vector. */\n private buildVectorClause(opts: {\n field: string;\n nearVector?: number[];\n k?: number;\n alpha?: number;\n distanceThreshold?: number;\n ef?: number;\n }): string {\n const { field, nearVector, k, alpha, distanceThreshold, ef } = opts;\n\n const vectorCsv = (nearVector ?? [])\n .map((value) => this.escapeValue({ field, value }))\n .join(', ');\n\n let clause = `${field}:([${vectorCsv}]`;\n\n if (k !== undefined) {\n clause += `, k: ${k}`;\n }\n\n if (alpha !== undefined) {\n clause += `, alpha: ${alpha}`;\n }\n\n if (distanceThreshold !== undefined) {\n clause += `, distance_threshold: ${distanceThreshold}`;\n }\n\n if (ef !== undefined) {\n clause += `, ef: ${ef}`;\n }\n\n clause += ')';\n\n return clause;\n }\n\n /** Copies faceting/highlighting/grouping/tuning params (shared by keyword/semantic/hybrid, absent from `raw`) onto the query; arrays are comma-joined as `build` joins queryBy/fields. */\n private applyCommonParams(opts: {\n query: ITypesenseSearchQuery;\n input: TTranslatableSearchInput;\n }): void {\n const { query, input } = opts;\n\n if (input.facetBy) {\n query.facetBy = input.facetBy.join(',');\n }\n\n if (input.facetQuery !== undefined) {\n query.facetQuery = input.facetQuery;\n }\n\n if (input.maxFacetValues !== undefined) {\n query.maxFacetValues = input.maxFacetValues;\n }\n\n if (input.highlightFields) {\n query.highlightFields = input.highlightFields.join(',');\n }\n\n if (input.highlightFullFields) {\n query.highlightFullFields = input.highlightFullFields.join(',');\n }\n\n if (input.highlightStartTag !== undefined) {\n query.highlightStartTag = input.highlightStartTag;\n }\n\n if (input.highlightEndTag !== undefined) {\n query.highlightEndTag = input.highlightEndTag;\n }\n\n if (input.snippetThreshold !== undefined) {\n query.snippetThreshold = input.snippetThreshold;\n }\n\n if (input.groupBy) {\n query.groupBy = input.groupBy.join(',');\n }\n\n if (input.groupLimit !== undefined) {\n query.groupLimit = input.groupLimit;\n }\n\n if (input.groupMissingValues !== undefined) {\n query.groupMissingValues = input.groupMissingValues;\n }\n\n if (input.queryByWeights) {\n query.queryByWeights = input.queryByWeights.join(',');\n }\n\n // engineParams carries Typesense's own wire-keyed tuning params, merged verbatim by toWireParams; copied onto the query here so the single-search path reaches that merge.\n if (input.engineParams) {\n query.engineParams = input.engineParams;\n }\n }\n\n /**\n * this returned `''` for it - indistinguishable from \"no constraint\", which is precisely how an\n * empty `or` came to widen the query it was written to narrow. It now throws on that input.\n */\n toWhere(opts: { where: TWhere }): string {\n const compiled = this.compileWhere({ where: opts.where });\n\n switch (compiled.outcome) {\n case SearchFilterOutcomes.FILTER: {\n return compiled.filterBy;\n }\n case SearchFilterOutcomes.MATCH_ALL: {\n return '';\n }\n default: {\n throw getError({\n error: SearchErrors.UNSUPPORTED_OPERATOR,\n message: `[TypesenseQueryDialect][toWhere] This where compiles to MATCH-NOTHING, which a filter_by string cannot express | engine: '${ENGINE}' | returning '' here would match EVERYTHING - call compileWhere() and honour its 'matchNone' outcome instead`,\n });\n }\n }\n }\n\n /** Compiles a `TWhere` into a Typesense `filter_by` expression or one of the two absorbing outcomes. Top-level keys conjoin. */\n compileWhere(opts: { where: TWhere; capabilities?: ISearchCompileCapabilities }): TCompiledWhere {\n const { where, capabilities } = opts;\n const clauses: TCompiledWhere[] = [];\n\n for (const key in where) {\n // TWhere<T = any> is a mapped-over-`any` type with no narrower runtime shape to recover here; `unknown` is the honest type for a `for...in` value.\n const value: unknown = where[key];\n\n if (value === undefined) {\n continue;\n }\n\n switch (key) {\n case QueryOperators.AND: {\n clauses.push(this.compileLogicalGroup({ value, capabilities, isDisjunction: false }));\n break;\n }\n case QueryOperators.OR: {\n clauses.push(this.compileLogicalGroup({ value, capabilities, isDisjunction: true }));\n break;\n }\n default: {\n clauses.push(this.compileFieldClause({ field: key, value, capabilities }));\n }\n }\n }\n\n return reduceCompiled({ clauses, isDisjunction: false, joiner: ' && ' });\n }\n\n /** @see ISearchQueryDialect.canExpress */\n canExpress(opts: { operator: string }): boolean {\n return CAN_EXPRESS[opts.operator] ?? false;\n }\n\n /** @see ISearchQueryDialect.conjoin */\n conjoin(opts: { clauses: TCompiledWhere[] }): TCompiledWhere {\n const { clauses } = opts;\n const combined = reduceCompiled({ clauses, isDisjunction: false, joiner: ' && ' });\n\n // Parenthesised once two clauses actually join, reproducing byte-for-byte what the previous\n // `{ and: [defaultWhere, where] }` merge emitted through the logical-group path.\n return clauses.filter((clause) => clause.outcome === SearchFilterOutcomes.FILTER).length > 1\n ? parenthesize(combined)\n : combined;\n }\n\n private toOrderBy(opts: { order: string[]; capabilities?: ISearchCompileCapabilities }): string {\n const { order, capabilities } = opts;\n\n if (order.length > MAX_SORT_FIELDS) {\n throw getError({\n message: `[TypesenseQueryDialect][build] search() sort_by supports at most ${MAX_SORT_FIELDS} fields | got: ${order.length}`,\n });\n }\n\n return order\n .map((entry) => {\n const { field, direction } = parseOrderEntry({ entry });\n\n assertKnownField({ field, engine: ENGINE, capabilities, method: 'toOrderBy' });\n\n return `${field}:${direction}`;\n })\n .join(',');\n }\n\n /** A logical group always parenthesises, so precedence never depends on where the group sat in the tree. */\n private compileLogicalGroup(opts: {\n value: unknown;\n capabilities?: ISearchCompileCapabilities;\n isDisjunction: boolean;\n }): TCompiledWhere {\n const { value, capabilities, isDisjunction } = opts;\n const items = Array.isArray(value) ? value : [value];\n\n const clauses = items.map((item) => this.compileWhere({ where: item as TWhere, capabilities }));\n\n // An empty member (`{}`) compiles to matchAll and the algebra absorbs it correctly: identity\n // under `and`, absorbing under `or`. Dropping it by string-length, as this once did, is what\n // turned `or: []` into \"no constraint\".\n return parenthesize(\n reduceCompiled({ clauses, isDisjunction, joiner: isDisjunction ? ' || ' : ' && ' }),\n );\n }\n\n private compileFieldClause(opts: {\n field: string;\n value: unknown;\n capabilities?: ISearchCompileCapabilities;\n }): TCompiledWhere {\n const { field, value, capabilities } = opts;\n\n assertKnownField({ field, engine: ENGINE, capabilities });\n\n if (Array.isArray(value)) {\n // Mirrors relational `buildValueCondition`: an empty IN-list can match nothing, so it is\n // absorbing false - NOT the malformed `field:=[]` this used to emit.\n return value.length === 0\n ? { outcome: SearchFilterOutcomes.MATCH_NONE }\n : toFilterClause(`${field}:=[${this.escapeArray({ field, value })}]`);\n }\n\n if (!isOperatorObject(value)) {\n return toFilterClause(`${field}:=${this.escapeValue({ field, value })}`);\n }\n\n const clauses = Object.entries(value).map(([op, opValue]) =>\n this.compileOperatorClause({ field, op, value: opValue }),\n );\n\n const combined = reduceCompiled({ clauses, isDisjunction: false, joiner: ' && ' });\n\n // Parenthesised only when more than one operator actually contributed a filter, preserving the\n // exact shape callers already assert on for the single-operator case.\n return clauses.filter((clause) => clause.outcome === SearchFilterOutcomes.FILTER).length > 1\n ? parenthesize(combined)\n : combined;\n }\n\n private compileOperatorClause(opts: {\n field: string;\n op: string;\n value: unknown;\n }): TCompiledWhere {\n const { field, op, value } = opts;\n\n switch (op) {\n case QueryOperators.EQ: {\n return toFilterClause(`${field}:=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.NEQ:\n case QueryOperators.NE: {\n return toFilterClause(`${field}:!=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.IS: {\n // Mirrors PostgresQueryOperators.FNS[IS] (maps null to isNull(column)) for a real value; the null form is the NO_NULL_REASON limitation.\n if (value === null) {\n this.logger\n .for(this.compileOperatorClause.name)\n .warn(\n 'Unsupported operator | operator: %s | field: %s | engine: %s | reason: %s',\n op,\n field,\n ENGINE,\n NO_NULL_REASON,\n );\n return throwUnsupportedOperator({\n operator: op,\n field,\n engine: ENGINE,\n reason: NO_NULL_REASON,\n });\n }\n return toFilterClause(`${field}:=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.IS_NOT: {\n if (value === null) {\n this.logger\n .for(this.compileOperatorClause.name)\n .warn(\n 'Unsupported operator | operator: %s | field: %s | engine: %s | reason: %s',\n op,\n field,\n ENGINE,\n NO_NULL_REASON,\n );\n return throwUnsupportedOperator({\n operator: op,\n field,\n engine: ENGINE,\n reason: NO_NULL_REASON,\n });\n }\n return toFilterClause(`${field}:!=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.GT: {\n return toFilterClause(`${field}:>${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.GTE: {\n return toFilterClause(`${field}:>=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.LT: {\n return toFilterClause(`${field}:<${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.LTE: {\n return toFilterClause(`${field}:<=${this.escapeValue({ field, value })}`);\n }\n case QueryOperators.IN:\n case QueryOperators.INQ: {\n // Relational: `inq: []` -> sql`false`. Nothing is a member of the empty set.\n if (Array.isArray(value) && value.length === 0) {\n return { outcome: SearchFilterOutcomes.MATCH_NONE };\n }\n return toFilterClause(`${field}:=[${this.escapeArray({ field, value })}]`);\n }\n case QueryOperators.NIN: {\n // Relational: `nin: []` -> sql`true`. Excluding nothing excludes nothing.\n if (Array.isArray(value) && value.length === 0) {\n return { outcome: SearchFilterOutcomes.MATCH_ALL };\n }\n return toFilterClause(`${field}:!=[${this.escapeArray({ field, value })}]`);\n }\n case QueryOperators.BETWEEN: {\n return toFilterClause(`${field}:[${this.escapeBetween({ field, value })}]`);\n }\n case QueryOperators.NOT_BETWEEN: {\n // De Morgan: NOT (min <= x <= max) is (x < min) OR (x > max). Typesense has no negated\n // range, but the rewrite is exact for any field that HAS a value.\n const [min, max] = this.assertBetweenTuple({ field, value });\n return toFilterClause(\n `(${field}:<${this.escapeValue({ field, value: min })} || ${field}:>${this.escapeValue({ field, value: max })})`,\n );\n }\n case QueryOperators.EXISTS:\n case QueryOperators.NOT_EXISTS: {\n // The same limitation as `is: null` - stated once, in NO_NULL_REASON.\n this.logger\n .for(this.compileOperatorClause.name)\n .warn(\n 'Unsupported operator | operator: %s | field: %s | engine: %s | reason: %s',\n op,\n field,\n ENGINE,\n NO_NULL_REASON,\n );\n return throwUnsupportedOperator({\n operator: op,\n field,\n engine: ENGINE,\n reason: NO_NULL_REASON,\n });\n }\n default: {\n this.logger\n .for(this.compileOperatorClause.name)\n .warn('Unsupported operator | operator: %s | field: %s | engine: %s', op, field, ENGINE);\n return throwUnsupportedOperator({ operator: op, field, engine: ENGINE });\n }\n }\n }\n\n private escapeValue(opts: { field?: string; value: unknown }): string {\n const { field, value } = opts;\n\n if (typeof value === 'string') {\n if (value.includes('`')) {\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() cannot safely represent a value containing a backtick | field: '${field}' | value: '${value}'`,\n });\n }\n\n return `\\`${value}\\``;\n }\n\n if (typeof value === 'number') {\n // NaN/Infinity would silently produce an unparseable filter_by token (e.g. 'price:>NaN') instead of a clear rejection.\n if (!Number.isFinite(value)) {\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() does not support non-finite numbers (NaN/Infinity) | field: '${field}' | value: ${value}`,\n });\n }\n\n return String(value);\n }\n\n if (typeof value === 'boolean') {\n return String(value);\n }\n\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() does not support this value type | field: '${field}' | value: ${JSON.stringify(value)}`,\n });\n }\n\n private escapeArray(opts: { field?: string; value: unknown }): string {\n const { field, value } = opts;\n\n if (!Array.isArray(value)) {\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() expected an array value | field: '${field}' | value: ${JSON.stringify(value)}`,\n });\n }\n\n return value.map((item) => this.escapeValue({ field, value: item })).join(',');\n }\n\n /** Shared by `between` and `notBetween` so the two cannot disagree on what a valid range is. */\n private assertBetweenTuple(opts: { field?: string; value: unknown }): [unknown, unknown] {\n const { field, value } = opts;\n\n if (!Array.isArray(value) || value.length !== 2) {\n throw getError({\n message: `[TypesenseQueryDialect][toWhere] search() 'between' requires a [min, max] tuple | field: '${field}' | value: ${JSON.stringify(value)}`,\n });\n }\n\n return [value[0], value[1]];\n }\n\n private escapeBetween(opts: { field?: string; value: unknown }): string {\n const { field, value } = opts;\n const [min, max] = this.assertBetweenTuple({ field, value });\n\n return `${this.escapeValue({ field, value: min })}..${this.escapeValue({ field, value: max })}`;\n }\n}\n"]}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@venizia/ignis-connectors",
3
- "version": "0.4.0",
3
+ "version": "0.4.2",
4
4
  "description": "Datasource and repository connectors for the IGNIS framework: the engine-neutral relational and search tiers, plus Postgres, SQLite, PGlite, Typesense and Meilisearch behind sub-paths.",
5
5
  "license": "MIT",
6
6
  "files": [
@@ -117,20 +117,20 @@
117
117
  "access": "public"
118
118
  },
119
119
  "scripts": {
120
- "force-update": "sh ../../scripts/force-update.sh",
120
+ "force-update": "sh ../../scripts/build/force-update.sh",
121
121
  "prepublishOnly": "make rebuild"
122
122
  },
123
123
  "dependencies": {
124
- "@venizia/ignis-filter": "0.4.0",
125
- "@venizia/ignis-helpers": "0.4.0",
126
- "@venizia/ignis-inversion": "0.4.0",
127
- "@venizia/ignis-kernel": "0.4.0",
124
+ "@venizia/ignis-filter": "0.4.2",
125
+ "@venizia/ignis-helpers": "0.4.2",
126
+ "@venizia/ignis-inversion": "0.4.2",
127
+ "@venizia/ignis-kernel": "0.4.2",
128
128
  "zod": "^4.6.7"
129
129
  },
130
130
  "devDependencies": {
131
131
  "@types/bun": "^1.4.3",
132
132
  "@types/pg": "^8.23.1",
133
- "@venizia/dev-configs": "0.4.0",
133
+ "@venizia/dev-configs": "0.4.2",
134
134
  "eslint": "^10.13.0",
135
135
  "oxlint": "1.89.0",
136
136
  "oxlint-tsgolint": "7.0.2004",