@nshiab/simple-data-analysis-core 2.0.9 → 2.1.1
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/esm/class/SDAError.d.ts +6 -6
- package/esm/class/SDAError.js +6 -6
- package/esm/class/Simple.d.ts +9 -9
- package/esm/class/Simple.js +9 -9
- package/esm/class/SimpleDB.d.ts +80 -76
- package/esm/class/SimpleDB.d.ts.map +1 -1
- package/esm/class/SimpleDB.js +80 -76
- package/esm/class/SimpleTable.d.ts +2806 -1139
- package/esm/class/SimpleTable.d.ts.map +1 -1
- package/esm/class/SimpleTable.js +2792 -1149
- package/esm/helpers/buildApproximateMutualReachabilityMst.d.ts +45 -0
- package/esm/helpers/buildApproximateMutualReachabilityMst.d.ts.map +1 -0
- package/esm/helpers/buildApproximateMutualReachabilityMst.js +212 -0
- package/esm/helpers/buildChronologicalGraphComponentsSql.d.ts +14 -0
- package/esm/helpers/buildChronologicalGraphComponentsSql.d.ts.map +1 -0
- package/esm/helpers/buildChronologicalGraphComponentsSql.js +167 -0
- package/esm/helpers/buildExactMutualReachabilityMst.d.ts +28 -0
- package/esm/helpers/buildExactMutualReachabilityMst.d.ts.map +1 -0
- package/esm/helpers/buildExactMutualReachabilityMst.js +97 -0
- package/esm/helpers/buildGraphTemporalCostStateSql.d.ts +12 -0
- package/esm/helpers/buildGraphTemporalCostStateSql.d.ts.map +1 -0
- package/esm/helpers/buildGraphTemporalCostStateSql.js +86 -0
- package/esm/helpers/buildGraphTemporalReachabilitySql.d.ts +13 -0
- package/esm/helpers/buildGraphTemporalReachabilitySql.d.ts.map +1 -0
- package/esm/helpers/buildGraphTemporalReachabilitySql.js +70 -0
- package/esm/helpers/buildSparseMutualReachabilityMst.d.ts +10 -0
- package/esm/helpers/buildSparseMutualReachabilityMst.d.ts.map +1 -0
- package/esm/helpers/buildSparseMutualReachabilityMst.js +47 -0
- package/esm/helpers/buildUmapGraph.d.ts +2 -5
- package/esm/helpers/buildUmapGraph.d.ts.map +1 -1
- package/esm/helpers/buildUmapGraph.js +6 -100
- package/esm/helpers/buildVectorNeighbors.d.ts +45 -0
- package/esm/helpers/buildVectorNeighbors.d.ts.map +1 -0
- package/esm/helpers/buildVectorNeighbors.js +170 -0
- package/esm/helpers/buildWeakGraphComponentsSql.d.ts +3 -0
- package/esm/helpers/buildWeakGraphComponentsSql.d.ts.map +1 -0
- package/esm/helpers/buildWeakGraphComponentsSql.js +32 -0
- package/esm/helpers/camelCase.d.ts +7 -5
- package/esm/helpers/camelCase.d.ts.map +1 -1
- package/esm/helpers/camelCase.js +7 -5
- package/esm/helpers/capitalize.d.ts +6 -4
- package/esm/helpers/capitalize.d.ts.map +1 -1
- package/esm/helpers/capitalize.js +6 -4
- package/esm/helpers/clusterHdbscan.d.ts +18 -0
- package/esm/helpers/clusterHdbscan.d.ts.map +1 -0
- package/esm/helpers/clusterHdbscan.js +342 -0
- package/esm/helpers/computeCovariance.d.ts +16 -0
- package/esm/helpers/computeCovariance.d.ts.map +1 -0
- package/esm/helpers/computeCovariance.js +99 -0
- package/esm/helpers/computeMahalanobisDistances.d.ts +14 -0
- package/esm/helpers/computeMahalanobisDistances.d.ts.map +1 -0
- package/esm/helpers/computeMahalanobisDistances.js +87 -0
- package/esm/helpers/createDirectory.d.ts +4 -3
- package/esm/helpers/createDirectory.d.ts.map +1 -1
- package/esm/helpers/createDirectory.js +4 -3
- package/esm/helpers/dataToArrays.d.ts +6 -4
- package/esm/helpers/dataToArrays.d.ts.map +1 -1
- package/esm/helpers/dataToArrays.js +6 -4
- package/esm/helpers/extractTypes.d.ts +1 -1
- package/esm/helpers/extractTypes.js +4 -9
- package/esm/helpers/factorCovariance.d.ts +17 -0
- package/esm/helpers/factorCovariance.d.ts.map +1 -0
- package/esm/helpers/factorCovariance.js +189 -0
- package/esm/helpers/findGeoColumn.d.ts +6 -4
- package/esm/helpers/findGeoColumn.d.ts.map +1 -1
- package/esm/helpers/findGeoColumn.js +6 -4
- package/esm/helpers/findGeoColumnFromSchema.d.ts +8 -5
- package/esm/helpers/findGeoColumnFromSchema.d.ts.map +1 -1
- package/esm/helpers/findGeoColumnFromSchema.js +8 -5
- package/esm/helpers/formatDate.d.ts +12 -6
- package/esm/helpers/formatDate.d.ts.map +1 -1
- package/esm/helpers/formatDate.js +12 -6
- package/esm/helpers/formatMissingTables.d.ts +8 -5
- package/esm/helpers/formatMissingTables.d.ts.map +1 -1
- package/esm/helpers/formatMissingTables.js +8 -5
- package/esm/helpers/formatNumber.d.ts +19 -10
- package/esm/helpers/formatNumber.d.ts.map +1 -1
- package/esm/helpers/formatNumber.js +32 -17
- package/esm/helpers/getGraphEdgeIdColumn.d.ts +9 -0
- package/esm/helpers/getGraphEdgeIdColumn.d.ts.map +1 -0
- package/esm/helpers/getGraphEdgeIdColumn.js +25 -0
- package/esm/helpers/getGraphEndpointColumns.d.ts +11 -0
- package/esm/helpers/getGraphEndpointColumns.d.ts.map +1 -0
- package/esm/helpers/getGraphEndpointColumns.js +160 -0
- package/esm/helpers/getGraphWeightColumn.d.ts +10 -0
- package/esm/helpers/getGraphWeightColumn.d.ts.map +1 -0
- package/esm/helpers/getGraphWeightColumn.js +40 -0
- package/esm/helpers/graphRouteResultSchema.d.ts +4 -0
- package/esm/helpers/graphRouteResultSchema.d.ts.map +1 -0
- package/esm/helpers/graphRouteResultSchema.js +12 -0
- package/esm/helpers/graphRouteResultSelect.d.ts +4 -0
- package/esm/helpers/graphRouteResultSelect.d.ts.map +1 -0
- package/esm/helpers/graphRouteResultSelect.js +22 -0
- package/esm/helpers/hasGeometryColumn.d.ts +4 -3
- package/esm/helpers/hasGeometryColumn.d.ts.map +1 -1
- package/esm/helpers/hasGeometryColumn.js +4 -3
- package/esm/helpers/inspectGraphConnectivity.d.ts +10 -0
- package/esm/helpers/inspectGraphConnectivity.d.ts.map +1 -0
- package/esm/helpers/inspectGraphConnectivity.js +55 -0
- package/esm/helpers/mergeOptions.d.ts +24 -13
- package/esm/helpers/mergeOptions.d.ts.map +1 -1
- package/esm/helpers/mergeOptions.js +24 -13
- package/esm/helpers/parseValue.d.ts +6 -4
- package/esm/helpers/parseValue.d.ts.map +1 -1
- package/esm/helpers/parseValue.js +6 -4
- package/esm/helpers/prepareGraphRouteSql.d.ts +31 -0
- package/esm/helpers/prepareGraphRouteSql.d.ts.map +1 -0
- package/esm/helpers/prepareGraphRouteSql.js +86 -0
- package/esm/helpers/prepareGraphStarts.d.ts +9 -0
- package/esm/helpers/prepareGraphStarts.d.ts.map +1 -0
- package/esm/helpers/prepareGraphStarts.js +68 -0
- package/esm/helpers/prepareGraphTemporalSql.d.ts +28 -0
- package/esm/helpers/prepareGraphTemporalSql.d.ts.map +1 -0
- package/esm/helpers/prepareGraphTemporalSql.js +154 -0
- package/esm/helpers/prepareGraphTraversal.d.ts +19 -0
- package/esm/helpers/prepareGraphTraversal.d.ts.map +1 -0
- package/esm/helpers/prepareGraphTraversal.js +79 -0
- package/esm/helpers/prepareNumericFeatures.d.ts +41 -0
- package/esm/helpers/prepareNumericFeatures.d.ts.map +1 -0
- package/esm/helpers/prepareNumericFeatures.js +210 -0
- package/esm/helpers/prettyDuration.d.ts +14 -8
- package/esm/helpers/prettyDuration.d.ts.map +1 -1
- package/esm/helpers/prettyDuration.js +14 -8
- package/esm/helpers/printTable.d.ts +18 -13
- package/esm/helpers/printTable.d.ts.map +1 -1
- package/esm/helpers/printTable.js +18 -13
- package/esm/helpers/publishPreparedColumns.d.ts +37 -0
- package/esm/helpers/publishPreparedColumns.d.ts.map +1 -0
- package/esm/helpers/publishPreparedColumns.js +113 -0
- package/esm/helpers/queryDB.d.ts +24 -13
- package/esm/helpers/queryDB.d.ts.map +1 -1
- package/esm/helpers/queryDB.js +24 -13
- package/esm/helpers/queueAsyncBarrier.d.ts +12 -7
- package/esm/helpers/queueAsyncBarrier.d.ts.map +1 -1
- package/esm/helpers/queueAsyncBarrier.js +12 -7
- package/esm/helpers/queueGraphResult.d.ts +18 -0
- package/esm/helpers/queueGraphResult.d.ts.map +1 -0
- package/esm/helpers/queueGraphResult.js +39 -0
- package/esm/helpers/quoteIdentifier.d.ts +4 -3
- package/esm/helpers/quoteIdentifier.d.ts.map +1 -1
- package/esm/helpers/quoteIdentifier.js +4 -3
- package/esm/helpers/quoteQualifiedIdentifier.d.ts +6 -4
- package/esm/helpers/quoteQualifiedIdentifier.d.ts.map +1 -1
- package/esm/helpers/quoteQualifiedIdentifier.js +6 -4
- package/esm/helpers/runQuery.d.ts.map +1 -1
- package/esm/helpers/runQuery.js +17 -3
- package/esm/helpers/selectFuzzyReplacements.d.ts +11 -0
- package/esm/helpers/selectFuzzyReplacements.d.ts.map +1 -0
- package/esm/helpers/selectFuzzyReplacements.js +124 -0
- package/esm/helpers/stabilizeCosineVectors.d.ts +14 -0
- package/esm/helpers/stabilizeCosineVectors.d.ts.map +1 -0
- package/esm/helpers/stabilizeCosineVectors.js +34 -0
- package/esm/helpers/stringToArray.d.ts +4 -3
- package/esm/helpers/stringToArray.d.ts.map +1 -1
- package/esm/helpers/stringToArray.js +4 -3
- package/esm/helpers/updateColumnsWithJS.d.ts +12 -6
- package/esm/helpers/updateColumnsWithJS.d.ts.map +1 -1
- package/esm/helpers/updateColumnsWithJS.js +12 -6
- package/esm/helpers/validateGraphRouteResultSchema.d.ts +4 -0
- package/esm/helpers/validateGraphRouteResultSchema.d.ts.map +1 -0
- package/esm/helpers/validateGraphRouteResultSchema.js +13 -0
- package/esm/helpers/validateGraphTemporalEvents.d.ts +7 -0
- package/esm/helpers/validateGraphTemporalEvents.d.ts.map +1 -0
- package/esm/helpers/validateGraphTemporalEvents.js +47 -0
- package/esm/helpers/validateNumericalAnalysis.d.ts +10 -6
- package/esm/helpers/validateNumericalAnalysis.d.ts.map +1 -1
- package/esm/helpers/validateNumericalAnalysis.js +10 -6
- package/esm/helpers/validateVectorRowIds.d.ts +4 -0
- package/esm/helpers/validateVectorRowIds.d.ts.map +1 -0
- package/esm/helpers/validateVectorRowIds.js +16 -0
- package/esm/helpers/vectorDistanceExpression.d.ts +6 -0
- package/esm/helpers/vectorDistanceExpression.d.ts.map +1 -0
- package/esm/helpers/vectorDistanceExpression.js +11 -0
- package/esm/helpers/wrapString.d.ts +10 -7
- package/esm/helpers/wrapString.d.ts.map +1 -1
- package/esm/helpers/wrapString.js +10 -7
- package/esm/methods/addId.d.ts +5 -0
- package/esm/methods/addId.d.ts.map +1 -0
- package/esm/methods/addId.js +38 -0
- package/esm/methods/commonNeighbors.d.ts +10 -0
- package/esm/methods/commonNeighbors.d.ts.map +1 -0
- package/esm/methods/commonNeighbors.js +101 -0
- package/esm/methods/connectedComponents.d.ts +9 -0
- package/esm/methods/connectedComponents.d.ts.map +1 -0
- package/esm/methods/connectedComponents.js +147 -0
- package/esm/methods/degree.d.ts +9 -0
- package/esm/methods/degree.d.ts.map +1 -0
- package/esm/methods/degree.js +135 -0
- package/esm/methods/distances.d.ts +12 -0
- package/esm/methods/distances.d.ts.map +1 -0
- package/esm/methods/distances.js +164 -0
- package/esm/methods/findCycles.d.ts +12 -0
- package/esm/methods/findCycles.d.ts.map +1 -0
- package/esm/methods/findCycles.js +330 -0
- package/esm/methods/fuzzyClean.d.ts.map +1 -1
- package/esm/methods/fuzzyClean.js +17 -136
- package/esm/methods/fuzzyJoin.js +70 -16
- package/esm/methods/getTypes.d.ts +1 -1
- package/esm/methods/hdbscan.d.ts +5 -0
- package/esm/methods/hdbscan.d.ts.map +1 -0
- package/esm/methods/hdbscan.js +208 -0
- package/esm/methods/mahalanobis.d.ts +5 -0
- package/esm/methods/mahalanobis.d.ts.map +1 -0
- package/esm/methods/mahalanobis.js +92 -0
- package/esm/methods/neighbors.d.ts +9 -0
- package/esm/methods/neighbors.d.ts.map +1 -0
- package/esm/methods/neighbors.js +81 -0
- package/esm/methods/normalizeVector.d.ts +5 -0
- package/esm/methods/normalizeVector.d.ts.map +1 -0
- package/esm/methods/normalizeVector.js +132 -0
- package/esm/methods/paths.d.ts +12 -0
- package/esm/methods/paths.d.ts.map +1 -0
- package/esm/methods/paths.js +287 -0
- package/esm/methods/reachable.d.ts +11 -0
- package/esm/methods/reachable.d.ts.map +1 -0
- package/esm/methods/reachable.js +131 -0
- package/esm/methods/rowToVector.d.ts +5 -0
- package/esm/methods/rowToVector.d.ts.map +1 -0
- package/esm/methods/rowToVector.js +77 -0
- package/esm/methods/shortestPath.d.ts +12 -0
- package/esm/methods/shortestPath.d.ts.map +1 -0
- package/esm/methods/shortestPath.js +337 -0
- package/esm/methods/topologicalSort.d.ts +7 -0
- package/esm/methods/topologicalSort.d.ts.map +1 -0
- package/esm/methods/topologicalSort.js +164 -0
- package/esm/methods/trim.d.ts +1 -1
- package/esm/methods/trim.d.ts.map +1 -1
- package/esm/methods/trim.js +17 -8
- package/llm.md +2146 -173
- package/llms.txt +1 -1
- package/package.json +1 -1
- package/script/class/SDAError.d.ts +6 -6
- package/script/class/SDAError.js +6 -6
- package/script/class/Simple.d.ts +9 -9
- package/script/class/Simple.js +9 -9
- package/script/class/SimpleDB.d.ts +80 -76
- package/script/class/SimpleDB.d.ts.map +1 -1
- package/script/class/SimpleDB.js +80 -76
- package/script/class/SimpleTable.d.ts +2806 -1139
- package/script/class/SimpleTable.d.ts.map +1 -1
- package/script/class/SimpleTable.js +2792 -1149
- package/script/helpers/buildApproximateMutualReachabilityMst.d.ts +45 -0
- package/script/helpers/buildApproximateMutualReachabilityMst.d.ts.map +1 -0
- package/script/helpers/buildApproximateMutualReachabilityMst.js +219 -0
- package/script/helpers/buildChronologicalGraphComponentsSql.d.ts +14 -0
- package/script/helpers/buildChronologicalGraphComponentsSql.d.ts.map +1 -0
- package/script/helpers/buildChronologicalGraphComponentsSql.js +174 -0
- package/script/helpers/buildExactMutualReachabilityMst.d.ts +28 -0
- package/script/helpers/buildExactMutualReachabilityMst.d.ts.map +1 -0
- package/script/helpers/buildExactMutualReachabilityMst.js +103 -0
- package/script/helpers/buildGraphTemporalCostStateSql.d.ts +12 -0
- package/script/helpers/buildGraphTemporalCostStateSql.d.ts.map +1 -0
- package/script/helpers/buildGraphTemporalCostStateSql.js +92 -0
- package/script/helpers/buildGraphTemporalReachabilitySql.d.ts +13 -0
- package/script/helpers/buildGraphTemporalReachabilitySql.d.ts.map +1 -0
- package/script/helpers/buildGraphTemporalReachabilitySql.js +76 -0
- package/script/helpers/buildSparseMutualReachabilityMst.d.ts +10 -0
- package/script/helpers/buildSparseMutualReachabilityMst.d.ts.map +1 -0
- package/script/helpers/buildSparseMutualReachabilityMst.js +50 -0
- package/script/helpers/buildUmapGraph.d.ts +2 -5
- package/script/helpers/buildUmapGraph.d.ts.map +1 -1
- package/script/helpers/buildUmapGraph.js +6 -100
- package/script/helpers/buildVectorNeighbors.d.ts +45 -0
- package/script/helpers/buildVectorNeighbors.d.ts.map +1 -0
- package/script/helpers/buildVectorNeighbors.js +176 -0
- package/script/helpers/buildWeakGraphComponentsSql.d.ts +3 -0
- package/script/helpers/buildWeakGraphComponentsSql.d.ts.map +1 -0
- package/script/helpers/buildWeakGraphComponentsSql.js +38 -0
- package/script/helpers/camelCase.d.ts +7 -5
- package/script/helpers/camelCase.d.ts.map +1 -1
- package/script/helpers/camelCase.js +7 -5
- package/script/helpers/capitalize.d.ts +6 -4
- package/script/helpers/capitalize.d.ts.map +1 -1
- package/script/helpers/capitalize.js +6 -4
- package/script/helpers/clusterHdbscan.d.ts +18 -0
- package/script/helpers/clusterHdbscan.d.ts.map +1 -0
- package/script/helpers/clusterHdbscan.js +346 -0
- package/script/helpers/computeCovariance.d.ts +16 -0
- package/script/helpers/computeCovariance.d.ts.map +1 -0
- package/script/helpers/computeCovariance.js +105 -0
- package/script/helpers/computeMahalanobisDistances.d.ts +14 -0
- package/script/helpers/computeMahalanobisDistances.d.ts.map +1 -0
- package/script/helpers/computeMahalanobisDistances.js +93 -0
- package/script/helpers/createDirectory.d.ts +4 -3
- package/script/helpers/createDirectory.d.ts.map +1 -1
- package/script/helpers/createDirectory.js +4 -3
- package/script/helpers/dataToArrays.d.ts +6 -4
- package/script/helpers/dataToArrays.d.ts.map +1 -1
- package/script/helpers/dataToArrays.js +6 -4
- package/script/helpers/extractTypes.d.ts +1 -1
- package/script/helpers/extractTypes.js +4 -9
- package/script/helpers/factorCovariance.d.ts +17 -0
- package/script/helpers/factorCovariance.d.ts.map +1 -0
- package/script/helpers/factorCovariance.js +194 -0
- package/script/helpers/findGeoColumn.d.ts +6 -4
- package/script/helpers/findGeoColumn.d.ts.map +1 -1
- package/script/helpers/findGeoColumn.js +6 -4
- package/script/helpers/findGeoColumnFromSchema.d.ts +8 -5
- package/script/helpers/findGeoColumnFromSchema.d.ts.map +1 -1
- package/script/helpers/findGeoColumnFromSchema.js +8 -5
- package/script/helpers/formatDate.d.ts +12 -6
- package/script/helpers/formatDate.d.ts.map +1 -1
- package/script/helpers/formatDate.js +12 -6
- package/script/helpers/formatMissingTables.d.ts +8 -5
- package/script/helpers/formatMissingTables.d.ts.map +1 -1
- package/script/helpers/formatMissingTables.js +8 -5
- package/script/helpers/formatNumber.d.ts +19 -10
- package/script/helpers/formatNumber.d.ts.map +1 -1
- package/script/helpers/formatNumber.js +32 -17
- package/script/helpers/getGraphEdgeIdColumn.d.ts +9 -0
- package/script/helpers/getGraphEdgeIdColumn.d.ts.map +1 -0
- package/script/helpers/getGraphEdgeIdColumn.js +31 -0
- package/script/helpers/getGraphEndpointColumns.d.ts +11 -0
- package/script/helpers/getGraphEndpointColumns.d.ts.map +1 -0
- package/script/helpers/getGraphEndpointColumns.js +166 -0
- package/script/helpers/getGraphWeightColumn.d.ts +10 -0
- package/script/helpers/getGraphWeightColumn.d.ts.map +1 -0
- package/script/helpers/getGraphWeightColumn.js +46 -0
- package/script/helpers/graphRouteResultSchema.d.ts +4 -0
- package/script/helpers/graphRouteResultSchema.d.ts.map +1 -0
- package/script/helpers/graphRouteResultSchema.js +18 -0
- package/script/helpers/graphRouteResultSelect.d.ts +4 -0
- package/script/helpers/graphRouteResultSelect.d.ts.map +1 -0
- package/script/helpers/graphRouteResultSelect.js +28 -0
- package/script/helpers/hasGeometryColumn.d.ts +4 -3
- package/script/helpers/hasGeometryColumn.d.ts.map +1 -1
- package/script/helpers/hasGeometryColumn.js +4 -3
- package/script/helpers/inspectGraphConnectivity.d.ts +10 -0
- package/script/helpers/inspectGraphConnectivity.d.ts.map +1 -0
- package/script/helpers/inspectGraphConnectivity.js +58 -0
- package/script/helpers/mergeOptions.d.ts +24 -13
- package/script/helpers/mergeOptions.d.ts.map +1 -1
- package/script/helpers/mergeOptions.js +24 -13
- package/script/helpers/parseValue.d.ts +6 -4
- package/script/helpers/parseValue.d.ts.map +1 -1
- package/script/helpers/parseValue.js +6 -4
- package/script/helpers/prepareGraphRouteSql.d.ts +31 -0
- package/script/helpers/prepareGraphRouteSql.d.ts.map +1 -0
- package/script/helpers/prepareGraphRouteSql.js +127 -0
- package/script/helpers/prepareGraphStarts.d.ts +9 -0
- package/script/helpers/prepareGraphStarts.d.ts.map +1 -0
- package/script/helpers/prepareGraphStarts.js +71 -0
- package/script/helpers/prepareGraphTemporalSql.d.ts +28 -0
- package/script/helpers/prepareGraphTemporalSql.d.ts.map +1 -0
- package/script/helpers/prepareGraphTemporalSql.js +161 -0
- package/script/helpers/prepareGraphTraversal.d.ts +19 -0
- package/script/helpers/prepareGraphTraversal.d.ts.map +1 -0
- package/script/helpers/prepareGraphTraversal.js +87 -0
- package/script/helpers/prepareNumericFeatures.d.ts +41 -0
- package/script/helpers/prepareNumericFeatures.d.ts.map +1 -0
- package/script/helpers/prepareNumericFeatures.js +217 -0
- package/script/helpers/prettyDuration.d.ts +14 -8
- package/script/helpers/prettyDuration.d.ts.map +1 -1
- package/script/helpers/prettyDuration.js +14 -8
- package/script/helpers/printTable.d.ts +18 -13
- package/script/helpers/printTable.d.ts.map +1 -1
- package/script/helpers/printTable.js +18 -13
- package/script/helpers/publishPreparedColumns.d.ts +37 -0
- package/script/helpers/publishPreparedColumns.d.ts.map +1 -0
- package/script/helpers/publishPreparedColumns.js +119 -0
- package/script/helpers/queryDB.d.ts +24 -13
- package/script/helpers/queryDB.d.ts.map +1 -1
- package/script/helpers/queryDB.js +24 -13
- package/script/helpers/queueAsyncBarrier.d.ts +12 -7
- package/script/helpers/queueAsyncBarrier.d.ts.map +1 -1
- package/script/helpers/queueAsyncBarrier.js +12 -7
- package/script/helpers/queueGraphResult.d.ts +18 -0
- package/script/helpers/queueGraphResult.d.ts.map +1 -0
- package/script/helpers/queueGraphResult.js +45 -0
- package/script/helpers/quoteIdentifier.d.ts +4 -3
- package/script/helpers/quoteIdentifier.d.ts.map +1 -1
- package/script/helpers/quoteIdentifier.js +4 -3
- package/script/helpers/quoteQualifiedIdentifier.d.ts +6 -4
- package/script/helpers/quoteQualifiedIdentifier.d.ts.map +1 -1
- package/script/helpers/quoteQualifiedIdentifier.js +6 -4
- package/script/helpers/runQuery.d.ts.map +1 -1
- package/script/helpers/runQuery.js +17 -3
- package/script/helpers/selectFuzzyReplacements.d.ts +11 -0
- package/script/helpers/selectFuzzyReplacements.d.ts.map +1 -0
- package/script/helpers/selectFuzzyReplacements.js +127 -0
- package/script/helpers/stabilizeCosineVectors.d.ts +14 -0
- package/script/helpers/stabilizeCosineVectors.d.ts.map +1 -0
- package/script/helpers/stabilizeCosineVectors.js +40 -0
- package/script/helpers/stringToArray.d.ts +4 -3
- package/script/helpers/stringToArray.d.ts.map +1 -1
- package/script/helpers/stringToArray.js +4 -3
- package/script/helpers/updateColumnsWithJS.d.ts +12 -6
- package/script/helpers/updateColumnsWithJS.d.ts.map +1 -1
- package/script/helpers/updateColumnsWithJS.js +12 -6
- package/script/helpers/validateGraphRouteResultSchema.d.ts +4 -0
- package/script/helpers/validateGraphRouteResultSchema.d.ts.map +1 -0
- package/script/helpers/validateGraphRouteResultSchema.js +19 -0
- package/script/helpers/validateGraphTemporalEvents.d.ts +7 -0
- package/script/helpers/validateGraphTemporalEvents.d.ts.map +1 -0
- package/script/helpers/validateGraphTemporalEvents.js +53 -0
- package/script/helpers/validateNumericalAnalysis.d.ts +10 -6
- package/script/helpers/validateNumericalAnalysis.d.ts.map +1 -1
- package/script/helpers/validateNumericalAnalysis.js +10 -6
- package/script/helpers/validateVectorRowIds.d.ts +4 -0
- package/script/helpers/validateVectorRowIds.d.ts.map +1 -0
- package/script/helpers/validateVectorRowIds.js +19 -0
- package/script/helpers/vectorDistanceExpression.d.ts +6 -0
- package/script/helpers/vectorDistanceExpression.d.ts.map +1 -0
- package/script/helpers/vectorDistanceExpression.js +14 -0
- package/script/helpers/wrapString.d.ts +10 -7
- package/script/helpers/wrapString.d.ts.map +1 -1
- package/script/helpers/wrapString.js +10 -7
- package/script/methods/addId.d.ts +5 -0
- package/script/methods/addId.d.ts.map +1 -0
- package/script/methods/addId.js +44 -0
- package/script/methods/commonNeighbors.d.ts +10 -0
- package/script/methods/commonNeighbors.d.ts.map +1 -0
- package/script/methods/commonNeighbors.js +140 -0
- package/script/methods/connectedComponents.d.ts +9 -0
- package/script/methods/connectedComponents.d.ts.map +1 -0
- package/script/methods/connectedComponents.js +186 -0
- package/script/methods/degree.d.ts +9 -0
- package/script/methods/degree.d.ts.map +1 -0
- package/script/methods/degree.js +141 -0
- package/script/methods/distances.d.ts +12 -0
- package/script/methods/distances.d.ts.map +1 -0
- package/script/methods/distances.js +203 -0
- package/script/methods/findCycles.d.ts +12 -0
- package/script/methods/findCycles.d.ts.map +1 -0
- package/script/methods/findCycles.js +369 -0
- package/script/methods/fuzzyClean.d.ts.map +1 -1
- package/script/methods/fuzzyClean.js +17 -136
- package/script/methods/fuzzyJoin.js +70 -16
- package/script/methods/getTypes.d.ts +1 -1
- package/script/methods/hdbscan.d.ts +5 -0
- package/script/methods/hdbscan.d.ts.map +1 -0
- package/script/methods/hdbscan.js +214 -0
- package/script/methods/mahalanobis.d.ts +5 -0
- package/script/methods/mahalanobis.d.ts.map +1 -0
- package/script/methods/mahalanobis.js +98 -0
- package/script/methods/neighbors.d.ts +9 -0
- package/script/methods/neighbors.d.ts.map +1 -0
- package/script/methods/neighbors.js +120 -0
- package/script/methods/normalizeVector.d.ts +5 -0
- package/script/methods/normalizeVector.d.ts.map +1 -0
- package/script/methods/normalizeVector.js +138 -0
- package/script/methods/paths.d.ts +12 -0
- package/script/methods/paths.d.ts.map +1 -0
- package/script/methods/paths.js +326 -0
- package/script/methods/reachable.d.ts +11 -0
- package/script/methods/reachable.d.ts.map +1 -0
- package/script/methods/reachable.js +170 -0
- package/script/methods/rowToVector.d.ts +5 -0
- package/script/methods/rowToVector.d.ts.map +1 -0
- package/script/methods/rowToVector.js +83 -0
- package/script/methods/shortestPath.d.ts +12 -0
- package/script/methods/shortestPath.d.ts.map +1 -0
- package/script/methods/shortestPath.js +376 -0
- package/script/methods/topologicalSort.d.ts +7 -0
- package/script/methods/topologicalSort.d.ts.map +1 -0
- package/script/methods/topologicalSort.js +170 -0
- package/script/methods/trim.d.ts +1 -1
- package/script/methods/trim.d.ts.map +1 -1
- package/script/methods/trim.js +17 -8
|
@@ -0,0 +1,203 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
|
|
3
|
+
if (k2 === undefined) k2 = k;
|
|
4
|
+
var desc = Object.getOwnPropertyDescriptor(m, k);
|
|
5
|
+
if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
|
|
6
|
+
desc = { enumerable: true, get: function() { return m[k]; } };
|
|
7
|
+
}
|
|
8
|
+
Object.defineProperty(o, k2, desc);
|
|
9
|
+
}) : (function(o, m, k, k2) {
|
|
10
|
+
if (k2 === undefined) k2 = k;
|
|
11
|
+
o[k2] = m[k];
|
|
12
|
+
}));
|
|
13
|
+
var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
|
|
14
|
+
Object.defineProperty(o, "default", { enumerable: true, value: v });
|
|
15
|
+
}) : function(o, v) {
|
|
16
|
+
o["default"] = v;
|
|
17
|
+
});
|
|
18
|
+
var __importStar = (this && this.__importStar) || (function () {
|
|
19
|
+
var ownKeys = function(o) {
|
|
20
|
+
ownKeys = Object.getOwnPropertyNames || function (o) {
|
|
21
|
+
var ar = [];
|
|
22
|
+
for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
|
|
23
|
+
return ar;
|
|
24
|
+
};
|
|
25
|
+
return ownKeys(o);
|
|
26
|
+
};
|
|
27
|
+
return function (mod) {
|
|
28
|
+
if (mod && mod.__esModule) return mod;
|
|
29
|
+
var result = {};
|
|
30
|
+
if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
|
|
31
|
+
__setModuleDefault(result, mod);
|
|
32
|
+
return result;
|
|
33
|
+
};
|
|
34
|
+
})();
|
|
35
|
+
var __importDefault = (this && this.__importDefault) || function (mod) {
|
|
36
|
+
return (mod && mod.__esModule) ? mod : { "default": mod };
|
|
37
|
+
};
|
|
38
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
39
|
+
exports.default = distances;
|
|
40
|
+
const buildGraphTemporalCostStateSql_js_1 = __importDefault(require("../helpers/buildGraphTemporalCostStateSql.js"));
|
|
41
|
+
const getGraphWeightColumn_js_1 = __importDefault(require("../helpers/getGraphWeightColumn.js"));
|
|
42
|
+
const prepareGraphTemporalSql_js_1 = __importStar(require("../helpers/prepareGraphTemporalSql.js"));
|
|
43
|
+
const prepareGraphStarts_js_1 = __importDefault(require("../helpers/prepareGraphStarts.js"));
|
|
44
|
+
const prepareGraphTraversal_js_1 = __importStar(require("../helpers/prepareGraphTraversal.js"));
|
|
45
|
+
const queueGraphResult_js_1 = __importDefault(require("../helpers/queueGraphResult.js"));
|
|
46
|
+
const quoteIdentifier_js_1 = __importDefault(require("../helpers/quoteIdentifier.js"));
|
|
47
|
+
const validateGraphTemporalEvents_js_1 = __importDefault(require("../helpers/validateGraphTemporalEvents.js"));
|
|
48
|
+
function distances(simpleTable, sourceColumn, targetColumn, startNodes, options = {}) {
|
|
49
|
+
if (typeof sourceColumn !== "string") {
|
|
50
|
+
throw new TypeError("distances() sourceColumn must be a string.");
|
|
51
|
+
}
|
|
52
|
+
if (typeof targetColumn !== "string") {
|
|
53
|
+
throw new TypeError("distances() targetColumn must be a string.");
|
|
54
|
+
}
|
|
55
|
+
if (options === null || typeof options !== "object" || Array.isArray(options)) {
|
|
56
|
+
throw new TypeError("distances() options must be an object.");
|
|
57
|
+
}
|
|
58
|
+
if (options.direction !== undefined &&
|
|
59
|
+
!["outgoing", "incoming", "both"].includes(options.direction)) {
|
|
60
|
+
throw new TypeError('distances() options.direction must be "outgoing", "incoming", or "both".');
|
|
61
|
+
}
|
|
62
|
+
if (options.weight !== undefined && typeof options.weight !== "string") {
|
|
63
|
+
throw new TypeError("distances() options.weight must be a string.");
|
|
64
|
+
}
|
|
65
|
+
if (options.outputTable !== undefined &&
|
|
66
|
+
typeof options.outputTable !== "string" &&
|
|
67
|
+
typeof options.outputTable !== "boolean") {
|
|
68
|
+
throw new TypeError("distances() options.outputTable must be a string or boolean.");
|
|
69
|
+
}
|
|
70
|
+
const preparedStarts = (0, prepareGraphStarts_js_1.default)(startNodes, "distances()", "startNodes");
|
|
71
|
+
const direction = options.direction ?? "outgoing";
|
|
72
|
+
const temporalOptions = (0, prepareGraphTemporalSql_js_1.prepareGraphTemporalOptions)(options, direction, "distances()");
|
|
73
|
+
options = structuredClone(options);
|
|
74
|
+
const parameters = {
|
|
75
|
+
sourceColumn,
|
|
76
|
+
targetColumn,
|
|
77
|
+
startNodes: structuredClone(startNodes),
|
|
78
|
+
options,
|
|
79
|
+
};
|
|
80
|
+
return (0, queueGraphResult_js_1.default)(simpleTable, {
|
|
81
|
+
method: "distances()",
|
|
82
|
+
parameters,
|
|
83
|
+
outputTable: options.outputTable,
|
|
84
|
+
preflight: temporalOptions === undefined
|
|
85
|
+
? undefined
|
|
86
|
+
: (input) => (0, validateGraphTemporalEvents_js_1.default)(input, temporalOptions, "distances()", parameters),
|
|
87
|
+
values: (schema) => {
|
|
88
|
+
const { temporal } = validateDistanceInputs(schema, sourceColumn, targetColumn, preparedStarts, options.weight, temporalOptions);
|
|
89
|
+
return temporal === undefined
|
|
90
|
+
? preparedStarts.values
|
|
91
|
+
: [temporal.gapParameter, ...preparedStarts.values];
|
|
92
|
+
},
|
|
93
|
+
buildSelect: (input, schema) => distancesSelect(input, schema, sourceColumn, targetColumn, preparedStarts, direction, options.weight, temporalOptions),
|
|
94
|
+
outputSchema: (schema) => {
|
|
95
|
+
const validated = validateDistanceInputs(schema, sourceColumn, targetColumn, preparedStarts, options.weight, temporalOptions);
|
|
96
|
+
return {
|
|
97
|
+
start: validated.idType,
|
|
98
|
+
node: validated.idType,
|
|
99
|
+
distance: validated.distanceType,
|
|
100
|
+
};
|
|
101
|
+
},
|
|
102
|
+
});
|
|
103
|
+
}
|
|
104
|
+
function validateDistanceInputs(schema, source, target, starts, weight, temporalOptions) {
|
|
105
|
+
const endpoints = (0, prepareGraphTraversal_js_1.validateGraphStarts)(schema, source, target, starts, "distances()", "startNodes");
|
|
106
|
+
const distanceType = weight === undefined
|
|
107
|
+
? "BIGINT"
|
|
108
|
+
: (0, getGraphWeightColumn_js_1.default)(schema, weight, "distances()").distanceType;
|
|
109
|
+
const temporal = temporalOptions === undefined
|
|
110
|
+
? undefined
|
|
111
|
+
: (0, prepareGraphTemporalSql_js_1.default)(schema, temporalOptions, "distances()");
|
|
112
|
+
return { idType: endpoints.idType, distanceType, temporal };
|
|
113
|
+
}
|
|
114
|
+
function distancesSelect(input, schema, source, target, starts, direction, weight, temporalOptions) {
|
|
115
|
+
const prepared = (0, prepareGraphTraversal_js_1.default)(input, schema, source, target, starts, "distances()", "startNodes");
|
|
116
|
+
const weightColumn = weight === undefined
|
|
117
|
+
? undefined
|
|
118
|
+
: (0, getGraphWeightColumn_js_1.default)(schema, weight, "distances()");
|
|
119
|
+
const distanceType = weightColumn?.distanceType ?? "BIGINT";
|
|
120
|
+
const edgeWeight = weightColumn === undefined
|
|
121
|
+
? `CAST(1 AS ${distanceType})`
|
|
122
|
+
: `CAST(${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)(weightColumn.column)} AS ${distanceType})`;
|
|
123
|
+
if (temporalOptions !== undefined) {
|
|
124
|
+
const temporal = (0, prepareGraphTemporalSql_js_1.default)(schema, temporalOptions, "distances()");
|
|
125
|
+
return temporalDistancesSelect(prepared, direction, temporal, distanceType, edgeWeight);
|
|
126
|
+
}
|
|
127
|
+
const relations = prepared.relationNames([
|
|
128
|
+
"graph_start_values",
|
|
129
|
+
"graph_starts",
|
|
130
|
+
"graph_edges",
|
|
131
|
+
"graph_distances",
|
|
132
|
+
]);
|
|
133
|
+
const startValuesRelation = relations.graph_start_values;
|
|
134
|
+
const startsRelation = relations.graph_starts;
|
|
135
|
+
const edgesRelation = relations.graph_edges;
|
|
136
|
+
const distancesRelation = relations.graph_distances;
|
|
137
|
+
const start = `${(0, quoteIdentifier_js_1.default)("starts")}.${(0, quoteIdentifier_js_1.default)("start")}`;
|
|
138
|
+
const startKey = `${(0, quoteIdentifier_js_1.default)("starts")}.${(0, quoteIdentifier_js_1.default)("__key")}`;
|
|
139
|
+
const reachedStart = `${(0, quoteIdentifier_js_1.default)("reached")}.${(0, quoteIdentifier_js_1.default)("start")}`;
|
|
140
|
+
const reachedStartKey = `${(0, quoteIdentifier_js_1.default)("reached")}.${(0, quoteIdentifier_js_1.default)("__start_key")}`;
|
|
141
|
+
const reachedNodeKey = `${(0, quoteIdentifier_js_1.default)("reached")}.${(0, quoteIdentifier_js_1.default)("__node_key")}`;
|
|
142
|
+
const reachedDistance = `${(0, quoteIdentifier_js_1.default)("reached")}.${(0, quoteIdentifier_js_1.default)("distance")}`;
|
|
143
|
+
const edgeTo = `${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)("__to")}`;
|
|
144
|
+
const edgeToKey = `${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)("__to_key")}`;
|
|
145
|
+
const edgeFromKey = `${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)("__from_key")}`;
|
|
146
|
+
const edgeCost = `${(0, quoteIdentifier_js_1.default)("edges")}.${(0, quoteIdentifier_js_1.default)("__weight")}`;
|
|
147
|
+
const bestDistance = `${(0, quoteIdentifier_js_1.default)("best")}.${(0, quoteIdentifier_js_1.default)("distance")}`;
|
|
148
|
+
const candidateDistance = `CAST(${reachedDistance} + ${edgeCost} AS ${distanceType})`;
|
|
149
|
+
return `WITH RECURSIVE ${startValuesRelation}(${(0, quoteIdentifier_js_1.default)("start")}) AS (
|
|
150
|
+
VALUES ${prepared.startValues}
|
|
151
|
+
), ${startsRelation} AS (
|
|
152
|
+
SELECT ${(0, quoteIdentifier_js_1.default)("start")},
|
|
153
|
+
${prepared.key((0, quoteIdentifier_js_1.default)("start"))} AS ${(0, quoteIdentifier_js_1.default)("__key")}
|
|
154
|
+
FROM ${startValuesRelation}
|
|
155
|
+
), ${edgesRelation} AS (
|
|
156
|
+
${prepared.edges(direction, [
|
|
157
|
+
`${edgeWeight} AS ${(0, quoteIdentifier_js_1.default)("__weight")}`,
|
|
158
|
+
])}
|
|
159
|
+
), ${distancesRelation}(
|
|
160
|
+
${(0, quoteIdentifier_js_1.default)("start")}, ${(0, quoteIdentifier_js_1.default)("node")},
|
|
161
|
+
${(0, quoteIdentifier_js_1.default)("__start_key")}, ${(0, quoteIdentifier_js_1.default)("__node_key")},
|
|
162
|
+
${(0, quoteIdentifier_js_1.default)("distance")}
|
|
163
|
+
) USING KEY(
|
|
164
|
+
${(0, quoteIdentifier_js_1.default)("__start_key")}, ${(0, quoteIdentifier_js_1.default)("__node_key")}
|
|
165
|
+
) AS (
|
|
166
|
+
SELECT ${start}, ${edgeTo}, ${startKey}, ${edgeToKey},
|
|
167
|
+
MIN(${edgeCost}) AS ${(0, quoteIdentifier_js_1.default)("distance")}
|
|
168
|
+
FROM ${startsRelation} AS ${(0, quoteIdentifier_js_1.default)("starts")}
|
|
169
|
+
INNER JOIN ${edgesRelation} AS ${(0, quoteIdentifier_js_1.default)("edges")}
|
|
170
|
+
ON ${startKey} = ${edgeFromKey}
|
|
171
|
+
GROUP BY ${start}, ${edgeTo}, ${startKey}, ${edgeToKey}
|
|
172
|
+
UNION
|
|
173
|
+
SELECT ${reachedStart}, ${edgeTo}, ${reachedStartKey}, ${edgeToKey},
|
|
174
|
+
MIN(${candidateDistance}) AS ${(0, quoteIdentifier_js_1.default)("distance")}
|
|
175
|
+
FROM ${distancesRelation} AS ${(0, quoteIdentifier_js_1.default)("reached")}
|
|
176
|
+
INNER JOIN ${edgesRelation} AS ${(0, quoteIdentifier_js_1.default)("edges")}
|
|
177
|
+
ON ${reachedNodeKey} = ${edgeFromKey}
|
|
178
|
+
LEFT JOIN recurring.${distancesRelation} AS ${(0, quoteIdentifier_js_1.default)("best")}
|
|
179
|
+
ON ${reachedStartKey} = ${(0, quoteIdentifier_js_1.default)("best")}.${(0, quoteIdentifier_js_1.default)("__start_key")}
|
|
180
|
+
AND ${edgeToKey} = ${(0, quoteIdentifier_js_1.default)("best")}.${(0, quoteIdentifier_js_1.default)("__node_key")}
|
|
181
|
+
GROUP BY ${reachedStart}, ${edgeTo}, ${reachedStartKey}, ${edgeToKey},
|
|
182
|
+
${bestDistance}
|
|
183
|
+
HAVING ${bestDistance} IS NULL OR MIN(${candidateDistance}) < ${bestDistance}
|
|
184
|
+
)
|
|
185
|
+
SELECT ${(0, quoteIdentifier_js_1.default)("start")}, ${(0, quoteIdentifier_js_1.default)("node")},
|
|
186
|
+
${(0, quoteIdentifier_js_1.default)("distance")}
|
|
187
|
+
FROM ${distancesRelation}
|
|
188
|
+
ORDER BY ${(0, quoteIdentifier_js_1.default)("__start_key")}, ${(0, quoteIdentifier_js_1.default)("distance")}, ${(0, quoteIdentifier_js_1.default)("__node_key")}`;
|
|
189
|
+
}
|
|
190
|
+
function temporalDistancesSelect(prepared, direction, temporal, distanceType, edgeWeight) {
|
|
191
|
+
const q = quoteIdentifier_js_1.default;
|
|
192
|
+
const startsSelect = `SELECT ${q("start")},
|
|
193
|
+
${prepared.key(q("start"))} AS ${q("__key")}
|
|
194
|
+
FROM (VALUES ${prepared.startValues}) AS ${q("start_values")}(${q("start")})`;
|
|
195
|
+
const costStates = (0, buildGraphTemporalCostStateSql_js_1.default)(prepared, startsSelect, direction, temporal, distanceType, edgeWeight);
|
|
196
|
+
return `${costStates.withClause}
|
|
197
|
+
SELECT ${q("start")}, ${q("node")},
|
|
198
|
+
MIN(${q("distance")}) AS ${q("distance")}
|
|
199
|
+
FROM ${costStates.costRelation}
|
|
200
|
+
GROUP BY ${q("start")}, ${q("node")}, ${q("__start_key")},
|
|
201
|
+
${q("__node_key")}
|
|
202
|
+
ORDER BY ${q("__start_key")}, ${q("distance")}, ${q("__node_key")}`;
|
|
203
|
+
}
|
|
@@ -0,0 +1,12 @@
|
|
|
1
|
+
import type SimpleTable from "../class/SimpleTable.js";
|
|
2
|
+
import { type GraphTemporalOptions } from "../helpers/prepareGraphTemporalSql.js";
|
|
3
|
+
import { type GraphId } from "../helpers/prepareGraphStarts.js";
|
|
4
|
+
import { type GraphDirection } from "../helpers/prepareGraphTraversal.js";
|
|
5
|
+
type FindCyclesOptions = GraphTemporalOptions & {
|
|
6
|
+
direction?: GraphDirection;
|
|
7
|
+
outputTable?: string | boolean;
|
|
8
|
+
weight?: string;
|
|
9
|
+
};
|
|
10
|
+
export default function findCycles(simpleTable: SimpleTable, sourceColumn: string, targetColumn: string, edgeId: string, startNodes: GraphId | GraphId[], options?: FindCyclesOptions): SimpleTable;
|
|
11
|
+
export {};
|
|
12
|
+
//# sourceMappingURL=findCycles.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"findCycles.d.ts","sourceRoot":"","sources":["../../src/methods/findCycles.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AAMvD,OAAgC,EAC9B,KAAK,oBAAoB,EAG1B,MAAM,uCAAuC,CAAC;AAC/C,OAA2B,EACzB,KAAK,OAAO,EAEb,MAAM,kCAAkC,CAAC;AAC1C,OAA8B,EAC5B,KAAK,cAAc,EAEpB,MAAM,qCAAqC,CAAC;AAM7C,KAAK,iBAAiB,GAAG,oBAAoB,GAAG;IAC9C,SAAS,CAAC,EAAE,cAAc,CAAC;IAC3B,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC/B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,CAAC;AAEF,MAAM,CAAC,OAAO,UAAU,UAAU,CAChC,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,OAAO,GAAG,OAAO,EAAE,EAC/B,OAAO,GAAE,iBAAsB,GAC9B,WAAW,CAuHb"}
|
|
@@ -0,0 +1,369 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
|
|
3
|
+
if (k2 === undefined) k2 = k;
|
|
4
|
+
var desc = Object.getOwnPropertyDescriptor(m, k);
|
|
5
|
+
if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
|
|
6
|
+
desc = { enumerable: true, get: function() { return m[k]; } };
|
|
7
|
+
}
|
|
8
|
+
Object.defineProperty(o, k2, desc);
|
|
9
|
+
}) : (function(o, m, k, k2) {
|
|
10
|
+
if (k2 === undefined) k2 = k;
|
|
11
|
+
o[k2] = m[k];
|
|
12
|
+
}));
|
|
13
|
+
var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
|
|
14
|
+
Object.defineProperty(o, "default", { enumerable: true, value: v });
|
|
15
|
+
}) : function(o, v) {
|
|
16
|
+
o["default"] = v;
|
|
17
|
+
});
|
|
18
|
+
var __importStar = (this && this.__importStar) || (function () {
|
|
19
|
+
var ownKeys = function(o) {
|
|
20
|
+
ownKeys = Object.getOwnPropertyNames || function (o) {
|
|
21
|
+
var ar = [];
|
|
22
|
+
for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
|
|
23
|
+
return ar;
|
|
24
|
+
};
|
|
25
|
+
return ownKeys(o);
|
|
26
|
+
};
|
|
27
|
+
return function (mod) {
|
|
28
|
+
if (mod && mod.__esModule) return mod;
|
|
29
|
+
var result = {};
|
|
30
|
+
if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
|
|
31
|
+
__setModuleDefault(result, mod);
|
|
32
|
+
return result;
|
|
33
|
+
};
|
|
34
|
+
})();
|
|
35
|
+
var __importDefault = (this && this.__importDefault) || function (mod) {
|
|
36
|
+
return (mod && mod.__esModule) ? mod : { "default": mod };
|
|
37
|
+
};
|
|
38
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
39
|
+
exports.default = findCycles;
|
|
40
|
+
const getGraphEdgeIdColumn_js_1 = __importDefault(require("../helpers/getGraphEdgeIdColumn.js"));
|
|
41
|
+
const getGraphWeightColumn_js_1 = __importDefault(require("../helpers/getGraphWeightColumn.js"));
|
|
42
|
+
const graphRouteResultSchema_js_1 = __importDefault(require("../helpers/graphRouteResultSchema.js"));
|
|
43
|
+
const graphRouteResultSelect_js_1 = __importDefault(require("../helpers/graphRouteResultSelect.js"));
|
|
44
|
+
const prepareGraphTemporalSql_js_1 = __importStar(require("../helpers/prepareGraphTemporalSql.js"));
|
|
45
|
+
const prepareGraphStarts_js_1 = __importDefault(require("../helpers/prepareGraphStarts.js"));
|
|
46
|
+
const prepareGraphTraversal_js_1 = __importStar(require("../helpers/prepareGraphTraversal.js"));
|
|
47
|
+
const queueGraphResult_js_1 = __importDefault(require("../helpers/queueGraphResult.js"));
|
|
48
|
+
const quoteIdentifier_js_1 = __importDefault(require("../helpers/quoteIdentifier.js"));
|
|
49
|
+
const validateGraphTemporalEvents_js_1 = __importDefault(require("../helpers/validateGraphTemporalEvents.js"));
|
|
50
|
+
const validateGraphRouteResultSchema_js_1 = __importDefault(require("../helpers/validateGraphRouteResultSchema.js"));
|
|
51
|
+
function findCycles(simpleTable, sourceColumn, targetColumn, edgeId, startNodes, options = {}) {
|
|
52
|
+
if (typeof sourceColumn !== "string") {
|
|
53
|
+
throw new TypeError("findCycles() sourceColumn must be a string.");
|
|
54
|
+
}
|
|
55
|
+
if (typeof targetColumn !== "string") {
|
|
56
|
+
throw new TypeError("findCycles() targetColumn must be a string.");
|
|
57
|
+
}
|
|
58
|
+
if (typeof edgeId !== "string") {
|
|
59
|
+
throw new TypeError("findCycles() edgeId must be a string.");
|
|
60
|
+
}
|
|
61
|
+
const preparedStarts = (0, prepareGraphStarts_js_1.default)(startNodes, "findCycles()", "startNodes");
|
|
62
|
+
if (options === null || typeof options !== "object" || Array.isArray(options)) {
|
|
63
|
+
throw new TypeError("findCycles() options must be an object.");
|
|
64
|
+
}
|
|
65
|
+
if (options.direction !== undefined &&
|
|
66
|
+
!["outgoing", "incoming", "both"].includes(options.direction)) {
|
|
67
|
+
throw new TypeError('findCycles() options.direction must be "outgoing", "incoming", or "both".');
|
|
68
|
+
}
|
|
69
|
+
if (options.weight !== undefined && typeof options.weight !== "string") {
|
|
70
|
+
throw new TypeError("findCycles() options.weight must be a string.");
|
|
71
|
+
}
|
|
72
|
+
if (options.outputTable !== undefined &&
|
|
73
|
+
typeof options.outputTable !== "string" &&
|
|
74
|
+
typeof options.outputTable !== "boolean") {
|
|
75
|
+
throw new TypeError("findCycles() options.outputTable must be a string or boolean.");
|
|
76
|
+
}
|
|
77
|
+
const direction = options.direction ?? "outgoing";
|
|
78
|
+
const temporalOptions = (0, prepareGraphTemporalSql_js_1.prepareGraphTemporalOptions)(options, direction, "findCycles()");
|
|
79
|
+
options = structuredClone(options);
|
|
80
|
+
const parameters = {
|
|
81
|
+
sourceColumn,
|
|
82
|
+
targetColumn,
|
|
83
|
+
edgeId,
|
|
84
|
+
startNodes: structuredClone(startNodes),
|
|
85
|
+
options,
|
|
86
|
+
};
|
|
87
|
+
return (0, queueGraphResult_js_1.default)(simpleTable, {
|
|
88
|
+
method: "findCycles()",
|
|
89
|
+
parameters,
|
|
90
|
+
outputTable: options.outputTable,
|
|
91
|
+
preflight: temporalOptions === undefined
|
|
92
|
+
? undefined
|
|
93
|
+
: (input) => (0, validateGraphTemporalEvents_js_1.default)(input, temporalOptions, "findCycles()", parameters),
|
|
94
|
+
values: (schema) => {
|
|
95
|
+
validateFindCyclesInputs(schema, sourceColumn, targetColumn, edgeId, preparedStarts, options.weight);
|
|
96
|
+
const temporal = temporalOptions === undefined
|
|
97
|
+
? undefined
|
|
98
|
+
: (0, prepareGraphTemporalSql_js_1.default)(schema, temporalOptions, "findCycles()");
|
|
99
|
+
return temporal === undefined
|
|
100
|
+
? preparedStarts.values
|
|
101
|
+
: [temporal.gapParameter, ...preparedStarts.values];
|
|
102
|
+
},
|
|
103
|
+
buildSelect: (input, schema) => findCyclesSelect(input, schema, sourceColumn, targetColumn, edgeId, preparedStarts, direction, options.weight, temporalOptions),
|
|
104
|
+
outputSchema: (schema) => {
|
|
105
|
+
const validated = validateFindCyclesInputs(schema, sourceColumn, targetColumn, edgeId, preparedStarts, options.weight);
|
|
106
|
+
if (temporalOptions !== undefined) {
|
|
107
|
+
(0, prepareGraphTemporalSql_js_1.default)(schema, temporalOptions, "findCycles()");
|
|
108
|
+
}
|
|
109
|
+
return {
|
|
110
|
+
start: validated.nodeIdType,
|
|
111
|
+
...(0, graphRouteResultSchema_js_1.default)(schema, validated.distanceType, "findCycles()"),
|
|
112
|
+
};
|
|
113
|
+
},
|
|
114
|
+
});
|
|
115
|
+
}
|
|
116
|
+
function validateFindCyclesInputs(schema, source, target, edgeId, starts, weight) {
|
|
117
|
+
const endpoints = (0, prepareGraphTraversal_js_1.validateGraphStarts)(schema, source, target, starts, "findCycles()", "startNodes");
|
|
118
|
+
const edgeIdColumn = (0, getGraphEdgeIdColumn_js_1.default)(schema, edgeId, "findCycles()");
|
|
119
|
+
const weightColumn = weight === undefined
|
|
120
|
+
? undefined
|
|
121
|
+
: (0, getGraphWeightColumn_js_1.default)(schema, weight, "findCycles()");
|
|
122
|
+
(0, validateGraphRouteResultSchema_js_1.default)(schema, "findCycles()", ["start"]);
|
|
123
|
+
return {
|
|
124
|
+
distanceType: weightColumn?.distanceType ?? "BIGINT",
|
|
125
|
+
edgeIdType: edgeIdColumn.idType,
|
|
126
|
+
nodeIdType: endpoints.idType,
|
|
127
|
+
};
|
|
128
|
+
}
|
|
129
|
+
function findCyclesSelect(input, schema, source, target, edgeId, starts, direction, weight, temporalOptions) {
|
|
130
|
+
const prepared = (0, prepareGraphTraversal_js_1.default)(input, schema, source, target, starts, "findCycles()", "startNodes");
|
|
131
|
+
const edgeIdColumn = (0, getGraphEdgeIdColumn_js_1.default)(schema, edgeId, "findCycles()");
|
|
132
|
+
const weightColumn = weight === undefined
|
|
133
|
+
? undefined
|
|
134
|
+
: (0, getGraphWeightColumn_js_1.default)(schema, weight, "findCycles()");
|
|
135
|
+
const distanceType = weightColumn?.distanceType ?? "BIGINT";
|
|
136
|
+
const q = quoteIdentifier_js_1.default;
|
|
137
|
+
const edgeIdReference = `${q("edges")}.${q(edgeIdColumn.column)}`;
|
|
138
|
+
const typedEdgeId = `CAST(${edgeIdReference} AS ${edgeIdColumn.idType})`;
|
|
139
|
+
const edgeKey = edgeIdColumn.family === "string"
|
|
140
|
+
? `ENCODE(${typedEdgeId})`
|
|
141
|
+
: typedEdgeId;
|
|
142
|
+
const edgeWeight = weightColumn === undefined
|
|
143
|
+
? `CAST(1 AS ${distanceType})`
|
|
144
|
+
: `CAST(${q("edges")}.${q(weightColumn.column)} AS ${distanceType})`;
|
|
145
|
+
const stepType = `STRUCT(${q("edgeId")} ${edgeIdColumn.idType}, ${q("source")} ${prepared.endpoints.idType}, ${q("target")} ${prepared.endpoints.idType}, ${q("weight")} ${distanceType}, ${q("distance")} ${distanceType})`;
|
|
146
|
+
if (temporalOptions !== undefined) {
|
|
147
|
+
const temporal = (0, prepareGraphTemporalSql_js_1.default)(schema, temporalOptions, "findCycles()");
|
|
148
|
+
return temporalFindCyclesSelect(prepared, direction, temporal, typedEdgeId, edgeKey, edgeWeight, distanceType, stepType, input, edgeIdColumn);
|
|
149
|
+
}
|
|
150
|
+
const relations = prepared.relationNames([
|
|
151
|
+
"graph_start_values",
|
|
152
|
+
"graph_starts",
|
|
153
|
+
"graph_edges",
|
|
154
|
+
"graph_cycle_walks",
|
|
155
|
+
"graph_complete_cycles",
|
|
156
|
+
"graph_ranked_cycles",
|
|
157
|
+
]);
|
|
158
|
+
const startValuesRelation = relations.graph_start_values;
|
|
159
|
+
const startsRelation = relations.graph_starts;
|
|
160
|
+
const edgesRelation = relations.graph_edges;
|
|
161
|
+
const walksRelation = relations.graph_cycle_walks;
|
|
162
|
+
const completeRelation = relations.graph_complete_cycles;
|
|
163
|
+
const rankedRelation = relations.graph_ranked_cycles;
|
|
164
|
+
const edgeFrom = `${q("edges")}.${q("__from")}`;
|
|
165
|
+
const edgeTo = `${q("edges")}.${q("__to")}`;
|
|
166
|
+
const edgeFromKey = `${q("edges")}.${q("__from_key")}`;
|
|
167
|
+
const edgeToKey = `${q("edges")}.${q("__to_key")}`;
|
|
168
|
+
const edgeIdentity = `${q("edges")}.${q("__edge_id")}`;
|
|
169
|
+
const edgeIdentityKey = `${q("edges")}.${q("__edge_key")}`;
|
|
170
|
+
const edgeCost = `${q("edges")}.${q("__weight")}`;
|
|
171
|
+
const walkDistance = `${q("walks")}.${q("distance")}`;
|
|
172
|
+
const candidateDistance = `CAST(${walkDistance} + ${edgeCost} AS ${distanceType})`;
|
|
173
|
+
return `WITH RECURSIVE ${startValuesRelation}(${q("start")}) AS (
|
|
174
|
+
VALUES ${prepared.startValues}
|
|
175
|
+
), ${startsRelation} AS (
|
|
176
|
+
SELECT ${q("start")},
|
|
177
|
+
${prepared.key(q("start"))} AS ${q("__start_key")}
|
|
178
|
+
FROM ${startValuesRelation}
|
|
179
|
+
), ${edgesRelation} AS (
|
|
180
|
+
${prepared.edges(direction, [
|
|
181
|
+
`${typedEdgeId} AS ${q("__edge_id")}`,
|
|
182
|
+
`${edgeKey} AS ${q("__edge_key")}`,
|
|
183
|
+
`${edgeWeight} AS ${q("__weight")}`,
|
|
184
|
+
])}
|
|
185
|
+
), ${walksRelation}(
|
|
186
|
+
${q("start")}, ${q("__start_key")}, ${q("node")},
|
|
187
|
+
${q("__node_key")}, ${q("__visited")}, ${q("__edge_keys")},
|
|
188
|
+
${q("steps")}, ${q("distance")}, ${q("closed")}
|
|
189
|
+
) AS (
|
|
190
|
+
SELECT ${q("starts")}.${q("start")},
|
|
191
|
+
${q("starts")}.${q("__start_key")}, ${edgeTo}, ${edgeToKey},
|
|
192
|
+
CASE WHEN ${edgeFromKey} = ${edgeToKey}
|
|
193
|
+
THEN [${edgeFromKey}]
|
|
194
|
+
ELSE [${edgeFromKey}, ${edgeToKey}]
|
|
195
|
+
END,
|
|
196
|
+
[${edgeIdentityKey}],
|
|
197
|
+
[struct_pack(
|
|
198
|
+
${q("edgeId")} := ${edgeIdentity},
|
|
199
|
+
${q("source")} := ${edgeFrom},
|
|
200
|
+
${q("target")} := ${edgeTo},
|
|
201
|
+
${q("weight")} := ${edgeCost},
|
|
202
|
+
${q("distance")} := ${edgeCost}
|
|
203
|
+
)]::${stepType}[],
|
|
204
|
+
${edgeCost}, ${edgeFromKey} = ${edgeToKey}
|
|
205
|
+
FROM ${edgesRelation} AS ${q("edges")}
|
|
206
|
+
INNER JOIN ${startsRelation} AS ${q("starts")}
|
|
207
|
+
ON ${q("starts")}.${q("__start_key")} = ${edgeFromKey}
|
|
208
|
+
UNION ALL
|
|
209
|
+
SELECT ${q("walks")}.${q("start")},
|
|
210
|
+
${q("walks")}.${q("__start_key")}, ${edgeTo}, ${edgeToKey},
|
|
211
|
+
list_append(${q("walks")}.${q("__visited")}, ${edgeToKey}),
|
|
212
|
+
list_append(${q("walks")}.${q("__edge_keys")}, ${edgeIdentityKey}),
|
|
213
|
+
list_append(${q("walks")}.${q("steps")}, struct_pack(
|
|
214
|
+
${q("edgeId")} := ${edgeIdentity},
|
|
215
|
+
${q("source")} := ${edgeFrom},
|
|
216
|
+
${q("target")} := ${edgeTo},
|
|
217
|
+
${q("weight")} := ${edgeCost},
|
|
218
|
+
${q("distance")} := ${candidateDistance}
|
|
219
|
+
)), ${candidateDistance},
|
|
220
|
+
${edgeToKey} = ${q("walks")}.${q("__start_key")}
|
|
221
|
+
FROM ${walksRelation} AS ${q("walks")}
|
|
222
|
+
INNER JOIN ${edgesRelation} AS ${q("edges")}
|
|
223
|
+
ON ${q("walks")}.${q("__node_key")} = ${edgeFromKey}
|
|
224
|
+
WHERE NOT ${q("walks")}.${q("closed")}
|
|
225
|
+
AND NOT list_contains(
|
|
226
|
+
${q("walks")}.${q("__edge_keys")}, ${edgeIdentityKey}
|
|
227
|
+
)
|
|
228
|
+
AND (
|
|
229
|
+
${edgeToKey} = ${q("walks")}.${q("__start_key")}
|
|
230
|
+
OR NOT list_contains(
|
|
231
|
+
${q("walks")}.${q("__visited")}, ${edgeToKey}
|
|
232
|
+
)
|
|
233
|
+
)
|
|
234
|
+
), ${completeRelation} AS (
|
|
235
|
+
SELECT DISTINCT ${q("start")}, ${q("__start_key")},
|
|
236
|
+
${q("__edge_keys")}, ${q("steps")}
|
|
237
|
+
FROM ${walksRelation}
|
|
238
|
+
WHERE ${q("closed")}${direction === "both"
|
|
239
|
+
? `
|
|
240
|
+
AND ${q("__edge_keys")} <= list_reverse(${q("__edge_keys")})`
|
|
241
|
+
: ""}
|
|
242
|
+
), ${rankedRelation} AS (
|
|
243
|
+
SELECT ${q("start")}, ${q("__start_key")},
|
|
244
|
+
CAST(row_number() OVER (
|
|
245
|
+
PARTITION BY ${q("__start_key")}
|
|
246
|
+
ORDER BY ${q("__edge_keys")}) - 1
|
|
247
|
+
AS BIGINT) AS ${q("pathId")}, ${q("steps")}
|
|
248
|
+
FROM ${completeRelation}
|
|
249
|
+
)
|
|
250
|
+
${(0, graphRouteResultSelect_js_1.default)(rankedRelation, input, edgeIdColumn, true)}`;
|
|
251
|
+
}
|
|
252
|
+
function temporalFindCyclesSelect(prepared, direction, temporal, typedEdgeId, edgeKey, edgeWeight, distanceType, stepType, input, edgeIdColumn) {
|
|
253
|
+
const q = quoteIdentifier_js_1.default;
|
|
254
|
+
const relations = prepared.relationNames([
|
|
255
|
+
"graph_start_values",
|
|
256
|
+
"graph_starts",
|
|
257
|
+
"graph_temporal_settings",
|
|
258
|
+
"graph_event_rows",
|
|
259
|
+
"graph_edges",
|
|
260
|
+
"graph_cycle_walks",
|
|
261
|
+
"graph_complete_cycles",
|
|
262
|
+
"graph_ranked_cycles",
|
|
263
|
+
]);
|
|
264
|
+
const startValuesRelation = relations.graph_start_values;
|
|
265
|
+
const startsRelation = relations.graph_starts;
|
|
266
|
+
const settingsRelation = relations.graph_temporal_settings;
|
|
267
|
+
const eventRowsRelation = relations.graph_event_rows;
|
|
268
|
+
const edgesRelation = relations.graph_edges;
|
|
269
|
+
const walksRelation = relations.graph_cycle_walks;
|
|
270
|
+
const completeRelation = relations.graph_complete_cycles;
|
|
271
|
+
const rankedRelation = relations.graph_ranked_cycles;
|
|
272
|
+
const edgeFrom = `${q("edges")}.${q("__from")}`;
|
|
273
|
+
const edgeTo = `${q("edges")}.${q("__to")}`;
|
|
274
|
+
const edgeFromKey = `${q("edges")}.${q("__from_key")}`;
|
|
275
|
+
const edgeToKey = `${q("edges")}.${q("__to_key")}`;
|
|
276
|
+
const edgeIdentity = `${q("edges")}.${q("__edge_id")}`;
|
|
277
|
+
const edgeIdentityKey = `${q("edges")}.${q("__edge_key")}`;
|
|
278
|
+
const edgeCost = `${q("edges")}.${q("__weight")}`;
|
|
279
|
+
const walkDistance = `${q("walks")}.${q("distance")}`;
|
|
280
|
+
const candidateDistance = `CAST(${walkDistance} + ${edgeCost} AS ${distanceType})`;
|
|
281
|
+
const gap = `${q("settings")}.${q("__gap")}`;
|
|
282
|
+
const step = (distance) => `struct_pack(
|
|
283
|
+
${q("edgeId")} := ${edgeIdentity},
|
|
284
|
+
${q("source")} := ${edgeFrom},
|
|
285
|
+
${q("target")} := ${edgeTo},
|
|
286
|
+
${q("weight")} := ${edgeCost},
|
|
287
|
+
${q("distance")} := ${distance}
|
|
288
|
+
)`;
|
|
289
|
+
return `WITH RECURSIVE ${settingsRelation} AS MATERIALIZED (
|
|
290
|
+
SELECT CAST(? AS HUGEINT) AS ${q("__gap")}
|
|
291
|
+
), ${startValuesRelation}(${q("start")}) AS (
|
|
292
|
+
VALUES ${prepared.startValues}
|
|
293
|
+
), ${startsRelation} AS (
|
|
294
|
+
SELECT ${q("start")},
|
|
295
|
+
${prepared.key(q("start"))} AS ${q("__start_key")}
|
|
296
|
+
FROM ${startValuesRelation}
|
|
297
|
+
), ${eventRowsRelation} AS MATERIALIZED (
|
|
298
|
+
${prepared.edges(direction, [
|
|
299
|
+
`${typedEdgeId} AS ${q("__edge_id")}`,
|
|
300
|
+
`${edgeKey} AS ${q("__edge_key")}`,
|
|
301
|
+
`${edgeWeight} AS ${q("__weight")}`,
|
|
302
|
+
...temporal.eventSelections("edges"),
|
|
303
|
+
])}
|
|
304
|
+
), ${edgesRelation} AS MATERIALIZED (
|
|
305
|
+
SELECT *
|
|
306
|
+
FROM ${eventRowsRelation} AS ${q("events")}
|
|
307
|
+
WHERE ${temporal.eventValidity("events")}
|
|
308
|
+
), ${walksRelation}(
|
|
309
|
+
${q("start")}, ${q("__start_key")}, ${q("node")},
|
|
310
|
+
${q("__node_key")}, ${q("__visited")}, ${q("__event_ids")},
|
|
311
|
+
${q("__edge_keys")}, ${q("steps")}, ${q("distance")},
|
|
312
|
+
${q("closed")}, ${q("__event_id")}, ${q("__event_start")},
|
|
313
|
+
${q("__event_end")}
|
|
314
|
+
) AS (
|
|
315
|
+
SELECT ${q("starts")}.${q("start")},
|
|
316
|
+
${q("starts")}.${q("__start_key")}, ${edgeTo}, ${edgeToKey},
|
|
317
|
+
CASE WHEN ${edgeFromKey} = ${edgeToKey}
|
|
318
|
+
THEN [${edgeFromKey}]
|
|
319
|
+
ELSE [${edgeFromKey}, ${edgeToKey}]
|
|
320
|
+
END,
|
|
321
|
+
[${q("edges")}.${q("__event_id")}], [${edgeIdentityKey}],
|
|
322
|
+
[${step(edgeCost)}]::${stepType}[], ${edgeCost},
|
|
323
|
+
${edgeFromKey} = ${edgeToKey},
|
|
324
|
+
${q("edges")}.${q("__event_id")},
|
|
325
|
+
${q("edges")}.${q("__event_start")},
|
|
326
|
+
${q("edges")}.${q("__event_end")}
|
|
327
|
+
FROM ${edgesRelation} AS ${q("edges")}
|
|
328
|
+
INNER JOIN ${startsRelation} AS ${q("starts")}
|
|
329
|
+
ON ${q("starts")}.${q("__start_key")} = ${edgeFromKey}
|
|
330
|
+
UNION ALL
|
|
331
|
+
SELECT ${q("walks")}.${q("start")},
|
|
332
|
+
${q("walks")}.${q("__start_key")}, ${edgeTo}, ${edgeToKey},
|
|
333
|
+
list_append(${q("walks")}.${q("__visited")}, ${edgeToKey}),
|
|
334
|
+
list_append(${q("walks")}.${q("__event_ids")},
|
|
335
|
+
${q("edges")}.${q("__event_id")}),
|
|
336
|
+
list_append(${q("walks")}.${q("__edge_keys")}, ${edgeIdentityKey}),
|
|
337
|
+
list_append(${q("walks")}.${q("steps")}, ${step(candidateDistance)}),
|
|
338
|
+
${candidateDistance},
|
|
339
|
+
${edgeToKey} = ${q("walks")}.${q("__start_key")},
|
|
340
|
+
${q("edges")}.${q("__event_id")},
|
|
341
|
+
${q("edges")}.${q("__event_start")},
|
|
342
|
+
${q("edges")}.${q("__event_end")}
|
|
343
|
+
FROM ${walksRelation} AS ${q("walks")}
|
|
344
|
+
INNER JOIN ${edgesRelation} AS ${q("edges")}
|
|
345
|
+
ON ${q("walks")}.${q("__node_key")} = ${edgeFromKey}
|
|
346
|
+
CROSS JOIN ${settingsRelation} AS ${q("settings")}
|
|
347
|
+
WHERE NOT ${q("walks")}.${q("closed")}
|
|
348
|
+
AND NOT list_contains(${q("walks")}.${q("__event_ids")},
|
|
349
|
+
${q("edges")}.${q("__event_id")})
|
|
350
|
+
AND (
|
|
351
|
+
${edgeToKey} = ${q("walks")}.${q("__start_key")}
|
|
352
|
+
OR NOT list_contains(${q("walks")}.${q("__visited")}, ${edgeToKey})
|
|
353
|
+
)
|
|
354
|
+
AND ${temporal.transition("walks", "edges", direction, gap)}
|
|
355
|
+
), ${completeRelation} AS (
|
|
356
|
+
SELECT DISTINCT ${q("start")}, ${q("__start_key")},
|
|
357
|
+
${q("__edge_keys")}, ${q("steps")}
|
|
358
|
+
FROM ${walksRelation}
|
|
359
|
+
WHERE ${q("closed")}
|
|
360
|
+
), ${rankedRelation} AS (
|
|
361
|
+
SELECT ${q("start")}, ${q("__start_key")},
|
|
362
|
+
CAST(row_number() OVER (
|
|
363
|
+
PARTITION BY ${q("__start_key")}
|
|
364
|
+
ORDER BY ${q("__edge_keys")}) - 1
|
|
365
|
+
AS BIGINT) AS ${q("pathId")}, ${q("steps")}
|
|
366
|
+
FROM ${completeRelation}
|
|
367
|
+
)
|
|
368
|
+
${(0, graphRouteResultSelect_js_1.default)(rankedRelation, input, edgeIdColumn, true)}`;
|
|
369
|
+
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"fuzzyClean.d.ts","sourceRoot":"","sources":["../../src/methods/fuzzyClean.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"fuzzyClean.d.ts","sourceRoot":"","sources":["../../src/methods/fuzzyClean.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AASvD,MAAM,CAAC,OAAO,UAAU,UAAU,CAChC,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE;IACP,MAAM,CAAC,EACH,OAAO,GACP,eAAe,GACf,kBAAkB,GAClB,iBAAiB,CAAC;IACtB,QAAQ,CAAC,EACL,YAAY,GACZ,eAAe,GACf,gBAAgB,GAChB,aAAa,GACb,UAAU,CAAC;IACf,qBAAqB,CAAC,EAAE,MAAM,CAAC;CAC3B,GACL,IAAI,CAWN"}
|