haskell / vector

An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework .
Other
367 stars 139 forks source link

[WIP] Remove Skip constructor from streams #448

Open noughtmare opened 2 years ago

noughtmare commented 2 years ago
benchmark old time old unit old deviation new time new unit new deviation change
listRank: 196 ms ± 16 ms 198.00 ms ± 14 ms -1.01%
rootfix: 9.88 ms ± 942 μs 9.01 ms ± 845 μs 9.66%
leaffix: 10.30 ms ± 849 μs 8.87 ms ± 608 μs 16.12%
awshcc: 405 ms ± 23 ms 353.00 ms ± 35 ms 14.73%
hybcc: 60.70 ms ± 5.7 ms 62.80 ms ± 4.2 ms -3.34%
quickhull: 75.70 ms ± 3.7 ms 65.50 ms ± 5.3 ms 15.57%
spectral: 3.91 ms ± 351 μs 2.73 ms ± 143 μs 43.22%
tridiag: 86.00 ms ± 6.3 ms 20.10 ms ± 1.7 ms 327.86%
mutableSet: 89.30 ms ± 6.3 ms 89.20 ms ± 7.6 ms 0.11%
findIndexR: 260 μs ± 14 μs 234.00 μs ± 15 μs 11.11%
findIndexR_naïve: 71.40 ms ± 3.6 ms 70.10 ms ± 4.4 ms 1.85%
findIndexR_manual: 362 μs ± 29 μs 353.00 μs ± 35 μs 2.55%
minimumOn: 4.59 ms ± 353 μs 4.53 ms ± 432 μs 1.32%
maximumOn: 4.53 ms ± 429 μs 4.54 ms ± 425 μs -0.22%