final class SimpleArraySet[A] extends ArraySet[A] with GenericSetTemplate[A, SimpleArraySet] with SetLike[A, SimpleArraySet[A]] with Serializable
A basic ArraySet implementation suitable for efficient add operations. Element removal could be optimized by another implementation.
- Annotations
- @SerialVersionUID()
- Alphabetic
- By Inheritance
- SimpleArraySet
- Serializable
- Serializable
- ArraySet
- ExtSetMethods
- Set
- SetLike
- Cloneable
- Cloneable
- Cloneable
- Shrinkable
- Builder
- Growable
- Clearable
- Scriptable
- Set
- SetLike
- Subtractable
- GenSet
- GenericSetTemplate
- GenSetLike
- Function1
- Iterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- Mutable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- by CollectionsHaveToParArray
- by MonadOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
SimpleArraySet(hints: Hints)
- hints
Optimization hints controlling the growth of the underlying scala.collection.mutable.ArrayBuffer!.
Type Members
-
type
Self = SimpleArraySet[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]): SimpleArraySet[A]
- Definition Classes
- GenSetLike
-
def
&~(that: GenSet[A]): SimpleArraySet[A]
- Definition Classes
- GenSetLike
-
def
+(elem1: A, elem2: A, elems: A*): SimpleArraySet[A]
- Definition Classes
- SetLike → SetLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
+
creates a new set. Use+=
to add an element to this set and return that set itself.
-
def
+(elem: A): SimpleArraySet[A]
- Definition Classes
- SetLike → SetLike → GenSetLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
+
creates a new set. Use+=
to add an element to this set and return that set itself.
-
def
++(xs: GenTraversableOnce[A]): SimpleArraySet[A]
- Definition Classes
- SetLike → SetLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
++
creates a new set. Use++=
to add elements to this set and return that set itself.
-
def
++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: TraversableOnce[A]): SimpleArraySet.this.type
- Definition Classes
- Growable
-
def
+=(elem: A): SimpleArraySet.this.type
- Definition Classes
- SimpleArraySet → SetLike → Builder → Growable
-
def
+=(elem1: A, elem2: A, elems: A*): SimpleArraySet.this.type
- Definition Classes
- Growable
-
def
+=!(elem: A): SimpleArraySet.this.type
Adds
elem
without checking for duplicates.Adds
elem
without checking for duplicates.- Attributes
- protected[scalax.collection]
- Definition Classes
- SimpleArraySet → ArraySet
-
def
-(elem1: A, elem2: A, elems: A*): SimpleArraySet[A]
- Definition Classes
- SetLike → Subtractable
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
-
creates a new set. Use-=
to remove an element from this set and return that set itself.
-
def
-(elem: A): SimpleArraySet[A]
- Definition Classes
- SetLike → SetLike → Subtractable → GenSetLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
-
creates a new set. Use-=
to remove an element from this set and return that set itself.
-
def
--(xs: GenTraversableOnce[A]): SimpleArraySet[A]
- Definition Classes
- SetLike → Subtractable
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
--
creates a new set. Use--=
to remove elements from this set and return that set itself.
-
def
--=(xs: TraversableOnce[A]): SimpleArraySet.this.type
- Definition Classes
- Shrinkable
-
def
-=(elem: A): SimpleArraySet.this.type
- Definition Classes
- SimpleArraySet → SetLike → Shrinkable
-
def
-=(elem1: A, elem2: A, elems: A*): SimpleArraySet.this.type
- Definition Classes
- Shrinkable
-
def
->[B](y: B): (SimpleArraySet[A], B)
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[A] to ArrowAssoc[SimpleArraySet[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
add(elem: A): Boolean
- Definition Classes
- SimpleArraySet → SetLike
-
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
-
def
array: Array[A]
- Attributes
- protected[scalax.collection]
- Definition Classes
- SimpleArraySet → ArraySet
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
final
def
capacity: Int
For
isArray == true
, the current capacity of the internal array else 0.For
isArray == true
, the current capacity of the internal array else 0.- Definition Classes
- SimpleArraySet → ArraySet
-
def
clear(): Unit
- Definition Classes
- SetLike → Builder → Growable → Clearable
-
def
clone(): SimpleArraySet[A]
- Definition Classes
- SimpleArraySet → SetLike → Cloneable → AnyRef
-
def
collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[A, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
compact: Unit
Compacts the current representation depending on ArraySet.Hints.compactUpToUsed.
Compacts the current representation depending on ArraySet.Hints.compactUpToUsed.
- Definition Classes
- SimpleArraySet → ArraySet
-
def
companion: GenericCompanion[SimpleArraySet]
- Definition Classes
- SimpleArraySet → ArraySet → Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains(elem: A): Boolean
- Definition Classes
- SimpleArraySet → 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]): SimpleArraySet[A]
- Definition Classes
- SetLike → GenSetLike
-
def
draw(random: Random): A
Returns a random element of the set if it is
nonEmpty
otherwise throwsIllegalArgumentException
.Returns a random element of the set if it is
nonEmpty
otherwise throwsIllegalArgumentException
.- random
a random generator; it is essential that
random
be instantiated by the caller just once for any sequence of calls
- Definition Classes
- SimpleArraySet → ExtSetMethods
-
def
drop(n: Int): SimpleArraySet[A]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): SimpleArraySet[A]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (A) ⇒ Boolean): SimpleArraySet[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
empty: SimpleArraySet[A]
- Definition Classes
- GenericSetTemplate
-
def
ensuring(cond: (SimpleArraySet[A]) ⇒ Boolean, msg: ⇒ Any): SimpleArraySet[A]
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[A] to Ensuring[SimpleArraySet[A]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (SimpleArraySet[A]) ⇒ Boolean): SimpleArraySet[A]
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[A] to Ensuring[SimpleArraySet[A]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): SimpleArraySet[A]
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[A] to Ensuring[SimpleArraySet[A]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): SimpleArraySet[A]
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[A] to Ensuring[SimpleArraySet[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): SimpleArraySet[A]
Optimized by use of unchecked insertions.
Optimized by use of unchecked insertions.
- Definition Classes
- SimpleArraySet → TraversableLike → GenTraversableLike
-
def
filterNot(p: (A) ⇒ Boolean): SimpleArraySet[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]
- Definition Classes
- SimpleArraySet → ArraySet
-
def
find(p: (A) ⇒ Boolean): Option[A]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
findElem[B](other: B, correspond: (A, B) ⇒ Boolean): A
Finds an entry in the collection based on
toMatch
'shashCode
and a correspondence function but not on the argument type.Finds an entry in the collection based on
toMatch
'shashCode
and a correspondence function but not on the argument type.- correspond
function returning whether a given entry corresponds to
other
- returns
the entry corresponding to
toMatch
or null if not contained
- Definition Classes
- SimpleArraySet → ExtSetMethods
-
def
flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): SimpleArraySet[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
- SimpleArraySet → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[A] to StringFormat[SimpleArraySet[A]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
genericBuilder[B]: Builder[B, SimpleArraySet[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (A) ⇒ K): Map[K, SimpleArraySet[A]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[SimpleArraySet[A]]
- Definition Classes
- IterableLike
-
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
-
val
hints: Hints
The hints valid for this ArraySet!.
The hints valid for this ArraySet!.
- Definition Classes
- SimpleArraySet → ArraySet
-
final
def
indexOf(elem: A): Int
- Attributes
- protected
-
final
def
indexOf[B](elem: B, pred: (A, B) ⇒ Boolean): Int
- Attributes
- protected
-
def
init: SimpleArraySet[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[SimpleArraySet[A]]
- Definition Classes
- TraversableLike
-
def
intersect(that: GenSet[A]): SimpleArraySet[A]
- Definition Classes
- GenSetLike
-
final
def
isArray: Boolean
Whether the internal representation is currently based on
Array
.Whether the internal representation is currently based on
Array
.- Definition Classes
- SimpleArraySet → ArraySet
- Annotations
- @inline()
-
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
- SimpleArraySet → GenSetLike → IterableLike → GenIterableLike
-
def
last: A
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
map(xs: TraversableOnce[A]): SimpleArraySet.this.type
- Attributes
- protected[scalax.collection]
-
def
map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[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
mapResult[NewTo](f: (SimpleArraySet[A]) ⇒ NewTo): Builder[A, NewTo]
- Definition Classes
- Builder
-
def
mapUnchecked[B, That](f: (A) ⇒ B): SimpleArraySet[B]
Faster mapping in case the caller ensures to insert no duplicates.
Faster mapping in case the caller ensures to insert no duplicates.
- Attributes
- protected[scalax.collection]
-
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: CheckingBuilder[A]
- Definition Classes
- SimpleArraySet → SetLike → SetLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder
-
def
newNonCheckingBuilder[B]: NonCheckingBuilder[A, B]
- Attributes
- protected[scalax.collection]
-
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()
-
def
par: ParSet[A]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[A, ParSet[A]]
- Attributes
- protected[this]
- Definition Classes
- SetLike → SetLike → TraversableLike → Parallelizable
-
def
partition(p: (A) ⇒ Boolean): (SimpleArraySet[A], SimpleArraySet[A])
Optimized by use of unchecked insertions.
Optimized by use of unchecked insertions.
- Definition Classes
- SimpleArraySet → TraversableLike → GenTraversableLike
-
def
product[B >: A](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
remove(elem: A): Boolean
- Definition Classes
- SetLike
-
def
removeIndex(i: Int): Unit
- Attributes
- protected
-
def
repr: SimpleArraySet[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
resizeArray(fromCapacity: Int, toCapacity: Int): Unit
- Attributes
- protected
-
def
resizedToHash: Boolean
- Attributes
- protected
-
def
result(): SimpleArraySet[A]
- Definition Classes
- SetLike → Builder
-
def
retain(p: (A) ⇒ Boolean): Unit
- Definition Classes
- SetLike
-
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[SimpleArraySet[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[SimpleArraySet[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.
-
def
seq: Set[A]
- Definition Classes
- Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
set: ExtHashSet[A]
- Attributes
- protected[scalax.collection]
- Definition Classes
- SimpleArraySet → ArraySet
-
final
def
setToArray(set: Iterable[A], size: Int): Unit
- Attributes
- protected
-
def
size: Int
- Definition Classes
- SimpleArraySet → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
- Definition Classes
- Builder
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHint(size: Int): Unit
- Definition Classes
- Builder
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): SimpleArraySet[A]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[SimpleArraySet[A]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[SimpleArraySet[A]]
- Definition Classes
- IterableLike
-
def
sortBy(f: (A) ⇒ A)(implicit ord: Ordering[A]): SortedSet[A]
Sorts this
ArraySet
according to the Ordering which results from transforming an implicitly given Ordering with a transformation function in place.Sorts this
ArraySet
according to the Ordering which results from transforming an implicitly given Ordering with a transformation function in place.- Definition Classes
- ArraySet
- See also
scala.collection.SeqLike
-
def
sortWith(lt: (A, A) ⇒ Boolean): SortedSet[A]
Sorts this
ArraySet
according to a comparison function in place.Sorts this
ArraySet
according to a comparison function in place.- Definition Classes
- ArraySet
- See also
scala.collection.SeqLike
-
def
sorted(implicit ord: Ordering[A]): SortedSet[A]
Sorts this
ArraySet
according to an Ordering in place.Sorts this
ArraySet
according to an Ordering in place.- Definition Classes
- SimpleArraySet → ArraySet
- See also
scala.collection.SeqLike
-
def
span(p: (A) ⇒ Boolean): (SimpleArraySet[A], SimpleArraySet[A])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (SimpleArraySet[A], SimpleArraySet[A])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- SetLike → TraversableLike → GenTraversableLike
-
def
subsetOf(that: GenSet[A]): Boolean
- Definition Classes
- GenSetLike
-
def
subsets(): Iterator[SimpleArraySet[A]]
- Definition Classes
- SetLike
-
def
subsets(len: Int): Iterator[SimpleArraySet[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: SimpleArraySet[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[SimpleArraySet[A]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): SimpleArraySet[A]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): SimpleArraySet[A]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (A) ⇒ Boolean): SimpleArraySet[A]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[A]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
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: SimpleArraySet[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 SimpleArraySet[A] to CollectionsHaveToParArray[SimpleArraySet[A], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (SimpleArraySet[A]) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[A]
- Definition Classes
- SetLike → SetLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: A]: Set[B]
- Definition Classes
- 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]): SimpleArraySet[SimpleArraySet[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
union(that: GenSet[A]): SimpleArraySet[A]
- Definition Classes
- SetLike → GenSetLike
-
def
unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (SimpleArraySet[A1], SimpleArraySet[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (SimpleArraySet[A1], SimpleArraySet[A2], SimpleArraySet[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(elem: A, included: Boolean): Unit
- Definition Classes
- SetLike
-
def
upsert(elem: A): Boolean
Updates or inserts
elem
.Updates or inserts
elem
.- returns
true
if an insert took place.
- Attributes
- protected[scalax.collection]
- Definition Classes
- SimpleArraySet → ArraySet
-
def
view(from: Int, until: Int): IterableView[A, SimpleArraySet[A]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[A, SimpleArraySet[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, SimpleArraySet[A]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
withSetFilter(p: (A) ⇒ Boolean): FilteredSet[A]
Returns a lazily filtered immutable Set.
Returns a lazily filtered immutable Set.
- Definition Classes
- ExtSetMethods
-
def
zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[SimpleArraySet[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[SimpleArraySet[A], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[SimpleArraySet[A], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
|(that: GenSet[A]): SimpleArraySet[A]
- Definition Classes
- GenSetLike
-
def
→[B](y: B): (SimpleArraySet[A], B)
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[A] to ArrowAssoc[SimpleArraySet[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 SimpleArraySet[A] to any2stringadd[SimpleArraySet[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:(simpleArraySet: any2stringadd[SimpleArraySet[A]]).+(other)
- Definition Classes
- any2stringadd
-
def
filter(p: (A) ⇒ Boolean): TraversableOnce[A]
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[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:(simpleArraySet: 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 SimpleArraySet[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:(simpleArraySet: 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 SimpleArraySet[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:(simpleArraySet: MonadOps[A]).map(f)
- Definition Classes
- MonadOps
-
def
withFilter(p: (A) ⇒ Boolean): Iterator[A]
- Implicit
- This member is added by an implicit conversion from SimpleArraySet[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:(simpleArraySet: MonadOps[A]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.