anchor.diff:  g.V().values('age').is(32)
   g.V().values('age').is(lte(30))
   g.V().values('age').is(inside(30, 40))
  -g.V().has(__.in('created').count().is(1l)).values('name') <1>
  -g.V().has(__.in('created').count().is(gte(2l))).values('name') <2>
  -g.V().has(__.in('created').values('age').
  +g.V().where(__.in('created').count().is(1l)).values('name') <1>
  +g.V().where(__.in('created').count().is(gte(2l))).values('name') <2>
  +g.V().where(__.in('created').values('age').
                              mean().is(inside(30d, 35d))).values('name') <3>
   ----
   
  
positive.code: 
  [gremlin-groovy,modern]
  ----
  g.V().has(outE('created').or().outE('knows')).values('name')
  ----
  
  [[order-step]]
  
negative.code: <3> Which of marko's collaborators have worked on more than 1 project? (using a traversal)
  
  IMPORTANT: Please see <<using-where-with-match,`match().where()`>> and <<using-where-with-select,`select().where()`>> for how `where()` can be used in conjunction with `Map<String,Object>` projecting steps -- i.e. `Scope.local`.
  
  A few more examples of filtering an arbitrary object based on a anonymous traversal is provided below.
  
  [gremlin-groovy,modern]
  ----
  g.V().where(out('created')).values('name') <1>
  g.V().out('knows').where(out('created')).values('name') <2>
  g.V().where(out('created').count().is(gte(2L))).values('name') <3>
  g.V().where(out('knows').where(out('created'))).values('name') <4>
  ----
  
  <1> What are the names of the people who have created a project?
  <2> What are the names of the people that are known by someone one and have created a project?
  <3> What are the names of the people how have created two or more projects?
  <4> What are the names of the people who know someone that has created a project? (This only works in OLTP -- see the `WARNING` below)
  
  WARNING: The anonymous traversal of `where()` processes the current object "locally". In OLAP, where the atomic unit of computing is the the vertex and its local "star graph," it is important that the anonymous traversal does not leave the confines of the vertex's star graph. In other words, it can not traverse to an adjacent vertex's properties or edges.
  
  [[a-note-on-barrier-steps]]
  A Note on Barrier Steps
  