Minor Description
On http://tinkerpop.apache.org/docs/current/reference/#has-step there is an example:
g.V().has('age',inside(20,30)).values('age') // 1
with the comment:
Find all vertices whose ages are between 20 (inclusive) and 30 (exclusive).
But if I run this in the Gremlin Groovy shell I see:
gremlin> g.V().has('age', inside(10, 30)).toString()
==>[GraphStep(vertex,[]), HasStep([age.and(gt(10), lt(30))])]
which means the lower bound and upper bound are both exclusive. In particular, the lower bound is exclusive, not inclusive. Right?