@@ -96,17 +96,17 @@ Talking about performance, how performant are the new collections compared to th
96
96
Again, the answer depends on the type of collection, the operations and the number of elements.
97
97
My ` Vector ` benchmarks show a 35% speedup on average:
98
98
99
- ![ ] ( /resources/img/new-collections-performance-filter.png )
99
+ ![ ] ( /resources/img/blog/ new-collections-performance-filter.png )
100
100
101
- ![ ] ( /resources/img/new-collections-performance-map.png )
101
+ ![ ] ( /resources/img/blog/ new-collections-performance-map.png )
102
102
103
- ![ ] ( /resources/img/new-collections-performance-flatMap.png )
103
+ ![ ] ( /resources/img/blog/ new-collections-performance-flatMap.png )
104
104
105
- These charts show the execution time (vertically) of the ` filter ` , ` map ` and ` flatMap `
106
- operations, according to the number of elements (horizontally). Note that scales are
107
- logarithmic in both axes. The blue line shows the performance of the old ` Vector ` ,
108
- the green line shows the performance of the new ` Vector ` if it used only view based
109
- implementations, and the red line shows the actual performance of the new ` Vector `
105
+ These charts show the speedup factor (vertically) of the ` filter ` , ` map ` and ` flatMap `
106
+ operations execution compared to the old ` Vector ` , for various number of elements (horizontally).
107
+ The blue line shows the old ` Vector ` ,
108
+ the red line shows the new ` Vector ` if it used only view based
109
+ implementations, and the yellow line shows the actual new ` Vector `
110
110
(with strict optimized implementations). Benchmark source code and numbers can be found
111
111
[ here] ( https://gist.github.com/julienrf/f1cb2b062cd9783a35e2f35778959c76 ) .
112
112
0 commit comments