SortedArraySet

Companion object SortedArraySet

class SortedArraySet[A] extends SortedSet[A] with SortedSetLike[A, SortedArraySet[A]] with Serializable

Self Type: SortedArraySet[A]
Annotations: @SerialVersionUID()

Linear Supertypes

Ordering

Alphabetic
By Inheritance

Inherited

SortedArraySet
Serializable
Serializable
SortedSet
SortedSet
SortedSetLike
Sorted
Set
Set
SetLike
Subtractable
GenSet
GenericSetTemplate
GenSetLike
Function1
Iterable
Iterable
IterableLike
Equals
GenIterable
GenIterableLike
Traversable
Immutable
Traversable
GenTraversable
GenericTraversableTemplate
TraversableLike
GenTraversableLike
Parallelizable
TraversableOnce
GenTraversableOnce
FilterMonadic
HasNewBuilder
AnyRef
Any

Implicitly

by CollectionsHaveToParArray
by MonadOps
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
by alternateImplicit

Hide All
Show All

Visibility

Public
All

Instance Constructors

new SortedArraySet(array: Array[A] = ...)(implicit ordering: Ordering[A])

Type Members

type Self = SortedArraySet[A]

Attributes
protected[this]
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

Definition Classes
TraversableLike

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def &(that: GenSet[A]): SortedArraySet[A]

Definition Classes
GenSetLike
def &~(that: GenSet[A]): SortedArraySet[A]

Definition Classes
GenSetLike
def +(elem: A): SortedArraySet[A]

Definition Classes
SortedArraySet → SetLike → GenSetLike
def +(elem1: A, elem2: A, elems: A*): SortedArraySet[A]

Definition Classes
SetLike
def ++(elems: GenTraversableOnce[A]): SortedArraySet[A]

Definition Classes
SetLike
def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
TraversableLike
def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
TraversableLike
def -(elem: A): SortedArraySet[A]

Definition Classes
SortedArraySet → SetLike → Subtractable → GenSetLike
def -(elem1: A, elem2: A, elems: A*): SortedArraySet[A]

Definition Classes
Subtractable
def --(xs: GenTraversableOnce[A]): SortedArraySet[A]

Definition Classes
Subtractable
def ->[B](y: B): (SortedArraySet[A], B)

