SINTERSTORE destination key [key …]

Available since 1.0.0.

Time complexity: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.

This command is equal to SINTER, but instead of returning the resulting set, it is stored in destination.

If destination already exists, it is overwritten.

*Return value

Integer reply: the number of elements in the resulting set.

*Examples

redis> SADD key1 "a" 

  1. (integer) 1

redis> SADD key1 "b" 

  1. (integer) 1

redis> SADD key1 "c" 

  1. (integer) 1

redis> SADD key2 "c" 

  1. (integer) 1

redis> SADD key2 "d" 

  1. (integer) 1

redis> SADD key2 "e" 

  1. (integer) 1

redis> SINTERSTORE key key1 key2 

  1. (integer) 1

redis> SMEMBERS key 

  1. 1) "c"
redis>