Github user spmallette commented on a diff in the pull request:

    https://github.com/apache/tinkerpop/pull/838#discussion_r191529207
  
    --- Diff: 
gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/branch/RepeatStep.java
 ---
    @@ -273,11 +300,40 @@ public RepeatEndStep(final Traversal.Admin traversal) 
{
                 super(traversal);
             }
     
    +        final LinkedList<Traverser.Admin<S>> stashedStarts = new 
LinkedList<>();
    --- End diff --
    
    Have you given any thought to the memory requirements of `stashedStarts`? 
Seems like that approach could be really intensive for a large graph (i.e. a 
traversal that touches a lot of data)? any thoughts?


---

Reply via email to