Andreas Huber 162ef1626c reduce memory usage for computation of cumulative distribution
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.
2019-09-07 18:31:18 +02:00
2019-09-01 15:44:36 +02:00
2019-08-31 16:52:13 +02:00
2019-09-01 15:44:36 +02:00
2018-11-25 07:49:04 +00:00
2018-11-20 19:13:59 +01:00
2019-08-24 19:59:06 +02:00
2019-08-31 16:52:13 +02:00
2017-04-16 09:07:28 +02:00
2019-08-24 19:59:06 +02:00
2019-07-04 09:01:39 +02:00
2016-12-04 10:41:37 +01:00
2016-12-04 10:41:37 +01:00
Description
No description provided
8.3 MiB
Languages
Java 79.4%
TypeScript 11.1%
HTML 4.5%
Python 2.8%
SCSS 1.1%
Other 0.9%