forked from vigna/fastutil
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTODO
17 lines (17 loc) · 735 Bytes
/
TODO
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
- Loops in sorting for big arrays should use real indices, not get/set
- Check that binary insertion sort is maybe better
- radix sort for big arrays
- Navigable sets and maps
- Front-Coded Array BIG lists
- Make digit array in radix sort shorter
- FastIterable interface
- Try tripartite quickSort or TimSort for generic sorting.
- http://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html
- http://java-performance.info/large-hashmap-overview-jdk-fastutil-goldman-sachs-hppc-koloboke-trove
- http://shipilev.net/
- http://java-performance.info/jmh/
- Big maps
- Cilksort
- Tune threshold for non-recursive sorts
- parallel indirect radix sort of two arrays
- Array-based maps do not implement remove in the EntrySet (!)