-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
LogicalPlanningContext.scala
78 lines (69 loc) · 3.79 KB
/
LogicalPlanningContext.scala
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/*
* Copyright (c) 2002-2017 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.cypher.internal.compiler.v3_4.planner.logical
import org.neo4j.csv.reader.Configuration.DEFAULT_LEGACY_STYLE_QUOTING
import org.neo4j.cypher.internal.compiler.v3_4.planner.logical.Metrics.QueryGraphSolverInput
import org.neo4j.cypher.internal.compiler.v3_4.planner.logical.steps.LogicalPlanProducer
import org.neo4j.cypher.internal.frontend.v3_4.phases.InternalNotificationLogger
import org.neo4j.cypher.internal.frontend.v3_4.semantics.SemanticTable
import org.neo4j.cypher.internal.ir.v3_4.{IdName, StrictnessMode}
import org.neo4j.cypher.internal.planner.v3_4.spi.PlanContext
import org.neo4j.cypher.internal.util.v3_4.Cardinality
import org.neo4j.cypher.internal.v3_4.logical.plans.LogicalPlan
import org.neo4j.cypher.internal.v3_4.expressions.Variable
case class LogicalPlanningContext(planContext: PlanContext,
logicalPlanProducer: LogicalPlanProducer,
metrics: Metrics,
semanticTable: SemanticTable,
strategy: QueryGraphSolver,
input: QueryGraphSolverInput = QueryGraphSolverInput.empty,
notificationLogger: InternalNotificationLogger,
useErrorsOverWarnings: Boolean = false,
errorIfShortestPathFallbackUsedAtRuntime: Boolean = false,
errorIfShortestPathHasCommonNodesAtRuntime: Boolean = true,
legacyCsvQuoteEscaping: Boolean = DEFAULT_LEGACY_STYLE_QUOTING,
config: QueryPlannerConfiguration = QueryPlannerConfiguration.default,
leafPlanUpdater: LogicalPlan => LogicalPlan = identity) {
def withStrictness(strictness: StrictnessMode) = copy(input = input.withPreferredStrictness(strictness))
def recurse(plan: LogicalPlan) = copy(input = input.recurse(plan))
def forExpressionPlanning(nodes: Iterable[Variable], rels: Iterable[Variable]): LogicalPlanningContext = {
val tableWithNodes = nodes.foldLeft(semanticTable) { case (table, node) => table.addNode(node) }
val tableWithRels = rels.foldLeft(tableWithNodes) { case (table, rel) => table.addRelationship(rel) }
copy(
input = input.copy(inboundCardinality = input.inboundCardinality.max(Cardinality(1))),
semanticTable = tableWithRels
)
}
def statistics = planContext.statistics
def cost = metrics.cost
def cardinality = metrics.cardinality
}
object NodeIdName {
def unapply(v: Any)(implicit context: LogicalPlanningContext): Option[IdName] = v match {
case variable@Variable(name) if context.semanticTable.isNode(variable) => Some(IdName(variable.name))
case _ => None
}
}
object RelationshipIdName {
def unapply(v: Any)(implicit context: LogicalPlanningContext): Option[IdName] = v match {
case variable@Variable(name) if context.semanticTable.isRelationship(variable) => Some(IdName(variable.name))
case _ => None
}
}