Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
-
def
/:[B](z: B)(op: (B, NodeRef[A]) ⇒ B): B
-
def
:\[B](z: B)(op: (NodeRef[A], 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, NodeRef[A]) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
children: Iterable[NodeRef[A]]
-
def
clone(): AnyRef
-
-
-
-
def
copyToArray[B >: NodeRef[A]](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: NodeRef[A]](xs: Array[B]): Unit
-
def
copyToArray[B >: NodeRef[A]](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: NodeRef[A]](dest: Buffer[B]): Unit
-
-
-
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: NodeRef[A]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, NodeRef[A]) ⇒ B): B
-
def
foldRight[B](z: B)(op: (NodeRef[A], B) ⇒ B): B
-
-
def
foreach[U](f: (NodeRef[A]) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
final
def
getClass(): Class[_]
-
-
-
def
hasDefiniteSize: Boolean
-
-
-
val
index: Int
-
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[NodeRef[A]]
-
def
label: A
-
-
-
-
def
max[B >: NodeRef[A]](implicit cmp: Ordering[B]): NodeRef[A]
-
def
maxBy[B](f: (NodeRef[A]) ⇒ B)(implicit cmp: Ordering[B]): NodeRef[A]
-
def
min[B >: NodeRef[A]](implicit cmp: Ordering[B]): NodeRef[A]
-
def
minBy[B](f: (NodeRef[A]) ⇒ B)(implicit cmp: Ordering[B]): NodeRef[A]
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
-
def
product[B >: NodeRef[A]](implicit num: Numeric[B]): B
-
def
reduce[A1 >: NodeRef[A]](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: NodeRef[A]](op: (B, NodeRef[A]) ⇒ B): B
-
def
reduceLeftOption[B >: NodeRef[A]](op: (B, NodeRef[A]) ⇒ B): Option[B]
-
def
reduceOption[A1 >: NodeRef[A]](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: NodeRef[A]](op: (NodeRef[A], B) ⇒ B): B
-
def
reduceRightOption[B >: NodeRef[A]](op: (NodeRef[A], B) ⇒ B): Option[B]
-
-
def
reversed: List[NodeRef[A]]
-
-
def
scan[B >: NodeRef[A], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[NodeRef[A]], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, NodeRef[A]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeRef[A]], B, That]): That
-
def
scanRight[B, That](z: B)(op: (NodeRef[A], B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeRef[A]], B, That]): That
-
-
def
size: Int
-
-
-
-
-
-
def
stringPrefix: String
-
def
sum[B >: NodeRef[A]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
-
def
toArray[B >: NodeRef[A]](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: NodeRef[A]]: Buffer[B]
-
-
-
-
-
def
toList: List[NodeRef[A]]
-
def
toMap[T, U](implicit ev: <:<[NodeRef[A], (T, U)]): Map[T, U]
-
-
def
toSet[B >: NodeRef[A]]: Set[B]
-
def
toStream: Stream[NodeRef[A]]
-
def
toString(): String
-
-
def
toVector: Vector[NodeRef[A]]
-
-
val
tree: Tree[A]
-
def
unzip[A1, A2](implicit asPair: (NodeRef[A]) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (NodeRef[A]) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
-
def
zipAll[B, A1 >: NodeRef[A], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[NodeRef[A]], (A1, B), That]): That
-
Deprecated Value Members
-
def
/:\[A1 >: NodeRef[A]](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from Serializable
A reference to a node in a bonsai
Tree
.