當前位置: 首頁>>代碼示例>>Golang>>正文


Golang graph.NewResultTree函數代碼示例

本文整理匯總了Golang中github.com/google/cayley/graph.NewResultTree函數的典型用法代碼示例。如果您正苦於以下問題:Golang NewResultTree函數的具體用法?Golang NewResultTree怎麽用?Golang NewResultTree使用的例子?那麽, 這裏精選的函數代碼示例或許可以為您提供幫助。


在下文中一共展示了NewResultTree函數的12個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的Golang代碼示例。

示例1: GetResultTree

// 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
}
開發者ID:heshizhu,項目名稱:cayley,代碼行數:8,代碼來源:or_iterator.go

示例2: ResultTree

// 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
}
開發者ID:Joeento,項目名稱:cayley,代碼行數:9,代碼來源:and_iterator.go

示例3: ResultTree

func (it *Iterator) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
開發者ID:kris-lab,項目名稱:cayley,代碼行數:3,代碼來源:iterator.go

示例4: ResultTree

// DEPRECATED
func (it *LinksTo) ResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.Result())
	tree.AddSubtree(it.primaryIt.ResultTree())
	return tree
}
開發者ID:neevor,項目名稱:cayley,代碼行數:6,代碼來源:linksto_iterator.go

示例5: ResultTree

// DEPRECATED
func (it *Fixed) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
開發者ID:ericcapricorn,項目名稱:cayley,代碼行數:4,代碼來源:fixed_iterator.go

示例6: ResultTree

// DEPRECATED
func (it *Comparison) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
開發者ID:neevor,項目名稱:cayley,代碼行數:4,代碼來源:value_comparison_iterator.go

示例7: ResultTree

// DEPRECATED
func (it *Int64) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
開發者ID:jacqui,項目名稱:cayley,代碼行數:4,代碼來源:all_iterator.go

示例8: ResultTree

// DEPRECATED
func (it *Base) ResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.Result())
	return tree
}
開發者ID:ZSIT,項目名稱:cayley,代碼行數:5,代碼來源:iterator.go

示例9: ResultTree

func (it *Null) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
開發者ID:neevor,項目名稱:cayley,代碼行數:3,代碼來源:iterator.go

示例10: GetResultTree

// DEPRECATED Return results in a ResultTree.
func (it *HasA) GetResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.LastResult())
	tree.AddSubtree(it.primaryIt.GetResultTree())
	return tree
}
開發者ID:heshizhu,項目名稱:cayley,代碼行數:6,代碼來源:hasa_iterator.go

示例11: ResultTree

// DEPRECATED
func (it *Optional) ResultTree() *graph.ResultTree {
	return graph.NewResultTree(it.Result())
}
開發者ID:neevor,項目名稱:cayley,代碼行數:4,代碼來源:optional_iterator.go

示例12: ResultTree

// DEPRECATED
func (it *Materialize) ResultTree() *graph.ResultTree {
	tree := graph.NewResultTree(it.Result())
	tree.AddSubtree(it.subIt.ResultTree())
	return tree
}
開發者ID:ericcapricorn,項目名稱:cayley,代碼行數:6,代碼來源:materialize_iterator.go


注:本文中的github.com/google/cayley/graph.NewResultTree函數示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。