class
DirectionIterator[Item <: LeftLike[Item, Tree[Item, Section, CC]], Section, CC[X] <: IndexedSeqLike[X, CC[X]]] extends AbstractPathIterator[Item, Section, CC, Path[Item, Section, CC]]
Instance Constructors
-
new
DirectionIterator(initialPath: Path[Item, Section, CC], isForward: Boolean = true)
Type Members
-
class
GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]
-
sealed
trait
State extends AnyRef
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
++[B >: Path[Item, Section, CC]](that: ⇒ GenTraversableOnce[B]): Iterator[B]
-
def
/:[B](z: B)(op: (B, Path[Item, Section, CC]) ⇒ B): B
-
def
:\[B](z: B)(op: (Path[Item, Section, CC], B) ⇒ B): B
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
object
End extends State with Product with Serializable
-
object
EndElemS extends State with Product with Serializable
-
object
OnItem extends State with Product with Serializable
-
object
StartElem extends State with Product with Serializable
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, Path[Item, Section, CC]) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
def
buffered: BufferedIterator[Path[Item, Section, CC]]
-
final
def
canDoNext: Boolean
-
def
clone(): AnyRef
-
def
collect[B](pf: PartialFunction[Path[Item, Section, CC], B]): Iterator[B]
-
def
collectFirst[B](pf: PartialFunction[Path[Item, Section, CC], B]): Option[B]
-
def
contains(elem: Any): Boolean
-
def
copyToArray[B >: Path[Item, Section, CC]](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: Path[Item, Section, CC]](xs: Array[B]): Unit
-
def
copyToArray[B >: Path[Item, Section, CC]](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: Path[Item, Section, CC]](dest: Buffer[B]): Unit
-
def
corresponds[B](that: GenTraversableOnce[B])(p: (Path[Item, Section, CC], B) ⇒ Boolean): Boolean
-
def
count(p: (Path[Item, Section, CC]) ⇒ Boolean): Int
-
def
doNext(ev: Path[Item, Section, CC]): (State, Path[Item, Section, CC])
-
def
drop(n: Int): Iterator[Path[Item, Section, CC]]
-
def
dropWhile(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterator[Path[Item, Section, CC]]
-
def
duplicate: (Iterator[Path[Item, Section, CC]], Iterator[Path[Item, Section, CC]])
-
def
end: Path[Item, Section, CC]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
event: Path[Item, Section, CC]
-
def
exists(p: (Path[Item, Section, CC]) ⇒ Boolean): Boolean
-
def
filter(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterator[Path[Item, Section, CC]]
-
def
filterNot(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterator[Path[Item, Section, CC]]
-
def
finalize(): Unit
-
def
find(p: (Path[Item, Section, CC]) ⇒ Boolean): Option[Path[Item, Section, CC]]
-
def
flatMap[B](f: (Path[Item, Section, CC]) ⇒ GenTraversableOnce[B]): Iterator[B]
-
def
fold[A1 >: Path[Item, Section, CC]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, Path[Item, Section, CC]) ⇒ B): B
-
def
foldRight[B](z: B)(op: (Path[Item, Section, CC], B) ⇒ B): B
-
def
forall(p: (Path[Item, Section, CC]) ⇒ Boolean): Boolean
-
def
foreach[U](f: (Path[Item, Section, CC]) ⇒ U): Unit
-
final
def
getClass(): Class[_]
-
def
grouped[B >: Path[Item, Section, CC]](size: Int): GroupedIterator[B]
-
def
hasDefiniteSize: Boolean
-
def
hasNext: Boolean
-
def
hashCode(): Int
-
def
indexOf[B >: Path[Item, Section, CC]](elem: B): Int
-
def
indexWhere(p: (Path[Item, Section, CC]) ⇒ Boolean): Int
-
val
initialPath: Path[Item, Section, CC]
-
def
isEmpty: Boolean
-
val
isForward: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isTraversableAgain: Boolean
-
def
length: Int
-
def
map[B](f: (Path[Item, Section, CC]) ⇒ B): Iterator[B]
-
def
max[B >: Path[Item, Section, CC]](implicit cmp: Ordering[B]): Path[Item, Section, CC]
-
def
maxBy[B](f: (Path[Item, Section, CC]) ⇒ B)(implicit cmp: Ordering[B]): Path[Item, Section, CC]
-
def
min[B >: Path[Item, Section, CC]](implicit cmp: Ordering[B]): Path[Item, Section, CC]
-
def
minBy[B](f: (Path[Item, Section, CC]) ⇒ B)(implicit cmp: Ordering[B]): Path[Item, Section, CC]
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
def
next(): Path[Item, Section, CC]
-
var
nextState: State
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
padTo[A1 >: Path[Item, Section, CC]](len: Int, elem: A1): Iterator[A1]
-
def
partition(p: (Path[Item, Section, CC]) ⇒ Boolean): (Iterator[Path[Item, Section, CC]], Iterator[Path[Item, Section, CC]])
-
def
patch[B >: Path[Item, Section, CC]](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
-
var
path: Path[Item, Section, CC]
-
def
prepareNext: Unit
-
def
product[B >: Path[Item, Section, CC]](implicit num: Numeric[B]): B
-
def
reduce[A1 >: Path[Item, Section, CC]](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: Path[Item, Section, CC]](op: (B, Path[Item, Section, CC]) ⇒ B): B
-
def
reduceLeftOption[B >: Path[Item, Section, CC]](op: (B, Path[Item, Section, CC]) ⇒ B): Option[B]
-
def
reduceOption[A1 >: Path[Item, Section, CC]](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: Path[Item, Section, CC]](op: (Path[Item, Section, CC], B) ⇒ B): B
-
def
reduceRightOption[B >: Path[Item, Section, CC]](op: (Path[Item, Section, CC], B) ⇒ B): Option[B]
-
def
reversed: List[Path[Item, Section, CC]]
-
def
sameElements(that: Iterator[_]): Boolean
-
def
scanLeft[B](z: B)(op: (B, Path[Item, Section, CC]) ⇒ B): Iterator[B]
-
def
scanRight[B](z: B)(op: (Path[Item, Section, CC], B) ⇒ B): Iterator[B]
-
def
seq: Iterator[Path[Item, Section, CC]]
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterator[Path[Item, Section, CC]]
-
def
sliding[B >: Path[Item, Section, CC]](size: Int, step: Int): GroupedIterator[B]
-
def
span(p: (Path[Item, Section, CC]) ⇒ Boolean): (Iterator[Path[Item, Section, CC]], Iterator[Path[Item, Section, CC]])
-
def
sum[B >: Path[Item, Section, CC]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
take(n: Int): Iterator[Path[Item, Section, CC]]
-
def
takeWhile(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterator[Path[Item, Section, CC]]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Path[Item, Section, CC], Col[Path[Item, Section, CC]]]): Col[Path[Item, Section, CC]]
-
def
toArray[B >: Path[Item, Section, CC]](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: Path[Item, Section, CC]]: Buffer[B]
-
def
toIndexedSeq: IndexedSeq[Path[Item, Section, CC]]
-
def
toIterable: Iterable[Path[Item, Section, CC]]
-
def
toIterator: Iterator[Path[Item, Section, CC]]
-
def
toList: List[Path[Item, Section, CC]]
-
def
toMap[T, U](implicit ev: <:<[Path[Item, Section, CC], (T, U)]): Map[T, U]
-
def
toSeq: Seq[Path[Item, Section, CC]]
-
def
toSet[B >: Path[Item, Section, CC]]: Set[B]
-
def
toStream: Stream[Path[Item, Section, CC]]
-
def
toString(): String
-
def
toTraversable: Traversable[Path[Item, Section, CC]]
-
def
toVector: Vector[Path[Item, Section, CC]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withFilter(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterator[Path[Item, Section, CC]]
-
def
zip[B](that: Iterator[B]): Iterator[(Path[Item, Section, CC], B)]
-
def
zipAll[B, A1 >: Path[Item, Section, CC], B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
-
def
zipWithIndex: Iterator[(Path[Item, Section, CC], Int)]
Deprecated Value Members
-
def
/:\[A1 >: Path[Item, Section, CC]](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from Iterator[Path[Item, Section, CC]]
Inherited from TraversableOnce[Path[Item, Section, CC]]
Inherited from GenTraversableOnce[Path[Item, Section, CC]]
Inherited from AnyRef
Inherited from Any
Iterates over paths using the document order it skips over EndElemS events when going forward and StartElem when reversing, returning just the path. Developers should call preceding or following before entering this iterator.