Micro Benchmarks on Value Object options in Ruby

This is executed with defaults, no extra settings added.

How to run the benchmarks

bundle install
bundle exec ruby <benchmark>

Machine use to run the benchmarks

I run the following benchmarks on my machine:

Apple M3 PRO
36 GB
Running Mac OS 14.4 (23E214)
Ruby 3.3.0

Comparing Data.define with Struct and OpenStruct

Comparing Data.define with Struct and OpenStruct.

The benchmark is focused on benchmarking the keyword arguments.

Creating Values

Having defines the following keys and values:

keys = 1000.times.map { |i| "key#{i}".to_sym }
values = 1000.times.map { |i| "value#{i}" }
keys_and_values = Hash[keys.zip(values)]

The creation benchmarks are testing the following code:

DataStruct = Struct.new(*keys, keyword_init: true)
DataStruct.new(**keys_and_values)

# vs

DataDefine = Data.define(*keys)
DataDefine.new(**keys_and_values)

# vs

OpenStruct.new(**keys_and_values)

Benchmark with `bmbm`

This benchmark is run with Ruby default benchmark using bmbm

Creating a new object - Benchmark with bmbm
Rehearsal --------------------------------------------------
Struct.new       0.000023   0.000003   0.000026 (  0.000024)
Data.define      0.000020   0.000001   0.000021 (  0.000022)
OpenStruct.new   0.001705   0.000075   0.001780 (  0.001780)
----------------------------------------- total: 0.001827sec

                     user     system      total        real
Struct.new       0.000020   0.000000   0.000020 (  0.000020)
Data.define      0.000022   0.000000   0.000022 (  0.000022)
OpenStruct.new   0.001069   0.000044   0.001113 (  0.001132)

Benchmark with `ibs`

This benchmark is run with benchmark-ips gem.

Creating a new object - Benchmark with ips
ruby 3.3.0 (2023-12-25 revision 5124f9ac75) [arm64-darwin23]
Warming up --------------------------------------
          Struct.new     5.169k i/100ms
         Data.define     5.361k i/100ms
      OpenStruct.new    62.000 i/100ms
Calculating -------------------------------------
          Struct.new     50.086k (± 1.7%) i/s -    253.281k in   5.058450s
         Data.define     51.646k (± 1.1%) i/s -    262.689k in   5.086990s
      OpenStruct.new    607.447 (± 0.8%) i/s -      3.038k in   5.001584s

Comparison:
         Data.define:    51646.3 i/s
          Struct.new:    50085.7 i/s - 1.03x  slower
      OpenStruct.new:      607.4 i/s - 85.02x  slower

Benchmark with `memory`

This benchmark is run with benchmark-memory gem

Creating a new object - Benchmark with ips
Calculating -------------------------------------
          Struct.new    36.792k memsize (     0.000  retained)
                         2.000  objects (     0.000  retained)
                         0.000  strings (     0.000  retained)
         Data.define    36.792k memsize (     0.000  retained)
                         2.000  objects (     0.000  retained)
                         0.000  strings (     0.000  retained)
      OpenStruct.new   848.728k memsize (     0.000  retained)
                         8.005k objects (     0.000  retained)
                        50.000  strings (     0.000  retained)

Comparison:
          Struct.new:      36792 allocated
         Data.define:      36792 allocated - same
      OpenStruct.new:     848728 allocated - 23.07x more

Accessing Attributes

Having the following data defined:

keys = 1000.times.map { |i| "key#{i}".to_sym }
values = 1000.times.map { |i| "value#{i}" }
keys_and_values = Hash[keys.zip(values)]

And then defining the following structures:

BigDataS = Struct.new(*keys, keyword_init: true)
BigDataD = Data.define(*keys)

The benchmarks are comparing:

keys.each { struct_object.send(_1) }

keys.each { data_object.send(_1) }

keys.each { opens_struct_object.send(_1) }

Benchmark with `bmbm`

This benchmark is run with Ruby default benchmark using bmbm

Accessing attributes - bmbm test
Rehearsal -----------------------------------------------
Struct        0.000069   0.000002   0.000071 (  0.000071)
Data.define   0.000069   0.000003   0.000072 (  0.000071)
OpenStruct    0.000110   0.000003   0.000113 (  0.000116)
-------------------------------------- total: 0.000256sec

                  user     system      total        real
Struct        0.000049   0.000001   0.000050 (  0.000046)
Data.define   0.000046   0.000001   0.000047 (  0.000046)
OpenStruct    0.000091   0.000001   0.000092 (  0.000094)

Benchmark with `ibs`

This benchmark is run with benchmark-ips gem.

Accessing attributes - ips test
ruby 3.3.0 (2023-12-25 revision 5124f9ac75) [arm64-darwin23]
Warming up --------------------------------------
              Struct     2.857k i/100ms
         Data.define     2.828k i/100ms
          OpenStruct     1.384k i/100ms
Calculating -------------------------------------
              Struct     28.420k (± 0.9%) i/s -    142.850k in   5.026906s
         Data.define     28.691k (± 0.5%) i/s -    144.228k in   5.027131s
          OpenStruct     13.475k (± 0.9%) i/s -     67.816k in   5.033315s

Comparison:
         Data.define:    28690.8 i/s
              Struct:    28419.6 i/s - same-ish: difference falls within error
          OpenStruct:    13474.6 i/s - 2.13x  slower

Data.define - benchmarks

Comparing multiple ways to create a new object

Having the following data specified:

keys = 1000.times.map { |i| "key#{i}".to_sym }
values = 1000.times.map { |i| "value#{i}" }
keys_and_values = Hash[keys.zip(values)]

DataDefine = Data.define(*keys)

The benchmarks are comparing the following code:

# Keyword arguments
DataDefine.new(**keys_and_values)

# Positional arguments
DataDefine.new(*values)

# Constructor method
DataDefine[*values]

# Constructor keywords
DataDefine[**keys_and_values]

Benchmark with `bmbm`

This benchmark is run with Ruby default benchmark using bmbm

Comparing ways to instantiate a Data.define object - Benchmark with bmbm
Rehearsal --------------------------------------------------------
Keyword arguments      0.000025   0.000000   0.000025 (  0.000025)
Positional arguments   0.000058   0.000000   0.000058 (  0.000059)
Constructor method     0.000053   0.000000   0.000053 (  0.000054)
Constructor keywords   0.000029   0.000000   0.000029 (  0.000029)
----------------------------------------------- total: 0.000165sec

                           user     system      total        real
Keyword arguments      0.000023   0.000001   0.000024 (  0.000023)
Positional arguments   0.000039   0.000000   0.000039 (  0.000039)
Constructor method     0.000046   0.000000   0.000046 (  0.000046)
Constructor keywords   0.000023   0.000000   0.000023 (  0.000023)

Benchmarking with `ips`

This benchmark is run with benchmark-ips gem.

Comparing ways to instantiate a Data.define object - Benchmark with ips
ruby 3.3.0 (2023-12-25 revision 5124f9ac75) [arm64-darwin23]
Warming up --------------------------------------
   Keyword arguments     5.345k i/100ms
Positional arguments     2.692k i/100ms
  Constructor method     2.663k i/100ms
Constructor keywords     5.354k i/100ms
Calculating -------------------------------------
   Keyword arguments     52.390k (± 1.9%) i/s -    261.905k in   5.000971s
Positional arguments     26.162k (± 1.1%) i/s -    131.908k in   5.042607s
  Constructor method     26.149k (± 0.8%) i/s -    133.150k in   5.092403s
Constructor keywords     51.813k (± 1.6%) i/s -    262.346k in   5.064698s

Comparison:
   Keyword arguments:    52390.1 i/s
Constructor keywords:    51812.7 i/s - same-ish: difference falls within error
Positional arguments:    26162.3 i/s - 2.00x  slower
  Constructor method:    26148.6 i/s - 2.00x  slower

Benchmarking with `memory`

This benchmark is run with benchmark-memory gem.

This test is probably unnecessary cause in the end it creates the same thing.

Comparing ways to instantiate a Data.define object - Benchmark with memory
Calculating -------------------------------------
   Keyword arguments    36.792k memsize (     0.000  retained)
                         2.000  objects (     0.000  retained)
                         0.000  strings (     0.000  retained)
Positional arguments    36.792k memsize (     0.000  retained)
                         2.000  objects (     0.000  retained)
                         0.000  strings (     0.000  retained)
  Constructor method    36.792k memsize (     0.000  retained)
                         2.000  objects (     0.000  retained)
                         0.000  strings (     0.000  retained)
Constructor keywords    36.792k memsize (     0.000  retained)
                         2.000  objects (     0.000  retained)
                         0.000  strings (     0.000  retained)

Comparison:
   Keyword arguments:      36792 allocated
Positional arguments:      36792 allocated - same
  Constructor method:      36792 allocated - same
Constructor keywords:      36792 allocated - same

Comparing accessing data from objects created differently

Taking in consideration the following data :

keys = 1000.times.map { |i| "key#{i}".to_sym }
values = 1000.times.map { |i| "value#{i}" }
keys_and_values = Hash[keys.zip(values)]

And creating the following objects:

DataDefine = Data.define(*keys)
keyword_args = DataDefine.new(**keys_and_values)
positional_args = DataDefine.new(*values)
constructor_method = DataDefine[*values]
constructor_with_keyword_args = DataDefine[**keys_and_values]

The benchmarks are comparing the following code:

