BestFirstSearch

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 cleanup(token: Token): String

   

   Definition Classes

   ScalaFmtLogger

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. var deepestYet: State

   

9. val dequeOnNewStatements: Boolean

   

   When entering a new statement, clear out search queue.

10. val disableOptimizationsInsideSensitiveAreas: Boolean

    

    Do not optimize inside certain areas such as term apply.

11. val doOptimizations: Boolean

    

12. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

14. def escape(raw: String): String

    

    Definition Classes

    ScalaFmtLogger

15. var explored: Int

    

16. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

17. def formatTree(): String

    

18. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

19. def getLeftLeft(curr: State): Token

    

20. def hasReachedEof(state: State): Boolean

    

21. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

22. def header[T](t: T): String

    

    Definition Classes

    ScalaFmtLogger

23. def isInsideNoOptZone(token: FormatToken): Boolean

    

24. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

25. def log(t: Tree, tokensOnly: Boolean = false): String

    

    Definition Classes

    ScalaFmtLogger

26. def log(token: Token): String

    

    Definition Classes

    ScalaFmtLogger

27. def log(tokens: Tokens): String

    

    Definition Classes

    ScalaFmtLogger

28. def log(tokens: Token*): String

    

    Definition Classes

    ScalaFmtLogger

29. def log(formatToken: FormatToken): String

    

    Definition Classes

    ScalaFmtLogger

30. def log(split: Split): String

    

    Definition Classes

    ScalaFmtLogger

31. val logger: PrintlnLogger.type

    

    Definition Classes

    ScalaFmtLogger

32. val matchingParentheses: Map[TokenHash, Token]

    

33. val maxQueueSize: Int

    

    Dequeue on new statements if queue exceeds this size,

    Dequeue on new statements if queue exceeds this size,

    Overrides dequeOnNewStatements, appears necessary in cases like JavaLangObject.scala in Scala.js.

    TODO(olafur) come up with less hacky solution.

34. val maxVisitStates: Int

    

35. val memo: Map[(Int, StateHash), State]

    

36. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

37. def noOptimizationZones(tree: Tree): Set[Token]

    

38. val noOptimizations: Set[Token]

    

39. final def notify(): Unit

    

    Definition Classes

    AnyRef

40. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

41. val owners: Map[TokenHash, Tree]

    

42. def provided(formatToken: FormatToken): Split

    

43. val pruneNonOptimal: Boolean

    

    Eliminate solutions that are inferior to already explored solutions.

    Eliminate solutions that are inferior to already explored solutions.

    If a solution is reaches a point at cost X then any other solution that reaches the same token with a cost > X will be eliminated.

    TODO(olafur) benchmark this optimization, I think it doesn't give much.

44. val recurseOnBlocks: Boolean

    

    Recursively format { ...

    Recursively format { ... } blocks inside no optimization zones.

    By starting a new search queue, we can perform aggressive optimizations inside optimizations zones.

45. def reveal(s: String): String

    

    Definition Classes

    ScalaFmtLogger

46. val router: Router

    

47. def shortestPath(start: State, stop: Token, depth: Int = 0, maxCost: Int = Integer.MAX_VALUE)(implicit line: Line): State

    

    Runs best first search to find lowest penalty split.

48. def shortestPathMemo(start: State, stop: Token, depth: Int)(implicit line: Line): State

    

49. def shouldEnterState(curr: State): Boolean

    

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

50. def shouldRecurseOnBlock(curr: State, stop: Token): Boolean

    

51. def stateColumnKey(state: State): Int

    

52. var statementCount: Int

    

53. val statementStarts: Map[TokenHash, Tree]

    

54. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

55. def toString(): String

    

    Definition Classes

    AnyRef → Any

56. val toks: Array[FormatToken]

    

57. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

59. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )