func SortKeys(vs []reflect.Value) []reflect.Value {
	if len(vs) == 0 {
		return vs
	}

	// Sort the map keys.
	sort.Slice(vs, func(i, j int) bool { return isLess(vs[i], vs[j]) })

	// Deduplicate keys (fails for NaNs).
	vs2 := vs[:1]
	for _, v := range vs[1:] {
		if isLess(vs2[len(vs2)-1], v) {
			vs2 = append(vs2, v)
		}
	}
	return vs2
}
func SortKeys(vs []reflect.Value) []reflect.Value {
	if len(vs) == 0 {
		return vs
	}

	
	sort.Slice(vs, func(i, j int) bool { return isLess(vs[i], vs[j]) })

	
	vs2 := vs[:1]
	for _, v := range vs[1:] {
		if isLess(vs2[len(vs2)-1], v) {
			vs2 = append(vs2, v)
		}
	}
	return vs2
}
func SortKeys ( vs [ ] reflect . Value ) [ ] reflect . Value { if len ( vs ) == 0 { return vs } // Sort the map keys. sort . Slice ( vs , func ( i , j int ) bool { return isLess ( vs [ i ] , vs [ j ] ) } ) // Deduplicate keys (fails for NaNs). vs2 := vs [ : 1 ] for _ , v := range vs [ 1 : ] { if isLess ( vs2 [ len ( vs2 ) - 1 ] , v ) { vs2 = append ( vs2 , v ) } } return vs2 }
// SortKeys sorts a list of map keys, deduplicating keys if necessary.
// The type of each value must be comparable.
SortKeys sorts a list of map keys deduplicating keys if necessary . The type of each value must be comparable .