sealed
trait
Hints extends AnyRef
Abstract Value Members
-
abstract
def
capacityIncrement: Int
-
abstract
def
compactUpToUsed: Int
-
abstract
def
hashTableThreshold: Int
-
abstract
def
initialCapacity: Int
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
nextCapacity(currentCapacity: Int): Int
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
propagate(fromSize: Int): Hints
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
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.