field.kit.util.datatype.graph
Branch
trait
Branch[T <: Node] extends Iterable[T]
Inherits
- Iterable
- IterableLike
- Equals
- Traversable
- GenericTraversableTemplate
- TraversableLike
- HasNewBuilder
- AnyRef
- Any
Value Members
-
def
++[B >: T, That](that: Iterator[B])(bf: CanBuildFrom[Iterable[T], B, That]): That
-
def
++[B >: T, That](that: Traversable[B])(bf: CanBuildFrom[Iterable[T], B, That]): That
-
def
+=(child: T): T
-
def
-=(child: T): T
-
def
/:[B](z: B)(op: (B, T) ⇒ B): B
-
def
:\[B](z: B)(op: (T, B) ⇒ B): B
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
apply(name: String): T
-
def
canEqual(that: Any): Boolean
-
def
companion: GenericCompanion[Iterable[A][A]]
-
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
elements: Iterator[T]
-
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
find(p: (T) ⇒ Boolean): Option[T]
-
def
first: T
-
def
firstOption: Option[T]
-
def
flatMap[B, That](f: (T) ⇒ Traversable[B])(bf: CanBuildFrom[Iterable[T], B, That]): That
-
def
flatten[B](asTraversable: (T) ⇒ Traversable[B]): Iterable[B]
-
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
genericBuilder[B]: Builder[B, Iterable[B]]
-
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
isEmpty: Boolean
-
def
iterator: Iterator[T]
-
def
last: T
-
def
lastOption: Option[T]
-
def
map[B, That](f: (T) ⇒ B)(bf: CanBuildFrom[Iterable[T], B, That]): That
-
def
max[B >: T](cmp: Ordering[B]): T
-
def
min[B >: T](cmp: Ordering[B]): T
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
def
nonEmpty: Boolean
-
def
partialMap[B, That](pf: PartialFunction[T, B])(bf: CanBuildFrom[Iterable[T], B, That]): That
-
def
partition(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])
-
def
product[B >: T](num: Numeric[B]): B
-
def
projection: IterableView[T, Iterable[T]]
-
def
reduceLeft[B >: T](op: (B, T) ⇒ B): B
-
def
reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
-
def
reduceRight[B >: T](op: (T, B) ⇒ B): B
-
def
reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
-
def
repr: Iterable[T]
-
def
sameElements[B >: T](that: Iterable[B]): Boolean
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterable[T]
-
def
sliding[B >: T](size: Int, step: Int): Iterator[Iterable[T]]
-
def
sliding[B >: T](size: Int): Iterator[Iterable[T]]
-
def
span(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])
-
def
splitAt(n: Int): (Iterable[T], Iterable[T])
-
def
stringPrefix: String
-
def
sum[B >: T](num: Numeric[B]): B
-
def
tail: Iterable[T]
-
def
take(n: Int): Iterable[T]
-
def
takeRight(n: Int): Iterable[T]
-
def
takeWhile(p: (T) ⇒ Boolean): Iterable[T]
-
def
toArray[B >: T](arg0: ClassManifest[B]): Array[B]
-
def
toIndexedSeq[B >: T]: IndexedSeq[B]
-
def
toIterable: Iterable[T]
-
def
toList: List[T]
-
def
toMap[T, U](ev: <:<[T, (T, U)]): Map[T, U]
-
def
toSeq: Seq[T]
-
def
toSet[B >: T]: Set[B]
-
def
toStream: Stream[T]
-
def
toString(): String
-
def
transpose[B](asTraversable: (T) ⇒ Traversable[B]): Iterable[Iterable[B]]
-
def
unzip[A1, A2](asPair: (T) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
view(from: Int, until: Int): IterableView[T, Iterable[T]]
-
def
view: IterableView[T, Iterable[T]]
-
def
withFilter(p: (T) ⇒ Boolean): WithFilter
-
def
zip[A1 >: T, B, That](that: Iterable[B])(bf: CanBuildFrom[Iterable[T], (A1, B), That]): That
-
def
zipAll[B, A1 >: T, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[Iterable[T], (A1, B), That]): That
-
def
zipWithIndex[A1 >: T, That](bf: CanBuildFrom[Iterable[T], (A1, Int), That]): That
A special node that has a number of children
Note the children collection gets lazily initialized when the first child is added