Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
japanac
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
japanac
10y ago
consider an even simpler example of wanting an array that contains no duplicates and is sorted. i can write the logic for that in 5 minutes, but it will be bother memory and cpu inefficient. i would spend another 20 minutes optimizing that
2.
▲
by
japanac
10y ago
these two are the same, since one uses the other. i agree with you as the author of gods, that if it fits your problem, then use golang map by all means. however, if you use golang map and realize that your problem needs the keys to be orde
3.
▲
GoDS (Go Data Structures) (golang)
(github.com)
16 points
by
japanac
10y ago
|
5 comments