X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/bb0b03a3d7d2c321fdbbf42fc44ab75766947ae6..a4460ef43f9625e6c09cdc327614d1b47c043489:/doc/SinterCommand.html
diff --git a/doc/SinterCommand.html b/doc/SinterCommand.html
index efbe7a5c..0d1267dc 100644
--- a/doc/SinterCommand.html
+++ b/doc/SinterCommand.html
@@ -30,7 +30,7 @@
Time complexity O(NM) worst case where N is the cardinality of the smallest set and M the number of sets_
Return the members of a set resulting from the intersection of all thesets hold at the specified keys. Like in LRANGE the result is sent tothe client as a multi-bulk reply (see the protocol specification formore information). If just a single key is specified, then this commandproduces the same result as SELEMENTS. Actually SELEMENTS is just syntaxsugar for SINTERSECT.
Non existing keys are considered like empty sets, so if one of the keys ismissing an empty set is returned (since the intersection with an emptyset always is an empty set).
Multi bulk reply, specifically the list of common elements.
-* SREM* SISMEMBER* SCARD* SMEMBERS* SINTERSTORE* SUNION* SUNIONSTORE
+* SADD* SREM* SISMEMBER* SCARD* SMEMBERS* SINTERSTORE* SUNION* SUNIONSTORE* SMOVE