ChildEngine

abstract def arity: Int

How many parameters the engine takes.

abstract def children: ReportableList

abstract def decisionTreeNodes: Int

abstract def description: Option[String]

An optional description

abstract def evaluateBecauseForDecision(decision: Decision, params: List[Any]): Boolean

abstract def evaluateConclusion(params: List[Any], conclusion: Conclusion): R

abstract def evaluateConclusionNoException(params: List[Any], conclusion: Conclusion): ROrException[R]

abstract def findConclusionFor(params: List[Any]): Conclusion

abstract def priority: Option[Int]

The 'priority' that is used to determine the order that the decision trees are being built

abstract def references: Set[Reference]

abstract def root: Either[Conclusion, Decision]

abstract def textOrder: Int

abstract def title: Option[String]

this will appear on reports as a title for that requirement

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: Reportable, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Reportable], B, That]): That

def ++:[B >: Reportable, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Reportable], B, That]): That

def ++:[B >: Reportable, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Reportable], B, That]): That

def /:[B](z: B)(op: (B, Reportable) ⇒ B): B

def :\[B](z: B)(op: (Reportable, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, Reportable) ⇒ B, combop: (B, B) ⇒ B): B

def all[R <: Reportable](rClass: Class[R]): List[R]

All the descendants that implement the class.

def allReversed[R <: Reportable](rClass: Class[R]): List[R]

def applyParams(params: List[Any]): R

This is used when you don't know at compile time the types and arity of the parameters.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Reportable, B])(implicit bf: CanBuildFrom[Traversable[Reportable], B, That]): That

def collectFirst[B](pf: PartialFunction[Reportable, B]): Option[B]

def companion: GenericCompanion[Traversable]

def copyToArray[B >: Reportable](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Reportable](xs: Array[B]): Unit

def copyToArray[B >: Reportable](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Reportable](dest: Buffer[B]): Unit

def count(p: (Reportable) ⇒ Boolean): Int

def drop(n: Int): Traversable[Reportable]

def dropWhile(p: (Reportable) ⇒ Boolean): Traversable[Reportable]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (Reportable) ⇒ Boolean): Boolean

def filter(p: (Reportable) ⇒ Boolean): Traversable[Reportable]

def filterNot(p: (Reportable) ⇒ Boolean): Traversable[Reportable]

def finalize(): Unit

def find(p: (Reportable) ⇒ Boolean): Option[Reportable]

def flatMap[B, That](f: (Reportable) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Reportable], B, That]): That

def flatten[B](implicit asTraversable: (Reportable) ⇒ GenTraversableOnce[B]): Traversable[B]

def fold[Acc](initialValue: Acc, root: Either[Conclusion, Decision], folder: DecisionTreeFolder[Acc]): Acc

def fold[Acc](initialValue: Acc, folder: DecisionTreeFolder[Acc]): Acc

def fold[A1 >: Reportable](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, Reportable) ⇒ B): B

def foldRight[B](z: B)(op: (Reportable, B) ⇒ B): B

def foldWithPath[Acc](initial: Acc, fn: (Acc, ReportableList) ⇒ Acc): Acc

folds across 'this' and all it's descendents.

def foldWithPathReversingChildren[Acc](initial: Acc, fn: (Acc, ReportableList) ⇒ Acc): Acc

folds across 'this' and all it's descendents.

def forall(p: (Reportable) ⇒ Boolean): Boolean

def foreach[U](f: (Reportable) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Traversable[B]]

final def getClass(): Class[_]

def groupBy[K](f: (Reportable) ⇒ K): Map[K, Traversable[Reportable]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Reportable

def headOption: Option[Reportable]

def init: Traversable[Reportable]

def inits: Iterator[Traversable[Reportable]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def last: Reportable

def lastOption: Option[Reportable]

def map[B, That](f: (Reportable) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Reportable], B, That]): That

def max[B >: Reportable](implicit cmp: Ordering[B]): Reportable

def maxBy[B](f: (Reportable) ⇒ B)(implicit cmp: Ordering[B]): Reportable

def min[B >: Reportable](implicit cmp: Ordering[B]): Reportable

