Graph Core
2.0.2
API
Generated with
Graph Core/scalax.collection/scalax.collection.mutable/ArraySet

ArraySet

scalax.collection.mutable.ArraySet$
See theArraySet companion trait
object ArraySet extends IterableFactory[ArraySet]

Attributes

Companion
trait
Graph
Supertypes
trait Serializable
class Object
trait Matchable
class Any
Self type
ArraySet.type

Members list

Type members

Classlikes

case class CheckedHints extends Hints

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
trait Hints
class Object
trait Matchable
class Any
Show all
object Hints

Attributes

Companion
trait
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
Self type
Hints.type
sealed trait Hints

Enables tuning of the internal representation of adjacency lists. Basically, an Array representation is preferable over a hash table up to a node degree of about 200.

Enables tuning of the internal representation of adjacency lists. Basically, an Array representation is preferable over a hash table up to a node degree of about 200.

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class CheckedHints
object Default.type
object HashOnly.type

Value members

Concrete methods

def apply[A](elem: A)(implicit hints: Hints): ArraySet[A]
def apply[A](elem1: A, elem2: A, elems: A*)(implicit hints: Hints): ArraySet[A]
override def empty[A]: ArraySet[A]

Returns an empty set with default hints that can grow as expected.

Returns an empty set with default hints that can grow as expected.

Attributes

Definition Classes
def empty[A](size: Int): ArraySet[A]

Returns an empty set with built-in hints constructed from size.

Returns an empty set with built-in hints constructed from size.

Attributes

def emptyWithHints[A](implicit hints: Hints): ArraySet[A]

Returns an empty set with custom hints that can grow as expected.

Returns an empty set with custom hints that can grow as expected.

Attributes

override def from[A](source: IterableOnce[A]): ArraySet[A]

Attributes

Definition Classes
override def newBuilder[A]: GrowableBuilder[A, ArraySet[A]]

Attributes

Definition Classes

Inherited methods

def apply[A](elems: A*): CC[A]

Attributes

Inherited from:
IterableFactory
def concat[A](xss: Iterable[A]*): CC[A]

Attributes

Inherited from:
IterableFactory
def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: => A): CC[CC[CC[CC[CC[A]]]]]

Attributes

Inherited from:
IterableFactory
def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: => A): CC[CC[CC[CC[A]]]]

Attributes

Inherited from:
IterableFactory
def fill[A](n1: Int, n2: Int, n3: Int)(elem: => A): CC[CC[CC[A]]]

Attributes

Inherited from:
IterableFactory
def fill[A](n1: Int, n2: Int)(elem: => A): CC[CC[A]]

Attributes

Inherited from:
IterableFactory
def fill[A](n: Int)(elem: => A): CC[A]

Attributes

Inherited from:
IterableFactory
def iterate[A](start: A, len: Int)(f: A => A): CC[A]

Attributes

Inherited from:
IterableFactory
def range[A : Integral](start: A, end: A, step: A): CC[A]

Attributes

Inherited from:
IterableFactory
def range[A : Integral](start: A, end: A): CC[A]

Attributes

Inherited from:
IterableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) => A): CC[CC[CC[CC[CC[A]]]]]

Attributes

Inherited from:
IterableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) => A): CC[CC[CC[CC[A]]]]

Attributes

Inherited from:
IterableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) => A): CC[CC[CC[A]]]

Attributes

Inherited from:
IterableFactory
def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) => A): CC[CC[A]]

Attributes

Inherited from:
IterableFactory
def tabulate[A](n: Int)(f: Int => A): CC[A]

Attributes

Inherited from:
IterableFactory
def unfold[A, S](init: S)(f: S => Option[(A, S)]): CC[A]

Attributes

Inherited from:
IterableFactory

Implicits

Inherited implicits

implicit def iterableFactory[A]: Factory[A, CC[A]]

Attributes

Inherited from:
IterableFactory
Generated with