trait DebugTree extends Iterable[DebugTree]
The tree representing a parser's parse tree (its parser execution path).
Initially unpopulated, it will be populated with information regarding the parser, such as what it is (if it is a primitive such as parsley.internal.deepembedding.singletons.Pure, or a user-defined named parser if names are collected) as the parser itself runs on some input.
Any tree node will store the input it has parsed (or attempted to parse) as well as its success state as an optional ParseAttempt instance.
Although this trait is unsealed, it is not useful to make a subtype of this trait, as this trait's sole purpose is to provide safe methods into handling the frozen trees produced by the debugger.
- Source
- DebugTree.scala
- Since
4.5.0
- Alphabetic
- By Inheritance
- DebugTree
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def childNumber: Option[Long]
The numerical identifier of this child, which is defined if this is a child parser that consumes input.
- abstract def fullInput: String
Get the full input that was attempted to be parsed by the debugged parser.
Get the full input that was attempted to be parsed by the debugged parser.
This is the whole input, unaltered, even parts where the parser did not attempt to parse. To see only the input a particular node or child node has viewed, look inside parseResults.
- abstract def internalName: String
The type name of the parser that formed this node.
- abstract def nodeChildren: Map[String, DebugTree]
What are the child debug nodes for this node?
What are the child debug nodes for this node?
The map provided by the implementation should be a linked map in order to preserve the order of child parser occurrences within each parser.
Internally, child nodes are given an arbitrary numeric suffix to disambiguate them in the map if multiple child nodes have the same parser name. This also allows one to traverse the tree down specific nodes via keys.
Those internal names are not represented if checking parserName.
- abstract def parseResults: Option[ParseAttempt]
Get the potential parse attempt recorded for this particular parser.
- abstract def parserName: String
The name of the parser that made this node.
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ++[B >: DebugTree](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 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: DebugTree.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[DebugTree, B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[DebugTree, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: DebugTree](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- def copyToArray[B >: DebugTree](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: DebugTree](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: DebugTree](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (DebugTree, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (DebugTree) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def drop(n: Int): Iterable[DebugTree]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Iterable[DebugTree]
- Definition Classes
- IterableOps
- def dropWhile(p: (DebugTree) => Boolean): Iterable[DebugTree]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: Iterable[DebugTree]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def exists(p: (DebugTree) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (DebugTree) => Boolean): Iterable[DebugTree]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (DebugTree) => Boolean): Iterable[DebugTree]
- Definition Classes
- IterableOps → IterableOnceOps
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(p: (DebugTree) => Boolean): Option[DebugTree]
- Definition Classes
- IterableOnceOps
- def flatMap[B](f: (DebugTree) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (DebugTree) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: DebugTree](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, DebugTree) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (DebugTree, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (DebugTree) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (DebugTree) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[DebugTree]): Iterable[DebugTree]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def groupBy[K](f: (DebugTree) => K): Map[K, Iterable[DebugTree]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (DebugTree) => K)(f: (DebugTree) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (DebugTree) => K)(f: (DebugTree) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Iterable[DebugTree]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def head: DebugTree
- Definition Classes
- IterableOps
- def headOption: Option[DebugTree]
- Definition Classes
- IterableOps
- def init: Iterable[DebugTree]
- Definition Classes
- IterableOps
- def inits: Iterator[Iterable[DebugTree]]
- Definition Classes
- IterableOps
- def isEmpty: Boolean
- Definition Classes
- IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: IterableFactory[Iterable]
- Definition Classes
- Iterable → IterableOps
- def iterator: Iterator[DebugTree]
Provides a depth-first view of the tree as an iterator.
Provides a depth-first view of the tree as an iterator.
- Definition Classes
- DebugTree → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: DebugTree
- Definition Classes
- IterableOps
- def lastOption: Option[DebugTree]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[DebugTree, B, DebugTree.this.type]
- Definition Classes
- Iterable
- def map[B](f: (DebugTree) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max[B >: DebugTree](implicit ord: Ordering[B]): DebugTree
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (DebugTree) => B)(implicit ord: Ordering[B]): DebugTree
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (DebugTree) => B)(implicit ord: Ordering[B]): Option[DebugTree]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: DebugTree](implicit ord: Ordering[B]): Option[DebugTree]
- Definition Classes
- IterableOnceOps
- def min[B >: DebugTree](implicit ord: Ordering[B]): DebugTree
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (DebugTree) => B)(implicit ord: Ordering[B]): DebugTree
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (DebugTree) => B)(implicit ord: Ordering[B]): Option[DebugTree]
- Definition Classes
- IterableOnceOps
- def minOption[B >: DebugTree](implicit ord: Ordering[B]): Option[DebugTree]
- 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
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[DebugTree, Iterable[DebugTree]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- 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 partition(p: (DebugTree) => Boolean): (Iterable[DebugTree], Iterable[DebugTree])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (DebugTree) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def product[B >: DebugTree](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: DebugTree](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: DebugTree](op: (B, DebugTree) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: DebugTree](op: (B, DebugTree) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: DebugTree](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: DebugTree](op: (DebugTree, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: DebugTree](op: (DebugTree, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reversed: Iterable[DebugTree]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scan[B >: DebugTree](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, DebugTree) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (DebugTree, 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[DebugTree]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Iterable[DebugTree]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Iterable[DebugTree]]
- Definition Classes
- IterableOps
- def span(p: (DebugTree) => Boolean): (Iterable[DebugTree], Iterable[DebugTree])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Iterable[DebugTree], Iterable[DebugTree])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[DebugTree, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- Annotations
- @deprecatedOverriding()
- def sum[B >: DebugTree](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: Iterable[DebugTree]
- Definition Classes
- IterableOps
- def tails: Iterator[Iterable[DebugTree]]
- Definition Classes
- IterableOps
- def take(n: Int): Iterable[DebugTree]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Iterable[DebugTree]
- Definition Classes
- IterableOps
- def takeWhile(p: (DebugTree) => Boolean): Iterable[DebugTree]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (DebugTree) => U): Iterable[DebugTree]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[DebugTree, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: DebugTree](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: DebugTree]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[DebugTree]
- Definition Classes
- IterableOnceOps
- def toList: List[DebugTree]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[DebugTree, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[DebugTree]
- Definition Classes
- IterableOnceOps
- def toSet[B >: DebugTree]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- DebugTree → Iterable → AnyRef → Any
- def toVector: Vector[DebugTree]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (DebugTree) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- def unzip[A1, A2](implicit asPair: (DebugTree) => (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (DebugTree) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- def view: View[DebugTree]
- 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: (DebugTree) => Boolean): WithFilter[DebugTree, Iterable]
- Definition Classes
- IterableOps
- def zip[B](that: IterableOnce[B]): Iterable[(DebugTree, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: DebugTree, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Iterable[(DebugTree, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
Deprecated Value Members
- def ++:[B >: DebugTree](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, DebugTree) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (DebugTree, 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, DebugTree) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is 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 >: DebugTree](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- 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[DebugTree]
- 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: DebugTree.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterable: DebugTree.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
toList
ortoSeq
, but it doesn't copy non-immutable collections
- final def toIterator: Iterator[DebugTree]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[DebugTree]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[DebugTree]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to
toList
ortoSeq
, but it doesn't copy non-immutable collections
- def view(from: Int, until: Int): View[DebugTree]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)