Compute the intersection of multiple sorted sets
Returns the members of the set resulting from the intersection of all the given sorted sets. Keys that do not exist are considered to be empty sets.
By default, the resulting score of each member is the sum of its scores in the sorted sets where it exists.
Options:
- WEIGHTS: Multiply the score of each member in the corresponding sorted set by the given weight before aggregation
- AGGREGATE SUM|MIN|MAX: Specify how the scores are aggregated (default: SUM)
- WITHSCORES: Return the scores along with the members