func sortedInsert()

in hub/hub.go [436:442]

• 7 lines of code
• 1 McCabe index (conditional complexity)

func sortedInsert(data []*dto.Metric, el *dto.Metric) []*dto.Metric {
	index := sort.Search(len(data), func(i int) bool { return *data[i].TimestampMs > *el.TimestampMs })
	data = append(data, &dto.Metric{})
	copy(data[index+1:], data[index:])
	data[index] = el
	return data
}