case class Path[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[_]](top: EitherLike[Top[Item, Section, CC], Path[Item, Section, CC]], node: Node[Item, Section, CC])(implicit seqLikeThing: SeqLikeThing[CC[_], utils.ItemOrTree[Item, Section, CC], CC]) extends Iterable[Path[Item, Section, CC]] with RightLike[Top[Item, Section, CC], Path[Item, Section, CC]] with Product with Serializable
- Self Type
- Path[Item, Section, CC]
- Alphabetic
- By Inheritance
- Path
- Serializable
- Product
- Equals
- RightLike
- EitherLike
- RightLikeProjection
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new Path(top: EitherLike[Top[Item, Section, CC], Path[Item, Section, CC]], node: Node[Item, Section, CC])(implicit seqLikeThing: SeqLikeThing[CC[_], utils.ItemOrTree[Item, Section, CC], CC])
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ++[B >: Path[Item, Section, CC]](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def addString(b: StringBuilder): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): b.type
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
- Definition Classes
- IterableOnceOps
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def children: CC[utils.ItemOrTree[Item, Section, CC]]
Children for a path, don't call unless it is not an item
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def coll: Path.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Path[Item, Section, CC], B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Path[Item, Section, CC], B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: Path[Item, Section, CC]](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- def copyToArray[B >: Path[Item, Section, CC]](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Path[Item, Section, CC]](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: Path[Item, Section, CC]](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (Path[Item, Section, CC], B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (Path[Item, Section, CC]) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def drop(n: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- def dropWhile(p: (Path[Item, Section, CC]) => Boolean): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def exists(p: (Path[Item, Section, CC]) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (Path[Item, Section, CC]) => Boolean): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (Path[Item, Section, CC]) => Boolean): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps → IterableOnceOps
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(p: (Path[Item, Section, CC]) => Boolean): Option[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- def firstChild(): Option[Path[Item, Section, CC]]
Returns either the first child or none.
Returns either the first child or none. Note the child would still need to be unpacked
- def flatMap[B](f: (Path[Item, Section, CC]) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (Path[Item, Section, CC]) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def focus[R](i: (Item) => R, t: (Tree[Item, Section, CC]) => R): R
Folds over child or tree
- final def fold[X](fl: (Top[Item, Section, CC]) => X, fr: (Path[Item, Section, CC]) => X): X
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
- def fold[A1 >: Path[Item, Section, CC]](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Path[Item, Section, CC]) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Path[Item, Section, CC], B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (Path[Item, Section, CC]) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Path[Item, Section, CC]) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[Path[Item, Section, CC]]): Iterable[Path[Item, Section, CC]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def get: Path[Item, Section, CC]
- Definition Classes
- RightLike → RightLikeProjection
- Annotations
- @inline()
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def getLeft: Top[Item, Section, CC]
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
- final def getRight: Path[Item, Section, CC]
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
- def groupBy[K](f: (Path[Item, Section, CC]) => K): Map[K, Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Path[Item, Section, CC]) => K)(f: (Path[Item, Section, CC]) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Path[Item, Section, CC]) => K)(f: (Path[Item, Section, CC]) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableOps
- def hasChildren: Boolean
Does the focus have a child?
- def hasNextSibling: Boolean
Does it have a further sibling
- def hasPreviousSibling: Boolean
Is there a previous sibling
- def head: Path[Item, Section, CC]
- Definition Classes
- IterableOps
- def headOption: Option[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- def init: Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- def inits: Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableOps
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isItem: Boolean
Is the focus an Item?
- final def isLeft: Boolean
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
- final def isRight: Boolean
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def item(): Item
get the item (isItem == true)
- def iterableFactory: IterableFactory[Iterable]
- Definition Classes
- Iterable → IterableOps
- def iterator(): Iterator[Path[Item, Section, CC]]
Provide iterator to the path of the children
Provide iterator to the path of the children
- Definition Classes
- Path → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: Path[Item, Section, CC]
- Definition Classes
- IterableOps
- def lastChild(): Option[Path[Item, Section, CC]]
Returns either the last child or none.
Returns either the last child or none. Note the child would still need to be unpacked
- def lastOption: Option[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[Path[Item, Section, CC], B, Path.this.type]
- Definition Classes
- Iterable
- final def left: LeftLikeProjection[Top[Item, Section, CC]]
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
- def map[B](f: (Path[Item, Section, CC]) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max[B >: Path[Item, Section, CC]](implicit ord: Ordering[B]): Path[Item, Section, CC]
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (Path[Item, Section, CC]) => B)(implicit ord: Ordering[B]): Path[Item, Section, CC]
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (Path[Item, Section, CC]) => B)(implicit ord: Ordering[B]): Option[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: Path[Item, Section, CC]](implicit ord: Ordering[B]): Option[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- def min[B >: Path[Item, Section, CC]](implicit ord: Ordering[B]): Path[Item, Section, CC]
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (Path[Item, Section, CC]) => B)(implicit ord: Ordering[B]): Path[Item, Section, CC]
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (Path[Item, Section, CC]) => B)(implicit ord: Ordering[B]): Option[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- def minOption[B >: Path[Item, Section, CC]](implicit ord: Ordering[B]): Option[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- def modify(newFocus: (utils.ItemOrTree[Item, Section, CC]) => utils.ItemOrTree[Item, Section, CC]): Path[Item, Section, [_]CC[_]]
Replaces this paths focus returning the path for the returned node.
Replaces this paths focus returning the path for the returned node.
- newFocus
transforming function on the ItemOrTree.
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[Path[Item, Section, CC], Iterable[Path[Item, Section, CC]]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nextSibling: Path[Item, Section, [_]CC[_]]
Call hasNextSibling first to assert there is a next sibling
- val node: Node[Item, Section, CC]
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def parentCount: Int
- def parentTree: Tree[Item, Section, CC]
- def partition(p: (Path[Item, Section, CC]) => Boolean): (Iterable[Path[Item, Section, CC]], Iterable[Path[Item, Section, CC]])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (Path[Item, Section, CC]) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def position(): Position[Item, Section, CC]
Gets the relative position of this Path DOES NOT perform a zip
- def previousSibling: Path[Item, Section, [_]CC[_]]
Call hasPreviousSibling first to assert there is a previous sibling
- def product[B >: Path[Item, Section, CC]](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def reduce[B >: Path[Item, Section, CC]](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: Path[Item, Section, CC]](op: (B, Path[Item, Section, CC]) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: Path[Item, Section, CC]](op: (B, Path[Item, Section, CC]) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Path[Item, Section, CC]](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Path[Item, Section, CC]](op: (Path[Item, Section, CC], B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: Path[Item, Section, CC]](op: (Path[Item, Section, CC], B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def removeAndUp(): Option[Path[Item, Section, CC]]
Removes this node, returning the parent path or None if its top
- def reversed: Iterable[Path[Item, Section, CC]]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- final def right: RightLikeProjection[Path[Item, Section, CC]]
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
- def scan[B >: Path[Item, Section, CC]](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Path[Item, Section, CC]) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (Path[Item, Section, CC], B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def size: Int
- Definition Classes
- IterableOnceOps
- def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- IterableOps
- def sizeCompare(otherSize: Int): Int
- Definition Classes
- IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableOps
- def span(p: (Path[Item, Section, CC]) => Boolean): (Iterable[Path[Item, Section, CC]], Iterable[Path[Item, Section, CC]])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Iterable[Path[Item, Section, CC]], Iterable[Path[Item, Section, CC]])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Path[Item, Section, CC], S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- Annotations
- @deprecatedOverriding()
- def sum[B >: Path[Item, Section, CC]](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- def tails: Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableOps
- def take(n: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- def takeWhile(p: (Path[Item, Section, CC]) => Boolean): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (Path[Item, Section, CC]) => U): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[Path[Item, Section, CC], C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: Path[Item, Section, CC]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: Path[Item, Section, CC]]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- def toList: List[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[Path[Item, Section, CC], (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- def toSet[B >: Path[Item, Section, CC]]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
Gives a nicer representation then the standard (Paths(Paths(), Paths).
Gives a nicer representation then the standard (Paths(Paths(), Paths). But still too much info
Path( Section | Top, FocusSection | FocusItem)
- Definition Classes
- Path → Iterable → AnyRef → Any
- def toVector: Vector[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- val top: EitherLike[Top[Item, Section, CC], Path[Item, Section, CC]]
- def transpose[B](implicit asIterable: (Path[Item, Section, CC]) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- def tree(): Tree[Item, Section, CC]
get the tree (isItem == false)
- def unzip[A1, A2](implicit asPair: (Path[Item, Section, CC]) => (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (Path[Item, Section, CC]) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- def view: View[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def withFilter(p: (Path[Item, Section, CC]) => Boolean): WithFilter[Path[Item, Section, CC], Iterable]
- Definition Classes
- IterableOps
- def zip[B](that: IterableOnce[B]): Iterable[(Path[Item, Section, CC], B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: Path[Item, Section, CC], B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- def zipUp(): Path[Item, Section, CC]
zipUp returns this if it is already the top item (doesn't have a parent to zip), and a newly zipped node when not if the focus has been modified
- def zipWithIndex: Iterable[(Path[Item, Section, CC], Int)]
- Definition Classes
- IterableOps → IterableOnceOps
Deprecated Value Members
- def ++:[B >: Path[Item, Section, CC]](that: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable
- final def /:[B](z: B)(op: (B, Path[Item, Section, CC]) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (Path[Item, Section, CC], B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, Path[Item, Section, CC]) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregateis not relevant for sequential collections. UsefoldLeft(z)(seqop)instead.
- def companion: IterableFactory[Iterable]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- final def copyToBuffer[B >: Path[Item, Section, CC]](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= collinstead
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- final def repr: Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def seq: Path.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterable: Path.this.type
- Definition Classes
- Iterable → IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to
toListortoSeq, but it doesn't copy non-immutable collections
- final def toIterator: Iterator[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[Path[Item, Section, CC]]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to
toListortoSeq, but it doesn't copy non-immutable collections
- def view(from: Int, until: Int): View[Path[Item, Section, CC]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)