mirror of
http://github.com/valkey-io/valkey
synced 2024-11-22 09:17:20 +00:00
33 lines
1021 B
Ruby
33 lines
1021 B
Ruby
|
# redis-sha1.rb - Copyright (C) 2009 Salvatore Sanfilippo
|
||
|
|
# BSD license, See the COPYING file for more information.
|
||
|
|
#
|
||
|
|
# Performs the SHA1 sum of the whole datset.
|
||
|
|
# This is useful to spot bugs in persistence related code and to make sure
|
||
|
|
# Slaves and Masters are in SYNC.
|
||
|
|
#
|
||
|
|
# If you hack this code make sure to sort keys and set elements as this are
|
||
|
|
# unsorted elements. Otherwise the sum may differ with equal dataset.
|
||
|
|
|
||
|
|
require 'rubygems'
|
||
|
|
require 'redis'
|
||
|
|
require 'digest/sha1'
|
||
|
|
|
||
|
|
def redisSha1(opts={})
|
||
|
|
sha1=""
|
||
|
|
r = Redis.new(opts)
|
||
|
|
r.keys('*').sort.each{|k|
|
||
|
|
sha1 = Digest::SHA1.hexdigest(sha1+k)
|
||
|
|
vtype = r.type?(k)
|
||
|
|
if vtype == "string"
|
||
|
|
sha1 = Digest::SHA1.hexdigest(sha1+r.get(k))
|
||
|
|
elsif vtype == "list"
|
||
|
|
sha1 = Digest::SHA1.hexdigest(sha1+r.list_range(k,0,-1).join("\x01"))
|
||
|
|
elsif vtype == "set"
|
||
|
|
sha1 = Digest::SHA1.hexdigest(sha1+r.set_members(k).to_a.sort.join("\x02"))
|
||
|
|
end
|
||
|
|
}
|
||
|
|
sha1
|
||
|
|
end
|
||
|
|
|
||
|
|
p "Dataset SHA1: #{redisSha1()}"
|