-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
PathLinkMatcherTest.scala
69 lines (54 loc) · 2.89 KB
/
PathLinkMatcherTest.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
/*
* Copyright (c) 2002-2016 "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 cypher.feature.parser.matchers
import cypher.feature.parser.ParsingTestSupport
import cypher.feature.parser.matchers.MapMatcher.EMPTY
class PathLinkMatcherTest extends ParsingTestSupport {
test("should match an outgoing pathlink") {
val matcher = new PathLinkMatcher(new RelationshipMatcher("T", EMPTY), new NodeMatcher(Set("L").asJava, EMPTY), true)
matcher.setRightNode(new NodeMatcher(Set.empty[String].asJava, EMPTY))
matcher should accept(pathLink(node(Seq("L")), relationship("T"), node()))
}
test("should match an incoming pathlink") {
val matcher = new PathLinkMatcher(new RelationshipMatcher("T", EMPTY), new NodeMatcher(Set("L").asJava, EMPTY), false)
matcher.setRightNode(new NodeMatcher(Set.empty[String].asJava, EMPTY))
matcher should accept(pathLink(node(), relationship("T"), node(Seq("L"))))
}
test("should not match a reversed pathlink") {
val matcher = new PathLinkMatcher(new RelationshipMatcher("T", EMPTY), new NodeMatcher(Set("L").asJava, EMPTY), false)
matcher.setRightNode(new NodeMatcher(Set.empty[String].asJava, EMPTY))
matcher shouldNot accept(pathLink(node(Seq("L")), relationship("T"), node()))
}
test("should not match a different relationship") {
val matcher = new PathLinkMatcher(new RelationshipMatcher("T1", EMPTY), new NodeMatcher(Set("L").asJava, EMPTY), true)
matcher.setRightNode(new NodeMatcher(Set.empty[String].asJava, EMPTY))
matcher shouldNot accept(pathLink(node(Seq("L")), relationship("T2"), node()))
}
test("should not match a different startNode") {
val matcher = new PathLinkMatcher(new RelationshipMatcher("T", EMPTY), new NodeMatcher(Set("L1").asJava, EMPTY), true)
matcher.setRightNode(new NodeMatcher(Set.empty[String].asJava, EMPTY))
matcher shouldNot accept(pathLink(node(Seq("L2")), relationship("T"), node()))
}
test("should not match a non-relationship") {
val matcher = new PathLinkMatcher(new RelationshipMatcher("T", EMPTY), new NodeMatcher(Set("L1").asJava, EMPTY), true)
matcher.setRightNode(new NodeMatcher(Set.empty[String].asJava, EMPTY))
matcher shouldNot accept("a string")
}
}