anchor.diff:  link:++https://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#fail--++[`fail()`],
   link:++https://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#fail-java.lang.String-++[`fail(String)`]
   
  +[[filter-step]]
  +=== Filter Step
  +
  +The `filter()` step maps the traverser from the current object to either `true` or `false` where the latter will not
  +pass the traverser to the next step in the process. Please see the <<general-steps, General Steps>> section for more
  +information.
  +
  +*Additional References*
  +
  +link:++https://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#filter-org.apache.tinkerpop.gremlin.process.traversal.Traversal-++[`map(Traversal)`]
  +
  +[[flatmap-step]]
  +=== FlatMap Step
  +
  +The `flatMap()` step maps the traverser from the current object to an `Iterator` of objects for the next step in the
  +process. Please see the <<general-steps, General Steps>> section for more information.
  +
  +*Additional References*
  +
  +link:++https://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#flatMap-org.apache.tinkerpop.gremlin.process.traversal.Traversal-++[`map(Traversal)`]
   
   [[fold-step]]
   === Fold Step
  
positive.code: 
  link:++https://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#until-java.util.function.Predicate-++[`until(Predicate)`],
  link:++https://tinkerpop.apache.org/javadocs/x.y.z/core/org/apache/tinkerpop/gremlin/process/traversal/dsl/graph/GraphTraversal.html#until-org.apache.tinkerpop.gremlin.process.traversal.Traversal-++[`until(Traversal)`]
  
  [[value-step]]
  === Value Step
  
negative.code: Finally, <<explain-step,`explain()`>>-step is also a terminal step and is described in its own section.
  
  [[addedge-step]]
  === AddE Step
  
  link:http://en.wikipedia.org/wiki/Automated_reasoning[Reasoning] is the process of making explicit what is implicit
  in the data. What is explicit in a graph are the objects of the graph -- i.e. vertices and edges. What is implicit
  