borscht-core/borscht/SeqNode

SeqNode

trait SeqNode extends Node with Iterable[Node]
trait Iterable[Node]
trait IterableFactoryDefaults[Node, [A] =>> Iterable[A]]
trait IterableOps[Node, [A] =>> Iterable[A], Iterable[Node]]
trait IterableOnceOps[Node, [A] =>> Iterable[A], Iterable[Node]]
trait IterableOnce[Node]
trait Node
class Object
trait Matchable
class Any

Value members

Concrete methods

override def toString: String
Definition Classes
Iterable -> Node -> Any

Inherited methods

@inline
final def ++[B >: Node](suffix: IterableOnce[B]): Iterable[B]
Inherited from
IterableOps
@inline
final def addString(b: StringBuilder): StringBuilder
Inherited from
IterableOnceOps
@inline
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from
IterableOnceOps
def collect[B](pf: PartialFunction[Node, B]): Iterable[B]
Inherited from
IterableOps
def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
Inherited from
IterableOnceOps
def concat[B >: Node](suffix: IterableOnce[B]): Iterable[B]
Inherited from
IterableOps
def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
def copyToArray[B >: Node](xs: Array[B], start: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
def copyToArray[B >: Node](xs: Array[B]): Int
Inherited from
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (Node, B) => Boolean): Boolean
Inherited from
IterableOnceOps
def count(p: Node => Boolean): Int
Inherited from
IterableOnceOps
def drop(n: Int): Iterable[Node]
Inherited from
IterableOps
def dropRight(n: Int): Iterable[Node]
Inherited from
IterableOps
def dropWhile(p: Node => Boolean): Iterable[Node]
Inherited from
IterableOps
override def empty: Iterable[Node]
Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from
IterableFactoryDefaults
def exists(p: Node => Boolean): Boolean
Inherited from
IterableOnceOps
def filter(pred: Node => Boolean): Iterable[Node]
Inherited from
IterableOps
def filterNot(pred: Node => Boolean): Iterable[Node]
Inherited from
IterableOps
def find(p: Node => Boolean): Option[Node]
Inherited from
IterableOnceOps
def flatMap[B](f: Node => IterableOnce[B]): Iterable[B]
Inherited from
IterableOps
def flatten[B](asIterable: Node => IterableOnce[B]): Iterable[B]
Inherited from
IterableOps
def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1
Inherited from
IterableOnceOps
def foldLeft[B](z: B)(op: (B, Node) => B): B
Inherited from
IterableOnceOps
def foldRight[B](z: B)(op: (Node, B) => B): B
Inherited from
IterableOnceOps
def forall(p: Node => Boolean): Boolean
Inherited from
IterableOnceOps
def foreach[U](f: Node => U): Unit
Inherited from
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[Node]): Iterable[Node]
Inherited from
IterableFactoryDefaults
def groupBy[K](f: Node => K): Map[K, Iterable[Node]]
Inherited from
IterableOps
def groupMap[K, B](key: Node => K)(f: Node => B): Map[K, Iterable[B]]
Inherited from
IterableOps
def groupMapReduce[K, B](key: Node => K)(f: Node => B)(reduce: (B, B) => B): Map[K, B]
Inherited from
IterableOps
def grouped(size: Int): Iterator[Iterable[Node]]
Inherited from
IterableOps
def head: Node
Inherited from
IterableOps
def headOption: Option[Node]
Inherited from
IterableOps
def init: Iterable[Node]
Inherited from
IterableOps
def inits: Iterator[Iterable[Node]]
Inherited from
IterableOps
def isEmpty: Boolean
Inherited from
IterableOnceOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def iterableFactory: IterableFactory[[A] =>> Iterable[A]]
Inherited from
Iterable
def iterator: Iterator[Node]
Inherited from
IterableOnce
def knownSize: Int
Inherited from
IterableOnce
def last: Node
Inherited from
IterableOps
def lastOption: Option[Node]
Inherited from
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[Node, B, SeqNode]
Inherited from
Iterable
def map[B](f: Node => B): Iterable[B]
Inherited from
IterableOps
def max[B >: Node](ord: Ordering[B]): Node
Inherited from
IterableOnceOps
def maxBy[B](f: Node => B)(cmp: Ordering[B]): Node
Inherited from
IterableOnceOps
def maxByOption[B](f: Node => B)(cmp: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def maxOption[B >: Node](ord: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def min[B >: Node](ord: Ordering[B]): Node
Inherited from
IterableOnceOps
def minBy[B](f: Node => B)(cmp: Ordering[B]): Node
Inherited from
IterableOnceOps
def minByOption[B](f: Node => B)(cmp: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def minOption[B >: Node](ord: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
@inline
final def mkString: String
Inherited from
IterableOnceOps
@inline
final def mkString(sep: String): String
Inherited from
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from
IterableOnceOps
protected def newSpecificBuilder: Builder[Node, Iterable[Node]]
Inherited from
IterableFactoryDefaults
@deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
def nonEmpty: Boolean
Inherited from
IterableOnceOps
def partition(p: Node => Boolean): (Iterable[Node], Iterable[Node])
Inherited from
IterableOps
def partitionMap[A1, A2](f: Node => Either[A1, A2]): (Iterable[A1], Iterable[A2])
Inherited from
IterableOps
def position: Position
Inherited from
Node
def product[B >: Node](num: Numeric[B]): B
Inherited from
IterableOnceOps
def reduce[B >: Node](op: (B, B) => B): B
Inherited from
IterableOnceOps
def reduceLeft[B >: Node](op: (B, Node) => B): B
Inherited from
IterableOnceOps
def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]
Inherited from
IterableOnceOps
def reduceOption[B >: Node](op: (B, B) => B): Option[B]
Inherited from
IterableOnceOps
def reduceRight[B >: Node](op: (Node, B) => B): B
Inherited from
IterableOnceOps
def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]
Inherited from
IterableOnceOps
protected def reversed: Iterable[Node]
Inherited from
IterableOnceOps
def scan[B >: Node](z: B)(op: (B, B) => B): Iterable[B]
Inherited from
IterableOps
def scanLeft[B](z: B)(op: (B, Node) => B): Iterable[B]
Inherited from
IterableOps
def scanRight[B](z: B)(op: (Node, B) => B): Iterable[B]
Inherited from
IterableOps
def size: Int
Inherited from
IterableOnceOps
def sizeCompare(that: Iterable[_]): Int
Inherited from
IterableOps
def sizeCompare(otherSize: Int): Int
Inherited from
IterableOps
@inline
final def sizeIs: SizeCompareOps
Inherited from
IterableOps
def slice(from: Int, until: Int): Iterable[Node]
Inherited from
IterableOps
def sliding(size: Int, step: Int): Iterator[Iterable[Node]]
Inherited from
IterableOps
def sliding(size: Int): Iterator[Iterable[Node]]
Inherited from
IterableOps
def span(p: Node => Boolean): (Iterable[Node], Iterable[Node])
Inherited from
IterableOps
override def splitAt(n: Int): (Iterable[Node], Iterable[Node])
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def stepper[S <: Stepper[_]](shape: StepperShape[Node, S]): S
Inherited from
IterableOnce
def sum[B >: Node](num: Numeric[B]): B
Inherited from
IterableOnceOps
def tail: Iterable[Node]
Inherited from
IterableOps
def tails: Iterator[Iterable[Node]]
Inherited from
IterableOps
def take(n: Int): Iterable[Node]
Inherited from
IterableOps
def takeRight(n: Int): Iterable[Node]
Inherited from
IterableOps
def takeWhile(p: Node => Boolean): Iterable[Node]
Inherited from
IterableOps
override def tapEach[U](f: Node => U): Iterable[Node]
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def to[C1](factory: Factory[Node, C1]): C1
Inherited from
IterableOnceOps
def toArray[B >: Node](ClassTag[B]): Array[B]
Inherited from
IterableOnceOps
@inline
final def toBuffer[B >: Node]: Buffer[B]
Inherited from
IterableOnceOps
def toIndexedSeq: IndexedSeq[Node]
Inherited from
IterableOnceOps
final def toIterable: SeqNode
Inherited from
Iterable
def toList: List[Node]
Inherited from
IterableOnceOps
def toMap[K, V](ev: Node <:< (K, V)): Map[K, V]
Inherited from
IterableOnceOps
def toSeq: Seq[Node]
Inherited from
IterableOnceOps
def toSet[B >: Node]: Set[B]
Inherited from
IterableOnceOps
def toVector: Vector[Node]
Inherited from
IterableOnceOps
def transpose[B](asIterable: Node => Iterable[B]): Iterable[Iterable[B]]
Inherited from
IterableOps
def unzip[A1, A2](asPair: Node => (A1, A2)): (Iterable[A1], Iterable[A2])
Inherited from
IterableOps
def unzip3[A1, A2, A3](asTriple: Node => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
Inherited from
IterableOps
def view: View[Node]
Inherited from
IterableOps
def withFilter(p: Node => Boolean): WithFilter[Node, [A] =>> Iterable[A]]
Inherited from
IterableOps
def zip[B](that: IterableOnce[B]): Iterable[(Node, B)]
Inherited from
IterableOps
def zipAll[A1 >: Node, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
Inherited from
IterableOps
def zipWithIndex: Iterable[(Node, Int)]
Inherited from
IterableOps

Deprecated and Inherited methods

@deprecated("Use ++ instead of ++: for collections of type Iterable", "2.13.0")
def ++:[B >: Node](that: IterableOnce[B]): Iterable[B]
Deprecated
Inherited from
IterableOps
@inline @deprecated("Use foldLeft instead of /:", "2.13.0")
final def /:[B](z: B)(op: (B, Node) => B): B
Deprecated
Inherited from
IterableOnceOps
@inline @deprecated("Use foldRight instead of :\\", "2.13.0")
final def :\[B](z: B)(op: (Node, B) => B): B
Deprecated
Inherited from
IterableOnceOps
@deprecated("`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", "2.13.0")
def aggregate[B](z: => B)(seqop: (B, Node) => B, combop: (B, B) => B): B
Deprecated
Inherited from
IterableOnceOps
@inline @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @deprecated("Use iterableFactory instead", "2.13.0")
def companion: IterableFactory[[A] =>> Iterable[A]]
Deprecated
Inherited from
IterableOps
@inline @deprecated("Use `dest ++= coll` instead", "2.13.0")
final def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
Deprecated
Inherited from
IterableOnceOps
@deprecated("Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
Inherited from
IterableOnceOps
@deprecated("Use coll instead of repr in a collection implementation, use the collection value itself from the outside", "2.13.0")
final def repr: Iterable[Node]
Deprecated
Inherited from
IterableOps
@deprecated("Iterable.seq always returns the iterable itself", "2.13.0")
def seq: SeqNode
Deprecated
Inherited from
Iterable
@inline @deprecated("Use .iterator instead of .toIterator", "2.13.0")
final def toIterator: Iterator[Node]
Deprecated
Inherited from
IterableOnceOps
@inline @deprecated("Use .to(LazyList) instead of .toStream", "2.13.0")
final def toStream: Stream[Node]
Deprecated
Inherited from
IterableOnceOps
@deprecated("Use toIterable instead", "2.13.0")
final def toTraversable: Iterable[Node]
Deprecated
Inherited from
IterableOps
@deprecated("Use .view.slice(from, until) instead of .view(from, until)", "2.13.0")
def view(from: Int, until: Int): View[Node]
Deprecated
Inherited from
IterableOps