SINTER key [key …]

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

    Returns the members of the set resulting from the intersection of all the given sets.

    For example:

    Array reply: list with members of the resulting set.

    *Examples

    redis> SADD key1 "a" 

    1. (integer) 1

    redis> SADD key1 "b"

      redis> SADD key2 "c"

      redis> SADD key2 "d" 

      1. (integer) 1

      redis> SADD key2 "e"

        redis>