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
- Alphabetic
- By Inheritance
- Path
- Serializable
- Serializable
- Product
- RightLike
- EitherLike
- RightLikeProjection
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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])
Type Members
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[B >: Path[Item, Section, CC], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: Path[Item, Section, CC], That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: Path[Item, Section, CC], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, Path[Item, Section, CC]) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
children: CC[utils.ItemOrTree[Item, Section, CC]]
Children for a path, don't call unless it is not an item
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
collect[B, That](pf: PartialFunction[Path[Item, Section, CC], B])(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[Path[Item, Section, CC], B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Iterable]
- Definition Classes
- Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
copyToArray[B >: Path[Item, Section, CC]](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Path[Item, Section, CC]](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Path[Item, Section, CC]](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: Path[Item, Section, CC]](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (Path[Item, Section, CC]) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
drop(n: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterable[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
exists(p: (Path[Item, Section, CC]) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterable[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterable[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
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
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
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, That](f: (Path[Item, Section, CC]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (Path[Item, Section, CC]) ⇒ GenTraversableOnce[B]): Iterable[B]
- Definition Classes
- GenericTraversableTemplate
-
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
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, Path[Item, Section, CC]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (Path[Item, Section, CC], B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (Path[Item, Section, CC]) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (Path[Item, Section, CC]) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
get: Path[Item, Section, CC]
- Definition Classes
- RightLike → RightLikeProjection
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- 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
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableLike
-
def
hasChildren: Boolean
Does the focus have a child?
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
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
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Iterable[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- TraversableLike
-
def
isEmpty: Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
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()
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
item(): Item
get the item (isItem == true)
-
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 → IterableLike → GenIterableLike
-
def
last: Path[Item, Section, CC]
- Definition Classes
- TraversableLike → GenTraversableLike
-
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
- TraversableLike → GenTraversableLike
-
final
def
left: LeftLikeProjection[Top[Item, Section, CC]]
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
-
def
map[B, That](f: (Path[Item, Section, CC]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: Path[Item, Section, CC]](implicit cmp: Ordering[B]): Path[Item, Section, CC]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (Path[Item, Section, CC]) ⇒ B)(implicit cmp: Ordering[B]): Path[Item, Section, CC]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: Path[Item, Section, CC]](implicit cmp: Ordering[B]): Path[Item, Section, CC]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Path[Item, Section, CC]) ⇒ B)(implicit cmp: Ordering[B]): Path[Item, Section, CC]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
newBuilder: Builder[Path[Item, Section, CC], Iterable[Path[Item, Section, CC]]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
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
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
par: ParIterable[Path[Item, Section, CC]]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[Path[Item, Section, CC], ParIterable[Path[Item, Section, CC]]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
- 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
- TraversableLike → GenTraversableLike
-
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
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: Path[Item, Section, CC]](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: Path[Item, Section, CC]](op: (B, Path[Item, Section, CC]) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: Path[Item, Section, CC]](op: (B, Path[Item, Section, CC]) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: Path[Item, Section, CC]](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: Path[Item, Section, CC]](op: (Path[Item, Section, CC], B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: Path[Item, Section, CC]](op: (Path[Item, Section, CC], B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
removeAndUp(): Option[Path[Item, Section, CC]]
Removes this node, returning the parent path or None if its top
-
def
repr: Iterable[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[Path[Item, Section, CC]]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
final
def
right: RightLikeProjection[Path[Item, Section, CC]]
- Definition Classes
- RightLike → EitherLike
- Annotations
- @inline()
-
def
sameElements[B >: Path[Item, Section, CC]](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: Path[Item, Section, CC], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, Path[Item, Section, CC]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (Path[Item, Section, CC], B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Iterable[Path[Item, Section, CC]]
- Definition Classes
- Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableLike
-
def
span(p: (Path[Item, Section, CC]) ⇒ Boolean): (Iterable[Path[Item, Section, CC]], Iterable[Path[Item, Section, CC]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Iterable[Path[Item, Section, CC]], Iterable[Path[Item, Section, CC]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum[B >: Path[Item, Section, CC]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Iterable[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Iterable[Path[Item, Section, CC]]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (Path[Item, Section, CC]) ⇒ Boolean): Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[Path[Item, Section, CC]]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Path[Item, Section, CC], Col[Path[Item, Section, CC]]]): Col[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: Path[Item, Section, CC]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: Path[Item, Section, CC]]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Iterable[Path[Item, Section, CC]]): Iterable[Path[Item, Section, CC]]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[Path[Item, Section, CC]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[Path[Item, Section, CC]]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[Path[Item, Section, CC]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[Path[Item, Section, CC]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[Path[Item, Section, CC], (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[Path[Item, Section, CC]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: Path[Item, Section, CC]]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[Path[Item, Section, CC]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
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 → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[Path[Item, Section, CC]]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[Path[Item, Section, CC]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
- val top: EitherLike[Top[Item, Section, CC], Path[Item, Section, CC]]
-
def
transpose[B](implicit asTraversable: (Path[Item, Section, CC]) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
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
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (Path[Item, Section, CC]) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
view(from: Int, until: Int): IterableView[Path[Item, Section, CC], Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[Path[Item, Section, CC], Iterable[Path[Item, Section, CC]]]
- Definition Classes
- IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
withFilter(p: (Path[Item, Section, CC]) ⇒ Boolean): FilterMonadic[Path[Item, Section, CC], Iterable[Path[Item, Section, CC]]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: Path[Item, Section, CC], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: Path[Item, Section, CC], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
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[A1 >: Path[Item, Section, CC], That](implicit bf: CanBuildFrom[Iterable[Path[Item, Section, CC]], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
Deprecated Value Members
-
def
/:[B](z: B)(op: (B, Path[Item, Section, CC]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
- Annotations
- @deprecated
- Deprecated
(Since version 2.12.10) Use foldLeft instead of /:
-
def
:\[B](z: B)(op: (Path[Item, Section, CC], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
- Annotations
- @deprecated
- Deprecated
(Since version 2.12.10) Use foldRight instead of :\