ViewTree

abstract val container: A

abstract def productArity: Int

abstract def productElement(n: Int): Any

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

def :\[B](z: B)(op: (Children, 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, Children) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Children, B])(implicit bf: CanBuildFrom[Iterable[Children], B, That]): That

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

def companion: GenericCompanion[Iterable]

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

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

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

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

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

def create[B <: View]: B

def create[B <: View](args: Any*): B

create an anonymous view B without specifying the Context and AttributeSet parameters e.

def drop(n: Int): Iterable[Children]

def dropRight(n: Int): Iterable[Children]

def dropWhile(p: (Children) ⇒ Boolean): Iterable[Children]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

def filter(p: (Children) ⇒ Boolean): Iterable[Children]

def filterNot(p: (Children) ⇒ Boolean): Iterable[Children]

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (Children) ⇒ GenTraversableOnce[B]): Iterable[B]

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

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

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

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

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

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

final def getClass(): Class[_]

def groupBy[K](f: (Children) ⇒ K): Map[K, Iterable[Children]]

def grouped(size: Int): Iterator[Iterable[Children]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Children

def headOption: Option[Children]

def init: Iterable[Children]

def inits: Iterator[Iterable[Children]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Children]

def last: Children

def lastOption: Option[Children]

def map[B, That](f: (Children) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Children], B, That]): That

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

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

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

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

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def nest[B <: ViewGroup](views: View*)(body: Any): B

create an anonymous viewgroup B, allows inserting a level in the view hierarchy without having to explicitly nest ViewTree classes, views will be added to the new B automatically.

def newBuilder: Builder[Children, Iterable[Children]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[Children]

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

def partition(p: (Children) ⇒ Boolean): (Iterable[Children], Iterable[Children])

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

def productIterator: Iterator[Any]

def productPrefix: String

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

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

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

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

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

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

def repr: Iterable[Children]

def reversed: List[Children]

def sameElements[B >: Children](that: GenIterable[B]): Boolean

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

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

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

def seq: Iterable[Children]

def size: Int

def slice(from: Int, until: Int): Iterable[Children]

def sliding(size: Int, step: Int): Iterator[Iterable[Children]]

def sliding(size: Int): Iterator[Iterable[Children]]

def span(p: (Children) ⇒ Boolean): (Iterable[Children], Iterable[Children])

def splitAt(n: Int): (Iterable[Children], Iterable[Children])

def stringPrefix: String

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

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

def tail: Iterable[Children]

def tails: Iterator[Iterable[Children]]

def take(n: Int): Iterable[Children]

def takeRight(n: Int): Iterable[Children]

def takeWhile(p: (Children) ⇒ Boolean): Iterable[Children]

def thisCollection: Iterable[Children]

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

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

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

def toCollection(repr: Iterable[Children]): Iterable[Children]

def toIndexedSeq: IndexedSeq[Children]

def toIterable: Iterable[Children]

def toIterator: Iterator[Children]

def toList: List[Children]

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

def toSeq: Seq[Children]

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

def toStream: Stream[Children]

def toString(): String

def toTraversable: Traversable[Children]

def toVector: Vector[Children]

def transpose[B](implicit asTraversable: (Children) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: (Children) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Children) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[Children, Iterable[Children]]

def view: IterableView[Children, Iterable[Children]]

implicit final def viewGravityLayoutExtensions[Z <: View](v: Z): ViewGravityLayoutExtensions[Z]

implicit final def viewGridLayoutExtensions[Z <: View](v: Z): ViewGridLayoutExtensions[Z]

implicit final def viewLayoutExtensions[Z <: View](v: Z): ViewLayoutExtensions[Z]

implicit final def viewLinearLayoutExtensions[Z <: View](v: Z): ViewLinearLayoutExtensions[Z]

implicit final def viewMarginLayoutExtensions[Z <: View](v: Z): ViewMarginLayoutExtensions[Z]

implicit final def viewRelativeLayoutExtensions[Z <: View](v: Z): ViewRelativeLayoutExtensions[Z]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Children) ⇒ Boolean): FilterMonadic[Children, Iterable[Children]]

def zip[A1 >: Children, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[Children], (A1, B), That]): That

def zipAll[B, A1 >: Children, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[Children], (A1, B), That]): That

def zipWithIndex[A1 >: Children, That](implicit bf: CanBuildFrom[Iterable[Children], (A1, Int), That]): That

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