Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
The Value of Being Lazy
Search
Erik Berlin
November 24, 2015
Programming
3
770
The Value of Being Lazy
…or How I Made OpenStruct 10X Faster
Presented at Rails Israel 2015.
Erik Berlin
November 24, 2015
Tweet
Share
More Decks by Erik Berlin
See All by Erik Berlin
Enumerator::Lazy
sferik
2
560
Ruby Trivia 3
sferik
0
700
Ruby Trivia 2
sferik
0
750
Ruby Trivia
sferik
2
1.3k
💀 Symbols
sferik
5
1.9k
Content Negotiation for REST APIs
sferik
8
980
Writing Fast Ruby
sferik
628
61k
Mutation Testing with Mutant
sferik
5
1.1k
Other Decks in Programming
See All in Programming
ASP.NETアプリケーションのモダナイズ インフラ編
tomokusaba
1
380
WindowInsetsだってテストしたい
ryunen344
1
190
イベントストーミングから始めるドメイン駆動設計
jgeem
4
860
Cursor Meetup Tokyo ゲノミクスとCursor: 進化と制約のあいだ
koido
2
1k
Benchmark
sysong
0
220
Go1.25からのGOMAXPROCS
kuro_kurorrr
1
770
Bytecode Manipulation 으로 생산성 높이기
bigstark
2
360
Javaに鉄道指向プログラミング (Railway Oriented Pro gramming) のエッセンスを取り入れる/Bringing the Essence of Railway-Oriented Programming to Java
cocet33000
2
580
deno-redisの紹介とJSRパッケージの運用について (toranoana.deno #21)
uki00a
0
120
AIコーディング道場勉強会#2 君(エンジニア)たちはどう生きるか
misakiotb
1
240
Julia という言語について (FP in Julia « SIDE: F ») for 関数型まつり2025
antimon2
3
960
第9回 情シス転職ミートアップ 株式会社IVRy(アイブリー)の紹介
ivry_presentationmaterials
1
180
Featured
See All Featured
The Straight Up "How To Draw Better" Workshop
denniskardys
233
140k
[RailsConf 2023] Rails as a piece of cake
palkan
55
5.6k
Learning to Love Humans: Emotional Interface Design
aarron
273
40k
Raft: Consensus for Rubyists
vanstee
140
7k
The Cost Of JavaScript in 2023
addyosmani
51
8.4k
Bootstrapping a Software Product
garrettdimon
PRO
307
110k
Practical Orchestrator
shlominoach
188
11k
The Art of Programming - Codeland 2020
erikaheidi
54
13k
Let's Do A Bunch of Simple Stuff to Make Websites Faster
chriscoyier
507
140k
Art, The Web, and Tiny UX
lynnandtonic
299
21k
Dealing with People You Can't Stand - Big Design 2015
cassininazir
367
26k
Design and Strategy: How to Deal with People Who Don’t "Get" Design
morganepeng
130
19k
Transcript
THE VALUE OF BEING LAZY or How I Made OpenStruct
10X Faster Erik Michaels-Ober @sferik
In Ruby, everything is an object. ∀ thing thing.is_a?(Object) #=>
true
In Ruby, every object has a class. ∀ object object.respond_to?(:class)
#=> true
In Ruby, every class has a class. ∴ Object.respond_to?(:class) #=>
true Object.class #=> Class
You can use classes to create new objects: object =
Object.new object.class #=> Object
You can use classes to create new classes: klass =
Class.new klass.class #=> Class
Usually, we create classes like this: class Point attr_accessor :x,
:y def initialize(x, y) @x, @y = x, y end end
You can replace such simple classes with structs: Point =
Struct.new(:x, :y)
OpenStruct requires even less definition: point = OpenStruct.new point.x =
1 point.y = 2
In this way, OpenStruct is similar to Hash: point =
Hash.new point[:x] = 1 point[:y] = 2
You can even initialize OpenStruct with a Hash: point =
OpenStruct.new(x: 1, y: 2) point.x #=> 1 point.y #=> 2
So why use OpenStruct instead of Hash?
Test double validator = OpenStruct.new expect(validator).to receive(:validate) code = PostalCode.new("94102",
validator) code.valid?
API response user = OpenStruct.new(JSON.parse(response)) user.name #=> Erik
Configuration object def options opts = OpenStruct.new yield opts opts
end
So OpenStruct is useful…but slow.
None
Steps to optimize code 1. Complain that code is slow
on Twitter 2. ??? 3. Profit
Actual steps to optimize code 1. Benchmark 2. Read code
3. Profit
Actual steps to optimize code 1. Benchmark 2. Read code
3. Profit
require "benchmark/ips" Point = Struct.new(:x, :y) def struct Point.new(0, 1)
end def ostruct OpenStruct.new(x: 0, y: 1) end Benchmark.ips do |x| x.report("ostruct") { ostruct } x.report("struct") { struct } end
Comparison: struct: 2927800.2 i/s ostruct: 84741.1 i/s - 34.55x slower
Actual steps to optimize code 1. Benchmark 2. Read code
3. Profit
def initialize(hash = nil) @table = {} if hash hash.each_pair
do |k, v| k = k.to_sym @table[k] = v new_ostruct_member(k) end end end
def new_ostruct_member(name) name = name.to_sym unless respond_to?(name) define_singleton_method(name) { @table[name]
} define_singleton_method("#{name}=") { |x| @table[name] = x } end name end
def method_missing(mid, *args) len = args.length if mname = mid[/.*(?==\z)/m]
@table[new_ostruct_member(mname)] = args[0] elsif len == 0 if @table.key?(mid) new_ostruct_member(mid) @table[mid] end end end
def initialize(hash = nil) @table = {} if hash hash.each_pair
do |k, v| k = k.to_sym @table[k] = v new_ostruct_member(k) end end end
Before: struct: 2927800.2 i/s ostruct: 84741.1 i/s - 34.55x slower
After: struct: 2927800.2 i/s ostruct: 940170.4 i/s - 3.11x slower
None
None
git log --reverse lib/ostruct.rb
None
Lazy evaluation
Enumerator::Lazy
lazy_integers = (1..Float::INFINITY).lazy lazy_integers.collect { |x| x ** 2 }.
select { |x| x.even? }. reject { |x| x < 1000 }. first(5) #=> [1024, 1156, 1296, 1444, 1600]
require "prime" lazy_primes = Prime.lazy lazy_primes.select { |x| (x -
2).prime? }. collect { |x| [x - 2, x] }. first(5) #=> [[3, 5], [5, 7], [11, 13], [17, 19], [29, 31]]
module Enumerable def repeat_after_first unless block_given? return to_enum(__method__) { size
* 2 - 1 if size } end each.with_index do |*val, index| index == 0 ? yield *val : 2.times { yield *val } end end end
require "prime" lazy_primes = Prime.lazy lazy_primes.repeat_after_first. each_slice(2). select { |x,
y| x + 2 == y }. first(5) #=> [[3, 5], [5, 7], [11, 13], [17, 19], [29, 31]]
require "date" lazy_dates = (Date.today..Date.new(9999)).lazy lazy_dates.select { |d| d.day ==
13 }. select { |d| d.friday? }. first(10)
lazy_file = File.readlines("/path/to/file").lazy lazy_file.detect { |x| x =~ /regexp/ }
Being lazy is efficient.
Being lazy is elegant.
Thanks to: Zachary Scott ROSS Conf Rails Israel
Thank you