@@ -10,7 +10,7 @@ discard block |
||
10 | 10 | * See: https://redis.io/commands/sadd. |
11 | 11 | * |
12 | 12 | * @param string $key |
13 | - * @param splat $members |
|
13 | + * @param splat[] $members |
|
14 | 14 | * |
15 | 15 | * @return int The number of elements added to the set. |
16 | 16 | */ |
@@ -56,7 +56,7 @@ discard block |
||
56 | 56 | /** |
57 | 57 | * Performs the difference between N sets and returns it. |
58 | 58 | * |
59 | - * @param splat $keys |
|
59 | + * @param splat[] $keys |
|
60 | 60 | * |
61 | 61 | * @return array |
62 | 62 | */ |
@@ -69,10 +69,10 @@ discard block |
||
69 | 69 | * Performs the same action as sDiff, but stores the result in the first key. |
70 | 70 | * |
71 | 71 | * @param string $destinationKey The key to store the diff into. |
72 | - * @param splat $keys key1, key2, ... , keyN: Any number of keys |
|
72 | + * @param splat[] $keys key1, key2, ... , keyN: Any number of keys |
|
73 | 73 | * corresponding to sets in redis. |
74 | 74 | * |
75 | - * @return The cardinality of the resulting set, or FALSE in case of a |
|
75 | + * @return integer cardinality of the resulting set, or FALSE in case of a |
|
76 | 76 | * missing key. |
77 | 77 | */ |
78 | 78 | public function sDiffStore(string $destinationKey, ...$keys): int |
@@ -87,7 +87,7 @@ discard block |
||
87 | 87 | * of this set. If one of the keys is missing, FALSE is returned. |
88 | 88 | * See: https://redis.io/commands/sinter. |
89 | 89 | * |
90 | - * @param splat $keys key1, key2, keyN: keys identifying the different |
|
90 | + * @param splat[] $keys key1, key2, keyN: keys identifying the different |
|
91 | 91 | * sets on which we will apply the intersection. |
92 | 92 | * |
93 | 93 | * @return array Contain the result of the intersection between |
@@ -105,7 +105,7 @@ discard block |
||
105 | 105 | * See: https://redis.io/commands/sinterstore. |
106 | 106 | * |
107 | 107 | * @param string $destinationKey The key to store the diff into. |
108 | - * @param plat $keys key1, key2... keyN. key1..keyN are |
|
108 | + * @param plat[] $keys key1, key2... keyN. key1..keyN are |
|
109 | 109 | * intersected as in sInter. |
110 | 110 | * |
111 | 111 | * @return int The cardinality of the resulting set, |
@@ -247,7 +247,7 @@ discard block |
||
247 | 247 | * See: https://redis.io/commands/srem. |
248 | 248 | * |
249 | 249 | * @param string $key |
250 | - * @param splat $members |
|
250 | + * @param splat[] $members |
|
251 | 251 | * |
252 | 252 | * @return int The number of elements removed from the set. |
253 | 253 | */ |
@@ -263,7 +263,7 @@ discard block |
||
263 | 263 | * See: https://redis.io/commands/srem. |
264 | 264 | * |
265 | 265 | * @param string $key |
266 | - * @param splat $members |
|
266 | + * @param splat[] $members |
|
267 | 267 | * |
268 | 268 | * @return int The number of elements removed from the set. |
269 | 269 | */ |
@@ -276,7 +276,7 @@ discard block |
||
276 | 276 | * Performs the union between N sets and returns it. |
277 | 277 | * See: https://redis.io/commands/sunion. |
278 | 278 | * |
279 | - * @param splat $keys |
|
279 | + * @param splat[] $keys |
|
280 | 280 | * |
281 | 281 | * @return array key1, key2, ... , keyN: Any number of keys |
282 | 282 | * corresponding to sets in redis. |
@@ -292,7 +292,7 @@ discard block |
||
292 | 292 | * See: https://redis.io/commands/sunionstore. |
293 | 293 | * |
294 | 294 | * @param string $destinationKey |
295 | - * @param splat $keys |
|
295 | + * @param splat[] $keys |
|
296 | 296 | * |
297 | 297 | * @return int The cardinality of the resulting set, |
298 | 298 | * or FALSE in case of a missing key. |
@@ -310,7 +310,7 @@ discard block |
||
310 | 310 | * Scan a set for members. |
311 | 311 | * See: https://redis.io/commands/sscan. |
312 | 312 | * |
313 | - * @param string $keys The set to search. |
|
313 | + * @param string $key The set to search. |
|
314 | 314 | * @param int $iterator LONG (reference) to the iterator as we go. |
315 | 315 | * @param string $pattern String, optional pattern to match against. |
316 | 316 | * @param int|integer $count How many members to return at a time |