Implicit
This member is added by an implicit conversion from SortedArraySet[A] to ArrowAssoc[SortedArraySet[A]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
def /:[B](z: B)(op: (B, A) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def :\[B](z: B)(op: (A, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addString(b: StringBuilder): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

Definition Classes
Function1
Annotations
@unspecialized()
def apply(elem: A): Boolean

Definition Classes
GenSetLike → Function1
final def asInstanceOf[T0]: T0

Definition Classes
Any
def canEqual(that: Any): Boolean

Definition Classes
IterableLike → Equals
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

Definition Classes
TraversableOnce
def companion: GenericCompanion[Set]

Definition Classes
Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
def compare(k0: A, k1: A): Int

Definition Classes
Sorted
def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

Definition Classes
Function1
Annotations
@unspecialized()
def contains(elem: A): Boolean

Definition Classes
SortedArraySet → SetLike → GenSetLike
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray[B >: A](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: A](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: A](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def count(p: (A) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def diff(that: GenSet[A]): SortedArraySet[A]

Definition Classes
SetLike → GenSetLike
def drop(n: Int): SortedArraySet[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def dropRight(n: Int): SortedArraySet[A]

Definition Classes
IterableLike
def dropWhile(p: (A) ⇒ Boolean): SortedArraySet[A]

Definition Classes
TraversableLike → GenTraversableLike
def empty: SortedArraySet[A]

Definition Classes
SortedArraySet → SortedSet → SortedSet → SetLike → GenericSetTemplate
def ensuring(cond: (SortedArraySet[A]) ⇒ Boolean, msg: ⇒ Any): SortedArraySet[A]

Implicit
This member is added by an implicit conversion from SortedArraySet[A] to Ensuring[SortedArraySet[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (SortedArraySet[A]) ⇒ Boolean): SortedArraySet[A]

Implicit
This member is added by an implicit conversion from SortedArraySet[A] to Ensuring[SortedArraySet[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): SortedArraySet[A]

Implicit
This member is added by an implicit conversion from SortedArraySet[A] to Ensuring[SortedArraySet[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): SortedArraySet[A]

Implicit
This member is added by an implicit conversion from SortedArraySet[A] to Ensuring[SortedArraySet[A]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
GenSetLike → Equals → AnyRef → Any
def exists(p: (A) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def filter(p: (A) ⇒ Boolean): SortedArraySet[A]

Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (A) ⇒ Boolean): SortedArraySet[A]

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

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

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def firstKey: A

Definition Classes
SortedSetLike → Sorted
def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[B]

Definition Classes
GenericTraversableTemplate
def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (A, B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def forall(p: (A) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def foreach[U](f: (A) ⇒ U): Unit

Definition Classes
IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
def formatted(fmtstr: String): String

Implicit
This member is added by an implicit conversion from SortedArraySet[A] to StringFormat[SortedArraySet[A]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
def from(from: A): SortedArraySet[A]

Definition Classes
SortedSetLike → Sorted
def genericBuilder[B]: Builder[B, Set[B]]

Definition Classes
GenericTraversableTemplate
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@native()
def groupBy[K](f: (A) ⇒ K): Map[K, SortedArraySet[A]]

Definition Classes
TraversableLike → GenTraversableLike
def grouped(size: Int): Iterator[SortedArraySet[A]]

Definition Classes
IterableLike
def hasAll(j: Iterator[A]): Boolean

Attributes
protected
Definition Classes
Sorted
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hashCode(): Int

Definition Classes
GenSetLike → AnyRef → Any
def head: A

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def headOption: Option[A]

Definition Classes
TraversableLike → GenTraversableLike
final def index(elem: A): Int

Attributes
protected
def init: SortedArraySet[A]

Definition Classes
TraversableLike → GenTraversableLike
def inits: Iterator[SortedArraySet[A]]

Definition Classes
TraversableLike
def intersect(that: GenSet[A]): SortedArraySet[A]

Definition Classes
GenSetLike
def isEmpty: Boolean

Definition Classes
SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
def iterator: Iterator[A]

Definition Classes
SortedArraySet → GenSetLike → IterableLike → GenIterableLike
final def iterator(from: Int): Iterator[A]

Attributes
protected
def iteratorFrom(start: A): Iterator[A]

Definition Classes
SortedSetLike
def keySet: SortedArraySet[A]

Definition Classes
SortedSetLike → Sorted
def keysIteratorFrom(start: A): Iterator[A]

Definition Classes
SortedArraySet → Sorted
def last: A

Definition Classes
TraversableLike → GenTraversableLike
def lastKey: A

Definition Classes
SortedSetLike → Sorted
def lastOption: Option[A]

Definition Classes
TraversableLike → GenTraversableLike
def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
SetLike → TraversableLike → GenTraversableLike → FilterMonadic
Annotations
@migration
Migration
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
def max[B >: A](implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def min[B >: A](implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newBuilder: Builder[A, SortedArraySet[A]]

Attributes
protected[this]
Definition Classes
SetLike → TraversableLike → HasNewBuilder
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@native()
implicit val ordering: Ordering[A]

Definition Classes
SortedArraySet → SortedSetLike → Sorted
def par: ParSet[A]

Definition Classes
Parallelizable
def parCombiner: Combiner[A, ParSet[A]]

Attributes
protected
Definition Classes
Set → SetLike → Iterable → TraversableLike → Parallelizable
def partition(p: (A) ⇒ Boolean): (SortedArraySet[A], SortedArraySet[A])

Definition Classes
TraversableLike → GenTraversableLike
def product[B >: A](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def range(from: A, until: A): SortedArraySet[A]

Definition Classes
SortedSetLike → Sorted
def rangeImpl(from: Option[A], until: Option[A]): SortedArraySet[A]

Definition Classes
SortedArraySet → SortedSetLike → Sorted
def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: A](op: (B, A) ⇒ B): B

Definition Classes
TraversableOnce
def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: A](op: (A, B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def repr: SortedArraySet[A]

Definition Classes
TraversableLike → GenTraversableLike
def reversed: List[A]

Attributes
protected[this]
Definition Classes
TraversableOnce
def sameElements[B >: A](that: GenIterable[B]): Boolean

Definition Classes
IterableLike → GenIterableLike
def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[SortedArraySet[A], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
final def search(elem: A, cond: (A, A) ⇒ Boolean): Option[Int]

Attributes
protected
def seq: Set[A]

Definition Classes
Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def size: Int

Definition Classes
SortedArraySet → GenTraversableLike → TraversableOnce → GenTraversableOnce
def sizeHintIfCheap: Int

Attributes
protected[scala.collection]
Definition Classes
GenTraversableOnce
def slice(from: Int, until: Int): SortedArraySet[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def sliding(size: Int, step: Int): Iterator[SortedArraySet[A]]

Definition Classes
IterableLike
def sliding(size: Int): Iterator[SortedArraySet[A]]

Definition Classes
IterableLike
def span(p: (A) ⇒ Boolean): (SortedArraySet[A], SortedArraySet[A])

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (SortedArraySet[A], SortedArraySet[A])

Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String

Definition Classes
SetLike → TraversableLike → GenTraversableLike
def subsetOf(that: GenSet[A]): Boolean

Definition Classes
SortedSetLike → GenSetLike
def subsets(): Iterator[SortedArraySet[A]]

Definition Classes
SetLike
def subsets(len: Int): Iterator[SortedArraySet[A]]

Definition Classes
SetLike
def sum[B >: A](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: SortedArraySet[A]

Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[SortedArraySet[A]]

Definition Classes
TraversableLike
def take(n: Int): SortedArraySet[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def takeRight(n: Int): SortedArraySet[A]

Definition Classes
IterableLike
def takeWhile(p: (A) ⇒ Boolean): SortedArraySet[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def thisCollection: Iterable[A]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def to(to: A): SortedArraySet[A]

Definition Classes
Sorted
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[A1 >: A]: Buffer[A1]

Definition Classes
SetLike → TraversableOnce → GenTraversableOnce
def toCollection(repr: SortedArraySet[A]): Iterable[A]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toIndexedSeq: IndexedSeq[A]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[A]

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def toIterator: Iterator[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toList: List[A]

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toParArray: ParArray[T]

Implicit
This member is added by an implicit conversion from SortedArraySet[A] to CollectionsHaveToParArray[SortedArraySet[A], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (SortedArraySet[A]) ⇒ GenTraversableOnce[T] is in scope.
Definition Classes
CollectionsHaveToParArray
def toSeq: Seq[A]

Definition Classes
SetLike → TraversableOnce → GenTraversableOnce
def toSet[B >: A]: Set[B]

Definition Classes
Set → TraversableOnce → GenTraversableOnce
def toStream: Stream[A]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toString(): String

Definition Classes
SetLike → Function1 → TraversableLike → AnyRef → Any
def toTraversable: Traversable[A]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toVector: Vector[A]

Definition Classes
TraversableOnce → GenTraversableOnce
def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[Set[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def union(that: GenSet[A]): SortedArraySet[A]

Definition Classes
SetLike → GenSetLike
def until(until: A): SortedArraySet[A]

Definition Classes
SortedSetLike → Sorted
def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

Definition Classes
GenericTraversableTemplate
def view(from: Int, until: Int): IterableView[A, SortedArraySet[A]]

Definition Classes
IterableLike → TraversableLike
def view: IterableView[A, SortedArraySet[A]]

Definition Classes
IterableLike → TraversableLike
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
@native() @throws( ... )
def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, SortedArraySet[A]]

Definition Classes
TraversableLike → FilterMonadic
def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[SortedArraySet[A], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[SortedArraySet[A], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[SortedArraySet[A], (A1, Int), That]): That

Definition Classes
IterableLike → GenIterableLike
def |(that: GenSet[A]): SortedArraySet[A]

Definition Classes
GenSetLike
def →[B](y: B): (SortedArraySet[A], B)

Implicit
This member is added by an implicit conversion from SortedArraySet[A] to ArrowAssoc[SortedArraySet[A]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Shadowed Implicit Value Members

def +(other: String): String
Implicit
This member is added by an implicit conversion from SortedArraySet[A] to any2stringadd[SortedArraySet[A]] performed by method any2stringadd in scala.Predef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(sortedArraySet: any2stringadd[SortedArraySet[A]]).+(other)
Definition Classes
any2stringadd
def filter(p: (A) ⇒ Boolean): TraversableOnce[A]
Implicit
This member is added by an implicit conversion from SortedArraySet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(sortedArraySet: MonadOps[A]).filter(p)
Definition Classes
MonadOps
def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
Implicit
This member is added by an implicit conversion from SortedArraySet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(sortedArraySet: MonadOps[A]).flatMap(f)
Definition Classes
MonadOps
def map[B](f: (A) ⇒ B): TraversableOnce[B]
Implicit
This member is added by an implicit conversion from SortedArraySet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(sortedArraySet: MonadOps[A]).map(f)
Definition Classes
MonadOps
def withFilter(p: (A) ⇒ Boolean): Iterator[A]
Implicit
This member is added by an implicit conversion from SortedArraySet[A] to MonadOps[A] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(sortedArraySet: MonadOps[A]).withFilter(p)
Definition Classes
MonadOps

Inherited from Serializable

Inherited from SortedSet[A]

Inherited from SortedSetLike[A, SortedArraySet[A]]

Inherited from Sorted[A, SortedArraySet[A]]

Inherited from Set[A]

Inherited from SetLike[A, SortedArraySet[A]]

Inherited from Subtractable[A, SortedArraySet[A]]

Inherited from GenSet[A]

Packages

SortedArraySet 

Companion object SortedArraySet

class SortedArraySet[A] extends SortedSet[A] with SortedSetLike[A, SortedArraySet[A]] with Serializable

Instance Constructors

Type Members

Value Members

Shadowed Implicit Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from SortedSet[A]

Inherited from SortedSet[A]

Inherited from SortedSetLike[A, SortedArraySet[A]]

Inherited from Sorted[A, SortedArraySet[A]]

Inherited from Set[A]

Inherited from Set[A]

Inherited from SetLike[A, SortedArraySet[A]]

Inherited from Subtractable[A, SortedArraySet[A]]

Inherited from GenSet[A]

Inherited from GenericSetTemplate[A, Set]

Inherited from GenSetLike[A, SortedArraySet[A]]

Inherited from (A) ⇒ Boolean

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, SortedArraySet[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, SortedArraySet[A]]

Inherited from Traversable[A]

Inherited from Immutable

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, Set]

Inherited from TraversableLike[A, SortedArraySet[A]]

Inherited from GenTraversableLike[A, SortedArraySet[A]]

Inherited from Parallelizable[A, ParSet[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, SortedArraySet[A]]

Inherited from HasNewBuilder[A, SortedArraySet[A]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion CollectionsHaveToParArray from SortedArraySet[A] to CollectionsHaveToParArray[SortedArraySet[A], T]

Inherited by implicit conversion MonadOps from SortedArraySet[A] to MonadOps[A]

Inherited by implicit conversion any2stringadd from SortedArraySet[A] to any2stringadd[SortedArraySet[A]]

Inherited by implicit conversion StringFormat from SortedArraySet[A] to StringFormat[SortedArraySet[A]]

Inherited by implicit conversion Ensuring from SortedArraySet[A] to Ensuring[SortedArraySet[A]]

Inherited by implicit conversion ArrowAssoc from SortedArraySet[A] to ArrowAssoc[SortedArraySet[A]]

Inherited by implicit conversion alternateImplicit from SortedArraySet[A] to ForceImplicitAmbiguity

Ungrouped

SortedArraySet