42 lines
1.2 KiB
Gherkin
42 lines
1.2 KiB
Gherkin
|
#
|
||
|
|
# Copyright 2017 "Neo Technology",
|
||
|
|
# Network Engine for Objects in Lund AB (http://neotechnology.com)
|
||
|
|
#
|
||
|
|
# Licensed under the Apache License, Version 2.0 (the "License");
|
||
|
|
# you may not use this file except in compliance with the License.
|
||
|
|
# You may obtain a copy of the License at
|
||
|
|
#
|
||
|
|
# http://www.apache.org/licenses/LICENSE-2.0
|
||
|
|
#
|
||
|
|
# Unless required by applicable law or agreed to in writing, software
|
||
|
|
# distributed under the License is distributed on an "AS IS" BASIS,
|
||
|
|
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
|
|
# See the License for the specific language governing permissions and
|
||
|
|
# limitations under the License.
|
||
|
|
#
|
||
|
|
|
||
|
|
Feature: VarLengthAcceptance2
|
||
|
|
|
||
|
|
Scenario: Handling relationships that are already bound in variable length paths
|
||
|
|
Given an empty graph
|
||
|
|
And having executed:
|
||
|
|
"""
|
||
|
|
CREATE (n0:Node),
|
||
|
|
(n1:Node),
|
||
|
|
(n2:Node),
|
||
|
|
(n3:Node),
|
||
|
|
(n0)-[:EDGE]->(n1),
|
||
|
|
(n1)-[:EDGE]->(n2),
|
||
|
|
(n2)-[:EDGE]->(n3)
|
||
|
|
"""
|
||
|
|
When executing query:
|
||
|
|
"""
|
||
|
|
MATCH ()-[r:EDGE]-()
|
||
|
|
MATCH p = (n)-[*0..1]-()-[r]-()-[*0..1]-(m)
|
||
|
|
RETURN count(p) AS c
|
||
|
|
"""
|
||
|
|
Then the result should be:
|
||
|
|
| c |
|
||
|
|
| 32 |
|
||
|
|
And no side effects
|