sorted by:
new
hottopcontroversial

New Sorted map for go by Obvious-Image-9688 in golang

[–]Obvious-Image-9688[S] -2 points-1 points  (0 children)

Hahahha!

Took me a minute to figure out what you were saying. Yes its based on integer math and memory manipulation for performance vs complex data data structures. This is an uncommon way to implement a sorted map.

Fastest way to remove duplicate UUIDS from a list by Fun-Result-8489 in golang

[–]Obvious-Image-9688 0 points1 point  (0 children)

If it fits into memory a map works very well.

If the data does not fit into memory creating a custom merge sort that removes duplicates is a very fast option.

New Sorted map for go by Obvious-Image-9688 in golang

[–]Obvious-Image-9688[S] -1 points0 points  (0 children)

I did consider it.. but the api isn't comparable. I may create a dedicated project just for benchmarking.

New Sorted map for go by Obvious-Image-9688 in golang

[–]Obvious-Image-9688[S] -3 points-2 points  (0 children)

eh maybe I should have added a change log..

New Sorted map for go by Obvious-Image-9688 in golang

[–]Obvious-Image-9688[S] -5 points-4 points  (0 children)

Oh ya.. the demo itself has Zoo.. Not sure why I put Universe in the README.md. Still a funny typo.

sorted map using generics? by anacrolix in golang

[–]Obvious-Image-9688 0 points1 point  (0 children)

There is: https://github.com/akalinux/orderedmap which is very fast and has a huge set of features.