If I understand rightly, the values in the slice are to be interpreted (key, value) pairs? In that case, the natural thing to me is to build a map. This also takes care of "duplicate key, last value wins". You can then sort the keys and convert it back: https://play.golang.org/p/dTjmO18T1vQ
However, I think that a slice of adjacent keys and values is not a particularly natural way to represent this data; it's clearer to make a structure which holds keys and vals. https://play.golang.org/p/jq358XyKLlx On Saturday, 13 March 2021 at 13:37:21 UTC va...@selfip.ru wrote: > Hi! > I'm stuck at sorting stuff like > > []string{"xxxkey","xxxval","zzzkey","zzzval","aaakey","aaaval","zzzkey","ggggval"} > i need to get after sorting something like > []string{"aaakey","aaaval", "xxxkey","xxxval","zzzkey","ggggval"} > > So i'm sort by "key" and if key is duplicated - last wins. > Mostly i want to avoid creating helper slices that contains keys and > vals dedicated, does it possible to do sorting only by swapping > "key/val" ? > > -- > Vasiliy Tolstov, > e-mail: v.to...@selfip.ru > -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/golang-nuts/8eaa86e7-8787-4fc3-bed6-761586825cefn%40googlegroups.com.
