[tinkerpop] 03/03: TINKERPOP-2238 Fixed GraphComputerTest iterator leak

[sp...@apache.org]

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

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

commit d89bb7861008245a9608967df9d018c54efcf062
Author: Stephen Mallette <sp...@genoprime.com>
AuthorDate: Mon Jun 17 17:24:27 2019 -0400

    TINKERPOP-2238 Fixed GraphComputerTest iterator leak
---
 .../tinkerpop/gremlin/process/computer/GraphComputerTest.java      | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/computer/GraphComputerTest.java b/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/computer/GraphComputerTest.java
index b277894..4d4d4d2 100644
--- a/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/computer/GraphComputerTest.java
+++ b/gremlin-test/src/main/java/org/apache/tinkerpop/gremlin/process/computer/GraphComputerTest.java
@@ -47,6 +47,7 @@ import org.apache.tinkerpop.gremlin.structure.Graph;
 import org.apache.tinkerpop.gremlin.structure.Property;
 import org.apache.tinkerpop.gremlin.structure.Vertex;
 import org.apache.tinkerpop.gremlin.structure.VertexProperty;
+import org.apache.tinkerpop.gremlin.structure.util.CloseableIterator;
 import org.apache.tinkerpop.gremlin.structure.util.StringFactory;
 import org.apache.tinkerpop.gremlin.util.iterator.IteratorUtils;
 import org.javatuples.Pair;
@@ -2224,7 +2225,11 @@ public class GraphComputerTest extends AbstractGremlinProcessTest {
         assertEquals(6l, result.graph().traversal().V().properties("v3").count().next().longValue());
         assertEquals(6l, result.graph().traversal().V().<String>values("name").dedup().count().next().longValue());
         assertEquals(1l, result.graph().traversal().V().<String>values("v3").dedup().count().next().longValue());
-        assertEquals("shouldExist", result.graph().traversal().V().<String>values("v3").dedup().next());
+
+        final Traversal<Vertex,String> t = result.graph().traversal().V().<String>values("v3").dedup();
+        assertEquals("shouldExist", t.next());
+        CloseableIterator.closeIterator(t);
+
         ///
         assertFalse(result.memory().exists("m1"));
         assertFalse(result.memory().exists("m2"));