Method orderedEntries

configs/install_report.go:199–248

()

}

func (i *installReport) orderedEntries() []installReportEntry {
	// Convert map to slice for deterministic ordering in report output.
	ordered := make([]installReportEntry, 0, len(i.entries))
	for _, entry := range i.entries {
		ordered = append(ordered, entry)
	}

	// Multi-key sort (high priority -> low priority):
	// 1) dependency type group: runtime, buildtime, native
	// 2) parent package
	// 3) package itself
	// 4) build system
	// 5) install source
	sort.SliceStable(ordered, func(first, second int) bool {
		left := ordered[first]
		right := ordered[second]

		// Keep type groups together and in configured rank order.
		leftRank := i.dependencyTypeRank(i.dependencyTypeOf(left))
		rightRank := i.dependencyTypeRank(i.dependencyTypeOf(right))
		if leftRank != rightRank {
			return leftRank < rightRank
		}

		// Normalize empty parent to "-" so root entries can be compared consistently.
		leftParent := left.Parent
		rightParent := right.Parent
		if strings.TrimSpace(leftParent) == "" {
			leftParent = "-"
		}
		if strings.TrimSpace(rightParent) == "" {
			rightParent = "-"
		}
		if leftParent != rightParent {
			return leftParent < rightParent
		}

		// Then order by package identity and remaining metadata for stable output.
		if left.Port != right.Port {
			return left.Port < right.Port
		}

		if left.BuildSystem != right.BuildSystem {
			return left.BuildSystem < right.BuildSystem
		}
		return left.InstalledFrom < right.InstalledFrom
	})

	return ordered
}

func (i *installReport) write(p *Port) (string, error) {
	if i == nil || p == nil {