131 lines
3.7 KiB
Go
131 lines
3.7 KiB
Go
// Copyright 2014 The Cayley Authors. All rights reserved.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package iterator
|
|
|
|
import (
|
|
"reflect"
|
|
"testing"
|
|
|
|
"github.com/google/cayley/graph"
|
|
"github.com/google/cayley/quad"
|
|
)
|
|
|
|
func hasaWithTag(qs graph.QuadStore, tag string, target string) *HasA {
|
|
and := NewAnd()
|
|
|
|
obj := qs.FixedIterator()
|
|
obj.Add(qs.ValueOf(target))
|
|
obj.Tagger().Add(tag)
|
|
and.AddSubIterator(NewLinksTo(qs, obj, quad.Object))
|
|
|
|
pred := qs.FixedIterator()
|
|
pred.Add(qs.ValueOf("status"))
|
|
and.AddSubIterator(NewLinksTo(qs, pred, quad.Predicate))
|
|
|
|
return NewHasA(qs, and, quad.Subject)
|
|
}
|
|
|
|
func TestQueryShape(t *testing.T) {
|
|
qs := &store{
|
|
data: []string{
|
|
1: "cool",
|
|
2: "status",
|
|
3: "fun",
|
|
4: "name",
|
|
},
|
|
}
|
|
|
|
// Given a single linkage iterator's shape.
|
|
hasa := hasaWithTag(qs, "tag", "cool")
|
|
hasa.Tagger().Add("top")
|
|
|
|
shape := make(map[string]interface{})
|
|
OutputQueryShapeForIterator(hasa, qs, shape)
|
|
|
|
nodes := shape["nodes"].([]Node)
|
|
if len(nodes) != 3 {
|
|
t.Errorf("Failed to get correct number of nodes, got:%d expect:4", len(nodes))
|
|
}
|
|
links := shape["links"].([]Link)
|
|
if len(nodes) != 3 {
|
|
t.Errorf("Failed to get correct number of links, got:%d expect:1", len(links))
|
|
}
|
|
|
|
// Nodes should be correctly tagged.
|
|
nodes = shape["nodes"].([]Node)
|
|
for i, expect := range [][]string{{"tag"}, nil, {"top"}} {
|
|
if !reflect.DeepEqual(nodes[i].Tags, expect) {
|
|
t.Errorf("Failed to get correct tag for node[%d], got:%s expect:%s", i, nodes[i].Tags, expect)
|
|
}
|
|
}
|
|
if !nodes[1].IsLinkNode {
|
|
t.Error("Failed to get node[1] as link node")
|
|
}
|
|
|
|
// Link should be correctly typed.
|
|
nodes = shape["nodes"].([]Node)
|
|
link := shape["links"].([]Link)[0]
|
|
if link.Source != nodes[2].ID {
|
|
t.Errorf("Failed to get correct link source, got:%v expect:%v", link.Source, nodes[2].ID)
|
|
}
|
|
if link.Target != nodes[0].ID {
|
|
t.Errorf("Failed to get correct link target, got:%v expect:%v", link.Target, nodes[0].ID)
|
|
}
|
|
if link.LinkNode != nodes[1].ID {
|
|
t.Errorf("Failed to get correct link node, got:%v expect:%v", link.LinkNode, nodes[1].ID)
|
|
}
|
|
if link.Pred != 0 {
|
|
t.Errorf("Failed to get correct number of predecessors:%v expect:0", link.Pred)
|
|
}
|
|
|
|
// Given a name-of-an-and-iterator's shape.
|
|
andInternal := NewAnd()
|
|
|
|
hasa1 := hasaWithTag(qs, "tag1", "cool")
|
|
hasa1.Tagger().Add("hasa1")
|
|
andInternal.AddSubIterator(hasa1)
|
|
|
|
hasa2 := hasaWithTag(qs, "tag2", "fun")
|
|
hasa2.Tagger().Add("hasa2")
|
|
andInternal.AddSubIterator(hasa2)
|
|
|
|
pred := qs.FixedIterator()
|
|
pred.Add(qs.ValueOf("name"))
|
|
|
|
and := NewAnd()
|
|
and.AddSubIterator(NewLinksTo(qs, andInternal, quad.Subject))
|
|
and.AddSubIterator(NewLinksTo(qs, pred, quad.Predicate))
|
|
|
|
shape = make(map[string]interface{})
|
|
OutputQueryShapeForIterator(NewHasA(qs, and, quad.Object), qs, shape)
|
|
|
|
links = shape["links"].([]Link)
|
|
if len(links) != 3 {
|
|
t.Errorf("Failed to find the correct number of links, got:%d expect:3", len(links))
|
|
}
|
|
nodes = shape["nodes"].([]Node)
|
|
if len(nodes) != 7 {
|
|
t.Errorf("Failed to find the correct number of nodes, got:%d expect:7", len(nodes))
|
|
}
|
|
var n int
|
|
for _, node := range nodes {
|
|
if node.IsLinkNode {
|
|
n++
|
|
}
|
|
}
|
|
if n != 3 {
|
|
t.Errorf("Failed to find the correct number of link nodes, got:%d expect:3", n)
|
|
}
|
|
}
|