You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tinkerpop.apache.org by sp...@apache.org on 2023/01/05 13:55:55 UTC

[tinkerpop] branch master updated: TINKERPOP-2816 Removed test that requires order

This is an automated email from the ASF dual-hosted git repository.

spmallette pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/tinkerpop.git


The following commit(s) were added to refs/heads/master by this push:
     new 0396aa67d6 TINKERPOP-2816 Removed test that requires order
     new 0b1f1ee46c Merge branch '3.6-dev'
0396aa67d6 is described below

commit 0396aa67d6c2d98a5d4b71c3f34a889112dc67f1
Author: Stephen Mallette <st...@amazon.com>
AuthorDate: Thu Jan 5 08:53:20 2023 -0500

    TINKERPOP-2816 Removed test that requires order
    
    Don't think this test was examining anything specifically. It was migrated into cucumber as one of the old "complex" tests. Given it can't quite work right in this environment, it seems best to just remove it. CTR
---
 .../gremlin/test/features/integrated/Paths.feature | 26 ----------------------
 1 file changed, 26 deletions(-)

diff --git a/gremlin-test/src/main/resources/org/apache/tinkerpop/gremlin/test/features/integrated/Paths.feature b/gremlin-test/src/main/resources/org/apache/tinkerpop/gremlin/test/features/integrated/Paths.feature
index 5bbd74ff9b..ca09ee1cda 100644
--- a/gremlin-test/src/main/resources/org/apache/tinkerpop/gremlin/test/features/integrated/Paths.feature
+++ b/gremlin-test/src/main/resources/org/apache/tinkerpop/gremlin/test/features/integrated/Paths.feature
@@ -18,32 +18,6 @@
 @StepClassIntegrated
 Feature: Step - paths
 
-  @GraphComputerVerificationStarGraphExceeded
-  Scenario: g_V_playlist_paths
-    Given the grateful graph
-    And the traversal of
-      """
-      g.V().has("name", "Bob_Dylan").
-        in("sungBy").order().by('name').as("a").
-        repeat(__.out().order().by('name').simplePath().from("a")).
-          until(__.out("writtenBy").has("name", "Johnny_Cash")).limit(1).as("b").
-        repeat(__.out().order().by('name').as("c").simplePath().from("b").to("c")).
-          until(__.out("sungBy").has("name", "Grateful_Dead")).limit(1).
-        path().from("a").unfold().
-        project("song", "artists").
-          by("name").
-          by(__.coalesce(__.out("sungBy", "writtenBy").dedup().values("name").order(), __.constant("Unknown")).fold())
-      """
-    When iterated to list
-    Then the result should be unordered
-      | result |
-      | m[{"song": "CHIMES OF FREEDOM", "artists": ["Bob_Dylan"]}] |
-      | m[{"song": "QUEEN JANE", "artists": ["Unknown"]}] |
-      | m[{"song": "ALTHEA", "artists": ["Garcia","Hunter"]}] |
-      | m[{"song": "BIG RIVER", "artists": ["Johnny_Cash","Weir"]}] |
-      | m[{"song": "HES GONE", "artists": ["Garcia","Hunter"]}] |
-      | m[{"song": "CAUTION", "artists": ["Grateful_Dead"]}] |
-
   @GraphComputerVerificationReferenceOnly
   Scenario: g_V_shortestpath
     Given the modern graph