-
Notifications
You must be signed in to change notification settings - Fork 1.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
t# This is a combination of 2 commits.
fix insert format fix tck format
- Loading branch information
Showing
5 changed files
with
83 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,40 @@ | ||
# Copyright (c) 2021 vesoft inc. All rights reserved. | ||
# | ||
# This source code is licensed under Apache 2.0 License, | ||
# attached with Common Clause Condition 1.0, found in the LICENSES directory. | ||
Feature: Insert vertex and edge with if not exists | ||
|
||
Scenario: insert edge with default value | ||
Given an empty graph | ||
And create a space with following options: | ||
| partition_num | 9 | | ||
| replica_factor | 1 | | ||
| vid_type | FIXED_STRING(20) | | ||
And having executed: | ||
""" | ||
CREATE TAG IF NOT EXISTS V(); | ||
CREATE EDGE IF NOT EXISTS E(rank timestamp default timestamp()); | ||
""" | ||
When try to execute query: | ||
""" | ||
INSERT VERTEX V() VALUES "v1":() | ||
""" | ||
Then the execution should be successful | ||
When try to execute query: | ||
""" | ||
INSERT VERTEX V() VALUES "v2":() | ||
""" | ||
Then the execution should be successful | ||
When try to execute query: | ||
""" | ||
INSERT EDGE E() VALUES "v1"->"v2":() | ||
""" | ||
Then the execution should be successful | ||
When executing query: | ||
""" | ||
(GO FROM "v1" over E yield E.rank union GO FROM "v2" over E REVERSELY yield E.rank) | yield count(*) AS count | ||
""" | ||
Then the result should be, in any order: | ||
| count | | ||
| 1 | | ||
And drop the used space |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters