Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  val best: Map[Token, State]
6.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.CloneNotSupportedException]) @native()

7.  var deepestYet: State
8.  var deepestYetSafe: State
9.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

10.  def equals(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef → Any

11.  var explored: Int
12.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.Throwable])

13.  val formatOps: FormatOps
14.  def getBestPath: SearchResult
15.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

16.  def getLeftLeft(curr: State): Token
17.  def hasReachedEof(state: State): Boolean
18.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

19.  def isInsideNoOptZone(token: FormatToken): Boolean
20.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

21.  val memo: Map[(Int, StateHash), State]
22.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

23.  val noOptimizations: Set[Token]
24.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

25.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

26.  var pathologicalEscapes: Int
27.  def provided(formatToken: FormatToken): Split
28.  val routes: Array[Seq[Split]]

    Precomputed table of splits for each token.

29.  def shortestPath(start: State, stop: Token, depth: Int = 0, maxCost: Int = Integer.MAX_VALUE): State

    Runs best first search to find lowest penalty split.

30.  def shortestPathMemo(start: State, stop: Token, depth: Int, maxCost: Int)(implicit line: Line): State
31.  def shouldEnterState(curr: State): Boolean

    Returns true if it's OK to skip over state.

32.  def shouldRecurseOnBlock(curr: State, stop: Token): Boolean
33.  def stateColumnKey(state: State): StateHash
34.  var statementCount: Int
35.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

36.  def toString(): String

    Definition Classes

    AnyRef → Any

37.  def untilNextStatement(state: State, maxDepth: Int): State
38.  val visits: Map[FormatToken, Int]
39.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

40.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

41.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()