object ArraySet extends MutableSetFactory[ArraySet]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ArraySet
- MutableSetFactory
- SetFactory
- GenericSeqCompanion
- GenSetFactory
- GenericCompanion
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
case class
CheckedHints extends Hints with Product with Serializable
- Annotations
- @SerialVersionUID()
-
type
Coll = ArraySet[_]
- Attributes
- protected[this]
- Definition Classes
- GenericCompanion
-
sealed
trait
Hints extends AnyRef
Enables tuning of the internal representation of adjacency lists.
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.
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
- GenericCompanion
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, ArraySet[A]]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
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 → GenericCompanion
-
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: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder[A]: Builder[A, ArraySet[A]]
- Definition Classes
- MutableSetFactory → GenSetFactory → GenericCompanion
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
setCanBuildFrom[A]: CanBuildFrom[ArraySet[_], A, ArraySet[A]]
- Definition Classes
- GenSetFactory
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
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
- @native() @throws( ... )
- object Hints
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
.