forked from eldersantos/community
/
Collection.scala
48 lines (39 loc) · 1.67 KB
/
Collection.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
/**
* Copyright (c) 2002-2012 "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.commands.expressions
import org.neo4j.cypher.internal.symbols._
import collection.Map
case class Collection(expressions: Expression*) extends Expression {
def apply(m: Map[String, Any]): Any = expressions.map(e => e(m))
def rewrite(f: (Expression) => Expression): Expression = f(Collection(expressions.map(f): _*))
def filter(f: (Expression) => Boolean): Seq[Expression] = if (f(this))
Seq(this) ++ expressions.flatMap(_.filter(f))
else
expressions.flatMap(_.filter(f))
def calculateType(symbols: SymbolTable): CypherType = {
expressions.map(_.getType(symbols)) match {
case Seq() => AnyIterableType()
case types =>
val innerType = types.foldLeft(AnyType().asInstanceOf[CypherType])(_ mergeWith _)
new IterableType( innerType )
}
}
def symbolTableDependencies = expressions.flatMap(_.symbolTableDependencies).toSet
}