162ef1626ca4988afb689a81c30be37f72120184
Before: To compute the cumulative distribution we added every duration into a LongList. This requires O(n) memory, where n is the number of values. Now: We store the durations + the number of occurrences in a LongLongHashMap. This has the potential to reduce the memory requirements if durations occur multiple times. There are a lot of durations with 0, 1, 2 milliseconds. In the worst case every duration is different. In that case the memory usage doubled with this solution. Future: We are currently storing durations with milli seconds precision. We don't have to do that. We cannot draw 100 million different values on the y-axis in an images with only 1000px.
Description
No description provided
Languages
Java
79.4%
TypeScript
11.1%
HTML
4.5%
Python
2.8%
SCSS
1.1%
Other
0.9%