basis.sequential

GeneralSetOps

final class GeneralSetOps[+A] extends AnyRef

General set operations.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GeneralSetOps
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GeneralSetOps(these: Set[A])

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def choose[B](q: PartialFunction[A, B]): Option[B]

    Returns the application of a partial function to the first element of this set for which the function is defined.

    Returns the application of a partial function to the first element of this set for which the function is defined.

    q

    the partial function to test elements against and to apply to the first found element.

    returns

    some found and mapped element, or none if no element applies to q.

    Annotations
    @macroImpl()
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  9. def count(p: (A) ⇒ Boolean): Int

    Returns the number of elements in this set that satisfy a predicate.

    Returns the number of elements in this set that satisfy a predicate.

    p

    the predicate to test elements against.

    returns

    the number of elements satisfying p.

    Annotations
    @macroImpl()
  10. def eagerly: StrictSetOps[A, Set[A]]

    Returns a strict operations interface to this set.

    Returns a strict operations interface to this set.

    Annotations
    @macroImpl()
  11. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  13. def exists(p: (A) ⇒ Boolean): Boolean

    Returns true if a predicate holds for some element of this set.

    Returns true if a predicate holds for some element of this set.

    p

    the predicate to test elements against.

    returns

    true if any element satisfies p, otherwise false.

    Annotations
    @macroImpl()
  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  15. def find(p: (A) ⇒ Boolean): Option[A]

    Returns the first element of this set that satisfies a predicate.

    Returns the first element of this set that satisfies a predicate.

    p

    the predicate to test elements against.

    returns

    some found element, or none if no element satisfies p.

    Annotations
    @macroImpl()
  16. def fold[B >: A](z: B)(op: (B, B) ⇒ B): B

    Returns the repeated application of an associative binary operator between an identity value and all elements of this set.

    Returns the repeated application of an associative binary operator between an identity value and all elements of this set.

    z

    the operator's identity element.

    op

    the associative binary operator to apply.

    returns

    the folded value.

    Annotations
    @macroImpl()
  17. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Returns the left-to-right application of a binary operator between a start value and all elements of this set.

    Returns the left-to-right application of a binary operator between a start value and all elements of this set.

    z

    the starting value.

    op

    the binary operator to apply right-recursively.

    returns

    the folded value.

    Annotations
    @macroImpl()
  18. def forall(p: (A) ⇒ Boolean): Boolean

    Returns true if a predicate holds for all elements of this set.

    Returns true if a predicate holds for all elements of this set.

    p

    the predicate to test elements against.

    returns

    true if all elements satisfy p, otherwise false.

    Annotations
    @macroImpl()
  19. def foreach[U](f: (A) ⇒ U): Unit

    Sequentially applies a function to each element of this set.

    Sequentially applies a function to each element of this set.

    f

    the function to apply to each element.

    Annotations
    @macroImpl()
  20. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  21. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  22. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  23. def lazily: NonStrictSetOps[A]

    Returns a non-strict operations interface to this set.

    Returns a non-strict operations interface to this set.

    Annotations
    @macroImpl()
  24. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  25. final def notify(): Unit

    Definition Classes
    AnyRef
  26. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  27. def reduce[B >: A](op: (B, B) ⇒ B): B

    Returns the repeated application of an associative binary operator between all elements of this non-empty set.

    Returns the repeated application of an associative binary operator between all elements of this non-empty set.

    op

    the associative binary operator to apply.

    returns

    the reduced value.

    Annotations
    @macroImpl()
  28. def reduceLeft[B >: A](op: (B, A) ⇒ B): B

    Returns the left-to-right application of a binary operator between all elements of this non-empty set.

    Returns the left-to-right application of a binary operator between all elements of this non-empty set.

    op

    the binary operator to apply right-recursively.

    returns

    the reduced value.

    Annotations
    @macroImpl()
  29. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

    Returns the left-to-right application of a binary operator between all elements of this set.

    Returns the left-to-right application of a binary operator between all elements of this set.

    op

    the binary operator to apply right-recursively.

    returns

    some reduced value, or none if this set is empty.

    Annotations
    @macroImpl()
  30. def reduceOption[B >: A](op: (B, B) ⇒ B): Option[B]

    Returns the repeated application of an associative binary operator between all elements of this set.

    Returns the repeated application of an associative binary operator between all elements of this set.

    op

    the associative binary operator to apply.

    returns

    some reduced value, or none if this set is empty.

    Annotations
    @macroImpl()
  31. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  32. def toString(): String

    Definition Classes
    AnyRef → Any
  33. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  34. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  35. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any

Traversing

Reducing

Querying

Transforming

Ungrouped