object ArraySet extends IterableFactory[ArraySet]
Linear Supertypes
Content Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- ArraySet
- IterableFactory
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
-    case class CheckedHints extends Hints with Product with Serializable- Annotations
- @SerialVersionUID()
 
-   sealed  trait Hints extends AnyRefEnables tuning of the internal representation of adjacency lists. Enables tuning of the internal representation of adjacency lists. Basically, an Arrayrepresentation is preferable over a hash table up to a node degree of about 200.
Value Members
-   final  def !=(arg0: Any): Boolean- Definition Classes
- AnyRef → Any
 
-   final  def ##: Int- Definition Classes
- AnyRef → Any
 
-   final  def ==(arg0: Any): Boolean- Definition Classes
- AnyRef → Any
 
-  def apply[A](elem1: A, elem2: A, elems: A*)(implicit hints: Hints): ArraySet[A]
-  def apply[A](elem: A)(implicit hints: Hints): ArraySet[A]
-    def apply[A](elems: A*): ArraySet[A]- Definition Classes
- IterableFactory
 
-   final  def asInstanceOf[T0]: T0- Definition Classes
- Any
 
-    def clone(): AnyRef- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
 
-    def concat[A](xss: Iterable[A]*): ArraySet[A]- Definition Classes
- IterableFactory
 
-    def empty[A](size: Int): ArraySet[A]Returns an empty set with built-in hints constructed from size.
-    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. - Definition Classes
- ArraySet → IterableFactory
 
-    def emptyWithHints[A](implicit hints: Hints): ArraySet[A]Returns an empty set with custom hints that can grow as expected. 
-   final  def eq(arg0: AnyRef): Boolean- Definition Classes
- AnyRef
 
-    def equals(arg0: AnyRef): Boolean- Definition Classes
- AnyRef → Any
 
-    def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: => A): ArraySet[ArraySet[ArraySet[ArraySet[ArraySet[A]]]]]- Definition Classes
- IterableFactory
 
-    def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: => A): ArraySet[ArraySet[ArraySet[ArraySet[A]]]]- Definition Classes
- IterableFactory
 
-    def fill[A](n1: Int, n2: Int, n3: Int)(elem: => A): ArraySet[ArraySet[ArraySet[A]]]- Definition Classes
- IterableFactory
 
-    def fill[A](n1: Int, n2: Int)(elem: => A): ArraySet[ArraySet[A]]- Definition Classes
- IterableFactory
 
-    def fill[A](n: Int)(elem: => A): ArraySet[A]- Definition Classes
- IterableFactory
 
-    def from[A](source: IterableOnce[A]): ArraySet[A]- Definition Classes
- ArraySet → IterableFactory
 
-   final  def getClass(): Class[_ <: AnyRef]- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
 
-    def hashCode(): Int- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
 
-   final  def isInstanceOf[T0]: Boolean- Definition Classes
- Any
 
-   implicit  def iterableFactory[A]: Factory[A, ArraySet[A]]- Definition Classes
- IterableFactory
 
-    def iterate[A](start: A, len: Int)(f: (A) => A): ArraySet[A]- Definition Classes
- IterableFactory
 
-   final  def ne(arg0: AnyRef): Boolean- Definition Classes
- AnyRef
 
-    def newBuilder[A]: GrowableBuilder[A, ArraySet[A]]- Definition Classes
- ArraySet → IterableFactory
 
-   final  def notify(): Unit- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
 
-   final  def notifyAll(): Unit- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
 
-    def range[A](start: A, end: A, step: A)(implicit arg0: Integral[A]): ArraySet[A]- Definition Classes
- IterableFactory
 
-    def range[A](start: A, end: A)(implicit arg0: Integral[A]): ArraySet[A]- Definition Classes
- IterableFactory
 
-   final  def synchronized[T0](arg0: => T0): T0- Definition Classes
- AnyRef
 
-    def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) => A): ArraySet[ArraySet[ArraySet[ArraySet[ArraySet[A]]]]]- Definition Classes
- IterableFactory
 
-    def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) => A): ArraySet[ArraySet[ArraySet[ArraySet[A]]]]- Definition Classes
- IterableFactory
 
-    def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) => A): ArraySet[ArraySet[ArraySet[A]]]- Definition Classes
- IterableFactory
 
-    def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) => A): ArraySet[ArraySet[A]]- Definition Classes
- IterableFactory
 
-    def tabulate[A](n: Int)(f: (Int) => A): ArraySet[A]- Definition Classes
- IterableFactory
 
-    def toString(): String- Definition Classes
- AnyRef → Any
 
-    def unfold[A, S](init: S)(f: (S) => Option[(A, S)]): ArraySet[A]- Definition Classes
- IterableFactory
 
-   final  def wait(arg0: Long, arg1: Int): Unit- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
 
-   final  def wait(arg0: Long): Unit- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
 
-   final  def wait(): Unit- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
 
-  object Hints
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.