예제 #1
0
// DEPRECATED Returns the ResultTree for this graph.iterator, recurses to it's subiterators.
func (it *Or) GetResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.LastResult())
	for _, sub := range it.internalIterators {
		tree.AddSubtree(sub.GetResultTree())
	}
	return tree
}
예제 #2
0
// DEPRECATED Returns the ResultTree for this iterator, recurses to it's subiterators.
func (it *And) ResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.Result())
	tree.AddSubtree(it.primaryIt.ResultTree())
	for _, sub := range it.internalIterators {
		tree.AddSubtree(sub.ResultTree())
	}
	return tree
}
예제 #3
0
파일: iterator.go 프로젝트: kris-lab/cayley 
func (it *Iterator) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
예제 #4
0
// DEPRECATED
func (it *LinksTo) ResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.Result())
	tree.AddSubtree(it.primaryIt.ResultTree())
	return tree
}
예제 #5
0
// DEPRECATED
func (it *Fixed) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
예제 #6
0
// DEPRECATED
func (it *Comparison) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
예제 #7
0
// DEPRECATED
func (it *Int64) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
예제 #8
0
파일: iterator.go 프로젝트: ZSIT/cayley 
// DEPRECATED
func (it *Base) ResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.Result())
	return tree
}
예제 #9
0
파일: iterator.go 프로젝트: neevor/cayley 
func (it *Null) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
예제 #10
0
// DEPRECATED Return results in a ResultTree.
func (it *HasA) GetResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.LastResult())
	tree.AddSubtree(it.primaryIt.GetResultTree())
	return tree
}
예제 #11
0
// DEPRECATED
func (it *Optional) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
예제 #12
0
// DEPRECATED
func (it *Materialize) ResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.Result())
	tree.AddSubtree(it.subIt.ResultTree())
	return tree
}