/behind-scenes-hash-table-performance-ruby-2-4/ Red Panthers - Experts in Ruby on Rails, System Design and Vue.js Fri, 03 Feb 2017 10:01:00 +0000 hourly 1 https://wordpress.org/?v=5.2.7 /behind-scenes-hash-table-performance-ruby-2-4/#comment-37 Fri, 03 Feb 2017 10:01:00 +0000 https://redpanthers.co/?p=922#comment-37 Thanks for your inputs , 3 times performance improvement for accessing keys and values are from my laptop , it can vary with the processor you have . My point was to show that some hash operations became upto 3 times time faster , not all operations became 3 times faster . I will update the post with other benchmarks to avoid confusions .

]]> /behind-scenes-hash-table-performance-ruby-2-4/#comment-36 Fri, 03 Feb 2017 07:34:00 +0000 https://redpanthers.co/?p=922#comment-36 The article proves that the benchmark presented at the beginning is misleading and suggests invalid conclusions. Since in 2.4 Hash stores list of its entries in sequential array, so the `hash.values` operation is immediate — just need to copy the array. So there is significant performance gain comparing to 2.3, but it has nothing to do with performance of usual hash operations: insert, find, delete. Results of the presented benchmark cannot be used to predict performance gain of other hash operations.

]]>