Skip to content

Latest commit

 

History

History
57 lines (34 loc) · 1.88 KB

Why-Hashes-Will-Be-Faster-in-Ruby-2.0.md

File metadata and controls

57 lines (34 loc) · 1.88 KB
Raw

From [[Goruco 2012]]

Presenter: Pat Shaughnessy

Bio

Pat Shaughnessy is a Ruby developer working at a global management consulting firm. Pat also writes a blog about Ruby development at http://patshaughnessy.net, and is working on an eBook about Ruby Internals. Pat's articles and presentations have been featured multiple times on the Ruby Weekly newsletter, the Ruby5 podcast and the Ruby Show. When he's not at the keyword, Pat enjoys spending time with his wife and two kids. Pat is also a fluent Spanish speaker and travels frequently to Spain to visit his wife's family.

Abstract

In this micro talk, I'll review the basic theory behind hash functions and hash tables, show you the new internal data structures that Ruby 2.0 uses to save keys and values, and present some performance data that proves this optimization exists and how much time it will actually save you.

Summary

TODO

  • Don't have time to read the whole thing?
  • Here are the takeaways.
  • "This page in a nutshell."

Memorable Quotes

TODO

  • This section applies sometimes.
  • "Android is the new IE." - [[John Bender|Progressive Enhancement on the Mobile Web]]

Notes

TODO

From @username1:

  • This layout is just a suggestion.
  • It's kinda based on how Wikipedia is organized (e.g. an "External Links" section)
  • Bullet points might work well. Paragraphs too. Up to you. :)
  • This section is probably enough, but just in case here are some other ideas...

From @username2:

  • It's best to leave "username dividers" to prevent merge conflicts later.

Discussion

TODO

  • If some stuff is controversial, thought provoking, etc, we can have something like this.
  • Kind of like "Talk" pages on Wikipedia.
  • Sign it with your GitHub username, please. - benjaminoakes

External Links

TODO