// 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 }
// 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 }
func (it *Iterator) ResultTree() *graph.ResultTree { return graph.NewResultTree(it.Result()) }
// DEPRECATED func (it *LinksTo) ResultTree() *graph.ResultTree { tree := graph.NewResultTree(it.Result()) tree.AddSubtree(it.primaryIt.ResultTree()) return tree }
// DEPRECATED func (it *Fixed) ResultTree() *graph.ResultTree { return graph.NewResultTree(it.Result()) }
// DEPRECATED func (it *Comparison) ResultTree() *graph.ResultTree { return graph.NewResultTree(it.Result()) }
// DEPRECATED func (it *Int64) ResultTree() *graph.ResultTree { return graph.NewResultTree(it.Result()) }
// DEPRECATED func (it *Base) ResultTree() *graph.ResultTree { tree := graph.NewResultTree(it.Result()) return tree }
func (it *Null) ResultTree() *graph.ResultTree { return graph.NewResultTree(it.Result()) }
// DEPRECATED Return results in a ResultTree. func (it *HasA) GetResultTree() *graph.ResultTree { tree := graph.NewResultTree(it.LastResult()) tree.AddSubtree(it.primaryIt.GetResultTree()) return tree }
// DEPRECATED func (it *Optional) ResultTree() *graph.ResultTree { return graph.NewResultTree(it.Result()) }
// DEPRECATED func (it *Materialize) ResultTree() *graph.ResultTree { tree := graph.NewResultTree(it.Result()) tree.AddSubtree(it.subIt.ResultTree()) return tree }