Why Hashes Will Be Faster in Ruby 2.0

Why Hashes Will Be Faster in Ruby 2.0Pat Shaughnessyhttp://patshaughnessy.net@pat_shaughnessyMcKinsey & Co.

h = {}=> {}h[:key] = value=> "value"h[:key]=> "value"

Time to retrieve 10000 values (ms) 3 2.5 2 1.5 1 0.5 1 100 10,000 1,000,000 Hash size

0 1 2 3 4 5 6 7 8 9 10 st_table_entry hash key record next

func(key) = hash

:key.hash=> 4321153767602860351"abcdef".hash=> -1182018534040789564

hash % 11 = bin index

0 1 2 3 4 5 6 7 8 9 10 st_table_entry hash key record next

0 1 2 3 4 5 6 7 8 9 10 st_table_entry st_table_entry hash hash key key record record next next

0 1 2 3 4 5 6 7 8 9 10 st_table_entry st_table_entry st_table_entry hash hash hash key key key record record record next next next

0 1 2 3 4 5 6 7 8 9 10 st_table_entry st_table_entry st_table_entry hash hash hash key key key record record record next next next st_table_entry hash key record next

0 1 2 3 4 5 6 7 8 9 10entry entry entry entry entry entry entry entry entry entry entryentry entry entry entry entry entry entry entry entry entry entryentry entry entry entry entry entry entry entry entry entry entryentry entry entry entry entry entry entry entryentry entry entry

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entryentry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entryentry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entry entryentry entry entry entry entry entry entry entry

Hashes in Ruby 2.0

0 1 2 3 4 5 6 7 8 9 10 malloc st_table_entry hash key record next Ruby 1.8, Ruby 1.9

:key => :key2 => :key3 => :key4 => :key5 => :key6 => value value2 value3 value4 value5 value6 st_table_entry st_table_entry st_table_entry hash hash hash key key key record record record next next next Ruby 2.0 - ﬁrst 6 elements

Hashes are Arrays!

Time to add 1 element 10,000 times (ms) 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Hash size

6% improvement0 Loading 10,000 small records

2.6% improvementRails App: Ruby Execution Time

How many hashes?describe "GET index" do it "assigns all people as @people" do person = Person.create! valid_attributes get :index, {}, valid_session assigns(:people).should eq([person]) endend 5?

How many hashes?describe "GET index" do it "assigns all people as @people" do person = Person.create! valid_attributes get :index, {}, valid_session assigns(:people).should eq([person]) endend 5 50?

How many hashes?describe "GET index" do it "assigns all people as @people" do person = Person.create! valid_attributes get :index, {}, valid_session assigns(:people).should eq([person]) endend 50 409!

http://patshaughnessy.net/ruby-under-a-microscope

Why Hashes Will Be Faster in Ruby 2.0

by Pat Shaughnessy on Jun 24, 2012

Accessibility

Categories

Upload Details

Usage Rights

2 Embeds 753

Statistics

Why Hashes Will Be Faster in Ruby 2.0 Presentation Transcript

http://lanyrd.com	752
http://webcache.googleusercontent.com	1