Levels

This class computes the 'level' of a given fragment. It is used to indent Fragments in a ConsoleReporter and to create a tree or Descriptions in the JUnit runner

It does so by considering that some fragments have an effect on the indentation of the next fragment

- a Text fragment is an Indent(1) so it indents the next fragment once - a Tab(n) fragment is an Indent(n) so it indents the next fragment n times - a Backtab(n) fragment is an Unindent(n) so it un-indents the next fragment n times - an Example fragment is a Terminal(), it doesn't do anything. This means that 2 consecutive examples will stay at the same level - an End fragment is a Reset, it set the level of the next fragment to 0 level

Linear Supertypes

Serializable, Serializable, Product, Equals, AnyRef, Any

Instance Constructors

new Levels(levelsSeq: Vector[Level[T]] = Vector[Level[T]]())

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
def add(other: Levels[T]): Levels[T]

returns
the concatenation of 2 levels
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(a: Any): Boolean

Definition Classes
Levels → Equals → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
lazy val isEmpty: Boolean

returns
true if there are no levels
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
lazy val level: Int

returns
alias for the last level
lazy val levels: Seq[Level[T]]

returns
all the levels, computed with the LevelMonoid
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toTree[S](m: (T, Int) ⇒ Option[S]): Tree[S]

map each node to another type given: the current type, the node number
map each node to another type given: the current type, the node number
returns
a Tree[S] based on the level of each block, mapping each node to value of type S and possibly skipping nodes
def toTree[S](m: (T, Seq[S], Int) ⇒ Option[S]): Tree[S]

map each node to another type given: the current type, the path from root (without the current node), the node number
map each node to another type given: the current type, the path from root (without the current node), the node number
returns
a Tree[S] based on the level of each block, mapping each node to value of type S and possibly skipping nodes
lazy val toTree: Tree[T]

returns
a Tree[T] based on the level of each block
def toTreeLoc[S](m: (T, Seq[S], Int) ⇒ Option[S]): TreeLoc[S]

WARNING this method assumes that the Levels are not empty!!
WARNING this method assumes that the Levels are not empty!!
returns
a Tree[S] based on the level of each block, mapping each node to value of type S and possibly skipping nodes, passing the numeric label of the current node.

See also
JUnitDescriptions
lazy val toTreeLoc: TreeLoc[T]

returns
a TreeLoc[T] based on the level of each block
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package reporter

case class Levels[T](levelsSeq: Vector[Level[T]] = Vector[Level[T]]()) extends Product with Serializable

Instance Constructors

new Levels(levelsSeq: Vector[Level[T]] = Vector[Level[T]]())

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def add(other: Levels[T]): Levels[T]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(a: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

lazy val isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

lazy val level: Int

lazy val levels: Seq[Level[T]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toTree[S](m: (T, Int) ⇒ Option[S]): Tree[S]

def toTree[S](m: (T, Seq[S], Int) ⇒ Option[S]): Tree[S]

lazy val toTree: Tree[T]

def toTreeLoc[S](m: (T, Seq[S], Int) ⇒ Option[S]): TreeLoc[S]

lazy val toTreeLoc: TreeLoc[T]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped