Sets

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

7. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

8. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

9. final def getClass(): Class[_]

   

   Definition Classes

   AnyRef → Any

10. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

11. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

12. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

13. final def notify(): Unit

    

    Definition Classes

    AnyRef

14. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

15. def sAdd(key: ChannelBuffer, members: List[ChannelBuffer]): Future[Long]

    

    Adds elements to the set, according to the set property.

    Adds elements to the set, according to the set property. Throws an exception if the key does not refer to a set.

    returns

    the number of new members added to the set.

16. def sCard(key: ChannelBuffer): Future[Long]

    

    How many elements are in the set? Throws an exception if the key does not refer to a set.

    How many elements are in the set? Throws an exception if the key does not refer to a set.

    returns

    the number of elements in the set. Unassigned keys are considered empty sets.

17. def sInter(keys: Seq[ChannelBuffer]): Future[Set[ChannelBuffer]]

    

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

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

    Keys that do not exist are considered to be empty sets. With one of the keys being an empty set, the resulting set is also empty (since set intersection with an empty set always results in an empty set).

    Throws an exception if the keys Seq is empty or if any of the keys passed as params are empty.

    keys

    list of keys to intersect

    returns

    set of members from the resulting intersection

18. def sIsMember(key: ChannelBuffer, member: ChannelBuffer): Future[Boolean]

    

    Is the member in the set? Throws an exception if the key does not refer to a set.

    Is the member in the set? Throws an exception if the key does not refer to a set.

    returns

    a boolean, true if it is in the set, false otherwise. Unassigned keys are considered empty sets.

19. def sMembers(key: ChannelBuffer): Future[Set[ChannelBuffer]]

    

    Gets the members of the set.

    Gets the members of the set. Throws an exception if the key does not refer to a set.

    returns

    a list of the members

20. def sPop(key: ChannelBuffer): Future[Option[ChannelBuffer]]

    

    Removes an element randomly from the set, and returns it.

    Removes an element randomly from the set, and returns it. Throws an exception if the key does not refer to a set.

    returns

    the member, or nothing if the set is empty.

21. def sRandMember(key: ChannelBuffer, count: Option[Int] = None): Future[Seq[ChannelBuffer]]

    

    Returns a list of random entries from the set.

    Returns a list of random entries from the set. If the count is positive, a set is returned, otherwise a list that may contain duplicates is returned.

    returns

    a sequence with count random entries from the set

22. def sRem(key: ChannelBuffer, members: List[ChannelBuffer]): Future[Long]

    

    Removes the element from the set if it is in the set.

    Removes the element from the set if it is in the set. Throws an exception if the key does not refer to a set.

    returns

    an integer, the number of elements removed from the set, can be 0 if the key is unassigned.

23. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

24. def toString(): String

    

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )