Node

Type Members

type Self = Iterable[T]

Attributes
protected[this]
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

Definition Classes
TraversableLike

Abstract Value Members

abstract def children: Iterable[T]
abstract def value: V

Definition Classes
Tree

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def +(other: String): String

Implicit information
This member is added by an implicit conversion from Node[T, V] to any2stringadd[Node[T, V]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike
def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike
def ->[B](y: B): (Node[T, V], B)

Implicit information
This member is added by an implicit conversion from Node[T, V] to ArrowAssoc[Node[T, V]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
def /:[B](z: B)(op: (B, T) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def :\[B](z: B)(op: (T, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addString(b: StringBuilder): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

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

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def apply(path: Path[V]): Tree[V]

returns
the tree

Definition Classes
Tree
Exceptions thrown
final def asInstanceOf[T0]: T0

Definition Classes
Any
def canEqual(that: Any): Boolean

Definition Classes
IterableLike → Equals
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

Definition Classes
TraversableOnce
def companion: GenericCompanion[Iterable]

Definition Classes
Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray[B >: T](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: T](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: T](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def count(p: (T) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
def drop(n: Int): Iterable[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def dropRight(n: Int): Iterable[T]

Definition Classes
IterableLike
def dropWhile(p: (T) ⇒ Boolean): Iterable[T]

Definition Classes
TraversableLike → GenTraversableLike
def ensuring(cond: (Node[T, V]) ⇒ Boolean, msg: ⇒ Any): Node[T, V]

Implicit information
This member is added by an implicit conversion from Node[T, V] to Ensuring[Node[T, V]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (Node[T, V]) ⇒ Boolean): Node[T, V]

Implicit information
This member is added by an implicit conversion from Node[T, V] to Ensuring[Node[T, V]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): Node[T, V]

Implicit information
This member is added by an implicit conversion from Node[T, V] to Ensuring[Node[T, V]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): Node[T, V]

Implicit information
This member is added by an implicit conversion from Node[T, V] to Ensuring[Node[T, V]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def exists(p: (T) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def filter(p: (T) ⇒ Boolean): Iterable[T]

Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (T) ⇒ Boolean): Iterable[T]

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(p: (T) ⇒ Boolean): Option[T]

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[B]

Definition Classes
GenericTraversableTemplate
def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (T, B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def forall(p: (T) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def foreach[U](f: (T) ⇒ U): Unit

Definition Classes
IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
def formatted(fmtstr: String): String

Implicit information
This member is added by an implicit conversion from Node[T, V] to StringFormat[Node[T, V]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
def genericBuilder[B]: Builder[B, Iterable[B]]

Definition Classes
GenericTraversableTemplate
def get(path: Path[V]): Option[Tree[V]]

Look up the value given by a Path
Look up the value given by a Path

Definition Classes
Tree
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def groupBy[K](f: (T) ⇒ K): Map[K, Iterable[T]]

Definition Classes
TraversableLike → GenTraversableLike
def grouped(size: Int): Iterator[Iterable[T]]

Definition Classes
IterableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def hashCode(): Int

Definition Classes
AnyRef → Any
def head: T

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def headOption: Option[T]

Definition Classes
TraversableLike → GenTraversableLike
def init: Iterable[T]

Definition Classes
TraversableLike → GenTraversableLike
def inits: Iterator[Iterable[T]]

Definition Classes
TraversableLike
def isEmpty: Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
def iterator: Iterator[T]

Definition Classes
Node → IterableLike → GenIterableLike
def last: T

Definition Classes
TraversableLike → GenTraversableLike
def lastOption: Option[T]

Definition Classes
TraversableLike → GenTraversableLike
def leaves: Iterable[Leaf[T, V]]
def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def max[B >: T](implicit cmp: Ordering[B]): T

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

Definition Classes
TraversableOnce → GenTraversableOnce
def min[B >: T](implicit cmp: Ordering[B]): T

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newBuilder: Builder[T, Iterable[T]]

Attributes
protected[this]
Definition Classes
GenericTraversableTemplate → HasNewBuilder
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def par: ParIterable[T]

Definition Classes
Parallelizable
def parCombiner: Combiner[T, ParIterable[T]]

Attributes
protected[this]
Definition Classes
TraversableLike → Parallelizable
def partition(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])

Definition Classes
TraversableLike → GenTraversableLike
def product[B >: T](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: T](op: (B, T) ⇒ B): B

Definition Classes
TraversableOnce
def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: T](op: (T, B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def repr: Iterable[T]

Definition Classes
TraversableLike → GenTraversableLike
def reversed: List[T]

Attributes
protected[this]
Definition Classes
TraversableOnce
def sameElements[B >: T](that: GenIterable[B]): Boolean

Definition Classes
IterableLike → GenIterableLike
def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
def seq: Iterable[T]

Definition Classes
Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def size: Int

Definition Classes
TraversableOnce → GenTraversableOnce
def slice(from: Int, until: Int): Iterable[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def sliding(size: Int, step: Int): Iterator[Iterable[T]]

Definition Classes
IterableLike
def sliding(size: Int): Iterator[Iterable[T]]

Definition Classes
IterableLike
def span(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (Iterable[T], Iterable[T])

Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String

Definition Classes
TraversableLike → GenTraversableLike
def sum[B >: T](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: Iterable[T]

Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[Iterable[T]]

Definition Classes
TraversableLike
def take(n: Int): Iterable[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def takeRight(n: Int): Iterable[T]

Definition Classes
IterableLike
def takeWhile(p: (T) ⇒ Boolean): Iterable[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def thisCollection: Iterable[T]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: T]: Buffer[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toCollection(repr: Iterable[T]): Iterable[T]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toIndexedSeq: IndexedSeq[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[T]

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def toIterator: Iterator[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toList: List[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toParArray: ParArray[T]

Implicit information
This member is added by an implicit conversion from Node[T, V] to CollectionsHaveToParArray[Node[T, V], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (Node[T, V]) ⇒ GenTraversableOnce[T] is in scope.
Definition Classes
CollectionsHaveToParArray
def toSeq: Seq[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: T]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[T]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def toString(): String

Definition Classes
Node → TraversableLike → AnyRef → Any
def toTraversable: Traversable[T]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toVector: Vector[T]

Definition Classes
TraversableOnce → GenTraversableOnce
def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

Definition Classes
GenericTraversableTemplate
def view(from: Int, until: Int): IterableView[T, Iterable[T]]

Definition Classes
IterableLike → TraversableLike
def view: IterableView[T, Iterable[T]]

Definition Classes
IterableLike → TraversableLike
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( ... )
def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Iterable[T]]

Definition Classes
TraversableLike → FilterMonadic
def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[T], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[T], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[Iterable[T], (A1, Int), That]): That

Definition Classes
IterableLike → GenIterableLike
def →[B](y: B): (Node[T, V], B)

Implicit information
This member is added by an implicit conversion from Node[T, V] to ArrowAssoc[Node[T, V]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Shadowed Implicit Value Members

def filter(p: (T) ⇒ Boolean): TraversableOnce[T]
Implicit information
This member is added by an implicit conversion from Node[T, V] to MonadOps[T] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(node: MonadOps[T]).filter(p)
Definition Classes
MonadOps
def flatMap[B](f: (T) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
Implicit information
This member is added by an implicit conversion from Node[T, V] to MonadOps[T] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(node: MonadOps[T]).flatMap(f)
Definition Classes
MonadOps
def map[B](f: (T) ⇒ B): TraversableOnce[B]
Implicit information
This member is added by an implicit conversion from Node[T, V] to MonadOps[T] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(node: MonadOps[T]).map(f)
Definition Classes
MonadOps
def withFilter(p: (T) ⇒ Boolean): Iterator[T]
Implicit information
This member is added by an implicit conversion from Node[T, V] to MonadOps[T] performed by method MonadOps in scala.collection.TraversableOnce.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(node: MonadOps[T]).withFilter(p)
Definition Classes
MonadOps

Inherited from Iterable[T]

Inherited from IterableLike[T, Iterable[T]]

Inherited from Equals

Inherited from GenIterable[T]

Inherited from GenIterableLike[T, Iterable[T]]

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, Iterable]

Inherited from TraversableLike[T, Iterable[T]]

Inherited from GenTraversableLike[T, Iterable[T]]

Inherited from Parallelizable[T, ParIterable[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, Iterable[T]]

Inherited from HasNewBuilder[T, Iterable[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from Tree[V]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion CollectionsHaveToParArray from Node[T, V] to CollectionsHaveToParArray[Node[T, V], T]

Inherited by implicit conversion MonadOps from Node[T, V] to MonadOps[T]

Inherited by implicit conversion any2stringadd from Node[T, V] to any2stringadd[Node[T, V]]

Inherited by implicit conversion StringFormat from Node[T, V] to StringFormat[Node[T, V]]

Inherited by implicit conversion Ensuring from Node[T, V] to Ensuring[Node[T, V]]

Inherited by implicit conversion ArrowAssoc from Node[T, V] to ArrowAssoc[Node[T, V]]

Inherited by implicit conversion alternateImplicit from Node[T, V] to ForceImplicitAmbiguity

Ungrouped

Related Docs: object Node | package util

trait Node[+T <: Tree[V], V] extends Tree[V] with Iterable[T]

Type Members

type Self = Iterable[T]

class WithFilter extends FilterMonadic[A, Repr]

Abstract Value Members

abstract def children: Iterable[T]

abstract def value: V

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

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

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

def ->[B](y: B): (Node[T, V], B)

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

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

def apply(path: Path[V]): Tree[V]

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

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

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

def companion: GenericCompanion[Iterable]

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

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

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

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

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

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

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

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

def ensuring(cond: (Node[T, V]) ⇒ Boolean, msg: ⇒ Any): Node[T, V]

def ensuring(cond: (Node[T, V]) ⇒ Boolean): Node[T, V]

def ensuring(cond: Boolean, msg: ⇒ Any): Node[T, V]

def ensuring(cond: Boolean): Node[T, V]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

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

def finalize(): Unit

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

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

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

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

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

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

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

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

def formatted(fmtstr: String): String

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

def get(path: Path[V]): Option[Tree[V]]

final def getClass(): Class[_]

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def init: Iterable[T]

def inits: Iterator[Iterable[T]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[T]

def last: T

def lastOption: Option[T]

def leaves: Iterable[Leaf[T, V]]

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

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

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

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