Repository: cayleygraph/cayley
Pull request #822 (2019-09-15 19:25:57)

Gizmo: make methods lower case


<!-- Reviewable:start -->
This change is [<img src="https://reviewable.io/review_button.svg" height="34" align="absmiddle" alt="Reviewable"/>](https://reviewable.io/reviews/cayleygraph/cayley/822)
<!-- Reviewable:end -->


iddan: Made requested changes
iddan: @dennwc I think it's ready for another review.
dennwc: Sorry for not being specific enough, but can you please make the same change and allow other methods as well, so we don't break _any_ old clients, but will still introduce a lower-case names as an alternative?
iddan: All relevant methods are now accessible capitalized, and not.
iddan: Resolved conflicts

Patch:
diff --git a/docs/Getting-Started.md b/docs/Getting-Started.md
index 0dc8c04..86b866b 100644
--- a/docs/Getting-Started.md
+++ b/docs/Getting-Started.md
@@ -49,7 +49,7 @@ To select all vertices in the graph call, limit to 5 first results.
 `g` and `V` are synonyms for `graph` and `Vertex` respectively, as they are quite common.
 
 ```javascript
-g.V().GetLimit(5);
+g.V().getLimit(5);
 ```
 
 ### Match a property of a vertex
@@ -58,13 +58,13 @@ Find vertex with property "Humphrey Bogart"
 
 ```javascript
 g.V()
-  .Has("<name>", "Humphrey Bogart")
-  .All();
+  .has("<name>", "Humphrey Bogart")
+  .all();
 ```
 
 You may start to notice a pattern here: with Gizmo, the query lines tend to:
 
-Start somewhere in the graph | Follow a path | Run the query with "All" or "GetLimit"
+Start somewhere in the graph | Follow a path | Run the query with "all" or "getLimit"
 
 ### Match a complex path
 
@@ -72,11 +72,11 @@ Get the list of actors in the film
 
 ```javascript
 g.V()
-  .Has("<name>", "Casablanca")
-  .Out("</film/film/starring>")
-  .Out("</film/performance/actor>")
-  .Out("<name>")
-  .All();
+  .has("<name>", "Casablanca")
+  .out("</film/film/starring>")
+  .out("</film/performance/actor>")
+  .out("<name>")
+  .all();
 ```
 
 ### Match
@@ -86,14 +86,14 @@ This is starting to get long. Let's use a Morphism, a pre-defined path stored in
 ```javascript
 var filmToActor = g
   .Morphism()
-  .Out("</film/film/starring>")
-  .Out("</film/performance/actor>");
+  .out("</film/film/starring>")
+  .out("</film/performance/actor>");
 
 g.V()
-  .Has("<name>", "Casablanca")
-  .Follow(filmToActor)
-  .Out("<name>")
-  .All();
+  .has("<name>", "Casablanca")
+  .follow(filmToActor)
+  .out("<name>")
+  .all();
 ```
 
 To learn more about querying see [Gizmo Documentation](GizmoAPI.md)
diff --git a/docs/GizmoAPI.md b/docs/GizmoAPI.md
index 8ec612d..e146b1f 100644
--- a/docs/GizmoAPI.md
+++ b/docs/GizmoAPI.md
@@ -1,4 +1,5 @@
 # Gizmo API
+
 ![Autogenerated file](https://img.shields.io/badge/file-generated-orange.svg)
 
 ## The `graph` object
@@ -8,70 +9,62 @@ Name: `graph`, Alias: `g`
 This is the only special object in the environment, generates the query objects.
 Under the hood, they're simple objects that get compiled to a Go iterator tree when executed.
 
-
-### `graph.AddDefaultNamespaces()`
+### `graph.addDefaultNamespaces()`
 
 AddDefaultNamespaces register all default namespaces for automatic IRI resolution.
 
-
-### `graph.AddNamespace(pref, ns)`
+### `graph.addNamespace(pref, ns)`
 
 AddNamespace associates prefix with a given IRI namespace.
 
-
-### `graph.Emit(*)`
+### `graph.emit(*)`
 
 Emit adds data programmatically to the JSON result list. Can be any JSON type.
 
 ```javascript
-g.Emit({name:"bob"}) // push {"name":"bob"} as a result
+g.emit({ name: "bob" }); // push {"name":"bob"} as a result
 ```
 
-
-### `graph.LoadNamespaces()`
+### `graph.loadNamespaces()`
 
 LoadNamespaces loads all namespaces saved to graph.
 
-
 ### `graph.M()`
 
 M is a shorthand for Morphism.
 
-
 ### `graph.Morphism()`
 
 Morphism creates a morphism path object. Unqueryable on it's own, defines one end of the path.
 Saving these to variables with
 
 ```javascript
-var shorterPath = graph.Morphism().Out("foo").Out("bar")
+var shorterPath = graph
+  .Morphism()
+  .out("foo")
+  .out("bar");
 ```
 
-is the common use case. See also: path.Follow(), path.FollowR().
-
+is the common use case. See also: path.follow(), path.followR().
 
-### `graph.Uri(s)`
+### `graph.IRI(s)`
 
 Uri creates an IRI values from a given string.
 
-
 ### `graph.V(*)`
 
 V is a shorthand for Vertex.
 
-
 ### `graph.Vertex([nodeId],[nodeId]...)`
 
 Vertex starts a query path at the given vertex/vertices. No ids means "all vertices".
 
-
 Arguments:
 
-* `nodeId` (Optional): A string or list of strings representing the starting vertices.
+- `nodeId` (Optional): A string or list of strings representing the starting vertices.
 
 Returns: Path object
 
-
 ## Path object
 
 Both `.Morphism()` and `.Vertex()` create path objects, which provide the following traversal methods.
@@ -105,23 +98,19 @@ according to the `<smart_graph>` label, eg, the quad:
 <greg> <status> "smart_person" <smart_graph> .
 ```
 
-
-### `path.All()`
+### `path.all()`
 
 All executes the query and adds the results, with all tags, as a string-to-string (tag to node) map in the output set, one for each path that a traversal could take.
 
-
-### `path.And(path)`
+### `path.and(path)`
 
 And is an alias for Intersect.
 
-
-### `path.As(tags)`
+### `path.as(tags)`
 
 As is an alias for Tag.
 
-
-### `path.Back(tag)`
+### `path.back([tag])`
 
 Back returns current path to a set of nodes on a given tag, preserving all constraints.
 
@@ -131,9 +120,10 @@ Useful for traversing back in queries and taking another route for things that h
 
 Arguments:
 
-* `tag`: A previous tag in the query to jump back to.
+- `tag`: A previous tag in the query to jump back to.
 
 Example:
+
 ```javascript
 // Start from all nodes, save them into start, follow any status links,
 // jump back to the starting node, and find who follows them. Return the result.
@@ -146,80 +136,90 @@ Example:
 //   {"id": "<dani>", "start": "<greg>"},
 //   {"id": "<fred>", "start": "<greg>"},
 //   {"id": "<fred>", "start": "<greg>"}
-g.V().Tag("start").Out("<status>").Back("start").In("<follows>").All()
+g.V()
+  .Tag("start")
+  .out("<status>")
+  .back("start")
+  .in("<follows>")
+  .all();
 ```
 
-
-### `path.Both([predicatePath], [tags])`
+### `path.both([predicatePath], [tags])`
 
 Both follow the predicate in either direction. Same as Out or In.
 
-
 Example:
+
 ```javascript
 // Find all followers/followees of fred. Returns bob, emily and greg
-g.V("<fred>").Both("<follows>").All()
+g.V("<fred>")
+  .both("<follows>")
+  .all();
 ```
 
-
-### `path.Count()`
+### `path.count()`
 
 Count returns a number of results and returns it as a value.
 
 Example:
+
 ```javascript
 // Save count as a variable
-var n = g.V().Count()
+var n = g.V().count();
 // Send it as a query result
-g.Emit(n)
+g.emit(n);
 ```
 
-
-### `path.Difference(path)`
+### `path.difference(path)`
 
 Difference is an alias for Except.
 
-
-### `path.Except(path)`
+### `path.except(path)`
 
 Except removes all paths which match query from current path.
 
-In a set-theoretic sense, this is (A - B). While `g.V().Except(path)` to achieve `U - B = !B` is supported, it's often very slow.
+In a set-theoretic sense, this is (A - B). While `g.V().except(path)` to achieve `U - B = !B` is supported, it's often very slow.
 Example:
+
 ```javascript
-var cFollows = g.V("<charlie>").Out("<follows>")
-var dFollows = g.V("<dani>").Out("<follows>")
+var cFollows = g.V("<charlie>").out("<follows>");
+var dFollows = g.V("<dani>").out("<follows>");
 // People followed by both charlie (bob and dani) and dani (bob and greg) -- returns bob.
-cFollows.Except(dFollows).All()   // The set (dani) -- what charlie follows that dani does not also follow.
-// Equivalently, g.V("<charlie>").Out("<follows>").Except(g.V("<dani>").Out("<follows>")).All()
+cFollows.except(dFollows).all(); // The set (dani) -- what charlie follows that dani does not also follow.
+// Equivalently, g.V("<charlie>").out("<follows>").except(g.V("<dani>").out("<follows>")).all()
 ```
 
-
-### `path.Filter(args)`
+### `path.filter(args)`
 
 Filter applies constraints to a set of nodes. Can be used to filter values by range or match strings.
 
-#### `path.Filter(regex(expression, includeIRIs))`
+#### `path.filter(regex(expression, includeIRIs))`
 
 Filters by match a regular expression ([syntax](https://github.com/google/re2/wiki/Syntax)). By default works only on literals unless includeEntities is set to `true`.
 
-### `path.Follow(path)`
+### `path.follow(path)`
 
 Follow is the way to use a path prepared with Morphism. Applies the path chain on the morphism object to the current path.
 
 Starts as if at the g.M() and follows through the morphism path.
 
 Example:
+
 ```javascript
-var friendOfFriend = g.Morphism().Out("<follows>").Out("<follows>")
+var friendOfFriend = g
+  .Morphism()
+  .out("<follows>")
+  .out("<follows>");
 // Returns the followed people of who charlie follows -- a simplistic "friend of my friend"
 // and whether or not they have a "cool" status. Potential for recommending followers abounds.
 // Returns bob and greg
-g.V("<charlie>").Follow(friendOfFriend).Has("<status>", "cool_person").All()
+g.V("<charlie>")
+  .follow(friendOfFriend)
+  .has("<status>", "cool_person")
+  .all();
 ```
 
-
-### `path.FollowR(path)`
+### `path.followR(path)`
 
 FollowR is the same as Follow but follows the chain in the reverse direction. Flips "In" and "Out" where appropriate,
 the net result being a virtual predicate followed in the reverse direction.
@@ -227,338 +227,386 @@ the net result being a virtual predicate followed in the reverse direction.
 Starts at the end of the morphism and follows it backwards (with appropriate flipped directions) to the g.M() location.
 
 Example:
+
 ```javascript
-var friendOfFriend = g.Morphism().Out("<follows>").Out("<follows>")
+var friendOfFriend = g
+  .Morphism()
+  .out("<follows>")
+  .out("<follows>");
 // Returns the third-tier of influencers -- people who follow people who follow the cool people.
 // Returns charlie (from bob), charlie (from greg), bob and emily
-g.V().Has("<status>", "cool_person").FollowR(friendOfFriend).All()
+g.V()
+  .has("<status>", "cool_person")
+  .followR(friendOfFriend)
+  .all();
 ```
 
-
-### `path.FollowRecursive(*)`
+### `path.followRecursive(*)`
 
 FollowRecursive is the same as Follow but follows the chain recursively.
 
 Starts as if at the g.M() and follows through the morphism path multiple times, returning all nodes encountered.
 
 Example:
+
 ```javascript
-var friend = g.Morphism().Out("<follows>")
+var friend = g.Morphism().out("<follows>");
 // Returns all people in Charlie's network.
 // Returns bob and dani (from charlie), fred (from bob) and greg (from dani).
-g.V("<charlie>").FollowRecursive(friend).All()
+g.V("<charlie>")
+  .followRecursive(friend)
+  .all();
 ```
 
-
-### `path.ForEach(callback) or (limit, callback)`
+### `path.forEach(callback) or (limit, callback)`
 
 ForEach calls callback(data) for each result, where data is the tag-to-string map as in All case.
 
-
 Arguments:
 
-* `limit` (Optional): An integer value on the first `limit` paths to process.
-* `callback`: A javascript function of the form `function(data)`
+- `limit` (Optional): An integer value on the first `limit` paths to process.
+- `callback`: A javascript function of the form `function(data)`
 
 Example:
+
 ```javascript
-// Simulate query.All().All()
-graph.V("<alice>").ForEach(function(d) { g.Emit(d) } )
+// Simulate query.all().all()
+graph.V("<alice>").ForEach(function(d) {
+  g.emit(d);
+});
 ```
 
-
-### `path.GetLimit(limit)`
+### `path.getLimit(limit)`
 
 GetLimit is the same as All, but limited to the first N unique nodes at the end of the path, and each of their possible traversals.
 
-
-### `path.Has(predicate, object)`
+### `path.has(predicate, object)`
 
 Has filters all paths which are, at this point, on the subject for the given predicate and object,
 but do not follow the path, merely filter the possible paths.
 
 Usually useful for starting with all nodes, or limiting to a subset depending on some predicate/value pair.
 
-
-
 Arguments:
 
-* `predicate`: A string for a predicate node.
-* `object`: A string for a object node or a set of filters to find it.
+- `predicate`: A string for a predicate node.
+- `object`: A string for a object node or a set of filters to find it.
 
 Example:
+
 ```javascript
 // Start from all nodes that follow bob -- results in alice, charlie and dani
-g.V().Has("<follows>", "<bob>").All()
+g.V()
+  .has("<follows>", "<bob>")
+  .all();
 // People charlie follows who then follow fred. Results in bob.
-g.V("<charlie>").Out("<follows>").Has("<follows>", "<fred>").All()
+g.V("<charlie>")
+  .out("<follows>")
+  .has("<follows>", "<fred>")
+  .all();
 // People with friends who have names sorting lower then "f".
-g.V().Has("<follows>", gt("<f>")).All()
+g.V()
+  .has("<follows>", gt("<f>"))
+  .all();
 ```
 
-
-### `path.HasR(*)`
+### `path.hasR(*)`
 
 HasR is the same as Has, but sets constraint in reverse direction.
 
-
-### `path.In([predicatePath], [tags])`
+### `path.in([predicatePath], [tags])`
 
 In is inverse of Out.
 Starting with the nodes in `path` on the object, follow the quads with predicates defined by `predicatePath` to their subjects.
 
-
 Arguments:
 
-* `predicatePath` (Optional): One of:
-  * null or undefined: All predicates pointing into this node
-  * a string: The predicate name to follow into this node
-  * a list of strings: The predicates to follow into this node
-  * a query path object: The target of which is a set of predicates to follow.
-* `tags` (Optional): One of:
-  * null or undefined: No tags
-  * a string: A single tag to add the predicate used to the output set.
-  * a list of strings: Multiple tags to use as keys to save the predicate used to the output set.
+- `predicatePath` (Optional): One of:
+  - null or undefined: All predicates pointing into this node
+  - a string: The predicate name to follow into this node
+  - a list of strings: The predicates to follow into this node
+  - a query path object: The target of which is a set of predicates to follow.
+- `tags` (Optional): One of:
+  - null or undefined: No tags
+  - a string: A single tag to add the predicate used to the output set.
+  - a list of strings: Multiple tags to use as keys to save the predicate used to the output set.
 
 Example:
 
 ```javascript
 // Find the cool people, bob, dani and greg
-g.V("cool_person").In("<status>").All()
+g.V("cool_person")
+  .in("<status>")
+  .all();
 // Find who follows bob, in this case, alice, charlie, and dani
-g.V("<bob>").In("<follows>").All()
+g.V("<bob>")
+  .in("<follows>")
+  .all();
 // Find who follows the people emily follows, namely, bob and emily
-g.V("<emily>").Out("<follows>").In("<follows>").All()
+g.V("<emily>")
+  .out("<follows>")
+  .in("<follows>")
+  .all();
 ```
 
-
-### `path.InPredicates()`
+### `path.inPredicates()`
 
 InPredicates gets the list of predicates that are pointing in to a node.
 
 Example:
+
 ```javascript
 // bob only has "<follows>" predicates pointing inward
 // returns "<follows>"
-g.V("<bob>").InPredicates().All()
+g.V("<bob>")
+  .inPredicates()
+  .all();
 ```
 
-
-### `path.Intersect(path)`
+### `path.intersect(path)`
 
 Intersect filters all paths by the result of another query path.
 
 This is essentially a join where, at the stage of each path, a node is shared.
 Example:
+
 ```javascript
-var cFollows = g.V("<charlie>").Out("<follows>")
-var dFollows = g.V("<dani>").Out("<follows>")
+var cFollows = g.V("<charlie>").out("<follows>");
+var dFollows = g.V("<dani>").out("<follows>");
 // People followed by both charlie (bob and dani) and dani (bob and greg) -- returns bob.
-cFollows.Intersect(dFollows).All()
-// Equivalently, g.V("<charlie>").Out("<follows>").And(g.V("<dani>").Out("<follows>")).All()
+cFollows.intersect(dFollows).all();
+// Equivalently, g.V("<charlie>").out("<follows>").And(g.V("<dani>").out("<follows>")).all()
 ```
 
-
-### `path.Is(node, [node..])`
+### `path.is(node, [node..])`
 
 Filter all paths to ones which, at this point, are on the given node.
 
-
 Arguments:
 
-* `node`: A string for a node. Can be repeated or a list of strings.
+- `node`: A string for a node. Can be repeated or a list of strings.
 
 Example:
+
 ```javascript
 // Starting from all nodes in the graph, find the paths that follow bob.
-// Results in three paths for bob (from alice, charlie and dani).All()
-g.V().Out("<follows>").Is("<bob>").All()
+// Results in three paths for bob (from alice, charlie and dani).all()
+g.V()
+  .out("<follows>")
+  .is("<bob>")
+  .all();
 ```
 
-
-### `path.LabelContext([labelPath], [tags])`
+### `path.labelContext([labelPath], [tags])`
 
 LabelContext sets (or removes) the subgraph context to consider in the following traversals.
 Affects all In(), Out(), and Both() calls that follow it. The default LabelContext is null (all subgraphs).
 
-
 Arguments:
 
-* `predicatePath` (Optional): One of:
-  * null or undefined: In future traversals, consider all edges, regardless of subgraph.
-  * a string: The name of the subgraph to restrict traversals to.
-  * a list of strings: A set of subgraphs to restrict traversals to.
-  * a query path object: The target of which is a set of subgraphs.
-* `tags` (Optional): One of:
-  * null or undefined: No tags
-  * a string: A single tag to add the last traversed label to the output set.
-  * a list of strings: Multiple tags to use as keys to save the label used to the output set.
+- `predicatePath` (Optional): One of:
+  - null or undefined: In future traversals, consider all edges, regardless of subgraph.
+  - a string: The name of the subgraph to restrict traversals to.
+  - a list of strings: A set of subgraphs to restrict traversals to.
+  - a query path object: The target of which is a set of subgraphs.
+- `tags` (Optional): One of:
+  - null or undefined: No tags
+  - a string: A single tag to add the last traversed label to the output set.
+  - a list of strings: Multiple tags to use as keys to save the label used to the output set.
 
 Example:
+
 ```javascript
 // Find the status of people Dani follows
-g.V("<dani>").Out("<follows>").Out("<status>").All()
+g.V("<dani>")
+  .out("<follows>")
+  .out("<status>")
+  .all();
 // Find only the statuses provided by the smart_graph
-g.V("<dani>").Out("<follows>").LabelContext("<smart_graph>").Out("<status>").All()
+g.V("<dani>")
+  .out("<follows>")
+  .labelContext("<smart_graph>")
+  .out("<status>")
+  .all();
 // Find all people followed by people with statuses in the smart_graph.
-g.V().LabelContext("<smart_graph>").In("<status>").LabelContext(null).In("<follows>").All()
+g.V()
+  .labelContext("<smart_graph>")
+  .in("<status>")
+  .labelContext(null)
+  .in("<follows>")
+  .all();
 ```
 
-
-### `path.Labels()`
+### `path.labels()`
 
 Labels gets the list of inbound and outbound quad labels
 
-
-### `path.Limit(limit)`
+### `path.limit(limit)`
 
 Limit limits a number of nodes for current path.
 
 Arguments:
 
-* `limit`: A number of nodes to limit results to.
+- `limit`: A number of nodes to limit results to.
 
 Example:
+
 ```javascript
 // Start from all nodes that follow bob, and limit them to 2 nodes -- results in alice and charlie
-g.V().Has("<follows>", "<bob>").Limit(2).All()
+g.V()
+  .has("<follows>", "<bob>")
+  .limit(2)
+  .all();
 ```
 
-
-### `path.Map(*)`
+### `path.map(*)`
 
 Map is a alias for ForEach.
 
-
-### `path.Or(path)`
+### `path.or(path)`
 
 Or is an alias for Union.
 
-
-### `path.Out([predicatePath], [tags])`
+### `path.out([predicatePath], [tags])`
 
 Out is the work-a-day way to get between nodes, in the forward direction.
 Starting with the nodes in `path` on the subject, follow the quads with predicates defined by `predicatePath` to their objects.
 
-
 Arguments:
 
-* `predicatePath` (Optional): One of:
-  * null or undefined: All predicates pointing out from this node
-  * a string: The predicate name to follow out from this node
-  * a list of strings: The predicates to follow out from this node
-  * a query path object: The target of which is a set of predicates to follow.
-* `tags` (Optional): One of:
-  * null or undefined: No tags
-  * a string: A single tag to add the predicate used to the output set.
-  * a list of strings: Multiple tags to use as keys to save the predicate used to the output set.
+- `predicatePath` (Optional): One of:
+  - null or undefined: All predicates pointing out from this node
+  - a string: The predicate name to follow out from this node
+  - a list of strings: The predicates to follow out from this node
+  - a query path object: The target of which is a set of predicates to follow.
+- `tags` (Optional): One of:
+  - null or undefined: No tags
+  - a string: A single tag to add the predicate used to the output set.
+  - a list of strings: Multiple tags to use as keys to save the predicate used to the output set.
 
 Example:
 
 ```javascript
 // The working set of this is bob and dani
-g.V("<charlie>").Out("<follows>").All()
+g.V("<charlie>")
+  .out("<follows>")
+  .all();
 // The working set of this is fred, as alice follows bob and bob follows fred.
-g.V("<alice>").Out("<follows>").Out("<follows>").All()
+g.V("<alice>")
+  .out("<follows>")
+  .out("<follows>")
+  .all();
 // Finds all things dani points at. Result is bob, greg and cool_person
-g.V("<dani>").Out().All()
+g.V("<dani>")
+  .out()
+  .all();
 // Finds all things dani points at on the status linkage.
 // Result is bob, greg and cool_person
-g.V("<dani>").Out(["<follows>", "<status>"]).All()
+g.V("<dani>")
+  .out(["<follows>", "<status>"])
+  .all();
 // Finds all things dani points at on the status linkage, given from a separate query path.
 // Result is {"id": "cool_person", "pred": "<status>"}
-g.V("<dani>").Out(g.V("<status>"), "pred").All()
+g.V("<dani>")
+  .out(g.V("<status>"), "pred")
+  .all();
 ```
 
-
-### `path.OutPredicates()`
+### `path.outPredicates()`
 
 OutPredicates gets the list of predicates that are pointing out from a node.
 
 Example:
+
 ```javascript
 // bob has "<follows>" and "<status>" edges pointing outwards
 // returns "<follows>", "<status>"
-g.V("<bob>").OutPredicates().All()
+g.V("<bob>")
+  .outPredicates()
+  .all();
 ```
 
-
-### `path.Save(predicate, tag)`
+### `path.save(predicate, tag)`
 
 Save saves the object of all quads with predicate into tag, without traversal.
 
-
 Arguments:
 
-* `predicate`: A string for a predicate node.
-* `tag`: A string for a tag key to store the object node.
+- `predicate`: A string for a predicate node.
+- `tag`: A string for a tag key to store the object node.
 
 Example:
+
 ```javascript
 // Start from dani and bob and save who they follow into "target"
 // Returns:
 //   {"id" : "<bob>", "target": "<fred>" },
 //   {"id" : "<dani>", "target": "<bob>" },
 //   {"id" : "<dani>", "target": "<greg>" }
-g.V("<dani>", "<bob>").Save("<follows>", "target").All()
+g.V("<dani>", "<bob>")
+  .save("<follows>", "target")
+  .all();
 ```
 
-
-### `path.SaveInPredicates(tag)`
+### `path.saveInPredicates(tag)`
 
 SaveInPredicates tags the list of predicates that are pointing in to a node.
 
 Example:
+
 ```javascript
 // bob only has "<follows>" predicates pointing inward
 // returns {"id":"<bob>", "pred":"<follows>"}
-g.V("<bob>").SaveInPredicates("pred").All()
+g.V("<bob>")
+  .saveInPredicates("pred")
+  .all();
 ```
 
-
-### `path.SaveOpt(*)`
+### `path.saveOpt(*)`
 
 SaveOpt is the same as Save, but returns empty tags if predicate does not exists.
 
-
-### `path.SaveOptR(*)`
+### `path.saveOptR(*)`
 
 SaveOptR is the same as SaveOpt, but tags values via reverse predicate.
 
-
-### `path.SaveOutPredicates(tag)`
+### `path.saveOutPredicates(tag)`
 
 SaveOutPredicates tags the list of predicates that are pointing out from a node.
 
 Example:
+
 ```javascript
 // bob has "<follows>" and "<status>" edges pointing outwards
 // returns {"id":"<bob>", "pred":"<follows>"}
-g.V("<bob>").SaveInPredicates("pred").All()
+g.V("<bob>")
+  .saveInPredicates("pred")
+  .all();
 ```
 
-
-### `path.SaveR(*)`
+### `path.saveR(*)`
 
 SaveR is the same as Save, but tags values via reverse predicate.
 
-
-### `path.Skip(offset)`
+### `path.skip(offset)`
 
 Skip skips a number of nodes for current path.
 
 Arguments:
 
-* `offset`: A number of nodes to skip.
+- `offset`: A number of nodes to skip.
 
 Example:
+
 ```javascript
 // Start from all nodes that follow bob, and skip 2 nodes -- results in dani
-g.V().Has("<follows>", "<bob>").Skip(2).All()
+g.V()
+  .has("<follows>", "<bob>")
+  .skip(2)
+  .all();
 ```
 
-
-### `path.Tag(tags)`
+### `path.tag(tags)`
 
 Tag saves a list of nodes to a given tag.
 
@@ -567,8 +615,9 @@ The simplest thing to do is to add a tag anywhere you'd like to put each node in
 
 Arguments:
 
-* `tag`: A string or list of strings to act as a result key. The value for tag was the vertex the path was on at the time it reached "Tag"
-Example:
+- `tag`: A string or list of strings to act as a result key. The value for tag was the vertex the path was on at the time it reached "Tag"
+  Example:
+
 ```javascript
 // Start from all nodes, save them into start, follow any status links, and return the result.
 // Results are:
@@ -577,45 +626,52 @@ Example:
 //   {"id": "cool_person", "start": "<greg>"},
 //   {"id": "smart_person", "start": "<emily>"},
 //   {"id": "smart_person", "start": "<greg>"}
-g.V().Tag("start").Out("<status>").All()
+g.V()
+  .tag("start")
+  .out("<status>")
+  .all();
 ```
 
-
-### `path.TagArray(*)`
+### `path.tagArray(*)`
 
 TagArray is the same as ToArray, but instead of a list of top-level nodes, returns an Array of tag-to-string dictionaries, much as All would, except inside the JS environment.
 
 Example:
+
 ```javascript
 // bobTags contains an Array of followers of bob (alice, charlie, dani).
-var bobTags = g.V("<bob>").Tag("name").In("<follows>").TagArray()
+var bobTags = g
+  .V("<bob>")
+  .tag("name")
+  .in("<follows>")
+  .tagArray();
 // nameValue should be the string "<bob>"
-var nameValue = bobTags[0]["name"]
+var nameValue = bobTags[0]["name"];
 ```
 
-
-### `path.TagValue()`
+### `path.tagValue()`
 
 TagValue is the same as TagArray, but limited to one result node. Returns a tag-to-string map.
 
-
-### `path.ToArray(*)`
+### `path.toArray(*)`
 
 ToArray executes a query and returns the results at the end of the query path as an JS array.
 
 Example:
+
 ```javascript
 // bobFollowers contains an Array of followers of bob (alice, charlie, dani).
-var bobFollowers = g.V("<bob>").In("<follows>").ToArray()
+var bobFollowers = g
+  .V("<bob>")
+  .in("<follows>")
+  .toArray();
 ```
 
-
-### `path.ToValue()`
+### `path.toValue()`
 
 ToValue is the same as ToArray, but limited to one result node.
 
-
-### `path.Union(path)`
+### `path.union(path)`
 
 Union returns the combined paths of the two queries.
 
@@ -624,16 +680,14 @@ they might have had different ways of getting there (and different tags).
 See also: `path.Tag()`
 
 Example:
+
 ```javascript
-var cFollows = g.V("<charlie>").Out("<follows>")
-var dFollows = g.V("<dani>").Out("<follows>")
+var cFollows = g.V("<charlie>").out("<follows>");
+var dFollows = g.V("<dani>").out("<follows>");
 // People followed by both charlie (bob and dani) and dani (bob and greg) -- returns bob (from charlie), dani, bob (from dani), and greg.
-cFollows.Union(dFollows).All()
+cFollows.union(dFollows).all();
 ```
 
-
-### `path.Unique()`
+### `path.unique()`
 
 Unique removes duplicate values from the path.
-
-
diff --git a/docs/api/swagger.yml b/docs/api/swagger.yml
index 39b9e67..64c64e1 100644
--- a/docs/api/swagger.yml
+++ b/docs/api/swagger.yml
@@ -366,7 +366,7 @@ paths:
             examples:
               gizmo:
                 summary: "Gizmo: first 10 nodes"
-                value: "g.V().GetLimit(10)"
+                value: "g.V().getLimit(10)"
               graphql:
                 summary: "GraphQL: first 10 nodes"
                 value: "{\n  nodes(first: 10){\n    id\n  }\n}"
diff --git a/query/gizmo/environ.go b/query/gizmo/environ.go
index 04553c3..4078277 100644
--- a/query/gizmo/environ.go
+++ b/query/gizmo/environ.go
@@ -36,12 +36,13 @@ import (
 //
 // This is the only special object in the environment, generates the query objects.
 // Under the hood, they're simple objects that get compiled to a Go iterator tree when executed.
+// Methods starting with "New" are accessible in JavaScript with a capital letter (e.g. NewV becomes V)
 type graphObject struct {
 	s *Session
 }
 
 // Uri creates an IRI values from a given string.
-func (g *graphObject) Uri(s string) quad.IRI {
+func (g *graphObject) NewIRI(s string) quad.IRI {
 	return quad.IRI(g.s.ns.FullIRI(s))
 }
 
@@ -61,8 +62,8 @@ func (g *graphObject) LoadNamespaces() error {
 }
 
 // V is a shorthand for Vertex.
-func (g *graphObject) V(call goja.FunctionCall) goja.Value {
-	return g.Vertex(call)
+func (g *graphObject) NewV(call goja.FunctionCall) goja.Value {
+	return g.NewVertex(call)
 }
 
 // Vertex starts a query path at the given vertex/vertices. No ids means "all vertices".
@@ -73,7 +74,7 @@ func (g *graphObject) V(call goja.FunctionCall) goja.Value {
 // * `nodeId` (Optional): A string or list of strings representing the starting vertices.
 //
 // Returns: Path object
-func (g *graphObject) Vertex(call goja.FunctionCall) goja.Value {
+func (g *graphObject) NewVertex(call goja.FunctionCall) goja.Value {
 	qv, err := toQuadValues(exportArgs(call.Arguments))
 	if err != nil {
 		return throwErr(g.s.vm, err)
@@ -86,18 +87,18 @@ func (g *graphObject) Vertex(call goja.FunctionCall) goja.Value {
 }
 
 // M is a shorthand for Morphism.
-func (g *graphObject) M() *pathObject {
-	return g.Morphism()
+func (g *graphObject) NewM() *pathObject {
+	return g.NewMorphism()
 }
 
 // Morphism creates a morphism path object. Unqueryable on it's own, defines one end of the path.
 // Saving these to variables with
 //
 //	// javascript
-//	var shorterPath = graph.Morphism().Out("foo").Out("bar")
+//	var shorterPath = graph.Morphism().out("foo").out("bar")
 //
-// is the common use case. See also: path.Follow(), path.FollowR().
-func (g *graphObject) Morphism() *pathObject {
+// is the common use case. See also: path.follow(), path.followR().
+func (g *graphObject) NewMorphism() *pathObject {
 	return &pathObject{
 		s:    g.s,
 		path: path.StartMorphism(),
@@ -107,7 +108,7 @@ func (g *graphObject) Morphism() *pathObject {
 // Emit adds data programmatically to the JSON result list. Can be any JSON type.
 //
 //	// javascript
-//	g.Emit({name:"bob"}) // push {"name":"bob"} as a result
+//	g.emit({name:"bob"}) // push {"name":"bob"} as a result
 func (g *graphObject) Emit(call goja.FunctionCall) goja.Value {
 	value := call.Argument(0)
 	if !goja.IsNull(value) && !goja.IsUndefined(value) {
@@ -119,6 +120,23 @@ func (g *graphObject) Emit(call goja.FunctionCall) goja.Value {
 	return goja.Null()
 }
 
+// Backwards compatibility
+func (g *graphObject) CapitalizedUri(s string) quad.IRI {
+	return g.NewIRI(s)
+}
+func (g *graphObject) CapitalizedAddNamespace(pref, ns string) {
+	g.AddNamespace(pref, ns)
+}
+func (g *graphObject) CapitalizedAddDefaultNamespaces() {
+	g.AddDefaultNamespaces()
+}
+func (g *graphObject) CapitalizedLoadNamespaces() error {
+	return g.LoadNamespaces()
+}
+func (g *graphObject) CapitalizedEmit(call goja.FunctionCall) goja.Value {
+	return g.Emit(call)
+}
+
 func oneStringType(fnc func(s string) quad.Value) func(vm *goja.Runtime, call goja.FunctionCall) goja.Value {
 	return func(vm *goja.Runtime, call goja.FunctionCall) goja.Value {
 		args := toStrings(exportArgs(call.Arguments))
diff --git a/query/gizmo/finals.go b/query/gizmo/finals.go
index 2f90e5f..85bc0cc 100644
--- a/query/gizmo/finals.go
+++ b/query/gizmo/finals.go
@@ -160,14 +160,49 @@ func (p *pathObject) ForEach(call goja.FunctionCall) goja.Value {
 // Example:
 //	// javascript
 //	// Save count as a variable
-//	var n = g.V().Count()
+//	var n = g.V().count()
 //	// Send it as a query result
-//	g.Emit(n)
+//	g.emit(n)
 func (p *pathObject) Count() (int64, error) {
 	it := p.buildIteratorTree()
 	return p.s.countResults(it)
 }
 
+// Backwards compatibility
+func (p *pathObject) CaptializedGetLimit(limit int) error {
+	return p.GetLimit(limit)
+}
+func (p *pathObject) CaptializedAll() error {
+	return p.All()
+}
+func (p *pathObject) CaptializedtoArray(call goja.FunctionCall, withTags bool) goja.Value {
+	return p.toArray(call, withTags)
+}
+func (p *pathObject) CaptializedToArray(call goja.FunctionCall) goja.Value {
+	return p.ToArray(call)
+}
+func (p *pathObject) CaptializedTagArray(call goja.FunctionCall) goja.Value {
+	return p.TagArray(call)
+}
+func (p *pathObject) CaptializedtoValue(withTags bool) (interface{}, error) {
+	return p.toValue(withTags)
+}
+func (p *pathObject) CaptializedToValue() (interface{}, error) {
+	return p.ToValue()
+}
+func (p *pathObject) CaptializedTagValue() (interface{}, error) {
+	return p.TagValue()
+}
+func (p *pathObject) CaptializedMap(call goja.FunctionCall) goja.Value {
+	return p.Map(call)
+}
+func (p *pathObject) CaptializedForEach(call goja.FunctionCall) goja.Value {
+	return p.ForEach(call)
+}
+func (p *pathObject) CaptializedCount() (int64, error) {
+	return p.Count()
+}
+
 func quadValueToString(v quad.Value) string {
 	if s, ok := v.(quad.String); ok {
 		return string(s)
diff --git a/query/gizmo/gizmo.go b/query/gizmo/gizmo.go
index 648bcd2..ea84156 100644
--- a/query/gizmo/gizmo.go
+++ b/query/gizmo/gizmo.go
@@ -17,7 +17,11 @@ package gizmo
 import (
 	"context"
 	"fmt"
+	"reflect"
 	"sort"
+	"strings"
+	"unicode"
+	"unicode/utf8"
 
 	"github.com/dop251/goja"
 
@@ -59,6 +63,30 @@ func NewSession(qs graph.QuadStore) *Session {
 	return s
 }
 
+func lcFirst(str string) string {
+	rune, size := utf8.DecodeRuneInString(str)
+	return string(unicode.ToLower(rune)) + str[size:]
+}
+
+type fieldNameMapper struct{}
+
+func (fieldNameMapper) FieldName(t reflect.Type, f reflect.StructField) string {
+	return lcFirst(f.Name)
+}
+
+const constructMethodPrefix = "New"
+const backwardsCompatibilityPrefix = "Capitalized"
+
+func (fieldNameMapper) MethodName(t reflect.Type, m reflect.Method) string {
+	if strings.HasPrefix(m.Name, backwardsCompatibilityPrefix) {
+		return strings.TrimPrefix(m.Name, backwardsCompatibilityPrefix)
+	}
+	if strings.HasPrefix(m.Name, constructMethodPrefix) {
+		return strings.TrimPrefix(m.Name, constructMethodPrefix)
+	}
+	return lcFirst(m.Name)
+}
+
 type Session struct {
 	qs  graph.QuadStore
 	vm  *goja.Runtime
@@ -88,6 +116,7 @@ func (s *Session) buildEnv() error {
 		return nil
 	}
 	s.vm = goja.New()
+	s.vm.SetFieldNameMapper(fieldNameMapper{})
 	s.vm.Set("graph", &graphObject{s: s})
 	s.vm.Set("g", s.vm.Get("graph"))
 	for name, val := range defaultEnv {
diff --git a/query/gizmo/traversals.go b/query/gizmo/traversals.go
index e8a010d..7d710f8 100644
--- a/query/gizmo/traversals.go
+++ b/query/gizmo/traversals.go
@@ -94,8 +94,8 @@ func (p *pathObject) buildIteratorTree() graph.Iterator {
 // Example:
 //	// javascript
 //	// Starting from all nodes in the graph, find the paths that follow bob.
-//	// Results in three paths for bob (from alice, charlie and dani).All()
-//	g.V().Out("<follows>").Is("<bob>").All()
+//	// Results in three paths for bob (from alice, charlie and dani).all()
+//	g.V().out("<follows>").is("<bob>").all()
 func (p *pathObject) Is(call goja.FunctionCall) goja.Value {
 	args, err := toQuadValues(exportArgs(call.Arguments))
 	if err != nil {
@@ -138,11 +138,11 @@ func (p *pathObject) inout(call goja.FunctionCall, in bool) goja.Value {
 //
 //	// javascript
 //	// Find the cool people, bob, dani and greg
-//	g.V("cool_person").In("<status>").All()
+//	g.V("cool_person").in("<status>").all()
 //	// Find who follows bob, in this case, alice, charlie, and dani
-//	g.V("<bob>").In("<follows>").All()
+//	g.V("<bob>").in("<follows>").all()
 //	// Find who follows the people emily follows, namely, bob and emily
-//	g.V("<emily>").Out("<follows>").In("<follows>").All()
+//	g.V("<emily>").out("<follows>").in("<follows>").all()
 func (p *pathObject) In(call goja.FunctionCall) goja.Value {
 	return p.inout(call, true)
 }
@@ -167,17 +167,17 @@ func (p *pathObject) In(call goja.FunctionCall) goja.Value {
 //
 //	// javascript
 //	// The working set of this is bob and dani
-//	g.V("<charlie>").Out("<follows>").All()
+//	g.V("<charlie>").out("<follows>").all()
 //	// The working set of this is fred, as alice follows bob and bob follows fred.
-//	g.V("<alice>").Out("<follows>").Out("<follows>").All()
+//	g.V("<alice>").out("<follows>").out("<follows>").all()
 //	// Finds all things dani points at. Result is bob, greg and cool_person
-//	g.V("<dani>").Out().All()
+//	g.V("<dani>").out().all()
 //	// Finds all things dani points at on the status linkage.
 //	// Result is bob, greg and cool_person
-//	g.V("<dani>").Out(["<follows>", "<status>"]).All()
+//	g.V("<dani>").out(["<follows>", "<status>"]).all()
 //	// Finds all things dani points at on the status linkage, given from a separate query path.
 //	// Result is {"id": "cool_person", "pred": "<status>"}
-//	g.V("<dani>").Out(g.V("<status>"), "pred").All()
+//	g.V("<dani>").out(g.V("<status>"), "pred").all()
 func (p *pathObject) Out(call goja.FunctionCall) goja.Value {
 	return p.inout(call, false)
 }
@@ -188,7 +188,7 @@ func (p *pathObject) Out(call goja.FunctionCall) goja.Value {
 // Example:
 //	// javascript
 //	// Find all followers/followees of fred. Returns bob, emily and greg
-//	g.V("<fred>").Both("<follows>").All()
+//	g.V("<fred>").both("<follows>").all()
 func (p *pathObject) Both(call goja.FunctionCall) goja.Value {
 	preds, tags, ok := toViaData(exportArgs(call.Arguments))
 	if !ok {
@@ -220,7 +220,7 @@ func (p *pathObject) follow(ep *pathObject, rev bool) *pathObject {
 //	// Returns the followed people of who charlie follows -- a simplistic "friend of my friend"
 //	// and whether or not they have a "cool" status. Potential for recommending followers abounds.
 //	// Returns bob and greg
-//	g.V("<charlie>").Follow(friendOfFriend).Has("<status>", "cool_person").All()
+//	g.V("<charlie>").follow(friendOfFriend).has("<status>", "cool_person").all()
 func (p *pathObject) Follow(path *pathObject) *pathObject {
 	return p.follow(path, false)
 }
@@ -235,7 +235,7 @@ func (p *pathObject) Follow(path *pathObject) *pathObject {
 //	var friendOfFriend = g.Morphism().Out("<follows>").Out("<follows>")
 //	// Returns the third-tier of influencers -- people who follow people who follow the cool people.
 //	// Returns charlie (from bob), charlie (from greg), bob and emily
-//	g.V().Has("<status>", "cool_person").FollowR(friendOfFriend).All()
+//	g.V().has("<status>", "cool_person").followR(friendOfFriend).all()
 func (p *pathObject) FollowR(path *pathObject) *pathObject {
 	return p.follow(path, true)
 }
@@ -246,10 +246,10 @@ func (p *pathObject) FollowR(path *pathObject) *pathObject {
 //
 // Example:
 // 	// javascript:
-//	var friend = g.Morphism().Out("<follows>")
+//	var friend = g.Morphism().out("<follows>")
 //	// Returns all people in Charlie's network.
 //	// Returns bob and dani (from charlie), fred (from bob) and greg (from dani).
-//	g.V("<charlie>").FollowRecursive(friend).All()
+//	g.V("<charlie>").followRecursive(friend).all()
 func (p *pathObject) FollowRecursive(call goja.FunctionCall) goja.Value {
 	preds, maxDepth, tags, ok := toViaDepthData(exportArgs(call.Arguments))
 	if !ok || len(preds) == 0 {
@@ -333,7 +333,7 @@ func (p *pathObject) Or(path *pathObject) *pathObject {
 //	//   {"id": "<dani>", "start": "<greg>"},
 //	//   {"id": "<fred>", "start": "<greg>"},
 //	//   {"id": "<fred>", "start": "<greg>"}
-//	g.V().Tag("start").Out("<status>").Back("start").In("<follows>").All()
+//	g.V().tag("start").out("<status>").back("start").in("<follows>").all()
 func (p *pathObject) Back(tag string) *pathObject {
 	np := p.clonePath().Back(tag)
 	return p.new(np)
@@ -356,7 +356,7 @@ func (p *pathObject) Back(tag string) *pathObject {
 //	//   {"id": "cool_person", "start": "<greg>"},
 //	//   {"id": "smart_person", "start": "<emily>"},
 //	//   {"id": "smart_person", "start": "<greg>"}
-//	g.V().Tag("start").Out("<status>").All()
+//	g.V().tag("start").out("<status>").All()
 func (p *pathObject) Tag(tags ...string) *pathObject {
 	np := p.clonePath().Tag(tags...)
 	return p.new(np)
@@ -382,11 +382,11 @@ func (p *pathObject) As(tags ...string) *pathObject {
 // Example:
 // 	// javascript
 //	// Start from all nodes that follow bob -- results in alice, charlie and dani
-//	g.V().Has("<follows>", "<bob>").All()
+//	g.V().has("<follows>", "<bob>").all()
 //	// People charlie follows who then follow fred. Results in bob.
-//	g.V("<charlie>").Out("<follows>").Has("<follows>", "<fred>").All()
+//	g.V("<charlie>").Out("<follows>").has("<follows>", "<fred>").all()
 //	// People with friends who have names sorting lower then "f".
-//	g.V().Has("<follows>", gt("<f>")).All()
+//	g.V().has("<follows>", gt("<f>")).all()
 func (p *pathObject) Has(call goja.FunctionCall) goja.Value {
 	return p.has(call, false)
 }
@@ -623,11 +623,11 @@ func (p *pathObject) SaveOutPredicates(tag string) *pathObject {
 // Example:
 // 	// javascript
 //	// Find the status of people Dani follows
-//	g.V("<dani>").Out("<follows>").Out("<status>").All()
+//	g.V("<dani>").out("<follows>").out("<status>").all()
 //	// Find only the statuses provided by the smart_graph
-//	g.V("<dani>").Out("<follows>").LabelContext("<smart_graph>").Out("<status>").All()
+//	g.V("<dani>").out("<follows>").labelContext("<smart_graph>").out("<status>").all()
 //	// Find all people followed by people with statuses in the smart_graph.
-//	g.V().LabelContext("<smart_graph>").In("<status>").LabelContext(null).In("<follows>").All()
+//	g.V().labelContext("<smart_graph>").in("<status>").labelContext(null).in("<follows>").all()
 func (p *pathObject) LabelContext(call goja.FunctionCall) goja.Value {
 	labels, tags, ok := toViaData(exportArgs(call.Arguments))
 	if !ok {
@@ -659,7 +659,7 @@ func (p *pathObject) Filter(args ...valFilter) (*pathObject, error) {
 // Example:
 // 	// javascript
 //	// Start from all nodes that follow bob, and limit them to 2 nodes -- results in alice and charlie
-//	g.V().Has("<follows>", "<bob>").Limit(2).All()
+//	g.V().has("<follows>", "<bob>").limit(2).all()
 func (p *pathObject) Limit(limit int) *pathObject {
 	np := p.clonePath().Limit(int64(limit))
 	return p.new(np)
@@ -674,8 +674,106 @@ func (p *pathObject) Limit(limit int) *pathObject {
 // Example:
 //	// javascript
 //	// Start from all nodes that follow bob, and skip 2 nodes -- results in dani
-//	g.V().Has("<follows>", "<bob>").Skip(2).All()
+//	g.V().has("<follows>", "<bob>").skip(2).all()
 func (p *pathObject) Skip(offset int) *pathObject {
 	np := p.clonePath().Skip(int64(offset))
 	return p.new(np)
 }
+
+// Backwards compatibility
+func (p *pathObject) CapitalizedIs(call goja.FunctionCall) goja.Value {
+	return p.Is(call)
+}
+func (p *pathObject) CapitalizedIn(call goja.FunctionCall) goja.Value {
+	return p.In(call)
+}
+func (p *pathObject) CapitalizedOut(call goja.FunctionCall) goja.Value {
+	return p.Out(call)
+}
+func (p *pathObject) CapitalizedBoth(call goja.FunctionCall) goja.Value {
+	return p.Both(call)
+}
+func (p *pathObject) CapitalizedFollow(path *pathObject) *pathObject {
+	return p.Follow(path)
+}
+func (p *pathObject) CapitalizedFollowR(path *pathObject) *pathObject {
+	return p.FollowR(path)
+}
+func (p *pathObject) CapitalizedFollowRecursive(call goja.FunctionCall) goja.Value {
+	return p.FollowRecursive(call)
+}
+func (p *pathObject) CapitalizedAnd(path *pathObject) *pathObject {
+	return p.And(path)
+}
+func (p *pathObject) CapitalizedIntersect(path *pathObject) *pathObject {
+	return p.Intersect(path)
+}
+func (p *pathObject) CapitalizedUnion(path *pathObject) *pathObject {
+	return p.Union(path)
+}
+func (p *pathObject) CapitalizedOr(path *pathObject) *pathObject {
+	return p.Or(path)
+}
+func (p *pathObject) CapitalizedBack(tag string) *pathObject {
+	return p.Back(tag)
+}
+func (p *pathObject) CapitalizedTag(tags ...string) *pathObject {
+	return p.Tag(tags...)
+}
+func (p *pathObject) CapitalizedAs(tags ...string) *pathObject {
+	return p.As(tags...)
+}
+func (p *pathObject) CapitalizedHas(call goja.FunctionCall) goja.Value {
+	return p.Has(call)
+}
+func (p *pathObject) CapitalizedHasR(call goja.FunctionCall) goja.Value {
+	return p.HasR(call)
+}
+func (p *pathObject) CapitalizedSave(call goja.FunctionCall) goja.Value {
+	return p.Save(call)
+}
+func (p *pathObject) CapitalizedSaveR(call goja.FunctionCall) goja.Value {
+	return p.SaveR(call)
+}
+func (p *pathObject) CapitalizedSaveOpt(call goja.FunctionCall) goja.Value {
+	return p.SaveOpt(call)
+}
+func (p *pathObject) CapitalizedSaveOptR(call goja.FunctionCall) goja.Value {
+	return p.SaveOptR(call)
+}
+func (p *pathObject) CapitalizedExcept(path *pathObject) *pathObject {
+	return p.Except(path)
+}
+func (p *pathObject) CapitalizedUnique() *pathObject {
+	return p.Unique()
+}
+func (p *pathObject) CapitalizedDifference(path *pathObject) *pathObject {
+	return p.Difference(path)
+}
+func (p *pathObject) CapitalizedLabels() *pathObject {
+	return p.Labels()
+}
+func (p *pathObject) CapitalizedInPredicates() *pathObject {
+	return p.InPredicates()
+}
+func (p *pathObject) CapitalizedOutPredicates() *pathObject {
+	return p.OutPredicates()
+}
+func (p *pathObject) CapitalizedSaveInPredicates(tag string) *pathObject {
+	return p.SaveInPredicates(tag)
+}
+func (p *pathObject) CapitalizedSaveOutPredicates(tag string) *pathObject {
+	return p.SaveOutPredicates(tag)
+}
+func (p *pathObject) CapitalizedLabelContext(call goja.FunctionCall) goja.Value {
+	return p.LabelContext(call)
+}
+func (p *pathObject) CapitalizedFilter(args ...valFilter) (*pathObject, error) {
+	return p.Filter(args...)
+}
+func (p *pathObject) CapitalizedLimit(limit int) *pathObject {
+	return p.Limit(limit)
+}
+func (p *pathObject) CapitalizedSkip(offset int) *pathObject {
+	return p.Skip(offset)
+}


Test patch:
diff --git a/graph/graphtest/integration.go b/graph/graphtest/integration.go
index 9bc98c8..a3d1edd 100644
--- a/graph/graphtest/integration.go
+++ b/graph/graphtest/integration.go
@@ -92,7 +92,7 @@ var queries = []struct {
 	{
 		message: "name predicate",
 		query: `
-		g.V("Humphrey Bogart").In("<name>").All()
+		g.V("Humphrey Bogart").in("<name>").all()
 		`,
 		expect: []interface{}{
 			map[string]string{"id": "</en/humphrey_bogart>"},
@@ -105,11 +105,11 @@ var queries = []struct {
 	{
 		message: "two large sets with no intersection",
 		query: `
-		function getId(x) { return g.V(x).In("<name>") }
-		var actor_to_film = g.M().In("</film/performance/actor>").In("</film/film/starring>")
+		function getId(x) { return g.V(x).in("<name>") }
+		var actor_to_film = g.M().in("</film/performance/actor>").in("</film/film/starring>")
 
-		getId("Oliver Hardy").Follow(actor_to_film).Out("<name>").Intersect(
-			getId("Mel Blanc").Follow(actor_to_film).Out("<name>")).All()
+		getId("Oliver Hardy").follow(actor_to_film).out("<name>").intersect(
+			getId("Mel Blanc").follow(actor_to_film).out("<name>")).all()
 			`,
 		expect: nil,
 	},
@@ -119,19 +119,19 @@ var queries = []struct {
 		message: "three huge sets with small intersection",
 		long:    true,
 		query: `
-			function getId(x) { return g.V(x).In("<name>") }
-			var actor_to_film = g.M().In("</film/performance/actor>").In("</film/film/starring>")
+			function getId(x) { return g.V(x).in("<name>") }
+			var actor_to_film = g.M().in("</film/performance/actor>").in("</film/film/starring>")
 
-			var a = getId("Oliver Hardy").Follow(actor_to_film).FollowR(actor_to_film)
-			var b = getId("Mel Blanc").Follow(actor_to_film).FollowR(actor_to_film)
-			var c = getId("Billy Gilbert").Follow(actor_to_film).FollowR(actor_to_film)
+			var a = getId("Oliver Hardy").follow(actor_to_film).followR(actor_to_film)
+			var b = getId("Mel Blanc").follow(actor_to_film).followR(actor_to_film)
+			var c = getId("Billy Gilbert").follow(actor_to_film).followR(actor_to_film)
 
 			seen = {}
 
-			a.Intersect(b).Intersect(c).ForEach(function (d) {
+			a.intersect(b).intersect(c).forEach(function (d) {
 				if (!(d.id in seen)) {
 					seen[d.id] = true;
-					g.Emit(d)
+					g.emit(d)
 				}
 			})
 			`,
@@ -148,7 +148,7 @@ var queries = []struct {
 		message: "the helpless checker",
 		long:    true,
 		query: `
-			g.V().As("person").In("<name>").In().In().Out("<name>").Is("Casablanca").All()
+			g.V().as("person").in("<name>").in().in().out("<name>").is("Casablanca").all()
 			`,
 		tag: "person",
 		expect: []interface{}{
@@ -175,7 +175,7 @@ var queries = []struct {
 		message: "the helpless checker, negated (films without Ingrid Bergman)",
 		long:    true,
 		query: `
-			g.V().As("person").In("<name>").In().In().Out("<name>").Except(g.V("Ingrid Bergman").In("<name>").In().In().Out("<name>")).Is("Casablanca").All()
+			g.V().as("person").in("<name>").in().in().out("<name>").except(g.V("Ingrid Bergman").in("<name>").in().in().out("<name>")).is("Casablanca").all()
 			`,
 		tag:    "person",
 		expect: nil,
@@ -184,7 +184,7 @@ var queries = []struct {
 		message: "the helpless checker, negated (without actors Ingrid Bergman)",
 		long:    true,
 		query: `
-			g.V().As("person").In("<name>").Except(g.V("Ingrid Bergman").In("<name>")).In().In().Out("<name>").Is("Casablanca").All()
+			g.V().as("person").in("<name>").except(g.V("Ingrid Bergman").in("<name>")).in().in().out("<name>").is("Casablanca").all()
 			`,
 		tag: "person",
 		expect: []interface{}{
@@ -209,7 +209,7 @@ var queries = []struct {
 	//A: "Sandra Bullock"
 	{
 		message: "Net and Speed",
-		query: common + `m1_actors.Intersect(m2_actors).Out("<name>").All()
+		query: common + `m1_actors.intersect(m2_actors).out("<name>").all()
 `,
 		expect: []interface{}{
 			map[string]string{"id": SandraB, "movie1": "The Net", "movie2": nSpeed},
@@ -220,7 +220,7 @@ var queries = []struct {
 	//A: No
 	{
 		message: "Keanu in The Net",
-		query: common + `actor2.Intersect(m1_actors).Out("<name>").All()
+		query: common + `actor2.intersect(m1_actors).out("<name>").all()
 `,
 		expect: nil,
 	},
@@ -229,7 +229,7 @@ var queries = []struct {
 	//A: Yes
 	{
 		message: "Keanu in Speed",
-		query: common + `actor2.Intersect(m2_actors).Out("<name>").All()
+		query: common + `actor2.intersect(m2_actors).out("<name>").all()
 `,
 		expect: []interface{}{
 			map[string]string{"id": KeanuR, "movie2": nSpeed},
@@ -242,7 +242,7 @@ var queries = []struct {
 	{
 		message: "Keanu with other in The Net",
 		long:    true,
-		query: common + `actor2.Follow(coStars1).Intersect(m1_actors).Out("<name>").All()
+		query: common + `actor2.follow(coStars1).intersect(m1_actors).out("<name>").all()
 `,
 		expect: []interface{}{
 			map[string]string{"id": SandraB, "movie1": "The Net", "costar1_movie": nSpeed},
@@ -256,7 +256,7 @@ var queries = []struct {
 	{
 		message: "Keanu and Bullock with other",
 		long:    true,
-		query: common + `actor1.Save("<name>","costar1_actor").Follow(coStars1).Intersect(actor2.Save("<name>","costar2_actor").Follow(coStars2)).Out("<name>").All()
+		query: common + `actor1.save("<name>","costar1_actor").follow(coStars1).intersect(actor2.save("<name>","costar2_actor").follow(coStars2)).out("<name>").all()
 `,
 		expect: []interface{}{
 			costarTag(SandraB, SandraB, "The Proposal", KeanuR, nSpeed),
@@ -430,7 +430,7 @@ var queries = []struct {
 	{
 		message: "Save a number of predicates around a set of nodes",
 		query: `
-		g.V("_:9037", "_:49278", "_:44112", "_:44709", "_:43382").Save("</film/performance/character>", "char").Save("</film/performance/actor>", "act").SaveR("</film/film/starring>", "film").All()
+		g.V("_:9037", "_:49278", "_:44112", "_:44709", "_:43382").save("</film/performance/character>", "char").save("</film/performance/actor>", "act").saveR("</film/film/starring>", "film").all()
 		`,
 		expect: []interface{}{
 			map[string]string{"act": "</en/humphrey_bogart>", "char": "Rick Blaine", "film": "</en/casablanca_1942>", "id": "_:9037"},
@@ -443,21 +443,21 @@ var queries = []struct {
 }
 
 const common = `
-var movie1 = g.V().Has("<name>", "The Net")
-var movie2 = g.V().Has("<name>", "Speed")
-var actor1 = g.V().Has("<name>", "Sandra Bullock")
-var actor2 = g.V().Has("<name>", "Keanu Reeves")
+var movie1 = g.V().has("<name>", "The Net")
+var movie2 = g.V().has("<name>", "Speed")
+var actor1 = g.V().has("<name>", "Sandra Bullock")
+var actor2 = g.V().has("<name>", "Keanu Reeves")
 
 // (film) -> starring -> (actor)
-var filmToActor = g.Morphism().Out("</film/film/starring>").Out("</film/performance/actor>")
+var filmToActor = g.Morphism().out("</film/film/starring>").out("</film/performance/actor>")
 
 // (actor) -> starring -> [film -> starring -> (actor)]
-var coStars1 = g.Morphism().In("</film/performance/actor>").In("</film/film/starring>").Save("<name>","costar1_movie").Follow(filmToActor)
-var coStars2 = g.Morphism().In("</film/performance/actor>").In("</film/film/starring>").Save("<name>","costar2_movie").Follow(filmToActor)
+var coStars1 = g.Morphism().in("</film/performance/actor>").in("</film/film/starring>").save("<name>","costar1_movie").follow(filmToActor)
+var coStars2 = g.Morphism().in("</film/performance/actor>").in("</film/film/starring>").save("<name>","costar2_movie").follow(filmToActor)
 
 // Stars for the movies "The Net" and "Speed"
-var m1_actors = movie1.Save("<name>","movie1").Follow(filmToActor)
-var m2_actors = movie2.Save("<name>","movie2").Follow(filmToActor)
+var m1_actors = movie1.save("<name>","movie1").follow(filmToActor)
+var m2_actors = movie2.save("<name>","movie2").follow(filmToActor)
 `
 
 func prepare(t testing.TB, gen testutil.DatabaseFunc) (graph.QuadStore, func()) {
diff --git a/query/gizmo/gizmo_test.go b/query/gizmo/gizmo_test.go
index ffe8399..9e67f2b 100644
--- a/query/gizmo/gizmo_test.go
+++ b/query/gizmo/gizmo_test.go
@@ -69,7 +69,7 @@ var testQueries = []struct {
 	query   string
 	limit   int
 	tag     string
-	file 	string
+	file    string
 	expect  []string
 	err     bool // TODO(dennwc): define error types for Gizmo and handle them
 }{
@@ -77,142 +77,142 @@ var testQueries = []struct {
 	{
 		message: "get a single vertex",
 		query: `
-			g.V("<alice>").All()
+			g.V("<alice>").all()
 		`,
 		expect: []string{"<alice>"},
 	},
 	{
-		message: "use .GetLimit",
+		message: "use .getLimit",
 		query: `
-			g.V().GetLimit(5)
+			g.V().getLimit(5)
 		`,
 		expect: []string{"<alice>", "<bob>", "<follows>", "<fred>", "<status>"},
 	},
 	{
 		message: "get a single vertex (IRI)",
 		query: `
-			g.V(iri("alice")).All()
+			g.V(iri("alice")).all()
 		`,
 		expect: []string{"<alice>"},
 	},
 	{
-		message: "use .Out()",
+		message: "use .out()",
 		query: `
-			g.V("<alice>").Out("<follows>").All()
+			g.V("<alice>").out("<follows>").all()
 		`,
 		expect: []string{"<bob>"},
 	},
 	{
-		message: "use .Out() (IRI)",
+		message: "use .out() (IRI)",
 		query: `
-			g.V(iri("alice")).Out(iri("follows")).All()
+			g.V(iri("alice")).out(iri("follows")).all()
 		`,
 		expect: []string{"<bob>"},
 	},
 	{
-		message: "use .Out() (any)",
+		message: "use .out() (any)",
 		query: `
-			g.V("<bob>").Out().All()
+			g.V("<bob>").out().all()
 		`,
 		expect: []string{"<fred>", "cool_person"},
 	},
 	{
-		message: "use .In()",
+		message: "use .in()",
 		query: `
-			g.V("<bob>").In("<follows>").All()
+			g.V("<bob>").in("<follows>").all()
 		`,
 		expect: []string{"<alice>", "<charlie>", "<dani>"},
 	},
 	{
-		message: "use .In() (any)",
+		message: "use .in() (any)",
 		query: `
-			g.V("<bob>").In().All()
+			g.V("<bob>").in().all()
 		`,
 		expect: []string{"<alice>", "<charlie>", "<dani>"},
 	},
 	{
-		message: "use .In() with .Filter()",
+		message: "use .in() with .filter()",
 		query: `
-			g.V("<bob>").In("<follows>").Filter(gt(iri("c")),lt(iri("d"))).All()
+			g.V("<bob>").in("<follows>").filter(gt(iri("c")),lt(iri("d"))).all()
 		`,
 		expect: []string{"<charlie>"},
 	},
 	{
-		message: "use .In() with .Filter(regex)",
+		message: "use .in() with .filter(regex)",
 		query: `
-			g.V("<bob>").In("<follows>").Filter(regex("ar?li.*e")).All()
+			g.V("<bob>").in("<follows>").filter(regex("ar?li.*e")).all()
 		`,
 		expect: nil,
 	},
 	{
-		message: "use .In() with .Filter(prefix)",
+		message: "use .in() with .filter(prefix)",
 		query: `
-			g.V("<bob>").In("<follows>").Filter(like("al%")).All()
+			g.V("<bob>").in("<follows>").filter(like("al%")).all()
 		`,
 		expect: []string{"<alice>"},
 	},
 	{
-		message: "use .In() with .Filter(wildcard)",
+		message: "use .in() with .filter(wildcard)",
 		query: `
-			g.V("<bob>").In("<follows>").Filter(like("a?i%e")).All()
+			g.V("<bob>").in("<follows>").filter(like("a?i%e")).all()
 		`,
 		expect: []string{"<alice>"},
 	},
 	{
-		message: "use .In() with .Filter(regex with IRIs)",
+		message: "use .in() with .filter(regex with IRIs)",
 		query: `
-			g.V("<bob>").In("<follows>").Filter(regex("ar?li.*e", true)).All()
+			g.V("<bob>").in("<follows>").filter(regex("ar?li.*e", true)).all()
 		`,
 		expect: []string{"<alice>", "<charlie>"},
 	},
 	{
-		message: "use .In() with .Filter(regex with IRIs)",
+		message: "use .in() with .filter(regex with IRIs)",
 		query: `
-			g.V("<bob>").In("<follows>").Filter(regex(iri("ar?li.*e"))).All()
+			g.V("<bob>").in("<follows>").filter(regex(iri("ar?li.*e"))).all()
 		`,
 		err: true,
 	},
 	{
-		message: "use .In() with .Filter(regex,gt)",
+		message: "use .in() with .filter(regex,gt)",
 		query: `
-			g.V("<bob>").In("<follows>").Filter(regex("ar?li.*e", true),gt(iri("c"))).All()
+			g.V("<bob>").in("<follows>").filter(regex("ar?li.*e", true),gt(iri("c"))).all()
 		`,
 		expect: []string{"<charlie>"},
 	},
 	{
-		message: "use .Both()",
+		message: "use .both()",
 		query: `
-			g.V("<fred>").Both("<follows>").All()
+			g.V("<fred>").both("<follows>").all()
 		`,
 		expect: []string{"<bob>", "<greg>", "<emily>"},
 	},
 	{
-		message: "use .Both() with tag",
+		message: "use .both() with tag",
 		query: `
-			g.V("<fred>").Both(null, "pred").All()
+			g.V("<fred>").both(null, "pred").all()
 		`,
 		tag:    "pred",
 		expect: []string{"<follows>", "<follows>", "<follows>"},
 	},
 	{
-		message: "use .Tag()-.Is()-.Back()",
+		message: "use .tag()-.is()-.back()",
 		query: `
-			g.V("<bob>").In("<follows>").Tag("foo").Out("<status>").Is("cool_person").Back("foo").All()
+			g.V("<bob>").in("<follows>").tag("foo").out("<status>").is("cool_person").back("foo").all()
 		`,
 		expect: []string{"<dani>"},
 	},
 	{
-		message: "separate .Tag()-.Is()-.Back()",
+		message: "separate .tag()-.is()-.back()",
 		query: `
-			x = g.V("<charlie>").Out("<follows>").Tag("foo").Out("<status>").Is("cool_person").Back("foo")
-			x.In("<follows>").Is("<dani>").Back("foo").All()
+			x = g.V("<charlie>").out("<follows>").tag("foo").out("<status>").is("cool_person").back("foo")
+			x.in("<follows>").is("<dani>").back("foo").all()
 		`,
 		expect: []string{"<bob>"},
 	},
 	{
-		message: "do multiple .Back()s",
+		message: "do multiple .back()",
 		query: `
-			g.V("<emily>").Out("<follows>").As("f").Out("<follows>").Out("<status>").Is("cool_person").Back("f").In("<follows>").In("<follows>").As("acd").Out("<status>").Is("cool_person").Back("f").All()
+			g.V("<emily>").out("<follows>").as("f").out("<follows>").out("<status>").is("cool_person").back("f").in("<follows>").in("<follows>").as("acd").out("<status>").is("cool_person").back("f").all()
 		`,
 		tag:    "acd",
 		expect: []string{"<dani>"},
@@ -220,14 +220,14 @@ var testQueries = []struct {
 	{
 		message: "use Except to filter out a single vertex",
 		query: `
-			g.V("<alice>", "<bob>").Except(g.V("<alice>")).All()
+			g.V("<alice>", "<bob>").except(g.V("<alice>")).all()
 		`,
 		expect: []string{"<bob>"},
 	},
 	{
 		message: "use chained Except",
 		query: `
-			g.V("<alice>", "<bob>", "<charlie>").Except(g.V("<bob>")).Except(g.V("<charlie>")).All()
+			g.V("<alice>", "<bob>", "<charlie>").except(g.V("<bob>")).except(g.V("<charlie>")).all()
 		`,
 		expect: []string{"<alice>"},
 	},
@@ -235,7 +235,7 @@ var testQueries = []struct {
 	{
 		message: "use Unique",
 		query: `
-			g.V("<alice>", "<bob>", "<charlie>").Out("<follows>").Unique().All()
+			g.V("<alice>", "<bob>", "<charlie>").out("<follows>").unique().all()
 		`,
 		expect: []string{"<bob>", "<dani>", "<fred>"},
 	},
@@ -244,16 +244,16 @@ var testQueries = []struct {
 	{
 		message: "show simple morphism",
 		query: `
-			grandfollows = g.M().Out("<follows>").Out("<follows>")
-			g.V("<charlie>").Follow(grandfollows).All()
+			grandfollows = g.M().out("<follows>").out("<follows>")
+			g.V("<charlie>").follow(grandfollows).all()
 		`,
 		expect: []string{"<greg>", "<fred>", "<bob>"},
 	},
 	{
 		message: "show reverse morphism",
 		query: `
-			grandfollows = g.M().Out("<follows>").Out("<follows>")
-			g.V("<fred>").FollowR(grandfollows).All()
+			grandfollows = g.M().out("<follows>").out("<follows>")
+			g.V("<fred>").followR(grandfollows).all()
 		`,
 		expect: []string{"<alice>", "<charlie>", "<dani>"},
 	},
@@ -262,49 +262,49 @@ var testQueries = []struct {
 	{
 		message: "show simple intersection",
 		query: `
-			function follows(x) { return g.V(x).Out("<follows>") }
-			follows("<dani>").And(follows("<charlie>")).All()
+			function follows(x) { return g.V(x).out("<follows>") }
+			follows("<dani>").and(follows("<charlie>")).all()
 		`,
 		expect: []string{"<bob>"},
 	},
 	{
 		message: "show simple morphism intersection",
 		query: `
-			grandfollows = g.M().Out("<follows>").Out("<follows>")
-			function gfollows(x) { return g.V(x).Follow(grandfollows) }
-			gfollows("<alice>").And(gfollows("<charlie>")).All()
+			grandfollows = g.M().out("<follows>").out("<follows>")
+			function gfollows(x) { return g.V(x).follow(grandfollows) }
+			gfollows("<alice>").and(gfollows("<charlie>")).all()
 		`,
 		expect: []string{"<fred>"},
 	},
 	{
 		message: "show double morphism intersection",
 		query: `
-			grandfollows = g.M().Out("<follows>").Out("<follows>")
-			function gfollows(x) { return g.V(x).Follow(grandfollows) }
-			gfollows("<emily>").And(gfollows("<charlie>")).And(gfollows("<bob>")).All()
+			grandfollows = g.M().out("<follows>").out("<follows>")
+			function gfollows(x) { return g.V(x).follow(grandfollows) }
+			gfollows("<emily>").and(gfollows("<charlie>")).and(gfollows("<bob>")).all()
 		`,
 		expect: []string{"<greg>"},
 	},
 	{
 		message: "show reverse intersection",
 		query: `
-			grandfollows = g.M().Out("<follows>").Out("<follows>")
-			g.V("<greg>").FollowR(grandfollows).Intersect(g.V("<fred>").FollowR(grandfollows)).All()
+			grandfollows = g.M().out("<follows>").out("<follows>")
+			g.V("<greg>").followR(grandfollows).intersect(g.V("<fred>").followR(grandfollows)).all()
 		`,
 		expect: []string{"<charlie>"},
 	},
 	{
 		message: "show standard sort of morphism intersection, continue follow",
-		query: `gfollowers = g.M().In("<follows>").In("<follows>")
-			function cool(x) { return g.V(x).As("a").Out("<status>").Is("cool_person").Back("a") }
-			cool("<greg>").Follow(gfollowers).Intersect(cool("<bob>").Follow(gfollowers)).All()
+		query: `gfollowers = g.M().in("<follows>").in("<follows>")
+			function cool(x) { return g.V(x).as("a").out("<status>").is("cool_person").back("a") }
+			cool("<greg>").follow(gfollowers).intersect(cool("<bob>").follow(gfollowers)).all()
 		`,
 		expect: []string{"<charlie>"},
 	},
 	{
 		message: "test Or()",
 		query: `
-			g.V("<bob>").Out("<follows>").Or(g.V().Has("<status>", "cool_person")).All()
+			g.V("<bob>").out("<follows>").or(g.V().has("<status>", "cool_person")).all()
 		`,
 		expect: []string{"<fred>", "<bob>", "<greg>", "<dani>"},
 	},
@@ -313,28 +313,28 @@ var testQueries = []struct {
 	{
 		message: "show a simple Has",
 		query: `
-				g.V().Has("<status>", "cool_person").All()
+				g.V().has("<status>", "cool_person").all()
 		`,
 		expect: []string{"<greg>", "<dani>", "<bob>"},
 	},
 	{
 		message: "show a simple HasR",
 		query: `
-				g.V().HasR("<status>", "<bob>").All()
+				g.V().hasR("<status>", "<bob>").all()
 		`,
 		expect: []string{"cool_person"},
 	},
 	{
 		message: "show a double Has",
 		query: `
-				g.V().Has("<status>", "cool_person").Has("<follows>", "<fred>").All()
+				g.V().has("<status>", "cool_person").has("<follows>", "<fred>").all()
 		`,
 		expect: []string{"<bob>"},
 	},
 	{
 		message: "show a Has with filter",
 		query: `
-				g.V().Has("<follows>", gt("<f>")).All()
+				g.V().has("<follows>", gt("<f>")).all()
 		`,
 		expect: []string{"<bob>", "<dani>", "<emily>", "<fred>"},
 	},
@@ -343,21 +343,21 @@ var testQueries = []struct {
 	{
 		message: "use Limit",
 		query: `
-				g.V().Has("<status>", "cool_person").Limit(2).All()
+				g.V().has("<status>", "cool_person").limit(2).all()
 		`,
 		expect: []string{"<bob>", "<dani>"},
 	},
 	{
 		message: "use Skip",
 		query: `
-				g.V().Has("<status>", "cool_person").Skip(2).All()
+				g.V().has("<status>", "cool_person").skip(2).all()
 		`,
 		expect: []string{"<greg>"},
 	},
 	{
 		message: "use Skip and Limit",
 		query: `
-				g.V().Has("<status>", "cool_person").Skip(1).Limit(1).All()
+				g.V().has("<status>", "cool_person").skip(1).limit(1).all()
 		`,
 		expect: []string{"<dani>"},
 	},
@@ -365,14 +365,14 @@ var testQueries = []struct {
 	{
 		message: "show Count",
 		query: `
-				g.V().Has("<status>").Count()
+				g.V().has("<status>").count()
 		`,
 		expect: []string{"5"},
 	},
 	{
 		message: "use Count value",
 		query: `
-				g.Emit(g.V().Has("<status>").Count()+1)
+				g.emit(g.V().has("<status>").count()+1)
 		`,
 		expect: []string{"6"},
 	},
@@ -381,7 +381,7 @@ var testQueries = []struct {
 	{
 		message: "show a simple save",
 		query: `
-			g.V().Save("<status>", "somecool").All()
+			g.V().save("<status>", "somecool").all()
 		`,
 		tag:    "somecool",
 		expect: []string{"cool_person", "cool_person", "cool_person", "smart_person", "smart_person"},
@@ -389,7 +389,7 @@ var testQueries = []struct {
 	{
 		message: "show a simple save optional",
 		query: `
-			g.V("<bob>","<charlie>").Out("<follows>").SaveOpt("<status>", "somecool").All()
+			g.V("<bob>","<charlie>").out("<follows>").saveOpt("<status>", "somecool").all()
 		`,
 		tag:    "somecool",
 		expect: []string{"cool_person", "cool_person"},
@@ -397,7 +397,7 @@ var testQueries = []struct {
 	{
 		message: "show a simple saveR",
 		query: `
-			g.V("cool_person").SaveR("<status>", "who").All()
+			g.V("cool_person").saveR("<status>", "who").all()
 		`,
 		tag:    "who",
 		expect: []string{"<greg>", "<dani>", "<bob>"},
@@ -405,7 +405,7 @@ var testQueries = []struct {
 	{
 		message: "show an out save",
 		query: `
-			g.V("<dani>").Out(null, "pred").All()
+			g.V("<dani>").out(null, "pred").all()
 		`,
 		tag:    "pred",
 		expect: []string{"<follows>", "<follows>", "<status>"},
@@ -413,7 +413,7 @@ var testQueries = []struct {
 	{
 		message: "show a tag list",
 		query: `
-			g.V("<dani>").Out(null, ["pred", "foo", "bar"]).All()
+			g.V("<dani>").out(null, ["pred", "foo", "bar"]).all()
 		`,
 		tag:    "foo",
 		expect: []string{"<follows>", "<follows>", "<status>"},
@@ -421,28 +421,28 @@ var testQueries = []struct {
 	{
 		message: "show a pred list",
 		query: `
-			g.V("<dani>").Out(["<follows>", "<status>"]).All()
+			g.V("<dani>").out(["<follows>", "<status>"]).all()
 		`,
 		expect: []string{"<bob>", "<greg>", "cool_person"},
 	},
 	{
 		message: "show a predicate path",
 		query: `
-			g.V("<dani>").Out(g.V("<follows>"), "pred").All()
+			g.V("<dani>").out(g.V("<follows>"), "pred").all()
 		`,
 		expect: []string{"<bob>", "<greg>"},
 	},
 	{
 		message: "list all bob's incoming predicates",
 		query: `
-		  g.V("<bob>").InPredicates().All()
+		  g.V("<bob>").inPredicates().all()
 		`,
 		expect: []string{"<follows>"},
 	},
 	{
 		message: "save all bob's incoming predicates",
 		query: `
-		  g.V("<bob>").SaveInPredicates("pred").All()
+		  g.V("<bob>").saveInPredicates("pred").all()
 		`,
 		expect: []string{"<follows>", "<follows>", "<follows>"},
 		tag:    "pred",
@@ -450,88 +450,88 @@ var testQueries = []struct {
 	{
 		message: "list all labels",
 		query: `
-		  g.V().Labels().All()
+		  g.V().labels().all()
 		`,
 		expect: []string{"<smart_graph>"},
 	},
 	{
 		message: "list all in predicates",
 		query: `
-		  g.V().InPredicates().All()
+		  g.V().inPredicates().all()
 		`,
 		expect: []string{"<are>", "<follows>", "<status>"},
 	},
 	{
 		message: "list all out predicates",
 		query: `
-		  g.V().OutPredicates().All()
+		  g.V().outPredicates().all()
 		`,
 		expect: []string{"<are>", "<follows>", "<status>"},
 	},
 	{
 		message: "traverse using LabelContext",
 		query: `
-			g.V("<greg>").LabelContext("<smart_graph>").Out("<status>").All()
+			g.V("<greg>").labelContext("<smart_graph>").out("<status>").all()
 		`,
 		expect: []string{"smart_person"},
 	},
 	{
 		message: "open and close a LabelContext",
 		query: `
-			g.V().LabelContext("<smart_graph>").In("<status>").LabelContext(null).In("<follows>").All()
+			g.V().labelContext("<smart_graph>").in("<status>").labelContext(null).in("<follows>").all()
 		`,
 		expect: []string{"<dani>", "<fred>"},
 	},
 	{
 		message: "issue #254",
-		query:   `g.V({"id":"<alice>"}).All()`,
+		query:   `g.V({"id":"<alice>"}).all()`,
 		expect:  nil, err: true,
 	},
 	{
 		message: "roundtrip values",
 		query: `
-		v = g.V("<bob>").ToValue()
-		s = g.V(v).Out("<status>").ToValue()
-		g.V(s).All()
+		v = g.V("<bob>").toValue()
+		s = g.V(v).out("<status>").toValue()
+		g.V(s).all()
 		`,
 		expect: []string{"cool_person"},
 	},
 	{
 		message: "roundtrip values (tag map)",
 		query: `
-		v = g.V("<bob>").TagValue()
-		s = g.V(v.id).Out("<status>").TagValue()
-		g.V(s.id).All()
+		v = g.V("<bob>").tagValue()
+		s = g.V(v.id).out("<status>").tagValue()
+		g.V(s.id).all()
 		`,
 		expect: []string{"cool_person"},
 	},
 	{
 		message: "show ToArray",
 		query: `
-			arr = g.V("<bob>").In("<follows>").ToArray()
-			for (i in arr) g.Emit(arr[i]);
+			arr = g.V("<bob>").in("<follows>").toArray()
+			for (i in arr) g.emit(arr[i]);
 		`,
 		expect: []string{"<alice>", "<charlie>", "<dani>"},
 	},
 	{
 		message: "show ToArray with limit",
 		query: `
-			arr = g.V("<bob>").In("<follows>").ToArray(2)
-			for (i in arr) g.Emit(arr[i]);
+			arr = g.V("<bob>").in("<follows>").toArray(2)
+			for (i in arr) g.emit(arr[i]);
 		`,
 		expect: []string{"<alice>", "<charlie>"},
 	},
 	{
 		message: "show ForEach",
 		query: `
-			g.V("<bob>").In("<follows>").ForEach(function(o){g.Emit(o.id)});
+			g.V("<bob>").in("<follows>").forEach(function(o){g.emit(o.id)});
 		`,
 		expect: []string{"<alice>", "<charlie>", "<dani>"},
 	},
 	{
 		message: "show ForEach with limit",
 		query: `
-			g.V("<bob>").In("<follows>").ForEach(2, function(o){g.Emit(o.id)});
+			g.V("<bob>").in("<follows>").forEach(2, function(o){g.emit(o.id)});
 		`,
 		expect: []string{"<alice>", "<charlie>"},
 	},
@@ -539,40 +539,40 @@ var testQueries = []struct {
 		message: "clone paths",
 		query: `
 			var alice = g.V('<alice>')
-			g.Emit(alice.ToValue())
-			var out = alice.Out('<follows>')
-			g.Emit(out.ToValue())
-			g.Emit(alice.ToValue())
+			g.emit(alice.toValue())
+			var out = alice.out('<follows>')
+			g.emit(out.toValue())
+			g.emit(alice.toValue())
 		`,
 		expect: []string{"<alice>", "<bob>", "<alice>"},
 	},
 	{
 		message: "default namespaces",
 		query: `
-			g.AddDefaultNamespaces()
-			g.Emit(g.Uri('rdf:type'))
+			g.addDefaultNamespaces()
+			g.emit(g.IRI('rdf:type'))
 		`,
 		expect: []string{"<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>"},
 	},
 	{
 		message: "add namespace",
 		query: `
-			g.AddNamespace('ex','http://example.net/')
-			g.Emit(g.Uri('ex:alice'))
+			g.addNamespace('ex','http://example.net/')
+			g.emit(g.IRI('ex:alice'))
 		`,
 		expect: []string{"<http://example.net/alice>"},
 	},
 	{
 		message: "recursive follow",
 		query: `
-			g.V("<charlie>").FollowRecursive("<follows>").All();
+			g.V("<charlie>").followRecursive("<follows>").all();
 		`,
 		expect: []string{"<bob>", "<dani>", "<fred>", "<greg>"},
 	},
 	{
 		message: "recursive follow tag",
 		query: `
-			g.V("<charlie>").FollowRecursive("<follows>", "depth").All();
+			g.V("<charlie>").followRecursive("<follows>", "depth").all();
 		`,
 		tag:    "depth",
 		expect: []string{intVal(1), intVal(1), intVal(2), intVal(2)},
@@ -580,21 +580,21 @@ var testQueries = []struct {
 	{
 		message: "recursive follow path",
 		query: `
-			g.V("<charlie>").FollowRecursive(g.V().Out("<follows>")).All();
+			g.V("<charlie>").followRecursive(g.V().out("<follows>")).all();
 		`,
 		expect: []string{"<bob>", "<dani>", "<fred>", "<greg>"},
 	},
 	{
 		message: "find non-existent",
 		query: `
-			g.V('<not-existing>').ForEach(function(d){ g.Emit(d); })
+			g.V('<not-existing>').forEach(function(d){ g.emit(d); })
 		`,
 		expect: nil,
 	},
 	{
 		message: "default limit All",
 		query: `
-			g.V().All()
+			g.V().all()
 		`,
 		limit:  issue718Limit,
 		data:   issue718Graph(),
@@ -603,19 +603,19 @@ var testQueries = []struct {
 	{
 		message: "issue #758. Verify saveOpt respects label context",
 		query: `
-			g.V("<greg>").LabelContext("<smart_graph>").SaveOpt("<status>", "statusTag").All()
+			g.V("<greg>").labelContext("<smart_graph>").saveOpt("<status>", "statusTag").all()
 		`,
 		tag:    "statusTag",
-		file: multiGraphTestFile,
+		file:   multiGraphTestFile,
 		expect: []string{"smart_person"},
 	},
 	{
 		message: "issue #758. Verify saveR respects label context.",
 		query: `
-			g.V("smart_person").LabelContext("<other_graph>").SaveR("<status>", "who").All()
+			g.V("smart_person").labelContext("<other_graph>").saveR("<status>", "who").all()
 		`,
 		tag:    "who",
-		file: multiGraphTestFile,
+		file:   multiGraphTestFile,
 		expect: []string{"<fred>"},
 	},
 }
@@ -668,10 +668,10 @@ func TestGizmo(t *testing.T) {
 				test.tag = TopResultTag
 			}
 			quads := simpleGraph
-			if (test.file == multiGraphTestFile){
+			if test.file == multiGraphTestFile {
 				quads = multiGraph
 			}
-			
+
 			if test.data != nil {
 				quads = test.data
 			}
@@ -708,7 +708,9 @@ var issue160TestGraph = []quad.Quad{
 }
 
 func TestIssue160(t *testing.T) {
-	qu := `g.V().Tag('query').Out(raw('follows')).Out(raw('follows')).ForEach(function (item) { if (item.id !== item.query) g.Emit({ id: item.id }); })`
+	qu := `g.V().tag('query').out(raw('follows')).out(raw('follows')).forEach(function (item) {
+		if (item.id !== item.query) g.emit({ id: item.id });
+	})`
 	expect := []string{
 		"****\nid : alice\n",
 		"****\nid : bob\n",
@@ -737,8 +739,8 @@ func TestIssue160(t *testing.T) {
 
 func TestShapeOf(t *testing.T) {
 	ses := makeTestSession(nil)
-	const query = `g.V().ForEach(function(x){
-g.Emit({id: x.id})
+	const query = `g.V().forEach(function(x){
+g.emit({id: x.id})
 })`
 	_, err := ses.ShapeOf(query)
 	require.NoError(t, err)
@@ -764,6 +766,3 @@ func issue718Nodes() []string {
 	}
 	return nodes
 }
-
-
-