barak/cayley
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

A couple of small spelling fixes in the docs

Browse source
This commit is contained in:
Alex Chan 2015-04-02 04:27:57 +01:00
parent 2c74cb1657
commit 19f268c6c1
3 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

2
TODO.md
View file

@ -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.

2
docs/Configuration.md
View file

@ -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

6
docs/GremlinAPI.md
View file

@ -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")