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
|
import math
from typing import Tuple, Callable, List, Any, Optional
from fakeredis import _msgs as msgs
from fakeredis._command_args_parsing import extract_args
from fakeredis._commands import (
command,
Key,
Int,
Float,
MAX_STRING_SIZE,
delete_keys,
fix_range_string,
CommandItem,
)
from fakeredis._helpers import OK, SimpleError, casematch, Database, SimpleString
def _lcs(s1: bytes, s2: bytes) -> Tuple[int, bytes, List[List[object]]]:
l1 = len(s1)
l2 = len(s2)
# Opt array to store the optimal solution value till ith and jth position for 2 strings
opt: List[List[int]] = [[0] * (l2 + 1) for _ in range(0, l1 + 1)]
# Pi array to store the direction when calculating the actual sequence
pi: List[List[int]] = [[0] * (l2 + 1) for _ in range(0, l1 + 1)]
# Algorithm to calculate the length of the longest common subsequence
for r in range(1, l1 + 1):
for c in range(1, l2 + 1):
if s1[r - 1] == s2[c - 1]:
opt[r][c] = opt[r - 1][c - 1] + 1
pi[r][c] = 0
elif opt[r][c - 1] >= opt[r - 1][c]:
opt[r][c] = opt[r][c - 1]
pi[r][c] = 1
else:
opt[r][c] = opt[r - 1][c]
pi[r][c] = 2
# Length of the longest common subsequence is saved at opt[n][m]
# Algorithm to calculate the longest common subsequence using the Pi array
# Also calculate the list of matches
r, c = l1, l2
result = ""
matches = list()
s1ind, s2ind, curr_length = None, None, 0
while r > 0 and c > 0:
if pi[r][c] == 0:
result = chr(s1[r - 1]) + result
r -= 1
c -= 1
curr_length += 1
elif pi[r][c] == 2:
r -= 1
else:
c -= 1
if pi[r][c] == 0 and curr_length == 1:
s1ind = r
s2ind = c
elif pi[r][c] > 0 and curr_length > 0:
matches.append([[r, s1ind], [c, s2ind], curr_length])
s1ind, s2ind, curr_length = None, None, 0
if curr_length:
matches.append([[s1ind, r], [s2ind, c], curr_length])
return opt[l1][l2], result.encode(), matches
class StringCommandsMixin:
_encodeint: Callable[
[
int,
],
bytes,
]
_encodefloat: Callable[[float, bool], bytes]
def __init__(self, *args: Any, **kwargs: Any) -> None:
super(StringCommandsMixin, self).__init__(*args, **kwargs)
self._db: Database
self.version: Tuple[int]
def _incrby(self, key: CommandItem, amount: int) -> int:
c = Int.decode(key.get(b"0")) + amount
key.update(self._encodeint(c))
return c
@command((Key(bytes), bytes))
def append(self, key: CommandItem, value: bytes) -> int:
old = key.get(b"")
if len(old) + len(value) > MAX_STRING_SIZE:
raise SimpleError(msgs.STRING_OVERFLOW_MSG)
key.update(key.get(b"") + value)
return len(key.value)
@command((Key(bytes),))
def decr(self, key: CommandItem) -> int:
return self._incrby(key, -1)
@command((Key(bytes), Int))
def decrby(self, key: CommandItem, amount: int) -> int:
return self._incrby(key, -amount)
@command((Key(bytes),))
def get(self, key: CommandItem) -> bytes:
res: bytes = key.get(None)
return res
@command((Key(bytes),))
def getdel(self, key: CommandItem) -> bytes:
res: bytes = key.get(None)
delete_keys(key)
return res
@command(name=["GETRANGE", "SUBSTR"], fixed=(Key(bytes), Int, Int))
def getrange(self, key: CommandItem, start: int, end: int) -> bytes:
value: bytes = key.get(b"")
start, end = fix_range_string(start, end, len(value))
return value[start:end]
@command(fixed=(Key(bytes), bytes))
def getset(self, key: CommandItem, value: bytes) -> bytes:
old: bytes = key.value
key.value = value
return old
@command(fixed=(Key(bytes), Int))
def incrby(self, key: CommandItem, amount: int) -> int:
return self._incrby(key, amount)
@command(fixed=(Key(bytes),))
def incr(self, key: CommandItem) -> int:
return self._incrby(key, 1)
@command(fixed=(Key(bytes), Float))
def incrbyfloat(self, key: CommandItem, amount: float) -> bytes:
c = Float.decode(key.get(b"0")) + amount
if not math.isfinite(amount):
raise SimpleError(msgs.NONFINITE_MSG)
encoded = self._encodefloat(c, True)
key.update(encoded)
return encoded
@command(fixed=(Key(),), repeat=(Key(),))
def mget(self, *keys: CommandItem) -> List[Optional[bytes]]:
return [key.value if isinstance(key.value, bytes) else None for key in keys]
@command((Key(), bytes), (Key(), bytes))
def mset(self, *args: Any) -> SimpleString:
for i in range(0, len(args), 2):
args[i].value = args[i + 1]
return OK
@command((Key(), bytes), (Key(), bytes))
def msetnx(self, *args: Any) -> int:
for i in range(0, len(args), 2):
if args[i]:
return 0
for i in range(0, len(args), 2):
args[i].value = args[i + 1]
return 1
@command((Key(), Int, bytes))
def psetex(self, key: CommandItem, ms: int, value: bytes) -> SimpleString:
if ms <= 0 or self._db.time * 1000 + ms >= 2**63:
raise SimpleError(msgs.INVALID_EXPIRE_MSG.format("psetex"))
key.value = value
key.expireat = int(self._db.time + ms / 1000.0)
return OK
@command(name="SET", fixed=(Key(), bytes), repeat=(bytes,))
def set_(self, key: CommandItem, value: bytes, *args: bytes) -> Any:
(ex, px, exat, pxat, xx, nx, keepttl, get), _ = extract_args(
args, ("+ex", "+px", "+exat", "+pxat", "xx", "nx", "keepttl", "get")
)
if ex is not None and (ex <= 0 or (self._db.time + ex) * 1000 >= 2**63):
raise SimpleError(msgs.INVALID_EXPIRE_MSG.format("set"))
if px is not None and (px <= 0 or self._db.time * 1000 + px >= 2**63):
raise SimpleError(msgs.INVALID_EXPIRE_MSG.format("set"))
if exat is not None and (exat <= 0 or exat * 1000 >= 2**63):
raise SimpleError(msgs.INVALID_EXPIRE_MSG.format("set"))
if pxat is not None and (pxat <= 0 or pxat >= 2**63):
raise SimpleError(msgs.INVALID_EXPIRE_MSG.format("set"))
if (xx and nx) or (sum(x is not None for x in [ex, px, exat, pxat]) + keepttl > 1):
raise SimpleError(msgs.SYNTAX_ERROR_MSG)
if nx and get and self.version < (7,):
# The command docs say this is allowed from Redis 7.0.
raise SimpleError(msgs.SYNTAX_ERROR_MSG)
old_value = None
if get:
if key.value is not None and type(key.value) is not bytes:
raise SimpleError(msgs.WRONGTYPE_MSG)
old_value = key.value
if nx and key:
return old_value
if xx and not key:
return old_value
if not keepttl:
key.value = value
else:
key.update(value)
if exat is not None:
key.expireat = exat
if pxat is not None:
key.expireat = pxat / 1000.0
if ex is not None:
key.expireat = self._db.time + ex
if px is not None:
key.expireat = self._db.time + px / 1000.0
return OK if not get else old_value
@command((Key(), Int, bytes))
def setex(self, key: CommandItem, seconds: int, value: bytes) -> SimpleString:
if seconds <= 0 or (self._db.time + seconds) * 1000 >= 2**63:
raise SimpleError(msgs.INVALID_EXPIRE_MSG.format("setex"))
key.value = value
key.expireat = int(self._db.time + seconds)
return OK
@command((Key(), bytes))
def setnx(self, key: CommandItem, value: bytes) -> int:
if key:
return 0
key.value = value
return 1
@command((Key(bytes), Int, bytes))
def setrange(self, key: CommandItem, offset: int, value: bytes) -> int:
if offset < 0:
raise SimpleError(msgs.INVALID_OFFSET_MSG)
elif not value:
return len(key.get(b""))
elif offset + len(value) > MAX_STRING_SIZE:
raise SimpleError(msgs.STRING_OVERFLOW_MSG)
out = key.get(b"")
if len(out) < offset:
out += b"\x00" * (offset - len(out))
out = out[0:offset] + value + out[offset + len(value) :]
key.update(out)
return len(out)
@command((Key(bytes),))
def strlen(self, key: CommandItem) -> int:
return len(key.get(b""))
@command((Key(bytes),), (bytes,))
def getex(self, key: CommandItem, *args: bytes) -> Any:
i, count_options, expire_time, diff = 0, 0, None, None
while i < len(args):
count_options += 1
if casematch(args[i], b"ex") and i + 1 < len(args):
diff = Int.decode(args[i + 1])
expire_time = self._db.time + diff
i += 2
elif casematch(args[i], b"px") and i + 1 < len(args):
diff = Int.decode(args[i + 1])
expire_time = (self._db.time * 1000 + diff) / 1000.0
i += 2
elif casematch(args[i], b"exat") and i + 1 < len(args):
expire_time = Int.decode(args[i + 1])
i += 2
elif casematch(args[i], b"pxat") and i + 1 < len(args):
expire_time = Int.decode(args[i + 1]) / 1000.0
i += 2
elif casematch(args[i], b"persist"):
expire_time = None
i += 1
else:
raise SimpleError(msgs.SYNTAX_ERROR_MSG)
if (expire_time is not None and (expire_time <= 0 or expire_time * 1000 >= 2**63)) or (
diff is not None and (diff <= 0 or diff * 1000 >= 2**63)
):
raise SimpleError(msgs.INVALID_EXPIRE_MSG.format("getex"))
if count_options > 1:
raise SimpleError(msgs.SYNTAX_ERROR_MSG)
key.expireat = None if expire_time is None else int(expire_time)
return key.get(None)
@command(fixed=(Key(bytes), Key(bytes)), repeat=(bytes,))
def lcs(self, k1: CommandItem, k2: CommandItem, *args: bytes) -> Any:
s1 = k1.value or b""
s2 = k2.value or b""
(arg_idx, arg_len, arg_minmatchlen, arg_withmatchlen), _ = extract_args(
args, ("idx", "len", "+minmatchlen", "withmatchlen")
)
if arg_idx and arg_len:
raise SimpleError(msgs.LCS_CANT_HAVE_BOTH_LEN_AND_IDX)
lcs_len, lcs_val, matches = _lcs(s1, s2)
if not arg_idx and not arg_len:
return lcs_val
if arg_len:
return lcs_len
arg_minmatchlen = arg_minmatchlen if arg_minmatchlen else 0
results = list(filter(lambda x: x[2] >= arg_minmatchlen, matches))
if not arg_withmatchlen:
results = list(map(lambda x: [x[0], x[1]], results))
return [b"matches", results, b"len", lcs_len]
|
