/usr/lib/ruby/vendor_ruby/redis/connection/memory.rb is in ruby-fakeredis 0.5.0-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 | require 'set'
require 'redis/connection/registry'
require 'redis/connection/command_helper'
require "fakeredis/command_executor"
require "fakeredis/expiring_hash"
require "fakeredis/sort_method"
require "fakeredis/sorted_set_argument_handler"
require "fakeredis/sorted_set_store"
require "fakeredis/transaction_commands"
require "fakeredis/zset"
class Redis
module Connection
class Memory
include Redis::Connection::CommandHelper
include FakeRedis
include SortMethod
include TransactionCommands
include CommandExecutor
attr_accessor :options
# Tracks all databases for all instances across the current process.
# We have to be able to handle two clients with the same host/port accessing
# different databases at once without overwriting each other. So we store our
# "data" outside the client instances, in this class level instance method.
# Client instances access it with a key made up of their host/port, and then select
# which DB out of the array of them they want. Allows the access we need.
def self.databases
@databases ||= Hash.new {|h,k| h[k] = [] }
end
# Used for resetting everything in specs
def self.reset_all_databases
@databases = nil
end
def self.connect(options = {})
new(options)
end
def initialize(options = {})
self.options = options
end
def database_id
@database_id ||= 0
end
attr_writer :database_id
def database_instance_key
[options[:host], options[:port]].hash
end
def databases
self.class.databases[database_instance_key]
end
def find_database id=database_id
databases[id] ||= ExpiringHash.new
end
def data
find_database
end
def replies
@replies ||= []
end
attr_writer :replies
def connected?
true
end
def connect_unix(path, timeout)
end
def disconnect
end
def timeout=(usecs)
end
def read
replies.shift
end
# NOT IMPLEMENTED:
# * blpop
# * brpop
# * brpoplpush
# * subscribe
# * psubscribe
# * publish
def flushdb
databases.delete_at(database_id)
"OK"
end
def flushall
self.class.databases[database_instance_key] = []
"OK"
end
def auth(password)
"OK"
end
def select(index)
data_type_check(index, Integer)
self.database_id = index
"OK"
end
def info
{
"redis_version" => "2.6.16",
"connected_clients" => "1",
"connected_slaves" => "0",
"used_memory" => "3187",
"changes_since_last_save" => "0",
"last_save_time" => "1237655729",
"total_connections_received" => "1",
"total_commands_processed" => "1",
"uptime_in_seconds" => "36000",
"uptime_in_days" => 0
}
end
def monitor; end
def save; end
def bgsave ; end
def bgrewriteaof ; end
def move key, destination_id
raise Redis::CommandError, "ERR source and destination objects are the same" if destination_id == database_id
destination = find_database(destination_id)
return false unless data.has_key?(key)
return false if destination.has_key?(key)
destination[key] = data.delete(key)
true
end
def get(key)
data_type_check(key, String)
data[key]
end
def getbit(key, offset)
return unless data[key]
data[key].unpack('B*')[0].split("")[offset].to_i
end
def bitcount(key, start_index = 0, end_index = -1)
return 0 unless data[key]
data[key][start_index..end_index].unpack('B*')[0].count("1")
end
def getrange(key, start, ending)
return unless data[key]
data[key][start..ending]
end
alias :substr :getrange
def getset(key, value)
data_type_check(key, String)
data[key].tap do
set(key, value)
end
end
def mget(*keys)
raise_argument_error('mget') if keys.empty?
# We work with either an array, or list of arguments
keys = keys.first if keys.size == 1
data.values_at(*keys)
end
def append(key, value)
data[key] = (data[key] || "")
data[key] = data[key] + value.to_s
end
def strlen(key)
return unless data[key]
data[key].size
end
def hgetall(key)
data_type_check(key, Hash)
data[key].to_a.flatten || {}
end
def hget(key, field)
data_type_check(key, Hash)
data[key] && data[key][field.to_s]
end
def hdel(key, field)
field = field.to_s
data_type_check(key, Hash)
deleted = data[key] && data[key].delete(field)
remove_key_for_empty_collection(key)
deleted ? 1 : 0
end
def hkeys(key)
data_type_check(key, Hash)
return [] if data[key].nil?
data[key].keys
end
def keys(pattern = "*")
data.keys.select { |key| File.fnmatch(pattern, key) }
end
def randomkey
data.keys[rand(dbsize)]
end
def echo(string)
string
end
def ping
"PONG"
end
def lastsave
Time.now.to_i
end
def time
microseconds = (Time.now.to_f * 1000000).to_i
[ microseconds / 1000000, microseconds % 1000000 ]
end
def dbsize
data.keys.count
end
def exists(key)
data.key?(key)
end
def llen(key)
data_type_check(key, Array)
return 0 unless data[key]
data[key].size
end
def lrange(key, startidx, endidx)
data_type_check(key, Array)
(data[key] && data[key][startidx..endidx]) || []
end
def ltrim(key, start, stop)
data_type_check(key, Array)
return unless data[key]
# Example: we have a list of 3 elements and
# we give it a ltrim list, -5, -1. This means
# it should trim to a max of 5. Since 3 < 5
# we should not touch the list. This is consistent
# with behavior of real Redis's ltrim with a negative
# start argument.
unless start < 0 && data[key].count < start.abs
data[key] = data[key][start..stop]
end
"OK"
end
def lindex(key, index)
data_type_check(key, Array)
data[key] && data[key][index]
end
def linsert(key, where, pivot, value)
data_type_check(key, Array)
return unless data[key]
index = data[key].index(pivot)
case where
when :before then data[key].insert(index, value)
when :after then data[key].insert(index + 1, value)
else raise_syntax_error
end
end
def lset(key, index, value)
data_type_check(key, Array)
return unless data[key]
raise Redis::CommandError, "ERR index out of range" if index >= data[key].size
data[key][index] = value
end
def lrem(key, count, value)
data_type_check(key, Array)
return unless data[key]
old_size = data[key].size
diff =
if count == 0
data[key].delete(value)
old_size - data[key].size
else
array = count > 0 ? data[key].dup : data[key].reverse
count.abs.times{ array.delete_at(array.index(value) || array.length) }
data[key] = count > 0 ? array.dup : array.reverse
old_size - data[key].size
end
remove_key_for_empty_collection(key)
diff
end
def rpush(key, value)
data_type_check(key, Array)
data[key] ||= []
[value].flatten.each do |val|
data[key].push(val.to_s)
end
data[key].size
end
def rpushx(key, value)
data_type_check(key, Array)
return unless data[key]
rpush(key, value)
end
def lpush(key, value)
data_type_check(key, Array)
data[key] ||= []
[value].flatten.each do |val|
data[key].unshift(val.to_s)
end
data[key].size
end
def lpushx(key, value)
data_type_check(key, Array)
return unless data[key]
lpush(key, value)
end
def rpop(key)
data_type_check(key, Array)
return unless data[key]
data[key].pop
end
def rpoplpush(key1, key2)
data_type_check(key1, Array)
rpop(key1).tap do |elem|
lpush(key2, elem) unless elem.nil?
end
end
def lpop(key)
data_type_check(key, Array)
return unless data[key]
data[key].shift
end
def smembers(key)
data_type_check(key, ::Set)
return [] unless data[key]
data[key].to_a.reverse
end
def sismember(key, value)
data_type_check(key, ::Set)
return false unless data[key]
data[key].include?(value.to_s)
end
def sadd(key, value)
data_type_check(key, ::Set)
value = Array(value)
raise_argument_error('sadd') if value.empty?
result = if data[key]
old_set = data[key].dup
data[key].merge(value.map(&:to_s))
(data[key] - old_set).size
else
data[key] = ::Set.new(value.map(&:to_s))
data[key].size
end
# 0 = false, 1 = true, 2+ untouched
return result == 1 if result < 2
result
end
def srem(key, value)
data_type_check(key, ::Set)
return false unless data[key]
if value.is_a?(Array)
old_size = data[key].size
values = value.map(&:to_s)
values.each { |value| data[key].delete(value) }
deleted = old_size - data[key].size
else
deleted = !!data[key].delete?(value.to_s)
end
remove_key_for_empty_collection(key)
deleted
end
def smove(source, destination, value)
data_type_check(destination, ::Set)
result = self.srem(source, value)
self.sadd(destination, value) if result
result
end
def spop(key)
data_type_check(key, ::Set)
elem = srandmember(key)
srem(key, elem)
elem
end
def scard(key)
data_type_check(key, ::Set)
return 0 unless data[key]
data[key].size
end
def sinter(*keys)
raise_argument_error('sinter') if keys.empty?
keys.each { |k| data_type_check(k, ::Set) }
return ::Set.new if keys.any? { |k| data[k].nil? }
keys = keys.map { |k| data[k] || ::Set.new }
keys.inject do |set, key|
set & key
end.to_a
end
def sinterstore(destination, *keys)
data_type_check(destination, ::Set)
result = sinter(*keys)
data[destination] = ::Set.new(result)
end
def sunion(*keys)
keys.each { |k| data_type_check(k, ::Set) }
keys = keys.map { |k| data[k] || ::Set.new }
keys.inject(::Set.new) do |set, key|
set | key
end.to_a
end
def sunionstore(destination, *keys)
data_type_check(destination, ::Set)
result = sunion(*keys)
data[destination] = ::Set.new(result)
end
def sdiff(key1, *keys)
[key1, *keys].each { |k| data_type_check(k, ::Set) }
keys = keys.map { |k| data[k] || ::Set.new }
keys.inject(data[key1] || Set.new) do |memo, set|
memo - set
end.to_a
end
def sdiffstore(destination, key1, *keys)
data_type_check(destination, ::Set)
result = sdiff(key1, *keys)
data[destination] = ::Set.new(result)
end
def srandmember(key, number=nil)
number.nil? ? srandmember_single(key) : srandmember_multiple(key, number)
end
def del(*keys)
keys = keys.flatten(1)
raise_argument_error('del') if keys.empty?
old_count = data.keys.size
keys.each do |key|
data.delete(key)
end
old_count - data.keys.size
end
def setnx(key, value)
if exists(key)
false
else
set(key, value)
true
end
end
def rename(key, new_key)
return unless data[key]
data[new_key] = data[key]
data.expires[new_key] = data.expires[key] if data.expires.include?(key)
data.delete(key)
end
def renamenx(key, new_key)
if exists(new_key)
false
else
rename(key, new_key)
true
end
end
def expire(key, ttl)
return 0 unless data[key]
data.expires[key] = Time.now + ttl
1
end
def ttl(key)
if data.expires.include?(key) && (ttl = data.expires[key].to_i - Time.now.to_i) > 0
ttl
else
exists(key) ? -1 : -2
end
end
def expireat(key, timestamp)
data.expires[key] = Time.at(timestamp)
true
end
def persist(key)
!!data.expires.delete(key)
end
def hset(key, field, value)
data_type_check(key, Hash)
field = field.to_s
if data[key]
result = !data[key].include?(field)
data[key][field] = value.to_s
result
else
data[key] = { field => value.to_s }
true
end
end
def hsetnx(key, field, value)
data_type_check(key, Hash)
field = field.to_s
return false if data[key] && data[key][field]
hset(key, field, value)
end
def hmset(key, *fields)
# mapped_hmset gives us [[:k1, "v1", :k2, "v2"]] for `fields`. Fix that.
fields = fields[0] if mapped_param?(fields)
raise_argument_error('hmset') if fields.empty?
is_list_of_arrays = fields.all?{|field| field.instance_of?(Array)}
raise_argument_error('hmset') if fields.size.odd? and !is_list_of_arrays
raise_argument_error('hmset') if is_list_of_arrays and !fields.all?{|field| field.length == 2}
data_type_check(key, Hash)
data[key] ||= {}
if is_list_of_arrays
fields.each do |pair|
data[key][pair[0].to_s] = pair[1].to_s
end
else
fields.each_slice(2) do |field|
data[key][field[0].to_s] = field[1].to_s
end
end
end
def hmget(key, *fields)
raise_argument_error('hmget') if fields.empty?
data_type_check(key, Hash)
fields.flatten.map do |field|
field = field.to_s
if data[key]
data[key][field]
else
nil
end
end
end
def hlen(key)
data_type_check(key, Hash)
return 0 unless data[key]
data[key].size
end
def hvals(key)
data_type_check(key, Hash)
return [] unless data[key]
data[key].values
end
def hincrby(key, field, increment)
data_type_check(key, Hash)
field = field.to_s
if data[key]
data[key][field] = (data[key][field].to_i + increment.to_i).to_s
else
data[key] = { field => increment.to_s }
end
data[key][field].to_i
end
def hincrbyfloat(key, field, increment)
data_type_check(key, Hash)
field = field.to_s
if data[key]
data[key][field] = (data[key][field].to_f + increment.to_f).to_s
else
data[key] = { field => increment.to_s }
end
data[key][field]
end
def hexists(key, field)
data_type_check(key, Hash)
return false unless data[key]
data[key].key?(field.to_s)
end
def sync ; end
def [](key)
get(key)
end
def []=(key, value)
set(key, value)
end
def set(key, value, *array_options)
option_nx = array_options.delete("NX")
option_xx = array_options.delete("XX")
return false if option_nx && option_xx
return false if option_nx && exists(key)
return false if option_xx && !exists(key)
data[key] = value.to_s
options = Hash[array_options.each_slice(2).to_a]
ttl_in_seconds = options["EX"] if options["EX"]
ttl_in_seconds = options["PX"] / 1000.0 if options["PX"]
expire(key, ttl_in_seconds) if ttl_in_seconds
"OK"
end
def setbit(key, offset, bit)
old_val = data[key] ? data[key].unpack('B*')[0].split("") : []
size_increment = [((offset/8)+1)*8-old_val.length, 0].max
old_val += Array.new(size_increment).map{"0"}
original_val = old_val[offset].to_i
old_val[offset] = bit.to_s
new_val = ""
old_val.each_slice(8){|b| new_val = new_val + b.join("").to_i(2).chr }
data[key] = new_val
original_val
end
def setex(key, seconds, value)
data[key] = value.to_s
expire(key, seconds)
"OK"
end
def setrange(key, offset, value)
return unless data[key]
s = data[key][offset,value.size]
data[key][s] = value
end
def mset(*pairs)
# Handle pairs for mapped_mset command
pairs = pairs[0] if mapped_param?(pairs)
raise_argument_error('mset') if pairs.empty? || pairs.size == 1
# We have to reply with a different error message here to be consistent with redis-rb 3.0.6 / redis-server 2.8.1
raise_argument_error("mset", "mset_odd") if pairs.size.odd?
pairs.each_slice(2) do |pair|
data[pair[0].to_s] = pair[1].to_s
end
"OK"
end
def msetnx(*pairs)
# Handle pairs for mapped_msetnx command
pairs = pairs[0] if mapped_param?(pairs)
keys = []
pairs.each_with_index{|item, index| keys << item.to_s if index % 2 == 0}
return false if keys.any?{|key| data.key?(key) }
mset(*pairs)
true
end
def incr(key)
data.merge!({ key => (data[key].to_i + 1).to_s || "1"})
data[key].to_i
end
def incrby(key, by)
data.merge!({ key => (data[key].to_i + by.to_i).to_s || by })
data[key].to_i
end
def decr(key)
data.merge!({ key => (data[key].to_i - 1).to_s || "-1"})
data[key].to_i
end
def decrby(key, by)
data.merge!({ key => ((data[key].to_i - by.to_i) || (by.to_i * -1)).to_s })
data[key].to_i
end
def type(key)
case data[key]
when nil then "none"
when String then "string"
when ZSet then "zset"
when Hash then "hash"
when Array then "list"
when ::Set then "set"
end
end
def quit ; end
def shutdown; end
def slaveof(host, port) ; end
def scan(start_cursor, *args)
match = "*"
count = 10
if args.size.odd?
raise_argument_error('scan')
end
if idx = args.index("MATCH")
match = args[idx + 1]
end
if idx = args.index("COUNT")
count = args[idx + 1]
end
start_cursor = start_cursor.to_i
data_type_check(start_cursor, Fixnum)
cursor = start_cursor
next_keys = []
if start_cursor + count >= data.length
next_keys = keys(match)[start_cursor..-1]
cursor = 0
else
cursor = start_cursor + 10
next_keys = keys(match)[start_cursor..cursor]
end
return "#{cursor}", next_keys
end
def zadd(key, *args)
if !args.first.is_a?(Array)
if args.size < 2
raise_argument_error('zadd')
elsif args.size.odd?
raise_syntax_error
end
else
unless args.all? {|pair| pair.size == 2 }
raise_syntax_error
end
end
data_type_check(key, ZSet)
data[key] ||= ZSet.new
if args.size == 2 && !(Array === args.first)
score, value = args
exists = !data[key].key?(value.to_s)
data[key][value.to_s] = score
else
# Turn [1, 2, 3, 4] into [[1, 2], [3, 4]] unless it is already
args = args.each_slice(2).to_a unless args.first.is_a?(Array)
exists = args.map(&:last).map { |el| data[key].key?(el.to_s) }.count(false)
args.each { |s, v| data[key][v.to_s] = s }
end
exists
end
def zrem(key, value)
data_type_check(key, ZSet)
values = Array(value)
return 0 unless data[key]
response = values.map do |v|
data[key].delete(v.to_s) if data[key].has_key?(v.to_s)
end.compact.size
remove_key_for_empty_collection(key)
response
end
def zcard(key)
data_type_check(key, ZSet)
data[key] ? data[key].size : 0
end
def zscore(key, value)
data_type_check(key, ZSet)
value = data[key] && data[key][value.to_s]
value && value.to_s
end
def zcount(key, min, max)
data_type_check(key, ZSet)
return 0 unless data[key]
data[key].select_by_score(min, max).size
end
def zincrby(key, num, value)
data_type_check(key, ZSet)
data[key] ||= ZSet.new
data[key][value.to_s] ||= 0
data[key].increment(value.to_s, num)
data[key][value.to_s].to_s
end
def zrank(key, value)
data_type_check(key, ZSet)
z = data[key]
return unless z
z.keys.sort_by {|k| z[k] }.index(value.to_s)
end
def zrevrank(key, value)
data_type_check(key, ZSet)
z = data[key]
return unless z
z.keys.sort_by {|k| -z[k] }.index(value.to_s)
end
def zrange(key, start, stop, with_scores = nil)
data_type_check(key, ZSet)
return [] unless data[key]
# Sort by score, or if scores are equal, key alphanum
results = data[key].sort do |(k1, v1), (k2, v2)|
if v1 == v2
k1 <=> k2
else
v1 <=> v2
end
end
# Select just the keys unless we want scores
results = results.map(&:first) unless with_scores
results[start..stop].flatten.map(&:to_s)
end
def zrevrange(key, start, stop, with_scores = nil)
data_type_check(key, ZSet)
return [] unless data[key]
if with_scores
data[key].sort_by {|_,v| -v }
else
data[key].keys.sort_by {|k| -data[key][k] }
end[start..stop].flatten.map(&:to_s)
end
def zrangebyscore(key, min, max, *opts)
data_type_check(key, ZSet)
return [] unless data[key]
range = data[key].select_by_score(min, max)
vals = if opts.include?('WITHSCORES')
range.sort_by {|_,v| v }
else
range.keys.sort_by {|k| range[k] }
end
limit = get_limit(opts, vals)
vals = vals[*limit] if limit
vals.flatten.map(&:to_s)
end
def zrevrangebyscore(key, max, min, *opts)
opts = opts.flatten
data_type_check(key, ZSet)
return [] unless data[key]
range = data[key].select_by_score(min, max)
vals = if opts.include?('WITHSCORES')
range.sort_by {|_,v| -v }
else
range.keys.sort_by {|k| -range[k] }
end
limit = get_limit(opts, vals)
vals = vals[*limit] if limit
vals.flatten.map(&:to_s)
end
def zremrangebyscore(key, min, max)
data_type_check(key, ZSet)
return 0 unless data[key]
range = data[key].select_by_score(min, max)
range.each {|k,_| data[key].delete(k) }
range.size
end
def zremrangebyrank(key, start, stop)
data_type_check(key, ZSet)
return 0 unless data[key]
sorted_elements = data[key].sort_by { |k, v| v }
start = sorted_elements.length if start > sorted_elements.length
elements_to_delete = sorted_elements[start..stop]
elements_to_delete.each { |elem, rank| data[key].delete(elem) }
elements_to_delete.size
end
def zinterstore(out, *args)
data_type_check(out, ZSet)
args_handler = SortedSetArgumentHandler.new(args)
data[out] = SortedSetIntersectStore.new(args_handler, data).call
data[out].size
end
def zunionstore(out, *args)
data_type_check(out, ZSet)
args_handler = SortedSetArgumentHandler.new(args)
data[out] = SortedSetUnionStore.new(args_handler, data).call
data[out].size
end
private
def raise_argument_error(command, match_string=command)
error_message = if %w(hmset mset_odd).include?(match_string.downcase)
"ERR wrong number of arguments for #{command.upcase}"
else
"ERR wrong number of arguments for '#{command}' command"
end
raise Redis::CommandError, error_message
end
def raise_syntax_error
raise Redis::CommandError, "ERR syntax error"
end
def remove_key_for_empty_collection(key)
del(key) if data[key] && data[key].empty?
end
def data_type_check(key, klass)
if data[key] && !data[key].is_a?(klass)
warn "Operation against a key holding the wrong kind of value: Expected #{klass} at #{key}."
raise Redis::CommandError.new("WRONGTYPE Operation against a key holding the wrong kind of value")
end
end
def get_limit(opts, vals)
index = opts.index('LIMIT')
if index
offset = opts[index + 1]
count = opts[index + 2]
count = vals.size if count < 0
[offset, count]
end
end
def mapped_param? param
param.size == 1 && param[0].is_a?(Array)
end
def srandmember_single(key)
data_type_check(key, ::Set)
return nil unless data[key]
data[key].to_a[rand(data[key].size)]
end
def srandmember_multiple(key, number)
return [] unless data[key]
if number >= 0
# replace with `data[key].to_a.sample(number)` when 1.8.7 is deprecated
(1..number).inject([]) do |selected, _|
available_elements = data[key].to_a - selected
selected << available_elements[rand(available_elements.size)]
end.compact
else
(1..-number).map { data[key].to_a[rand(data[key].size)] }.flatten
end
end
end
end
end
Redis::Connection.drivers << Redis::Connection::Memory
|