case object HashOnly extends Hints with Product with Serializable
A special hint telling that the internal representation should always be
hash-based as opposite to Array. This is meaningful if the average size of the
ArraySet is above the limit an Array representation is more efficient.
- Alphabetic
- By Inheritance
- HashOnly
- Serializable
- Product
- Equals
- Hints
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val capacityIncrement: Int
The size of free space to add to the
initialCapacitywhenever the size of thisSetbecomes greater than theinitialCapacity. - def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- val compactUpToUsed: Int
Compact the underlying
Arrayonly if it has at most used space of this percentage. - final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val hashTableThreshold: Int
The internal representation of the adjacency list switches to a hash table when the number of edges at a given node exceeds this value.
The internal representation of the adjacency list switches to a hash table when the number of edges at a given node exceeds this value. If both
initialCapacityandcapacityIncrementand this value are set to0a solely hash table representation will be used irrespective of the setsize. This value should be close to thesizelimit anArrayrepresentation is more efficient on the JVM with regard to looking up a given element based on==as opposite tohashCode. Varying with JVM implementations/configurations this limit may come in somewhere between 10 and 30. - val initialCapacity: Int
The initial length of the internal
Arrayrepresentation. - final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def nextCapacity(currentCapacity: Int): Int
Returns a positive number > currentCapacity for an array or 0 for a hash table.
Returns a positive number > currentCapacity for an array or 0 for a hash table.
- Definition Classes
- Hints
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def productElementName(n: Int): String
- Definition Classes
- Product
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def propagate(fromSize: Int): Hints
- Definition Classes
- Hints
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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])
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.