Last active
October 5, 2020 19:18
-
-
Save pjambet/c76c69358a0adb05761f1110ce82a9e2 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
require 'benchmark' | |
require 'securerandom' | |
require_relative './dict' | |
RANDOM_BYTES = SecureRandom.bytes(16) | |
class MyHash | |
def initialize(pairs) | |
if pairs.length == 1 | |
@hash = MyHash1.new(pairs[0]) | |
elsif pairs.length == 2 | |
@hash = MyHash2.new(pairs[0], pairs[1]) | |
elsif pairs.length == 3 | |
@hash = MyHash3.new(pairs[0], pairs[1], pairs[2]) | |
elsif pairs.length == 4 | |
@hash = MyHash4.new(pairs[0], pairs[1], pairs[2], pairs[3]) | |
else | |
raise 'Too big' | |
end | |
end | |
def get(key) | |
@hash.get(key) | |
end | |
end | |
class MyHash1 | |
def initialize(pair) | |
@key = pair[0] | |
@value = pair[1] | |
end | |
def get(key) | |
if @key == key | |
@value | |
else | |
nil | |
end | |
end | |
end | |
class MyHash2 | |
def initialize(pair1, pair2) | |
@key1 = pair1[0] | |
@value1 = pair1[1] | |
@key2 = pair2[0] | |
@value2 = pair2[1] | |
end | |
def get(key) | |
if @key1 == key | |
@value1 | |
elsif @key2 == key | |
@value2 | |
else | |
nil | |
end | |
end | |
end | |
class MyHash3 | |
def initialize(pair1, pair2, pair3) | |
@key1 = pair1[0] | |
@value1 = pair1[1] | |
@key2 = pair2[0] | |
@value2 = pair2[1] | |
@key3 = pair3[0] | |
@value3 = pair3[1] | |
end | |
def get(key) | |
if @key1 == key | |
@value1 | |
elsif @key2 == key | |
@value2 | |
elsif @key3 == key | |
@value3 | |
else | |
nil | |
end | |
end | |
end | |
class MyHash4 | |
def initialize(pair1, pair2, pair3, pair4) | |
@key1 = pair1[0] | |
@value1 = pair1[1] | |
@key2 = pair2[0] | |
@value2 = pair2[1] | |
@key3 = pair3[0] | |
@value3 = pair3[1] | |
@key4 = pair4[0] | |
@value4 = pair4[1] | |
end | |
def get(key) | |
if @key1 == key | |
@value1 | |
elsif @key2 == key | |
@value2 | |
elsif @key3 == key | |
@value3 | |
elsif @key4 == key | |
@value4 | |
else | |
nil | |
end | |
end | |
end | |
def setup_hash(size) | |
dict = Hash.new | |
size.times { |i| dict[i.to_s] = i.to_s } | |
dict | |
end | |
def hash_exp(dict, n, size) | |
n.times do | |
r = rand size | |
dict[r.to_s] | |
end | |
end | |
def setup_dict(size) | |
dict = BYORedis::Dict.new | |
size.times { |i| dict[i.to_s] = i.to_s } | |
dict | |
end | |
def dict_exp(dict, n, size) | |
n.times do | |
r = rand size | |
dict[r.to_s] | |
end | |
end | |
def setup_arr(size) | |
arr = [] | |
size.times { |i| arr << [ i.to_s, i.to_s ] } | |
arr | |
end | |
def array_exp(arr, n, size) | |
n.times do | |
r = rand size | |
arr.each { |a| break if a[0] == r.to_s } | |
end | |
end | |
def setup_my_hash(size) | |
elements = size.times.map { |i| [ i.to_s, i.to_s ] } | |
my_hash = MyHash.new(elements) | |
end | |
def my_hash_exp(hash, n, size) | |
n.times do | |
r = rand size | |
hash.get(r.to_s) | |
end | |
end | |
Benchmark.bm do |x| | |
n = 10_000 | |
size = 4 | |
dict = setup_dict(size) | |
hash = setup_hash(size) | |
arr = setup_arr(size) | |
my_hash = setup_my_hash(size) | |
x.report { dict_exp(dict, n, size) } | |
x.report { array_exp(arr, n, size) } | |
x.report { hash_exp(hash, n, size) } | |
x.report { my_hash_exp(my_hash, n, size) } | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
require 'benchmark/ips' | |
require 'securerandom' | |
require_relative './dict' | |
RANDOM_BYTES = SecureRandom.bytes(16) | |
class MyHash | |
def initialize(pairs) | |
if pairs.length == 1 | |
@hash = MyHash1.new(pairs[0]) | |
elsif pairs.length == 2 | |
@hash = MyHash2.new(pairs[0], pairs[1]) | |
elsif pairs.length == 3 | |
@hash = MyHash3.new(pairs[0], pairs[1], pairs[2]) | |
elsif pairs.length == 4 | |
@hash = MyHash4.new(pairs[0], pairs[1], pairs[2], pairs[3]) | |
else | |
raise 'Too big' | |
end | |
end | |
def get(key) | |
@hash.get(key) | |
end | |
end | |
class MyHash1 | |
def initialize(pair) | |
@key = pair[0] | |
@value = pair[1] | |
end | |
def get(key) | |
if @key == key | |
@value | |
else | |
nil | |
end | |
end | |
end | |
class MyHash2 | |
def initialize(pair1, pair2) | |
@key1 = pair1[0] | |
@value1 = pair1[1] | |
@key2 = pair2[0] | |
@value2 = pair2[1] | |
end | |
def get(key) | |
if @key1 == key | |
@value1 | |
elsif @key2 == key | |
@value2 | |
else | |
nil | |
end | |
end | |
end | |
class MyHash3 | |
def initialize(pair1, pair2, pair3) | |
@key1 = pair1[0] | |
@value1 = pair1[1] | |
@key2 = pair2[0] | |
@value2 = pair2[1] | |
@key3 = pair3[0] | |
@value3 = pair3[1] | |
end | |
def get(key) | |
if @key1 == key | |
@value1 | |
elsif @key2 == key | |
@value2 | |
elsif @key3 == key | |
@value3 | |
else | |
nil | |
end | |
end | |
end | |
class MyHash4 | |
def initialize(pair1, pair2, pair3, pair4) | |
@key1 = pair1[0] | |
@value1 = pair1[1] | |
@key2 = pair2[0] | |
@value2 = pair2[1] | |
@key3 = pair3[0] | |
@value3 = pair3[1] | |
@key4 = pair4[0] | |
@value4 = pair4[1] | |
end | |
def get(key) | |
if @key1 == key | |
@value1 | |
elsif @key2 == key | |
@value2 | |
elsif @key3 == key | |
@value3 | |
elsif @key4 == key | |
@value4 | |
else | |
nil | |
end | |
end | |
end | |
def setup_hash(size) | |
dict = Hash.new | |
size.times { |i| dict[i.to_s] = i.to_s } | |
dict | |
end | |
def hash_exp(dict, n, size) | |
n.times do | |
r = rand size | |
dict[r.to_s] | |
end | |
end | |
def setup_dict(size) | |
dict = BYORedis::Dict.new | |
size.times { |i| dict[i.to_s] = i.to_s } | |
dict | |
end | |
def dict_exp(dict, n, size) | |
n.times do | |
r = rand size | |
dict[r.to_s] | |
end | |
end | |
def setup_arr(size) | |
arr = [] | |
size.times { |i| arr << [ i.to_s, i.to_s ] } | |
arr | |
end | |
def array_exp(arr, n, size) | |
n.times do | |
r = rand size | |
arr.each { |a| break if a[0] == r.to_s } | |
end | |
end | |
def setup_my_hash(size) | |
elements = size.times.map { |i| [ i.to_s, i.to_s ] } | |
my_hash = MyHash.new(elements) | |
end | |
def my_hash_exp(hash, n, size) | |
n.times do | |
r = rand size | |
hash.get(r.to_s) | |
end | |
end | |
Benchmark.ips do |x| | |
n = 10_000 | |
size = 4 | |
dict = setup_dict(size) | |
hash = setup_hash(size) | |
arr = setup_arr(size) | |
my_hash = setup_my_hash(size) | |
x.report { r = rand size; dict[r.to_s] } | |
x.report { r = rand size; arr.each { |a| break if a[0] == r.to_s } } | |
x.report { r = rand size; hash[r.to_s] } | |
x.report { r = rand size; my_hash.get(r.to_s) } | |
x.compare! | |
end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Some results