trait SetApi[F[+_]] extends AnyRef
- Alphabetic
- By Inheritance
- SetApi
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
sadd(key: Any, value: Any, values: Any*)(implicit format: Format): F[Resp[Option[Long]]]
Add the specified members to the set value stored at key.
Add the specified members to the set value stored at key. (VARIADIC: >= 2.4)
-
abstract
def
scard(key: Any)(implicit format: Format): F[Resp[Option[Long]]]
Return the number of elements (the cardinality) of the Set at key.
-
abstract
def
sdiff[A](key: Any, keys: Any*)(implicit format: Format, parse: Parse[A]): F[Resp[Option[Set[Option[A]]]]]
Return the difference between the Set stored at key1 and all the Sets key2, ..., keyN.
-
abstract
def
sdiffstore(key: Any, keys: Any*)(implicit format: Format): F[Resp[Option[Long]]]
Compute the difference between the Set key1 and all the Sets key2, ..., keyN, and store the resulting Set at dstkey.
-
abstract
def
sinter[A](key: Any, keys: Any*)(implicit format: Format, parse: Parse[A]): F[Resp[Option[Set[Option[A]]]]]
Return the intersection between the Sets stored at key1, key2, ..., keyN.
-
abstract
def
sinterstore(key: Any, keys: Any*)(implicit format: Format): F[Resp[Option[Long]]]
Compute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey.
Compute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey. SINTERSTORE returns the size of the intersection, unlike what the documentation says refer http://code.google.com/p/redis/issues/detail?id=121
-
abstract
def
sismember(key: Any, value: Any)(implicit format: Format): F[Resp[Boolean]]
Test if the specified value is a member of the Set at key.
-
abstract
def
smembers[A](key: Any)(implicit format: Format, parse: Parse[A]): F[Resp[Option[Set[Option[A]]]]]
Return all the members of the Set value at key.
-
abstract
def
smove(sourceKey: Any, destKey: Any, value: Any)(implicit format: Format): F[Resp[Option[Long]]]
Move the specified member from one Set to another atomically.
-
abstract
def
spop[A](key: Any, count: Int)(implicit format: Format, parse: Parse[A]): F[Resp[Option[Set[Option[A]]]]]
Remove and return multiple random elements (pop) from the Set value at key since (3.2).
-
abstract
def
spop[A](key: Any)(implicit format: Format, parse: Parse[A]): F[Resp[Option[A]]]
Remove and return (pop) a random element from the Set value at key.
-
abstract
def
srandmember[A](key: Any, count: Int)(implicit format: Format, parse: Parse[A]): F[Resp[Option[List[Option[A]]]]]
Return multiple random elements from a Set (since 2.6)
-
abstract
def
srandmember[A](key: Any)(implicit format: Format, parse: Parse[A]): F[Resp[Option[A]]]
Return a random element from a Set
-
abstract
def
srem(key: Any, value: Any, values: Any*)(implicit format: Format): F[Resp[Option[Long]]]
Remove the specified members from the set value stored at key.
Remove the specified members from the set value stored at key. (VARIADIC: >= 2.4)
-
abstract
def
sscan[A](key: Any, cursor: Int, pattern: Any = "*", count: Int = 10)(implicit format: Format, parse: Parse[A]): F[Resp[Option[(Option[Int], Option[List[Option[A]]])]]]
Incrementally iterate Set elements (since 2.8)
-
abstract
def
sunion[A](key: Any, keys: Any*)(implicit format: Format, parse: Parse[A]): F[Resp[Option[Set[Option[A]]]]]
Return the union between the Sets stored at key1, key2, ..., keyN.
-
abstract
def
sunionstore(key: Any, keys: Any*)(implicit format: Format): F[Resp[Option[Long]]]
Compute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey.
Compute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey. SUNIONSTORE returns the size of the union, unlike what the documentation says refer http://code.google.com/p/redis/issues/detail?id=121
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (SetApi[F], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
- def ensuring(cond: (SetApi[F]) ⇒ Boolean, msg: ⇒ Any): SetApi[F]
- def ensuring(cond: (SetApi[F]) ⇒ Boolean): SetApi[F]
- def ensuring(cond: Boolean, msg: ⇒ Any): SetApi[F]
- def ensuring(cond: Boolean): SetApi[F]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def →[B](y: B): (SetApi[F], B)