class ValueStack extends Iterable[Any]
A mutable untyped stack of values. In most cases you won't have to access its API directly since parboiled2's DSL should allow you a safer and easier way to interact with the stack. However, in some cases, when you know what you are doing, direct access can be helpful.
- Alphabetic
- By Inheritance
- ValueStack
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ++[B >: Any](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 clear(): Unit
Removes all elements from the stack.
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def coll: ValueStack.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Any, B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Any, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def concat[B >: Any](suffix: IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps
- def copyToArray[B >: Any](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Any](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: Any](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: IterableOnce[B])(p: (Any, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (Any) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def drop(n: Int): Iterable[Any]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): Iterable[Any]
- Definition Classes
- IterableOps
- def dropWhile(p: (Any) => Boolean): Iterable[Any]
- Definition Classes
- IterableOps → IterableOnceOps
- def empty: Iterable[Any]
- 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: (Any) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (Any) => Boolean): Iterable[Any]
- Definition Classes
- IterableOps → IterableOnceOps
- def filterNot(pred: (Any) => Boolean): Iterable[Any]
- Definition Classes
- IterableOps → IterableOnceOps
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(p: (Any) => Boolean): Option[Any]
- Definition Classes
- IterableOnceOps
- def flatMap[B](f: (Any) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def flatten[B](implicit asIterable: (Any) => IterableOnce[B]): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def fold[A1 >: Any](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Any) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Any, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (Any) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Any) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[Any]): Iterable[Any]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def groupBy[K](f: (Any) => K): Map[K, Iterable[Any]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Any) => K)(f: (Any) => B): Map[K, Iterable[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Any) => K)(f: (Any) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[Iterable[Any]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def head: Any
- Definition Classes
- IterableOps
- def headOption: Option[Any]
- Definition Classes
- IterableOps
- def init: Iterable[Any]
- Definition Classes
- IterableOps
- def inits: Iterator[Iterable[Any]]
- Definition Classes
- IterableOps
- def insert(down: Int, value: Any): Unit
Inserts the given value into the stack
downelements below the current top element.Inserts the given value into the stack
downelements below the current top element.insert(0, 'x')is therefore equal topush('x'). Throws aValueStackOverflowExceptionif the stack has no more space available. Throws aValueStackUnderflowExceptionifdown > size. Throws anIllegalArgumentExceptionisdownis negative. - def isEmpty: Boolean
True if no elements are currently on the stack.
True if no elements are currently on the stack.
- Definition Classes
- ValueStack → 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[Any]
Returns an iterator that iterates over a *snapshot* of the stack elements at the time of this method call.
Returns an iterator that iterates over a *snapshot* of the stack elements at the time of this method call. I.e. subsequent mutations are not visible to the iterator.
- Definition Classes
- ValueStack → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def last: Any
- Definition Classes
- IterableOps
- def lastOption: Option[Any]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[Any, B, ValueStack.this.type]
- Definition Classes
- Iterable
- def map[B](f: (Any) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def max[B >: Any](implicit ord: Ordering[B]): Any
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (Any) => B)(implicit cmp: Ordering[B]): Any
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (Any) => B)(implicit cmp: Ordering[B]): Option[Any]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: Any](implicit ord: Ordering[B]): Option[Any]
- Definition Classes
- IterableOnceOps
- def min[B >: Any](implicit ord: Ordering[B]): Any
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (Any) => B)(implicit cmp: Ordering[B]): Any
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (Any) => B)(implicit cmp: Ordering[B]): Option[Any]
- Definition Classes
- IterableOnceOps
- def minOption[B >: Any](implicit ord: Ordering[B]): Option[Any]
- 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[Any, Iterable[Any]]
- 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: (Any) => Boolean): (Iterable[Any], Iterable[Any])
- Definition Classes
- IterableOps
- def partitionMap[A1, A2](f: (Any) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def peek(down: Int): Any
Returns the element
downelements below the current top element without removing it.Returns the element
downelements below the current top element without removing it.peek(0)is therefore equal topeek(). Throws aValueStackUnderflowExceptionifdown >= size. Throws anIllegalArgumentExceptionisdownis negative. - def peek: Any
Returns the top element without removing it.
Returns the top element without removing it. Throws a
ValueStackUnderflowExceptionif the stack is empty. - def poke(down: Int, value: Any): Unit
Replaces the element
downelements below the current top element with the given one.Replaces the element
downelements below the current top element with the given one. Throws aValueStackUnderflowExceptionifdown >= size. Throws anIllegalArgumentExceptionifdownis negative. - def pop(): Any
Removes the top element from the stack and returns it.
Removes the top element from the stack and returns it. Throws a
ValueStackUnderflowExceptionif the stack is empty. - def product[B >: Any](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def pullOut(down: Int): Any
Removes the element
downelements below the current top element from the stack and returns it.Removes the element
downelements below the current top element from the stack and returns it.pullOut(0)is therefore equal topop(). Throws aValueStackUnderflowExceptionifdown >= size. Throws anIllegalArgumentExceptionisdownis negative. - def push(value: Any): Unit
Puts the given value onto the stack.
Puts the given value onto the stack. Throws a
ValueStackOverflowExceptionif the stack has no more space available. - final def pushAll(hlist: HList): Unit
Puts the given HList of values onto the stack.
Puts the given HList of values onto the stack. Throws a
ValueStackOverflowExceptionif the stack has no more space available.- Annotations
- @tailrec()
- def reduce[B >: Any](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: Any](op: (B, Any) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: Any](op: (B, Any) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Any](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Any](op: (Any, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: Any](op: (Any, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reversed: Iterable[Any]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def scan[B >: Any](z: B)(op: (B, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Any) => B): Iterable[B]
- Definition Classes
- IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (Any, B) => B): Iterable[B]
- Definition Classes
- IterableOps
- def show: String
Creates a string representation of the current value stack contents.
Creates a string representation of the current value stack contents. Mostly useful for debugging.
- def size: Int
The number of elements currently on the stack.
The number of elements currently on the stack.
- Definition Classes
- ValueStack → 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[Any]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): Iterator[Iterable[Any]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[Iterable[Any]]
- Definition Classes
- IterableOps
- def span(p: (Any) => Boolean): (Iterable[Any], Iterable[Any])
- Definition Classes
- IterableOps → IterableOnceOps
- def splitAt(n: Int): (Iterable[Any], Iterable[Any])
- Definition Classes
- IterableOps → IterableOnceOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Any, S]): S
- Definition Classes
- IterableOnce
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- Annotations
- @deprecatedOverriding()
- def sum[B >: Any](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def swap(): Unit
Swaps the top 2 stack elements.
Swaps the top 2 stack elements. Throws a
ValueStackUnderflowExceptionifsize < 2. - def swap3(): Unit
Swaps the top 3 stack elements.
Swaps the top 3 stack elements. Throws a
ValueStackUnderflowExceptionifsize < 3. - def swap4(): Unit
Swaps the top 4 stack elements.
Swaps the top 4 stack elements. Throws a
ValueStackUnderflowExceptionifsize < 4. - def swap5(): Unit
Swaps the top 5 stack elements.
Swaps the top 5 stack elements. Throws a
ValueStackUnderflowExceptionifsize < 5. - final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: Iterable[Any]
- Definition Classes
- IterableOps
- def tails: Iterator[Iterable[Any]]
- Definition Classes
- IterableOps
- def take(n: Int): Iterable[Any]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): Iterable[Any]
- Definition Classes
- IterableOps
- def takeWhile(p: (Any) => Boolean): Iterable[Any]
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (Any) => U): Iterable[Any]
- Definition Classes
- IterableOps → IterableOnceOps
- def to[C1](factory: Factory[Any, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray: Array[Any]
Returns all current stack elements as a new array.
- def toArray[B >: Any](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: Any]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def toHList[L <: HList](start: Int = 0, end: Int = _size, prependTo: HList = HNil): L
Copies all elements between the given
start(inclusive) andend(exclusive) indices into an HList that is prepended to the given tail.Copies all elements between the given
start(inclusive) andend(exclusive) indices into an HList that is prepended to the given tail. Throws anIllegalArgumentExceptionifstart < 0 || start > end. Throws aValueStackUnderflowExceptionifend > size.- Annotations
- @tailrec()
- def toIndexedSeq: IndexedSeq[Any]
- Definition Classes
- IterableOnceOps
- def toList: List[Any]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[Any, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[Any]
- Definition Classes
- IterableOnceOps
- def toSet[B >: Any]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Iterable → AnyRef → Any
- def toVector: Vector[Any]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (Any) => Iterable[B]): Iterable[Iterable[B]]
- Definition Classes
- IterableOps
- def unzip[A1, A2](implicit asPair: (Any) => (A1, A2)): (Iterable[A1], Iterable[A2])
- Definition Classes
- IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (Any) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- Definition Classes
- IterableOps
- def view: View[Any]
- 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: (Any) => Boolean): WithFilter[Any, Iterable]
- Definition Classes
- IterableOps
- def zip[B](that: IterableOnce[B]): Iterable[(Any, B)]
- Definition Classes
- IterableOps
- def zipAll[A1 >: Any, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Iterable[(Any, Int)]
- Definition Classes
- IterableOps → IterableOnceOps
Deprecated Value Members
- def ++:[B >: Any](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, Any) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (Any, 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, Any) => 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 >: Any](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[Any]
- 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: ValueStack.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterable: ValueStack.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[Any]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[Any]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[Any]
- 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[Any]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)