Why Hashes Will Be Faster in Ruby 2.0 by Pat Shaughnessy, VIDEO
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.
Other Videos By Confreaks 2012-07-01 Goruco 2012 Building Developers Lessons Learned from Hungry Academy by Jeff Casimir, 2012-07-01 GORUCO 2012 The Future of Deployment by Nic Williams 2012-07-01 GoRuCo 2012 Hexagonal Rails by Matt Wynne 2012-07-01 Goruco 2012 Power Rake by Jim Weirich, 2012-07-01 Better Ruby Through Design Principles by Mike Gehard, 2012-07-01 Maintaining Balance while Reducing Duplication: Part II by David Chelimsky, 2012-07-01 Goruco 2012 Sensible Testing by Justin Leitgeb, 2012-07-01 GoRuCo 2012 Maps want to be free! by Sebastian Delmont, 2012-07-01 GoRuCo 2012 From Zero to API Cache w Grape & MongoDB in 10 minutes by Daniel Doubrovkine, 2012-07-01 GoRuCo 2012 Building Developers Lessons Learned from Hungry Academy by Jeff Casimir 2012-07-01 Why Hashes Will Be Faster in Ruby 2.0 by Pat Shaughnessy, 2012-07-01 Organizing and Packaging Rich Javascript Apps with Ruby by Luke Melia, 2012-07-01 High Perfmance Caching with Rails by Matt Duncan, 2012-07-01 Your Face in 10 minutes... with Macruby! by Haris Amin, 2012-07-01 The Front-End Future by Francis Hwang 2012-06-21 What a long Strange Trip it has been. by Ezra Zygmuntowicz 2012-06-20 Basic Rake by Jim Weirich 2012-06-20 Preparing for Rapid Growth - Tips for Enabling Your App and Team to Grow by Patrick Leonard 2012-06-20 Building Asynchronous Communication Layer w XMPP, Ruby, Javascript by Andrew Carter and Steve Jang 2012-06-20 Engine Yard - The Cloud, Application Support, and You - Ask Me Anything 2012-06-20 A Polygot Heroku by Terrance Lee
Tags: goruco
goruco2012
Ruby (programming language)
2.0
ruby
hashes