Method Enqueue

common/sync/merger/tree-node.go:171–179

Enqueue recursively appends al tree.N and the children's tree.N to a slice

(nodes []tree.N)

// Enqueue recursively appends al tree.N and the children's tree.N to a slice
func (t *TreeNode) Enqueue(nodes []tree.N) []tree.N {
	nodes = append(nodes, t.N)
	if !t.IsLeaf() {
		for _, c := range t.SortedChildren() {
			nodes = c.Enqueue(nodes)
		}
	}
	return nodes
}

// SortedChildren sorts children by their labels. An internal flag avoids resorting if
// it was already sorted once.