sealed trait Hints extends AnyRef
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.
- Alphabetic
- By Inheritance
- Hints
- AnyRef
- Any
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def capacityIncrement: Int
The size of free space to add to the
initialCapacitywhenever the size of thisSetbecomes greater than theinitialCapacity.The size of free space to add to the
initialCapacitywhenever the size of thisSetbecomes greater than theinitialCapacity. It should be chosen such that incrementing need not take place too often. - abstract def compactUpToUsed: Int
Compact the underlying
Arrayonly if it has at most used space of this percentage.Compact the underlying
Arrayonly if it has at most used space of this percentage. Compression takes place only user-triggered by a call tocompact. The higher this value the more oftencompactleads to a compression.0means never,100means always compact. - abstract def 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. - abstract def initialCapacity: Int
The initial length of the internal
Arrayrepresentation.The initial length of the internal
Arrayrepresentation. It should be chosen such that it's greater than the finalsizein a significant percentage of cases. The less heap space is a concern, the higherinitialCapacitymay be set.
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Hints, B)
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- 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 ensuring(cond: (Hints) => Boolean, msg: => Any): Hints
- def ensuring(cond: (Hints) => Boolean): Hints
- def ensuring(cond: Boolean, msg: => Any): Hints
- def ensuring(cond: Boolean): Hints
- 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()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- 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.
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def pipe[B](f: (Hints) => B): B
- Implicit
- This member is added by an implicit conversion from Hints toChainingOps[Hints] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def propagate(fromSize: Int): Hints
- val self: Hints
- Implicit
- This member is added by an implicit conversion from Hints toChainingOps[Hints] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tap[U](f: (Hints) => U): Hints
- Implicit
- This member is added by an implicit conversion from Hints toChainingOps[Hints] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from Hints toStringFormat[Hints] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (Hints, B)
- Implicit
- This member is added by an implicit conversion from Hints toArrowAssoc[Hints] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.