Skip to content

Instantly share code, notes, and snippets.

@spmallette
Last active December 15, 2022 17:31
Show Gist options
  • Save spmallette/28640c17784cb1afdb30905cbe641bc7 to your computer and use it in GitHub Desktop.
Save spmallette/28640c17784cb1afdb30905cbe641bc7 to your computer and use it in GitHub Desktop.
Scenario: g_mergeVXid_xxx_label_person_name_stephenX
Given the empty graph
And the graph initializer of
"""
g.addV("person").property("name", "marko").property("age", 29)
"""
And using the parameter xx1 defined as "m[{\"t[id]\": 1, \"t[label]\": \"person\", \"name\":\"stephen\"}]"
And the traversal of
"""
g.mergeV(xx1)
"""
When iterated to list
Then the result should have a count of 1
And the graph should return 1 for count of "g.V(1).has(\"person\",\"name\",\"stephen\")"
Scenario: g_V_mergeEXlabel_selfX_optionXonMatch_emptyXMMM
Given the empty graph
And the graph initializer of
"""
g.addV("person").property("name", "marko").property("age", 29).
addE("self")
"""
And using the parameter xx1 defined as "m[{\"t[id]\": 100, \"t[label]\": \"self\"}]"
And the traversal of
"""
g.V().mergeE(xx1)
"""
When iterated to list
Then the result should have a count of 1
And the graph should return 1 for count of "g.E(100)"
And the graph should return 0 for count of "g.E().properties()"
And the graph should return 1 for count of "g.V()"
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment