A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.12.4/scala-xml/scala/xml/NodeSeq.html below:

abstract class NodeSeq extends AbstractSeq[Node] with collection.immutable.Seq[Node] with SeqLike[Node, NodeSeq] with Equality

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeSeq
  2. Equality
  3. Seq
  4. Iterable
  5. Traversable
  6. Immutable
  7. AbstractSeq
  8. Seq
  9. SeqLike
  10. GenSeq
  11. GenSeqLike
  12. PartialFunction
  13. Function1
  14. AbstractIterable
  15. Iterable
  16. IterableLike
  17. Equals
  18. GenIterable
  19. GenIterableLike
  20. AbstractTraversable
  21. Traversable
  22. GenTraversable
  23. GenericTraversableTemplate
  24. TraversableLike
  25. GenTraversableLike
  26. Parallelizable
  27. TraversableOnce
  28. GenTraversableOnce
  29. FilterMonadic
  30. HasNewBuilder
  31. AnyRef
  32. Any
Instance Constructors
  1. new NodeSeq()
Type Members
  1. type Self = NodeSeq
  2. class WithFilter extends FilterMonadic[A, Repr]
Abstract Value Members
  1. abstract def theSeq: Seq[Node]
Concrete Value Members
  1. final def !=(arg0: Any): Boolean
  2. final def ##(): Int
  3. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  4. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  5. def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  6. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  7. def /:[B](z: B)(op: (B, Node) ⇒ B): B
  8. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  9. def :\[B](z: B)(op: (Node, B) ⇒ B): B
  10. final def ==(arg0: Any): Boolean
  11. def \(that: String): NodeSeq
  12. def \@(attributeName: String): String
  13. def \\(that: String): NodeSeq
  14. def addString(b: StringBuilder): StringBuilder
  15. def addString(b: StringBuilder, sep: String): StringBuilder
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
  17. def aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B
  18. def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]
  19. def apply(f: (Node) ⇒ Boolean): NodeSeq
  20. def apply(i: Int): Node
  21. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1
  22. final def asInstanceOf[T0]: T0
  23. def basisForHashCode: Seq[Any]
  24. def canEqual(other: Any): Boolean
  25. def clone(): AnyRef
  26. def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  27. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
  28. def combinations(n: Int): collection.Iterator[NodeSeq]
  29. def companion: GenericCompanion[collection.immutable.Seq]
  30. def compose[A](g: (A) ⇒ Int): (A) ⇒ Node
  31. def contains[A1 >: Node](elem: A1): Boolean
  32. def containsSlice[B](that: GenSeq[B]): Boolean
  33. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit
  34. def copyToArray[B >: Node](xs: Array[B]): Unit
  35. def copyToArray[B >: Node](xs: Array[B], start: Int): Unit
  36. def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
  37. def corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean
  38. def count(p: (Node) ⇒ Boolean): Int
  39. def diff[B >: Node](that: GenSeq[B]): NodeSeq
  40. def distinct: NodeSeq
  41. def drop(n: Int): NodeSeq
  42. def dropRight(n: Int): NodeSeq
  43. def dropWhile(p: (Node) ⇒ Boolean): NodeSeq
  44. def endsWith[B](that: GenSeq[B]): Boolean
  45. final def eq(arg0: AnyRef): Boolean
  46. def equals(other: Any): Boolean
  47. def exists(p: (Node) ⇒ Boolean): Boolean
  48. def filter(p: (Node) ⇒ Boolean): NodeSeq
  49. def filterNot(p: (Node) ⇒ Boolean): NodeSeq
  50. def finalize(): Unit
  51. def find(p: (Node) ⇒ Boolean): Option[Node]
  52. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  53. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[B]
  54. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1
  55. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B
  56. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B
  57. def forall(p: (Node) ⇒ Boolean): Boolean
  58. def foreach[U](f: (Node) ⇒ U): Unit
  59. def genericBuilder[B]: Builder[B, collection.immutable.Seq[B]]
  60. final def getClass(): Class[_]
  61. def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]
  62. def grouped(size: Int): collection.Iterator[NodeSeq]
  63. def hasDefiniteSize: Boolean
  64. def hashCode(): Int
  65. def head: Node
  66. def headOption: Option[Node]
  67. def indexOf[B >: Node](elem: B, from: Int): Int
  68. def indexOf[B >: Node](elem: B): Int
  69. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int
  70. def indexOfSlice[B >: Node](that: GenSeq[B]): Int
  71. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int
  72. def indexWhere(p: (Node) ⇒ Boolean): Int
  73. def indices: collection.immutable.Range
  74. def init: NodeSeq
  75. def inits: collection.Iterator[NodeSeq]
  76. def intersect[B >: Node](that: GenSeq[B]): NodeSeq
  77. def isDefinedAt(idx: Int): Boolean
  78. def isEmpty: Boolean
  79. final def isInstanceOf[T0]: Boolean
  80. final def isTraversableAgain: Boolean
  81. def iterator: collection.Iterator[Node]
  82. def last: Node
  83. def lastIndexOf[B >: Node](elem: B, end: Int): Int
  84. def lastIndexOf[B >: Node](elem: B): Int
  85. def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int
  86. def lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int
  87. def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int
  88. def lastIndexWhere(p: (Node) ⇒ Boolean): Int
  89. def lastOption: Option[Node]
  90. def length: Int
  91. def lengthCompare(len: Int): Int
  92. def lift: (Int) ⇒ Option[Node]
  93. def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  94. def max[B >: Node](implicit cmp: Ordering[B]): Node
  95. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
  96. def min[B >: Node](implicit cmp: Ordering[B]): Node
  97. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
  98. def mkString: String
  99. def mkString(sep: String): String
  100. def mkString(start: String, sep: String, end: String): String
  101. final def ne(arg0: AnyRef): Boolean
  102. def newBuilder: Builder[Node, NodeSeq]
  103. def nonEmpty: Boolean
  104. final def notify(): Unit
  105. final def notifyAll(): Unit
  106. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  107. def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  108. def par: ParSeq[Node]
  109. def parCombiner: Combiner[Node, ParSeq[Node]]
  110. def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
  111. def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  112. def permutations: collection.Iterator[NodeSeq]
  113. def prefixLength(p: (Node) ⇒ Boolean): Int
  114. def product[B >: Node](implicit num: Numeric[B]): B
  115. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1
  116. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B
  117. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]
  118. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]
  119. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B
  120. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]
  121. def repr: NodeSeq
  122. def reverse: NodeSeq
  123. def reverseIterator: collection.Iterator[Node]
  124. def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  125. def reversed: List[Node]
  126. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean
  127. def sameElements[B >: Node](that: GenIterable[B]): Boolean
  128. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That
  129. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  130. def scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  131. def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int
  132. def seq: collection.immutable.Seq[Node]
  133. def size: Int
  134. def sizeHintIfCheap: Int
  135. def slice(from: Int, until: Int): NodeSeq
  136. def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]
  137. def sliding(size: Int): collection.Iterator[NodeSeq]
  138. def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): NodeSeq
  139. def sortWith(lt: (Node, Node) ⇒ Boolean): NodeSeq
  140. def sorted[B >: Node](implicit ord: math.Ordering[B]): NodeSeq
  141. def span(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
  142. def splitAt(n: Int): (NodeSeq, NodeSeq)
  143. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
  144. def startsWith[B](that: GenSeq[B]): Boolean
  145. def strict_!=(other: Equality): Boolean
  146. def strict_==(other: Equality): Boolean
  147. def stringPrefix: String
  148. def sum[B >: Node](implicit num: Numeric[B]): B
  149. final def synchronized[T0](arg0: ⇒ T0): T0
  150. def tail: NodeSeq
  151. def tails: collection.Iterator[NodeSeq]
  152. def take(n: Int): NodeSeq
  153. def takeRight(n: Int): NodeSeq
  154. def takeWhile(p: (Node) ⇒ Boolean): NodeSeq
  155. def text: String
  156. def thisCollection: collection.Seq[Node]
  157. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]
  158. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
  159. def toBuffer[B >: Node]: Buffer[B]
  160. def toCollection(repr: NodeSeq): collection.Seq[Node]
  161. def toIndexedSeq: collection.immutable.IndexedSeq[Node]
  162. def toIterable: collection.Iterable[Node]
  163. def toIterator: collection.Iterator[Node]
  164. def toList: List[Node]
  165. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]
  166. def toSeq: collection.immutable.Seq[Node]
  167. def toSet[B >: Node]: Set[B]
  168. def toStream: collection.immutable.Stream[Node]
  169. def toString(): String
  170. def toTraversable: collection.Traversable[Node]
  171. def toVector: Vector[Node]
  172. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[collection.immutable.Seq[B]]
  173. def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  174. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
  175. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2], collection.immutable.Seq[A3])
  176. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
  177. def view(from: Int, until: Int): SeqView[Node, NodeSeq]
  178. def view: SeqView[Node, NodeSeq]
  179. final def wait(): Unit
  180. final def wait(arg0: Long, arg1: Int): Unit
  181. final def wait(arg0: Long): Unit
  182. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]
  183. final def xml_!=(other: Any): Boolean
  184. final def xml_==(other: Any): Boolean
  185. def xml_sameElements[A](that: Iterable[A]): Boolean
  186. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
  187. def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
  188. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That
Inherited from collection.immutable.Seq[Node] Inherited from collection.immutable.Iterable[Node] Inherited from collection.immutable.Traversable[Node]

Inherited from Immutable

Inherited from AbstractSeq[Node] Inherited from collection.Seq[Node] Inherited from GenSeq[Node] Inherited from PartialFunction[Int, Node] Inherited from (Int) ⇒ Node Inherited from AbstractIterable[Node] Inherited from collection.Iterable[Node]

Inherited from Equals

Inherited from GenIterable[Node] Inherited from AbstractTraversable[Node] Inherited from collection.Traversable[Node] Inherited from GenTraversable[Node] Inherited from GenericTraversableTemplate[Node, collection.immutable.Seq] Inherited from Parallelizable[Node, ParSeq[Node]] Inherited from collection.TraversableOnce[Node] Inherited from GenTraversableOnce[Node]

Inherited from Any

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4