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

Enumerate iterator types

Browse source
This commit is contained in:
kortschak 2014-07-03 09:57:31 +09:30
parent 1f67913ed9
commit cd46452b63
23 changed files with 145 additions and 68 deletions
Download patch file Download diff file Expand all files Collapse all files

10
graph/sexp/parser_test.go
View file

@ -36,7 +36,7 @@ func TestParseSexpWithMemstore(t *testing.T) {
Convey("It should parse an empty query", func() {
it := BuildIteratorTreeForQuery(ts, "()")
So(it.Type(), ShouldEqual, "null")
So(it.Type(), ShouldEqual, graph.Null)
})
Convey("It should get a single triple linkage", func() {
@ -44,7 +44,7 @@ func TestParseSexpWithMemstore(t *testing.T) {
query := "($a (:can \"win\"))"
So(len(query), ShouldEqual, 17)
it := BuildIteratorTreeForQuery(ts, query)
So(it.Type(), ShouldEqual, "and")
So(it.Type(), ShouldEqual, graph.And)
out, ok := it.Next()
So(ok, ShouldBeTrue)
So(out, ShouldEqual, ts.ValueOf("i"))
@ -54,7 +54,7 @@ func TestParseSexpWithMemstore(t *testing.T) {
ts.AddTriple(&graph.Triple{"i", "can", "win", ""})
query := "(\"i\" (:can $a))"
it := BuildIteratorTreeForQuery(ts, query)
So(it.Type(), ShouldEqual, "and")
So(it.Type(), ShouldEqual, graph.And)
out, ok := it.Next()
So(ok, ShouldBeTrue)
So(out, ShouldEqual, ts.ValueOf("i"))
@ -71,7 +71,7 @@ func TestTreeConstraintParse(t *testing.T) {
"(:like\n" +
"($a (:is :good))))"
it := BuildIteratorTreeForQuery(ts, query)
if it.Type() != "and" {
if it.Type() != graph.And {
t.Error("Odd iterator tree. Got: %s", it.DebugString(0))
}
out, ok := it.Next()
@ -112,7 +112,7 @@ func TestMultipleConstraintParse(t *testing.T) {
"(:like :beer)\n" +
"(:like \"food\"))"
it := BuildIteratorTreeForQuery(ts, query)
if it.Type() != "and" {
if it.Type() != graph.And {
t.Error("Odd iterator tree. Got: %s", it.DebugString(0))
}
out, ok := it.Next()