#Keyword arguments
keys.each { keyword_args.send(_1) }

#Positional arguments
keys.each { positional_args.send(_1) }

#Constructor method
keys.each { constructor_method.send(_1) }

#Constructor keywords
keys.each { constructor_with_keyword_args.send(_1) }

Benchmark with `bmbm`

This benchmark is run with Ruby default benchmark using bmbm

Comparing accessing data for Data.define object - Benchmark with bmbm
Rehearsal --------------------------------------------------------
Keyword arguments      0.000072   0.000002   0.000074 (  0.000074)
Positional arguments   0.000046   0.000001   0.000047 (  0.000047)
Constructor method     0.000047   0.000000   0.000047 (  0.000047)
Constructor keywords   0.000047   0.000001   0.000048 (  0.000048)
----------------------------------------------- total: 0.000216sec

                           user     system      total        real
Keyword arguments      0.000048   0.000001   0.000049 (  0.000048)
Positional arguments   0.000047   0.000000   0.000047 (  0.000047)
Constructor method     0.000047   0.000000   0.000047 (  0.000048)
Constructor keywords   0.000047   0.000001   0.000048 (  0.000047)

Benchmark with `ips`

This benchmark is run with benchmark-ips gem.

Comparing accessing data for Data.define object - Benchmark with bmbm
ruby 3.3.0 (2023-12-25 revision 5124f9ac75) [arm64-darwin23]
Warming up --------------------------------------
   Keyword arguments     2.669k i/100ms
Positional arguments     2.657k i/100ms
  Constructor method     2.685k i/100ms
Constructor keywords     2.690k i/100ms
Calculating -------------------------------------
   Keyword arguments     26.925k (± 0.5%) i/s -    136.119k in   5.055637s
Positional arguments     26.835k (± 0.4%) i/s -    135.507k in   5.049741s
  Constructor method     26.895k (± 0.3%) i/s -    136.935k in   5.091470s
Constructor keywords     26.794k (± 0.4%) i/s -    134.500k in   5.019767s

Comparison:
   Keyword arguments:    26924.8 i/s
  Constructor method:    26895.3 i/s - same-ish: difference falls within error
Positional arguments:    26834.9 i/s - same-ish: difference falls within error
Constructor keywords:    26794.4 i/s - same-ish: difference falls within error

Comparing creating new objects with small number of attributes

In these tests I run creating new objects with 6 attributes.

I compared Data.define with Struct, OpenStruct, plain Ruby object with positional arguments and plain Ruby object with keyword arguments.

The tests are done only with ips and bmbm. Did not do a memory test becuase I did not wanted to try to replicate in the custom class the same logic that Data.define or Struct can offer.

Having defined the following data:

keys = [:key1, :key2, :key3, :key4, :key5, :key6]
values = 6.times.map { |i| "value#{i}" }
keys_and_values = Hash[keys.zip(values)]

And the following classes:

DataStructKeyword = Struct.new(*keys, keyword_init: true)
DataStructPositional = Struct.new(*keys)
DataDefine = Data.define(*keys)

class MyValueObjectWithKeywordArgs
  attr_reader :key1, :key2, :key3, :key4, :key5, :key6

  def initialize(key1:, key2:, key3:, key4:, key5:, key6:)
    @key1 = key1
    @key2 = key2
    @key3 = key3
    @key4 = key4
    @key5 = key5
    @key6 = key6
  end
end

class MyValueObjectWithPositionalArgs
  attr_reader :key1, :key2, :key3, :key4, :key5, :key6

  def initialize(key1, key2, key3, key4, key5, key6)
    @key1 = key1
    @key2 = key2
    @key3 = key3
    @key4 = key4
    @key5 = key5
    @key6 = key6
  end
end

The benchmarks will compare the following code:

# Struct - positional
DataStructPositional.new(*values)

# Struct - keywords
DataStructKeyword.new(**keys_and_values)

# Data - positional
DataDefine.new(*values)

# Data - keywords
DataDefine.new(**keys_and_values)

# OpenStruct.new
OpenStruct.new(**keys_and_values)

# PORO - positional
MyValueObjectWithPositionalArgs.new(*values)

# PORO - keywords
MyValueObjectWithKeywordArgs.new(**keys_and_values)

Benchamrk with `bmbm`

Creating a new object - Benchmark with bmbm - small numbers
Rehearsal -------------------------------------------------------
Struct - positional   0.000003   0.000001   0.000004 (  0.000002)
Struct - keywords     0.000002   0.000000   0.000002 (  0.000002)
Data - positional     0.000002   0.000001   0.000003 (  0.000004)
Data - keywords       0.000002   0.000000   0.000002 (  0.000001)
OpenStruct.new        0.000019   0.000001   0.000020 (  0.000019)
PORO - positional     0.000002   0.000000   0.000002 (  0.000002)
PORO - keywords       0.000001   0.000001   0.000002 (  0.000002)
---------------------------------------------- total: 0.000035sec

                          user     system      total        real