def minBy[B](f: (Reportable) ⇒ B)(implicit cmp: Ordering[B]): Reportable

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[Reportable, Traversable[Reportable]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[Reportable]

def parCombiner: Combiner[Reportable, ParIterable[Reportable]]

def partition(p: (Reportable) ⇒ Boolean): (Traversable[Reportable], Traversable[Reportable])

def product[B >: Reportable](implicit num: Numeric[B]): B

def reduce[A1 >: Reportable](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: Reportable](op: (B, Reportable) ⇒ B): B

def reduceLeftOption[B >: Reportable](op: (B, Reportable) ⇒ B): Option[B]

def reduceOption[A1 >: Reportable](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: Reportable](op: (Reportable, B) ⇒ B): B

def reduceRightOption[B >: Reportable](op: (Reportable, B) ⇒ B): Option[B]

def repr: Traversable[Reportable]

def reversed: List[Reportable]

def safeApplyParams(params: List[Any]): ROrException[_ <: R]

def scan[B >: Reportable, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Reportable], B, That]): That

def scanLeft[B, That](z: B)(op: (B, Reportable) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Reportable], B, That]): That

def scanRight[B, That](z: B)(op: (Reportable, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Reportable], B, That]): That

def seq: Traversable[Reportable]

def size: Int

def slice(from: Int, until: Int): Traversable[Reportable]

def span(p: (Reportable) ⇒ Boolean): (Traversable[Reportable], Traversable[Reportable])

def splitAt(n: Int): (Traversable[Reportable], Traversable[Reportable])

def stringPrefix: String

def sum[B >: Reportable](implicit num: Numeric[B]): B

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

def tail: Traversable[Reportable]

def tails: Iterator[Traversable[Reportable]]

def take(n: Int): Traversable[Reportable]

def takeWhile(p: (Reportable) ⇒ Boolean): Traversable[Reportable]

def templateName: String

lazy val tests: List[Test]

def thisCollection: Traversable[Reportable]

def titleOrDescription(default: String): String

the title or if undefined the description or if undefined the default

def titleString: String

the title or an empty string

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Reportable, Col[Reportable]]): Col[Reportable]

def toArray[B >: Reportable](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: Reportable]: Buffer[B]

def toCollection(repr: Traversable[Reportable]): Traversable[Reportable]

def toIndexedSeq: IndexedSeq[Reportable]

def toIterable: Iterable[Reportable]

def toIterator: Iterator[Reportable]

def toList: List[Reportable]

def toMap[T, U](implicit ev: <:<[Reportable, (T, U)]): Map[T, U]

def toSeq: Seq[Reportable]

def toSet[B >: Reportable]: Set[B]

def toStream: Stream[Reportable]

def toString(): String

def toString(indent: String, root: Either[Conclusion, Decision]): String

def toStringWith(printer: IfThenPrinter): String

def toStringWith(path: List[Reportable], root: Either[Conclusion, Decision], printer: IfThenPrinter): String

def toStringWithScenarios(root: Either[Conclusion, Decision]): String

def toStringWithScenarios(): String

def toTraversable: Traversable[Reportable]

def toVector: Vector[Reportable]

def transpose[B](implicit asTraversable: (Reportable) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

def unzip[A1, A2](implicit asPair: (Reportable) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Reportable) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

def view(from: Int, until: Int): TraversableView[Reportable, Traversable[Reportable]]

def view: TraversableView[Reportable, Traversable[Reportable]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def walkDecisionsAndConclusion(root: Either[Conclusion, Decision], fn: (ConclusionOrDecision) ⇒ Unit): Unit

def walkDecisionsAndConclusion(fn: (ConclusionOrDecision) ⇒ Unit): Unit

def walkWithPath(path: ReportableList, visitor: (ReportableList) ⇒ Unit): Unit

def walkWithPath(visitor: (ReportableList) ⇒ Unit): Unit

Calls this visitor with 'this' and all it's descendents.

def withFilter(p: (Reportable) ⇒ Boolean): FilterMonadic[Reportable, Traversable[Reportable]]

def /:\[A1 >: Reportable](z: A1)(op: (A1, A1) ⇒ A1): A1