[ https://issues.apache.org/jira/browse/TINKERPOP-2136?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16748807#comment-16748807 ]
Daniel Kuppitz commented on TINKERPOP-2136: ------------------------------------------- I just go ahead and merge the changes into {{tp33}} and {{master}}. Not worth a PR as it's just a minor fix in the user docs. > Inside lower bound inclusion (documentation) > -------------------------------------------- > > Key: TINKERPOP-2136 > URL: https://issues.apache.org/jira/browse/TINKERPOP-2136 > Project: TinkerPop > Issue Type: Improvement > Components: process > Affects Versions: 3.3.5 > Reporter: Martijn Dwars > Assignee: Daniel Kuppitz > Priority: Minor > > On [http://tinkerpop.apache.org/docs/current/reference/#has-step] there is an > example: > {code:java} > g.V().has('age',inside(20,30)).values('age') // 1 > {code} > with the comment: > {code:java} > Find all vertices whose ages are between 20 (inclusive) and 30 (exclusive). > {code} > But if I run this in the Gremlin Groovy shell I see: > {code:java} > gremlin> g.V().has('age', inside(10, 30)).toString() > ==>[GraphStep(vertex,[]), HasStep([age.and(gt(10), lt(30))])] > {code} > which means the lower bound and upper bound are both exclusive. In > particular, the lower bound is exclusive, _not_ inclusive. Right? -- This message was sent by Atlassian JIRA (v7.6.3#76005)