field.kit.util.datatype.graph

Branch

trait Branch[T <: Node] extends Iterable[T]

A special node that has a number of children

Note the children collection gets lazily initialized when the first child is added

known subclasses: Group

Inherits

  1. Iterable
  2. IterableLike
  3. Equals
  4. Traversable
  5. GenericTraversableTemplate
  6. TraversableLike
  7. HasNewBuilder
  8. AnyRef
  9. Any

Value Members

  1. def ++[B >: T, That](that: Iterator[B])(bf: CanBuildFrom[Iterable[T], B, That]): That

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

  3. def +=(child: T): T

  4. def -=(child: T): T

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

  6. def :\[B](z: B)(op: (T, B) ⇒ B): B

  7. def addString(b: StringBuilder): StringBuilder

  8. def addString(b: StringBuilder, sep: String): StringBuilder

  9. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

  10. def apply(name: String): T

  11. def canEqual(that: Any): Boolean

  12. def companion: GenericCompanion[Iterable[A][A]]

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

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

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

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

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

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

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

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

  21. def elements: Iterator[T]

  22. def equals(arg0: Any): Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an equivalence relation:

    • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
    • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
    • It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same Int (o1.hashCode.equals(o2.hashCode)).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    definition classes: AnyRef ⇐ Any
  23. def exists(p: (T) ⇒ Boolean): Boolean

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

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

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

  27. def first: T

  28. def firstOption: Option[T]

  29. def flatMap[B, That](f: (T) ⇒ Traversable[B])(bf: CanBuildFrom[Iterable[T], B, That]): That

  30. def flatten[B](asTraversable: (T) ⇒ Traversable[B]): Iterable[B]

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

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

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

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

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

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

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

  38. def hasDefiniteSize: Boolean

  39. def hashCode(): Int

    Returns a hash code value for the object

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    definition classes: AnyRef ⇐ Any
  40. def head: T

  41. def headOption: Option[T]

  42. def init: Iterable[T]

  43. def isEmpty: Boolean

  44. def iterator: Iterator[T]

  45. def last: T

  46. def lastOption: Option[T]

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

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

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

  50. def mkString: String

  51. def mkString(sep: String): String

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

  53. def nonEmpty: Boolean

  54. def partialMap[B, That](pf: PartialFunction[T, B])(bf: CanBuildFrom[Iterable[T], B, That]): That

  55. def partition(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])

  56. def product[B >: T](num: Numeric[B]): B

  57. def projection: IterableView[T, Iterable[T]]

  58. def reduceLeft[B >: T](op: (B, T) ⇒ B): B

  59. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

  60. def reduceRight[B >: T](op: (T, B) ⇒ B): B

  61. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

  62. def repr: Iterable[T]

  63. def sameElements[B >: T](that: Iterable[B]): Boolean

  64. def size: Int

  65. def slice(from: Int, until: Int): Iterable[T]

  66. def sliding[B >: T](size: Int, step: Int): Iterator[Iterable[T]]

  67. def sliding[B >: T](size: Int): Iterator[Iterable[T]]

  68. def span(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])

  69. def splitAt(n: Int): (Iterable[T], Iterable[T])

  70. def stringPrefix: String

  71. def sum[B >: T](num: Numeric[B]): B

  72. def tail: Iterable[T]

  73. def take(n: Int): Iterable[T]

  74. def takeRight(n: Int): Iterable[T]

  75. def takeWhile(p: (T) ⇒ Boolean): Iterable[T]

  76. def toArray[B >: T](arg0: ClassManifest[B]): Array[B]

  77. def toIndexedSeq[B >: T]: IndexedSeq[B]

  78. def toIterable: Iterable[T]

  79. def toList: List[T]

  80. def toMap[T, U](ev: <:<[T, (T, U)]): Map[T, U]

  81. def toSeq: Seq[T]

  82. def toSet[B >: T]: Set[B]

  83. def toStream: Stream[T]

  84. def toString(): String

    Returns a string representation of the object

    Returns a string representation of the object.

    The default representation is platform dependent.

    definition classes: TraversableLike ⇐ AnyRef ⇐ Any
  85. def transpose[B](asTraversable: (T) ⇒ Traversable[B]): Iterable[Iterable[B]]

  86. def unzip[A1, A2](asPair: (T) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

  87. def view(from: Int, until: Int): IterableView[T, Iterable[T]]

  88. def view: IterableView[T, Iterable[T]]

  89. def withFilter(p: (T) ⇒ Boolean): WithFilter

  90. def zip[A1 >: T, B, That](that: Iterable[B])(bf: CanBuildFrom[Iterable[T], (A1, B), That]): That

  91. def zipAll[B, A1 >: T, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[Iterable[T], (A1, B), That]): That

  92. def zipWithIndex[A1 >: T, That](bf: CanBuildFrom[Iterable[T], (A1, Int), That]): That