PoseNode

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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, SceneTree) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

val children: IndexedSeq[SceneTree]

def clone(): AnyRef

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

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

def companion: GenericCompanion[Traversable]

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

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

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

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

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

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

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

final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

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

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

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

recursive tree walker for Traversable

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

final def getClass(): Class[_]

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

def hasDefiniteSize: Boolean

def head: SceneTree

def headOption: Option[SceneTree]

def init: Traversable[SceneTree]

def inits: Iterator[Traversable[SceneTree]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def last: SceneTree

def lastOption: Option[SceneTree]

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

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

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

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

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

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[SceneTree, Traversable[SceneTree]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[SceneTree]

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

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

val pose: Pose

def posedObjects: IndexedSeq[(Transform3D, RenderObject)]

flatten the tree (recursive), collect all render objects with their model-to-world transformation

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

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

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

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

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

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

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

def repr: Traversable[SceneTree]

def reversed: List[SceneTree]

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

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

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

def seq: Traversable[SceneTree]

def size: Int

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

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

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

def stringPrefix: String

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

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

def tail: Traversable[SceneTree]

def tails: Iterator[Traversable[SceneTree]]

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

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

def thisCollection: Traversable[SceneTree]

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

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

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

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

def toIndexedSeq: IndexedSeq[SceneTree]

def toIterable: Iterable[SceneTree]

def toIterator: Iterator[SceneTree]

def toList: List[SceneTree]

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

def toSeq: Seq[SceneTree]

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

def toStream: Stream[SceneTree]

def toString(): String

def toTraversable: Traversable[SceneTree]

def toVector: Vector[SceneTree]

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

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

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

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

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

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

final def wait(arg0: Long): Unit

final def wait(): Unit

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

def worldMeshes: IndexedSeq[ColorNormalMesh3D]

get all properly transformed meshes in the scene

def finalize(): Unit