joist-core 2.3.0-next.95 → 2.3.0-next.97
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.
- package/build/EntityManager.cjs +36 -39
- package/build/EntityManager.cjs.map +1 -1
- package/build/EntityManager.d.cts +4 -4
- package/build/EntityManager.d.mts +4 -4
- package/build/EntityManager.js +29 -32
- package/build/EntityManager.js.map +1 -1
- package/build/EntityMetadata.cjs +3 -3
- package/build/EntityMetadata.js +3 -3
- package/build/IndexManager.cjs +1 -1
- package/build/IndexManager.js +1 -1
- package/build/InstanceData.cjs +1 -1
- package/build/InstanceData.js +1 -1
- package/build/JoinRows.cjs +1 -1
- package/build/JoinRows.js +1 -1
- package/build/PluginManager.cjs +0 -1
- package/build/PluginManager.cjs.map +1 -1
- package/build/PluginManager.d.cts +1 -1
- package/build/PluginManager.d.mts +1 -1
- package/build/PluginManager.js +0 -1
- package/build/PluginManager.js.map +1 -1
- package/build/ReactionsManager.cjs +2 -2
- package/build/ReactionsManager.js +2 -2
- package/build/Todo.cjs +1 -1
- package/build/Todo.js +1 -1
- package/build/batchloaders/enumCollectionBatchLoader.cjs +1 -1
- package/build/batchloaders/enumCollectionBatchLoader.js +1 -1
- package/build/batchloaders/loadBatchLoader.cjs +6 -5
- package/build/batchloaders/loadBatchLoader.cjs.map +1 -1
- package/build/batchloaders/loadBatchLoader.d.cts.map +1 -1
- package/build/batchloaders/loadBatchLoader.d.mts.map +1 -1
- package/build/batchloaders/loadBatchLoader.js +4 -3
- package/build/batchloaders/loadBatchLoader.js.map +1 -1
- package/build/batchloaders/manyToManyBatchLoader.cjs +1 -1
- package/build/batchloaders/manyToManyBatchLoader.js +1 -1
- package/build/batchloaders/oneToManyBatchLoader.cjs +3 -3
- package/build/batchloaders/oneToManyBatchLoader.cjs.map +1 -1
- package/build/batchloaders/oneToManyBatchLoader.js +2 -2
- package/build/batchloaders/oneToOneBatchLoader.cjs +4 -4
- package/build/batchloaders/oneToOneBatchLoader.cjs.map +1 -1
- package/build/batchloaders/oneToOneBatchLoader.js +3 -3
- package/build/batchloaders/populateBatchLoader.cjs +11 -11
- package/build/batchloaders/populateBatchLoader.cjs.map +1 -1
- package/build/batchloaders/populateBatchLoader.js +8 -8
- package/build/batchloaders/recursiveChildrenBatchLoader.cjs +8 -8
- package/build/batchloaders/recursiveChildrenBatchLoader.cjs.map +1 -1
- package/build/batchloaders/recursiveChildrenBatchLoader.js +5 -5
- package/build/batchloaders/recursiveM2mBatchLoader.cjs +5 -5
- package/build/batchloaders/recursiveM2mBatchLoader.cjs.map +1 -1
- package/build/batchloaders/recursiveM2mBatchLoader.js +2 -2
- package/build/batchloaders/recursiveParentsBatchLoader.cjs +8 -8
- package/build/batchloaders/recursiveParentsBatchLoader.cjs.map +1 -1
- package/build/batchloaders/recursiveParentsBatchLoader.js +5 -5
- package/build/changes.cjs +4 -4
- package/build/changes.js +4 -4
- package/build/config.cjs +3 -3
- package/build/config.js +3 -3
- package/build/configure.cjs +6 -6
- package/build/configure.js +6 -6
- package/build/dataloaders/fastWhereFilterHash.cjs +3 -3
- package/build/dataloaders/fastWhereFilterHash.cjs.map +1 -1
- package/build/dataloaders/fastWhereFilterHash.js +2 -2
- package/build/dataloaders/fastWhereFilterHash.js.map +1 -1
- package/build/dataloaders/findByUniqueDataLoader.cjs +5 -6
- package/build/dataloaders/findByUniqueDataLoader.cjs.map +1 -1
- package/build/dataloaders/findByUniqueDataLoader.d.cts.map +1 -1
- package/build/dataloaders/findByUniqueDataLoader.d.mts.map +1 -1
- package/build/dataloaders/findByUniqueDataLoader.js +3 -4
- package/build/dataloaders/findByUniqueDataLoader.js.map +1 -1
- package/build/dataloaders/findCountDataLoader.cjs +10 -13
- package/build/dataloaders/findCountDataLoader.cjs.map +1 -1
- package/build/dataloaders/findCountDataLoader.d.cts +2 -2
- package/build/dataloaders/findCountDataLoader.d.mts +2 -2
- package/build/dataloaders/findCountDataLoader.js +4 -7
- package/build/dataloaders/findCountDataLoader.js.map +1 -1
- package/build/dataloaders/findDataLoader.cjs +15 -19
- package/build/dataloaders/findDataLoader.cjs.map +1 -1
- package/build/dataloaders/findDataLoader.d.cts +2 -2
- package/build/dataloaders/findDataLoader.d.cts.map +1 -1
- package/build/dataloaders/findDataLoader.d.mts +2 -2
- package/build/dataloaders/findDataLoader.d.mts.map +1 -1
- package/build/dataloaders/findDataLoader.js +5 -9
- package/build/dataloaders/findDataLoader.js.map +1 -1
- package/build/dataloaders/findIdsDataLoader.cjs +6 -9
- package/build/dataloaders/findIdsDataLoader.cjs.map +1 -1
- package/build/dataloaders/findIdsDataLoader.d.cts +1 -1
- package/build/dataloaders/findIdsDataLoader.d.mts +1 -1
- package/build/dataloaders/findIdsDataLoader.js +3 -6
- package/build/dataloaders/findIdsDataLoader.js.map +1 -1
- package/build/dataloaders/findOrCreateDataLoader.cjs +1 -2
- package/build/dataloaders/findOrCreateDataLoader.cjs.map +1 -1
- package/build/dataloaders/findOrCreateDataLoader.js +1 -2
- package/build/dataloaders/findOrCreateDataLoader.js.map +1 -1
- package/build/dataloaders/findPaginatedDataLoader.cjs +3 -6
- package/build/dataloaders/findPaginatedDataLoader.cjs.map +1 -1
- package/build/dataloaders/findPaginatedDataLoader.d.cts +1 -1
- package/build/dataloaders/findPaginatedDataLoader.d.mts +1 -1
- package/build/dataloaders/findPaginatedDataLoader.js +2 -5
- package/build/dataloaders/findPaginatedDataLoader.js.map +1 -1
- package/build/dataloaders/lensDataLoader.cjs +4 -4
- package/build/dataloaders/lensDataLoader.cjs.map +1 -1
- package/build/dataloaders/lensDataLoader.js +2 -2
- package/build/dataloaders/lensDataLoader.js.map +1 -1
- package/build/dataloaders/manyToManyFindDataLoader.cjs +1 -4
- package/build/dataloaders/manyToManyFindDataLoader.cjs.map +1 -1
- package/build/dataloaders/manyToManyFindDataLoader.d.cts +0 -1
- package/build/dataloaders/manyToManyFindDataLoader.d.cts.map +1 -1
- package/build/dataloaders/manyToManyFindDataLoader.d.mts +0 -1
- package/build/dataloaders/manyToManyFindDataLoader.d.mts.map +1 -1
- package/build/dataloaders/manyToManyFindDataLoader.js +1 -4
- package/build/dataloaders/manyToManyFindDataLoader.js.map +1 -1
- package/build/dataloaders/oneToManyFindDataLoader.cjs +3 -6
- package/build/dataloaders/oneToManyFindDataLoader.cjs.map +1 -1
- package/build/dataloaders/oneToManyFindDataLoader.d.cts +0 -1
- package/build/dataloaders/oneToManyFindDataLoader.d.cts.map +1 -1
- package/build/dataloaders/oneToManyFindDataLoader.d.mts +0 -1
- package/build/dataloaders/oneToManyFindDataLoader.d.mts.map +1 -1
- package/build/dataloaders/oneToManyFindDataLoader.js +2 -5
- package/build/dataloaders/oneToManyFindDataLoader.js.map +1 -1
- package/build/defaults.cjs +4 -4
- package/build/defaults.js +4 -4
- package/build/driverApi.cjs +4 -5
- package/build/driverApi.cjs.map +1 -1
- package/build/driverApi.d.cts +1 -1
- package/build/driverApi.d.mts +1 -1
- package/build/driverApi.js +2 -2
- package/build/driverApi.js.map +1 -1
- package/build/drivers/Driver.cjs +0 -1
- package/build/drivers/Driver.d.cts +1 -1
- package/build/drivers/Driver.d.mts +1 -1
- package/build/drivers/Driver.js +0 -1
- package/build/drivers/EntityWriter.cjs +2 -2
- package/build/drivers/EntityWriter.js +2 -2
- package/build/drivers/index.cjs +0 -6
- package/build/drivers/index.d.cts +1 -3
- package/build/drivers/index.d.mts +1 -3
- package/build/drivers/index.js +1 -3
- package/build/fieldSerde.cjs +2 -2
- package/build/fieldSerde.js +2 -2
- package/build/fields.cjs +2 -2
- package/build/fields.js +2 -2
- package/build/getProperties.cjs +1 -1
- package/build/getProperties.js +1 -1
- package/build/index.cjs +109 -106
- package/build/index.cjs.map +1 -1
- package/build/index.d.cts +27 -24
- package/build/index.d.cts.map +1 -1
- package/build/index.d.mts +27 -24
- package/build/index.d.mts.map +1 -1
- package/build/index.js +52 -50
- package/build/index.js.map +1 -1
- package/build/json.cjs +3 -3
- package/build/json.js +3 -3
- package/build/keys.cjs +1 -1
- package/build/keys.js +1 -1
- package/build/loadHints.cjs +1 -1
- package/build/loadHints.js +1 -1
- package/build/loadLens.cjs +1 -1
- package/build/loadLens.js +1 -1
- package/build/logging/FactoryLogger.cjs +1 -1
- package/build/logging/FactoryLogger.js +1 -1
- package/build/logging/FieldLogger.cjs +1 -1
- package/build/logging/FieldLogger.js +1 -1
- package/build/logging/ReactionLogger.cjs +1 -1
- package/build/logging/ReactionLogger.js +1 -1
- package/build/newEntity.cjs +1 -1
- package/build/newEntity.js +1 -1
- package/build/newTestInstance.cjs +3 -3
- package/build/newTestInstance.js +3 -3
- package/build/plugins/PreloadPlugin.cjs +1 -2
- package/build/plugins/PreloadPlugin.d.cts +1 -1
- package/build/plugins/PreloadPlugin.d.mts +1 -1
- package/build/plugins/PreloadPlugin.js +1 -2
- package/build/preloading/JsonAggregatePreloader.cjs +31 -31
- package/build/preloading/JsonAggregatePreloader.cjs.map +1 -1
- package/build/preloading/JsonAggregatePreloader.d.cts +1 -1
- package/build/preloading/JsonAggregatePreloader.d.mts +1 -1
- package/build/preloading/JsonAggregatePreloader.js +6 -6
- package/build/preloading/JsonAggregatePreloader.js.map +1 -1
- package/build/preloading/partitionHint.cjs +3 -3
- package/build/preloading/partitionHint.js +3 -3
- package/build/{ConditionBuilder.cjs → queries/ConditionBuilder.cjs} +7 -8
- package/build/queries/ConditionBuilder.cjs.map +1 -0
- package/build/{ConditionBuilder.d.cts → queries/ConditionBuilder.d.cts} +3 -3
- package/build/queries/ConditionBuilder.d.cts.map +1 -0
- package/build/{ConditionBuilder.d.mts → queries/ConditionBuilder.d.mts} +3 -3
- package/build/queries/ConditionBuilder.d.mts.map +1 -0
- package/build/{ConditionBuilder.js → queries/ConditionBuilder.js} +4 -5
- package/build/queries/ConditionBuilder.js.map +1 -0
- package/build/{conditions.cjs → queries/conditions.cjs} +1 -2
- package/build/queries/conditions.cjs.map +1 -0
- package/build/{conditions.d.cts → queries/conditions.d.cts} +2 -2
- package/build/queries/conditions.d.cts.map +1 -0
- package/build/{conditions.d.mts → queries/conditions.d.mts} +2 -2
- package/build/queries/conditions.d.mts.map +1 -0
- package/build/{conditions.js → queries/conditions.js} +1 -2
- package/build/queries/conditions.js.map +1 -0
- package/build/queries/entityQueryUtils.cjs +60 -0
- package/build/queries/entityQueryUtils.cjs.map +1 -0
- package/build/queries/entityQueryUtils.d.cts +19 -0
- package/build/queries/entityQueryUtils.d.cts.map +1 -0
- package/build/queries/entityQueryUtils.d.mts +19 -0
- package/build/queries/entityQueryUtils.d.mts.map +1 -0
- package/build/queries/entityQueryUtils.js +56 -0
- package/build/queries/entityQueryUtils.js.map +1 -0
- package/build/{Aliases.cjs → queries/find/Aliases.cjs} +23 -28
- package/build/queries/find/Aliases.cjs.map +1 -0
- package/build/{Aliases.d.cts → queries/find/Aliases.d.cts} +7 -7
- package/build/queries/find/Aliases.d.cts.map +1 -0
- package/build/{Aliases.d.mts → queries/find/Aliases.d.mts} +7 -7
- package/build/queries/find/Aliases.d.mts.map +1 -0
- package/build/{Aliases.js → queries/find/Aliases.js} +7 -12
- package/build/queries/find/Aliases.js.map +1 -0
- package/build/{DeferredAlias.cjs → queries/find/DeferredAlias.cjs} +3 -6
- package/build/queries/find/DeferredAlias.cjs.map +1 -0
- package/build/{DeferredAlias.d.cts → queries/find/DeferredAlias.d.cts} +4 -4
- package/build/queries/find/DeferredAlias.d.cts.map +1 -0
- package/build/{DeferredAlias.d.mts → queries/find/DeferredAlias.d.mts} +4 -4
- package/build/queries/find/DeferredAlias.d.mts.map +1 -0
- package/build/{DeferredAlias.js → queries/find/DeferredAlias.js} +2 -5
- package/build/queries/find/DeferredAlias.js.map +1 -0
- package/build/{EntityFilter.cjs → queries/find/EntityFilter.cjs} +4 -9
- package/build/queries/find/EntityFilter.cjs.map +1 -0
- package/build/{EntityFilter.d.cts → queries/find/EntityFilter.d.cts} +6 -6
- package/build/queries/find/EntityFilter.d.cts.map +1 -0
- package/build/{EntityFilter.d.mts → queries/find/EntityFilter.d.mts} +6 -6
- package/build/queries/find/EntityFilter.d.mts.map +1 -0
- package/build/{EntityFilter.js → queries/find/EntityFilter.js} +1 -6
- package/build/queries/find/EntityFilter.js.map +1 -0
- package/build/{EntityGraphQLFilter.cjs → queries/find/EntityGraphQLFilter.cjs} +1 -5
- package/build/queries/find/EntityGraphQLFilter.cjs.map +1 -0
- package/build/{EntityGraphQLFilter.d.cts → queries/find/EntityGraphQLFilter.d.cts} +3 -3
- package/build/queries/find/EntityGraphQLFilter.d.cts.map +1 -0
- package/build/{EntityGraphQLFilter.d.mts → queries/find/EntityGraphQLFilter.d.mts} +3 -3
- package/build/queries/find/EntityGraphQLFilter.d.mts.map +1 -0
- package/build/{EntityGraphQLFilter.js → queries/find/EntityGraphQLFilter.js} +1 -5
- package/build/queries/find/EntityGraphQLFilter.js.map +1 -0
- package/build/{QueryParser.cjs → queries/find/QueryParser.cjs} +68 -356
- package/build/queries/find/QueryParser.cjs.map +1 -0
- package/build/{QueryParser.collectionJoins.cjs → queries/find/QueryParser.collectionJoins.cjs} +8 -8
- package/build/queries/find/QueryParser.collectionJoins.cjs.map +1 -0
- package/build/{QueryParser.collectionJoins.d.cts → queries/find/QueryParser.collectionJoins.d.cts} +1 -1
- package/build/queries/find/QueryParser.collectionJoins.d.cts.map +1 -0
- package/build/{QueryParser.collectionJoins.d.mts → queries/find/QueryParser.collectionJoins.d.mts} +1 -1
- package/build/queries/find/QueryParser.collectionJoins.d.mts.map +1 -0
- package/build/{QueryParser.collectionJoins.js → queries/find/QueryParser.collectionJoins.js} +2 -2
- package/build/queries/find/QueryParser.collectionJoins.js.map +1 -0
- package/build/{QueryParser.d.cts → queries/find/QueryParser.d.cts} +5 -159
- package/build/queries/find/QueryParser.d.cts.map +1 -0
- package/build/{QueryParser.d.mts → queries/find/QueryParser.d.mts} +5 -159
- package/build/queries/find/QueryParser.d.mts.map +1 -0
- package/build/{QueryParser.js → queries/find/QueryParser.js} +15 -295
- package/build/queries/find/QueryParser.js.map +1 -0
- package/build/{QueryParser.pruning.cjs → queries/find/QueryParser.pruning.cjs} +6 -20
- package/build/queries/find/QueryParser.pruning.cjs.map +1 -0
- package/build/queries/find/QueryParser.pruning.d.cts +8 -0
- package/build/queries/find/QueryParser.pruning.d.cts.map +1 -0
- package/build/queries/find/QueryParser.pruning.d.mts +8 -0
- package/build/queries/find/QueryParser.pruning.d.mts.map +1 -0
- package/build/{QueryParser.pruning.js → queries/find/QueryParser.pruning.js} +4 -17
- package/build/queries/find/QueryParser.pruning.js.map +1 -0
- package/build/{QueryVisitor.cjs → queries/find/QueryVisitor.cjs} +2 -3
- package/build/queries/find/QueryVisitor.cjs.map +1 -0
- package/build/{QueryVisitor.d.cts → queries/find/QueryVisitor.d.cts} +3 -2
- package/build/queries/find/QueryVisitor.d.cts.map +1 -0
- package/build/{QueryVisitor.d.mts → queries/find/QueryVisitor.d.mts} +3 -2
- package/build/queries/find/QueryVisitor.d.mts.map +1 -0
- package/build/{QueryVisitor.js → queries/find/QueryVisitor.js} +2 -3
- package/build/queries/find/QueryVisitor.js.map +1 -0
- package/build/{drivers/buildRawQuery.cjs → queries/find/buildFindQuery.cjs} +14 -15
- package/build/queries/find/buildFindQuery.cjs.map +1 -0
- package/build/{drivers/buildRawQuery.d.cts → queries/find/buildFindQuery.d.cts} +3 -3
- package/build/queries/find/buildFindQuery.d.cts.map +1 -0
- package/build/{drivers/buildRawQuery.d.mts → queries/find/buildFindQuery.d.mts} +3 -3
- package/build/queries/find/buildFindQuery.d.mts.map +1 -0
- package/build/{drivers/buildRawQuery.js → queries/find/buildFindQuery.js} +5 -6
- package/build/queries/find/buildFindQuery.js.map +1 -0
- package/build/{scopes.cjs → queries/find/scopes.cjs} +2 -3
- package/build/queries/find/scopes.cjs.map +1 -0
- package/build/{scopes.d.cts → queries/find/scopes.d.cts} +6 -6
- package/build/queries/find/scopes.d.cts.map +1 -0
- package/build/{scopes.d.mts → queries/find/scopes.d.mts} +6 -6
- package/build/queries/find/scopes.d.mts.map +1 -0
- package/build/{scopes.js → queries/find/scopes.js} +2 -3
- package/build/queries/find/scopes.js.map +1 -0
- package/build/queries/parsedConditions.cjs +21 -0
- package/build/queries/parsedConditions.cjs.map +1 -0
- package/build/queries/parsedConditions.d.cts +127 -0
- package/build/queries/parsedConditions.d.cts.map +1 -0
- package/build/queries/parsedConditions.d.mts +127 -0
- package/build/queries/parsedConditions.d.mts.map +1 -0
- package/build/queries/parsedConditions.js +20 -0
- package/build/queries/parsedConditions.js.map +1 -0
- package/build/{drivers/buildUtils.cjs → queries/renderConditions.cjs} +7 -8
- package/build/queries/renderConditions.cjs.map +1 -0
- package/build/{drivers/buildUtils.d.mts → queries/renderConditions.d.cts} +5 -4
- package/build/queries/renderConditions.d.cts.map +1 -0
- package/build/{drivers/buildUtils.d.cts → queries/renderConditions.d.mts} +5 -4
- package/build/queries/renderConditions.d.mts.map +1 -0
- package/build/{drivers/buildUtils.js → queries/renderConditions.js} +4 -5
- package/build/queries/renderConditions.js.map +1 -0
- package/build/{skipCondition.cjs → queries/skipCondition.cjs} +1 -2
- package/build/queries/skipCondition.cjs.map +1 -0
- package/build/{skipCondition.d.cts → queries/skipCondition.d.cts} +2 -2
- package/build/{skipCondition.d.cts.map → queries/skipCondition.d.cts.map} +1 -1
- package/build/{skipCondition.d.mts → queries/skipCondition.d.mts} +2 -2
- package/build/{skipCondition.d.mts.map → queries/skipCondition.d.mts.map} +1 -1
- package/build/{skipCondition.js → queries/skipCondition.js} +1 -2
- package/build/queries/skipCondition.js.map +1 -0
- package/build/{AliasAssigner.cjs → queries/sql/AliasAssigner.cjs} +2 -3
- package/build/queries/sql/AliasAssigner.cjs.map +1 -0
- package/build/{AliasAssigner.d.cts → queries/sql/AliasAssigner.d.cts} +2 -2
- package/build/queries/sql/AliasAssigner.d.cts.map +1 -0
- package/build/{AliasAssigner.d.mts → queries/sql/AliasAssigner.d.mts} +2 -2
- package/build/queries/sql/AliasAssigner.d.mts.map +1 -0
- package/build/{AliasAssigner.js → queries/sql/AliasAssigner.js} +2 -3
- package/build/queries/sql/AliasAssigner.js.map +1 -0
- package/build/{Expr.cjs → queries/sql/Expr.cjs} +9 -9
- package/build/queries/sql/Expr.cjs.map +1 -0
- package/build/{Expr.d.cts → queries/sql/Expr.d.cts} +4 -4
- package/build/queries/sql/Expr.d.cts.map +1 -0
- package/build/{Expr.d.mts → queries/sql/Expr.d.mts} +4 -4
- package/build/queries/sql/Expr.d.mts.map +1 -0
- package/build/{Expr.js → queries/sql/Expr.js} +4 -4
- package/build/queries/sql/Expr.js.map +1 -0
- package/build/{Tables.cjs → queries/sql/Tables.cjs} +63 -67
- package/build/queries/sql/Tables.cjs.map +1 -0
- package/build/{Tables.d.cts → queries/sql/Tables.d.cts} +6 -7
- package/build/queries/sql/Tables.d.cts.map +1 -0
- package/build/{Tables.d.mts → queries/sql/Tables.d.mts} +6 -7
- package/build/queries/sql/Tables.d.mts.map +1 -0
- package/build/{Tables.js → queries/sql/Tables.js} +9 -13
- package/build/queries/sql/Tables.js.map +1 -0
- package/build/{execute.cjs → queries/sql/execute.cjs} +32 -37
- package/build/queries/sql/execute.cjs.map +1 -0
- package/build/{execute.d.cts → queries/sql/execute.d.cts} +6 -6
- package/build/queries/sql/execute.d.cts.map +1 -0
- package/build/{execute.d.mts → queries/sql/execute.d.mts} +6 -6
- package/build/queries/sql/execute.d.mts.map +1 -0
- package/build/{execute.js → queries/sql/execute.js} +5 -10
- package/build/queries/sql/execute.js.map +1 -0
- package/build/{expressions → queries/sql/expressions}/arrayAgg.cjs +12 -12
- package/build/queries/sql/expressions/arrayAgg.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/arrayAgg.d.cts +1 -1
- package/build/queries/sql/expressions/arrayAgg.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/arrayAgg.d.mts +1 -1
- package/build/queries/sql/expressions/arrayAgg.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/arrayAgg.js +1 -1
- package/build/queries/sql/expressions/arrayAgg.js.map +1 -0
- package/build/{expressions → queries/sql/expressions}/case.cjs +14 -14
- package/build/queries/sql/expressions/case.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/case.d.cts +1 -1
- package/build/queries/sql/expressions/case.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/case.d.mts +1 -1
- package/build/queries/sql/expressions/case.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/case.js +1 -1
- package/build/queries/sql/expressions/case.js.map +1 -0
- package/build/queries/sql/expressions/coalesce.cjs +25 -0
- package/build/queries/sql/expressions/coalesce.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/coalesce.d.cts +1 -1
- package/build/queries/sql/expressions/coalesce.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/coalesce.d.mts +1 -1
- package/build/queries/sql/expressions/coalesce.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/coalesce.js +1 -1
- package/build/queries/sql/expressions/coalesce.js.map +1 -0
- package/build/{expressions → queries/sql/expressions}/codecs.cjs +5 -5
- package/build/queries/sql/expressions/codecs.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/codecs.d.cts +1 -1
- package/build/queries/sql/expressions/codecs.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/codecs.d.mts +1 -1
- package/build/queries/sql/expressions/codecs.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/codecs.js +3 -3
- package/build/queries/sql/expressions/codecs.js.map +1 -0
- package/build/queries/sql/expressions/expression.cjs +102 -0
- package/build/queries/sql/expressions/expression.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/expression.d.cts +1 -1
- package/build/queries/sql/expressions/expression.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/expression.d.mts +1 -1
- package/build/queries/sql/expressions/expression.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/expression.js +2 -2
- package/build/queries/sql/expressions/expression.js.map +1 -0
- package/build/queries/sql/expressions/greatest.cjs +25 -0
- package/build/queries/sql/expressions/greatest.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/greatest.d.cts +1 -1
- package/build/queries/sql/expressions/greatest.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/greatest.d.mts +1 -1
- package/build/queries/sql/expressions/greatest.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/greatest.js +1 -1
- package/build/queries/sql/expressions/greatest.js.map +1 -0
- package/build/queries/sql/expressions/least.cjs +25 -0
- package/build/queries/sql/expressions/least.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/least.d.cts +1 -1
- package/build/queries/sql/expressions/least.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/least.d.mts +1 -1
- package/build/queries/sql/expressions/least.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/least.js +1 -1
- package/build/queries/sql/expressions/least.js.map +1 -0
- package/build/{expressions → queries/sql/expressions}/nullIf.cjs +6 -6
- package/build/queries/sql/expressions/nullIf.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/nullIf.d.cts +1 -1
- package/build/queries/sql/expressions/nullIf.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/nullIf.d.mts +1 -1
- package/build/queries/sql/expressions/nullIf.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/nullIf.js +1 -1
- package/build/queries/sql/expressions/nullIf.js.map +1 -0
- package/build/{expressions → queries/sql/expressions}/parseExpression.cjs +16 -16
- package/build/queries/sql/expressions/parseExpression.cjs.map +1 -0
- package/build/{expressions → queries/sql/expressions}/parseExpression.d.cts +1 -1
- package/build/queries/sql/expressions/parseExpression.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/parseExpression.d.mts +1 -1
- package/build/queries/sql/expressions/parseExpression.d.mts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/parseExpression.js +2 -2
- package/build/queries/sql/expressions/parseExpression.js.map +1 -0
- package/build/{expressions → queries/sql/expressions}/types.d.cts +1 -1
- package/build/queries/sql/expressions/types.d.cts.map +1 -0
- package/build/{expressions → queries/sql/expressions}/types.d.mts +1 -1
- package/build/queries/sql/expressions/types.d.mts.map +1 -0
- package/build/{keywords.cjs → queries/sql/keywords.cjs} +1 -1
- package/build/queries/sql/keywords.cjs.map +1 -0
- package/build/{keywords.d.cts → queries/sql/keywords.d.cts} +1 -1
- package/build/queries/sql/keywords.d.cts.map +1 -0
- package/build/{keywords.d.mts → queries/sql/keywords.d.mts} +1 -1
- package/build/queries/sql/keywords.d.mts.map +1 -0
- package/build/{keywords.js → queries/sql/keywords.js} +1 -1
- package/build/queries/sql/keywords.js.map +1 -0
- package/build/{query.cjs → queries/sql/query.cjs} +112 -83
- package/build/queries/sql/query.cjs.map +1 -0
- package/build/{query.d.cts → queries/sql/query.d.cts} +18 -8
- package/build/queries/sql/query.d.cts.map +1 -0
- package/build/{query.d.mts → queries/sql/query.d.mts} +18 -8
- package/build/queries/sql/query.d.mts.map +1 -0
- package/build/{query.js → queries/sql/query.js} +41 -13
- package/build/queries/sql/query.js.map +1 -0
- package/build/queries/valueFilters.cjs +248 -0
- package/build/queries/valueFilters.cjs.map +1 -0
- package/build/queries/valueFilters.d.cts +28 -0
- package/build/queries/valueFilters.d.cts.map +1 -0
- package/build/queries/valueFilters.d.mts +28 -0
- package/build/queries/valueFilters.d.mts.map +1 -0
- package/build/queries/valueFilters.js +243 -0
- package/build/queries/valueFilters.js.map +1 -0
- package/build/reactiveHints.cjs +5 -5
- package/build/reactiveHints.js +5 -5
- package/build/relations/AbstractRelationImpl.cjs +0 -5
- package/build/relations/AbstractRelationImpl.cjs.map +1 -1
- package/build/relations/AbstractRelationImpl.d.cts +1 -2
- package/build/relations/AbstractRelationImpl.d.cts.map +1 -1
- package/build/relations/AbstractRelationImpl.d.mts +1 -2
- package/build/relations/AbstractRelationImpl.d.mts.map +1 -1
- package/build/relations/AbstractRelationImpl.js +1 -5
- package/build/relations/AbstractRelationImpl.js.map +1 -1
- package/build/relations/AsyncProperty.cjs +1 -1
- package/build/relations/AsyncProperty.js +1 -1
- package/build/relations/AsyncReactiveField.cjs +3 -3
- package/build/relations/AsyncReactiveField.js +3 -3
- package/build/relations/Collection.cjs +1 -1
- package/build/relations/Collection.js +1 -1
- package/build/relations/CustomCollection.cjs +1 -1
- package/build/relations/CustomCollection.js +1 -1
- package/build/relations/CustomReference.cjs +3 -3
- package/build/relations/CustomReference.js +3 -3
- package/build/relations/EnumCollection.cjs +2 -2
- package/build/relations/EnumCollection.js +2 -2
- package/build/relations/LazyField.cjs +6 -7
- package/build/relations/LazyField.cjs.map +1 -1
- package/build/relations/LazyField.js +5 -6
- package/build/relations/LazyField.js.map +1 -1
- package/build/relations/ManyToManyCollection.cjs +4 -3
- package/build/relations/ManyToManyCollection.cjs.map +1 -1
- package/build/relations/ManyToManyCollection.d.cts.map +1 -1
- package/build/relations/ManyToManyCollection.d.mts.map +1 -1
- package/build/relations/ManyToManyCollection.js +4 -3
- package/build/relations/ManyToManyCollection.js.map +1 -1
- package/build/relations/ManyToManyLargeCollection.cjs +2 -2
- package/build/relations/ManyToManyLargeCollection.js +2 -2
- package/build/relations/ManyToOneReference.cjs +7 -6
- package/build/relations/ManyToOneReference.cjs.map +1 -1
- package/build/relations/ManyToOneReference.d.cts.map +1 -1
- package/build/relations/ManyToOneReference.d.mts.map +1 -1
- package/build/relations/ManyToOneReference.js +7 -6
- package/build/relations/ManyToOneReference.js.map +1 -1
- package/build/relations/OneToManyCollection.cjs +6 -5
- package/build/relations/OneToManyCollection.cjs.map +1 -1
- package/build/relations/OneToManyCollection.d.cts.map +1 -1
- package/build/relations/OneToManyCollection.d.mts.map +1 -1
- package/build/relations/OneToManyCollection.js +4 -3
- package/build/relations/OneToManyCollection.js.map +1 -1
- package/build/relations/OneToManyLargeCollection.cjs +3 -3
- package/build/relations/OneToManyLargeCollection.js +3 -3
- package/build/relations/OneToOneReference.cjs +6 -5
- package/build/relations/OneToOneReference.cjs.map +1 -1
- package/build/relations/OneToOneReference.d.cts.map +1 -1
- package/build/relations/OneToOneReference.d.mts.map +1 -1
- package/build/relations/OneToOneReference.js +6 -5
- package/build/relations/OneToOneReference.js.map +1 -1
- package/build/relations/PolymorphicReference.cjs +7 -6
- package/build/relations/PolymorphicReference.cjs.map +1 -1
- package/build/relations/PolymorphicReference.d.cts.map +1 -1
- package/build/relations/PolymorphicReference.d.mts.map +1 -1
- package/build/relations/PolymorphicReference.js +7 -6
- package/build/relations/PolymorphicReference.js.map +1 -1
- package/build/relations/ReactiveField.cjs +3 -3
- package/build/relations/ReactiveField.js +3 -3
- package/build/relations/ReactiveGetter.cjs +1 -1
- package/build/relations/ReactiveGetter.js +1 -1
- package/build/relations/ReactiveManyToMany.cjs +5 -4
- package/build/relations/ReactiveManyToMany.cjs.map +1 -1
- package/build/relations/ReactiveManyToMany.d.cts.map +1 -1
- package/build/relations/ReactiveManyToMany.d.mts.map +1 -1
- package/build/relations/ReactiveManyToMany.js +5 -4
- package/build/relations/ReactiveManyToMany.js.map +1 -1
- package/build/relations/ReactiveManyToManyOtherSide.cjs +3 -3
- package/build/relations/ReactiveManyToManyOtherSide.js +3 -3
- package/build/relations/ReactiveReference.cjs +8 -7
- package/build/relations/ReactiveReference.cjs.map +1 -1
- package/build/relations/ReactiveReference.d.cts.map +1 -1
- package/build/relations/ReactiveReference.d.mts.map +1 -1
- package/build/relations/ReactiveReference.js +8 -7
- package/build/relations/ReactiveReference.js.map +1 -1
- package/build/relations/RecursiveCollection.cjs +3 -3
- package/build/relations/RecursiveCollection.js +3 -3
- package/build/relations/Reference.cjs +1 -1
- package/build/relations/Reference.js +1 -1
- package/build/relations/hasAsyncMethod.cjs +1 -1
- package/build/relations/hasAsyncMethod.js +1 -1
- package/build/relations/hasManyDerived.cjs +1 -1
- package/build/relations/hasManyDerived.js +1 -1
- package/build/relations/hasOneDerived.cjs +2 -2
- package/build/relations/hasOneDerived.js +2 -2
- package/build/relations/hasProperty.cjs +2 -2
- package/build/relations/hasProperty.js +2 -2
- package/build/relations/index.cjs +13 -13
- package/build/relations/index.js +13 -13
- package/build/relations/isCascadeDelete.cjs +11 -0
- package/build/relations/isCascadeDelete.cjs.map +1 -0
- package/build/relations/isCascadeDelete.d.cts +7 -0
- package/build/relations/isCascadeDelete.d.cts.map +1 -0
- package/build/relations/isCascadeDelete.d.mts +7 -0
- package/build/relations/isCascadeDelete.d.mts.map +1 -0
- package/build/relations/isCascadeDelete.js +10 -0
- package/build/relations/isCascadeDelete.js.map +1 -0
- package/build/resurrection.cjs +1 -1
- package/build/resurrection.js +1 -1
- package/build/rules.cjs +4 -4
- package/build/rules.js +4 -4
- package/build/serde.cjs +1 -1
- package/build/serde.js +1 -1
- package/build/unnest.cjs +0 -1
- package/build/unnest.cjs.map +1 -1
- package/build/unnest.d.cts +1 -1
- package/build/unnest.d.mts +1 -1
- package/build/unnest.js +0 -1
- package/build/unnest.js.map +1 -1
- package/build/upsert.cjs +3 -3
- package/build/upsert.js +3 -3
- package/build/utils.cjs +1 -2
- package/build/utils.cjs.map +1 -1
- package/build/utils.d.cts +1 -1
- package/build/utils.d.mts +1 -1
- package/build/utils.js +1 -2
- package/build/utils.js.map +1 -1
- package/build/withLoaded.cjs +3 -3
- package/build/withLoaded.js +3 -3
- package/package.json +2 -2
- package/build/AliasAssigner.cjs.map +0 -1
- package/build/AliasAssigner.d.cts.map +0 -1
- package/build/AliasAssigner.d.mts.map +0 -1
- package/build/AliasAssigner.js.map +0 -1
- package/build/Aliases.cjs.map +0 -1
- package/build/Aliases.d.cts.map +0 -1
- package/build/Aliases.d.mts.map +0 -1
- package/build/Aliases.js.map +0 -1
- package/build/ConditionBuilder.cjs.map +0 -1
- package/build/ConditionBuilder.d.cts.map +0 -1
- package/build/ConditionBuilder.d.mts.map +0 -1
- package/build/ConditionBuilder.js.map +0 -1
- package/build/DeferredAlias.cjs.map +0 -1
- package/build/DeferredAlias.d.cts.map +0 -1
- package/build/DeferredAlias.d.mts.map +0 -1
- package/build/DeferredAlias.js.map +0 -1
- package/build/EntityFilter.cjs.map +0 -1
- package/build/EntityFilter.d.cts.map +0 -1
- package/build/EntityFilter.d.mts.map +0 -1
- package/build/EntityFilter.js.map +0 -1
- package/build/EntityGraphQLFilter.cjs.map +0 -1
- package/build/EntityGraphQLFilter.d.cts.map +0 -1
- package/build/EntityGraphQLFilter.d.mts.map +0 -1
- package/build/EntityGraphQLFilter.js.map +0 -1
- package/build/Expr.cjs.map +0 -1
- package/build/Expr.d.cts.map +0 -1
- package/build/Expr.d.mts.map +0 -1
- package/build/Expr.js.map +0 -1
- package/build/QueryParser.cjs.map +0 -1
- package/build/QueryParser.collectionJoins.cjs.map +0 -1
- package/build/QueryParser.collectionJoins.d.cts.map +0 -1
- package/build/QueryParser.collectionJoins.d.mts.map +0 -1
- package/build/QueryParser.collectionJoins.js.map +0 -1
- package/build/QueryParser.d.cts.map +0 -1
- package/build/QueryParser.d.mts.map +0 -1
- package/build/QueryParser.js.map +0 -1
- package/build/QueryParser.pruning.cjs.map +0 -1
- package/build/QueryParser.pruning.d.cts +0 -10
- package/build/QueryParser.pruning.d.cts.map +0 -1
- package/build/QueryParser.pruning.d.mts +0 -10
- package/build/QueryParser.pruning.d.mts.map +0 -1
- package/build/QueryParser.pruning.js.map +0 -1
- package/build/QueryVisitor.cjs.map +0 -1
- package/build/QueryVisitor.d.cts.map +0 -1
- package/build/QueryVisitor.d.mts.map +0 -1
- package/build/QueryVisitor.js.map +0 -1
- package/build/Tables.cjs.map +0 -1
- package/build/Tables.d.cts.map +0 -1
- package/build/Tables.d.mts.map +0 -1
- package/build/Tables.js.map +0 -1
- package/build/conditions.cjs.map +0 -1
- package/build/conditions.d.cts.map +0 -1
- package/build/conditions.d.mts.map +0 -1
- package/build/conditions.js.map +0 -1
- package/build/drivers/buildRawQuery.cjs.map +0 -1
- package/build/drivers/buildRawQuery.d.cts.map +0 -1
- package/build/drivers/buildRawQuery.d.mts.map +0 -1
- package/build/drivers/buildRawQuery.js.map +0 -1
- package/build/drivers/buildUtils.cjs.map +0 -1
- package/build/drivers/buildUtils.d.cts.map +0 -1
- package/build/drivers/buildUtils.d.mts.map +0 -1
- package/build/drivers/buildUtils.js.map +0 -1
- package/build/execute.cjs.map +0 -1
- package/build/execute.d.cts.map +0 -1
- package/build/execute.d.mts.map +0 -1
- package/build/execute.js.map +0 -1
- package/build/expressions/arrayAgg.cjs.map +0 -1
- package/build/expressions/arrayAgg.d.cts.map +0 -1
- package/build/expressions/arrayAgg.d.mts.map +0 -1
- package/build/expressions/arrayAgg.js.map +0 -1
- package/build/expressions/case.cjs.map +0 -1
- package/build/expressions/case.d.cts.map +0 -1
- package/build/expressions/case.d.mts.map +0 -1
- package/build/expressions/case.js.map +0 -1
- package/build/expressions/coalesce.cjs +0 -25
- package/build/expressions/coalesce.cjs.map +0 -1
- package/build/expressions/coalesce.d.cts.map +0 -1
- package/build/expressions/coalesce.d.mts.map +0 -1
- package/build/expressions/coalesce.js.map +0 -1
- package/build/expressions/codecs.cjs.map +0 -1
- package/build/expressions/codecs.d.cts.map +0 -1
- package/build/expressions/codecs.d.mts.map +0 -1
- package/build/expressions/codecs.js.map +0 -1
- package/build/expressions/expression.cjs +0 -102
- package/build/expressions/expression.cjs.map +0 -1
- package/build/expressions/expression.d.cts.map +0 -1
- package/build/expressions/expression.d.mts.map +0 -1
- package/build/expressions/expression.js.map +0 -1
- package/build/expressions/greatest.cjs +0 -25
- package/build/expressions/greatest.cjs.map +0 -1
- package/build/expressions/greatest.d.cts.map +0 -1
- package/build/expressions/greatest.d.mts.map +0 -1
- package/build/expressions/greatest.js.map +0 -1
- package/build/expressions/least.cjs +0 -25
- package/build/expressions/least.cjs.map +0 -1
- package/build/expressions/least.d.cts.map +0 -1
- package/build/expressions/least.d.mts.map +0 -1
- package/build/expressions/least.js.map +0 -1
- package/build/expressions/nullIf.cjs.map +0 -1
- package/build/expressions/nullIf.d.cts.map +0 -1
- package/build/expressions/nullIf.d.mts.map +0 -1
- package/build/expressions/nullIf.js.map +0 -1
- package/build/expressions/parseExpression.cjs.map +0 -1
- package/build/expressions/parseExpression.d.cts.map +0 -1
- package/build/expressions/parseExpression.d.mts.map +0 -1
- package/build/expressions/parseExpression.js.map +0 -1
- package/build/expressions/types.d.cts.map +0 -1
- package/build/expressions/types.d.mts.map +0 -1
- package/build/keywords.cjs.map +0 -1
- package/build/keywords.d.cts.map +0 -1
- package/build/keywords.d.mts.map +0 -1
- package/build/keywords.js.map +0 -1
- package/build/query.cjs.map +0 -1
- package/build/query.d.cts.map +0 -1
- package/build/query.d.mts.map +0 -1
- package/build/query.js.map +0 -1
- package/build/scopes.cjs.map +0 -1
- package/build/scopes.d.cts.map +0 -1
- package/build/scopes.d.mts.map +0 -1
- package/build/scopes.js.map +0 -1
- package/build/skipCondition.cjs.map +0 -1
- package/build/skipCondition.js.map +0 -1
- /package/build/{expressions → queries/sql/expressions}/types.cjs +0 -0
- /package/build/{expressions → queries/sql/expressions}/types.js +0 -0
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryParser.collectionJoins.js","names":[],"sources":["../src/QueryParser.collectionJoins.ts"],"sourcesContent":["import { pruneUnusedJoins, selectReferencesAlias } from \"./QueryParser.pruning.ts\";\nimport {\n type ExistsCondition,\n type JoinTable,\n type ParsedExpressionCondition,\n type ParsedExpressionFilter,\n type ParsedFindQuery,\n type PrimaryTable,\n type RawCondition,\n maybeAddIdNotNulls,\n parseAlias,\n} from \"./QueryParser.ts\";\nimport { assertNever } from \"./utils.ts\";\n\n/** A collection root plus every join nested under it, i.e. `books b` with `book_reviews br`. */\ninterface CollectionRoot {\n /** The top-level collection join that becomes the EXISTS FROM table, i.e. `books b`. */\n table: JoinTable;\n /** Every alias in this collection subtree, i.e. `b` and `br` for `authors -> books -> reviews`. */\n aliases: Set<string>;\n /** Every join table in this collection subtree, i.e. `att` and `t` for an m2m tag filter. */\n joinTables: JoinTable[];\n}\n\n/**\n * Rewrites eligible logical collection LEFT JOINs into EXISTS after plugins have mutated the AST.\n *\n * QueryParser intentionally leaves collection filters as ordinary joins so `beforeFind` plugins see\n * stabler/simpler input than \"sometimes JOINs / sometimes EXISTS\".\n *\n * This pass runs after plugins and before SQL rendering:\n *\n * 1. `rewriteCollectionJoins` finds top-level collection joins and moves conditions that reference only\n * that subtree into a correlated EXISTS subquery. I.e. `{ books: { title: \"b1\" } }` becomes\n * `EXISTS (SELECT 1 FROM books b WHERE a.id = b.author_id AND b.title = 'b1')`.\n * 2. The same helper recurses into the generated subquery, so nested collections become nested EXISTS clauses.\n * I.e. `{ books: { reviews: { rating: 5 } } }` becomes EXISTS(books WHERE EXISTS(reviews)).\n * 3. Conditions that cannot be safely moved stay as LEFT JOINs. I.e. `OR(b.title = 'x', a.first_name = 'x')`\n * needs both aliases in one SQL scope, so `b` remains a join instead of becoming an EXISTS.\n * 4. Remaining fanout LEFT JOIN roots are rejected unless `allowMultipleLeftJoins` is set,\n * because they can produce cross-product row explosions.\n * 5. Finally, `maybeAddIdNotNulls` and `pruneUnusedJoins` clean up the joins that remain.\n */\nexport function optimizeCollectionJoins(\n query: ParsedFindQuery,\n opts: {\n allowMultipleLeftJoins?: boolean;\n optimizeJoinsToExists?: boolean;\n pruneJoins?: boolean;\n keepAliases?: string[];\n } = {},\n): void {\n const { allowMultipleLeftJoins = false, optimizeJoinsToExists = true, pruneJoins = true, keepAliases = [] } = opts;\n for (const table of query.tables) {\n // I.e. batched find/count queries wrap the real query in a LATERAL subquery; optimize that inner query too,\n // but let the outer query decide final pruning so it can keep the lateral alias itself.\n if (table.join === \"lateral\") optimizeCollectionJoins(table.query, { ...opts, pruneJoins: false });\n }\n if (optimizeJoinsToExists) rewriteCollectionJoins(query, keepAliases);\n\n // I.e. collection LEFT JOINs now fall into three buckets:\n // 1. local real filters, like `{ books: { title: \"b1\" } }`, were rewritten to EXISTS above;\n // 2. no local real filters, like `{ books: {}, comments: {} }`, are safe because pruning will remove them;\n // 3. blocked real filters, like cross-scope ORs, must stay as LEFT JOINs and can multiply rows.\n // Only the third bucket should trip the fanout guard.\n const fanoutLeftJoinAliases = getCollectionRoots(query)\n .filter((root) => conditionBlocksExistsRewrite(query.condition, root.aliases))\n .map((root) => root.table.alias);\n if (optimizeJoinsToExists && !allowMultipleLeftJoins && fanoutLeftJoinAliases.length > 1) {\n throw new Error(\n `em.find would issue multiple LEFT JOINs across collection relations (${fanoutLeftJoinAliases.join(\n \", \",\n )}); pass allowMultipleLeftJoins: true if this fanout is intentional`,\n );\n }\n\n if (query.tables.some((t) => t.join === \"outer\")) {\n // I.e. preserve legacy LEFT JOIN null semantics for any joins that could not become EXISTS.\n maybeAddIdNotNulls(query);\n }\n if (pruneJoins) {\n // I.e. remove logical collection joins that were replaced by EXISTS and any joins only needed before plugin edits.\n pruneUnusedJoins(query, keepAliases);\n }\n}\n\n/**\n * Rewrites root-level collection join subtrees into EXISTS when their conditions are locally scoped.\n *\n * I.e. for `authors a -> books b -> book_reviews br`, `b` is the collection root and `br` is part of its subtree.\n */\nfunction rewriteCollectionJoins(query: ParsedFindQuery, keepAliases: string[] = []): void {\n const roots = getCollectionRoots(query);\n if (query.condition) rewriteSiblingOrExpression(query, query.condition, roots, keepAliases);\n for (const root of roots) {\n if (queryReferencesAliasesOutsideConditions(query, root.aliases, keepAliases)) continue;\n if (conditionHasCrossScopeReference(query.condition, root.aliases)) continue;\n // I.e. move `b.title = 'x'` and `(br.rating = 5 OR br.rating = 4)`, but not `b.title = 'x' OR a.first_name = 'x'`.\n const moved = query.condition ? removeLocallyScopedConditions(query.condition, root.aliases) : [];\n if (moved.length === 0) continue;\n const exists = createExistsCondition(query, root, moved);\n if (!exists) {\n addConditions(query, moved);\n continue;\n }\n addConditions(query, [exists]);\n // I.e. after adding EXISTS, remove `books b` and its children from the outer FROM list.\n query.tables = query.tables.filter((t) => !root.aliases.has(t.alias));\n }\n removeEmptyExpressions(query.condition);\n}\n\n/** Rewrites eligible sibling collection ORs while preserving outer/mixed-scope ORs as joins. */\nfunction rewriteSiblingOrExpression(\n query: ParsedFindQuery,\n condition: ParsedExpressionCondition,\n roots: CollectionRoot[],\n keepAliases: string[],\n): void {\n if (condition.kind !== \"exp\") return;\n if (condition.op === \"or\" && rewriteSiblingOrExpressionChildren(query, condition, roots, keepAliases)) return;\n if (condition.op === \"and\") {\n for (const child of condition.conditions) rewriteSiblingOrExpression(query, child, roots, keepAliases);\n }\n}\n\n/** Returns true when OR branches that are scoped to collection subtrees became EXISTS conditions. */\nfunction rewriteSiblingOrExpressionChildren(\n query: ParsedFindQuery,\n exp: ParsedExpressionFilter,\n roots: CollectionRoot[],\n keepAliases: string[],\n): boolean {\n const matches: { collectionRoot: CollectionRoot; condition: ParsedExpressionCondition }[] = [];\n const usedAliases = new Set<string>();\n const usedRoots = new Set<string>();\n let hasAntiJoinBranch = false;\n for (const condition of exp.conditions) {\n if (!isRealCondition(condition)) return false;\n const match = roots.find((root) => conditionReferencesOnlyAliases(condition, root.aliases));\n if (!match) {\n const found = conditionAliases(condition);\n // I.e. `a.first_name = 'x'` can stay in the OR while `b.title = 'x'` becomes EXISTS, but\n // `a.first_name = 'x' AND b.title = 'x'` must stay joined because one branch spans both scopes.\n if (roots.some((root) => hasAnyAlias(found, root.aliases))) return false;\n continue;\n }\n matches.push({ collectionRoot: match, condition });\n usedRoots.add(match.table.alias);\n hasAntiJoinBranch ||= isCollectionAntiJoin(condition, match);\n for (const alias of match.aliases) usedAliases.add(alias);\n }\n if (matches.length === 0) return false;\n // I.e. rewrite true sibling collection ORs like `b.id IS NOT NULL OR c.id IS NOT NULL`, and same-root\n // anti-join ORs like `b.id IS NULL OR br.rating = 5` that need `b.id IS NULL` to become `NOT EXISTS`.\n // skip positive-only single-root ORs, i.e. ORs with no `b.id IS NULL` anti-join branch like\n // `b.title = 'x' OR br.rating = 5`; mixed ordinary/collection ORs like `a.first_name = 'x' OR b.title = 'x'`\n // are safe because only the collection branch is replaced. Aliases are also filtered elsewhere like\n // `b.order = 1 AND (b.title = 'x' OR c.text = 'x')`, and aliases that must stay projected/sorted like\n // `SELECT b.title` or `ORDER BY b.title`.\n if (\n (matches.length === exp.conditions.length && usedRoots.size < 2 && !hasAntiJoinBranch) ||\n conditionReferencesAliasesOutside(query.condition, exp, usedAliases) ||\n queryReferencesAliasesOutsideConditions(query, usedAliases, keepAliases)\n ) {\n return false;\n }\n\n const existsConditions = new Map<ParsedExpressionCondition, ExistsCondition>();\n for (const match of matches) {\n const exists = createExistsCondition(query, match.collectionRoot, [match.condition]);\n if (!exists) return false;\n existsConditions.set(match.condition, exists);\n }\n exp.conditions = exp.conditions.map((condition) => existsConditions.get(condition) ?? condition);\n // I.e. leave the collection joins in place for now; pruning removes them after all rewrites.\n return true;\n}\n\n/** Creates an EXISTS/NOT EXISTS condition for moved collection filters, or undefined when a LEFT JOIN must stay. */\nfunction createExistsCondition(\n query: ParsedFindQuery,\n collectionRoot: CollectionRoot,\n moved: ParsedExpressionCondition[],\n): ExistsCondition | undefined {\n const root = collectionRoot.table;\n const hasOnlyAntiJoin = moved.length === 1 && isCollectionAntiJoin(moved[0], collectionRoot);\n if (!hasOnlyAntiJoin && !moved.some(isRealCondition)) {\n // I.e. only soft-delete/STI conditions moved; don't create an EXISTS that changes nothing.\n return undefined;\n }\n if (!hasOnlyAntiJoin && moved.some((c) => conditionContainsCollectionAntiJoin(c, collectionRoot))) {\n // I.e. `b.id IS NULL OR br.rating = 5` is not a pure anti-join; leave it as a LEFT JOIN for SQL semantics.\n return undefined;\n }\n\n // I.e. `rpm` may correlate through `_pp_version.id = rpm.ready_plan_version_id`, so pruning must keep\n // `_pp_version` even when the collection metadata's parent alias is only `pp`.\n const correlationAliases = joinDependencies(root);\n const correlation: RawCondition = {\n kind: \"raw\",\n aliases: [root.alias, ...correlationAliases],\n condition: `${root.col1} = ${root.col2}`,\n bindings: [],\n pruneable: false,\n };\n // I.e. a pure `b.id IS NULL` anti-join becomes `NOT EXISTS (SELECT 1 FROM books b WHERE a.id = b.author_id)`.\n const conditions = hasOnlyAntiJoin ? [correlation] : [correlation, ...moved];\n const subquery: ParsedFindQuery = {\n selects: [\"1\"],\n tables: query.tables\n .filter((t) => (hasOnlyAntiJoin ? t.alias === root.alias : collectionRoot.aliases.has(t.alias)))\n .map((t) => {\n // I.e. the collection root becomes the subquery's FROM table; children remain joins off that root.\n if (t.alias === root.alias) return { join: \"primary\", alias: t.alias, table: t.table } satisfies PrimaryTable;\n // I.e. preserve nullable paths like `LEFT JOIN p ... LEFT JOIN sp ... WHERE p.id = 1 OR sp.id = 1`; forcing\n // children to INNER JOIN would require every optional branch to exist before the OR can match any branch.\n if (t.join === \"outer\") return { ...t, distinct: false };\n return t;\n }),\n condition: { kind: \"exp\", op: \"and\", conditions },\n orderBys: [],\n };\n // I.e. nested `books.reviews` first creates an EXISTS for books, then this recursive call creates EXISTS for reviews.\n rewriteCollectionJoins(subquery);\n return {\n kind: \"exists\",\n negate: hasOnlyAntiJoin,\n subquery,\n outerAliases: correlationAliases,\n };\n}\n\n/** Appends conditions to the top-level expression, creating an AND wrapper when needed. */\nfunction addConditions(query: ParsedFindQuery, conditions: ParsedExpressionCondition[]): void {\n query.condition ??= { kind: \"exp\", op: \"and\", conditions: [] };\n query.condition.conditions.push(...conditions);\n}\n\n/** Returns top-level collection roots with their full join subtrees. */\nfunction getCollectionRoots(query: ParsedFindQuery): CollectionRoot[] {\n return getTopLevelCollectionRoots(query).map((table) => {\n const aliases = collectJoinSubtreeAliases(query, table.alias);\n return {\n table,\n aliases,\n joinTables: query.tables.filter((t): t is JoinTable => isJoinTable(t) && aliases.has(t.alias)),\n };\n });\n}\n\n/** Returns top-level collection roots, i.e. `books b` but not nested `book_reviews br`. */\nfunction getTopLevelCollectionRoots(query: ParsedFindQuery): JoinTable[] {\n // I.e. if `books b` is nested under another collection root, the parent pass should absorb it; don't rewrite it here.\n const joinTables = query.tables.filter(isJoinTable);\n const collectionAliases = new Set(joinTables.flatMap((t) => (t.collection ? [t.alias] : [])));\n return joinTables.filter(\n (t) => t.collection?.rootAlias === t.alias && !collectionAliases.has(t.collection.parentAlias),\n );\n}\n\n/** Returns true if a remaining real condition prevents this subtree from becoming EXISTS, i.e. a cross-scope OR. */\nfunction conditionBlocksExistsRewrite(condition: ParsedExpressionCondition | undefined, aliases: Set<string>): boolean {\n if (!condition || !isRealCondition(condition)) return false;\n if (condition.kind === \"exp\" && condition.op === \"and\") {\n return condition.conditions.some((c) => conditionBlocksExistsRewrite(c, aliases));\n }\n return conditionReferencesAnyAlias(condition, aliases);\n}\n\n/** Collects a collection root and all joins that depend on it, i.e. `b -> br -> c`. */\nfunction collectJoinSubtreeAliases(query: ParsedFindQuery, rootAlias: string): Set<string> {\n const aliases = new Set([rootAlias]);\n let changed = true;\n while (changed) {\n changed = false;\n for (const table of query.tables) {\n if (!isJoinTable(table)) continue;\n // I.e. `book_reviews br ON b.id = br.book_id` depends on `b`, so `br` belongs in the `b` subtree.\n if (!aliases.has(table.alias) && joinReferencesAnyAlias(table, aliases)) {\n aliases.add(table.alias);\n changed = true;\n }\n }\n }\n return aliases;\n}\n\n/**\n * Removes AND-safe conditions whose aliases all live inside one collection subtree.\n *\n * I.e. in `a.age = 1 AND b.title = 'x'`, only `b.title = 'x'` moves. In `b.title = 'x' OR br.rating = 5`,\n * the whole OR moves only if every alias is inside the same subtree.\n */\nfunction removeLocallyScopedConditions(exp: ParsedExpressionFilter, aliases: Set<string>): ParsedExpressionCondition[] {\n if (exp.op === \"or\") {\n // I.e. OR cannot be split across scopes; either move the whole OR into the EXISTS, or leave it outside.\n if (!conditionReferencesOnlyAliases(exp, aliases)) return [];\n const moved = { ...exp, conditions: [...exp.conditions] } satisfies ParsedExpressionFilter;\n exp.conditions = [];\n return [moved];\n }\n const moved: ParsedExpressionCondition[] = [];\n for (let i = exp.conditions.length - 1; i >= 0; i--) {\n const condition = exp.conditions[i];\n if (condition.kind === \"exp\" && condition.op === \"and\") {\n // I.e. flatten nested AND movement so `a AND (b AND br)` can still move `b` and `br` into the EXISTS.\n moved.push(...removeLocallyScopedConditions(condition, aliases));\n if (condition.conditions.length === 0) exp.conditions.splice(i, 1);\n } else if (conditionReferencesOnlyAliases(condition, aliases)) {\n // I.e. move `b.title = 'x'` out of the parent AND and into the collection EXISTS.\n moved.unshift(condition);\n exp.conditions.splice(i, 1);\n }\n }\n return moved;\n}\n\n/** Returns true when a condition references at least one alias and all aliases are in `aliases`, i.e. only `b`/`br`. */\nfunction conditionReferencesOnlyAliases(condition: ParsedExpressionCondition, aliases: Set<string>): boolean {\n const found = conditionAliases(condition);\n return found.size > 0 && [...found].every((alias) => aliases.has(alias));\n}\n\n/** Returns true when `aliases` are referenced by a real condition other than the targeted OR expression. */\nfunction conditionReferencesAliasesOutside(\n condition: ParsedExpressionCondition | undefined,\n target: ParsedExpressionCondition,\n aliases: Set<string>,\n): boolean {\n if (!condition || condition === target || !isRealCondition(condition)) return false;\n if (condition.kind === \"exp\") {\n return condition.conditions.some((child) => conditionReferencesAliasesOutside(child, target, aliases));\n }\n return conditionReferencesAnyAlias(condition, aliases);\n}\n\n/** Returns true when selected/ordered aliases would force these joins to remain in the outer query. */\nfunction queryReferencesAliasesOutsideConditions(\n query: ParsedFindQuery,\n aliases: Set<string>,\n keepAliases: string[],\n): boolean {\n const requiredAliases = queryRequiredAliasesOutsideConditions(query, keepAliases);\n // I.e. if `array_agg(br.rating)` requires `br`, then `b` is required too because `br` joins through `b`; don't\n // move `b` under EXISTS just because the select references only its child alias directly.\n return hasAnyAlias(requiredAliases, aliases);\n}\n\n/**\n * Returns aliases needed by SELECT/GROUP/ORDER plus their join dependencies.\n *\n * I.e. `array_agg(br.rating)` requires `br`, and then `br` requires `b` because it joins through `b`.\n */\nfunction queryRequiredAliasesOutsideConditions(query: ParsedFindQuery, keepAliases: string[]): Set<string> {\n const required = new Set<string>();\n for (const alias of keepAliases) required.add(alias);\n for (const orderBy of query.orderBys) required.add(orderBy.alias);\n for (const groupBy of query.groupBys ?? []) {\n if (\"expression\" in groupBy) {\n addSelectAliases(query, required, groupBy.expression);\n } else {\n required.add(groupBy.alias);\n }\n }\n for (const select of query.selects) {\n if (typeof select === \"string\") {\n addSelectAliases(query, required, select);\n } else if (\"aliases\" in select) {\n for (const alias of select.aliases) required.add(alias);\n addSelectAliases(query, required, select.sql);\n }\n }\n\n const todo = [...required];\n while (todo.length > 0) {\n const alias = todo.pop()!;\n const table = query.tables.find((t) => t.alias === alias);\n if (!table || !isJoinTable(table)) continue;\n for (const dependency of joinDependencies(table)) {\n if (!required.has(dependency)) {\n required.add(dependency);\n todo.push(dependency);\n }\n }\n }\n return required;\n}\n\n/** Adds aliases referenced by raw select SQL, i.e. `array_agg(br.rating)` requires `br`. */\nfunction addSelectAliases(query: ParsedFindQuery, required: Set<string>, select: string): void {\n for (const table of query.tables) {\n if (selectReferencesAlias(select, table.alias)) required.add(table.alias);\n }\n}\n\n/** Returns the aliases needed to evaluate a join's ON clause, excluding the joined alias itself. */\nfunction joinDependencies(table: JoinTable): string[] {\n return [parseAlias(table.col1), parseAlias(table.col2)].filter((alias) => alias !== table.alias);\n}\n\n/** Returns true when a condition references this subtree and another scope, i.e. `b.title = 'x' OR c.text = 'x'`. */\nfunction conditionHasCrossScopeReference(\n condition: ParsedExpressionCondition | undefined,\n aliases: Set<string>,\n): boolean {\n if (!condition || !isRealCondition(condition)) return false;\n if (condition.kind === \"exp\" && condition.op === \"and\") {\n return condition.conditions.some((child) => conditionHasCrossScopeReference(child, aliases));\n }\n const found = conditionAliases(condition);\n return hasAnyAlias(found, aliases) && ![...found].every((alias) => aliases.has(alias));\n}\n\n/** Returns true when a condition references any alias in `aliases`, i.e. `b` in `b.title = c.text`. */\nfunction conditionReferencesAnyAlias(condition: ParsedExpressionCondition, aliases: Set<string>): boolean {\n return hasAnyAlias(conditionAliases(condition), aliases);\n}\n\n/** Returns true when `table` is an ordinary SQL join. */\nfunction isJoinTable(table: ParsedFindQuery[\"tables\"][number]): table is JoinTable {\n return table.join === \"inner\" || table.join === \"outer\";\n}\n\n/** Returns true when a join's ON clause references any alias in `aliases`. */\nfunction joinReferencesAnyAlias(table: JoinTable, aliases: Set<string>): boolean {\n return joinDependencies(table).some((alias) => aliases.has(alias));\n}\n\n/** Returns true when two alias sets overlap. */\nfunction hasAnyAlias(found: Set<string>, aliases: Set<string>): boolean {\n return [...found].some((alias) => aliases.has(alias));\n}\n\n/** Returns true for collection anti-joins, i.e. `b.id IS NULL` or m2m target `t.id IS NULL` for root `att`. */\nfunction isCollectionAntiJoin(condition: ParsedExpressionCondition, root: CollectionRoot): boolean {\n return collectionAntiJoinAliases(root).some((alias) => isAliasIdNull(condition, alias));\n}\n\n/** Returns aliases whose `id IS NULL` means the collection root has no matching row. */\nfunction collectionAntiJoinAliases(root: CollectionRoot): string[] {\n return [...root.aliases].filter((alias) => {\n if (alias === root.table.alias) return true;\n const table = rootTable(root, alias);\n // I.e. for m2m `authors -> authors_to_tags att -> tags t`, `t.id IS NULL` means no tag membership.\n return table?.collection?.rootAlias === root.table.alias;\n });\n}\n\n/** Returns a join table from a collection subtree by alias. */\nfunction rootTable(root: CollectionRoot, alias: string): JoinTable | undefined {\n return root.joinTables.find((table) => table.alias === alias);\n}\n\n/** Returns true for `alias.id IS NULL`, i.e. the parse shape for `{ books: { id: null } }`. */\nfunction isAliasIdNull(condition: ParsedExpressionCondition, alias: string): boolean {\n return (\n condition.kind === \"column\" &&\n condition.alias === alias &&\n condition.column === \"id\" &&\n condition.cond.kind === \"is-null\"\n );\n}\n\n/** Returns true when a condition tree contains a collection anti-join branch inside an OR. */\nfunction conditionContainsCollectionAntiJoin(condition: ParsedExpressionCondition, root: CollectionRoot): boolean {\n if (isCollectionAntiJoin(condition, root)) return true;\n if (condition.kind === \"exp\") return condition.conditions.some((c) => conditionContainsCollectionAntiJoin(c, root));\n return false;\n}\n\n/** Removes empty expression wrappers left behind by condition movement, i.e. `AND []` after all children moved. */\nfunction removeEmptyExpressions(exp: ParsedExpressionFilter | undefined): void {\n if (!exp) return;\n for (let i = exp.conditions.length - 1; i >= 0; i--) {\n const condition = exp.conditions[i];\n if (condition.kind === \"exp\") {\n removeEmptyExpressions(condition);\n if (condition.conditions.length === 0) exp.conditions.splice(i, 1);\n }\n }\n}\n\n/** Returns true if a condition must be preserved to maintain query semantics, i.e. user filters vs soft-delete filters. */\nfunction isRealCondition(condition: ParsedExpressionCondition): boolean {\n if (condition.kind === \"column\" || condition.kind === \"raw\") {\n return !condition.pruneable;\n } else if (condition.kind === \"exists\") {\n return true;\n } else if (condition.kind === \"exp\") {\n return condition.conditions.some(isRealCondition);\n } else {\n assertNever(condition);\n }\n}\n\n/** Returns all aliases referenced by a condition, i.e. `b` and `a` in an OR. */\nfunction conditionAliases(condition: ParsedExpressionCondition): Set<string> {\n const aliases = new Set<string>();\n collectAllAliases(condition, aliases);\n return aliases;\n}\n\n/** Collects all aliases referenced by a condition, including inside nested expressions, i.e. `b` and `a` in an OR. */\nfunction collectAllAliases(cond: ParsedExpressionCondition, out: Set<string>): void {\n if (cond.kind === \"column\") {\n out.add(cond.alias);\n } else if (cond.kind === \"raw\") {\n for (const a of cond.aliases) out.add(a);\n } else if (cond.kind === \"exp\") {\n for (const c of cond.conditions) collectAllAliases(c, out);\n } else if (cond.kind === \"exists\") {\n // I.e. an EXISTS subquery is already a scoped unit; outer movement decisions should not inspect its internals.\n } else {\n assertNever(cond);\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AA2CA,SAAgB,wBACd,OACA,OAKI,CAAC,GACC;CACN,MAAM,EAAE,yBAAyB,OAAO,wBAAwB,MAAM,aAAa,MAAM,cAAc,CAAC,MAAM;CAC9G,KAAK,MAAM,SAAS,MAAM,QAGxB,IAAI,MAAM,SAAS,WAAW,wBAAwB,MAAM,OAAO;EAAE,GAAG;EAAM,YAAY;CAAM,CAAC;CAEnG,IAAI,uBAAuB,uBAAuB,OAAO,WAAW;CAOpE,MAAM,wBAAwB,mBAAmB,KAAK,CAAC,CACpD,QAAQ,SAAS,6BAA6B,MAAM,WAAW,KAAK,OAAO,CAAC,CAAC,CAC7E,KAAK,SAAS,KAAK,MAAM,KAAK;CACjC,IAAI,yBAAyB,CAAC,0BAA0B,sBAAsB,SAAS,GACrF,MAAM,IAAI,MACR,wEAAwE,sBAAsB,KAC5F,IACF,EAAE,mEACJ;CAGF,IAAI,MAAM,OAAO,MAAM,MAAM,EAAE,SAAS,OAAO,GAE7C,mBAAmB,KAAK;CAE1B,IAAI,YAEF,iBAAiB,OAAO,WAAW;AAEvC;;;;;;AAOA,SAAS,uBAAuB,OAAwB,cAAwB,CAAC,GAAS;CACxF,MAAM,QAAQ,mBAAmB,KAAK;CACtC,IAAI,MAAM,WAAW,2BAA2B,OAAO,MAAM,WAAW,OAAO,WAAW;CAC1F,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,wCAAwC,OAAO,KAAK,SAAS,WAAW,GAAG;EAC/E,IAAI,gCAAgC,MAAM,WAAW,KAAK,OAAO,GAAG;EAEpE,MAAM,QAAQ,MAAM,YAAY,8BAA8B,MAAM,WAAW,KAAK,OAAO,IAAI,CAAC;EAChG,IAAI,MAAM,WAAW,GAAG;EACxB,MAAM,SAAS,sBAAsB,OAAO,MAAM,KAAK;EACvD,IAAI,CAAC,QAAQ;GACX,cAAc,OAAO,KAAK;GAC1B;EACF;EACA,cAAc,OAAO,CAAC,MAAM,CAAC;EAE7B,MAAM,SAAS,MAAM,OAAO,QAAQ,MAAM,CAAC,KAAK,QAAQ,IAAI,EAAE,KAAK,CAAC;CACtE;CACA,uBAAuB,MAAM,SAAS;AACxC;;AAGA,SAAS,2BACP,OACA,WACA,OACA,aACM;CACN,IAAI,UAAU,SAAS,OAAO;CAC9B,IAAI,UAAU,OAAO,QAAQ,mCAAmC,OAAO,WAAW,OAAO,WAAW,GAAG;CACvG,IAAI,UAAU,OAAO,OACnB,KAAK,MAAM,SAAS,UAAU,YAAY,2BAA2B,OAAO,OAAO,OAAO,WAAW;AAEzG;;AAGA,SAAS,mCACP,OACA,KACA,OACA,aACS;CACT,MAAM,UAAsF,CAAC;CAC7F,MAAM,8BAAc,IAAI,IAAY;CACpC,MAAM,4BAAY,IAAI,IAAY;CAClC,IAAI,oBAAoB;CACxB,KAAK,MAAM,aAAa,IAAI,YAAY;EACtC,IAAI,CAAC,gBAAgB,SAAS,GAAG,OAAO;EACxC,MAAM,QAAQ,MAAM,MAAM,SAAS,+BAA+B,WAAW,KAAK,OAAO,CAAC;EAC1F,IAAI,CAAC,OAAO;GACV,MAAM,QAAQ,iBAAiB,SAAS;GAGxC,IAAI,MAAM,MAAM,SAAS,YAAY,OAAO,KAAK,OAAO,CAAC,GAAG,OAAO;GACnE;EACF;EACA,QAAQ,KAAK;GAAE,gBAAgB;GAAO;EAAU,CAAC;EACjD,UAAU,IAAI,MAAM,MAAM,KAAK;EAC/B,sBAAsB,qBAAqB,WAAW,KAAK;EAC3D,KAAK,MAAM,SAAS,MAAM,SAAS,YAAY,IAAI,KAAK;CAC1D;CACA,IAAI,QAAQ,WAAW,GAAG,OAAO;CAQjC,IACG,QAAQ,WAAW,IAAI,WAAW,UAAU,UAAU,OAAO,KAAK,CAAC,qBACpE,kCAAkC,MAAM,WAAW,KAAK,WAAW,KACnE,wCAAwC,OAAO,aAAa,WAAW,GAEvE,OAAO;CAGT,MAAM,mCAAmB,IAAI,IAAgD;CAC7E,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,SAAS,sBAAsB,OAAO,MAAM,gBAAgB,CAAC,MAAM,SAAS,CAAC;EACnF,IAAI,CAAC,QAAQ,OAAO;EACpB,iBAAiB,IAAI,MAAM,WAAW,MAAM;CAC9C;CACA,IAAI,aAAa,IAAI,WAAW,KAAK,cAAc,iBAAiB,IAAI,SAAS,KAAK,SAAS;CAE/F,OAAO;AACT;;AAGA,SAAS,sBACP,OACA,gBACA,OAC6B;CAC7B,MAAM,OAAO,eAAe;CAC5B,MAAM,kBAAkB,MAAM,WAAW,KAAK,qBAAqB,MAAM,IAAI,cAAc;CAC3F,IAAI,CAAC,mBAAmB,CAAC,MAAM,KAAK,eAAe,GAEjD;CAEF,IAAI,CAAC,mBAAmB,MAAM,MAAM,MAAM,oCAAoC,GAAG,cAAc,CAAC,GAE9F;CAKF,MAAM,qBAAqB,iBAAiB,IAAI;CAChD,MAAM,cAA4B;EAChC,MAAM;EACN,SAAS,CAAC,KAAK,OAAO,GAAG,kBAAkB;EAC3C,WAAW,GAAG,KAAK,KAAK,KAAK,KAAK;EAClC,UAAU,CAAC;EACX,WAAW;CACb;CAEA,MAAM,aAAa,kBAAkB,CAAC,WAAW,IAAI,CAAC,aAAa,GAAG,KAAK;CAC3E,MAAM,WAA4B;EAChC,SAAS,CAAC,GAAG;EACb,QAAQ,MAAM,OACX,QAAQ,MAAO,kBAAkB,EAAE,UAAU,KAAK,QAAQ,eAAe,QAAQ,IAAI,EAAE,KAAK,CAAE,CAAC,CAC/F,KAAK,MAAM;GAEV,IAAI,EAAE,UAAU,KAAK,OAAO,OAAO;IAAE,MAAM;IAAW,OAAO,EAAE;IAAO,OAAO,EAAE;GAAM;GAGrF,IAAI,EAAE,SAAS,SAAS,OAAO;IAAE,GAAG;IAAG,UAAU;GAAM;GACvD,OAAO;EACT,CAAC;EACH,WAAW;GAAE,MAAM;GAAO,IAAI;GAAO;EAAW;EAChD,UAAU,CAAC;CACb;CAEA,uBAAuB,QAAQ;CAC/B,OAAO;EACL,MAAM;EACN,QAAQ;EACR;EACA,cAAc;CAChB;AACF;;AAGA,SAAS,cAAc,OAAwB,YAA+C;CAC5F,MAAM,cAAc;EAAE,MAAM;EAAO,IAAI;EAAO,YAAY,CAAC;CAAE;CAC7D,MAAM,UAAU,WAAW,KAAK,GAAG,UAAU;AAC/C;;AAGA,SAAS,mBAAmB,OAA0C;CACpE,OAAO,2BAA2B,KAAK,CAAC,CAAC,KAAK,UAAU;EACtD,MAAM,UAAU,0BAA0B,OAAO,MAAM,KAAK;EAC5D,OAAO;GACL;GACA;GACA,YAAY,MAAM,OAAO,QAAQ,MAAsB,YAAY,CAAC,KAAK,QAAQ,IAAI,EAAE,KAAK,CAAC;EAC/F;CACF,CAAC;AACH;;AAGA,SAAS,2BAA2B,OAAqC;CAEvE,MAAM,aAAa,MAAM,OAAO,OAAO,WAAW;CAClD,MAAM,oBAAoB,IAAI,IAAI,WAAW,SAAS,MAAO,EAAE,aAAa,CAAC,EAAE,KAAK,IAAI,CAAC,CAAE,CAAC;CAC5F,OAAO,WAAW,QACf,MAAM,EAAE,YAAY,cAAc,EAAE,SAAS,CAAC,kBAAkB,IAAI,EAAE,WAAW,WAAW,CAC/F;AACF;;AAGA,SAAS,6BAA6B,WAAkD,SAA+B;CACrH,IAAI,CAAC,aAAa,CAAC,gBAAgB,SAAS,GAAG,OAAO;CACtD,IAAI,UAAU,SAAS,SAAS,UAAU,OAAO,OAC/C,OAAO,UAAU,WAAW,MAAM,MAAM,6BAA6B,GAAG,OAAO,CAAC;CAElF,OAAO,4BAA4B,WAAW,OAAO;AACvD;;AAGA,SAAS,0BAA0B,OAAwB,WAAgC;CACzF,MAAM,0BAAU,IAAI,IAAI,CAAC,SAAS,CAAC;CACnC,IAAI,UAAU;CACd,OAAO,SAAS;EACd,UAAU;EACV,KAAK,MAAM,SAAS,MAAM,QAAQ;GAChC,IAAI,CAAC,YAAY,KAAK,GAAG;GAEzB,IAAI,CAAC,QAAQ,IAAI,MAAM,KAAK,KAAK,uBAAuB,OAAO,OAAO,GAAG;IACvE,QAAQ,IAAI,MAAM,KAAK;IACvB,UAAU;GACZ;EACF;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,8BAA8B,KAA6B,SAAmD;CACrH,IAAI,IAAI,OAAO,MAAM;EAEnB,IAAI,CAAC,+BAA+B,KAAK,OAAO,GAAG,OAAO,CAAC;EAC3D,MAAM,QAAQ;GAAE,GAAG;GAAK,YAAY,CAAC,GAAG,IAAI,UAAU;EAAE;EACxD,IAAI,aAAa,CAAC;EAClB,OAAO,CAAC,KAAK;CACf;CACA,MAAM,QAAqC,CAAC;CAC5C,KAAK,IAAI,IAAI,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;EACnD,MAAM,YAAY,IAAI,WAAW;EACjC,IAAI,UAAU,SAAS,SAAS,UAAU,OAAO,OAAO;GAEtD,MAAM,KAAK,GAAG,8BAA8B,WAAW,OAAO,CAAC;GAC/D,IAAI,UAAU,WAAW,WAAW,GAAG,IAAI,WAAW,OAAO,GAAG,CAAC;EACnE,OAAO,IAAI,+BAA+B,WAAW,OAAO,GAAG;GAE7D,MAAM,QAAQ,SAAS;GACvB,IAAI,WAAW,OAAO,GAAG,CAAC;EAC5B;CACF;CACA,OAAO;AACT;;AAGA,SAAS,+BAA+B,WAAsC,SAA+B;CAC3G,MAAM,QAAQ,iBAAiB,SAAS;CACxC,OAAO,MAAM,OAAO,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,UAAU,QAAQ,IAAI,KAAK,CAAC;AACzE;;AAGA,SAAS,kCACP,WACA,QACA,SACS;CACT,IAAI,CAAC,aAAa,cAAc,UAAU,CAAC,gBAAgB,SAAS,GAAG,OAAO;CAC9E,IAAI,UAAU,SAAS,OACrB,OAAO,UAAU,WAAW,MAAM,UAAU,kCAAkC,OAAO,QAAQ,OAAO,CAAC;CAEvG,OAAO,4BAA4B,WAAW,OAAO;AACvD;;AAGA,SAAS,wCACP,OACA,SACA,aACS;CAIT,OAAO,YAHiB,sCAAsC,OAAO,WAGpC,GAAG,OAAO;AAC7C;;;;;;AAOA,SAAS,sCAAsC,OAAwB,aAAoC;CACzG,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,aAAa,SAAS,IAAI,KAAK;CACnD,KAAK,MAAM,WAAW,MAAM,UAAU,SAAS,IAAI,QAAQ,KAAK;CAChE,KAAK,MAAM,WAAW,MAAM,YAAY,CAAC,GACvC,IAAI,gBAAgB,SAClB,iBAAiB,OAAO,UAAU,QAAQ,UAAU;MAEpD,SAAS,IAAI,QAAQ,KAAK;CAG9B,KAAK,MAAM,UAAU,MAAM,SACzB,IAAI,OAAO,WAAW,UACpB,iBAAiB,OAAO,UAAU,MAAM;MACnC,IAAI,aAAa,QAAQ;EAC9B,KAAK,MAAM,SAAS,OAAO,SAAS,SAAS,IAAI,KAAK;EACtD,iBAAiB,OAAO,UAAU,OAAO,GAAG;CAC9C;CAGF,MAAM,OAAO,CAAC,GAAG,QAAQ;CACzB,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,QAAQ,KAAK,IAAI;EACvB,MAAM,QAAQ,MAAM,OAAO,MAAM,MAAM,EAAE,UAAU,KAAK;EACxD,IAAI,CAAC,SAAS,CAAC,YAAY,KAAK,GAAG;EACnC,KAAK,MAAM,cAAc,iBAAiB,KAAK,GAC7C,IAAI,CAAC,SAAS,IAAI,UAAU,GAAG;GAC7B,SAAS,IAAI,UAAU;GACvB,KAAK,KAAK,UAAU;EACtB;CAEJ;CACA,OAAO;AACT;;AAGA,SAAS,iBAAiB,OAAwB,UAAuB,QAAsB;CAC7F,KAAK,MAAM,SAAS,MAAM,QACxB,IAAI,sBAAsB,QAAQ,MAAM,KAAK,GAAG,SAAS,IAAI,MAAM,KAAK;AAE5E;;AAGA,SAAS,iBAAiB,OAA4B;CACpD,OAAO,CAAC,WAAW,MAAM,IAAI,GAAG,WAAW,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,UAAU,UAAU,MAAM,KAAK;AACjG;;AAGA,SAAS,gCACP,WACA,SACS;CACT,IAAI,CAAC,aAAa,CAAC,gBAAgB,SAAS,GAAG,OAAO;CACtD,IAAI,UAAU,SAAS,SAAS,UAAU,OAAO,OAC/C,OAAO,UAAU,WAAW,MAAM,UAAU,gCAAgC,OAAO,OAAO,CAAC;CAE7F,MAAM,QAAQ,iBAAiB,SAAS;CACxC,OAAO,YAAY,OAAO,OAAO,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,UAAU,QAAQ,IAAI,KAAK,CAAC;AACvF;;AAGA,SAAS,4BAA4B,WAAsC,SAA+B;CACxG,OAAO,YAAY,iBAAiB,SAAS,GAAG,OAAO;AACzD;;AAGA,SAAS,YAAY,OAA8D;CACjF,OAAO,MAAM,SAAS,WAAW,MAAM,SAAS;AAClD;;AAGA,SAAS,uBAAuB,OAAkB,SAA+B;CAC/E,OAAO,iBAAiB,KAAK,CAAC,CAAC,MAAM,UAAU,QAAQ,IAAI,KAAK,CAAC;AACnE;;AAGA,SAAS,YAAY,OAAoB,SAA+B;CACtE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,UAAU,QAAQ,IAAI,KAAK,CAAC;AACtD;;AAGA,SAAS,qBAAqB,WAAsC,MAA+B;CACjG,OAAO,0BAA0B,IAAI,CAAC,CAAC,MAAM,UAAU,cAAc,WAAW,KAAK,CAAC;AACxF;;AAGA,SAAS,0BAA0B,MAAgC;CACjE,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,QAAQ,UAAU;EACzC,IAAI,UAAU,KAAK,MAAM,OAAO,OAAO;EAGvC,OAFc,UAAU,MAAM,KAEnB,CAAC,EAAE,YAAY,cAAc,KAAK,MAAM;CACrD,CAAC;AACH;;AAGA,SAAS,UAAU,MAAsB,OAAsC;CAC7E,OAAO,KAAK,WAAW,MAAM,UAAU,MAAM,UAAU,KAAK;AAC9D;;AAGA,SAAS,cAAc,WAAsC,OAAwB;CACnF,OACE,UAAU,SAAS,YACnB,UAAU,UAAU,SACpB,UAAU,WAAW,QACrB,UAAU,KAAK,SAAS;AAE5B;;AAGA,SAAS,oCAAoC,WAAsC,MAA+B;CAChH,IAAI,qBAAqB,WAAW,IAAI,GAAG,OAAO;CAClD,IAAI,UAAU,SAAS,OAAO,OAAO,UAAU,WAAW,MAAM,MAAM,oCAAoC,GAAG,IAAI,CAAC;CAClH,OAAO;AACT;;AAGA,SAAS,uBAAuB,KAA+C;CAC7E,IAAI,CAAC,KAAK;CACV,KAAK,IAAI,IAAI,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;EACnD,MAAM,YAAY,IAAI,WAAW;EACjC,IAAI,UAAU,SAAS,OAAO;GAC5B,uBAAuB,SAAS;GAChC,IAAI,UAAU,WAAW,WAAW,GAAG,IAAI,WAAW,OAAO,GAAG,CAAC;EACnE;CACF;AACF;;AAGA,SAAS,gBAAgB,WAA+C;CACtE,IAAI,UAAU,SAAS,YAAY,UAAU,SAAS,OACpD,OAAO,CAAC,UAAU;MACb,IAAI,UAAU,SAAS,UAC5B,OAAO;MACF,IAAI,UAAU,SAAS,OAC5B,OAAO,UAAU,WAAW,KAAK,eAAe;MAEhD,YAAY,SAAS;AAEzB;;AAGA,SAAS,iBAAiB,WAAmD;CAC3E,MAAM,0BAAU,IAAI,IAAY;CAChC,kBAAkB,WAAW,OAAO;CACpC,OAAO;AACT;;AAGA,SAAS,kBAAkB,MAAiC,KAAwB;CAClF,IAAI,KAAK,SAAS,UAChB,IAAI,IAAI,KAAK,KAAK;MACb,IAAI,KAAK,SAAS,OACvB,KAAK,MAAM,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC;MAClC,IAAI,KAAK,SAAS,OACvB,KAAK,MAAM,KAAK,KAAK,YAAY,kBAAkB,GAAG,GAAG;MACpD,IAAI,KAAK,SAAS,UAAU,CAEnC,OACE,YAAY,IAAI;AAEpB"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryParser.d.cts","names":[],"sources":["../src/QueryParser.ts"],"mappings":";;;;;;UAyBiB;EACf;EACA;EACA,YAAY;;;KAIF,4BAA4B,yBAAyB,kBAAkB,eAAe;UAEjF;EACf;EACA;EACA;EACA;EACA,MAAM;;;;;EAKN;;;UAIe;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;UAIe;EACf;;EAEA;;EAEA,UAAU;;EAEV;;UAMe;EACf;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;;;;;;;;;;;;;;;;;;;;;;EAsBA;;IAEE;;IAEA;;IAEA;;;;;;;;;;;;;;;;;;;;;UAsBa;EACf;;EAEA;;EAEA;;;;;;;;;;;;;UAce;;EAEf;;EAEA;IAAY;IAAoB;;;EAEhC;IAAS;IAAa;IAAa;;IAA+B;IAAa,OAAO;;;EAEtF;;;;;UAMe;EACf;EACA;;EAEA;;EAEA;;EAEA,OAAO;;EAEP;IAAa;IAAgB;;;KAGnB,cAAc,eAAe,YAAY,iBAAiB;UAErD;EACf;EACA;EACA,OAAO;;KAGG;EAAkB;EAAe;;EAAqB;;KAEtD,wBAAwB;KAC/B;EAA6B;EAAa;EAAiB;;;UAG/C;EACf,SAAS;;EAET,QAAQ;;EAER,YAAY;;EAEZ,WAAW;;EAEX,UAAU;;EAEV,OAAO;;;;;;;;iBASO,eACd,MAAM,gBACN,aACA;EACE,aAAa;EACb;EACA;EACA;EACA;EACA;EACA;IAED;;;;;;;;;;;;iBAwhBa,mBAAmB,OAAO;;iBAgC1B,WAAW;;KAKf,qBAER;EAEE;EAAc;;;iBAGJ,kBAAkB,MAAM,gBAAgB,cAAc;;iBA+GtD,gBAAgB,MAAM,gBAAgB,eAAe;EAAU;;;;;;;KAcnE,kBAAkB;EACxB;EAAY,OAAO;;EACnB;EAAY,gBAAgB;;EAC5B;EAAa,gBAAgB;;EAC7B;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAY,OAAO;;EACnB;;EACA;;EACA;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAc,OAAO;;EACrB;EAAe,OAAO;;EACtB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAgB,OAAO;;EACvB;EAAiB,OAAO;;EACxB;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAqB,gBAAgB;;EACrC;EAAiB,QAAQ,GAAG;;EAC5B;EAAwB;;EACxB;EAA2B;;;;;;;;iBAQjB,iBAAiB,GAAG,QAAQ,YAAY,UAAU,kBAAkB;;iBAqFpE,QAAQ,QAAQ,QAAQ,QAAQ,yBAAyB;;iBAoEzD,gBAAgB,OAAO,iBAAiB,MAAM,gBAAgB;iBAiB9D,iCACd,OAAO,iBACP,MAAM,gBACN,eACA;;;;;;;iBAyEc,oBAAoB,MAAM,gBAAgB;iBAqC1C,uBACd,YAAY,mBACZ,MAAM,gBACN,eACA;iBAcc,kBAAkB,MAAM,gBAAgB;iBASxC,UAAU,OAAO,mBAAmB,cAAc,aAAa,oBAAoB;;iBAiCnF,iBAAiB,MAAM,gBAAgB,gBAAgB;;iBAevD,SAAS"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryParser.d.mts","names":[],"sources":["../src/QueryParser.ts"],"mappings":";;;;;;UAyBiB;EACf;EACA;EACA,YAAY;;;KAIF,4BAA4B,yBAAyB,kBAAkB,eAAe;UAEjF;EACf;EACA;EACA;EACA;EACA,MAAM;;;;;EAKN;;;UAIe;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;UAIe;EACf;;EAEA;;EAEA,UAAU;;EAEV;;UAMe;EACf;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;;;;;;;;;;;;;;;;;;;;;;EAsBA;;IAEE;;IAEA;;IAEA;;;;;;;;;;;;;;;;;;;;;UAsBa;EACf;;EAEA;;EAEA;;;;;;;;;;;;;UAce;;EAEf;;EAEA;IAAY;IAAoB;;;EAEhC;IAAS;IAAa;IAAa;;IAA+B;IAAa,OAAO;;;EAEtF;;;;;UAMe;EACf;EACA;;EAEA;;EAEA;;EAEA,OAAO;;EAEP;IAAa;IAAgB;;;KAGnB,cAAc,eAAe,YAAY,iBAAiB;UAErD;EACf;EACA;EACA,OAAO;;KAGG;EAAkB;EAAe;;EAAqB;;KAEtD,wBAAwB;KAC/B;EAA6B;EAAa;EAAiB;;;UAG/C;EACf,SAAS;;EAET,QAAQ;;EAER,YAAY;;EAEZ,WAAW;;EAEX,UAAU;;EAEV,OAAO;;;;;;;;iBASO,eACd,MAAM,gBACN,aACA;EACE,aAAa;EACb;EACA;EACA;EACA;EACA;EACA;IAED;;;;;;;;;;;;iBAwhBa,mBAAmB,OAAO;;iBAgC1B,WAAW;;KAKf,qBAER;EAEE;EAAc;;;iBAGJ,kBAAkB,MAAM,gBAAgB,cAAc;;iBA+GtD,gBAAgB,MAAM,gBAAgB,eAAe;EAAU;;;;;;;KAcnE,kBAAkB;EACxB;EAAY,OAAO;;EACnB;EAAY,gBAAgB;;EAC5B;EAAa,gBAAgB;;EAC7B;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAY,OAAO;;EACnB;;EACA;;EACA;EAAY,OAAO;;EACnB;EAAa,OAAO;;EACpB;EAAc,OAAO;;EACrB;EAAe,OAAO;;EACtB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAe,OAAO;;EACtB;EAAgB,OAAO;;EACvB;EAAgB,OAAO;;EACvB;EAAiB,OAAO;;EACxB;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAkB,gBAAgB;;EAClC;EAAmB,gBAAgB;;EACnC;EAAqB,gBAAgB;;EACrC;EAAiB,QAAQ,GAAG;;EAC5B;EAAwB;;EACxB;EAA2B;;;;;;;;iBAQjB,iBAAiB,GAAG,QAAQ,YAAY,UAAU,kBAAkB;;iBAqFpE,QAAQ,QAAQ,QAAQ,QAAQ,yBAAyB;;iBAoEzD,gBAAgB,OAAO,iBAAiB,MAAM,gBAAgB;iBAiB9D,iCACd,OAAO,iBACP,MAAM,gBACN,eACA;;;;;;;iBAyEc,oBAAoB,MAAM,gBAAgB;iBAqC1C,uBACd,YAAY,mBACZ,MAAM,gBACN,eACA;iBAcc,kBAAkB,MAAM,gBAAgB;iBASxC,UAAU,OAAO,mBAAmB,cAAc,aAAa,oBAAoB;;iBAiCnF,iBAAiB,MAAM,gBAAgB,gBAAgB;;iBAevD,SAAS"}
|
package/build/QueryParser.js.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryParser.js","names":["newAlias","alias"],"sources":["../src/QueryParser.ts"],"sourcesContent":["import { groupBy, isPlainObject } from \"joist-utils\";\n\nimport { type AliasMgmt, getAliasMgmt, getMaybeCtiAlias, isAlias, alias as newAlias } from \"./Aliases.ts\";\nimport { type ConditionInput, predicateBrand } from \"./conditions.ts\";\nimport { getMetadataForTable } from \"./configure.ts\";\nimport { deferredAliasSym, isDeferredAliasCondition } from \"./DeferredAlias.ts\";\nimport { type Entity, isEntity } from \"./Entity.ts\";\nimport { type ExpressionFilter, type OrderBy, type ValueFilter } from \"./EntityFilter.ts\";\nimport { type EntityMetadata, type Field, getBaseMeta } from \"./EntityMetadata.ts\";\nimport { isDeferredCondition } from \"./Expr.ts\";\nimport {\n type Column,\n ConditionBuilder,\n getConstructorFromTaggedId,\n isDefined,\n keyToNumber,\n maybeResolveReferenceToId,\n} from \"./index.ts\";\nimport { kq, kqDot } from \"./keywords.ts\";\nimport { pruneUnusedJoins } from \"./QueryParser.pruning.ts\";\nimport { visitConditions } from \"./QueryVisitor.ts\";\nimport { type Scope, isScope, isScopeJoinFilter, resolveScope } from \"./scopes.ts\";\nimport { abbreviation, assertNever, fail } from \"./utils.ts\";\n\n/** A tree of ANDs/ORs with conditions or nested conditions. */\nexport interface ParsedExpressionFilter {\n kind: \"exp\";\n op: \"and\" | \"or\";\n conditions: ParsedExpressionCondition[];\n}\n\n/** A condition or nested condition in a `ParsedExpressionFilter`. */\nexport type ParsedExpressionCondition = ParsedExpressionFilter | ColumnCondition | RawCondition | ExistsCondition;\n\nexport interface ColumnCondition {\n kind: \"column\";\n alias: string;\n column: string;\n dbType: string;\n cond: ParsedValueFilter<any>;\n /**\n * A pruneable condition is one that was auto-added by something like soft-delete, and shouldn't\n * be something that marks a join as actually used by the user's query.\n */\n pruneable?: boolean;\n}\n\n/** A user-provided condition like `SUM(${alias}.amount) > 1000` or `a1.last_name = b1.title`. */\nexport interface RawCondition {\n kind: \"raw\";\n /** The aliases, i.e. `[a, b]`, used within the condition, to ensure we don't prune them. */\n aliases: string[];\n /** The condition itself, i.e. `SUM(a.age) DESC`. */\n condition: string;\n /** The bindings within `condition`, i.e. `SUM(${alias}.amount) > ?`. */\n bindings: readonly any[];\n /** Used to mark system-added conditions (like `LATERAL JOIN` conditions), which can be ignored when pruning unused joins. */\n pruneable: boolean;\n}\n\n/** An EXISTS or NOT EXISTS subquery condition. */\nexport interface ExistsCondition {\n kind: \"exists\";\n /** When true, renders as NOT EXISTS. */\n negate: boolean;\n /** The subquery: SELECT 1 FROM child WHERE correlation AND filter. */\n subquery: ParsedFindQuery;\n /** Outer aliases referenced by the correlation predicate, for join pruning. */\n outerAliases: string[];\n}\n\n// `skipCondition` lives in its own leaf module, shared by domain aliases and SQL expressions\n// without a load-order cycle; `index.ts` re-exports it directly.\n\nexport interface PrimaryTable {\n join: \"primary\";\n alias: string;\n table: string;\n}\n\nexport interface JoinTable {\n join: \"inner\" | \"outer\";\n alias: string;\n table: string;\n col1: string;\n col2: string;\n distinct?: boolean;\n /**\n * Metadata used by `optimizeCollectionJoins` to rewrite collection joins into EXISTS.\n *\n * I.e. for `Author.books.reviews`:\n * ```sql\n * authors a\n * LEFT JOIN books b ON a.id = b.author_id\n * LEFT JOIN book_reviews br ON b.id = br.book_id\n * ```\n * `books b` has `parentAlias: \"a\"` and `rootAlias: \"b\"`, while `book_reviews br` has\n * `parentAlias: \"b\"` and `rootAlias: \"br\"`.\n *\n * I.e. for `Author.tags`, the m2m join table is the collection root:\n * ```sql\n * authors a\n * LEFT JOIN authors_to_tags att ON a.id = att.author_id\n * LEFT JOIN tags t ON att.tag_id = t.id\n * ```\n * `authors_to_tags att` has `alias: \"att\"` and `rootAlias: \"att\"`, while `tags t` has `alias: \"t\"`\n * but still has `rootAlias: \"att\"` because it belongs to the m2m subtree rooted at the join table.\n */\n collection?: {\n /** The collection relation type, i.e. `o2m` for `Author.books`, or `m2m` for `Author.tags`. */\n kind: \"o2m\" | \"m2m\";\n /** The alias that owns this collection path, i.e. `a` for `Author.books`, or `att` for `Author.tags -> tags`. */\n parentAlias: string;\n /** The top-level alias in this collection subtree, i.e. `b` for `Author.books.reviews`, or `att` for `Author.tags`. */\n rootAlias: string;\n };\n}\n\n/**\n * Creates a `CROSS JOIN`, currently used for our `em.find` batching.\n *\n * I.e. queries like:\n *\n * ```sql\n * WITH _find (tag, arg1, arg2) AS (VALUES\n * (0::int, 'a'::varchar, 'a'::varchar),\n * (1, 'b', 'b'),\n * (2, 'c', 'c')\n * )\n * SELECT a.*, array_agg(_find.tag) AS _tags\n * FROM authors a\n * CROSS JOIN _find AS _find\n * WHERE a.first_name = _find.arg0 OR a.last_name = _find.arg1\n * GROUP BY a.id\n * ```\n */\nexport interface CrossJoinTable {\n join: \"cross\";\n /** The new alias for the joined table. */\n alias: string;\n /** The table name to join into the query. */\n table: string;\n}\n\n/**\n * Adds `WITH` CTE clauses to the query.\n *\n * I.e. queries like:\n *\n * ```sql\n * WITH _find (tag, arg0, arg1) AS (\n * VALUES ($1::int, $2::character varying, $3::character varying), ($4, $5, $6)\n * )\n * ```\n */\nexport interface ParsedCteClause {\n /** The new alias for the CTE, i.e. `_find` in the above query. */\n alias: string;\n /** The columns, i.e. `tag, arg0, arg1` in the above query. */\n columns?: { columnName: string; dbType: string }[];\n /** The subquery for the AS of the CTE clause. */\n query: { kind: \"raw\"; sql: string; bindings: readonly any[] } | { kind: \"ast\"; query: ParsedFindQuery };\n /** Whether to include a `RECURSIVE` keyword after the `WITH`. */\n recursive?: boolean;\n}\n\n/**\n * Creates `LATERAL JOIN`s, currently used by `findCount` and JSON preloading.\n */\nexport interface LateralJoinTable {\n join: \"lateral\";\n alias: string;\n /** Used for join dependency tracking. */\n fromAlias: string;\n /** Used more for bookkeeping/consistency with other join tables than the query itself. */\n table: string;\n /** The subquery that will look for/roll-up N children. */\n query: ParsedFindQuery;\n /** Optional settings for the subquery, i.e. per-parent pagination. */\n settings?: { limit?: number; offset?: number };\n}\n\nexport type ParsedTable = PrimaryTable | JoinTable | CrossJoinTable | LateralJoinTable;\n\nexport interface ParsedOrderBy {\n alias: string;\n column: string;\n order: OrderBy;\n}\n\nexport type ParsedGroupBy = { alias: string; column: string } | { expression: string };\n\nexport type ParsedSelect = string | ParsedSelectWithBindings;\ntype ParsedSelectWithBindings = { sql: string; bindings: any[]; aliases: string[] };\n\n/** The result of parsing an `em.find` filter. */\nexport interface ParsedFindQuery {\n selects: ParsedSelect[];\n /** The primary table plus any joins. */\n tables: ParsedTable[];\n /** The query's conditions. */\n condition?: ParsedExpressionFilter;\n /** Extremely optional group bys; we generally don't support adhoc/aggregate queries, but the auto-batching infra uses these. */\n groupBys?: ParsedGroupBy[];\n /** Any optional orders to add before the default 'order by id'. */\n orderBys: ParsedOrderBy[];\n /** Optional CTE to prefix to the query, i.e. for recursive relations. */\n ctes?: ParsedCteClause[];\n}\n\n/**\n * Parses an `em.find` filter into a logical `ParsedFindQuery` AST, leaving optimization/pruning to callers.\n *\n * The main execution flow is:\n * parseFindQuery -> beforeFind plugins -> optimizeCollectionJoins -> pruneUnusedJoins -> execute SQL.\n */\nexport function parseFindQuery(\n meta: EntityMetadata,\n filter: any,\n opts: {\n conditions?: ExpressionFilter;\n orderBy?: any;\n pruneJoins?: boolean;\n keepAliases?: string[];\n softDeletes?: \"include\" | \"exclude\";\n allowMultipleLeftJoins?: boolean;\n optimizeJoinsToExists?: boolean;\n } = {},\n): ParsedFindQuery {\n const selects: string[] = [];\n const tables: ParsedTable[] = [];\n const orderBys: ParsedOrderBy[] = [];\n const query: ParsedFindQuery = { selects, tables, orderBys };\n const { orderBy, conditions: optsExpression, softDeletes = \"exclude\", pruneJoins = false, keepAliases = [] } = opts;\n const cb = new ConditionBuilder();\n // Where each user-created `alias(...)` is bound in this parse's join literal; alias-built conditions\n // (`a.firstName.eq(...)`) are resolved against it once the whole tree is walked\n const aliasBindings = new Map<AliasMgmt, { meta: EntityMetadata; alias: string }>();\n\n const aliases: Record<string, number> = {};\n function getAlias(tableName: string): string {\n const abbrev = abbreviation(tableName);\n const i = aliases[abbrev] || 0;\n aliases[abbrev] = i + 1;\n return i === 0 ? abbrev : `${abbrev}${i}`;\n }\n\n /** Adds a `deleted_at IS NULL` condition for `alias`, i.e. for the primary table or a collection join. */\n function addSoftDeleteCondition(meta: EntityMetadata, alias: string, targetCb: ConditionBuilder): void {\n if (filterSoftDeletes(meta, softDeletes)) {\n const column = meta.allFields[getBaseMeta(meta).timestampFields!.deletedAt!].serde?.columns[0]!;\n targetCb.addSimpleCondition({\n kind: \"column\",\n alias,\n column: column.columnName,\n dbType: column.dbType,\n cond: { kind: \"is-null\" },\n pruneable: true,\n });\n }\n }\n\n function addTable(\n meta: EntityMetadata,\n alias: string,\n join: ParsedTable[\"join\"],\n col1: string,\n col2: string,\n filter: any,\n fieldName?: string,\n targetCb: ConditionBuilder = cb,\n /** Whether this table is the \"other side\" of a collection, i.e. `books` in `em.find(Author, { books: ... })`. */\n isCollection: boolean = false,\n ): void {\n // look at filter, is it `{ book: \"b2\" }` or `{ book: { ... } }`\n const scopeFilter = isScope(filter);\n const ef = scopeFilter ? undefined : parseEntityFilter(meta, filter);\n if (!scopeFilter && !ef && join !== \"primary\" && !isAlias(filter)) {\n return;\n }\n\n if (join === \"primary\") {\n tables.push({ alias, table: meta.tableName, join });\n addTablePerClassJoinsAndClassTag({ selects, tables, orderBys }, meta, alias, true);\n } else if (meta.inheritanceType === \"cti\" && fieldName && !(fieldName in meta.fields)) {\n // For cti, our meta might be a subtype while the FK is actually on the base table. This should only be the case\n // when the fk is on another table (e.g. o2o/o2m). In these cases, we'll be passed a field name and can verify if\n // its directly in our meta, if not we should assume it's in the base type and join that in first.\n meta.baseTypes.forEach((bt, i) => {\n tables.push({\n alias: `${alias}_b${i}`,\n table: bt.tableName,\n join: \"outer\",\n col1,\n col2: `${kq(`${alias}_b${i}`)}.${col2.split(\".\")[1]}`,\n distinct: false,\n });\n // and we still need to join in our subtype as well in case its own fields are queried against\n tables.push({\n alias: `${alias}`,\n table: meta.tableName,\n join: \"outer\",\n col1: kqDot(alias, \"id\"),\n col2: kqDot(`${alias}_b${i}`, \"id\"),\n distinct: false,\n });\n });\n } else if (join === \"lateral\" || join === \"cross\") {\n fail(\"Unexpected lateral join\");\n } else {\n tables.push({ alias, table: meta.tableName, join, col1, col2 });\n // Maybe only do this if we're the primary, or have a field that needs it?\n addTablePerClassJoinsAndClassTag({ selects, tables, orderBys }, meta, alias, false);\n }\n\n if (needsStiDiscriminator(meta)) {\n addStiSubtypeFilter(targetCb, meta, alias);\n }\n\n // Only the primary table & collection joins filter soft-deletes, to match the in-memory relation\n // semantics of \"o2m/m2m collections filter out soft-deletes, but m2o/o2o references still return\n // them\". I.e. `book.author.get` returns a soft-deleted author, so `em.find(Book, { author: ... })`\n // should still match the book, as long as the book itself is not soft-deleted.\n if (join === \"primary\" || isCollection) {\n addSoftDeleteCondition(meta, alias, targetCb);\n }\n\n // The user's locally declared aliases, i.e. `const [a, b] = aliases(Author, Book)`,\n // aren't guaranteed to line up with the aliases we've assigned internally, like `a`\n // might actually be `a1` if there are two `authors` tables in the query, so push the\n // canonical alias value for the current clause into the Alias.\n if (filter && typeof filter === \"object\" && \"as\" in filter && isAlias(filter.as)) {\n aliasBindings.set(getAliasMgmt(filter.as), { meta, alias });\n } else if (isAlias(filter)) {\n aliasBindings.set(getAliasMgmt(filter), { meta, alias });\n }\n\n addFilterAt(meta, alias, filter, targetCb, ef, join);\n }\n\n function addFilterAt(\n meta: EntityMetadata,\n tableAlias: string,\n filter: any,\n targetCb: ConditionBuilder,\n parsed: ParsedEntityFilter | undefined = parseEntityFilter(meta, filter),\n parentJoin: ParsedTable[\"join\"] = \"primary\",\n ): void {\n if (isScope(filter)) {\n addScopeFilterAt(meta, tableAlias, filter, targetCb, parentJoin);\n } else if (parsed && parsed.kind === \"join\") {\n addSubFilter(meta, tableAlias, parsed.subFilter, targetCb, parentJoin);\n } else if (parsed) {\n const column = meta.fields[\"id\"].serde!.columns[0];\n targetCb.addValueFilter(tableAlias, column, parsed);\n }\n }\n\n function addScopeFilterAt<T extends Entity>(\n meta: EntityMetadata<T>,\n tableAlias: string,\n scope: Scope<T>,\n targetCb: ConditionBuilder,\n parentJoin: ParsedTable[\"join\"],\n ): void {\n for (const fragment of resolveScope(scope).fragments) {\n if (fragment.kind === \"filter\") {\n addFilterAt(meta, tableAlias, fragment.filter, targetCb, undefined, parentJoin);\n } else {\n const a = newAlias(meta.cstr);\n const result = fragment.fn(a);\n aliasBindings.set(getAliasMgmt(a), { meta, alias: tableAlias });\n if (isScopeJoinFilter(result)) {\n // Parse the join tree first so its `as:` bindings re-root the aliases that\n // `conditions` reference, then add the conditions against the now-bound aliases.\n addFilterAt(meta, tableAlias, result.where, targetCb, undefined, parentJoin);\n checkDomainCondition(result.conditions);\n targetCb.maybeAddExpression(result.conditions);\n } else {\n const conditions = Array.isArray(result) ? result : [result];\n for (const condition of conditions) checkDomainCondition(condition);\n if (conditions.length > 0) targetCb.maybeAddExpression({ and: conditions });\n }\n }\n }\n }\n\n function addSubFilter(\n meta: EntityMetadata,\n tableAlias: string,\n subFilter: object,\n targetCb: ConditionBuilder,\n parentJoin: ParsedTable[\"join\"],\n ): void {\n // subFilter really means we're matching against the entity columns/further joins\n Object.keys(subFilter).forEach((key) => {\n // Skip the `{ as: ... }` alias binding\n if (key === \"as\") return;\n if (key === \"and\" || key === \"or\") {\n addLogicalFilter(meta, tableAlias, key, (subFilter as any)[key], targetCb, parentJoin);\n return;\n }\n const field = findFilterField(meta, key) ?? fail(`Field '${key}' not found on ${meta.tableName}`);\n const fa = `${tableAlias}${field.aliasSuffix}`;\n if (field.kind === \"primitive\" || field.kind === \"primaryKey\" || field.kind === \"enum\") {\n const column = field.serde.columns[0];\n parseValueFilter((subFilter as any)[key]).forEach((filter) => {\n targetCb.addValueFilter(fa, column, filter);\n });\n } else if (field.kind === \"m2o\") {\n const column = field.serde.columns[0];\n const sub = (subFilter as any)[key];\n const joinKind = field.required && parentJoin !== \"outer\" ? \"inner\" : \"outer\";\n if (isAlias(sub)) {\n const a = getAlias(field.otherMetadata().tableName);\n addTable(\n field.otherMetadata(),\n a,\n joinKind,\n kqDot(fa, column.columnName),\n kqDot(a, \"id\"),\n sub,\n undefined,\n targetCb,\n );\n }\n const f = parseEntityFilter(field.otherMetadata(), sub);\n // Probe the filter and see if it's just an id, if so we can avoid the join; m2os don't need\n // a join for soft-delete filtering because references don't filter out soft-deletes.\n if (!f) {\n // skip\n } else if (f.kind === \"join\") {\n const a = getAlias(field.otherMetadata().tableName);\n addTable(\n field.otherMetadata(),\n a,\n joinKind,\n kqDot(fa, column.columnName),\n kqDot(a, \"id\"),\n sub,\n undefined,\n targetCb,\n );\n } else {\n targetCb.addValueFilter(fa, column, f);\n }\n } else if (field.kind === \"poly\") {\n const f = parseEntityFilter(meta, (subFilter as any)[key]);\n if (!f) {\n // skip\n } else if (f.kind === \"join\") {\n throw new Error(\"Joins through polys are not supported\");\n } else {\n // We're left with basically a ValueFilter against the ids\n // For now only support eq/ne/in/is-null\n if (f.kind === \"eq\" || f.kind === \"ne\") {\n if (isNilIdValue(f.value)) return;\n const comp = field.components.find((p) => {\n const otherMeta = p.otherMetadata();\n const cstr = getConstructorFromTaggedId(f.value as string);\n // tagged ids from subclasses always map to the base class, so we should compare to the base class if we don't directly match\n return otherMeta.cstr === cstr || otherMeta.baseType === cstr.name;\n });\n if (!comp) fail(`Invalid tagged id passed to ${meta.type}.${key}: ${f.value}`);\n const column = field.serde.columns.find((c) => c.columnName === comp.columnName)!;\n targetCb.addValueFilter(fa, column, f);\n } else if (f.kind === \"is-null\") {\n // Add a condition for every component--these can be AND-d with the rest of the simple/inline conditions\n field.components.forEach((comp) => {\n const column = field.serde.columns.find((c) => c.columnName === comp.columnName)!;\n targetCb.addSimpleCondition({\n kind: \"column\",\n alias: fa,\n column: comp.columnName,\n dbType: column.dbType,\n cond: f,\n });\n });\n } else if (f.kind === \"not-null\") {\n const conditions = field.components.map((comp) => {\n const column = field.serde.columns.find((c) => c.columnName === comp.columnName)!;\n return {\n kind: \"column\",\n alias: fa,\n column: comp.columnName,\n dbType: column.dbType,\n cond: { kind: \"not-null\" },\n };\n }) satisfies ColumnCondition[];\n targetCb.addParsedExpression({ kind: \"exp\", op: \"or\", conditions });\n } else if (f.kind === \"in\") {\n // An empty `in` matches nothing, so emit a single always-false condition (consistent\n // with a non-poly m2o `{ relation: [] }`); otherwise grouping by constructor would yield\n // zero conditions and prune the filter entirely, incorrectly matching every row.\n if (f.value.length === 0) {\n targetCb.addValueFilter(fa, field.serde.columns[0], { kind: \"in\", value: [] });\n return;\n }\n // Split up the ids by constructor\n const idsByConstructor = groupBy(f.value, (id) => getConstructorFromTaggedId(id as string).name);\n // Or together `parent_book_id in (1,2,3) OR parent_author_id IN (4,5,6)`\n // ...if there is a `parent IN [b:1, b:2, a:1, null]` we'd need to pull the `null` out and do an `OR (all columns are null)`...\n const conditions = Object.entries(idsByConstructor).map(([cstrName, ids]) => {\n const column =\n field.serde.columns.find(\n // tagged ids from subclasses always map to the base class, so we should compare to the base class if we don't directly match\n (c) => c.otherMetadata().cstr.name === cstrName || c.otherMetadata().baseType === cstrName,\n ) ?? fail(`Invalid tagged ids passed to ${meta.type}.${key}: ${ids}`);\n return {\n kind: \"column\",\n alias: fa,\n column: column.columnName,\n dbType: column.dbType,\n cond: mapToDb(column, { kind: \"in\", value: ids }),\n } satisfies ColumnCondition;\n });\n targetCb.addParsedExpression({ kind: \"exp\", op: \"or\", conditions });\n } else {\n throw new Error(`Filters on polys for ${f.kind} are not supported`);\n }\n }\n } else if (field.kind === \"o2o\") {\n // We have to always join into o2os, i.e. we can't probe the filter like we do for m2os\n const otherMeta = field.otherMetadata();\n const a = getAlias(otherMeta.tableName);\n const otherField = otherMeta.allFields[field.otherFieldName];\n const otherColumn =\n // if our other is a poly, we need to find a matching column rather than just picking the first\n otherField.kind === \"poly\"\n ? otherField.components.find((c) => c.otherMetadata() === meta || c.otherMetadata() === getBaseMeta(meta))!\n .columnName\n : otherField.serde!.columns[0].columnName;\n addTable(\n field.otherMetadata(),\n a,\n \"outer\",\n kqDot(tableAlias, \"id\"),\n kqDot(a, otherColumn),\n (subFilter as any)[key],\n field.otherFieldName,\n targetCb,\n );\n } else if (field.kind === \"o2m\") {\n const otherMeta = field.otherMetadata();\n const otherField = otherMeta.allFields[field.otherFieldName];\n let otherColumn = otherField.serde!.columns[0].columnName;\n if (otherField.kind === \"poly\") {\n const otherComponent =\n otherField.components.find((c) => c.otherMetadata() === meta) ??\n fail(`No poly component found for ${otherField.fieldName}`);\n otherColumn = otherComponent.columnName;\n }\n const isCtiBaseFk =\n otherMeta.inheritanceType === \"cti\" && field.otherFieldName && !(field.otherFieldName in otherMeta.fields);\n const a = getAlias(otherMeta.tableName);\n addTable(\n otherMeta,\n a,\n \"outer\",\n kqDot(tableAlias, \"id\"),\n kqDot(a, otherColumn),\n (subFilter as any)[key],\n field.otherFieldName,\n targetCb,\n true,\n );\n if (!isCtiBaseFk) {\n const table = tables.find((t) => t.alias === a);\n if (table && (table.join === \"inner\" || table.join === \"outer\")) {\n table.collection = { parentAlias: tableAlias, rootAlias: a, kind: \"o2m\" };\n }\n }\n } else if (field.kind === \"m2m\") {\n const sub = (subFilter as any)[key];\n const f = parseEntityFilter(field.otherMetadata(), sub);\n if (!f && !isAlias(sub)) return;\n\n const ja = getAlias(field.joinTableName);\n tables.push({\n join: \"outer\",\n alias: ja,\n table: field.joinTableName,\n col1: kqDot(tableAlias, \"id\"),\n col2: kqDot(ja, field.columnNames[0]),\n collection: { parentAlias: tableAlias, rootAlias: ja, kind: \"m2m\" },\n });\n\n if (isAlias(sub) || f?.kind === \"join\" || filterSoftDeletes(field.otherMetadata(), softDeletes)) {\n const a = getAlias(field.otherMetadata().tableName);\n addTable(\n field.otherMetadata(),\n a,\n \"outer\",\n kqDot(ja, field.columnNames[1]),\n kqDot(a, \"id\"),\n sub,\n undefined,\n targetCb,\n true,\n );\n const table = tables.find((t) => t.alias === a);\n if (table && (table.join === \"inner\" || table.join === \"outer\")) {\n table.collection = { parentAlias: ja, rootAlias: ja, kind: \"m2m\" };\n }\n } else if (f) {\n const otherMeta = field.otherMetadata();\n const column: any = {\n columnName: field.columnNames[1],\n dbType: otherMeta.idDbType,\n mapToDb(value: any) {\n return value === null || isNilIdValue(value)\n ? value\n : keyToNumber(otherMeta, maybeResolveReferenceToId(value));\n },\n };\n targetCb.addSimpleCondition({\n kind: \"column\",\n alias: ja,\n column: field.columnNames[1],\n dbType: otherMeta.idDbType,\n cond: mapToDb(column, f),\n });\n }\n } else if (field.kind === \"m2mEnum\") {\n // Membership filter, e.g. `{ logoColors: Color.Red }` / `{ logoColors: [Red, Green] }`: join the\n // join table and filter its enum-id column, mapping enum codes -> their numeric ids.\n const ja = getAlias(field.joinTableName);\n tables.push({\n join: \"outer\",\n alias: ja,\n table: field.joinTableName,\n col1: kqDot(tableAlias, \"id\"),\n col2: kqDot(ja, field.columnNames[0]),\n collection: { parentAlias: tableAlias, rootAlias: ja, kind: \"m2m\" },\n });\n const column: any = {\n columnName: field.columnNames[1],\n dbType: \"int\",\n mapToDb(value: any) {\n return value === null || value === undefined ? value : field.enumDetailType.getByCode(value).id;\n },\n };\n parseValueFilter((subFilter as any)[key]).forEach((filter) => {\n targetCb.addValueFilter(ja, column, filter);\n });\n } else {\n throw new Error(`Unsupported field ${key}`);\n }\n });\n }\n\n function addLogicalFilter(\n meta: EntityMetadata,\n tableAlias: string,\n op: \"and\" | \"or\",\n value: unknown,\n targetCb: ConditionBuilder,\n parentJoin: ParsedTable[\"join\"],\n ): void {\n const filters = Array.isArray(value) ? value : [value];\n const conditions = filters.flatMap((filter) => {\n const branchCb = new ConditionBuilder();\n addFilterAt(meta, tableAlias, filter, branchCb, undefined, parentJoin);\n const condition = branchCb.toExpressionFilter();\n return condition ? [condition] : [];\n });\n if (conditions.length > 0) targetCb.addParsedExpression({ kind: \"exp\", op, conditions });\n }\n\n function addOrderBy(meta: EntityMetadata, alias: string, orderBy: Record<string, any>): void {\n const entries = Object.entries(orderBy);\n if (entries.length === 0) return;\n for (const [key, value] of entries) {\n if (!value) continue; // prune undefined\n const field = meta.allFields[key] ?? fail(`${key} not found on ${meta.tableName}`);\n if (field.kind === \"primitive\" || field.kind === \"primaryKey\" || field.kind === \"enum\") {\n const column = field.serde.columns[0];\n orderBys.push({\n alias: `${alias}${field.aliasSuffix ?? \"\"}`,\n column: column.columnName,\n order: value as OrderBy,\n });\n } else if (field.kind === \"m2o\") {\n // Do we already this table joined in?\n let table = tables.find((t) => t.table === field.otherMetadata().tableName);\n if (table) {\n addTablePerClassJoinsAndClassTag(query, field.otherMetadata(), table.alias, false);\n addOrderBy(field.otherMetadata(), table.alias, value);\n } else {\n const table = field.otherMetadata().tableName;\n const a = getAlias(table);\n const column = field.serde.columns[0].columnName;\n const fa = getMaybeCtiAlias(meta, field, meta, alias);\n // If we don't have a join, don't force this to be an inner join\n tables.push({\n alias: a,\n table,\n join: \"outer\",\n col1: kqDot(fa, column),\n col2: kqDot(a, \"id\"),\n distinct: false,\n });\n addTablePerClassJoinsAndClassTag(query, field.otherMetadata(), a, false);\n addOrderBy(field.otherMetadata(), a, value);\n }\n } else {\n throw new Error(`Unsupported field ${key}`);\n }\n }\n }\n\n // always add the main table\n const alias = getAlias(meta.tableName);\n if (meta.hasLazyColumns) {\n selects.push(...lazyExcludedSelects(meta, alias));\n } else {\n selects.push(`${kq(alias)}.*`);\n }\n addTable(meta, alias, \"primary\", \"n/a\", \"n/a\", filter);\n\n // If they passed extra `conditions: ...`, parse that\n if (optsExpression) {\n checkDomainCondition(optsExpression);\n cb.maybeAddExpression(optsExpression);\n }\n\n Object.assign(query, {\n condition: cb.toExpressionFilter(),\n });\n\n // Resolve alias-built conditions against this parse's bindings, before anything reads their\n // aliases (the id-not-null injection just below, and join pruning)\n resolveAliasConditions(query, aliasBindings);\n\n if (query.tables.some((t) => t.join === \"outer\")) {\n maybeAddIdNotNulls(query);\n }\n\n if (orderBy) {\n if (Array.isArray(orderBy)) {\n for (const ob of orderBy) addOrderBy(meta, alias, ob);\n } else {\n addOrderBy(meta, alias, orderBy);\n }\n }\n maybeAddOrderBy(query, meta, alias);\n\n if (pruneJoins) {\n pruneUnusedJoins(query, keepAliases);\n }\n return query;\n}\n\n/**\n * Look for conditions doing `some_column IS NULL` in an outer join that\n * need an `id IS NOT NULL` to make sure they don't match inadvertently on\n * the child row simply not existing.\n *\n * Note: Instead of injecting an extra `id IS NOT NULL` condition, I had tried\n * using all INNER JOINs and flipping joins to OUTER only if the user explicit\n * had `id IS NULL` in their filter, but that didn't work for queries that wanted\n * to do an `OR` across two different children (which queries both children being\n * OUTER JOINs, and detecting that case seemed complicated).\n */\nexport function maybeAddIdNotNulls(query: ParsedFindQuery): void {\n visitConditions(query, {\n visitCond(c: ColumnCondition) {\n // Check `c.prunable` to make sure we don't catch our injected `deleted_at is null` conditions\n if (c.cond.kind !== \"is-null\" || c.column === \"id\" || c.pruneable) {\n return c;\n }\n // This is an `some_column IS NULL`, is it in an outer join?\n const table = query.tables.find((t) => t.alias === c.alias);\n if (table && table.join === \"outer\") {\n const meta = getMetadataForTable(table.table);\n return {\n kind: \"exp\",\n op: \"and\",\n conditions: [\n c,\n {\n kind: \"column\",\n alias: c.alias,\n column: \"id\",\n dbType: meta.idDbType,\n cond: { kind: \"not-null\" },\n },\n ],\n } satisfies ParsedExpressionFilter;\n }\n return c;\n },\n });\n}\n\n/** Returns the `a` from `\"a\".*`. */\nexport function parseAlias(alias: string): string {\n return alias.split(\".\")[0].replaceAll(`\"`, \"\");\n}\n\n/** An ADT version of `EntityFilter`. */\nexport type ParsedEntityFilter =\n // ParsedValueFilter is any simple match on `id`\n | ParsedValueFilter<string | number>\n // Otherwise we return the join/complex\n | { kind: \"join\"; subFilter: object };\n\n/** Parses an entity filter, which could be \"just an id\", an array of ids, or a nested filter. */\nexport function parseEntityFilter(meta: EntityMetadata, filter: any): ParsedEntityFilter | undefined {\n if (filter === undefined) {\n // This matches legacy `em.find(Book, { author: undefined })` behavior\n return undefined;\n } else if (isAlias(filter)) {\n // We're just binding an alias to this position in the join tree\n return undefined;\n } else if (isScope(filter)) {\n // A scope on a relation (e.g. `{ author: Author.adult }`) always implies conditions on the\n // related entity, so signal \"needs a join\" via the existing `join` discriminant rather than\n // adding a dedicated `kind: \"scope\"` that every relation branch would have to learn. The empty\n // `subFilter` is intentionally never read: the m2o/m2m branches only check `kind === \"join\"` to\n // decide whether to join, then re-dispatch the original scope value back through `addTable`,\n // where `isScope(...)` routes it to `addScopeFilterAt` to apply the scope's actual fragments.\n return { kind: \"join\", subFilter: {} };\n } else if (filter === null) {\n return { kind: \"is-null\" };\n } else if (typeof filter === \"string\" || typeof filter === \"number\") {\n return { kind: \"eq\", value: filter };\n } else if (typeof filter === \"boolean\") {\n return filter ? { kind: \"not-null\" } : { kind: \"is-null\" };\n } else if (Array.isArray(filter)) {\n return {\n kind: \"in\",\n value: filter.map((v: string | number | Entity) => {\n return isEntity(v) ? (v.idTaggedMaybe ?? nilIdValue(meta)) : v;\n }),\n };\n } else if (isEntity(filter)) {\n return { kind: \"eq\", value: filter.idTaggedMaybe || nilIdValue(meta) };\n } else if (typeof filter === \"object\") {\n // Looking for `{ firstName: \"f1\" }` or `{ ne: \"f1\" }`\n const keys = Object.keys(filter);\n // Special case only looking at `ne`\n if (keys.length === 1 && keys[0] === \"ne\") {\n const value = filter[\"ne\"];\n if (value === undefined) {\n return undefined;\n } else if (value === null) {\n return { kind: \"not-null\" };\n } else if (typeof value === \"string\" || typeof value === \"number\") {\n return { kind: \"ne\", value };\n } else if (isEntity(value)) {\n return { kind: \"ne\", value: value.idTaggedMaybe || nilIdValue(meta) };\n } else {\n throw new Error(`Unsupported \"ne\" value ${value}`);\n }\n }\n // Special case only looking at `id`\n if (keys.length === 1 && keys[0] === \"id\") {\n const value = filter[\"id\"];\n if (value === undefined) {\n return undefined;\n } else if (value === null) {\n return { kind: \"is-null\" };\n } else if (typeof value === \"string\" || typeof value === \"number\") {\n return { kind: \"eq\", value };\n } else if (isEntity(value)) {\n return { kind: \"eq\", value: value.idTaggedMaybe || nilIdValue(meta) };\n } else {\n return parseValueFilter(value)[0] as any;\n }\n }\n // Look for subFilter values being EntityFilter-ish instances like ManyToOneReference\n // that have an id, and so structurally match the entity filter without really being filters,\n // and convert them over here before getting into parseValueFilter.\n const subFilter = {} as any;\n for (const [key, value] of Object.entries(filter)) {\n if (value && typeof value === \"object\" && !isPlainObject(value) && \"idTaggedMaybe\" in value) {\n subFilter[key] = value.idTaggedMaybe || nilIdValue(meta);\n } else {\n subFilter[key] = value;\n }\n }\n return { kind: \"join\", subFilter };\n } else {\n throw new Error(`Unrecognized filter ${filter}`);\n }\n}\n\n/**\n * We use this value if users include new (id-less) entities as em.find conditions.\n *\n * The idea is that this condition would never be met, but we still want to do the em.find\n * query in case it's in an `OR` clause that would match false, but some other part of the\n * clause would match. I.e. instead of just skipping the DB query all together, which is\n * also something we could consider doing.\n *\n * For int IDs we use -1, and for uuid IDs, we use the nil UUID value:\n *\n * https://en.wikipedia.org/wiki/Universally_unique_identifier#Nil_UUID\n */\nfunction nilIdValue(meta: EntityMetadata): any {\n switch (meta.idDbType) {\n case \"int\":\n case \"bigint\":\n return -1;\n case \"uuid\":\n return \"00000000-0000-0000-0000-000000000000\";\n case \"text\":\n return \"0\";\n default:\n return assertNever(meta.idDbType);\n }\n}\n\nfunction isNilIdValue(value: any): boolean {\n return value === -1 || value === \"00000000-0000-0000-0000-000000000000\";\n}\n\n/** Finds a filter field by fieldName or generated fieldIdName. */\nexport function findFilterField(meta: EntityMetadata, key: string): (Field & { aliasSuffix: string }) | undefined {\n return (\n meta.allFields[key] ??\n meta.polyComponentFields?.[key] ??\n Object.values(meta.allFields).find((field) => field.fieldIdName === key) ??\n Object.values(meta.polyComponentFields ?? {}).find((field) => field.fieldIdName === key)\n );\n}\n\n/**\n * An ADT version of `ValueFilter`.\n *\n * The ValueFilter is a\n */\nexport type ParsedValueFilter<V> =\n | { kind: \"eq\"; value: V }\n | { kind: \"in\"; value: readonly V[] }\n | { kind: \"nin\"; value: readonly V[] }\n | { kind: \"gt\"; value: V }\n | { kind: \"gte\"; value: V }\n | { kind: \"ne\"; value: V }\n | { kind: \"is-null\" }\n | { kind: \"not-null\" }\n | { kind: \"lt\"; value: V }\n | { kind: \"lte\"; value: V }\n | { kind: \"like\"; value: V }\n | { kind: \"nlike\"; value: V }\n | { kind: \"ilike\"; value: V }\n | { kind: \"nilike\"; value: V }\n | { kind: \"regex\"; value: V }\n | { kind: \"nregex\"; value: V }\n | { kind: \"iregex\"; value: V }\n | { kind: \"niregex\"; value: V }\n | { kind: \"contains\"; value: readonly V[] }\n | { kind: \"ncontains\"; value: readonly V[] }\n | { kind: \"overlaps\"; value: readonly V[] }\n | { kind: \"noverlaps\"; value: readonly V[] }\n | { kind: \"containedBy\"; value: readonly V[] }\n | { kind: \"between\"; value: [V, V] }\n | { kind: \"jsonPathExists\"; value: string }\n | { kind: \"jsonPathPredicate\"; value: string };\n\n/**\n * Parses the many/hodgepodge (ergonomic!) patterns of value filters into a `ParsedValueFilter[]`.\n *\n * Note we return an array because filter might be a `ValueGraphQLFilter` that is allowed to have\n * multiple conditions, i.e. `{ lt: 10, gt: 5 }`.\n */\nexport function parseValueFilter<V>(filter: ValueFilter<V, any>): ParsedValueFilter<V>[] {\n if (filter === null) {\n return [{ kind: \"is-null\" }];\n } else if (filter === undefined) {\n // This is legacy behavior where `em.find(Book, { author: undefined })` would match all books\n return [];\n } else if (Array.isArray(filter)) {\n return [{ kind: \"in\", value: filter }];\n } else if (isPlainObject(filter)) {\n const keys = Object.keys(filter);\n if (keys.length === 0) {\n // Should this be an error?\n return [];\n } else if (keys.length === 2 && \"op\" in filter && \"value\" in filter) {\n // Probe for `findGql` op & value\n const { op, value } = filter;\n if (shouldPruneValueFilter(op, value)) {\n return [];\n } else if (value === null) {\n return [{ kind: \"is-null\" }];\n } else {\n return [{ kind: op, value: value ?? null }];\n }\n } else if (keys.length === 2 && \"gte\" in filter && \"lte\" in filter) {\n const { gte, lte } = filter;\n return [{ kind: \"between\", value: [gte, lte] }];\n } else {\n return Object.entries(filter)\n .map(([key, value]) => {\n // Always do condition pruning on the value\n if (shouldPruneValueFilter(key, value)) {\n return undefined;\n }\n switch (key) {\n case \"eq\":\n if (value === null) {\n return { kind: \"is-null\" as const };\n } else {\n return { kind: \"eq\" as const, value: filter[key] };\n }\n case \"ne\":\n if (value === null) {\n return { kind: \"not-null\" as const };\n } else {\n return { kind: \"ne\" as const, value: filter[key] ?? null };\n }\n case \"in\":\n case \"nin\":\n case \"gt\":\n case \"gte\":\n case \"lt\":\n case \"lte\":\n case \"like\":\n case \"nlike\":\n case \"ilike\":\n case \"nilike\":\n case \"regex\":\n case \"nregex\":\n case \"iregex\":\n case \"niregex\":\n case \"contains\":\n case \"overlaps\":\n case \"containedBy\":\n return { kind: key, value: filter[key] };\n case \"pathExists\":\n return { kind: \"jsonPathExists\" as const, value: filter[key] };\n case \"pathIsTrue\":\n return { kind: \"jsonPathPredicate\" as const, value: filter[key] };\n case \"search\":\n return { kind: \"ilike\" as const, value: makeLike(filter[key]) };\n case \"between\":\n return { kind: key, value: filter[key] };\n default:\n throw new Error(`Unsupported value filter key ${key}`);\n }\n })\n .filter(isDefined);\n }\n } else {\n // This is a primitive like a string, number\n return [{ kind: \"eq\", value: filter }];\n }\n}\n\n/** Converts domain-level values like string ids/enums into their db equivalent. */\nexport function mapToDb(column: Column, filter: ParsedValueFilter<any>): ParsedValueFilter<any> {\n // ...to teach this `mapToDb` function to handle/rewrite `in: [1, null]` handling, we'd need to:\n // 1. return a maybe-simple/maybe-nested condition, so basically a `ParsedExpressionCondition`, because\n // this would let `in` return an `{ or: ... }` to all the callers.\n // 2. also return `{ parsed: ParsedExpressionCondition, simples: SimpleCondition[] }` tuple, for the\n // alias `addCondition` processing to track the `simples` and rewrite their alias when later bound.\n switch (filter.kind) {\n case \"eq\":\n case \"gt\":\n case \"gte\":\n case \"ne\":\n case \"lt\":\n case \"lte\":\n case \"like\":\n case \"nlike\":\n case \"ilike\":\n case \"nilike\":\n case \"regex\":\n case \"nregex\":\n case \"iregex\":\n case \"niregex\":\n filter.value = column.mapToDb(filter.value);\n return filter;\n case \"in\":\n if (column.isArray) {\n // Arrays need a special operator\n return { kind: \"contains\", value: column.mapToDb(filter.value) };\n } else {\n filter.value = filter.value.map((v) => column.mapToDb(v));\n }\n return filter;\n case \"nin\":\n if (column.isArray) {\n // Arrays need a special operator\n throw new Error(\"The nin operator is not supported on array columns yet\");\n } else {\n filter.value = filter.value.map((v) => column.mapToDb(v));\n }\n return filter;\n case \"contains\":\n case \"ncontains\":\n case \"overlaps\":\n case \"noverlaps\":\n case \"containedBy\":\n const supportsContains = column.isArray || column.dbType === \"jsonb\";\n if (!supportsContains) {\n throw new Error(`${filter.kind} is only unsupported on array or jsonb columns`);\n }\n if (column.isArray) {\n filter.value = column.mapToDb(filter.value);\n } else {\n // leave jsonb values alone\n }\n return filter;\n case \"between\":\n filter.value = [column.mapToDb(filter.value[0]), column.mapToDb(filter.value[1])];\n return filter;\n case \"is-null\":\n case \"not-null\":\n case \"jsonPathExists\":\n case \"jsonPathPredicate\":\n return filter;\n default:\n throw assertNever(filter);\n }\n}\n\n/** Adds any user-configured default order, plus an \"always order by id\" for determinism. */\nexport function maybeAddOrderBy(query: ParsedFindQuery, meta: EntityMetadata, alias: string): void {\n const { orderBys } = query;\n if (meta.orderBy) {\n const field = meta.allFields[meta.orderBy] ?? fail(`${meta.orderBy} not found on ${meta.tableName}`);\n const column = field.serde!.columns[0].columnName;\n const hasAlready = orderBys.find((o) => o.alias === alias && o.column === column);\n if (!hasAlready) {\n orderBys.push({ alias, column, order: \"ASC\" });\n }\n }\n // Even if they already added orders, add id as the last one to get deterministic output\n const hasIdOrder = orderBys.find((o) => o.alias === alias && o.column === \"id\");\n if (!hasIdOrder) {\n orderBys.push({ alias, column: \"id\", order: \"ASC\" });\n }\n}\n\nexport function addTablePerClassJoinsAndClassTag(\n query: ParsedFindQuery,\n meta: EntityMetadata,\n alias: string,\n isPrimary: boolean,\n): void {\n if (!needsClassPerTableJoins(meta)) return;\n const { selects, tables } = query;\n // When `.load(SmallPublisher)` is called, join in base tables like `Publisher`\n meta.baseTypes.forEach((bt, i) => {\n if (isPrimary) {\n selects.push(`${alias}_b${i}.*`);\n }\n tables.push({\n alias: `${alias}_b${i}`,\n table: bt.tableName,\n join: \"outer\",\n col1: kqDot(alias, \"id\"),\n col2: `${alias}_b${i}.id`,\n distinct: false,\n });\n });\n\n // We always join in the base table in case a query happens to use\n // it as a filter, but we only need to do the subtype joins + selects\n // if this is the primary table\n if (isPrimary) {\n // Watch for subTypes that share column names. It'd be great to do\n // this statically at codegen time, like a meta.sharedSubtypeColumns.\n const stColumns: { stAlias: string; columnName: string }[] = [];\n\n // When `.load(Publisher)` is called, join in sub tables like `SmallPublisher` and `LargePublisher`\n meta.subTypes.forEach((st, i) => {\n const stAlias = `${alias}_s${i}`;\n selects.push(`${stAlias}.*`);\n tables.push({\n alias: stAlias,\n table: st.tableName,\n join: \"outer\",\n col1: kqDot(alias, \"id\"),\n col2: `${alias}_s${i}.id`,\n distinct: false,\n });\n for (const field of Object.values(st.fields)) {\n if (field.fieldName !== \"id\" && field.serde) {\n for (const c of field.serde?.columns) {\n stColumns.push({ stAlias, columnName: c.columnName });\n }\n }\n }\n });\n\n // Nominate a specific `id` column to avoid ambiguity\n selects.push(`${kq(alias)}.id as id`);\n\n // Add an explicit coalesce for shared columns\n Object.values(groupBy(stColumns, (c) => c.columnName))\n .filter((columns) => columns.length > 1)\n .forEach((columns) => {\n const { columnName } = columns[0];\n selects.push(`COALESCE(${columns.map((c) => `${c.stAlias}.${columnName}`).join(\", \")}) as ${columnName}`);\n });\n\n // If our meta has no subtypes, we're a left type and don't need a __class\n const cases = meta.subTypes.map((st, i) => `WHEN ${alias}_s${i}.id IS NOT NULL THEN '${st.type}'`);\n if (cases.length > 0) {\n selects.push(`CASE ${cases.join(\" \")} ELSE '_' END as __class`);\n }\n }\n}\n\n/**\n * Builds the primary table's SELECT columns explicitly, i.e. excluding any `lazy` columns.\n *\n * Only used when `meta.hasLazyColumns` is true; otherwise callers keep their plain `alias.*`, so\n * that entities without lazy columns emit byte-identical SQL to before this feature existed.\n */\nexport function lazyExcludedSelects(meta: EntityMetadata, alias: string): string[] {\n const selects: string[] = [];\n for (const field of Object.values(meta.fields)) {\n if (!field.serde) continue;\n if (field.kind === \"primitive\" && field.lazy) continue;\n for (const column of field.serde.columns) selects.push(kqDot(alias, column.columnName));\n }\n return selects;\n}\n\n/** Rejects SQL predicates throughout a domain condition tree before optional-filter pruning. */\nfunction checkDomainCondition(condition: ConditionInput | undefined): void {\n if (!condition) return;\n if (isDeferredCondition(condition) || (predicateBrand in condition && condition[predicateBrand] === \"sql\")) {\n fail(\"SQL predicates are only supported by em.query/em.execute; use alias(...) predicates in em.find and scopes.\");\n }\n if (\"and\" in condition && condition.and) {\n for (const child of condition.and) checkDomainCondition(child);\n } else if (\"or\" in condition && condition.or) {\n for (const child of condition.or) checkDomainCondition(child);\n }\n}\n\n/** Resolves every `DeferredAliasCondition` in `query` against the parse's alias bindings. */\nfunction resolveAliasConditions(\n query: ParsedFindQuery,\n bindings: Map<AliasMgmt, { meta: EntityMetadata; alias: string }>,\n): void {\n function resolve(handle: AliasMgmt): { meta: EntityMetadata; alias: string } {\n return bindings.get(handle) ?? fail(`Alias for ${handle.tableName} is not bound to this query's join literal`);\n }\n function maybeResolve<C extends ColumnCondition | RawCondition>(c: C): C | undefined {\n return isDeferredAliasCondition(c) ? c[deferredAliasSym](resolve) : undefined;\n }\n visitConditions(query, { visitCond: maybeResolve, visitRaw: maybeResolve });\n}\n\nexport function maybeAddNotSoftDeleted(\n conditions: ColumnCondition[],\n meta: EntityMetadata,\n alias: string,\n softDeletes: \"include\" | \"exclude\",\n): void {\n if (filterSoftDeletes(meta, softDeletes)) {\n const column = meta.allFields[getBaseMeta(meta).timestampFields!.deletedAt!].serde?.columns[0]!;\n conditions.push({\n kind: \"column\",\n alias,\n column: column.columnName,\n dbType: column.dbType,\n cond: { kind: \"is-null\" },\n });\n }\n}\n\nexport function filterSoftDeletes(meta: EntityMetadata, softDeletes: \"include\" | \"exclude\"): boolean {\n return (\n softDeletes === \"exclude\" &&\n !!getBaseMeta(meta).timestampFields?.deletedAt &&\n // We don't support CTI subtype soft-delete filtering yet\n (meta.inheritanceType !== \"cti\" || meta.baseTypes.length === 0)\n );\n}\n\nexport function getTables(query: ParsedFindQuery): [PrimaryTable, JoinTable[], LateralJoinTable[], CrossJoinTable[]] {\n let primary: PrimaryTable;\n const joins: JoinTable[] = [];\n const laterals: LateralJoinTable[] = [];\n const crosses: CrossJoinTable[] = [];\n for (const table of query.tables) {\n if (table.join === \"primary\") {\n primary = table;\n } else if (table.join === \"lateral\") {\n laterals.push(table);\n } else if (table.join === \"cross\") {\n crosses.push(table);\n } else {\n joins.push(table);\n }\n }\n return [primary!, joins, laterals, crosses];\n}\n\nfunction needsClassPerTableJoins(meta: EntityMetadata): boolean {\n return meta.inheritanceType === \"cti\" && (meta.subTypes.length > 0 || meta.baseTypes.length > 0);\n}\n\nfunction needsStiDiscriminator(meta: EntityMetadata): boolean {\n return meta.inheritanceType === \"sti\" && !meta.stiDiscriminatorField;\n}\n\nfunction addStiSubtypeFilter(cb: ConditionBuilder, subtypeMeta: EntityMetadata, alias: string): void {\n const cond = stiSubtypeFilter(subtypeMeta, alias);\n if (cond) cb.addSimpleCondition(cond);\n}\n\n/** The `type_id = X` discriminator condition for an STI subtype, shared by em.find and em.query. */\nexport function stiSubtypeFilter(meta: EntityMetadata, alias: string): ColumnCondition | undefined {\n if (meta.inheritanceType !== \"sti\" || meta.stiDiscriminatorValue === undefined) return undefined;\n const baseMeta = getBaseMeta(meta);\n const column = baseMeta.fields[baseMeta.stiDiscriminatorField!].serde?.columns[0]!;\n return {\n kind: \"column\",\n alias,\n column: column.columnName,\n dbType: column.dbType,\n cond: { kind: \"eq\", value: meta.stiDiscriminatorValue },\n pruneable: true,\n };\n}\n\n/** Converts a search term like `foo bar` into a SQL `like` pattern like `%foo%bar%`. */\nexport function makeLike(search: any | undefined): any {\n return search ? `%${search.replace(/\\s+/g, \"%\")}%` : undefined;\n}\n\n/** Returns true for values that should be treated like an omitted filter. */\nfunction shouldPruneValueFilter(key: unknown, value: unknown): boolean {\n if (value === undefined) return true;\n return value === false && key !== \"eq\" && key !== \"ne\";\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAwNA,SAAgB,eACd,MACA,QACA,OAQI,CAAC,GACY;CACjB,MAAM,UAAoB,CAAC;CAC3B,MAAM,SAAwB,CAAC;CAC/B,MAAM,WAA4B,CAAC;CACnC,MAAM,QAAyB;EAAE;EAAS;EAAQ;CAAS;CAC3D,MAAM,EAAE,SAAS,YAAY,gBAAgB,cAAc,WAAW,aAAa,OAAO,cAAc,CAAC,MAAM;CAC/G,MAAM,KAAK,IAAI,iBAAiB;CAGhC,MAAM,gCAAgB,IAAI,IAAwD;CAElF,MAAM,UAAkC,CAAC;CACzC,SAAS,SAAS,WAA2B;EAC3C,MAAM,SAAS,aAAa,SAAS;EACrC,MAAM,IAAI,QAAQ,WAAW;EAC7B,QAAQ,UAAU,IAAI;EACtB,OAAO,MAAM,IAAI,SAAS,GAAG,SAAS;CACxC;;CAGA,SAAS,uBAAuB,MAAsB,OAAe,UAAkC;EACrG,IAAI,kBAAkB,MAAM,WAAW,GAAG;GACxC,MAAM,SAAS,KAAK,UAAU,YAAY,IAAI,CAAC,CAAC,gBAAiB,UAAW,CAAC,OAAO,QAAQ;GAC5F,SAAS,mBAAmB;IAC1B,MAAM;IACN;IACA,QAAQ,OAAO;IACf,QAAQ,OAAO;IACf,MAAM,EAAE,MAAM,UAAU;IACxB,WAAW;GACb,CAAC;EACH;CACF;CAEA,SAAS,SACP,MACA,OACA,MACA,MACA,MACA,QACA,WACA,WAA6B,IAE7B,eAAwB,OAClB;EAEN,MAAM,cAAc,QAAQ,MAAM;EAClC,MAAM,KAAK,cAAc,KAAA,IAAY,kBAAkB,MAAM,MAAM;EACnE,IAAI,CAAC,eAAe,CAAC,MAAM,SAAS,aAAa,CAAC,QAAQ,MAAM,GAC9D;EAGF,IAAI,SAAS,WAAW;GACtB,OAAO,KAAK;IAAE;IAAO,OAAO,KAAK;IAAW;GAAK,CAAC;GAClD,iCAAiC;IAAE;IAAS;IAAQ;GAAS,GAAG,MAAM,OAAO,IAAI;EACnF,OAAO,IAAI,KAAK,oBAAoB,SAAS,aAAa,EAAE,aAAa,KAAK,SAI5E,KAAK,UAAU,SAAS,IAAI,MAAM;GAChC,OAAO,KAAK;IACV,OAAO,GAAG,MAAM,IAAI;IACpB,OAAO,GAAG;IACV,MAAM;IACN;IACA,MAAM,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,EAAE,GAAG,KAAK,MAAM,GAAG,CAAC,CAAC;IACjD,UAAU;GACZ,CAAC;GAED,OAAO,KAAK;IACV,OAAO,GAAG;IACV,OAAO,KAAK;IACZ,MAAM;IACN,MAAM,MAAM,OAAO,IAAI;IACvB,MAAM,MAAM,GAAG,MAAM,IAAI,KAAK,IAAI;IAClC,UAAU;GACZ,CAAC;EACH,CAAC;OACI,IAAI,SAAS,aAAa,SAAS,SACxC,KAAK,yBAAyB;OACzB;GACL,OAAO,KAAK;IAAE;IAAO,OAAO,KAAK;IAAW;IAAM;IAAM;GAAK,CAAC;GAE9D,iCAAiC;IAAE;IAAS;IAAQ;GAAS,GAAG,MAAM,OAAO,KAAK;EACpF;EAEA,IAAI,sBAAsB,IAAI,GAC5B,oBAAoB,UAAU,MAAM,KAAK;EAO3C,IAAI,SAAS,aAAa,cACxB,uBAAuB,MAAM,OAAO,QAAQ;EAO9C,IAAI,UAAU,OAAO,WAAW,YAAY,QAAQ,UAAU,QAAQ,OAAO,EAAE,GAC7E,cAAc,IAAI,aAAa,OAAO,EAAE,GAAG;GAAE;GAAM;EAAM,CAAC;OACrD,IAAI,QAAQ,MAAM,GACvB,cAAc,IAAI,aAAa,MAAM,GAAG;GAAE;GAAM;EAAM,CAAC;EAGzD,YAAY,MAAM,OAAO,QAAQ,UAAU,IAAI,IAAI;CACrD;CAEA,SAAS,YACP,MACA,YACA,QACA,UACA,SAAyC,kBAAkB,MAAM,MAAM,GACvE,aAAkC,WAC5B;EACN,IAAI,QAAQ,MAAM,GAChB,iBAAiB,MAAM,YAAY,QAAQ,UAAU,UAAU;OAC1D,IAAI,UAAU,OAAO,SAAS,QACnC,aAAa,MAAM,YAAY,OAAO,WAAW,UAAU,UAAU;OAChE,IAAI,QAAQ;GACjB,MAAM,SAAS,KAAK,OAAO,KAAK,CAAC,MAAO,QAAQ;GAChD,SAAS,eAAe,YAAY,QAAQ,MAAM;EACpD;CACF;CAEA,SAAS,iBACP,MACA,YACA,OACA,UACA,YACM;EACN,KAAK,MAAM,YAAY,aAAa,KAAK,CAAC,CAAC,WACzC,IAAI,SAAS,SAAS,UACpB,YAAY,MAAM,YAAY,SAAS,QAAQ,UAAU,KAAA,GAAW,UAAU;OACzE;GACL,MAAM,IAAIA,MAAS,KAAK,IAAI;GAC5B,MAAM,SAAS,SAAS,GAAG,CAAC;GAC5B,cAAc,IAAI,aAAa,CAAC,GAAG;IAAE;IAAM,OAAO;GAAW,CAAC;GAC9D,IAAI,kBAAkB,MAAM,GAAG;IAG7B,YAAY,MAAM,YAAY,OAAO,OAAO,UAAU,KAAA,GAAW,UAAU;IAC3E,qBAAqB,OAAO,UAAU;IACtC,SAAS,mBAAmB,OAAO,UAAU;GAC/C,OAAO;IACL,MAAM,aAAa,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAM;IAC3D,KAAK,MAAM,aAAa,YAAY,qBAAqB,SAAS;IAClE,IAAI,WAAW,SAAS,GAAG,SAAS,mBAAmB,EAAE,KAAK,WAAW,CAAC;GAC5E;EACF;CAEJ;CAEA,SAAS,aACP,MACA,YACA,WACA,UACA,YACM;EAEN,OAAO,KAAK,SAAS,CAAC,CAAC,SAAS,QAAQ;GAEtC,IAAI,QAAQ,MAAM;GAClB,IAAI,QAAQ,SAAS,QAAQ,MAAM;IACjC,iBAAiB,MAAM,YAAY,KAAM,UAAkB,MAAM,UAAU,UAAU;IACrF;GACF;GACA,MAAM,QAAQ,gBAAgB,MAAM,GAAG,KAAK,KAAK,UAAU,IAAI,iBAAiB,KAAK,WAAW;GAChG,MAAM,KAAK,GAAG,aAAa,MAAM;GACjC,IAAI,MAAM,SAAS,eAAe,MAAM,SAAS,gBAAgB,MAAM,SAAS,QAAQ;IACtF,MAAM,SAAS,MAAM,MAAM,QAAQ;IACnC,iBAAkB,UAAkB,IAAI,CAAC,CAAC,SAAS,WAAW;KAC5D,SAAS,eAAe,IAAI,QAAQ,MAAM;IAC5C,CAAC;GACH,OAAO,IAAI,MAAM,SAAS,OAAO;IAC/B,MAAM,SAAS,MAAM,MAAM,QAAQ;IACnC,MAAM,MAAO,UAAkB;IAC/B,MAAM,WAAW,MAAM,YAAY,eAAe,UAAU,UAAU;IACtE,IAAI,QAAQ,GAAG,GAAG;KAChB,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,UACA,MAAM,IAAI,OAAO,UAAU,GAC3B,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,QACF;IACF;IACA,MAAM,IAAI,kBAAkB,MAAM,cAAc,GAAG,GAAG;IAGtD,IAAI,CAAC,GAAG,CAER,OAAO,IAAI,EAAE,SAAS,QAAQ;KAC5B,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,UACA,MAAM,IAAI,OAAO,UAAU,GAC3B,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,QACF;IACF,OACE,SAAS,eAAe,IAAI,QAAQ,CAAC;GAEzC,OAAO,IAAI,MAAM,SAAS,QAAQ;IAChC,MAAM,IAAI,kBAAkB,MAAO,UAAkB,IAAI;IACzD,IAAI,CAAC,GAAG,CAER,OAAO,IAAI,EAAE,SAAS,QACpB,MAAM,IAAI,MAAM,uCAAuC;SAIvD,IAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;KACtC,IAAI,aAAa,EAAE,KAAK,GAAG;KAC3B,MAAM,OAAO,MAAM,WAAW,MAAM,MAAM;MACxC,MAAM,YAAY,EAAE,cAAc;MAClC,MAAM,OAAO,2BAA2B,EAAE,KAAe;MAEzD,OAAO,UAAU,SAAS,QAAQ,UAAU,aAAa,KAAK;KAChE,CAAC;KACD,IAAI,CAAC,MAAM,KAAK,+BAA+B,KAAK,KAAK,GAAG,IAAI,IAAI,EAAE,OAAO;KAC7E,MAAM,SAAS,MAAM,MAAM,QAAQ,MAAM,MAAM,EAAE,eAAe,KAAK,UAAU;KAC/E,SAAS,eAAe,IAAI,QAAQ,CAAC;IACvC,OAAO,IAAI,EAAE,SAAS,WAEpB,MAAM,WAAW,SAAS,SAAS;KACjC,MAAM,SAAS,MAAM,MAAM,QAAQ,MAAM,MAAM,EAAE,eAAe,KAAK,UAAU;KAC/E,SAAS,mBAAmB;MAC1B,MAAM;MACN,OAAO;MACP,QAAQ,KAAK;MACb,QAAQ,OAAO;MACf,MAAM;KACR,CAAC;IACH,CAAC;SACI,IAAI,EAAE,SAAS,YAAY;KAChC,MAAM,aAAa,MAAM,WAAW,KAAK,SAAS;MAChD,MAAM,SAAS,MAAM,MAAM,QAAQ,MAAM,MAAM,EAAE,eAAe,KAAK,UAAU;MAC/E,OAAO;OACL,MAAM;OACN,OAAO;OACP,QAAQ,KAAK;OACb,QAAQ,OAAO;OACf,MAAM,EAAE,MAAM,WAAW;MAC3B;KACF,CAAC;KACD,SAAS,oBAAoB;MAAE,MAAM;MAAO,IAAI;MAAM;KAAW,CAAC;IACpE,OAAO,IAAI,EAAE,SAAS,MAAM;KAI1B,IAAI,EAAE,MAAM,WAAW,GAAG;MACxB,SAAS,eAAe,IAAI,MAAM,MAAM,QAAQ,IAAI;OAAE,MAAM;OAAM,OAAO,CAAC;MAAE,CAAC;MAC7E;KACF;KAEA,MAAM,mBAAmB,QAAQ,EAAE,QAAQ,OAAO,2BAA2B,EAAY,CAAC,CAAC,IAAI;KAG/F,MAAM,aAAa,OAAO,QAAQ,gBAAgB,CAAC,CAAC,KAAK,CAAC,UAAU,SAAS;MAC3E,MAAM,SACJ,MAAM,MAAM,QAAQ,MAEjB,MAAM,EAAE,cAAc,CAAC,CAAC,KAAK,SAAS,YAAY,EAAE,cAAc,CAAC,CAAC,aAAa,QACpF,KAAK,KAAK,gCAAgC,KAAK,KAAK,GAAG,IAAI,IAAI,KAAK;MACtE,OAAO;OACL,MAAM;OACN,OAAO;OACP,QAAQ,OAAO;OACf,QAAQ,OAAO;OACf,MAAM,QAAQ,QAAQ;QAAE,MAAM;QAAM,OAAO;OAAI,CAAC;MAClD;KACF,CAAC;KACD,SAAS,oBAAoB;MAAE,MAAM;MAAO,IAAI;MAAM;KAAW,CAAC;IACpE,OACE,MAAM,IAAI,MAAM,wBAAwB,EAAE,KAAK,mBAAmB;GAGxE,OAAO,IAAI,MAAM,SAAS,OAAO;IAE/B,MAAM,YAAY,MAAM,cAAc;IACtC,MAAM,IAAI,SAAS,UAAU,SAAS;IACtC,MAAM,aAAa,UAAU,UAAU,MAAM;IAC7C,MAAM,cAEJ,WAAW,SAAS,SAChB,WAAW,WAAW,MAAM,MAAM,EAAE,cAAc,MAAM,QAAQ,EAAE,cAAc,MAAM,YAAY,IAAI,CAAC,CAAC,CACrG,aACH,WAAW,MAAO,QAAQ,EAAE,CAAC;IACnC,SACE,MAAM,cAAc,GACpB,GACA,SACA,MAAM,YAAY,IAAI,GACtB,MAAM,GAAG,WAAW,GACnB,UAAkB,MACnB,MAAM,gBACN,QACF;GACF,OAAO,IAAI,MAAM,SAAS,OAAO;IAC/B,MAAM,YAAY,MAAM,cAAc;IACtC,MAAM,aAAa,UAAU,UAAU,MAAM;IAC7C,IAAI,cAAc,WAAW,MAAO,QAAQ,EAAE,CAAC;IAC/C,IAAI,WAAW,SAAS,QAItB,eAFE,WAAW,WAAW,MAAM,MAAM,EAAE,cAAc,MAAM,IAAI,KAC5D,KAAK,+BAA+B,WAAW,WAAW,EAAA,CAC/B;IAE/B,MAAM,cACJ,UAAU,oBAAoB,SAAS,MAAM,kBAAkB,EAAE,MAAM,kBAAkB,UAAU;IACrG,MAAM,IAAI,SAAS,UAAU,SAAS;IACtC,SACE,WACA,GACA,SACA,MAAM,YAAY,IAAI,GACtB,MAAM,GAAG,WAAW,GACnB,UAAkB,MACnB,MAAM,gBACN,UACA,IACF;IACA,IAAI,CAAC,aAAa;KAChB,MAAM,QAAQ,OAAO,MAAM,MAAM,EAAE,UAAU,CAAC;KAC9C,IAAI,UAAU,MAAM,SAAS,WAAW,MAAM,SAAS,UACrD,MAAM,aAAa;MAAE,aAAa;MAAY,WAAW;MAAG,MAAM;KAAM;IAE5E;GACF,OAAO,IAAI,MAAM,SAAS,OAAO;IAC/B,MAAM,MAAO,UAAkB;IAC/B,MAAM,IAAI,kBAAkB,MAAM,cAAc,GAAG,GAAG;IACtD,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG;IAEzB,MAAM,KAAK,SAAS,MAAM,aAAa;IACvC,OAAO,KAAK;KACV,MAAM;KACN,OAAO;KACP,OAAO,MAAM;KACb,MAAM,MAAM,YAAY,IAAI;KAC5B,MAAM,MAAM,IAAI,MAAM,YAAY,EAAE;KACpC,YAAY;MAAE,aAAa;MAAY,WAAW;MAAI,MAAM;KAAM;IACpE,CAAC;IAED,IAAI,QAAQ,GAAG,KAAK,GAAG,SAAS,UAAU,kBAAkB,MAAM,cAAc,GAAG,WAAW,GAAG;KAC/F,MAAM,IAAI,SAAS,MAAM,cAAc,CAAC,CAAC,SAAS;KAClD,SACE,MAAM,cAAc,GACpB,GACA,SACA,MAAM,IAAI,MAAM,YAAY,EAAE,GAC9B,MAAM,GAAG,IAAI,GACb,KACA,KAAA,GACA,UACA,IACF;KACA,MAAM,QAAQ,OAAO,MAAM,MAAM,EAAE,UAAU,CAAC;KAC9C,IAAI,UAAU,MAAM,SAAS,WAAW,MAAM,SAAS,UACrD,MAAM,aAAa;MAAE,aAAa;MAAI,WAAW;MAAI,MAAM;KAAM;IAErE,OAAO,IAAI,GAAG;KACZ,MAAM,YAAY,MAAM,cAAc;KACtC,MAAM,SAAc;MAClB,YAAY,MAAM,YAAY;MAC9B,QAAQ,UAAU;MAClB,QAAQ,OAAY;OAClB,OAAO,UAAU,QAAQ,aAAa,KAAK,IACvC,QACA,YAAY,WAAW,0BAA0B,KAAK,CAAC;MAC7D;KACF;KACA,SAAS,mBAAmB;MAC1B,MAAM;MACN,OAAO;MACP,QAAQ,MAAM,YAAY;MAC1B,QAAQ,UAAU;MAClB,MAAM,QAAQ,QAAQ,CAAC;KACzB,CAAC;IACH;GACF,OAAO,IAAI,MAAM,SAAS,WAAW;IAGnC,MAAM,KAAK,SAAS,MAAM,aAAa;IACvC,OAAO,KAAK;KACV,MAAM;KACN,OAAO;KACP,OAAO,MAAM;KACb,MAAM,MAAM,YAAY,IAAI;KAC5B,MAAM,MAAM,IAAI,MAAM,YAAY,EAAE;KACpC,YAAY;MAAE,aAAa;MAAY,WAAW;MAAI,MAAM;KAAM;IACpE,CAAC;IACD,MAAM,SAAc;KAClB,YAAY,MAAM,YAAY;KAC9B,QAAQ;KACR,QAAQ,OAAY;MAClB,OAAO,UAAU,QAAQ,UAAU,KAAA,IAAY,QAAQ,MAAM,eAAe,UAAU,KAAK,CAAC,CAAC;KAC/F;IACF;IACA,iBAAkB,UAAkB,IAAI,CAAC,CAAC,SAAS,WAAW;KAC5D,SAAS,eAAe,IAAI,QAAQ,MAAM;IAC5C,CAAC;GACH,OACE,MAAM,IAAI,MAAM,qBAAqB,KAAK;EAE9C,CAAC;CACH;CAEA,SAAS,iBACP,MACA,YACA,IACA,OACA,UACA,YACM;EAEN,MAAM,cADU,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK,EAAA,CAC1B,SAAS,WAAW;GAC7C,MAAM,WAAW,IAAI,iBAAiB;GACtC,YAAY,MAAM,YAAY,QAAQ,UAAU,KAAA,GAAW,UAAU;GACrE,MAAM,YAAY,SAAS,mBAAmB;GAC9C,OAAO,YAAY,CAAC,SAAS,IAAI,CAAC;EACpC,CAAC;EACD,IAAI,WAAW,SAAS,GAAG,SAAS,oBAAoB;GAAE,MAAM;GAAO;GAAI;EAAW,CAAC;CACzF;CAEA,SAAS,WAAW,MAAsB,OAAe,SAAoC;EAC3F,MAAM,UAAU,OAAO,QAAQ,OAAO;EACtC,IAAI,QAAQ,WAAW,GAAG;EAC1B,KAAK,MAAM,CAAC,KAAK,UAAU,SAAS;GAClC,IAAI,CAAC,OAAO;GACZ,MAAM,QAAQ,KAAK,UAAU,QAAQ,KAAK,GAAG,IAAI,gBAAgB,KAAK,WAAW;GACjF,IAAI,MAAM,SAAS,eAAe,MAAM,SAAS,gBAAgB,MAAM,SAAS,QAAQ;IACtF,MAAM,SAAS,MAAM,MAAM,QAAQ;IACnC,SAAS,KAAK;KACZ,OAAO,GAAG,QAAQ,MAAM,eAAe;KACvC,QAAQ,OAAO;KACf,OAAO;IACT,CAAC;GACH,OAAO,IAAI,MAAM,SAAS,OAAO;IAE/B,IAAI,QAAQ,OAAO,MAAM,MAAM,EAAE,UAAU,MAAM,cAAc,CAAC,CAAC,SAAS;IAC1E,IAAI,OAAO;KACT,iCAAiC,OAAO,MAAM,cAAc,GAAG,MAAM,OAAO,KAAK;KACjF,WAAW,MAAM,cAAc,GAAG,MAAM,OAAO,KAAK;IACtD,OAAO;KACL,MAAM,QAAQ,MAAM,cAAc,CAAC,CAAC;KACpC,MAAM,IAAI,SAAS,KAAK;KACxB,MAAM,SAAS,MAAM,MAAM,QAAQ,EAAE,CAAC;KACtC,MAAM,KAAK,iBAAiB,MAAM,OAAO,MAAM,KAAK;KAEpD,OAAO,KAAK;MACV,OAAO;MACP;MACA,MAAM;MACN,MAAM,MAAM,IAAI,MAAM;MACtB,MAAM,MAAM,GAAG,IAAI;MACnB,UAAU;KACZ,CAAC;KACD,iCAAiC,OAAO,MAAM,cAAc,GAAG,GAAG,KAAK;KACvE,WAAW,MAAM,cAAc,GAAG,GAAG,KAAK;IAC5C;GACF,OACE,MAAM,IAAI,MAAM,qBAAqB,KAAK;EAE9C;CACF;CAGA,MAAMC,UAAQ,SAAS,KAAK,SAAS;CACrC,IAAI,KAAK,gBACP,QAAQ,KAAK,GAAG,oBAAoB,MAAMA,OAAK,CAAC;MAEhD,QAAQ,KAAK,GAAG,GAAGA,OAAK,EAAE,GAAG;CAE/B,SAAS,MAAMA,SAAO,WAAW,OAAO,OAAO,MAAM;CAGrD,IAAI,gBAAgB;EAClB,qBAAqB,cAAc;EACnC,GAAG,mBAAmB,cAAc;CACtC;CAEA,OAAO,OAAO,OAAO,EACnB,WAAW,GAAG,mBAAmB,EACnC,CAAC;CAID,uBAAuB,OAAO,aAAa;CAE3C,IAAI,MAAM,OAAO,MAAM,MAAM,EAAE,SAAS,OAAO,GAC7C,mBAAmB,KAAK;CAG1B,IAAI,SAAS;EACX,IAAI,MAAM,QAAQ,OAAO,GACvB,KAAK,MAAM,MAAM,SAAS,WAAW,MAAMA,SAAO,EAAE;OAEpD,WAAW,MAAMA,SAAO,OAAO;CAEnC;CACA,gBAAgB,OAAO,MAAMA,OAAK;CAElC,IAAI,YACF,iBAAiB,OAAO,WAAW;CAErC,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,mBAAmB,OAA8B;CAC/D,gBAAgB,OAAO,EACrB,UAAU,GAAoB;EAE5B,IAAI,EAAE,KAAK,SAAS,aAAa,EAAE,WAAW,QAAQ,EAAE,WACtD,OAAO;EAGT,MAAM,QAAQ,MAAM,OAAO,MAAM,MAAM,EAAE,UAAU,EAAE,KAAK;EAC1D,IAAI,SAAS,MAAM,SAAS,SAAS;GACnC,MAAM,OAAO,oBAAoB,MAAM,KAAK;GAC5C,OAAO;IACL,MAAM;IACN,IAAI;IACJ,YAAY,CACV,GACA;KACE,MAAM;KACN,OAAO,EAAE;KACT,QAAQ;KACR,QAAQ,KAAK;KACb,MAAM,EAAE,MAAM,WAAW;IAC3B,CACF;GACF;EACF;EACA,OAAO;CACT,EACF,CAAC;AACH;;AAGA,SAAgB,WAAW,OAAuB;CAChD,OAAO,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,WAAW,KAAK,EAAE;AAC/C;;AAUA,SAAgB,kBAAkB,MAAsB,QAA6C;CACnG,IAAI,WAAW,KAAA,GAEb;MACK,IAAI,QAAQ,MAAM,GAEvB;MACK,IAAI,QAAQ,MAAM,GAOvB,OAAO;EAAE,MAAM;EAAQ,WAAW,CAAC;CAAE;MAChC,IAAI,WAAW,MACpB,OAAO,EAAE,MAAM,UAAU;MACpB,IAAI,OAAO,WAAW,YAAY,OAAO,WAAW,UACzD,OAAO;EAAE,MAAM;EAAM,OAAO;CAAO;MAC9B,IAAI,OAAO,WAAW,WAC3B,OAAO,SAAS,EAAE,MAAM,WAAW,IAAI,EAAE,MAAM,UAAU;MACpD,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO;EACL,MAAM;EACN,OAAO,OAAO,KAAK,MAAgC;GACjD,OAAO,SAAS,CAAC,IAAK,EAAE,iBAAiB,WAAW,IAAI,IAAK;EAC/D,CAAC;CACH;MACK,IAAI,SAAS,MAAM,GACxB,OAAO;EAAE,MAAM;EAAM,OAAO,OAAO,iBAAiB,WAAW,IAAI;CAAE;MAChE,IAAI,OAAO,WAAW,UAAU;EAErC,MAAM,OAAO,OAAO,KAAK,MAAM;EAE/B,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,WAAW;QACrB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAI,SAAS,KAAK,GACvB,OAAO;IAAE,MAAM;IAAM,OAAO,MAAM,iBAAiB,WAAW,IAAI;GAAE;QAEpE,MAAM,IAAI,MAAM,0BAA0B,OAAO;EAErD;EAEA,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,MAAM;GACzC,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GACZ;QACK,IAAI,UAAU,MACnB,OAAO,EAAE,MAAM,UAAU;QACpB,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UACvD,OAAO;IAAE,MAAM;IAAM;GAAM;QACtB,IAAI,SAAS,KAAK,GACvB,OAAO;IAAE,MAAM;IAAM,OAAO,MAAM,iBAAiB,WAAW,IAAI;GAAE;QAEpE,OAAO,iBAAiB,KAAK,CAAC,CAAC;EAEnC;EAIA,MAAM,YAAY,CAAC;EACnB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAC9C,IAAI,SAAS,OAAO,UAAU,YAAY,CAAC,cAAc,KAAK,KAAK,mBAAmB,OACpF,UAAU,OAAO,MAAM,iBAAiB,WAAW,IAAI;OAEvD,UAAU,OAAO;EAGrB,OAAO;GAAE,MAAM;GAAQ;EAAU;CACnC,OACE,MAAM,IAAI,MAAM,uBAAuB,QAAQ;AAEnD;;;;;;;;;;;;;AAcA,SAAS,WAAW,MAA2B;CAC7C,QAAQ,KAAK,UAAb;EACE,KAAK;EACL,KAAK,UACH,OAAO;EACT,KAAK,QACH,OAAO;EACT,KAAK,QACH,OAAO;EACT,SACE,OAAO,YAAY,KAAK,QAAQ;CACpC;AACF;AAEA,SAAS,aAAa,OAAqB;CACzC,OAAO,UAAU,MAAM,UAAU;AACnC;;AAGA,SAAgB,gBAAgB,MAAsB,KAA4D;CAChH,OACE,KAAK,UAAU,QACf,KAAK,sBAAsB,QAC3B,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,MAAM,UAAU,MAAM,gBAAgB,GAAG,KACvE,OAAO,OAAO,KAAK,uBAAuB,CAAC,CAAC,CAAC,CAAC,MAAM,UAAU,MAAM,gBAAgB,GAAG;AAE3F;;;;;;;AAyCA,SAAgB,iBAAoB,QAAqD;CACvF,IAAI,WAAW,MACb,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;MACtB,IAAI,WAAW,KAAA,GAEpB,OAAO,CAAC;MACH,IAAI,MAAM,QAAQ,MAAM,GAC7B,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;MAChC,IAAI,cAAc,MAAM,GAAG;EAChC,MAAM,OAAO,OAAO,KAAK,MAAM;EAC/B,IAAI,KAAK,WAAW,GAElB,OAAO,CAAC;OACH,IAAI,KAAK,WAAW,KAAK,QAAQ,UAAU,WAAW,QAAQ;GAEnE,MAAM,EAAE,IAAI,UAAU;GACtB,IAAI,uBAAuB,IAAI,KAAK,GAClC,OAAO,CAAC;QACH,IAAI,UAAU,MACnB,OAAO,CAAC,EAAE,MAAM,UAAU,CAAC;QAE3B,OAAO,CAAC;IAAE,MAAM;IAAI,OAAO,SAAS;GAAK,CAAC;EAE9C,OAAO,IAAI,KAAK,WAAW,KAAK,SAAS,UAAU,SAAS,QAAQ;GAClE,MAAM,EAAE,KAAK,QAAQ;GACrB,OAAO,CAAC;IAAE,MAAM;IAAW,OAAO,CAAC,KAAK,GAAG;GAAE,CAAC;EAChD,OACE,OAAO,OAAO,QAAQ,MAAM,CAAC,CAC1B,KAAK,CAAC,KAAK,WAAW;GAErB,IAAI,uBAAuB,KAAK,KAAK,GACnC;GAEF,QAAQ,KAAR;IACE,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,UAAmB;SAElC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO;IAAK;IAErD,KAAK,MACH,IAAI,UAAU,MACZ,OAAO,EAAE,MAAM,WAAoB;SAEnC,OAAO;KAAE,MAAM;KAAe,OAAO,OAAO,QAAQ;IAAK;IAE7D,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,eACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,KAAK,cACH,OAAO;KAAE,MAAM;KAA2B,OAAO,OAAO;IAAK;IAC/D,KAAK,cACH,OAAO;KAAE,MAAM;KAA8B,OAAO,OAAO;IAAK;IAClE,KAAK,UACH,OAAO;KAAE,MAAM;KAAkB,OAAO,SAAS,OAAO,IAAI;IAAE;IAChE,KAAK,WACH,OAAO;KAAE,MAAM;KAAK,OAAO,OAAO;IAAK;IACzC,SACE,MAAM,IAAI,MAAM,gCAAgC,KAAK;GACzD;EACF,CAAC,CAAC,CACD,OAAO,SAAS;CAEvB,OAEE,OAAO,CAAC;EAAE,MAAM;EAAM,OAAO;CAAO,CAAC;AAEzC;;AAGA,SAAgB,QAAQ,QAAgB,QAAwD;CAM9F,QAAQ,OAAO,MAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GACH,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAC1C,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,OAAO;IAAE,MAAM;IAAY,OAAO,OAAO,QAAQ,OAAO,KAAK;GAAE;QAE/D,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;GACH,IAAI,OAAO,SAET,MAAM,IAAI,MAAM,wDAAwD;QAExE,OAAO,QAAQ,OAAO,MAAM,KAAK,MAAM,OAAO,QAAQ,CAAC,CAAC;GAE1D,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GAEH,IAAI,EADqB,OAAO,WAAW,OAAO,WAAW,UAE3D,MAAM,IAAI,MAAM,GAAG,OAAO,KAAK,+CAA+C;GAEhF,IAAI,OAAO,SACT,OAAO,QAAQ,OAAO,QAAQ,OAAO,KAAK;GAI5C,OAAO;EACT,KAAK;GACH,OAAO,QAAQ,CAAC,OAAO,QAAQ,OAAO,MAAM,EAAE,GAAG,OAAO,QAAQ,OAAO,MAAM,EAAE,CAAC;GAChF,OAAO;EACT,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,qBACH,OAAO;EACT,SACE,MAAM,YAAY,MAAM;CAC5B;AACF;;AAGA,SAAgB,gBAAgB,OAAwB,MAAsB,OAAqB;CACjG,MAAM,EAAE,aAAa;CACrB,IAAI,KAAK,SAAS;EAEhB,MAAM,UADQ,KAAK,UAAU,KAAK,YAAY,KAAK,GAAG,KAAK,QAAQ,gBAAgB,KAAK,WAAW,EAAA,CAC9E,MAAO,QAAQ,EAAE,CAAC;EAEvC,IAAI,CADe,SAAS,MAAM,MAAM,EAAE,UAAU,SAAS,EAAE,WAAW,MAC5D,GACZ,SAAS,KAAK;GAAE;GAAO;GAAQ,OAAO;EAAM,CAAC;CAEjD;CAGA,IAAI,CADe,SAAS,MAAM,MAAM,EAAE,UAAU,SAAS,EAAE,WAAW,IAC5D,GACZ,SAAS,KAAK;EAAE;EAAO,QAAQ;EAAM,OAAO;CAAM,CAAC;AAEvD;AAEA,SAAgB,iCACd,OACA,MACA,OACA,WACM;CACN,IAAI,CAAC,wBAAwB,IAAI,GAAG;CACpC,MAAM,EAAE,SAAS,WAAW;CAE5B,KAAK,UAAU,SAAS,IAAI,MAAM;EAChC,IAAI,WACF,QAAQ,KAAK,GAAG,MAAM,IAAI,EAAE,GAAG;EAEjC,OAAO,KAAK;GACV,OAAO,GAAG,MAAM,IAAI;GACpB,OAAO,GAAG;GACV,MAAM;GACN,MAAM,MAAM,OAAO,IAAI;GACvB,MAAM,GAAG,MAAM,IAAI,EAAE;GACrB,UAAU;EACZ,CAAC;CACH,CAAC;CAKD,IAAI,WAAW;EAGb,MAAM,YAAuD,CAAC;EAG9D,KAAK,SAAS,SAAS,IAAI,MAAM;GAC/B,MAAM,UAAU,GAAG,MAAM,IAAI;GAC7B,QAAQ,KAAK,GAAG,QAAQ,GAAG;GAC3B,OAAO,KAAK;IACV,OAAO;IACP,OAAO,GAAG;IACV,MAAM;IACN,MAAM,MAAM,OAAO,IAAI;IACvB,MAAM,GAAG,MAAM,IAAI,EAAE;IACrB,UAAU;GACZ,CAAC;GACD,KAAK,MAAM,SAAS,OAAO,OAAO,GAAG,MAAM,GACzC,IAAI,MAAM,cAAc,QAAQ,MAAM,OACpC,KAAK,MAAM,KAAK,MAAM,OAAO,SAC3B,UAAU,KAAK;IAAE;IAAS,YAAY,EAAE;GAAW,CAAC;EAI5D,CAAC;EAGD,QAAQ,KAAK,GAAG,GAAG,KAAK,EAAE,UAAU;EAGpC,OAAO,OAAO,QAAQ,YAAY,MAAM,EAAE,UAAU,CAAC,CAAC,CACnD,QAAQ,YAAY,QAAQ,SAAS,CAAC,CAAC,CACvC,SAAS,YAAY;GACpB,MAAM,EAAE,eAAe,QAAQ;GAC/B,QAAQ,KAAK,YAAY,QAAQ,KAAK,MAAM,GAAG,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,YAAY;EAC1G,CAAC;EAGH,MAAM,QAAQ,KAAK,SAAS,KAAK,IAAI,MAAM,QAAQ,MAAM,IAAI,EAAE,wBAAwB,GAAG,KAAK,EAAE;EACjG,IAAI,MAAM,SAAS,GACjB,QAAQ,KAAK,QAAQ,MAAM,KAAK,GAAG,EAAE,yBAAyB;CAElE;AACF;;;;;;;AAQA,SAAgB,oBAAoB,MAAsB,OAAyB;CACjF,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,MAAM,GAAG;EAC9C,IAAI,CAAC,MAAM,OAAO;EAClB,IAAI,MAAM,SAAS,eAAe,MAAM,MAAM;EAC9C,KAAK,MAAM,UAAU,MAAM,MAAM,SAAS,QAAQ,KAAK,MAAM,OAAO,OAAO,UAAU,CAAC;CACxF;CACA,OAAO;AACT;;AAGA,SAAS,qBAAqB,WAA6C;CACzE,IAAI,CAAC,WAAW;CAChB,IAAI,oBAAoB,SAAS,KAAM,kBAAkB,aAAa,UAAU,oBAAoB,OAClG,KAAK,4GAA4G;CAEnH,IAAI,SAAS,aAAa,UAAU,KAClC,KAAK,MAAM,SAAS,UAAU,KAAK,qBAAqB,KAAK;MACxD,IAAI,QAAQ,aAAa,UAAU,IACxC,KAAK,MAAM,SAAS,UAAU,IAAI,qBAAqB,KAAK;AAEhE;;AAGA,SAAS,uBACP,OACA,UACM;CACN,SAAS,QAAQ,QAA4D;EAC3E,OAAO,SAAS,IAAI,MAAM,KAAK,KAAK,aAAa,OAAO,UAAU,2CAA2C;CAC/G;CACA,SAAS,aAAuD,GAAqB;EACnF,OAAO,yBAAyB,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,IAAI,KAAA;CACtE;CACA,gBAAgB,OAAO;EAAE,WAAW;EAAc,UAAU;CAAa,CAAC;AAC5E;AAEA,SAAgB,uBACd,YACA,MACA,OACA,aACM;CACN,IAAI,kBAAkB,MAAM,WAAW,GAAG;EACxC,MAAM,SAAS,KAAK,UAAU,YAAY,IAAI,CAAC,CAAC,gBAAiB,UAAW,CAAC,OAAO,QAAQ;EAC5F,WAAW,KAAK;GACd,MAAM;GACN;GACA,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf,MAAM,EAAE,MAAM,UAAU;EAC1B,CAAC;CACH;AACF;AAEA,SAAgB,kBAAkB,MAAsB,aAA6C;CACnG,OACE,gBAAgB,aAChB,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,iBAAiB,cAEpC,KAAK,oBAAoB,SAAS,KAAK,UAAU,WAAW;AAEjE;AAEA,SAAgB,UAAU,OAA2F;CACnH,IAAI;CACJ,MAAM,QAAqB,CAAC;CAC5B,MAAM,WAA+B,CAAC;CACtC,MAAM,UAA4B,CAAC;CACnC,KAAK,MAAM,SAAS,MAAM,QACxB,IAAI,MAAM,SAAS,WACjB,UAAU;MACL,IAAI,MAAM,SAAS,WACxB,SAAS,KAAK,KAAK;MACd,IAAI,MAAM,SAAS,SACxB,QAAQ,KAAK,KAAK;MAElB,MAAM,KAAK,KAAK;CAGpB,OAAO;EAAC;EAAU;EAAO;EAAU;CAAO;AAC5C;AAEA,SAAS,wBAAwB,MAA+B;CAC9D,OAAO,KAAK,oBAAoB,UAAU,KAAK,SAAS,SAAS,KAAK,KAAK,UAAU,SAAS;AAChG;AAEA,SAAS,sBAAsB,MAA+B;CAC5D,OAAO,KAAK,oBAAoB,SAAS,CAAC,KAAK;AACjD;AAEA,SAAS,oBAAoB,IAAsB,aAA6B,OAAqB;CACnG,MAAM,OAAO,iBAAiB,aAAa,KAAK;CAChD,IAAI,MAAM,GAAG,mBAAmB,IAAI;AACtC;;AAGA,SAAgB,iBAAiB,MAAsB,OAA4C;CACjG,IAAI,KAAK,oBAAoB,SAAS,KAAK,0BAA0B,KAAA,GAAW,OAAO,KAAA;CACvF,MAAM,WAAW,YAAY,IAAI;CACjC,MAAM,SAAS,SAAS,OAAO,SAAS,sBAAuB,CAAC,OAAO,QAAQ;CAC/E,OAAO;EACL,MAAM;EACN;EACA,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,MAAM;GAAE,MAAM;GAAM,OAAO,KAAK;EAAsB;EACtD,WAAW;CACb;AACF;;AAGA,SAAgB,SAAS,QAA8B;CACrD,OAAO,SAAS,IAAI,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK,KAAA;AACvD;;AAGA,SAAS,uBAAuB,KAAc,OAAyB;CACrE,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,OAAO,UAAU,SAAS,QAAQ,QAAQ,QAAQ;AACpD"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryParser.pruning.cjs","names":["parseAlias"],"sources":["../src/QueryParser.pruning.ts"],"sourcesContent":["import {\n type ColumnCondition,\n type ExistsCondition,\n type JoinTable,\n type ParsedExpressionFilter,\n type ParsedFindQuery,\n type RawCondition,\n parseAlias,\n} from \"./QueryParser.ts\";\nimport { assertNever } from \"./utils.ts\";\n\n// Remove any joins that are not used in the select or conditions\nexport function pruneUnusedJoins(parsed: ParsedFindQuery, keepAliases: string[]): void {\n const dt = new DependencyTracker();\n\n // First setup the alias -> alias dependencies...\n const todo = [...parsed.tables];\n while (todo.length > 0) {\n const t = todo.pop()!;\n if (t.join === \"lateral\") {\n dt.addAlias(t.alias, [t.fromAlias]);\n // Recurse into lateral joins...\n todo.push(...t.query.tables);\n } else if (t.join === \"cross\") {\n dt.markRequired(t.alias);\n } else if (t.join === \"primary\") {\n dt.markRequired(t.alias);\n } else if (parsed.ctes?.some((cte) => cte.alias === t.table)) {\n dt.addAlias(t.alias, joinDependencies(t));\n dt.markRequired(t.alias);\n } else {\n dt.addAlias(t.alias, joinDependencies(t));\n }\n }\n\n // Mark all terminal usages\n parsed.selects.forEach((s) => {\n if (typeof s === \"string\") {\n markSelectAliases(dt, parsed, s);\n } else if (\"aliases\" in s) {\n for (const a of s.aliases) dt.markRequired(a);\n markSelectAliases(dt, parsed, s.sql);\n }\n });\n parsed.orderBys.forEach((o) => dt.markRequired(o.alias));\n parsed.groupBys?.forEach((g) => {\n if (\"expression\" in g) {\n markSelectAliases(dt, parsed, g.expression);\n } else {\n dt.markRequired(g.alias);\n }\n });\n keepAliases.forEach((a) => dt.markRequired(a));\n // Look recursively into CTE & lateral join conditions\n const todo2 = [{ query: parsed, filterPruneable: true }];\n while (todo2.length > 0) {\n const { query, filterPruneable } = todo2.pop()!;\n deepFindConditions(query.condition, filterPruneable).forEach((c) => {\n if (c.kind === \"column\") {\n dt.markRequired(c.alias);\n } else if (c.kind === \"raw\") {\n for (const alias of c.aliases) dt.markRequired(alias);\n } else if (c.kind === \"exists\") {\n for (const alias of c.outerAliases) dt.markRequired(alias);\n } else {\n assertNever(c);\n }\n });\n todo2.push(\n ...query.tables.filter((t) => t.join === \"lateral\").map((t) => ({ query: t.query, filterPruneable: false })),\n );\n }\n\n // Now remove any unused joins\n parsed.tables = parsed.tables.filter((t) => dt.required.has(t.alias));\n\n // And then remove any inline soft-delete conditions we don't need anymore\n if (parsed.condition && parsed.condition.op === \"and\") {\n parsed.condition.conditions = parsed.condition.conditions.filter((c) => {\n if (c.kind === \"column\") {\n const prune = c.pruneable && !dt.required.has(c.alias);\n // if (prune) console.log(`DROPPING`, c);\n return !prune;\n } else {\n return c;\n }\n });\n }\n\n // Remove any `{ and: [...] }`s that are empty; we should probably do this deeply?\n if (parsed.condition && parsed.condition.conditions.length === 0) {\n parsed.condition = undefined;\n }\n}\n\n/** Returns the aliases needed to evaluate a join's ON clause, excluding the joined alias itself. */\nfunction joinDependencies(t: JoinTable): string[] {\n return [parseAlias(t.col1), parseAlias(t.col2)].filter((alias) => alias !== t.alias);\n}\n\n/** Marks aliases used by select strings, including generated CTI expressions like `COALESCE(st0.col, st1.col)`. */\nfunction markSelectAliases(dt: DependencyTracker, parsed: ParsedFindQuery, select: string): void {\n for (const table of parsed.tables) {\n if (selectReferencesAlias(select, table.alias)) {\n dt.markRequired(table.alias);\n }\n }\n}\n\n/** Returns true if a raw select expression references `alias.column` or the whole-row `alias`. */\nexport function selectReferencesAlias(select: string, alias: string): boolean {\n // Most selects are simple `a.*`, but CTI adds expressions like\n // `COALESCE(p_s0.shared_column, p_s1.shared_column) as shared_column`.\n // Those expressions must keep the subtype joins, but `parseAlias` only sees\n // the leading function name. Instead of parsing SQL, scan for the only alias\n // forms Joist generates in selects: `alias.column`, `\"alias\".column`, and whole-row aliases.\n return (\n selectReferencesCandidate(select, `${alias}.`) ||\n selectReferencesCandidate(select, `\"${alias}\".`) ||\n selectReferencesCandidate(select, alias) ||\n selectReferencesCandidate(select, `\"${alias}\"`)\n );\n}\n\n/**\n * Returns true when `candidate` is present at a SQL identifier boundary.\n *\n * Scans the select string for literal candidate matches, then verifies the characters before/after the match are not\n * part of a larger identifier or dotted path. I.e. `row_to_json(\"ap\")` matches, but `foo_\"ap\"` and `foo.ap` do not.\n */\nfunction selectReferencesCandidate(select: string, candidate: string): boolean {\n let index = select.indexOf(candidate);\n const quoted = candidate.startsWith('\"');\n while (index !== -1) {\n // Each loop inspects one literal occurrence of `candidate`, then either accepts it as a real alias reference or\n // advances to the next occurrence if the surrounding characters show it is part of a larger token.\n // Avoid treating `foo.a.id` as a reference to `a`; Joist-generated aliases\n // appear at the start of an expression or after punctuation/whitespace.\n const previous = select[index - 1];\n const next = select[index + candidate.length];\n if (\n (index === 0 || (previous !== \".\" && !isSqlIdentifierChar(previous))) &&\n !isSqlIdentifierChar(next) &&\n (quoted || (previous !== '\"' && next !== '\"'))\n ) {\n return true;\n }\n // Continue scanning after the current occurrence; `indexOf` returns -1 once there are no more candidates.\n index = select.indexOf(candidate, index + candidate.length);\n }\n return false;\n}\n\n/** Returns true for characters that can be part of an unquoted SQL identifier. */\nfunction isSqlIdentifierChar(char: string | undefined): boolean {\n return char !== undefined && /[A-Za-z0-9_]/.test(char);\n}\n\n/** Pulls out a flat list of all `ColumnCondition`s from a `ParsedExpressionFilter` tree. */\nexport function deepFindConditions(\n condition: ParsedExpressionFilter | undefined,\n filterPruneable: boolean,\n): (ColumnCondition | RawCondition | ExistsCondition)[] {\n const todo = condition ? [condition] : [];\n const result: (ColumnCondition | RawCondition | ExistsCondition)[] = [];\n while (todo.length !== 0) {\n const cc = todo.pop()!;\n for (const c of cc.conditions) {\n if (c.kind === \"exp\") {\n todo.push(c);\n } else if (c.kind === \"column\" || c.kind === \"raw\") {\n if (!filterPruneable || !c.pruneable) result.push(c);\n } else if (c.kind === \"exists\") {\n result.push(c);\n } else {\n assertNever(c);\n }\n }\n }\n return result;\n}\n\n/** Track join dependencies for `pruneUnusedJoins`. */\nclass DependencyTracker {\n private nodes: Map<string, string[]> = new Map();\n required: Set<string> = new Set();\n\n addAlias(alias: string, dependencies: string[] = []): void {\n this.nodes.set(alias, dependencies);\n }\n\n markRequired(alias: string): void {\n const marked = new Set<string>();\n const todo = [alias];\n while (todo.length > 0) {\n const alias = todo.pop()!;\n if (!marked.has(alias)) {\n marked.add(alias);\n todo.push(...(this.nodes.get(alias) || []));\n }\n }\n this.required = new Set([...this.required, ...marked]);\n }\n}\n"],"mappings":";;;;AAYA,SAAgB,iBAAiB,QAAyB,aAA6B;CACrF,MAAM,KAAK,IAAI,kBAAkB;CAGjC,MAAM,OAAO,CAAC,GAAG,OAAO,MAAM;CAC9B,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,IAAI,KAAK,IAAI;EACnB,IAAI,EAAE,SAAS,WAAW;GACxB,GAAG,SAAS,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;GAElC,KAAK,KAAK,GAAG,EAAE,MAAM,MAAM;EAC7B,OAAO,IAAI,EAAE,SAAS,SACpB,GAAG,aAAa,EAAE,KAAK;OAClB,IAAI,EAAE,SAAS,WACpB,GAAG,aAAa,EAAE,KAAK;OAClB,IAAI,OAAO,MAAM,MAAM,QAAQ,IAAI,UAAU,EAAE,KAAK,GAAG;GAC5D,GAAG,SAAS,EAAE,OAAO,iBAAiB,CAAC,CAAC;GACxC,GAAG,aAAa,EAAE,KAAK;EACzB,OACE,GAAG,SAAS,EAAE,OAAO,iBAAiB,CAAC,CAAC;CAE5C;CAGA,OAAO,QAAQ,SAAS,MAAM;EAC5B,IAAI,OAAO,MAAM,UACf,kBAAkB,IAAI,QAAQ,CAAC;OAC1B,IAAI,aAAa,GAAG;GACzB,KAAK,MAAM,KAAK,EAAE,SAAS,GAAG,aAAa,CAAC;GAC5C,kBAAkB,IAAI,QAAQ,EAAE,GAAG;EACrC;CACF,CAAC;CACD,OAAO,SAAS,SAAS,MAAM,GAAG,aAAa,EAAE,KAAK,CAAC;CACvD,OAAO,UAAU,SAAS,MAAM;EAC9B,IAAI,gBAAgB,GAClB,kBAAkB,IAAI,QAAQ,EAAE,UAAU;OAE1C,GAAG,aAAa,EAAE,KAAK;CAE3B,CAAC;CACD,YAAY,SAAS,MAAM,GAAG,aAAa,CAAC,CAAC;CAE7C,MAAM,QAAQ,CAAC;EAAE,OAAO;EAAQ,iBAAiB;CAAK,CAAC;CACvD,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,EAAE,OAAO,oBAAoB,MAAM,IAAI;EAC7C,mBAAmB,MAAM,WAAW,eAAe,CAAC,CAAC,SAAS,MAAM;GAClE,IAAI,EAAE,SAAS,UACb,GAAG,aAAa,EAAE,KAAK;QAClB,IAAI,EAAE,SAAS,OACpB,KAAK,MAAM,SAAS,EAAE,SAAS,GAAG,aAAa,KAAK;QAC/C,IAAI,EAAE,SAAS,UACpB,KAAK,MAAM,SAAS,EAAE,cAAc,GAAG,aAAa,KAAK;QAEzD,cAAA,YAAY,CAAC;EAEjB,CAAC;EACD,MAAM,KACJ,GAAG,MAAM,OAAO,QAAQ,MAAM,EAAE,SAAS,SAAS,CAAC,CAAC,KAAK,OAAO;GAAE,OAAO,EAAE;GAAO,iBAAiB;EAAM,EAAE,CAC7G;CACF;CAGA,OAAO,SAAS,OAAO,OAAO,QAAQ,MAAM,GAAG,SAAS,IAAI,EAAE,KAAK,CAAC;CAGpE,IAAI,OAAO,aAAa,OAAO,UAAU,OAAO,OAC9C,OAAO,UAAU,aAAa,OAAO,UAAU,WAAW,QAAQ,MAAM;EACtE,IAAI,EAAE,SAAS,UAGb,OAAO,EAFO,EAAE,aAAa,CAAC,GAAG,SAAS,IAAI,EAAE,KAAK;OAIrD,OAAO;CAEX,CAAC;CAIH,IAAI,OAAO,aAAa,OAAO,UAAU,WAAW,WAAW,GAC7D,OAAO,YAAY,KAAA;AAEvB;;AAGA,SAAS,iBAAiB,GAAwB;CAChD,OAAO,CAACA,oBAAAA,WAAW,EAAE,IAAI,GAAGA,oBAAAA,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,UAAU,UAAU,EAAE,KAAK;AACrF;;AAGA,SAAS,kBAAkB,IAAuB,QAAyB,QAAsB;CAC/F,KAAK,MAAM,SAAS,OAAO,QACzB,IAAI,sBAAsB,QAAQ,MAAM,KAAK,GAC3C,GAAG,aAAa,MAAM,KAAK;AAGjC;;AAGA,SAAgB,sBAAsB,QAAgB,OAAwB;CAM5E,OACE,0BAA0B,QAAQ,GAAG,MAAM,EAAE,KAC7C,0BAA0B,QAAQ,IAAI,MAAM,GAAG,KAC/C,0BAA0B,QAAQ,KAAK,KACvC,0BAA0B,QAAQ,IAAI,MAAM,EAAE;AAElD;;;;;;;AAQA,SAAS,0BAA0B,QAAgB,WAA4B;CAC7E,IAAI,QAAQ,OAAO,QAAQ,SAAS;CACpC,MAAM,SAAS,UAAU,WAAW,IAAG;CACvC,OAAO,UAAU,IAAI;EAKnB,MAAM,WAAW,OAAO,QAAQ;EAChC,MAAM,OAAO,OAAO,QAAQ,UAAU;EACtC,KACG,UAAU,KAAM,aAAa,OAAO,CAAC,oBAAoB,QAAQ,MAClE,CAAC,oBAAoB,IAAI,MACxB,UAAW,aAAa,QAAO,SAAS,OAEzC,OAAO;EAGT,QAAQ,OAAO,QAAQ,WAAW,QAAQ,UAAU,MAAM;CAC5D;CACA,OAAO;AACT;;AAGA,SAAS,oBAAoB,MAAmC;CAC9D,OAAO,SAAS,KAAA,KAAa,eAAe,KAAK,IAAI;AACvD;;AAGA,SAAgB,mBACd,WACA,iBACsD;CACtD,MAAM,OAAO,YAAY,CAAC,SAAS,IAAI,CAAC;CACxC,MAAM,SAA+D,CAAC;CACtE,OAAO,KAAK,WAAW,GAAG;EACxB,MAAM,KAAK,KAAK,IAAI;EACpB,KAAK,MAAM,KAAK,GAAG,YACjB,IAAI,EAAE,SAAS,OACb,KAAK,KAAK,CAAC;OACN,IAAI,EAAE,SAAS,YAAY,EAAE,SAAS,OACvC;OAAA,CAAC,mBAAmB,CAAC,EAAE,WAAW,OAAO,KAAK,CAAC;EAAA,OAC9C,IAAI,EAAE,SAAS,UACpB,OAAO,KAAK,CAAC;OAEb,cAAA,YAAY,CAAC;CAGnB;CACA,OAAO;AACT;;AAGA,IAAM,oBAAN,MAAwB;CACtB,wBAAuC,IAAI,IAAI;CAC/C,2BAAwB,IAAI,IAAI;CAEhC,SAAS,OAAe,eAAyB,CAAC,GAAS;EACzD,KAAK,MAAM,IAAI,OAAO,YAAY;CACpC;CAEA,aAAa,OAAqB;EAChC,MAAM,yBAAS,IAAI,IAAY;EAC/B,MAAM,OAAO,CAAC,KAAK;EACnB,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,QAAQ,KAAK,IAAI;GACvB,IAAI,CAAC,OAAO,IAAI,KAAK,GAAG;IACtB,OAAO,IAAI,KAAK;IAChB,KAAK,KAAK,GAAI,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC,CAAE;GAC5C;EACF;EACA,KAAK,2BAAW,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,GAAG,MAAM,CAAC;CACvD;AACF"}
|
|
@@ -1,10 +0,0 @@
|
|
|
1
|
-
import { ColumnCondition, ExistsCondition, ParsedExpressionFilter, ParsedFindQuery, RawCondition } from "./QueryParser.cjs";
|
|
2
|
-
//#region src/QueryParser.pruning.d.ts
|
|
3
|
-
declare function pruneUnusedJoins(parsed: ParsedFindQuery, keepAliases: string[]): void;
|
|
4
|
-
/** Returns true if a raw select expression references `alias.column` or the whole-row `alias`. */
|
|
5
|
-
declare function selectReferencesAlias(select: string, alias: string): boolean;
|
|
6
|
-
/** Pulls out a flat list of all `ColumnCondition`s from a `ParsedExpressionFilter` tree. */
|
|
7
|
-
declare function deepFindConditions(condition: ParsedExpressionFilter | undefined, filterPruneable: boolean): (ColumnCondition | RawCondition | ExistsCondition)[];
|
|
8
|
-
//#endregion
|
|
9
|
-
export { deepFindConditions, pruneUnusedJoins, selectReferencesAlias };
|
|
10
|
-
//# sourceMappingURL=QueryParser.pruning.d.cts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryParser.pruning.d.cts","names":[],"sources":["../src/QueryParser.pruning.ts"],"mappings":";;iBAYgB,iBAAiB,QAAQ,iBAAiB;;iBAkG1C,sBAAsB,gBAAgB;;iBAiDtC,mBACd,WAAW,oCACX,4BACE,kBAAkB,eAAe"}
|
|
@@ -1,10 +0,0 @@
|
|
|
1
|
-
import { ColumnCondition, ExistsCondition, ParsedExpressionFilter, ParsedFindQuery, RawCondition } from "./QueryParser.mjs";
|
|
2
|
-
//#region src/QueryParser.pruning.d.ts
|
|
3
|
-
declare function pruneUnusedJoins(parsed: ParsedFindQuery, keepAliases: string[]): void;
|
|
4
|
-
/** Returns true if a raw select expression references `alias.column` or the whole-row `alias`. */
|
|
5
|
-
declare function selectReferencesAlias(select: string, alias: string): boolean;
|
|
6
|
-
/** Pulls out a flat list of all `ColumnCondition`s from a `ParsedExpressionFilter` tree. */
|
|
7
|
-
declare function deepFindConditions(condition: ParsedExpressionFilter | undefined, filterPruneable: boolean): (ColumnCondition | RawCondition | ExistsCondition)[];
|
|
8
|
-
//#endregion
|
|
9
|
-
export { deepFindConditions, pruneUnusedJoins, selectReferencesAlias };
|
|
10
|
-
//# sourceMappingURL=QueryParser.pruning.d.mts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryParser.pruning.d.mts","names":[],"sources":["../src/QueryParser.pruning.ts"],"mappings":";;iBAYgB,iBAAiB,QAAQ,iBAAiB;;iBAkG1C,sBAAsB,gBAAgB;;iBAiDtC,mBACd,WAAW,oCACX,4BACE,kBAAkB,eAAe"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryParser.pruning.js","names":[],"sources":["../src/QueryParser.pruning.ts"],"sourcesContent":["import {\n type ColumnCondition,\n type ExistsCondition,\n type JoinTable,\n type ParsedExpressionFilter,\n type ParsedFindQuery,\n type RawCondition,\n parseAlias,\n} from \"./QueryParser.ts\";\nimport { assertNever } from \"./utils.ts\";\n\n// Remove any joins that are not used in the select or conditions\nexport function pruneUnusedJoins(parsed: ParsedFindQuery, keepAliases: string[]): void {\n const dt = new DependencyTracker();\n\n // First setup the alias -> alias dependencies...\n const todo = [...parsed.tables];\n while (todo.length > 0) {\n const t = todo.pop()!;\n if (t.join === \"lateral\") {\n dt.addAlias(t.alias, [t.fromAlias]);\n // Recurse into lateral joins...\n todo.push(...t.query.tables);\n } else if (t.join === \"cross\") {\n dt.markRequired(t.alias);\n } else if (t.join === \"primary\") {\n dt.markRequired(t.alias);\n } else if (parsed.ctes?.some((cte) => cte.alias === t.table)) {\n dt.addAlias(t.alias, joinDependencies(t));\n dt.markRequired(t.alias);\n } else {\n dt.addAlias(t.alias, joinDependencies(t));\n }\n }\n\n // Mark all terminal usages\n parsed.selects.forEach((s) => {\n if (typeof s === \"string\") {\n markSelectAliases(dt, parsed, s);\n } else if (\"aliases\" in s) {\n for (const a of s.aliases) dt.markRequired(a);\n markSelectAliases(dt, parsed, s.sql);\n }\n });\n parsed.orderBys.forEach((o) => dt.markRequired(o.alias));\n parsed.groupBys?.forEach((g) => {\n if (\"expression\" in g) {\n markSelectAliases(dt, parsed, g.expression);\n } else {\n dt.markRequired(g.alias);\n }\n });\n keepAliases.forEach((a) => dt.markRequired(a));\n // Look recursively into CTE & lateral join conditions\n const todo2 = [{ query: parsed, filterPruneable: true }];\n while (todo2.length > 0) {\n const { query, filterPruneable } = todo2.pop()!;\n deepFindConditions(query.condition, filterPruneable).forEach((c) => {\n if (c.kind === \"column\") {\n dt.markRequired(c.alias);\n } else if (c.kind === \"raw\") {\n for (const alias of c.aliases) dt.markRequired(alias);\n } else if (c.kind === \"exists\") {\n for (const alias of c.outerAliases) dt.markRequired(alias);\n } else {\n assertNever(c);\n }\n });\n todo2.push(\n ...query.tables.filter((t) => t.join === \"lateral\").map((t) => ({ query: t.query, filterPruneable: false })),\n );\n }\n\n // Now remove any unused joins\n parsed.tables = parsed.tables.filter((t) => dt.required.has(t.alias));\n\n // And then remove any inline soft-delete conditions we don't need anymore\n if (parsed.condition && parsed.condition.op === \"and\") {\n parsed.condition.conditions = parsed.condition.conditions.filter((c) => {\n if (c.kind === \"column\") {\n const prune = c.pruneable && !dt.required.has(c.alias);\n // if (prune) console.log(`DROPPING`, c);\n return !prune;\n } else {\n return c;\n }\n });\n }\n\n // Remove any `{ and: [...] }`s that are empty; we should probably do this deeply?\n if (parsed.condition && parsed.condition.conditions.length === 0) {\n parsed.condition = undefined;\n }\n}\n\n/** Returns the aliases needed to evaluate a join's ON clause, excluding the joined alias itself. */\nfunction joinDependencies(t: JoinTable): string[] {\n return [parseAlias(t.col1), parseAlias(t.col2)].filter((alias) => alias !== t.alias);\n}\n\n/** Marks aliases used by select strings, including generated CTI expressions like `COALESCE(st0.col, st1.col)`. */\nfunction markSelectAliases(dt: DependencyTracker, parsed: ParsedFindQuery, select: string): void {\n for (const table of parsed.tables) {\n if (selectReferencesAlias(select, table.alias)) {\n dt.markRequired(table.alias);\n }\n }\n}\n\n/** Returns true if a raw select expression references `alias.column` or the whole-row `alias`. */\nexport function selectReferencesAlias(select: string, alias: string): boolean {\n // Most selects are simple `a.*`, but CTI adds expressions like\n // `COALESCE(p_s0.shared_column, p_s1.shared_column) as shared_column`.\n // Those expressions must keep the subtype joins, but `parseAlias` only sees\n // the leading function name. Instead of parsing SQL, scan for the only alias\n // forms Joist generates in selects: `alias.column`, `\"alias\".column`, and whole-row aliases.\n return (\n selectReferencesCandidate(select, `${alias}.`) ||\n selectReferencesCandidate(select, `\"${alias}\".`) ||\n selectReferencesCandidate(select, alias) ||\n selectReferencesCandidate(select, `\"${alias}\"`)\n );\n}\n\n/**\n * Returns true when `candidate` is present at a SQL identifier boundary.\n *\n * Scans the select string for literal candidate matches, then verifies the characters before/after the match are not\n * part of a larger identifier or dotted path. I.e. `row_to_json(\"ap\")` matches, but `foo_\"ap\"` and `foo.ap` do not.\n */\nfunction selectReferencesCandidate(select: string, candidate: string): boolean {\n let index = select.indexOf(candidate);\n const quoted = candidate.startsWith('\"');\n while (index !== -1) {\n // Each loop inspects one literal occurrence of `candidate`, then either accepts it as a real alias reference or\n // advances to the next occurrence if the surrounding characters show it is part of a larger token.\n // Avoid treating `foo.a.id` as a reference to `a`; Joist-generated aliases\n // appear at the start of an expression or after punctuation/whitespace.\n const previous = select[index - 1];\n const next = select[index + candidate.length];\n if (\n (index === 0 || (previous !== \".\" && !isSqlIdentifierChar(previous))) &&\n !isSqlIdentifierChar(next) &&\n (quoted || (previous !== '\"' && next !== '\"'))\n ) {\n return true;\n }\n // Continue scanning after the current occurrence; `indexOf` returns -1 once there are no more candidates.\n index = select.indexOf(candidate, index + candidate.length);\n }\n return false;\n}\n\n/** Returns true for characters that can be part of an unquoted SQL identifier. */\nfunction isSqlIdentifierChar(char: string | undefined): boolean {\n return char !== undefined && /[A-Za-z0-9_]/.test(char);\n}\n\n/** Pulls out a flat list of all `ColumnCondition`s from a `ParsedExpressionFilter` tree. */\nexport function deepFindConditions(\n condition: ParsedExpressionFilter | undefined,\n filterPruneable: boolean,\n): (ColumnCondition | RawCondition | ExistsCondition)[] {\n const todo = condition ? [condition] : [];\n const result: (ColumnCondition | RawCondition | ExistsCondition)[] = [];\n while (todo.length !== 0) {\n const cc = todo.pop()!;\n for (const c of cc.conditions) {\n if (c.kind === \"exp\") {\n todo.push(c);\n } else if (c.kind === \"column\" || c.kind === \"raw\") {\n if (!filterPruneable || !c.pruneable) result.push(c);\n } else if (c.kind === \"exists\") {\n result.push(c);\n } else {\n assertNever(c);\n }\n }\n }\n return result;\n}\n\n/** Track join dependencies for `pruneUnusedJoins`. */\nclass DependencyTracker {\n private nodes: Map<string, string[]> = new Map();\n required: Set<string> = new Set();\n\n addAlias(alias: string, dependencies: string[] = []): void {\n this.nodes.set(alias, dependencies);\n }\n\n markRequired(alias: string): void {\n const marked = new Set<string>();\n const todo = [alias];\n while (todo.length > 0) {\n const alias = todo.pop()!;\n if (!marked.has(alias)) {\n marked.add(alias);\n todo.push(...(this.nodes.get(alias) || []));\n }\n }\n this.required = new Set([...this.required, ...marked]);\n }\n}\n"],"mappings":";;;AAYA,SAAgB,iBAAiB,QAAyB,aAA6B;CACrF,MAAM,KAAK,IAAI,kBAAkB;CAGjC,MAAM,OAAO,CAAC,GAAG,OAAO,MAAM;CAC9B,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,IAAI,KAAK,IAAI;EACnB,IAAI,EAAE,SAAS,WAAW;GACxB,GAAG,SAAS,EAAE,OAAO,CAAC,EAAE,SAAS,CAAC;GAElC,KAAK,KAAK,GAAG,EAAE,MAAM,MAAM;EAC7B,OAAO,IAAI,EAAE,SAAS,SACpB,GAAG,aAAa,EAAE,KAAK;OAClB,IAAI,EAAE,SAAS,WACpB,GAAG,aAAa,EAAE,KAAK;OAClB,IAAI,OAAO,MAAM,MAAM,QAAQ,IAAI,UAAU,EAAE,KAAK,GAAG;GAC5D,GAAG,SAAS,EAAE,OAAO,iBAAiB,CAAC,CAAC;GACxC,GAAG,aAAa,EAAE,KAAK;EACzB,OACE,GAAG,SAAS,EAAE,OAAO,iBAAiB,CAAC,CAAC;CAE5C;CAGA,OAAO,QAAQ,SAAS,MAAM;EAC5B,IAAI,OAAO,MAAM,UACf,kBAAkB,IAAI,QAAQ,CAAC;OAC1B,IAAI,aAAa,GAAG;GACzB,KAAK,MAAM,KAAK,EAAE,SAAS,GAAG,aAAa,CAAC;GAC5C,kBAAkB,IAAI,QAAQ,EAAE,GAAG;EACrC;CACF,CAAC;CACD,OAAO,SAAS,SAAS,MAAM,GAAG,aAAa,EAAE,KAAK,CAAC;CACvD,OAAO,UAAU,SAAS,MAAM;EAC9B,IAAI,gBAAgB,GAClB,kBAAkB,IAAI,QAAQ,EAAE,UAAU;OAE1C,GAAG,aAAa,EAAE,KAAK;CAE3B,CAAC;CACD,YAAY,SAAS,MAAM,GAAG,aAAa,CAAC,CAAC;CAE7C,MAAM,QAAQ,CAAC;EAAE,OAAO;EAAQ,iBAAiB;CAAK,CAAC;CACvD,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,EAAE,OAAO,oBAAoB,MAAM,IAAI;EAC7C,mBAAmB,MAAM,WAAW,eAAe,CAAC,CAAC,SAAS,MAAM;GAClE,IAAI,EAAE,SAAS,UACb,GAAG,aAAa,EAAE,KAAK;QAClB,IAAI,EAAE,SAAS,OACpB,KAAK,MAAM,SAAS,EAAE,SAAS,GAAG,aAAa,KAAK;QAC/C,IAAI,EAAE,SAAS,UACpB,KAAK,MAAM,SAAS,EAAE,cAAc,GAAG,aAAa,KAAK;QAEzD,YAAY,CAAC;EAEjB,CAAC;EACD,MAAM,KACJ,GAAG,MAAM,OAAO,QAAQ,MAAM,EAAE,SAAS,SAAS,CAAC,CAAC,KAAK,OAAO;GAAE,OAAO,EAAE;GAAO,iBAAiB;EAAM,EAAE,CAC7G;CACF;CAGA,OAAO,SAAS,OAAO,OAAO,QAAQ,MAAM,GAAG,SAAS,IAAI,EAAE,KAAK,CAAC;CAGpE,IAAI,OAAO,aAAa,OAAO,UAAU,OAAO,OAC9C,OAAO,UAAU,aAAa,OAAO,UAAU,WAAW,QAAQ,MAAM;EACtE,IAAI,EAAE,SAAS,UAGb,OAAO,EAFO,EAAE,aAAa,CAAC,GAAG,SAAS,IAAI,EAAE,KAAK;OAIrD,OAAO;CAEX,CAAC;CAIH,IAAI,OAAO,aAAa,OAAO,UAAU,WAAW,WAAW,GAC7D,OAAO,YAAY,KAAA;AAEvB;;AAGA,SAAS,iBAAiB,GAAwB;CAChD,OAAO,CAAC,WAAW,EAAE,IAAI,GAAG,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,UAAU,UAAU,EAAE,KAAK;AACrF;;AAGA,SAAS,kBAAkB,IAAuB,QAAyB,QAAsB;CAC/F,KAAK,MAAM,SAAS,OAAO,QACzB,IAAI,sBAAsB,QAAQ,MAAM,KAAK,GAC3C,GAAG,aAAa,MAAM,KAAK;AAGjC;;AAGA,SAAgB,sBAAsB,QAAgB,OAAwB;CAM5E,OACE,0BAA0B,QAAQ,GAAG,MAAM,EAAE,KAC7C,0BAA0B,QAAQ,IAAI,MAAM,GAAG,KAC/C,0BAA0B,QAAQ,KAAK,KACvC,0BAA0B,QAAQ,IAAI,MAAM,EAAE;AAElD;;;;;;;AAQA,SAAS,0BAA0B,QAAgB,WAA4B;CAC7E,IAAI,QAAQ,OAAO,QAAQ,SAAS;CACpC,MAAM,SAAS,UAAU,WAAW,IAAG;CACvC,OAAO,UAAU,IAAI;EAKnB,MAAM,WAAW,OAAO,QAAQ;EAChC,MAAM,OAAO,OAAO,QAAQ,UAAU;EACtC,KACG,UAAU,KAAM,aAAa,OAAO,CAAC,oBAAoB,QAAQ,MAClE,CAAC,oBAAoB,IAAI,MACxB,UAAW,aAAa,QAAO,SAAS,OAEzC,OAAO;EAGT,QAAQ,OAAO,QAAQ,WAAW,QAAQ,UAAU,MAAM;CAC5D;CACA,OAAO;AACT;;AAGA,SAAS,oBAAoB,MAAmC;CAC9D,OAAO,SAAS,KAAA,KAAa,eAAe,KAAK,IAAI;AACvD;;AAGA,SAAgB,mBACd,WACA,iBACsD;CACtD,MAAM,OAAO,YAAY,CAAC,SAAS,IAAI,CAAC;CACxC,MAAM,SAA+D,CAAC;CACtE,OAAO,KAAK,WAAW,GAAG;EACxB,MAAM,KAAK,KAAK,IAAI;EACpB,KAAK,MAAM,KAAK,GAAG,YACjB,IAAI,EAAE,SAAS,OACb,KAAK,KAAK,CAAC;OACN,IAAI,EAAE,SAAS,YAAY,EAAE,SAAS,OACvC;OAAA,CAAC,mBAAmB,CAAC,EAAE,WAAW,OAAO,KAAK,CAAC;EAAA,OAC9C,IAAI,EAAE,SAAS,UACpB,OAAO,KAAK,CAAC;OAEb,YAAY,CAAC;CAGnB;CACA,OAAO;AACT;;AAGA,IAAM,oBAAN,MAAwB;CACtB,wBAAuC,IAAI,IAAI;CAC/C,2BAAwB,IAAI,IAAI;CAEhC,SAAS,OAAe,eAAyB,CAAC,GAAS;EACzD,KAAK,MAAM,IAAI,OAAO,YAAY;CACpC;CAEA,aAAa,OAAqB;EAChC,MAAM,yBAAS,IAAI,IAAY;EAC/B,MAAM,OAAO,CAAC,KAAK;EACnB,OAAO,KAAK,SAAS,GAAG;GACtB,MAAM,QAAQ,KAAK,IAAI;GACvB,IAAI,CAAC,OAAO,IAAI,KAAK,GAAG;IACtB,OAAO,IAAI,KAAK;IAChB,KAAK,KAAK,GAAI,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC,CAAE;GAC5C;EACF;EACA,KAAK,2BAAW,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,GAAG,MAAM,CAAC;CACvD;AACF"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryVisitor.cjs","names":[],"sources":["../src/QueryVisitor.ts"],"sourcesContent":["import {\n type ColumnCondition,\n type ParsedExpressionCondition,\n type ParsedExpressionFilter,\n type ParsedFindQuery,\n type RawCondition,\n} from \"./QueryParser.ts\";\nimport { assertNever } from \"./utils.ts\";\n\n/** A generic visitor over the simple & complex conditions of a query. */\ninterface Visitor {\n visitExp?(c: ParsedExpressionFilter): ParsedExpressionFilter | void;\n visitRaw?(c: RawCondition): RawCondition | ParsedExpressionFilter | void;\n visitCond(c: ColumnCondition): ColumnCondition | ParsedExpressionFilter | RawCondition | null | void;\n}\n\n/**\n * Visits the nested conditions within `query`.\n *\n * If the visitors return a new condition or expression, the returned expression\n * will replace the original one at that location in the expression.\n *\n * If the visitor returns null, the condition or expression will be removed from the tree.\n */\nexport function visitConditions(query: ParsedFindQuery, visitor: Visitor): void {\n const todo = [query];\n while (todo.length > 0) {\n const query = todo.pop()!;\n if (query.condition) visitFilter(query.condition, visitor);\n // Recurse into lateral subqueries (used by batching/preloading, not EXISTS rewrite)\n for (const table of query.tables) {\n if (table.join === \"lateral\") {\n todo.push(table.query);\n }\n }\n // Recurse into EXISTS subqueries so batching visitors can rewrite conditions inside them\n if (query.condition) {\n visitExistsSubqueries(query.condition, todo);\n }\n }\n}\n\n/** Finds ExistsCondition nodes in a condition tree and pushes their subqueries onto the todo list. */\nfunction visitExistsSubqueries(condition: ParsedExpressionCondition, todo: ParsedFindQuery[]): void {\n if (condition.kind === \"exp\") {\n for (const c of condition.conditions) {\n visitExistsSubqueries(c, todo);\n }\n } else if (condition.kind === \"exists\") {\n todo.push(condition.subquery);\n }\n}\n\nexport function visitFilter(pc: ParsedExpressionCondition, visitor: Visitor) {\n if (pc.kind === \"exp\") {\n const toRemove = new Set<number>();\n pc.conditions.forEach((c, i) => {\n if (c.kind === \"column\") {\n const result = visitor.visitCond(c);\n if (result === null) {\n toRemove.add(i);\n } else if (result) {\n pc.conditions[i] = result;\n }\n } else if (c.kind === \"exp\") {\n const result = visitor.visitExp?.(c);\n if (result === null) {\n toRemove.add(i);\n return;\n } else if (result) {\n pc.conditions[i] = result;\n }\n visitFilter(result ?? c, visitor);\n } else if (c.kind === \"raw\") {\n const result = visitor.visitRaw?.(c);\n if (result === null) {\n toRemove.add(i);\n } else if (result) {\n pc.conditions[i] = result;\n }\n } else if (c.kind === \"exists\") {\n // EXISTS conditions are visited via visitExistsSubqueries, not inline\n } else {\n assertNever(c);\n }\n });\n // do this after visiting the children, so we can do it in one pass and don't mess up the indices\n if (toRemove.size > 0) pc.conditions = pc.conditions.filter((_, i) => !toRemove.has(i));\n } else if (pc.kind === \"column\") {\n const result = visitor.visitCond(pc);\n if (result || result === null) {\n throw new Error(\"ParsedExpressionCondition overload not support mutating the condition\");\n }\n } else if (pc.kind === \"raw\") {\n const result = visitor.visitRaw?.(pc);\n if (result || result === null) {\n throw new Error(\"ParsedExpressionCondition overload not support mutating the condition\");\n }\n } else if (pc.kind === \"exists\") {\n // EXISTS conditions are handled at the query level\n } else {\n assertNever(pc);\n }\n}\n"],"mappings":";;;;;;;;;;;;AAwBA,SAAgB,gBAAgB,OAAwB,SAAwB;CAC9E,MAAM,OAAO,CAAC,KAAK;CACnB,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,QAAQ,KAAK,IAAI;EACvB,IAAI,MAAM,WAAW,YAAY,MAAM,WAAW,OAAO;EAEzD,KAAK,MAAM,SAAS,MAAM,QACxB,IAAI,MAAM,SAAS,WACjB,KAAK,KAAK,MAAM,KAAK;EAIzB,IAAI,MAAM,WACR,sBAAsB,MAAM,WAAW,IAAI;CAE/C;AACF;;AAGA,SAAS,sBAAsB,WAAsC,MAA+B;CAClG,IAAI,UAAU,SAAS,OACrB,KAAK,MAAM,KAAK,UAAU,YACxB,sBAAsB,GAAG,IAAI;MAE1B,IAAI,UAAU,SAAS,UAC5B,KAAK,KAAK,UAAU,QAAQ;AAEhC;AAEA,SAAgB,YAAY,IAA+B,SAAkB;CAC3E,IAAI,GAAG,SAAS,OAAO;EACrB,MAAM,2BAAW,IAAI,IAAY;EACjC,GAAG,WAAW,SAAS,GAAG,MAAM;GAC9B,IAAI,EAAE,SAAS,UAAU;IACvB,MAAM,SAAS,QAAQ,UAAU,CAAC;IAClC,IAAI,WAAW,MACb,SAAS,IAAI,CAAC;SACT,IAAI,QACT,GAAG,WAAW,KAAK;GAEvB,OAAO,IAAI,EAAE,SAAS,OAAO;IAC3B,MAAM,SAAS,QAAQ,WAAW,CAAC;IACnC,IAAI,WAAW,MAAM;KACnB,SAAS,IAAI,CAAC;KACd;IACF,OAAO,IAAI,QACT,GAAG,WAAW,KAAK;IAErB,YAAY,UAAU,GAAG,OAAO;GAClC,OAAO,IAAI,EAAE,SAAS,OAAO;IAC3B,MAAM,SAAS,QAAQ,WAAW,CAAC;IACnC,IAAI,WAAW,MACb,SAAS,IAAI,CAAC;SACT,IAAI,QACT,GAAG,WAAW,KAAK;GAEvB,OAAO,IAAI,EAAE,SAAS,UAAU,CAEhC,OACE,cAAA,YAAY,CAAC;EAEjB,CAAC;EAED,IAAI,SAAS,OAAO,GAAG,GAAG,aAAa,GAAG,WAAW,QAAQ,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;CACxF,OAAO,IAAI,GAAG,SAAS,UAAU;EAC/B,MAAM,SAAS,QAAQ,UAAU,EAAE;EACnC,IAAI,UAAU,WAAW,MACvB,MAAM,IAAI,MAAM,uEAAuE;CAE3F,OAAO,IAAI,GAAG,SAAS,OAAO;EAC5B,MAAM,SAAS,QAAQ,WAAW,EAAE;EACpC,IAAI,UAAU,WAAW,MACvB,MAAM,IAAI,MAAM,uEAAuE;CAE3F,OAAO,IAAI,GAAG,SAAS,UAAU,CAEjC,OACE,cAAA,YAAY,EAAE;AAElB"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryVisitor.d.cts","names":[],"sources":["../src/QueryVisitor.ts"],"mappings":";;;UAUU;EACR,UAAU,GAAG,yBAAyB;EACtC,UAAU,GAAG,eAAe,eAAe;EAC3C,UAAU,GAAG,kBAAkB,kBAAkB,yBAAyB;;;;;;;;;;iBAW5D,gBAAgB,OAAO,iBAAiB,SAAS;iBA6BjD,YAAY,IAAI,2BAA2B,SAAS"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryVisitor.d.mts","names":[],"sources":["../src/QueryVisitor.ts"],"mappings":";;;UAUU;EACR,UAAU,GAAG,yBAAyB;EACtC,UAAU,GAAG,eAAe,eAAe;EAC3C,UAAU,GAAG,kBAAkB,kBAAkB,yBAAyB;;;;;;;;;;iBAW5D,gBAAgB,OAAO,iBAAiB,SAAS;iBA6BjD,YAAY,IAAI,2BAA2B,SAAS"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"QueryVisitor.js","names":[],"sources":["../src/QueryVisitor.ts"],"sourcesContent":["import {\n type ColumnCondition,\n type ParsedExpressionCondition,\n type ParsedExpressionFilter,\n type ParsedFindQuery,\n type RawCondition,\n} from \"./QueryParser.ts\";\nimport { assertNever } from \"./utils.ts\";\n\n/** A generic visitor over the simple & complex conditions of a query. */\ninterface Visitor {\n visitExp?(c: ParsedExpressionFilter): ParsedExpressionFilter | void;\n visitRaw?(c: RawCondition): RawCondition | ParsedExpressionFilter | void;\n visitCond(c: ColumnCondition): ColumnCondition | ParsedExpressionFilter | RawCondition | null | void;\n}\n\n/**\n * Visits the nested conditions within `query`.\n *\n * If the visitors return a new condition or expression, the returned expression\n * will replace the original one at that location in the expression.\n *\n * If the visitor returns null, the condition or expression will be removed from the tree.\n */\nexport function visitConditions(query: ParsedFindQuery, visitor: Visitor): void {\n const todo = [query];\n while (todo.length > 0) {\n const query = todo.pop()!;\n if (query.condition) visitFilter(query.condition, visitor);\n // Recurse into lateral subqueries (used by batching/preloading, not EXISTS rewrite)\n for (const table of query.tables) {\n if (table.join === \"lateral\") {\n todo.push(table.query);\n }\n }\n // Recurse into EXISTS subqueries so batching visitors can rewrite conditions inside them\n if (query.condition) {\n visitExistsSubqueries(query.condition, todo);\n }\n }\n}\n\n/** Finds ExistsCondition nodes in a condition tree and pushes their subqueries onto the todo list. */\nfunction visitExistsSubqueries(condition: ParsedExpressionCondition, todo: ParsedFindQuery[]): void {\n if (condition.kind === \"exp\") {\n for (const c of condition.conditions) {\n visitExistsSubqueries(c, todo);\n }\n } else if (condition.kind === \"exists\") {\n todo.push(condition.subquery);\n }\n}\n\nexport function visitFilter(pc: ParsedExpressionCondition, visitor: Visitor) {\n if (pc.kind === \"exp\") {\n const toRemove = new Set<number>();\n pc.conditions.forEach((c, i) => {\n if (c.kind === \"column\") {\n const result = visitor.visitCond(c);\n if (result === null) {\n toRemove.add(i);\n } else if (result) {\n pc.conditions[i] = result;\n }\n } else if (c.kind === \"exp\") {\n const result = visitor.visitExp?.(c);\n if (result === null) {\n toRemove.add(i);\n return;\n } else if (result) {\n pc.conditions[i] = result;\n }\n visitFilter(result ?? c, visitor);\n } else if (c.kind === \"raw\") {\n const result = visitor.visitRaw?.(c);\n if (result === null) {\n toRemove.add(i);\n } else if (result) {\n pc.conditions[i] = result;\n }\n } else if (c.kind === \"exists\") {\n // EXISTS conditions are visited via visitExistsSubqueries, not inline\n } else {\n assertNever(c);\n }\n });\n // do this after visiting the children, so we can do it in one pass and don't mess up the indices\n if (toRemove.size > 0) pc.conditions = pc.conditions.filter((_, i) => !toRemove.has(i));\n } else if (pc.kind === \"column\") {\n const result = visitor.visitCond(pc);\n if (result || result === null) {\n throw new Error(\"ParsedExpressionCondition overload not support mutating the condition\");\n }\n } else if (pc.kind === \"raw\") {\n const result = visitor.visitRaw?.(pc);\n if (result || result === null) {\n throw new Error(\"ParsedExpressionCondition overload not support mutating the condition\");\n }\n } else if (pc.kind === \"exists\") {\n // EXISTS conditions are handled at the query level\n } else {\n assertNever(pc);\n }\n}\n"],"mappings":";;;;;;;;;;;AAwBA,SAAgB,gBAAgB,OAAwB,SAAwB;CAC9E,MAAM,OAAO,CAAC,KAAK;CACnB,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,QAAQ,KAAK,IAAI;EACvB,IAAI,MAAM,WAAW,YAAY,MAAM,WAAW,OAAO;EAEzD,KAAK,MAAM,SAAS,MAAM,QACxB,IAAI,MAAM,SAAS,WACjB,KAAK,KAAK,MAAM,KAAK;EAIzB,IAAI,MAAM,WACR,sBAAsB,MAAM,WAAW,IAAI;CAE/C;AACF;;AAGA,SAAS,sBAAsB,WAAsC,MAA+B;CAClG,IAAI,UAAU,SAAS,OACrB,KAAK,MAAM,KAAK,UAAU,YACxB,sBAAsB,GAAG,IAAI;MAE1B,IAAI,UAAU,SAAS,UAC5B,KAAK,KAAK,UAAU,QAAQ;AAEhC;AAEA,SAAgB,YAAY,IAA+B,SAAkB;CAC3E,IAAI,GAAG,SAAS,OAAO;EACrB,MAAM,2BAAW,IAAI,IAAY;EACjC,GAAG,WAAW,SAAS,GAAG,MAAM;GAC9B,IAAI,EAAE,SAAS,UAAU;IACvB,MAAM,SAAS,QAAQ,UAAU,CAAC;IAClC,IAAI,WAAW,MACb,SAAS,IAAI,CAAC;SACT,IAAI,QACT,GAAG,WAAW,KAAK;GAEvB,OAAO,IAAI,EAAE,SAAS,OAAO;IAC3B,MAAM,SAAS,QAAQ,WAAW,CAAC;IACnC,IAAI,WAAW,MAAM;KACnB,SAAS,IAAI,CAAC;KACd;IACF,OAAO,IAAI,QACT,GAAG,WAAW,KAAK;IAErB,YAAY,UAAU,GAAG,OAAO;GAClC,OAAO,IAAI,EAAE,SAAS,OAAO;IAC3B,MAAM,SAAS,QAAQ,WAAW,CAAC;IACnC,IAAI,WAAW,MACb,SAAS,IAAI,CAAC;SACT,IAAI,QACT,GAAG,WAAW,KAAK;GAEvB,OAAO,IAAI,EAAE,SAAS,UAAU,CAEhC,OACE,YAAY,CAAC;EAEjB,CAAC;EAED,IAAI,SAAS,OAAO,GAAG,GAAG,aAAa,GAAG,WAAW,QAAQ,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;CACxF,OAAO,IAAI,GAAG,SAAS,UAAU;EAC/B,MAAM,SAAS,QAAQ,UAAU,EAAE;EACnC,IAAI,UAAU,WAAW,MACvB,MAAM,IAAI,MAAM,uEAAuE;CAE3F,OAAO,IAAI,GAAG,SAAS,OAAO;EAC5B,MAAM,SAAS,QAAQ,WAAW,EAAE;EACpC,IAAI,UAAU,WAAW,MACvB,MAAM,IAAI,MAAM,uEAAuE;CAE3F,OAAO,IAAI,GAAG,SAAS,UAAU,CAEjC,OACE,YAAY,EAAE;AAElB"}
|
package/build/Tables.cjs.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"Tables.cjs","names":["getMetadata","fail","BaseExpr","kqDot","toIdOf","mapToDb","deferredCondition","buildValueCondition","isExpr","skipCondition","makeLike","groupBy","getConstructorFromTaggedId","maybeResolveReferenceToId","asNode","getBaseAndSelfMetas","getBaseSelfAndSubMetas","getBaseMeta","parseEntityFilter","parseValueFilter","isEntity"],"sources":["../src/Tables.ts"],"sourcesContent":["import { groupBy } from \"joist-utils\";\n\nimport { type Column } from \"./columns.ts\";\nimport { type SqlCondition } from \"./conditions.ts\";\n// Load-order only: without this, the built cjs/esm module graph evaluates relations/* before their\n// base classes exist (\"Class extends value undefined\"); keep it even though no symbol is imported.\nimport \"./configure.ts\";\nimport { buildValueCondition } from \"./drivers/buildUtils.ts\";\nimport { type Entity, isEntity } from \"./Entity.ts\";\nimport { type IdOf, type MaybeAbstractEntityConstructor, type TaggedId } from \"./EntityManager.ts\";\nimport {\n type EntityMetadata,\n type Field,\n type LargeOneToManyField,\n type ManyToManyField,\n type OneToManyField,\n type OneToOneField,\n type PolymorphicField,\n type PolymorphicFieldComponent,\n getBaseAndSelfMetas,\n getBaseMeta,\n getBaseSelfAndSubMetas,\n getMetadata,\n} from \"./EntityMetadata.ts\";\nimport {\n BaseExpr,\n type Expr,\n type ExprContext,\n type ExprLike,\n type InnerJoin,\n type LeftJoin,\n type SqlFragment,\n asNode,\n deferredCondition,\n isExpr,\n} from \"./Expr.ts\";\nimport { getConstructorFromTaggedId, maybeResolveReferenceToId } from \"./index.ts\";\nimport { toIdOf } from \"./keys.ts\";\nimport { kqDot } from \"./keywords.ts\";\nimport { type ParsedValueFilter, makeLike, mapToDb, parseEntityFilter, parseValueFilter } from \"./QueryParser.ts\";\nimport { skipCondition } from \"./skipCondition.ts\";\nimport { type TypeInfo } from \"./TypeInfo.ts\";\nimport { type ColumnsOf, type FieldsOf, type FilterOf, type TypeMap, type TypeNameOf } from \"./typeMap.ts\";\nimport { fail } from \"./utils.ts\";\n\n/** Creates physical column expressions and relationship joins for `T`. */\nexport function table<T extends Entity>(cstr: MaybeAbstractEntityConstructor<T>): Table<T>;\n/**\n * Creates a table with an explicit type-level name, i.e. `table(Author, \"m\")` for a self-join.\n *\n * The name is the table's source key in `em.query`: two bare `table(Author)`s share the key `\"Author\"`,\n * so a left-joined mentor would also mark the mentee's columns nullable; a named alias has its own key.\n */\nexport function table<T extends Entity, Name extends string>(\n cstr: MaybeAbstractEntityConstructor<T>,\n name: Name,\n): Table<T, Name>;\nexport function table<T extends Entity>(cstr: MaybeAbstractEntityConstructor<T>, _name?: string): unknown {\n // The name only exists at the type level; the SQL alias is still assigned by the query parser\n return newTableProxy(cstr);\n}\n\n/** Creates multiple physical table handles. */\nexport function tables<T extends readonly MaybeAbstractEntityConstructor<any>[]>(\n ...type: T\n): { [P in keyof T]: T[P] extends MaybeAbstractEntityConstructor<infer E extends Entity> ? Table<E> : never } {\n return type.map((t) => newTableProxy(t)) as any;\n}\n\n/**\n * The runtime management interface plus phantom type information for `em.query`.\n *\n * `__entity` lets `QueryRow` recover `T` for entity mode (you cannot `infer T` back out of a mapped\n * type), and `__name` is the table's source key (see `Expr`).\n */\nexport interface TableBrand<T, Name extends string> extends TableMgmt {\n readonly __entity: T;\n readonly __name: Name;\n}\n\n/**\n * A physical table for `T`: one expression per SQL column, with relationship names as join factories.\n * Selecting the table itself retains entity hydration; selecting columns returns decoded SQL values.\n *\n * Unlike an Alias, a Table is an explicit SQL source, not a place to bind in an em.find relationship\n * tree. I.e. with `a = table(Author)`, `{ from: a }` registers that handle in the query's scope.\n * Its columns already know their physical column and codec, but their SQL name still depends on the\n * query: the same Author handle might be `a` in one query and `a1` in a nested query.\n *\n * Each predicate occurrence renders through ExprContext.aliasFor using the current scope (or an\n * enclosing scope for a correlation). Rendering returns SQL, ordered bindings, and source references\n * together. A comparison records both sides' references; templates and subqueries carry their\n * references too. Join pruning follows these references and join dependencies, rather than guessing\n * which tables a SQL string mentions. It also accounts for select/order/group expressions and keep.\n *\n * I.e. if a joined Author is used only by `a.firstName.eq(name)`, supplying undefined removes that\n * predicate and lets the unused join prune. Both APIs share this undefined-condition pruning rule;\n * they differ in how they get the references: Alias resolves domain conditions against a relationship\n * tree, while Table renders SQL expressions against explicit sources. Neither caches SQL names on\n * the reusable handle or predicate, so one parse cannot overwrite another parse's bindings.\n *\n * `Name` is the table's type-level source key, defaulting to the entity's own type name, so a\n * LEFT-joined SmallPublisher does not make Publisher columns nullable. `table(Author, \"m\")`\n * gives a self-join table its own key.\n */\nexport type Table<T extends Entity, Name extends string = TableNameOf<T>> = TableShape<T, Name> &\n (\"where\" extends keyof TableShape<T, Name>\n ? {}\n : {\n /** Builds an AND condition from local domain fields, without implicit joins. */\n where(filter: TableFilter<T>): SqlCondition;\n });\n\n/** Domain filters for fields stored on this physical table, without relationship traversal. */\nexport type TableFilter<T extends Entity> = {\n [K in LocalFieldNames<T> & keyof FieldsOf<T>]?: FieldsOf<T>[K] extends {\n kind: \"m2o\";\n type: infer U extends Entity;\n nullable: infer N;\n }\n ? TableReferenceFilter<U, N extends undefined ? null : never>\n : FilterOf<T>[K];\n};\n\n/** Generated column ownership excludes CTI base fields and polymorphic components. */\ntype LocalFieldNames<T> = ColumnsOf<T>[keyof ColumnsOf<T>] extends { fieldName: infer F }\n ? Extract<F, keyof FilterOf<T>>\n : never;\n\n/** The owning-reference subset of find filters that only compares a foreign key. */\ntype TableReferenceFilter<T extends Entity, N> =\n | T\n | IdOf<T>\n | readonly (T | IdOf<T>)[]\n | boolean\n | N\n | undefined\n | { ne: T | IdOf<T> | N | undefined };\n\ntype TableShape<T extends Entity, Name extends string> = {\n readonly [tableMgmt]: TableBrand<T, Name>;\n} & {\n [P in keyof ColumnsOf<T>]: P extends \"id\"\n ? EntityColumn<T, never, Name>\n : ColumnsOf<T>[P] extends { entity: infer U extends Entity; nullable: infer N }\n ? ReferenceColumn<U, N extends true ? null : never, Name>\n : ColumnsOf<T>[P] extends { type: infer V; nullable: infer N }\n ? PrimitiveColumn<V, N extends true ? null : never, Name>\n : never;\n} & {\n [\n P in keyof FieldsOf<T> as P extends keyof ColumnsOf<T>\n ? never\n : FieldsOf<T>[P] extends { kind: \"m2o\" | \"poly\" | \"o2m\" | \"lo2m\" | \"m2m\" | \"o2o\" }\n ? P\n : never\n ]: FieldsOf<T>[P] extends { kind: \"m2o\"; type: infer U extends Entity; nullable: infer N }\n ? ReferenceJoin<U, N extends undefined ? null : never, Name>\n : FieldsOf<T>[P] extends { kind: \"poly\"; type: infer U extends Entity; nullable: infer N }\n ? PolyReference<U, N extends undefined ? null : never, Name>\n : FieldsOf<T>[P] extends { kind: \"o2m\" | \"lo2m\" | \"m2m\" | \"o2o\"; type: infer U extends Entity }\n ? CollectionJoin<U>\n : never;\n} & {\n [\n K in keyof TypeMap as TypeMap[K] extends {\n entityType: infer U extends Entity & { __type: { 0: TypeNameOf<T>; 1: string } };\n }\n ? Uncapitalize<TypeNameOf<U> & string>\n : never\n ]: TypeMap[K] extends { entityType: infer U extends Entity } ? SubtypeJoin<U> : never;\n};\n\n/** Keeps explicit base and subtype sources independent, with generic entities untracked. */\ntype TableNameOf<T> = T extends { __type: { 0: string } } ? TypeNameOf<T> & string : string;\n\n/** Provides fluent methods for creating joins through an owning reference relationship. */\nexport interface ReferenceJoin<U extends Entity, N extends null | never, Src extends string = string> {\n /**\n * Required reference joins like `b.author.as(a)` are INNER unless `b` is already a LEFT-joined alias.\n * Nullable references are always LEFT joined.\n */\n as<A extends TableFor<U>>(other: A): [N] extends [never] ? DefaultReferenceJoin<A, Src> : LeftJoin<A>;\n inner<A extends TableFor<U>>(other: A): InnerJoin<A>;\n left<A extends TableFor<U>>(other: A): LeftJoin<A>;\n}\n\n/** The source of a default reference join, used to inherit optional paths within each query. */\nexport const referenceJoinSource: unique symbol = Symbol(\"joist.referenceJoinSource\");\n\n/** A required reference defaults to INNER unless its source was LEFT joined. */\nexport type DefaultReferenceJoin<A, Src extends string> = InnerJoin<A> & {\n readonly [referenceJoinSource]: Src;\n};\n\n/** Any table whose entity is (a subtype of) `U`, i.e. what a relation join factory accepts. */\nexport type TableFor<U> = { readonly [tableMgmt]: TableBrand<U, string> };\n\n/**\n * A collection relation (o2m/o2o/m2m) as a join factory: `a.books.as(b)` returns the same\n * `{ left: b, on: ... }` entry the expanded form writes, with the FK condition built from metadata, so\n * join-list inference, nullability, scope checking, and pruning are unchanged and both forms mix freely.\n *\n * `as` binds the joined alias, the same way em.find's `{ books: { as: b } }` does. The default is LEFT\n * (a collection may be empty, and a LEFT join never filters rows, so pruning it is always safe);\n * `.inner(b)` opts into filtering. An m2m entry carries a hidden second join through the join table,\n * which the parser expands; the pair prunes together.\n */\nexport interface CollectionJoin<U extends Entity> {\n as<A extends TableFor<U>>(other: A): LeftJoin<A>;\n inner<A extends TableFor<U>>(other: A): InnerJoin<A>;\n left<A extends TableFor<U>>(other: A): LeftJoin<A>;\n}\n\n/** A named subtype join, defaulting to LEFT because a root row may belong to another subtype. */\ninterface SubtypeJoin<U extends Entity> extends CollectionJoin<U> {\n <A extends TableFor<U>>(other: A): LeftJoin<A>;\n}\n\n/**\n * A physical FK column expression (`b.authorId` selects/compares the `author_id` FK) plus a join factory\n * (`b.authorId.as(a)` joins). The default join kind follows physical column nullability:\n * a NOT NULL FK is INNER unless its source was LEFT joined, a nullable one is LEFT, and the row type reflects it.\n */\nexport interface ReferenceColumn<U extends Entity, N extends null | never, Src extends string>\n extends EntityColumn<U, N, Src>, ReferenceJoin<U, N, Src> {}\n\n/**\n * A polymorphic reference: condition methods (each resolving the component column from the value), plus\n * a join factory that picks the component from the argument's entity, i.e. `c.parent.as(a)` joins\n * through `parent_author_id`, like an explicit join with `on: c.parent.eq(a.id)`.\n */\nexport interface PolyReference<\n U extends Entity,\n N extends null | never,\n Src extends string = string,\n> extends ReferenceJoin<U, N, Src> {\n eq(value: U | TaggedId | ExprLike<IdOf<U> | null> | null | undefined): SqlCondition;\n ne(value: U | TaggedId | ExprLike<IdOf<U> | null> | null | undefined): SqlCondition;\n in(values: readonly (U | TaggedId)[] | ExprLike<IdOf<U> | null> | undefined): SqlCondition;\n /** Applies an IN condition unless the list is empty or undefined. */\n inNonEmpty(values: readonly (U | TaggedId)[] | undefined): SqlCondition;\n}\n\nexport interface PrimitiveColumn<V, N extends null | never, Src extends string = string> extends Expr<V | N, Src> {\n eq(value: V | ExprLike<V | N> | N | undefined): SqlCondition;\n ne(value: V | ExprLike<V | N> | N | undefined): SqlCondition;\n in(values: readonly (V | null)[] | ExprLike<V | null> | undefined): SqlCondition;\n /** Applies an IN condition unless the list is empty or undefined. */\n inNonEmpty(values: readonly (V | null)[] | undefined): SqlCondition;\n nin(values: readonly (V | null)[] | ExprLike<V | null> | undefined): SqlCondition;\n gt(value: V | ExprLike<V | N> | undefined): SqlCondition;\n gte(value: V | ExprLike<V | N> | undefined): SqlCondition;\n lt(value: V | ExprLike<V | N> | undefined): SqlCondition;\n lte(value: V | ExprLike<V | N> | undefined): SqlCondition;\n like(value: V | undefined): SqlCondition;\n ilike(value: V | undefined): SqlCondition;\n search(value: V | undefined): SqlCondition;\n between(v1: V | undefined, v2: V | undefined): SqlCondition;\n // need to move to ArrayColumn\n // ...added the `string` to support jsonb contains like `WHERE profile @> '{\"age\": 25}'`\n // Ideally this would go in a JsonbColumn\n contains(value: string | V | PrimitiveColumn<V, any> | N | undefined): SqlCondition;\n ncontains(value: string | V | PrimitiveColumn<V, any> | N | undefined): SqlCondition;\n overlaps(value: V | PrimitiveColumn<V, any> | N | undefined): SqlCondition;\n noverlaps(value: V | PrimitiveColumn<V, any> | N | undefined): SqlCondition;\n\n /**\n * Adds a JSON path existence condition, using the `@?` operator.\n *\n * Any values should be embedded directly within the `jsonPath`, because postgres does not\n * support parameterized JSON path expressions. The entire `jsonPath` is treated as a parameter,\n * so this is safe from SQL injection.\n */\n pathExists(jsonPath: string | undefined): SqlCondition;\n\n /**\n * Adds a JSON path predicate condition, using the `@@` operator.\n *\n * Any values should be embedded directly within the `jsonPath`, because postgres does not\n * support parameterized JSON path expressions. The entire `jsonPath` is treated as a parameter,\n * so this is safe from SQL injection.\n */\n pathIsTrue(jsonPath: string | undefined): SqlCondition;\n\n /**\n * Add `exp` to the query, which should include the operator & expression and any\n * bound parameters (but not include the column name).\n *\n * We use knex-style placeholders, i.e. `?` and `\\\\?` to escape question marks, i.e.\n *\n * ```ts\n * a.address.raw(\"@\\\\? ?\", ['$.street ? (@ == \"rr2\")'])`\n * ```\n */\n raw(exp: string, bindings: readonly any[] | undefined): SqlCondition;\n}\n\nexport interface EntityColumn<T, N extends null | never = never, Src extends string = string> extends Expr<\n IdOf<T> | N,\n Src\n> {\n eq(value: T | IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition;\n ne(value: T | IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition;\n // Adding `| null` for GraphQL support\n in(value: readonly (T | IdOf<T> | null)[] | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition;\n /** Applies an IN condition unless the list is empty, null, or undefined. */\n inNonEmpty(value: readonly (T | IdOf<T> | null)[] | null | undefined): SqlCondition;\n nin(value: readonly (T | IdOf<T> | null)[] | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition;\n gt(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition;\n gte(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition;\n lt(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition;\n lte(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition;\n raw(exp: string, bindings: readonly any[] | undefined): SqlCondition;\n}\n\nexport const tableMgmt = Symbol(\"tableMgmt\");\n\nexport function getTableMgmt(table: TableFor<unknown>): TableMgmt {\n return table[tableMgmt];\n}\n\n/** The identity SQL queries bind a table by, plus its original entity metadata. */\nexport interface TableMgmt {\n tableName: string;\n /**\n * The metadata this table was created with, i.e. `table(TaskNew)` keeps `taskNewMeta`.\n *\n * It cannot be re-derived from `tableName`: STI subtypes share their base's table (`Task`, `TaskNew`,\n * and `TaskOld` are all `tasks`), so a `getMetadataForTable(\"tasks\")` lookup can only return the base\n * `Task`, and the alias would lose its subtype identity for explicit subtype joins and entity hydration.\n */\n meta: EntityMetadata;\n}\n\n/** Returns the metadata for the entity that `table` is bound to. */\nexport function getTableMetadata<T extends Entity>(table: TableFor<T>): EntityMetadata<T> {\n const mgmt = table[tableMgmt];\n return mgmt.meta as EntityMetadata<T>;\n}\n\nexport function newTableProxy<T extends Entity>(cstr: MaybeAbstractEntityConstructor<T>): Table<T> {\n const meta = getMetadata(cstr);\n // The identity SQL queries bind to a source, retaining STI subtype metadata.\n const mgmt: TableMgmt = { tableName: meta.tableName, meta };\n const subtypes = new Map(meta.subTypes.map((m) => [m.type[0].toLowerCase() + m.type.slice(1), m]));\n const proxy: any = new Proxy(cstr, {\n /** Create a physical column expression or a relation join factory. */\n get(_, key: PropertyKey): any {\n if (key === tableMgmt) {\n return mgmt;\n }\n if (typeof key !== \"string\") return undefined;\n const descriptor = Object.hasOwn(meta.columns, key) ? meta.columns[key] : undefined;\n if (descriptor) {\n return descriptor.idMetadata && key !== \"id\"\n ? new EntityColumnImpl(meta, descriptor, mgmt)\n : new PrimitiveColumnImpl(meta, descriptor, mgmt);\n }\n const subtype = subtypes.get(key);\n if (subtype) {\n const join = new SubtypeJoinImpl(proxy, subtype);\n return Object.assign(join.as.bind(join), {\n as: join.as.bind(join),\n inner: join.inner.bind(join),\n left: join.left.bind(join),\n });\n }\n const relation = physicalRelation(meta, key);\n if (key === \"where\" && !isRelation(meta.allFields[key])) {\n return (filter: TableFilter<T>) => tableWhere(mgmt, filter);\n }\n const field = relation ?? fail(`No physical field ${key} on ${cstr.name}; join its base table explicitly`);\n switch (field.kind) {\n case \"m2o\":\n return new ReferenceJoinImpl(new EntityColumnImpl(meta, field.serde.columns[0].column, mgmt));\n case \"poly\":\n return new PolyReferenceImpl(meta, mgmt, field);\n case \"o2m\":\n case \"o2o\":\n case \"lo2m\":\n return new OneToManyJoinImpl(proxy, field);\n case \"m2m\":\n return new ManyToManyJoinImpl(proxy, field);\n default:\n throw new Error(`Unsupported table field kind ${field.kind}`);\n }\n },\n\n has(_, key) {\n return (\n key === tableMgmt ||\n (typeof key === \"string\" &&\n (key === \"where\" || Object.hasOwn(meta.columns, key) || !!physicalRelation(meta, key) || subtypes.has(key)))\n );\n },\n });\n return proxy;\n}\n\nexport function isTable(obj: unknown): obj is Table<any, any> {\n // Oddly enough `typeof` will be a function b/c we are proxying the constructors\n return typeof obj === \"function\" && tableMgmt in obj;\n}\n\n/**\n * A physical table column implements `Expr`: it renders as `alias.\"column\"`, decodes result\n * values through the column's shared scalar codec, and inherits aggregate methods from `BaseExpr`.\n */\nclass TableColumn extends BaseExpr {\n public constructor(\n readonly meta: EntityMetadata,\n readonly column: Column,\n readonly mgmt: TableMgmt,\n ) {\n super();\n }\n\n /** Author.id, Book.authorId, and Comment.parentAuthorId use the same Author ID domain. */\n get outputType(): TypeInfo | undefined {\n return this.column.outputType;\n }\n\n get sqlNullable(): boolean | undefined {\n return this.column.sqlNullable;\n }\n\n get sqlSource(): object {\n return this.mgmt;\n }\n\n toSql(ctx: ExprContext): SqlFragment {\n const alias = ctx.aliasFor(this.mgmt);\n return { sql: kqDot(alias, this.column.columnName), bindings: [], refs: [alias] };\n }\n\n /** Decodes result-set values with public PK/FK ids, while hydration keeps internal tagged ids. */\n decode(value: unknown): unknown {\n if (value === null || value === undefined) return value;\n const idMeta = this.idMetadata;\n if (idMeta) return toIdOf(idMeta, this.column.mapFromDb(value) as TaggedId | undefined);\n return this.column.mapFromDb(value);\n }\n\n encode(value: unknown): unknown {\n return this.column.mapToDb(value);\n }\n\n /** Identifies the ID domain of a primary key, FK, or physical polymorphic component. */\n get idMetadata(): EntityMetadata | undefined {\n return this.column.idMetadata?.();\n }\n\n /** Encodes literals when the condition is created and renders with each query's aliases. */\n addCondition(value: ParsedValueFilter<unknown>): SqlCondition {\n const encoded = mapToDb(this.column, value);\n return deferredCondition((ctx) => {\n const left = this.toSql(ctx);\n const [sql, bindings] = buildValueCondition(left.sql, encoded);\n return { sql, bindings: [...left.bindings, ...bindings], refs: left.refs };\n });\n }\n\n /** Renders raw operators against the same quoted column SQL as other expressions. */\n protected addRawCondition(exp: string, bindings: readonly any[]): SqlCondition {\n return deferredCondition((ctx) => {\n const left = this.toSql(ctx);\n return { sql: `${left.sql} ${exp}`, bindings: [...left.bindings, ...bindings], refs: left.refs };\n });\n }\n\n /** Uses column filter conversions for literals and shared comparisons for expressions and null equality. */\n protected compare(op: string, value: unknown): SqlCondition {\n if (value === undefined || isExpr(value) || (value === null && (op === \"=\" || op === \"!=\"))) {\n return super.compare(op, value);\n }\n // Primitive relational comparisons historically bind null through mapToDb.\n const kind = ({ \"=\": \"eq\", \"!=\": \"ne\", \">\": \"gt\", \">=\": \"gte\", \"<\": \"lt\", \"<=\": \"lte\" } as const)[op];\n if (!kind) return fail(`Invalid operator ${op}`);\n return this.addCondition({ kind, value });\n }\n\n /**\n * Compares this column to another expression.\n *\n * Table columns, aggregates, subquery columns, and `sql` templates use the expression context\n * to render their complete SQL.\n * Negated array operators wrap the complete comparison in NOT.\n */\n protected compareToExpr(op: string, value: ExprLike<any>, negate = false): SqlCondition {\n if (negate) {\n return deferredCondition((ctx) => {\n const comparison = ctx.conditionToSql(this.compareToExpr(op, value))!;\n return { ...comparison, sql: `NOT (${comparison.sql})` };\n });\n }\n return super.compare(op, value);\n }\n}\n\nclass PrimitiveColumnImpl<V, N extends null | never> extends TableColumn implements PrimitiveColumn<V, N> {\n between(v1: V | undefined, v2: V | undefined): SqlCondition {\n if (v1 === undefined || v2 === undefined) return skipCondition;\n return this.addCondition({ kind: \"between\", value: [v1, v2] });\n }\n\n like(value: V | undefined): SqlCondition {\n if (value === undefined) return skipCondition;\n return this.addCondition({ kind: \"like\", value });\n }\n\n ilike(value: V | undefined): SqlCondition {\n if (value === undefined) return skipCondition;\n return this.addCondition({ kind: \"ilike\", value });\n }\n\n search(value: V | undefined): SqlCondition {\n // Check !value so that empty strings are pruned\n if (!value) return skipCondition;\n return this.addCondition({ kind: \"ilike\", value: makeLike(value) });\n }\n\n in(values: readonly (V | null)[] | ExprLike<V | null> | undefined): SqlCondition {\n if (values === undefined) return skipCondition;\n if (isExpr(values)) return this.inList(\"IN\", values);\n if (values.includes(null)) {\n const isNull = this.addCondition({ kind: \"is-null\" });\n const hasValue = this.addCondition({ kind: \"in\", value: values.filter((v) => v !== null) });\n return { or: [isNull, hasValue] };\n } else {\n return this.addCondition({ kind: \"in\", value: values as V[] });\n }\n }\n\n /** Applies an IN condition unless the list is empty or undefined. */\n inNonEmpty(values: readonly (V | null)[] | undefined): SqlCondition {\n return values === undefined || values.length === 0 ? skipCondition : this.in(values);\n }\n\n nin(values: readonly (V | null)[] | ExprLike<V | null> | undefined): SqlCondition {\n if (values === undefined) return skipCondition;\n if (isExpr(values)) return this.inList(\"NOT IN\", values);\n return this.addCondition({ kind: \"nin\", value: values.filter((v) => v !== null) as V[] });\n }\n\n // V will already be an array\n contains(v1: string | V | PrimitiveColumn<V, any> | N | undefined): SqlCondition {\n if (v1 === undefined) return skipCondition;\n if (isExpr(v1)) return this.compareToExpr(\"@>\", v1);\n return this.addCondition({ kind: \"contains\", value: v1 as any });\n }\n\n // V will already be an array\n ncontains(v1: string | V | PrimitiveColumn<V, any> | N | undefined): SqlCondition {\n if (v1 === undefined) return skipCondition;\n if (isExpr(v1)) return this.compareToExpr(\"@>\", v1, true);\n return this.addCondition({ kind: \"ncontains\", value: v1 as any });\n }\n\n // V will already be an array\n overlaps(v1: V | PrimitiveColumn<V, any> | N | undefined): SqlCondition {\n if (v1 === undefined) return skipCondition;\n if (isExpr(v1)) return this.compareToExpr(\"&&\", v1);\n return this.addCondition({ kind: \"overlaps\", value: v1 as any });\n }\n\n noverlaps(v1: V | PrimitiveColumn<V, any> | N | undefined): SqlCondition {\n if (v1 === undefined) return skipCondition;\n if (isExpr(v1)) return this.compareToExpr(\"&&\", v1, true);\n return this.addCondition({ kind: \"noverlaps\", value: v1 as any });\n }\n\n pathExists(jsonPath: string | undefined): SqlCondition {\n if (jsonPath === undefined) return skipCondition;\n return this.addCondition({ kind: \"jsonPathExists\", value: jsonPath });\n }\n\n pathIsTrue(jsonPath: string | undefined): SqlCondition {\n if (jsonPath === undefined) return skipCondition;\n return this.addCondition({ kind: \"jsonPathPredicate\", value: jsonPath });\n }\n\n raw(exp: string, bindings: readonly any[] | undefined): SqlCondition {\n if (bindings === undefined) return skipCondition;\n return this.addRawCondition(exp, bindings);\n }\n}\n\nclass EntityColumnImpl<T> extends TableColumn implements EntityColumn<T> {\n in(values: readonly (T | IdOf<T> | null)[] | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition {\n if (values === undefined) {\n return skipCondition;\n } else if (values === null) {\n throw new Error(\"Unsupported\");\n } else if (isExpr(values)) {\n return this.inList(\"IN\", values);\n } else if (values.includes(null)) {\n // Like `PrimitiveColumn.in`, split `[a1, null]` into `IS NULL OR IN (...)`\n const isNull = this.addCondition({ kind: \"is-null\" });\n const hasValue = this.addCondition({ kind: \"in\", value: values.filter((v) => v !== null) as any });\n return { or: [isNull, hasValue] };\n } else {\n return this.addCondition({ kind: \"in\", value: values as any });\n }\n }\n\n /** Applies an IN condition unless the list is empty, null, or undefined. */\n inNonEmpty(values: readonly (T | IdOf<T> | null)[] | null | undefined): SqlCondition {\n return values === null || values === undefined || values.length === 0 ? skipCondition : this.in(values);\n }\n\n nin(values: readonly (T | IdOf<T> | null)[] | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition {\n if (values === undefined) {\n return skipCondition;\n } else if (values === null) {\n throw new Error(\"Unsupported\");\n } else if (isExpr(values)) {\n return this.inList(\"NOT IN\", values);\n } else {\n return this.addCondition({ kind: \"nin\", value: values.filter((v) => v !== null) as any });\n }\n }\n\n gt(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition {\n return this.compareId(\">\", \"gt\", value);\n }\n\n gte(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition {\n return this.compareId(\">=\", \"gte\", value);\n }\n\n lt(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition {\n return this.compareId(\"<\", \"lt\", value);\n }\n\n lte(value: IdOf<T> | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition {\n return this.compareId(\"<=\", \"lte\", value);\n }\n\n raw(exp: string, bindings: readonly any[] | undefined): SqlCondition {\n if (bindings === undefined) return skipCondition;\n return this.addRawCondition(exp, bindings);\n }\n\n /** Joins via this FK, inheriting the source's LEFT join for otherwise required references. */\n as(other: object): object {\n return {\n ...this.joinEntry(this.sqlNullable === false ? \"inner\" : \"left\", other),\n [referenceJoinSource]: this.mgmt,\n };\n }\n\n inner(other: object): object {\n return this.joinEntry(\"inner\", other);\n }\n\n left(other: object): object {\n return this.joinEntry(\"left\", other);\n }\n\n private joinEntry(kind: JoinKind, other: object): object {\n return { [kind]: requireTable(other), on: this.eq(idColumnOf(other)) };\n }\n\n private compareId(op: string, kind: \"gt\" | \"gte\" | \"lt\" | \"lte\", value: unknown): SqlCondition {\n if (value === undefined) return skipCondition;\n if (value === null) throw new Error(\"Unsupported\");\n if (isExpr(value)) return this.compareToExpr(op, value);\n return this.addCondition({ kind, value: value as any });\n }\n}\n\nclass PolyReferenceImpl<T extends Entity> {\n public constructor(\n private meta: EntityMetadata,\n private mgmt: TableMgmt,\n private field: PolymorphicField,\n ) {}\n\n /** Compares to a tagged id, an entity, or another table's id column, which picks the component (`c.parent.eq(a.id)`). */\n eq(value: T | TaggedId | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition {\n return this.addEqOrNe(\"eq\", value);\n }\n\n ne(value: T | TaggedId | ExprLike<IdOf<T> | null> | null | undefined): SqlCondition {\n return this.addEqOrNe(\"ne\", value);\n }\n\n // We required tagged ids for polys\n in(values: readonly (T | TaggedId)[] | ExprLike<IdOf<T> | null> | undefined): SqlCondition {\n if (values === undefined) return skipCondition;\n if (isExpr(values)) return this.inSubquery(values);\n // Split up the ids by constructor\n const idsByConstructor = groupBy(values, (id) => getConstructorFromTaggedId(maybeResolveReferenceToId(id)!).name);\n // Or together `parent_book_id in (1,2,3) OR parent_author_id IN (4,5,6)`\n return {\n or: Object.entries(idsByConstructor).map(([cstrName, ids]) => {\n const comp =\n this.field.components.find((p) => p.otherMetadata().cstr.name === cstrName) ??\n fail(`No component for ${cstrName}`);\n return this.componentColumn(comp).addCondition({ kind: \"in\", value: ids });\n }),\n };\n }\n\n /** Applies an IN condition unless the list is empty or undefined. */\n inNonEmpty(values: readonly (T | TaggedId)[] | undefined): SqlCondition {\n return values === undefined || values.length === 0 ? skipCondition : this.in(values);\n }\n\n /** Joins via this poly's component, inheriting the source's LEFT join when the poly is required. */\n as(other: object): object {\n return { ...this.joinEntry(this.field.required ? \"inner\" : \"left\", other), [referenceJoinSource]: this.mgmt };\n }\n\n inner(other: object): object {\n return this.joinEntry(\"inner\", other);\n }\n\n left(other: object): object {\n return this.joinEntry(\"left\", other);\n }\n\n private joinEntry(kind: JoinKind, other: object): object {\n return { [kind]: requireTable(other), on: this.eq(idColumnOf(other) as any) };\n }\n\n /**\n * i.e. `c.parent.in(query({ from: a, ..., select: a.id }))`: like `eq` against a table column, the\n * subquery's agreed ID domain picks the component, i.e. authors pick `parent_author_id`.\n */\n private inSubquery(values: ExprLike<any>): SqlCondition {\n // Only actual subqueries expose this getter; importing query.ts would create a load-order cycle.\n const selected = asNode(values).subquerySelect;\n const outputType = selected?.outputType;\n let otherMeta = outputType?.idMeta;\n if (!otherMeta) {\n // Ordinary reads can select an unknown key serde. Compounds validate codecs before exposing a select.\n if (!outputType && selected instanceof TableColumn) {\n otherMeta = selected.idMetadata;\n }\n if (!otherMeta) {\n return fail(\n selected instanceof TableColumn\n ? `${this.field.fieldName} \\`in\\` needs an id or FK column, got ${selected.column.columnName}`\n : `${this.field.fieldName} is polymorphic, so \\`in\\` needs a subquery selecting an id or FK column`,\n );\n }\n }\n const comp =\n this.field.components.find((p) => getBaseAndSelfMetas(otherMeta).includes(p.otherMetadata())) ??\n fail(`${this.field.fieldName} has no component for ${otherMeta.type}`);\n return this.componentColumn(comp).in(values);\n }\n\n private addEqOrNe(\n kind: \"eq\" | \"ne\",\n value: T | TaggedId | ExprLike<IdOf<T> | null> | null | undefined,\n ): SqlCondition {\n if (value === undefined) {\n return skipCondition;\n } else if (value instanceof TableColumn) {\n // Joining through the poly, i.e. `c.parent.eq(a.id)`: the other table column's ID domain picks the component\n const otherMeta = value.idMetadata ?? fail(`${this.field.fieldName} needs an id or FK column`);\n const comp =\n this.field.components.find((p) => getBaseAndSelfMetas(otherMeta).includes(p.otherMetadata())) ??\n fail(`${this.field.fieldName} has no component for ${otherMeta.type}`);\n return this.componentColumn(comp)[kind](value);\n } else if (isExpr(value)) {\n return fail(\n `${this.field.fieldName} is polymorphic, so it can only be compared to tagged ids or entity table columns`,\n );\n } else if (value === null) {\n // We can AND each of the components as many conditions\n const value = kind === \"eq\" ? ({ kind: \"is-null\" } as const) : ({ kind: \"not-null\" } as const);\n return {\n and: this.field.components.map((p) => this.componentColumn(p).addCondition(value)),\n };\n } else {\n // If we have a value, we can find the component\n const comp =\n this.field.components.find(\n (p) => p.otherMetadata().cstr === getConstructorFromTaggedId(maybeResolveReferenceToId(value) as string),\n ) || fail(`Could not find component for ${value}`);\n return this.componentColumn(comp)[kind](value);\n }\n }\n\n /** Returns the physical FK expression for one polymorphic target. */\n private componentColumn(comp: PolymorphicFieldComponent): EntityColumnImpl<T> {\n const descriptor = comp.column;\n return new EntityColumnImpl<T>(this.meta, descriptor, this.mgmt);\n }\n}\n\n/**\n * Marks a sugar join entry whose target is a *collection* (o2m/m2m), which filter soft-deletes like\n * em.find's \"collections filter out soft-deletes, but m2o/o2o references still return them\"; see\n * `QueryParser.addSoftDeleteCondition`'s call site. Reference joins and explicit joins are unmarked.\n */\nexport const collectionJoin: unique symbol = Symbol(\"joist.collectionJoin\");\n\n/** Marks a sugar m2m join entry (`a.tags.as(t)`) with its hidden join-table join; `parseQuery` expands it. */\nexport const m2mJoinTable: unique symbol = Symbol(\"joist.m2mJoinTable\");\n\nexport interface M2mJoinTable {\n handle: JoinTableHandle;\n on: SqlCondition;\n}\n\n/** The runtime identity of an m2m join table in a query, i.e. `authors_to_tags`; it has no entity. */\nexport class JoinTableHandle {\n constructor(readonly joinTableName: string) {}\n}\n\ntype JoinKind = \"inner\" | \"left\";\n\n/**\n * The `as`/`inner`/`left` join factory for collection relations, i.e. `a.books.as(b)` joins with the\n * relation's default kind (LEFT: a collection may be empty) and `.inner`/`.left` override. m2o/poly\n * relations implement the same three methods on their join factories. Physical FKs such as\n * `b.author_id` are expressions that also expose a join factory.\n */\nabstract class CollectionJoinImpl {\n as(other: object): object {\n return this.joinEntry(\"left\", requireTable(other));\n }\n\n inner(other: object): object {\n return this.joinEntry(\"inner\", requireTable(other));\n }\n\n left(other: object): object {\n return this.joinEntry(\"left\", requireTable(other));\n }\n\n protected abstract joinEntry(kind: JoinKind, other: TableFor<Entity>): object;\n}\n\n/** Joins a named subtype explicitly; only STI subtype sugar adds a discriminator to its ON. */\nclass SubtypeJoinImpl extends CollectionJoinImpl {\n constructor(\n private proxy: TableFor<Entity>,\n private subtype: EntityMetadata,\n ) {\n super();\n }\n\n protected joinEntry(kind: JoinKind, other: TableFor<Entity>): object {\n if (getTableMetadata(other) !== this.subtype) {\n return fail(`Expected table(${this.subtype.type}) for the explicit subtype join`);\n }\n const on = idColumnOf(this.proxy).eq(idColumnOf(other));\n if (this.subtype.inheritanceType !== \"sti\" || this.subtype.stiDiscriminatorValue === undefined) {\n return { [kind]: other, on };\n }\n const base = this.subtype.baseTypes.find((m) => m.stiDiscriminatorField !== undefined)!;\n const columnName = base.fields[base.stiDiscriminatorField!].serde!.columns[0].columnName;\n // Discriminator values are database enum ids, not domain enum values to pass through the field codec.\n const discriminator = deferredCondition((ctx) => {\n const alias = ctx.aliasFor(other[tableMgmt]);\n return {\n sql: `${kqDot(alias, columnName)} = ?`,\n bindings: [this.subtype.stiDiscriminatorValue],\n refs: [alias],\n };\n });\n return { [kind]: other, on: { and: [on, discriminator] } };\n }\n}\n\n/** An o2m/lo2m/o2o relation: the ON is the other side's FK (an m2o or a poly component) back to our id. */\nclass OneToManyJoinImpl extends CollectionJoinImpl {\n constructor(\n private proxy: any,\n private field: OneToManyField | LargeOneToManyField | OneToOneField,\n ) {\n super();\n }\n\n protected joinEntry(kind: JoinKind, other: TableFor<Entity>): object {\n const { field } = this;\n const otherMeta = getTableMetadata(other);\n const descriptor = Object.values(otherMeta.columns).find((column) => column.columnName === field.otherColumnName);\n if (!descriptor) {\n return fail(\n `Cannot join ${getTableMetadata(this.proxy).type}.${field.fieldName} to ${otherMeta.type}: ` +\n `${field.otherColumnName} is not physically present on ${otherMeta.tableName}; join the base table explicitly`,\n );\n }\n const column = new EntityColumnImpl(otherMeta, descriptor, other[tableMgmt]);\n const on = column.eq(this.proxy.id);\n // Collections (o2m/lo2m) filter soft-deletes like em.find; o2o references resolve them\n const filtered = field.kind === \"o2m\" ? field.softDeletes !== \"include\" : field.kind === \"lo2m\";\n return { [kind]: other, on, [collectionJoin]: filtered };\n }\n}\n\n/**\n * An m2m relation, i.e. `a.tags.as(t)`.\n *\n * The entry's own ON is `t.id = att.tag_id`, and the hidden `[m2mJoinTable]` half is\n * `att.author_id = a.id`; only the target's ON references the join table, so reference pruning keeps\n * or drops the pair together. Both are deferred conditions: the join table has no entity metadata, so\n * its alias only exists once the parser registers it.\n */\nclass ManyToManyJoinImpl extends CollectionJoinImpl {\n constructor(\n private proxy: any,\n private field: ManyToManyField,\n ) {\n super();\n }\n\n protected joinEntry(kind: JoinKind, other: TableFor<Entity>): object {\n const { joinTableName, columnNames } = this.field;\n const [ourColumn, otherColumn] = columnNames;\n const jt = new JoinTableHandle(joinTableName);\n const ourId = idColumnOf(this.proxy);\n const otherId = idColumnOf(other);\n const jtOn = deferredCondition((ctx) => {\n const jtAlias = ctx.aliasFor(jt);\n const id = ourId.toSql(ctx);\n return { sql: `${kqDot(jtAlias, ourColumn)} = ${id.sql}`, bindings: id.bindings, refs: id.refs };\n });\n const on = deferredCondition((ctx) => {\n const jtAlias = ctx.aliasFor(jt);\n const id = otherId.toSql(ctx);\n return { sql: `${id.sql} = ${kqDot(jtAlias, otherColumn)}`, bindings: id.bindings, refs: [...id.refs, jtAlias] };\n });\n const filtered = this.field.softDeletes !== \"include\";\n return {\n [kind]: other,\n on,\n [collectionJoin]: filtered,\n [m2mJoinTable]: { handle: jt, on: jtOn } satisfies M2mJoinTable,\n };\n }\n}\n\n/** Fails fast when a join factory is passed something other than a table. */\nfunction requireTable(other: object): TableFor<Entity> {\n if (!isTable(other)) return fail(`Expected a table to join, got ${other}`);\n return other;\n}\n\n/** The id column of a joined table, for building sugar ON conditions. */\nfunction idColumnOf(other: object): TableColumn {\n return (other as any).id;\n}\n\n/** Keeps relation names join-only; physical FK columns retain expression methods. */\nclass ReferenceJoinImpl {\n constructor(private column: EntityColumnImpl<unknown>) {}\n\n as(other: object): object {\n return this.column.as(other);\n }\n\n inner(other: object): object {\n return this.column.inner(other);\n }\n\n left(other: object): object {\n return this.column.left(other);\n }\n}\n\n/** Identifies domain relationship keys exposed alongside physical columns. */\nfunction isRelation(field: Field | undefined): boolean {\n return field !== undefined && [\"m2o\", \"poly\", \"o2m\", \"lo2m\", \"m2m\", \"o2o\"].includes(field.kind);\n}\n\n/** Resolves relationship sugar only from domain fields owned by this physical table. */\nfunction physicalRelation(meta: EntityMetadata, key: string): Field | undefined {\n const owners = [meta, ...getBaseSelfAndSubMetas(getBaseMeta(meta))];\n const owner = owners.find((owner) => owner.tableName === meta.tableName && Object.hasOwn(owner.fields, key));\n const field = owner?.fields[key];\n if (!isRelation(field)) return undefined;\n // I.e. TaskNew.copiedFrom uses Task's original FK domain, not its specialized TaskNew target.\n if (field?.kind === \"m2o\" || field?.kind === \"poly\") {\n if (!field.serde.columns.every((binding) => Object.values(meta.columns).includes(binding.column))) return undefined;\n return field.kind === \"poly\"\n ? {\n ...field,\n components: field.components.map((component) => ({\n column: component.column,\n columnName: component.columnName,\n otherFieldName: component.otherFieldName,\n otherMetadata: component.column.idMetadata!,\n })),\n }\n : field;\n }\n return field;\n}\n\n/**\n * Maps local domain fields to table-bound conditions, encoding each leaf once.\n * I.e. Author.firstName uses the first_name column but resolves its alias in each query scope.\n * Collections, polymorphic references, and inherited nonlocal fields require explicit expressions.\n */\nfunction tableWhere(mgmt: TableMgmt, filter: object): SqlCondition {\n const { meta } = mgmt;\n const conditions: SqlCondition[] = [];\n if (!filter || typeof filter !== \"object\" || Array.isArray(filter)) {\n throw new Error(`Expected a domain field filter for ${meta.type}`);\n }\n for (const [key, value] of Object.entries(filter)) {\n // CTI allFields.id points at the base key; the subtype has its own physical key.\n const field = key === \"id\" ? meta.fields.id : Object.hasOwn(meta.allFields, key) ? meta.allFields[key] : undefined;\n if (\n !field ||\n ![\"primaryKey\", \"primitive\", \"enum\", \"m2o\"].includes(field.kind) ||\n !field.serde ||\n field.serde.columns.length !== 1 ||\n !field.serde.columns.every((binding) => Object.values(meta.columns).includes(binding.column))\n ) {\n throw new Error(`Unsupported table filter field ${meta.type}.${key}; use an explicit join`);\n }\n const column = new TableColumn(meta, field.serde.columns[0].column, mgmt);\n let leaves: ParsedValueFilter<unknown>[];\n if (field.kind === \"m2o\") {\n if (!isTableReferenceFilter(value)) {\n throw new Error(`Unsupported table reference filter ${meta.type}.${key}; use an entity or ID`);\n }\n const parsed = parseEntityFilter(field.otherMetadata(), value);\n if (parsed?.kind === \"join\") {\n throw new Error(`Unsupported table reference filter ${meta.type}.${key}; use an entity or ID`);\n }\n leaves = parsed ? [parsed] : [];\n } else {\n leaves = parseValueFilter(value);\n }\n for (const leaf of leaves) {\n if (leaf.kind === \"between\" && leaf.value.some((v) => v === undefined)) {\n if (leaf.value[0] !== undefined) conditions.push(column.addCondition({ kind: \"gte\", value: leaf.value[0] }));\n if (leaf.value[1] !== undefined) conditions.push(column.addCondition({ kind: \"lte\", value: leaf.value[1] }));\n } else if (leaf.kind === \"in\" && !column.column.isArray && leaf.value.includes(null)) {\n conditions.push({\n or: [\n column.addCondition({ kind: \"is-null\" }),\n column.addCondition({ kind: \"in\", value: leaf.value.filter((v) => v !== null) }),\n ],\n });\n } else {\n conditions.push(column.addCondition(leaf));\n }\n }\n }\n return conditions.length === 0 ? skipCondition : { and: conditions };\n}\n\n/** Rejects nested relations, scopes, and aliases before parsing owning-reference values. */\nfunction isTableReferenceFilter(value: unknown): boolean {\n if (value == null || typeof value === \"boolean\" || isTableReferenceValue(value)) return true;\n if (Array.isArray(value)) return value.every(isTableReferenceValue);\n if (typeof value === \"object\" && Object.keys(value).length === 1 && Object.hasOwn(value, \"ne\")) {\n const excluded = (value as { ne: unknown }).ne;\n return excluded == null || isTableReferenceValue(excluded);\n }\n return false;\n}\n\n/** Recognizes an entity or public ID without accepting another filter object. */\nfunction isTableReferenceValue(value: unknown): boolean {\n return typeof value === \"string\" || typeof value === \"number\" || isEntity(value);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAyDA,SAAgB,MAAwB,MAAyC,OAAyB;CAExG,OAAO,cAAc,IAAI;AAC3B;;AAGA,SAAgB,OACd,GAAG,MACyG;CAC5G,OAAO,KAAK,KAAK,MAAM,cAAc,CAAC,CAAC;AACzC;;AAyHA,MAAa,sBAAqC,OAAO,2BAA2B;AAgIpF,MAAa,YAAY,OAAO,WAAW;AAE3C,SAAgB,aAAa,OAAqC;CAChE,OAAO,MAAM;AACf;;AAgBA,SAAgB,iBAAmC,OAAuC;CAExF,OADa,MAAM,UACR,CAAC;AACd;AAEA,SAAgB,cAAgC,MAAmD;CACjG,MAAM,OAAOA,uBAAAA,YAAY,IAAI;CAE7B,MAAM,OAAkB;EAAE,WAAW,KAAK;EAAW;CAAK;CAC1D,MAAM,WAAW,IAAI,IAAI,KAAK,SAAS,KAAK,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,YAAY,IAAI,EAAE,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACjG,MAAM,QAAa,IAAI,MAAM,MAAM;;EAEjC,IAAI,GAAG,KAAuB;GAC5B,IAAI,QAAQ,WACV,OAAO;GAET,IAAI,OAAO,QAAQ,UAAU,OAAO,KAAA;GACpC,MAAM,aAAa,OAAO,OAAO,KAAK,SAAS,GAAG,IAAI,KAAK,QAAQ,OAAO,KAAA;GAC1E,IAAI,YACF,OAAO,WAAW,cAAc,QAAQ,OACpC,IAAI,iBAAiB,MAAM,YAAY,IAAI,IAC3C,IAAI,oBAAoB,MAAM,YAAY,IAAI;GAEpD,MAAM,UAAU,SAAS,IAAI,GAAG;GAChC,IAAI,SAAS;IACX,MAAM,OAAO,IAAI,gBAAgB,OAAO,OAAO;IAC/C,OAAO,OAAO,OAAO,KAAK,GAAG,KAAK,IAAI,GAAG;KACvC,IAAI,KAAK,GAAG,KAAK,IAAI;KACrB,OAAO,KAAK,MAAM,KAAK,IAAI;KAC3B,MAAM,KAAK,KAAK,KAAK,IAAI;IAC3B,CAAC;GACH;GACA,MAAM,WAAW,iBAAiB,MAAM,GAAG;GAC3C,IAAI,QAAQ,WAAW,CAAC,WAAW,KAAK,UAAU,IAAI,GACpD,QAAQ,WAA2B,WAAW,MAAM,MAAM;GAE5D,MAAM,QAAQ,YAAYC,cAAAA,KAAK,qBAAqB,IAAI,MAAM,KAAK,KAAK,iCAAiC;GACzG,QAAQ,MAAM,MAAd;IACE,KAAK,OACH,OAAO,IAAI,kBAAkB,IAAI,iBAAiB,MAAM,MAAM,MAAM,QAAQ,EAAE,CAAC,QAAQ,IAAI,CAAC;IAC9F,KAAK,QACH,OAAO,IAAI,kBAAkB,MAAM,MAAM,KAAK;IAChD,KAAK;IACL,KAAK;IACL,KAAK,QACH,OAAO,IAAI,kBAAkB,OAAO,KAAK;IAC3C,KAAK,OACH,OAAO,IAAI,mBAAmB,OAAO,KAAK;IAC5C,SACE,MAAM,IAAI,MAAM,gCAAgC,MAAM,MAAM;GAChE;EACF;EAEA,IAAI,GAAG,KAAK;GACV,OACE,QAAQ,aACP,OAAO,QAAQ,aACb,QAAQ,WAAW,OAAO,OAAO,KAAK,SAAS,GAAG,KAAK,CAAC,CAAC,iBAAiB,MAAM,GAAG,KAAK,SAAS,IAAI,GAAG;EAE/G;CACF,CAAC;CACD,OAAO;AACT;AAEA,SAAgB,QAAQ,KAAsC;CAE5D,OAAO,OAAO,QAAQ,cAAc,aAAa;AACnD;;;;;AAMA,IAAM,cAAN,cAA0BC,aAAAA,SAAS;CAEtB;CACA;CACA;CAHX,YACE,MACA,QACA,MACA;EACA,MAAM;EAJG,KAAA,OAAA;EACA,KAAA,SAAA;EACA,KAAA,OAAA;CAGX;;CAGA,IAAI,aAAmC;EACrC,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,cAAmC;EACrC,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,YAAoB;EACtB,OAAO,KAAK;CACd;CAEA,MAAM,KAA+B;EACnC,MAAM,QAAQ,IAAI,SAAS,KAAK,IAAI;EACpC,OAAO;GAAE,KAAKC,iBAAAA,MAAM,OAAO,KAAK,OAAO,UAAU;GAAG,UAAU,CAAC;GAAG,MAAM,CAAC,KAAK;EAAE;CAClF;;CAGA,OAAO,OAAyB;EAC9B,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;EAClD,MAAM,SAAS,KAAK;EACpB,IAAI,QAAQ,OAAOC,aAAAA,OAAO,QAAQ,KAAK,OAAO,UAAU,KAAK,CAAyB;EACtF,OAAO,KAAK,OAAO,UAAU,KAAK;CACpC;CAEA,OAAO,OAAyB;EAC9B,OAAO,KAAK,OAAO,QAAQ,KAAK;CAClC;;CAGA,IAAI,aAAyC;EAC3C,OAAO,KAAK,OAAO,aAAa;CAClC;;CAGA,aAAa,OAAiD;EAC5D,MAAM,UAAUC,oBAAAA,QAAQ,KAAK,QAAQ,KAAK;EAC1C,OAAOC,aAAAA,mBAAmB,QAAQ;GAChC,MAAM,OAAO,KAAK,MAAM,GAAG;GAC3B,MAAM,CAAC,KAAK,YAAYC,2BAAAA,oBAAoB,KAAK,KAAK,OAAO;GAC7D,OAAO;IAAE;IAAK,UAAU,CAAC,GAAG,KAAK,UAAU,GAAG,QAAQ;IAAG,MAAM,KAAK;GAAK;EAC3E,CAAC;CACH;;CAGA,gBAA0B,KAAa,UAAwC;EAC7E,OAAOD,aAAAA,mBAAmB,QAAQ;GAChC,MAAM,OAAO,KAAK,MAAM,GAAG;GAC3B,OAAO;IAAE,KAAK,GAAG,KAAK,IAAI,GAAG;IAAO,UAAU,CAAC,GAAG,KAAK,UAAU,GAAG,QAAQ;IAAG,MAAM,KAAK;GAAK;EACjG,CAAC;CACH;;CAGA,QAAkB,IAAY,OAA8B;EAC1D,IAAI,UAAU,KAAA,KAAaE,aAAAA,OAAO,KAAK,KAAM,UAAU,SAAS,OAAO,OAAO,OAAO,OACnF,OAAO,MAAM,QAAQ,IAAI,KAAK;EAGhC,MAAM,OAAQ;GAAE,KAAK;GAAM,MAAM;GAAM,KAAK;GAAM,MAAM;GAAO,KAAK;GAAM,MAAM;EAAM,EAAY;EAClG,IAAI,CAAC,MAAM,OAAOP,cAAAA,KAAK,oBAAoB,IAAI;EAC/C,OAAO,KAAK,aAAa;GAAE;GAAM;EAAM,CAAC;CAC1C;;;;;;;;CASA,cAAwB,IAAY,OAAsB,SAAS,OAAqB;EACtF,IAAI,QACF,OAAOK,aAAAA,mBAAmB,QAAQ;GAChC,MAAM,aAAa,IAAI,eAAe,KAAK,cAAc,IAAI,KAAK,CAAC;GACnE,OAAO;IAAE,GAAG;IAAY,KAAK,QAAQ,WAAW,IAAI;GAAG;EACzD,CAAC;EAEH,OAAO,MAAM,QAAQ,IAAI,KAAK;CAChC;AACF;AAEA,IAAM,sBAAN,cAA6D,YAA6C;CACxG,QAAQ,IAAmB,IAAiC;EAC1D,IAAI,OAAO,KAAA,KAAa,OAAO,KAAA,GAAW,OAAOG,sBAAAA;EACjD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAW,OAAO,CAAC,IAAI,EAAE;EAAE,CAAC;CAC/D;CAEA,KAAK,OAAoC;EACvC,IAAI,UAAU,KAAA,GAAW,OAAOA,sBAAAA;EAChC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAQ;EAAM,CAAC;CAClD;CAEA,MAAM,OAAoC;EACxC,IAAI,UAAU,KAAA,GAAW,OAAOA,sBAAAA;EAChC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAS;EAAM,CAAC;CACnD;CAEA,OAAO,OAAoC;EAEzC,IAAI,CAAC,OAAO,OAAOA,sBAAAA;EACnB,OAAO,KAAK,aAAa;GAAE,MAAM;GAAS,OAAOC,oBAAAA,SAAS,KAAK;EAAE,CAAC;CACpE;CAEA,GAAG,QAA8E;EAC/E,IAAI,WAAW,KAAA,GAAW,OAAOD,sBAAAA;EACjC,IAAID,aAAAA,OAAO,MAAM,GAAG,OAAO,KAAK,OAAO,MAAM,MAAM;EACnD,IAAI,OAAO,SAAS,IAAI,GAGtB,OAAO,EAAE,IAAI,CAFE,KAAK,aAAa,EAAE,MAAM,UAAU,CAEhC,GADF,KAAK,aAAa;GAAE,MAAM;GAAM,OAAO,OAAO,QAAQ,MAAM,MAAM,IAAI;EAAE,CAC5D,CAAC,EAAE;OAEhC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAM,OAAO;EAAc,CAAC;CAEjE;;CAGA,WAAW,QAAyD;EAClE,OAAO,WAAW,KAAA,KAAa,OAAO,WAAW,IAAIC,sBAAAA,gBAAgB,KAAK,GAAG,MAAM;CACrF;CAEA,IAAI,QAA8E;EAChF,IAAI,WAAW,KAAA,GAAW,OAAOA,sBAAAA;EACjC,IAAID,aAAAA,OAAO,MAAM,GAAG,OAAO,KAAK,OAAO,UAAU,MAAM;EACvD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAO,OAAO,OAAO,QAAQ,MAAM,MAAM,IAAI;EAAS,CAAC;CAC1F;CAGA,SAAS,IAAwE;EAC/E,IAAI,OAAO,KAAA,GAAW,OAAOC,sBAAAA;EAC7B,IAAID,aAAAA,OAAO,EAAE,GAAG,OAAO,KAAK,cAAc,MAAM,EAAE;EAClD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAY,OAAO;EAAU,CAAC;CACjE;CAGA,UAAU,IAAwE;EAChF,IAAI,OAAO,KAAA,GAAW,OAAOC,sBAAAA;EAC7B,IAAID,aAAAA,OAAO,EAAE,GAAG,OAAO,KAAK,cAAc,MAAM,IAAI,IAAI;EACxD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAa,OAAO;EAAU,CAAC;CAClE;CAGA,SAAS,IAA+D;EACtE,IAAI,OAAO,KAAA,GAAW,OAAOC,sBAAAA;EAC7B,IAAID,aAAAA,OAAO,EAAE,GAAG,OAAO,KAAK,cAAc,MAAM,EAAE;EAClD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAY,OAAO;EAAU,CAAC;CACjE;CAEA,UAAU,IAA+D;EACvE,IAAI,OAAO,KAAA,GAAW,OAAOC,sBAAAA;EAC7B,IAAID,aAAAA,OAAO,EAAE,GAAG,OAAO,KAAK,cAAc,MAAM,IAAI,IAAI;EACxD,OAAO,KAAK,aAAa;GAAE,MAAM;GAAa,OAAO;EAAU,CAAC;CAClE;CAEA,WAAW,UAA4C;EACrD,IAAI,aAAa,KAAA,GAAW,OAAOC,sBAAAA;EACnC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAkB,OAAO;EAAS,CAAC;CACtE;CAEA,WAAW,UAA4C;EACrD,IAAI,aAAa,KAAA,GAAW,OAAOA,sBAAAA;EACnC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAqB,OAAO;EAAS,CAAC;CACzE;CAEA,IAAI,KAAa,UAAoD;EACnE,IAAI,aAAa,KAAA,GAAW,OAAOA,sBAAAA;EACnC,OAAO,KAAK,gBAAgB,KAAK,QAAQ;CAC3C;AACF;AAEA,IAAM,mBAAN,cAAkC,YAAuC;CACvE,GAAG,QAAqG;EACtG,IAAI,WAAW,KAAA,GACb,OAAOA,sBAAAA;OACF,IAAI,WAAW,MACpB,MAAM,IAAI,MAAM,aAAa;OACxB,IAAID,aAAAA,OAAO,MAAM,GACtB,OAAO,KAAK,OAAO,MAAM,MAAM;OAC1B,IAAI,OAAO,SAAS,IAAI,GAI7B,OAAO,EAAE,IAAI,CAFE,KAAK,aAAa,EAAE,MAAM,UAAU,CAEhC,GADF,KAAK,aAAa;GAAE,MAAM;GAAM,OAAO,OAAO,QAAQ,MAAM,MAAM,IAAI;EAAS,CACnE,CAAC,EAAE;OAEhC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAM,OAAO;EAAc,CAAC;CAEjE;;CAGA,WAAW,QAA0E;EACnF,OAAO,WAAW,QAAQ,WAAW,KAAA,KAAa,OAAO,WAAW,IAAIC,sBAAAA,gBAAgB,KAAK,GAAG,MAAM;CACxG;CAEA,IAAI,QAAqG;EACvG,IAAI,WAAW,KAAA,GACb,OAAOA,sBAAAA;OACF,IAAI,WAAW,MACpB,MAAM,IAAI,MAAM,aAAa;OACxB,IAAID,aAAAA,OAAO,MAAM,GACtB,OAAO,KAAK,OAAO,UAAU,MAAM;OAEnC,OAAO,KAAK,aAAa;GAAE,MAAM;GAAO,OAAO,OAAO,QAAQ,MAAM,MAAM,IAAI;EAAS,CAAC;CAE5F;CAEA,GAAG,OAA4E;EAC7E,OAAO,KAAK,UAAU,KAAK,MAAM,KAAK;CACxC;CAEA,IAAI,OAA4E;EAC9E,OAAO,KAAK,UAAU,MAAM,OAAO,KAAK;CAC1C;CAEA,GAAG,OAA4E;EAC7E,OAAO,KAAK,UAAU,KAAK,MAAM,KAAK;CACxC;CAEA,IAAI,OAA4E;EAC9E,OAAO,KAAK,UAAU,MAAM,OAAO,KAAK;CAC1C;CAEA,IAAI,KAAa,UAAoD;EACnE,IAAI,aAAa,KAAA,GAAW,OAAOC,sBAAAA;EACnC,OAAO,KAAK,gBAAgB,KAAK,QAAQ;CAC3C;;CAGA,GAAG,OAAuB;EACxB,OAAO;GACL,GAAG,KAAK,UAAU,KAAK,gBAAgB,QAAQ,UAAU,QAAQ,KAAK;IACrE,sBAAsB,KAAK;EAC9B;CACF;CAEA,MAAM,OAAuB;EAC3B,OAAO,KAAK,UAAU,SAAS,KAAK;CACtC;CAEA,KAAK,OAAuB;EAC1B,OAAO,KAAK,UAAU,QAAQ,KAAK;CACrC;CAEA,UAAkB,MAAgB,OAAuB;EACvD,OAAO;IAAG,OAAO,aAAa,KAAK;GAAG,IAAI,KAAK,GAAG,WAAW,KAAK,CAAC;EAAE;CACvE;CAEA,UAAkB,IAAY,MAAmC,OAA8B;EAC7F,IAAI,UAAU,KAAA,GAAW,OAAOA,sBAAAA;EAChC,IAAI,UAAU,MAAM,MAAM,IAAI,MAAM,aAAa;EACjD,IAAID,aAAAA,OAAO,KAAK,GAAG,OAAO,KAAK,cAAc,IAAI,KAAK;EACtD,OAAO,KAAK,aAAa;GAAE;GAAa;EAAa,CAAC;CACxD;AACF;AAEA,IAAM,oBAAN,MAA0C;CAE9B;CACA;CACA;CAHV,YACE,MACA,MACA,OACA;EAHQ,KAAA,OAAA;EACA,KAAA,OAAA;EACA,KAAA,QAAA;CACP;;CAGH,GAAG,OAAiF;EAClF,OAAO,KAAK,UAAU,MAAM,KAAK;CACnC;CAEA,GAAG,OAAiF;EAClF,OAAO,KAAK,UAAU,MAAM,KAAK;CACnC;CAGA,GAAG,QAAwF;EACzF,IAAI,WAAW,KAAA,GAAW,OAAOC,sBAAAA;EACjC,IAAID,aAAAA,OAAO,MAAM,GAAG,OAAO,KAAK,WAAW,MAAM;EAEjD,MAAM,oBAAA,GAAmBG,YAAAA,QAAAA,CAAQ,SAAS,OAAOC,kBAAAA,2BAA2BC,aAAAA,0BAA0B,EAAE,CAAE,CAAC,CAAC,IAAI;EAEhH,OAAO,EACL,IAAI,OAAO,QAAQ,gBAAgB,CAAC,CAAC,KAAK,CAAC,UAAU,SAAS;GAC5D,MAAM,OACJ,KAAK,MAAM,WAAW,MAAM,MAAM,EAAE,cAAc,CAAC,CAAC,KAAK,SAAS,QAAQ,KAC1EZ,cAAAA,KAAK,oBAAoB,UAAU;GACrC,OAAO,KAAK,gBAAgB,IAAI,CAAC,CAAC,aAAa;IAAE,MAAM;IAAM,OAAO;GAAI,CAAC;EAC3E,CAAC,EACH;CACF;;CAGA,WAAW,QAA6D;EACtE,OAAO,WAAW,KAAA,KAAa,OAAO,WAAW,IAAIQ,sBAAAA,gBAAgB,KAAK,GAAG,MAAM;CACrF;;CAGA,GAAG,OAAuB;EACxB,OAAO;GAAE,GAAG,KAAK,UAAU,KAAK,MAAM,WAAW,UAAU,QAAQ,KAAK;IAAI,sBAAsB,KAAK;EAAK;CAC9G;CAEA,MAAM,OAAuB;EAC3B,OAAO,KAAK,UAAU,SAAS,KAAK;CACtC;CAEA,KAAK,OAAuB;EAC1B,OAAO,KAAK,UAAU,QAAQ,KAAK;CACrC;CAEA,UAAkB,MAAgB,OAAuB;EACvD,OAAO;IAAG,OAAO,aAAa,KAAK;GAAG,IAAI,KAAK,GAAG,WAAW,KAAK,CAAQ;EAAE;CAC9E;;;;;CAMA,WAAmB,QAAqC;EAEtD,MAAM,WAAWK,aAAAA,OAAO,MAAM,CAAC,CAAC;EAChC,MAAM,aAAa,UAAU;EAC7B,IAAI,YAAY,YAAY;EAC5B,IAAI,CAAC,WAAW;GAEd,IAAI,CAAC,cAAc,oBAAoB,aACrC,YAAY,SAAS;GAEvB,IAAI,CAAC,WACH,OAAOb,cAAAA,KACL,oBAAoB,cAChB,GAAG,KAAK,MAAM,UAAU,wCAAwC,SAAS,OAAO,eAChF,GAAG,KAAK,MAAM,UAAU,yEAC9B;EAEJ;EACA,MAAM,OACJ,KAAK,MAAM,WAAW,MAAM,MAAMc,uBAAAA,oBAAoB,SAAS,CAAC,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,KAC5Fd,cAAAA,KAAK,GAAG,KAAK,MAAM,UAAU,wBAAwB,UAAU,MAAM;EACvE,OAAO,KAAK,gBAAgB,IAAI,CAAC,CAAC,GAAG,MAAM;CAC7C;CAEA,UACE,MACA,OACc;EACd,IAAI,UAAU,KAAA,GACZ,OAAOQ,sBAAAA;OACF,IAAI,iBAAiB,aAAa;GAEvC,MAAM,YAAY,MAAM,cAAcR,cAAAA,KAAK,GAAG,KAAK,MAAM,UAAU,0BAA0B;GAC7F,MAAM,OACJ,KAAK,MAAM,WAAW,MAAM,MAAMc,uBAAAA,oBAAoB,SAAS,CAAC,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,KAC5Fd,cAAAA,KAAK,GAAG,KAAK,MAAM,UAAU,wBAAwB,UAAU,MAAM;GACvE,OAAO,KAAK,gBAAgB,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK;EAC/C,OAAO,IAAIO,aAAAA,OAAO,KAAK,GACrB,OAAOP,cAAAA,KACL,GAAG,KAAK,MAAM,UAAU,kFAC1B;OACK,IAAI,UAAU,MAAM;GAEzB,MAAM,QAAQ,SAAS,OAAQ,EAAE,MAAM,UAAU,IAAe,EAAE,MAAM,WAAW;GACnF,OAAO,EACL,KAAK,KAAK,MAAM,WAAW,KAAK,MAAM,KAAK,gBAAgB,CAAC,CAAC,CAAC,aAAa,KAAK,CAAC,EACnF;EACF,OAAO;GAEL,MAAM,OACJ,KAAK,MAAM,WAAW,MACnB,MAAM,EAAE,cAAc,CAAC,CAAC,SAASW,kBAAAA,2BAA2BC,aAAAA,0BAA0B,KAAK,CAAW,CACzG,KAAKZ,cAAAA,KAAK,gCAAgC,OAAO;GACnD,OAAO,KAAK,gBAAgB,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK;EAC/C;CACF;;CAGA,gBAAwB,MAAsD;EAC5E,MAAM,aAAa,KAAK;EACxB,OAAO,IAAI,iBAAoB,KAAK,MAAM,YAAY,KAAK,IAAI;CACjE;AACF;;;;;;AAOA,MAAa,iBAAgC,OAAO,sBAAsB;;AAG1E,MAAa,eAA8B,OAAO,oBAAoB;;AAQtE,IAAa,kBAAb,MAA6B;CACN;CAArB,YAAY,eAAgC;EAAvB,KAAA,gBAAA;CAAwB;AAC/C;;;;;;;AAUA,IAAe,qBAAf,MAAkC;CAChC,GAAG,OAAuB;EACxB,OAAO,KAAK,UAAU,QAAQ,aAAa,KAAK,CAAC;CACnD;CAEA,MAAM,OAAuB;EAC3B,OAAO,KAAK,UAAU,SAAS,aAAa,KAAK,CAAC;CACpD;CAEA,KAAK,OAAuB;EAC1B,OAAO,KAAK,UAAU,QAAQ,aAAa,KAAK,CAAC;CACnD;AAGF;;AAGA,IAAM,kBAAN,cAA8B,mBAAmB;CAErC;CACA;CAFV,YACE,OACA,SACA;EACA,MAAM;EAHE,KAAA,QAAA;EACA,KAAA,UAAA;CAGV;CAEA,UAAoB,MAAgB,OAAiC;EACnE,IAAI,iBAAiB,KAAK,MAAM,KAAK,SACnC,OAAOA,cAAAA,KAAK,kBAAkB,KAAK,QAAQ,KAAK,gCAAgC;EAElF,MAAM,KAAK,WAAW,KAAK,KAAK,CAAC,CAAC,GAAG,WAAW,KAAK,CAAC;EACtD,IAAI,KAAK,QAAQ,oBAAoB,SAAS,KAAK,QAAQ,0BAA0B,KAAA,GACnF,OAAO;IAAG,OAAO;GAAO;EAAG;EAE7B,MAAM,OAAO,KAAK,QAAQ,UAAU,MAAM,MAAM,EAAE,0BAA0B,KAAA,CAAS;EACrF,MAAM,aAAa,KAAK,OAAO,KAAK,sBAAuB,CAAC,MAAO,QAAQ,EAAE,CAAC;EAE9E,MAAM,gBAAgBK,aAAAA,mBAAmB,QAAQ;GAC/C,MAAM,QAAQ,IAAI,SAAS,MAAM,UAAU;GAC3C,OAAO;IACL,KAAK,GAAGH,iBAAAA,MAAM,OAAO,UAAU,EAAE;IACjC,UAAU,CAAC,KAAK,QAAQ,qBAAqB;IAC7C,MAAM,CAAC,KAAK;GACd;EACF,CAAC;EACD,OAAO;IAAG,OAAO;GAAO,IAAI,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE;EAAE;CAC3D;AACF;;AAGA,IAAM,oBAAN,cAAgC,mBAAmB;CAEvC;CACA;CAFV,YACE,OACA,OACA;EACA,MAAM;EAHE,KAAA,QAAA;EACA,KAAA,QAAA;CAGV;CAEA,UAAoB,MAAgB,OAAiC;EACnE,MAAM,EAAE,UAAU;EAClB,MAAM,YAAY,iBAAiB,KAAK;EACxC,MAAM,aAAa,OAAO,OAAO,UAAU,OAAO,CAAC,CAAC,MAAM,WAAW,OAAO,eAAe,MAAM,eAAe;EAChH,IAAI,CAAC,YACH,OAAOF,cAAAA,KACL,eAAe,iBAAiB,KAAK,KAAK,CAAC,CAAC,KAAK,GAAG,MAAM,UAAU,MAAM,UAAU,KAAK,IACpF,MAAM,gBAAgB,gCAAgC,UAAU,UAAU,iCACjF;EAGF,MAAM,KAAK,IADQ,iBAAiB,WAAW,YAAY,MAAM,UACjD,CAAC,CAAC,GAAG,KAAK,MAAM,EAAE;EAElC,MAAM,WAAW,MAAM,SAAS,QAAQ,MAAM,gBAAgB,YAAY,MAAM,SAAS;EACzF,OAAO;IAAG,OAAO;GAAO;IAAK,iBAAiB;EAAS;CACzD;AACF;;;;;;;;;AAUA,IAAM,qBAAN,cAAiC,mBAAmB;CAExC;CACA;CAFV,YACE,OACA,OACA;EACA,MAAM;EAHE,KAAA,QAAA;EACA,KAAA,QAAA;CAGV;CAEA,UAAoB,MAAgB,OAAiC;EACnE,MAAM,EAAE,eAAe,gBAAgB,KAAK;EAC5C,MAAM,CAAC,WAAW,eAAe;EACjC,MAAM,KAAK,IAAI,gBAAgB,aAAa;EAC5C,MAAM,QAAQ,WAAW,KAAK,KAAK;EACnC,MAAM,UAAU,WAAW,KAAK;EAChC,MAAM,OAAOK,aAAAA,mBAAmB,QAAQ;GACtC,MAAM,UAAU,IAAI,SAAS,EAAE;GAC/B,MAAM,KAAK,MAAM,MAAM,GAAG;GAC1B,OAAO;IAAE,KAAK,GAAGH,iBAAAA,MAAM,SAAS,SAAS,EAAE,KAAK,GAAG;IAAO,UAAU,GAAG;IAAU,MAAM,GAAG;GAAK;EACjG,CAAC;EACD,MAAM,KAAKG,aAAAA,mBAAmB,QAAQ;GACpC,MAAM,UAAU,IAAI,SAAS,EAAE;GAC/B,MAAM,KAAK,QAAQ,MAAM,GAAG;GAC5B,OAAO;IAAE,KAAK,GAAG,GAAG,IAAI,KAAKH,iBAAAA,MAAM,SAAS,WAAW;IAAK,UAAU,GAAG;IAAU,MAAM,CAAC,GAAG,GAAG,MAAM,OAAO;GAAE;EACjH,CAAC;EACD,MAAM,WAAW,KAAK,MAAM,gBAAgB;EAC5C,OAAO;IACJ,OAAO;GACR;IACC,iBAAiB;IACjB,eAAe;IAAE,QAAQ;IAAI,IAAI;GAAK;EACzC;CACF;AACF;;AAGA,SAAS,aAAa,OAAiC;CACrD,IAAI,CAAC,QAAQ,KAAK,GAAG,OAAOF,cAAAA,KAAK,iCAAiC,OAAO;CACzE,OAAO;AACT;;AAGA,SAAS,WAAW,OAA4B;CAC9C,OAAQ,MAAc;AACxB;;AAGA,IAAM,oBAAN,MAAwB;CACF;CAApB,YAAY,QAA2C;EAAnC,KAAA,SAAA;CAAoC;CAExD,GAAG,OAAuB;EACxB,OAAO,KAAK,OAAO,GAAG,KAAK;CAC7B;CAEA,MAAM,OAAuB;EAC3B,OAAO,KAAK,OAAO,MAAM,KAAK;CAChC;CAEA,KAAK,OAAuB;EAC1B,OAAO,KAAK,OAAO,KAAK,KAAK;CAC/B;AACF;;AAGA,SAAS,WAAW,OAAmC;CACrD,OAAO,UAAU,KAAA,KAAa;EAAC;EAAO;EAAQ;EAAO;EAAQ;EAAO;CAAK,CAAC,CAAC,SAAS,MAAM,IAAI;AAChG;;AAGA,SAAS,iBAAiB,MAAsB,KAAgC;CAG9E,MAAM,QADQ,CADE,MAAM,GAAGe,uBAAAA,uBAAuBC,uBAAAA,YAAY,IAAI,CAAC,CAC9C,CAAC,CAAC,MAAM,UAAU,MAAM,cAAc,KAAK,aAAa,OAAO,OAAO,MAAM,QAAQ,GAAG,CACxF,CAAC,EAAE,OAAO;CAC5B,IAAI,CAAC,WAAW,KAAK,GAAG,OAAO,KAAA;CAE/B,IAAI,OAAO,SAAS,SAAS,OAAO,SAAS,QAAQ;EACnD,IAAI,CAAC,MAAM,MAAM,QAAQ,OAAO,YAAY,OAAO,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,QAAQ,MAAM,CAAC,GAAG,OAAO,KAAA;EAC1G,OAAO,MAAM,SAAS,SAClB;GACE,GAAG;GACH,YAAY,MAAM,WAAW,KAAK,eAAe;IAC/C,QAAQ,UAAU;IAClB,YAAY,UAAU;IACtB,gBAAgB,UAAU;IAC1B,eAAe,UAAU,OAAO;GAClC,EAAE;EACJ,IACA;CACN;CACA,OAAO;AACT;;;;;;AAOA,SAAS,WAAW,MAAiB,QAA8B;CACjE,MAAM,EAAE,SAAS;CACjB,MAAM,aAA6B,CAAC;CACpC,IAAI,CAAC,UAAU,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,GAC/D,MAAM,IAAI,MAAM,sCAAsC,KAAK,MAAM;CAEnE,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAAG;EAEjD,MAAM,QAAQ,QAAQ,OAAO,KAAK,OAAO,KAAK,OAAO,OAAO,KAAK,WAAW,GAAG,IAAI,KAAK,UAAU,OAAO,KAAA;EACzG,IACE,CAAC,SACD,CAAC;GAAC;GAAc;GAAa;GAAQ;EAAK,CAAC,CAAC,SAAS,MAAM,IAAI,KAC/D,CAAC,MAAM,SACP,MAAM,MAAM,QAAQ,WAAW,KAC/B,CAAC,MAAM,MAAM,QAAQ,OAAO,YAAY,OAAO,OAAO,KAAK,OAAO,CAAC,CAAC,SAAS,QAAQ,MAAM,CAAC,GAE5F,MAAM,IAAI,MAAM,kCAAkC,KAAK,KAAK,GAAG,IAAI,uBAAuB;EAE5F,MAAM,SAAS,IAAI,YAAY,MAAM,MAAM,MAAM,QAAQ,EAAE,CAAC,QAAQ,IAAI;EACxE,IAAI;EACJ,IAAI,MAAM,SAAS,OAAO;GACxB,IAAI,CAAC,uBAAuB,KAAK,GAC/B,MAAM,IAAI,MAAM,sCAAsC,KAAK,KAAK,GAAG,IAAI,sBAAsB;GAE/F,MAAM,SAASC,oBAAAA,kBAAkB,MAAM,cAAc,GAAG,KAAK;GAC7D,IAAI,QAAQ,SAAS,QACnB,MAAM,IAAI,MAAM,sCAAsC,KAAK,KAAK,GAAG,IAAI,sBAAsB;GAE/F,SAAS,SAAS,CAAC,MAAM,IAAI,CAAC;EAChC,OACE,SAASC,oBAAAA,iBAAiB,KAAK;EAEjC,KAAK,MAAM,QAAQ,QACjB,IAAI,KAAK,SAAS,aAAa,KAAK,MAAM,MAAM,MAAM,MAAM,KAAA,CAAS,GAAG;GACtE,IAAI,KAAK,MAAM,OAAO,KAAA,GAAW,WAAW,KAAK,OAAO,aAAa;IAAE,MAAM;IAAO,OAAO,KAAK,MAAM;GAAG,CAAC,CAAC;GAC3G,IAAI,KAAK,MAAM,OAAO,KAAA,GAAW,WAAW,KAAK,OAAO,aAAa;IAAE,MAAM;IAAO,OAAO,KAAK,MAAM;GAAG,CAAC,CAAC;EAC7G,OAAO,IAAI,KAAK,SAAS,QAAQ,CAAC,OAAO,OAAO,WAAW,KAAK,MAAM,SAAS,IAAI,GACjF,WAAW,KAAK,EACd,IAAI,CACF,OAAO,aAAa,EAAE,MAAM,UAAU,CAAC,GACvC,OAAO,aAAa;GAAE,MAAM;GAAM,OAAO,KAAK,MAAM,QAAQ,MAAM,MAAM,IAAI;EAAE,CAAC,CACjF,EACF,CAAC;OAED,WAAW,KAAK,OAAO,aAAa,IAAI,CAAC;CAG/C;CACA,OAAO,WAAW,WAAW,IAAIV,sBAAAA,gBAAgB,EAAE,KAAK,WAAW;AACrE;;AAGA,SAAS,uBAAuB,OAAyB;CACvD,IAAI,SAAS,QAAQ,OAAO,UAAU,aAAa,sBAAsB,KAAK,GAAG,OAAO;CACxF,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,MAAM,qBAAqB;CAClE,IAAI,OAAO,UAAU,YAAY,OAAO,KAAK,KAAK,CAAC,CAAC,WAAW,KAAK,OAAO,OAAO,OAAO,IAAI,GAAG;EAC9F,MAAM,WAAY,MAA0B;EAC5C,OAAO,YAAY,QAAQ,sBAAsB,QAAQ;CAC3D;CACA,OAAO;AACT;;AAGA,SAAS,sBAAsB,OAAyB;CACtD,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,YAAYW,eAAAA,SAAS,KAAK;AACjF"}
|
package/build/Tables.d.cts.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"Tables.d.cts","names":[],"sources":["../src/Tables.ts"],"mappings":";;;;;;;;;iBA8CgB,MAAM,UAAU,QAAQ,MAAM,+BAA+B,KAAK,MAAM;;;;;;;iBAOxE,MAAM,UAAU,QAAQ,qBACtC,MAAM,+BAA+B,IACrC,MAAM,OACL,MAAM,GAAG;;iBAOI,OAAO,mBAAmB,0CACrC,MAAM,OACL,WAAW,IAAI,EAAE,WAAW,qCAAqC,UAAU,UAAU,MAAM;;;;;;;UAUhF,WAAW,GAAG,6BAA6B;WACjD,UAAU;WACV,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;KA4BP,MAAM,UAAU,QAAQ,sBAAsB,YAAY,MAAM,WAAW,GAAG,+BACjE,WAAW,GAAG;;EAI/B,MAAM,QAAQ,YAAY,KAAK;;;KAI3B,YAAY,UAAU,aAC/B,KAAK,gBAAgB,WAAW,SAAS,MAAM,SAAS,GAAG;EAC1D;EACA,YAAY,UAAU;EACtB,gBAAgB;IAEd,qBAAqB,GAAG,sCACxB,SAAS,GAAG;;KAIb,gBAAgB,KAAK,UAAU,SAAS,UAAU;EAAc,iBAAiB;IAClF,QAAQ,SAAS,SAAS;;KAIzB,qBAAqB,UAAU,QAAQ,KACxC,IACA,KAAK,eACK,IAAI,KAAK,kBAEnB;EAEE,IAAI,IAAI,KAAK,KAAK;;KAEnB,WAAW,UAAU,QAAQ;YACtB,YAAY,WAAW,GAAG;OAEnC,WAAW,UAAU,KAAK,iBACvB,aAAa,UAAU,QACvB,UAAU,GAAG;EAAa,cAAc,UAAU;EAAQ,gBAAgB;IACxE,gBAAgB,GAAG,+BAA+B,QAClD,UAAU,GAAG;EAAa,YAAY;EAAG,gBAAgB;IACvD,gBAAgB,GAAG,+BAA+B,sBAIxD,WAAW,SAAS,MAAM,gBAAgB,UAAU,aAEhD,SAAS,GAAG;EAAa;IACvB,YAEL,SAAS,GAAG;EAAa;EAAa,YAAY,UAAU;EAAQ,gBAAgB;IACnF,cAAc,GAAG,oCAAoC,QACrD,SAAS,GAAG;EAAa;EAAc,YAAY,UAAU;EAAQ,gBAAgB;IACnF,cAAc,GAAG,oCAAoC,QACrD,SAAS,GAAG;EAAa;EAAsC,YAAY,UAAU;IACnF,eAAe,mBAIrB,WAAW,WAAW,QAAQ;EAC5B,kBAAkB,UAAU;IAAW;MAAU,GAAG,WAAW;MAAI;;;IAEjE,aAAa,WAAW,uBAE3B,QAAQ;EAAa,kBAAkB,UAAU;IAAW,YAAY;;KAIxE,YAAY,KAAK;EAAY;IAAU;;IAAgB,WAAW;;UAGtD,cAAc,UAAU,QAAQ,wBAAwB;;;;;EAKvE,GAAG,UAAU,SAAS,IAAI,OAAO,KAAK,qBAAqB,qBAAqB,GAAG,OAAO,SAAS;EACnG,MAAM,UAAU,SAAS,IAAI,OAAO,IAAI,UAAU;EAClD,KAAK,UAAU,SAAS,IAAI,OAAO,IAAI,SAAS;;;cAIrC;;KAGD,qBAAqB,GAAG,sBAAsB,UAAU;YACxD,sBAAsB;;;KAItB,SAAS;YAAiB,YAAY,WAAW;;;;;;;;;;;;UAY5C,eAAe,UAAU;EACxC,GAAG,UAAU,SAAS,IAAI,OAAO,IAAI,SAAS;EAC9C,MAAM,UAAU,SAAS,IAAI,OAAO,IAAI,UAAU;EAClD,KAAK,UAAU,SAAS,IAAI,OAAO,IAAI,SAAS;;;UAIxC,YAAY,UAAU,gBAAgB,eAAe;GAC5D,UAAU,SAAS,IAAI,OAAO,IAAI,SAAS;;;;;;;UAQ7B,gBAAgB,UAAU,QAAQ,wBAAwB,4BACjE,aAAa,GAAG,GAAG,MAAM,cAAc,GAAG,GAAG;;;;;;UAOtC,cACf,UAAU,QACV,wBACA,qCACQ,cAAc,GAAG,GAAG;EAC5B,GAAG,OAAO,IAAI,WAAW,SAAS,KAAK,gCAAgC;EACvE,GAAG,OAAO,IAAI,WAAW,SAAS,KAAK,gCAAgC;EACvE,GAAG,kBAAkB,IAAI,cAAc,SAAS,KAAK,yBAAyB;;EAE9E,WAAW,kBAAkB,IAAI,0BAA0B;;UAG5C,gBAAgB,GAAG,wBAAwB,qCAAqC,KAAK,IAAI,GAAG;EAC3G,GAAG,OAAO,IAAI,SAAS,IAAI,KAAK,gBAAgB;EAChD,GAAG,OAAO,IAAI,SAAS,IAAI,KAAK,gBAAgB;EAChD,GAAG,kBAAkB,cAAc,SAAS,wBAAwB;;EAEpE,WAAW,kBAAkB,0BAA0B;EACvD,IAAI,kBAAkB,cAAc,SAAS,wBAAwB;EACrE,GAAG,OAAO,IAAI,SAAS,IAAI,iBAAiB;EAC5C,IAAI,OAAO,IAAI,SAAS,IAAI,iBAAiB;EAC7C,GAAG,OAAO,IAAI,SAAS,IAAI,iBAAiB;EAC5C,IAAI,OAAO,IAAI,SAAS,IAAI,iBAAiB;EAC7C,KAAK,OAAO,gBAAgB;EAC5B,MAAM,OAAO,gBAAgB;EAC7B,OAAO,OAAO,gBAAgB;EAC9B,QAAQ,IAAI,eAAe,IAAI,gBAAgB;EAI/C,SAAS,gBAAgB,IAAI,gBAAgB,UAAU,gBAAgB;EACvE,UAAU,gBAAgB,IAAI,gBAAgB,UAAU,gBAAgB;EACxE,SAAS,OAAO,IAAI,gBAAgB,UAAU,gBAAgB;EAC9D,UAAU,OAAO,IAAI,gBAAgB,UAAU,gBAAgB;;;;;;;;EAS/D,WAAW,+BAA+B;;;;;;;;EAS1C,WAAW,+BAA+B;;;;;;;;;;;EAY1C,IAAI,aAAa,uCAAuC;;UAGzC,aAAa,GAAG,gCAAgC,qCAAqC,KACpG,KAAK,KAAK,GACV;EAEA,GAAG,OAAO,IAAI,KAAK,KAAK,SAAS,KAAK,gCAAgC;EACtE,GAAG,OAAO,IAAI,KAAK,KAAK,SAAS,KAAK,gCAAgC;EAEtE,GAAG,iBAAiB,IAAI,KAAK,eAAe,SAAS,KAAK,gCAAgC;;EAE1F,WAAW,iBAAiB,IAAI,KAAK,kCAAkC;EACvE,IAAI,iBAAiB,IAAI,KAAK,eAAe,SAAS,KAAK,gCAAgC;EAC3F,GAAG,OAAO,KAAK,KAAK,SAAS,KAAK,gCAAgC;EAClE,IAAI,OAAO,KAAK,KAAK,SAAS,KAAK,gCAAgC;EACnE,GAAG,OAAO,KAAK,KAAK,SAAS,KAAK,gCAAgC;EAClE,IAAI,OAAO,KAAK,KAAK,SAAS,KAAK,gCAAgC;EACnE,IAAI,aAAa,uCAAuC;;cAG7C;iBAEG,aAAa,OAAO,oBAAoB;;UAKvC;EACf;;;;;;;;EAQA,MAAM;;;iBAIQ,iBAAiB,UAAU,QAAQ,OAAO,SAAS,KAAK,eAAe;iBAKvE,cAAc,UAAU,QAAQ,MAAM,+BAA+B,KAAK,MAAM;iBA2DhF,QAAQ,eAAe,OAAO;;;;;;cAgZjC;;cAGA;UAEI;EACf,QAAQ;EACR,IAAI;;;cAIO;WACU;EAArB,YAAqB"}
|