From 19f268c6c15ae15684b0f7ddb4c43872624633fd Mon Sep 17 00:00:00 2001 From: Alex Chan Date: Thu, 2 Apr 2015 04:27:57 +0100 Subject: [PATCH] A couple of small spelling fixes in the docs --- TODO.md | 2 +- docs/Configuration.md | 2 +- docs/GremlinAPI.md | 6 +++--- 3 files changed, 5 insertions(+), 5 deletions(-) diff --git a/TODO.md b/TODO.md index 1c84516..c781c8f 100644 --- a/TODO.md +++ b/TODO.md @@ -68,7 +68,7 @@ The necessary component to make mid-query limit work. Acts as a limit on Next(), ### Postgres Backend It'd be nice to run on SQL as well. It's a big why not? #### Generalist layout - Notionally, this is a simple quad table with a number of indicies. Iterators and iterator optimization (ie, rewriting SQL queries) is the 'fun' part + Notionally, this is a simple quad table with a number of indices. Iterators and iterator optimization (ie, rewriting SQL queries) is the 'fun' part #### "Short Schema" Layout? This one is the crazy one. Suppose a world where we actually use the table schema for predicates, and update the table schema as we go along. Yes, it sucks when you add a new predicate (and the cell values are unclear) but for small worlds (or, "short schemas") it may (or may not) be interesting. diff --git a/docs/Configuration.md b/docs/Configuration.md index e1ac677..470c53e 100644 --- a/docs/Configuration.md +++ b/docs/Configuration.md @@ -122,7 +122,7 @@ Optionally disable syncing to disk per transaction. Nosync being true means much * Type: String * Default: "cayley" -The name of the database within MongoDB to connect to. Manages its own collections and indicies therein. +The name of the database within MongoDB to connect to. Manages its own collections and indices therein. ## Per-Replication Options diff --git a/docs/GremlinAPI.md b/docs/GremlinAPI.md index 144b425..2c03c0e 100644 --- a/docs/GremlinAPI.md +++ b/docs/GremlinAPI.md @@ -16,7 +16,7 @@ Arguments: Returns: Query object -Starts a query path at the given vertex/verticies. No ids means "all vertices". +Starts a query path at the given vertex/vertices. No ids means "all vertices". ####**`graph.Morphism()`** @@ -98,7 +98,7 @@ g.V("D").Out() // Finds all things D points at on the status linkage. // Result is B G and cool_person g.V("D").Out(["follows", "status"]) -// Finds all things D points at on the status linkage, given from a seperate query path. +// Finds all things D points at on the status linkage, given from a separate query path. // Result is {"id": cool_person, "pred": "status"} g.V("D").Out(g.V("status"), "pred") ``` @@ -327,7 +327,7 @@ Starts as if at the g.M() and follows through the morphism path. Example: ```javascript: friendOfFriend = g.Morphism().Out("follows").Out("follows") -// Returns the followed people of who C follows -- a simplistic "friend of my frind" +// Returns the followed people of who C follows -- a simplistic "friend of my friend" // and whether or not they have a "cool" status. Potential for recommending followers abounds. // Returns B and G g.V("C").Follow(friendOfFriend).Has("status", "cool_person")