Struct - positional   0.000001   0.000000   0.000001 (  0.000000)
Struct - keywords     0.000002   0.000000   0.000002 (  0.000001)
Data - positional     0.000002   0.000000   0.000002 (  0.000002)
Data - keywords       0.000001   0.000000   0.000001 (  0.000001)
OpenStruct.new        0.000018   0.000000   0.000018 (  0.000017)
PORO - positional     0.000001   0.000000   0.000001 (  0.000001)
PORO - keywords       0.000002   0.000000   0.000002 (  0.000001)

Benchmark with `ips`

Creating a new object - Benchmark with ips - small numbers
ruby 3.3.0 (2023-12-25 revision 5124f9ac75) [arm64-darwin23]
Warming up --------------------------------------
 Struct - positional   913.180k i/100ms
   Struct - keywords   464.416k i/100ms
   Data - positional   335.700k i/100ms
     Data - keywords   484.506k i/100ms
      OpenStruct.new    10.869k i/100ms
   PORO - positional   796.702k i/100ms
     PORO - keywords   467.403k i/100ms
Calculating -------------------------------------
 Struct - positional      8.924M (± 0.1%) i/s -     44.746M in   5.014174s
   Struct - keywords      4.583M (± 0.2%) i/s -     23.221M in   5.067154s
   Data - positional      3.289M (± 0.2%) i/s -     16.449M in   5.001151s
     Data - keywords      4.786M (± 0.1%) i/s -     24.225M in   5.061479s
      OpenStruct.new    109.959k (± 1.1%) i/s -    554.319k in   5.041756s
   PORO - positional      7.791M (± 0.3%) i/s -     39.038M in   5.010537s
     PORO - keywords      4.659M (± 0.5%) i/s -     23.370M in   5.016246s

Comparison:
 Struct - positional:  8923882.2 i/s
   PORO - positional:  7791346.2 i/s - 1.15x  slower
     Data - keywords:  4786215.7 i/s - 1.86x  slower
     PORO - keywords:  4659024.3 i/s - 1.92x  slower
   Struct - keywords:  4582626.3 i/s - 1.95x  slower
   Data - positional:  3289111.1 i/s - 2.71x  slower
      OpenStruct.new:   109959.0 i/s - 81.16x  slower

Name		Name	Last commit message	Last commit date
Latest commit History 12 Commits
accessing_attributes		accessing_attributes
creating_values		creating_values
data-define		data-define
small_numbers_comparison/creating_values		small_numbers_comparison/creating_values
.ruby-version		.ruby-version
Gemfile		Gemfile
Gemfile.lock		Gemfile.lock
LICENSE		LICENSE
README.md		README.md

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Micro Benchmarks on Value Object options in Ruby

How to run the benchmarks

Machine use to run the benchmarks

Comparing Data.define with Struct and OpenStruct

Creating Values

Benchmark with `bmbm`

Benchmark with `ibs`

Benchmark with `memory`

Accessing Attributes

Benchmark with `bmbm`

Benchmark with `ibs`

Data.define - benchmarks

Comparing multiple ways to create a new object

Benchmark with `bmbm`

Benchmarking with `ips`

Benchmarking with `memory`

Comparing accessing data from objects created differently

Benchmark with `bmbm`

Benchmark with `ips`

Comparing creating new objects with small number of attributes

Benchamrk with `bmbm`

Benchmark with `ips`

About

Contributors 2

Languages

License

lucianghinda/value-object-in-ruby-benchmarks

Folders and files

Latest commit

History

Repository files navigation

Micro Benchmarks on Value Object options in Ruby

How to run the benchmarks

Machine use to run the benchmarks

Comparing Data.define with Struct and OpenStruct

Creating Values

Benchmark with bmbm

Benchmark with ibs

Benchmark with memory

Accessing Attributes

Benchmark with bmbm

Benchmark with ibs

Data.define - benchmarks

Comparing multiple ways to create a new object

Benchmark with bmbm

Benchmarking with ips

Benchmarking with memory

Comparing accessing data from objects created differently

Benchmark with bmbm

Benchmark with ips

Comparing creating new objects with small number of attributes

Benchamrk with bmbm

Benchmark with ips

About

Topics

Resources

License

Stars

Watchers

Forks

Contributors 2

Languages

Benchmark with `bmbm`

Benchmark with `ibs`

Benchmark with `memory`

Benchmark with `bmbm`

Benchmark with `ibs`

Benchmark with `bmbm`

Benchmarking with `ips`

Benchmarking with `memory`

Benchmark with `bmbm`

Benchmark with `ips`

Benchamrk with `bmbm`

Benchmark with `ips`