Caped sorted insert for already sorted slices

capedSortedInsert.go

// Inserts new item to a sorted list by still keeping it sorted and keeping the length to at most "max" elements.
func CapedSortedInsert[T any](items []T, item T, max int, cmpValue func(a, b T) int) []T {
	insertionIndex := len(items)

	for i, val := range items {
		if cmpValue(item, val) == 1 {
			insertionIndex = i
			break
		}
	}

	items = slices.Insert(items, insertionIndex, item)

	if len(items) > max {
		return items[:max]
	}

	return items
}