Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package opalj

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode.

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode. OPAL is designed with performance, scalability and adaptability in mind.

    Its main components are:

    • a library (Common) which provides generally useful data-structures and algorithms for static analyses.
    • a framework for implementing lattice based static analyses (Static Analysis Infrastructure)
    • a framework for parsing Java bytecode (Bytecode Infrastructure) that can be used to create arbitrary representations.
    • a library to create a one-to-one in-memory representation of Java bytecode (Bytecode Disassembler).
    • a library to create a representation of Java bytecode that facilitates writing simple static analyses (Bytecode Representation - org.opalj.br).
    • a scalable, easily customizable framework for the abstract interpretation of Java bytecode (Abstract Interpretation Framework - org.opalj.ai).
    • a library to extract dependencies between code elements and to facilitate checking architecture definitions.
    • a library for the lightweight manipulation and creation of Java bytecode (Bytecode Assembler).

    General Design Decisions

    Thread Safety

    Unless explicitly noted, OPAL is thread safe. I.e., the classes defined by OPAL can be considered to be thread safe unless otherwise stated. (For example, it is possible to read and process class files concurrently without explicit synchronization on the client side.)

    No null Values

    Unless explicitly noted, OPAL does not null values I.e., fields that are accessible will never contain null values and methods will never return null. If a method accepts null as a value for a parameter or returns a null value it is always explicitly documented. In general, the behavior of methods that are passed null values is undefined unless explicitly documented.

    No Typecasts for Collections

    For efficiency reasons, OPAL sometimes uses mutable data-structures internally. After construction time, these data-structures are generally represented using their generic interfaces (e.g., scala.collection.{Set,Map}). However, a downcast (e.g., to add/remove elements) is always forbidden as it would effectively prevent thread-safety.

    Assertions

    OPAL makes heavy use of Scala's Assertion Facility to facilitate writing correct code. Hence, for production builds (after thorough testing(!)) it is highly recommend to build OPAL again using -Xdisable-assertions.

    Definition Classes
    org
  • package collection

    OPAL's collection library is primarily designed with high performance in mind.

    Design Goals

    OPAL's collection library is primarily designed with high performance in mind. I.e., all methods provided by the collection library are reasonably optimized. However, providing a very large number of methods is a non-goal. Overall, OPAL's collection library provides:

    • collection classes that are manually specialized for primitive data-types.
    • collection classes that are optimized for particularly small collections of values.
    • collection classes that target special use cases such as using a collection as a workset/worklist.
    • collection classes that offer special methods that minimize the number of steps when compared to general purpose methods.

    Integration With Scala's Collection Library

    Hence, OPAL's collection library complements Scala's default collection library and is not intended to replace it. Integration with Scala's collection library is primarily provided by means of iterators (OPAL's Iterators inherit from Scala's Iterators). Furthermore the companion object of each of OPAL's collection classes generally provides factory methods that facilitate the conversion from Scala collection classes to OPAL collection classes.

    Status

    The collection library is growing. Nevertheless, the existing classes are production ready.

    Definition Classes
    opalj
  • package mutable
    Definition Classes
    collection
  • ArrayMap
  • FixedSizeBitSet
  • FixedSizedHashIDMap
  • IntArrayStack
  • IntQueue
  • Locals
  • RefAccumulator

final class IntArrayStack extends IndexedSeq[Int] with IndexedSeqOps[Int, Stack, IntArrayStack] with Cloneable[IntArrayStack] with Serializable

An array based implementation of a mutable stack of int values which has a given initial size. If the stack is non-empty, the index of the top value is 0 and the index of the bottom value is (length-1).

