(dict map[string]T)
| 129 | } |
| 130 | |
| 131 | func sortedKeys[T any](dict map[string]T) []string { |
| 132 | keys := make([]string, 0, len(dict)) |
| 133 | for k := range dict { |
| 134 | keys = append(keys, k) |
| 135 | } |
| 136 | sort.Strings(keys) |
| 137 | return keys |
| 138 | } |
no outgoing calls
no test coverage detected
searching dependent graphs…