StrictSetOps

Instance Constructors

new StrictSetOps(these: Set[A])

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++[B >: A](those: Enumerator[B])(implicit builder: Builder[From, B]): State

Returns the concatenation of this and another collection.
Returns the concatenation of this and another collection.
those
the elements to append to these elements.
builder
the implicit accumulator for concatenated elements.
returns
the accumulated elements of both collections.

Annotations
@macroImpl()
final def ==(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def collect[B](q: PartialFunction[A, B])(implicit builder: Builder[From, B]): State

Returns the applications of a partial function to each element in this set for which the function is defined.
Returns the applications of a partial function to each element in this set for which the function is defined.
q
the partial function to filter and transform elements.
builder
the implicit accumulator for collected elements.
returns
the accumulated elements filtered and transformed by q.

Annotations
@macroImpl()
def drop(lower: Int)(implicit builder: Builder[From, A]): State

Returns all elements in this set following a prefix up to some length.
Returns all elements in this set following a prefix up to some length.
lower
the length of the prefix to drop; also the inclusive lower bound for indexes of elements to keep.
builder
the accumulator for non-dropped elements.
returns
all but the first lower accumulated elements.

Annotations
@macroImpl()
def dropWhile(p: (A) ⇒ Boolean)(implicit builder: Builder[From, A]): State

Returns all elements following the longest prefix of this set for which each element satisfies a predicate.
Returns all elements following the longest prefix of this set for which each element satisfies a predicate.
p
the predicate to test elements against.
builder
the implicit accumulator for non-dropped elements.
returns
the suffix of accumulated elements beginning with the first element to not satisfy p.

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

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

Definition Classes
AnyRef → Any
def filter(p: (A) ⇒ Boolean)(implicit builder: Builder[From, A]): State

Returns all elements in this set that satisfy a predicate.
Returns all elements in this set that satisfy a predicate.
p
the predicate to test elements against.
builder
the implicit accumulator for filtered elements.
returns
the accumulated elements filtered by p.

Annotations
@macroImpl()
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def flatMap[B](f: (A) ⇒ Enumerator[B])(implicit builder: Builder[From, B]): State

Returns the concatenation of all elements returned by a function applied to each element in this set.
Returns the concatenation of all elements returned by a function applied to each element in this set.
f
the enumerator-yielding function to apply to each element.
builder
the implicit accumulator for flattened elements.
returns
the concatenation of all accumulated elements produced by f.

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

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
def map[B](f: (A) ⇒ B)(implicit builder: Builder[From, B]): State

Returns the applications of a function to each element in this set.
Returns the applications of a function to each element in this set.
f
the function to apply to each element.
builder
the implicit accumulator for transformed elements.
returns
the accumulated elements transformed by f.

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def slice(lower: Int, upper: Int)(implicit builder: Builder[From, A]): State

Returns an interval of elements in this set.
Returns an interval of elements in this set.
lower
the inclusive lower bound for indexes of elements to keep.
upper
the exclusive upper bound for indexes of elements to keep.
builder
the implicit accumulator for kept elements.
returns
the accumulated elements with indexes greater than or equal to lower and less than upper.

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

Definition Classes
AnyRef
def take(upper: Int)(implicit builder: Builder[From, A]): State

Returns a prefix of this set up to some length.
Returns a prefix of this set up to some length.
upper
the length of the prefix to take; also the exclusive upper bound for indexes of elements to keep.
builder
the implicit accumulator for taken elements.
returns
up to the first upper accumulated elements.

Annotations
@macroImpl()
def takeWhile(p: (A) ⇒ Boolean)(implicit builder: Builder[From, A]): State

Returns the longest prefix of this set for which each element satisfies a predicate.
Returns the longest prefix of this set for which each element satisfies a predicate.
p
the predicate to test elements against.
builder
the implicit accumulator for taken elements.
returns
the longest prefix of accumulated elements preceding the first element to not satisfy p.

Annotations
@macroImpl()
def toString(): String

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

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

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

Definition Classes
AnyRef
Annotations
@throws()
def withFilter(p: (A) ⇒ Boolean): Set[A]

Returns a view of all elements in this set that satisfy a predicate.
Returns a view of all elements in this set that satisfy a predicate.
p
the predicate to lazily test elements against.
returns
a non-strict view of the filtered elements.

final class StrictSetOps[+A, +From] extends AnyRef

Instance Constructors

new StrictSetOps(these: Set[A])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: A](those: Enumerator[B])(implicit builder: Builder[From, B]): State

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect[B](q: PartialFunction[A, B])(implicit builder: Builder[From, B]): State

def drop(lower: Int)(implicit builder: Builder[From, A]): State

def dropWhile(p: (A) ⇒ Boolean)(implicit builder: Builder[From, A]): State

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filter(p: (A) ⇒ Boolean)(implicit builder: Builder[From, A]): State

def finalize(): Unit

def flatMap[B](f: (A) ⇒ Enumerator[B])(implicit builder: Builder[From, B]): State

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[B](f: (A) ⇒ B)(implicit builder: Builder[From, B]): State

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def slice(lower: Int, upper: Int)(implicit builder: Builder[From, A]): State

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

def take(upper: Int)(implicit builder: Builder[From, A]): State

def takeWhile(p: (A) ⇒ Boolean)(implicit builder: Builder[From, A]): State

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (A) ⇒ Boolean): Set[A]

Inherited from AnyRef

Inherited from Any

Mapping

Filtering

Combining

Ungrouped