org.neo4j.cypher.internal.logical.plans.AssertSameNode.scala Maven / Gradle / Ivy
/*
* Copyright (c) "Neo4j"
* Neo4j Sweden AB [http://neo4j.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 .
*/
package org.neo4j.cypher.internal.logical.plans
import org.neo4j.cypher.internal.util.attribution.IdGen
/**
* For every row in left, assert that all rows in right produce the same value
* for the variable IdName. Produce the rows from left.
*
* for ( leftRow <- left )
* for ( rightRow <- right )
* assert( leftRow(node) == rightRow(node) )
* produce leftRow
*
* This operator is planned for merges using unique index seeks.
*/
case class AssertSameNode(node: String, override val left: LogicalPlan, override val right: LogicalPlan)(implicit idGen: IdGen) extends LogicalBinaryPlan(idGen) {
override def withLhs(newLHS: LogicalPlan)(idGen: IdGen): LogicalBinaryPlan = copy(left = newLHS)(idGen)
override def withRhs(newRHS: LogicalPlan)(idGen: IdGen): LogicalBinaryPlan = copy(right = newRHS)(idGen)
override val availableSymbols: Set[String] = left.availableSymbols ++ right.availableSymbols + node
}