Method Queue

core/compiler/graphs/graph.go:124–174

(pkg *models.Package, allDeps bool)

}

func (g *GraphItem) Queue(pkg *models.Package, allDeps bool) *NodeQueue {
	g.lock()
	queue := NodeQueue{}
	queue.New()
	nodes := g.nodes
	for key := 0; key < len(nodes); key++ {
		if !pkg.Lock.GetInstalled(nodes[key].Dep).Changed && !allDeps {
			nodes = removeNode(nodes, key)
			key--
		}
	}

	var redo = true
	for {
		if !redo {
			break
		}
		redo = false
		for _, node := range nodes {
			usedBy := g.usedBy[node.Value]
			if !containsAll(nodes, usedBy) {
				for _, consumerNode := range usedBy {
					installed := pkg.Lock.GetInstalled(consumerNode.Dep)
					installed.Changed = true
					pkg.Lock.SetInstalled(consumerNode.Dep, installed)
					if !contains(nodes, consumerNode) {
						redo = true
						nodes = append(nodes, consumerNode)
					}
				}
			}
		}
	}

	for {
		if len(nodes) == 0 {
			break
		}

		for key := 0; key < len(nodes); key++ {
			node := nodes[key]
			if !containsOne(g.depends[node.Value], nodes) {
				queue.Enqueue(*node)
				nodes = removeNode(nodes, key)
				key--
			}
		}
	}
	g.unlock()
	return &queue
}

type NodeQueue struct {
	items []Node