Self Type
IntArrayStack
Source
IntArrayStack.scala
Linear Supertypes
Serializable, IndexedSeq[Int], IndexedSeqOps[Int, [_]Stack[_], IntArrayStack], IndexedSeq[Int], IndexedSeqOps[Int, [_]Stack[_], IntArrayStack], Seq[Int], SeqOps[Int, [_]Stack[_], IntArrayStack], Cloneable[IntArrayStack], Cloneable, Seq[Int], Equals, SeqOps[Int, [_]Stack[_], IntArrayStack], PartialFunction[Int, Int], (Int) => Int, Iterable[Int], Iterable[Int], IterableFactoryDefaults[Int, [x]IndexedSeq[x]], IterableOps[Int, [_]Stack[_], IntArrayStack], IterableOnceOps[Int, [_]Stack[_], IntArrayStack], IterableOnce[Int], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IntArrayStack
  2. Serializable
  3. IndexedSeq
  4. IndexedSeqOps
  5. IndexedSeq
  6. IndexedSeqOps
  7. Seq
  8. SeqOps
  9. Cloneable
  10. Cloneable
  11. Seq
  12. Equals
  13. SeqOps
  14. PartialFunction
  15. Function1
  16. Iterable
  17. Iterable
  18. IterableFactoryDefaults
  19. IterableOps
  20. IterableOnceOps
  21. IterableOnce
  22. AnyRef
  23. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new IntArrayStack(initialSize: Int = 4)

Value Members

  1. final def ++[B >: Int](suffix: IterableOnce[B]): Stack[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  2. final def ++:[B >: Int](prefix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  3. final def +:[B >: Int](elem: B): Stack[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  4. def +=(i: Int): IntArrayStack.this.type

    The same as push but additionally returns this.

  5. final def :+[B >: Int](elem: B): Stack[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  6. final def :++[B >: Int](suffix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  7. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  8. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  9. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    IterableOnceOps
  10. def andThen[C](k: PartialFunction[Int, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  11. def andThen[C](k: (Int) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  12. def appended[B >: Int](elem: B): Stack[B]
    Definition Classes
    SeqOps
  13. def appendedAll[B >: Int](suffix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps
  14. def apply(index: Int): Int
    Definition Classes
    IntArrayStack → SeqOps → Function1
  15. def applyOrElse[A1 <: Int, B1 >: Int](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  16. def canEqual(that: Any): Boolean
    Definition Classes
    Seq → Equals
  17. def clone(): IntArrayStack
    Definition Classes
    IntArrayStack → SeqOps → Cloneable → AnyRef
  18. def collect[B](pf: PartialFunction[Int, B]): Stack[B]
    Definition Classes
    IterableOps → IterableOnceOps
  19. def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
    Definition Classes
    IterableOnceOps
  20. def combinations(n: Int): Iterator[IntArrayStack]
    Definition Classes
    SeqOps
  21. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Int]
    Definition Classes
    PartialFunction
  22. def compose[A](g: (A) => Int): (A) => Int
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  23. final def concat[B >: Int](suffix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  24. def contains[A1 >: Int](elem: A1): Boolean
    Definition Classes
    SeqOps
  25. def containsSlice[B >: Int](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  26. def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  27. def copyToArray[B >: Int](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  28. def copyToArray[B >: Int](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  29. def corresponds[B](that: Seq[B])(p: (Int, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  30. def corresponds[B](that: IterableOnce[B])(p: (Int, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  31. def count(p: (Int) => Boolean): Int
    Definition Classes
    IterableOnceOps
  32. def diff[B >: Int](that: Seq[B]): IntArrayStack
    Definition Classes
    SeqOps
  33. def distinct: IntArrayStack
    Definition Classes
    SeqOps
  34. def distinctBy[B](f: (Int) => B): IntArrayStack
    Definition Classes
    SeqOps
  35. def drop(n: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  36. def dropRight(n: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps
  37. def dropWhile(p: (Int) => Boolean): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  38. def elementWise: ElementWiseExtractor[Int, Int]
    Definition Classes
    PartialFunction
  39. def empty: IntArrayStack
    Definition Classes
    IntArrayStack → IterableFactoryDefaults → IterableOps
  40. def endsWith[B >: Int](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  41. def equals(o: Any): Boolean
    Definition Classes
    Seq → Equals → AnyRef → Any
  42. def exists(p: (Int) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  43. def filter(pred: (Int) => Boolean): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  44. def filterNot(pred: (Int) => Boolean): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  45. def find(p: (Int) => Boolean): Option[Int]
    Definition Classes
    IterableOnceOps
  46. def findLast(p: (Int) => Boolean): Option[Int]
    Definition Classes
    SeqOps
  47. def flatMap[B](f: (Int) => IterableOnce[B]): Stack[B]
    Definition Classes
    IterableOps → IterableOnceOps
  48. def flatten[B](implicit asIterable: (Int) => IterableOnce[B]): Stack[B]
    Definition Classes
    IterableOps → IterableOnceOps
  49. def fold[A1 >: Int](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  50. def foldLeft[B](z: B)(f: (B, Int) => B): B
    Definition Classes
    IntArrayStack → IterableOnceOps
  51. def foldRight[B](z: B)(op: (Int, B) => B): B
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  52. def forall(p: (Int) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  53. def foreach[U](f: (Int) => U): Unit
    Definition Classes
    IntArrayStack → IterableOnceOps
  54. def foreachReverse[U](f: (Int) => U): Unit
  55. def fromSpecific(coll: IterableOnce[Int]): IntArrayStack
    Definition Classes
    IntArrayStack → IterableFactoryDefaults → IterableOps
  56. def groupBy[K](f: (Int) => K): Map[K, IntArrayStack]
    Definition Classes
    IterableOps
  57. def groupMap[K, B](key: (Int) => K)(f: (Int) => B): Map[K, Stack[B]]
    Definition Classes
    IterableOps
  58. def groupMapReduce[K, B](key: (Int) => K)(f: (Int) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  59. def grouped(size: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  60. def hashCode(): Int
    Definition Classes
    Seq → AnyRef → Any
  61. def head: Int

    Same as top(), but potentially less efficient due to (un)boxing if the head method of the supertype is called.

    Same as top(), but potentially less efficient due to (un)boxing if the head method of the supertype is called.

    Definition Classes
    IntArrayStack → IndexedSeqOps → IterableOps
  62. def headOption: Option[Int]
    Definition Classes
    IndexedSeqOps → IterableOps
  63. def indexOf[B >: Int](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  64. def indexOf[B >: Int](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  65. def indexOfSlice[B >: Int](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  66. def indexOfSlice[B >: Int](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  67. def indexWhere(p: (Int) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  68. def indexWhere(p: (Int) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  69. def indices: Range
    Definition Classes
    SeqOps
  70. def init: IntArrayStack
    Definition Classes
    IterableOps
  71. def inits: Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  72. def intersect[B >: Int](that: Seq[B]): IntArrayStack
    Definition Classes
    SeqOps
  73. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  74. def isEmpty: Boolean
    Definition Classes
    IntArrayStack → SeqOps → IterableOnceOps
  75. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  76. def iterableFactory: SeqFactory[Stack]
    Definition Classes
    IntArrayStack → IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  77. def iterator: IntIterator

    Returns an iterator which produces the values in LIFO order.

    Returns an iterator which produces the values in LIFO order.

    Definition Classes
    IntArrayStack → IndexedSeqOps → IterableOnce
    Note

    The next method will throw an IndexOutOfBoundsException when all elements are already returned.

  78. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  79. def last: Int
    Definition Classes
    IntArrayStack → IndexedSeqOps → IterableOps
  80. def lastIndexOf[B >: Int](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  81. def lastIndexOfSlice[B >: Int](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  82. def lastIndexOfSlice[B >: Int](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  83. def lastIndexWhere(p: (Int) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  84. def lastIndexWhere(p: (Int) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  85. def lastOption: Option[Int]
    Definition Classes
    IterableOps
  86. def lazyZip[B](that: Iterable[B]): LazyZip2[Int, B, IntArrayStack.this.type]
    Definition Classes
    Iterable
  87. def length: Int
    Definition Classes
    IntArrayStack → SeqOps
  88. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  89. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  90. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  91. def lift: (Int) => Option[Int]
    Definition Classes
    PartialFunction
  92. def map[B](f: (Int) => B): Stack[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  93. def mapInPlace(f: (Int) => Int): IntArrayStack.this.type
    Definition Classes
    IndexedSeqOps
  94. def max[B >: Int](implicit ord: Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  95. def maxBy[B](f: (Int) => B)(implicit cmp: Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  96. def maxByOption[B](f: (Int) => B)(implicit cmp: Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  97. def maxOption[B >: Int](implicit ord: Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  98. def min[B >: Int](implicit ord: Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  99. def minBy[B](f: (Int) => B)(implicit cmp: Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  100. def minByOption[B](f: (Int) => B)(implicit cmp: Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  101. def minOption[B >: Int](implicit ord: Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  102. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  103. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  104. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  105. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  106. def orElse[A1 <: Int, B1 >: Int](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  107. def padTo[B >: Int](len: Int, elem: B): Stack[B]
    Definition Classes
    SeqOps
  108. def partition(p: (Int) => Boolean): (IntArrayStack, IntArrayStack)
    Definition Classes
    IterableOps
  109. def partitionMap[A1, A2](f: (Int) => Either[A1, A2]): (Stack[A1], Stack[A2])
    Definition Classes
    IterableOps
  110. def patch[B >: Int](from: Int, other: IterableOnce[B], replaced: Int): Stack[B]
    Definition Classes
    SeqOps
  111. def permutations: Iterator[IntArrayStack]
    Definition Classes
    SeqOps
  112. def pop(): Int

    Returns and removes the top most value from the stack.

    Returns and removes the top most value from the stack.

    Note

    If the stack is empty a NoSuchElementException will be thrown.

  113. def prepended[B >: Int](elem: B): Stack[B]
    Definition Classes
    IndexedSeqOps → SeqOps
  114. def prependedAll[B >: Int](prefix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps
  115. def product[B >: Int](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  116. def push(that: IntArrayStack): Unit

    Pushes the value of the given stack on this stack while maintaining the order in which the values were pushed on the given stack.

    Pushes the value of the given stack on this stack while maintaining the order in which the values were pushed on the given stack. I.e., if this contains the values [1|2-> and the given one the values [3,4-> then the resulting stack will contain the values [1|2|3|4....

    Note

    In case of ++ the order of the values is reversed.

  117. def push(i: Int): Unit
  118. def reduce[B >: Int](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  119. def reduceLeft[B >: Int](op: (B, Int) => B): B
    Definition Classes
    IterableOnceOps
  120. def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]
    Definition Classes
    IterableOnceOps
  121. def reduceOption[B >: Int](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  122. def reduceRight[B >: Int](op: (Int, B) => B): B
    Definition Classes
    IterableOnceOps
  123. def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  124. def reverse: IntArrayStack
    Definition Classes
    IntArrayStack → IndexedSeqOps → SeqOps
  125. def reverseIterator: Iterator[Int]
    Definition Classes
    IndexedSeqOps → SeqOps
  126. def runWith[U](action: (Int) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  127. def sameElements[B >: Int](that: IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  128. def scan[B >: Int](z: B)(op: (B, B) => B): Stack[B]
    Definition Classes
    IterableOps
  129. def scanLeft[B](z: B)(op: (B, Int) => B): Stack[B]
    Definition Classes
    IterableOps → IterableOnceOps
  130. def scanRight[B](z: B)(op: (Int, B) => B): Stack[B]
    Definition Classes
    IterableOps
  131. def search[B >: Int](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  132. def search[B >: Int](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  133. def segmentLength(p: (Int) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  134. final def segmentLength(p: (Int) => Boolean): Int
    Definition Classes
    SeqOps
  135. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  136. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  137. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  138. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  139. def slice(from: Int, until: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  140. def sliding(size: Int, step: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  141. def sliding(size: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  142. def sortBy[B](f: (Int) => B)(implicit ord: Ordering[B]): IntArrayStack
    Definition Classes
    SeqOps
  143. def sortInPlace[B >: Int]()(implicit ord: Ordering[B]): IntArrayStack.this.type
    Definition Classes
    IndexedSeqOps
  144. def sortInPlaceBy[B](f: (Int) => B)(implicit ord: Ordering[B]): IntArrayStack.this.type
    Definition Classes
    IndexedSeqOps
  145. def sortInPlaceWith(lt: (Int, Int) => Boolean): IntArrayStack.this.type
    Definition Classes
    IndexedSeqOps
  146. def sortWith(lt: (Int, Int) => Boolean): IntArrayStack
    Definition Classes
    SeqOps
  147. def sorted[B >: Int](implicit ord: Ordering[B]): IntArrayStack
    Definition Classes
    SeqOps
  148. def span(p: (Int) => Boolean): (IntArrayStack, IntArrayStack)
    Definition Classes
    IterableOps → IterableOnceOps
  149. def splitAt(n: Int): (IntArrayStack, IntArrayStack)
    Definition Classes
    IterableOps → IterableOnceOps
  150. def startsWith[B >: Int](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  151. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  152. def sum[B >: Int](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  153. def tail: IntArrayStack
    Definition Classes
    IterableOps
  154. def tails: Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  155. def take(n: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  156. def takeRight(n: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps
  157. def takeWhile(p: (Int) => Boolean): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  158. def tapEach[U](f: (Int) => U): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  159. def to[C1](factory: Factory[Int, C1]): C1
    Definition Classes
    IterableOnceOps
  160. def toArray: Array[Int]
  161. def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  162. final def toBuffer[B >: Int]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  163. def toIndexedSeq: IndexedSeq[Int]
    Definition Classes
    IterableOnceOps
  164. def toList: List[Int]
    Definition Classes
    IterableOnceOps
  165. def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  166. def toSeq: Seq[Int]
    Definition Classes
    IterableOnceOps
  167. def toSet[B >: Int]: Set[B]
    Definition Classes
    IterableOnceOps
  168. def toString(): String
    Definition Classes
    IntArrayStack → Seq → Function1 → Iterable → AnyRef → Any
  169. def toVector: Vector[Int]
    Definition Classes
    IterableOnceOps
  170. def top(): Int

    Returns the stack's top-most value.

    Returns the stack's top-most value.

    Note

    If the stack is empty a NoSuchElementException will be thrown.

  171. def transpose[B](implicit asIterable: (Int) => Iterable[B]): Stack[Stack[B]]
    Definition Classes
    IterableOps
  172. def unapply(a: Int): Option[Int]
    Definition Classes
    PartialFunction
  173. def unzip[A1, A2](implicit asPair: (Int) => (A1, A2)): (Stack[A1], Stack[A2])
    Definition Classes
    IterableOps
  174. def unzip3[A1, A2, A3](implicit asTriple: (Int) => (A1, A2, A3)): (Stack[A1], Stack[A2], Stack[A3])
    Definition Classes
    IterableOps
  175. def update(index: Int, v: Int): Unit
    Definition Classes
    IntArrayStack → SeqOps
  176. def updated[B >: Int](index: Int, elem: B): Stack[B]
    Definition Classes
    SeqOps
  177. def view: IndexedSeqView[Int]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  178. def withFilter(p: (Int) => Boolean): WithFilter[Int, [_]Stack[_]]
    Definition Classes
    IterableOps
  179. def zip[B](that: IterableOnce[B]): Stack[(Int, B)]
    Definition Classes
    IterableOps
  180. def zipAll[A1 >: Int, B](that: Iterable[B], thisElem: A1, thatElem: B): Stack[(A1, B)]
    Definition Classes
    IterableOps
  181. def zipWithIndex: Stack[(Int, Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, Int) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: (Int, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. def aggregate[B](z: => B)(seqop: (B, Int) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  4. def companion: IterableFactory[[_]Stack[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  5. final def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  6. 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)

  7. final def prefixLength(p: (Int) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  8. final def repr: IntArrayStack
    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

  9. def reverseMap[B](f: (Int) => B): Stack[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  10. def seq: IntArrayStack.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  11. final def toIterable: IntArrayStack.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 or toSeq, but it doesn't copy non-immutable collections

  12. final def toIterator: Iterator[Int]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  13. final def toStream: Stream[Int]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  14. final def toTraversable: Traversable[Int]
    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 or toSeq, but it doesn't copy non-immutable collections

  15. final def transform(f: (Int) => Int): IntArrayStack.this.type
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use mapInPlace on an IndexedSeq instead

  16. final def union[B >: Int](that: Seq[B]): Stack[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  17. def view(from: Int, until: Int): IndexedSeqView[Int]
    Definition Classes
    IndexedSeqOps → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)