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 !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: Int](suffix: IterableOnce[B]): Stack[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  4. final def ++:[B >: Int](prefix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  5. final def +:[B >: Int](elem: B): Stack[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  6. def +=(i: Int): IntArrayStack.this.type

    The same as push but additionally returns this.

  7. final def :+[B >: Int](elem: B): Stack[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def :++[B >: Int](suffix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  9. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  11. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  12. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    IterableOnceOps
  13. def andThen[C](k: PartialFunction[Int, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  14. def andThen[C](k: (Int) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  15. def appended[B >: Int](elem: B): Stack[B]
    Definition Classes
    SeqOps
  16. def appendedAll[B >: Int](suffix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps
  17. def apply(index: Int): Int
    Definition Classes
    IntArrayStack → SeqOps → Function1
  18. def applyOrElse[A1 <: Int, B1 >: Int](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def canEqual(that: Any): Boolean
    Definition Classes
    Seq → Equals
  21. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  22. def clone(): IntArrayStack
    Definition Classes
    IntArrayStack → SeqOps → Cloneable → AnyRef
  23. final def coll: IntArrayStack.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  24. def collect[B](pf: PartialFunction[Int, B]): Stack[B]
    Definition Classes
    IterableOps → IterableOnceOps
  25. def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
    Definition Classes
    IterableOnceOps
  26. def combinations(n: Int): Iterator[IntArrayStack]
    Definition Classes
    SeqOps
  27. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Int]
    Definition Classes
    PartialFunction
  28. def compose[A](g: (A) => Int): (A) => Int
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  29. final def concat[B >: Int](suffix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  30. def contains[A1 >: Int](elem: A1): Boolean
    Definition Classes
    SeqOps
  31. def containsSlice[B >: Int](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  32. def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  33. def copyToArray[B >: Int](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  34. def copyToArray[B >: Int](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  35. def corresponds[B](that: Seq[B])(p: (Int, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  36. def corresponds[B](that: IterableOnce[B])(p: (Int, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  37. def count(p: (Int) => Boolean): Int
    Definition Classes
    IterableOnceOps
  38. def diff[B >: Int](that: Seq[B]): IntArrayStack
    Definition Classes
    SeqOps
  39. def distinct: IntArrayStack
    Definition Classes
    SeqOps
  40. def distinctBy[B](f: (Int) => B): IntArrayStack
    Definition Classes
    SeqOps
  41. def drop(n: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  42. def dropRight(n: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps
  43. def dropWhile(p: (Int) => Boolean): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  44. def elementWise: ElementWiseExtractor[Int, Int]
    Definition Classes
    PartialFunction
  45. def empty: IntArrayStack
    Definition Classes
    IntArrayStack → IterableFactoryDefaults → IterableOps
  46. def endsWith[B >: Int](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  47. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  48. def equals(o: Any): Boolean
    Definition Classes
    Seq → Equals → AnyRef → Any
  49. def exists(p: (Int) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  50. def filter(pred: (Int) => Boolean): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  51. def filterNot(pred: (Int) => Boolean): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  52. def find(p: (Int) => Boolean): Option[Int]
    Definition Classes
    IterableOnceOps
  53. def findLast(p: (Int) => Boolean): Option[Int]
    Definition Classes
    SeqOps
  54. def flatMap[B](f: (Int) => IterableOnce[B]): Stack[B]
    Definition Classes
    IterableOps → IterableOnceOps
  55. def flatten[B](implicit asIterable: (Int) => IterableOnce[B]): Stack[B]
    Definition Classes
    IterableOps → IterableOnceOps
  56. def fold[A1 >: Int](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  57. def foldLeft[B](z: B)(f: (B, Int) => B): B
    Definition Classes
    IntArrayStack → IterableOnceOps
  58. def foldRight[B](z: B)(op: (Int, B) => B): B
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  59. def forall(p: (Int) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  60. def foreach[U](f: (Int) => U): Unit
    Definition Classes
    IntArrayStack → IterableOnceOps
  61. def foreachReverse[U](f: (Int) => U): Unit
  62. def fromSpecific(coll: IterableOnce[Int]): IntArrayStack
    Definition Classes
    IntArrayStack → IterableFactoryDefaults → IterableOps
  63. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  64. def groupBy[K](f: (Int) => K): Map[K, IntArrayStack]
    Definition Classes
    IterableOps
  65. def groupMap[K, B](key: (Int) => K)(f: (Int) => B): Map[K, Stack[B]]
    Definition Classes
    IterableOps
  66. def groupMapReduce[K, B](key: (Int) => K)(f: (Int) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  67. def grouped(size: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  68. def hashCode(): Int
    Definition Classes
    Seq → AnyRef → Any
  69. 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
  70. def headOption: Option[Int]
    Definition Classes
    IndexedSeqOps → IterableOps
  71. def indexOf[B >: Int](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  72. def indexOf[B >: Int](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  73. def indexOfSlice[B >: Int](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  74. def indexOfSlice[B >: Int](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  75. def indexWhere(p: (Int) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  76. def indexWhere(p: (Int) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  77. def indices: Range
    Definition Classes
    SeqOps
  78. def init: IntArrayStack
    Definition Classes
    IterableOps
  79. def inits: Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  80. def intersect[B >: Int](that: Seq[B]): IntArrayStack
    Definition Classes
    SeqOps
  81. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  82. def isEmpty: Boolean
    Definition Classes
    IntArrayStack → SeqOps → IterableOnceOps
  83. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  84. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  85. def iterableFactory: SeqFactory[Stack]
    Definition Classes
    IntArrayStack → IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  86. 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.

  87. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  88. def last: Int
    Definition Classes
    IntArrayStack → IndexedSeqOps → IterableOps
  89. def lastIndexOf[B >: Int](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  90. def lastIndexOfSlice[B >: Int](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  91. def lastIndexOfSlice[B >: Int](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  92. def lastIndexWhere(p: (Int) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  93. def lastIndexWhere(p: (Int) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  94. def lastOption: Option[Int]
    Definition Classes
    IterableOps
  95. def lazyZip[B](that: Iterable[B]): LazyZip2[Int, B, IntArrayStack.this.type]
    Definition Classes
    Iterable
  96. def length: Int
    Definition Classes
    IntArrayStack → SeqOps
  97. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  98. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  99. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  100. def lift: (Int) => Option[Int]
    Definition Classes
    PartialFunction
  101. def map[B](f: (Int) => B): Stack[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  102. def mapInPlace(f: (Int) => Int): IntArrayStack.this.type
    Definition Classes
    IndexedSeqOps
  103. def max[B >: Int](implicit ord: Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  104. def maxBy[B](f: (Int) => B)(implicit cmp: Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  105. def maxByOption[B](f: (Int) => B)(implicit cmp: Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  106. def maxOption[B >: Int](implicit ord: Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  107. def min[B >: Int](implicit ord: Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  108. def minBy[B](f: (Int) => B)(implicit cmp: Ordering[B]): Int
    Definition Classes
    IterableOnceOps
  109. def minByOption[B](f: (Int) => B)(implicit cmp: Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  110. def minOption[B >: Int](implicit ord: Ordering[B]): Option[Int]
    Definition Classes
    IterableOnceOps
  111. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  112. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  113. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  114. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  115. def newSpecificBuilder: Builder[Int, IntArrayStack]
    Attributes
    protected
    Definition Classes
    IntArrayStack → IterableFactoryDefaults → IterableOps
  116. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  117. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  118. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  119. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[scala.collection]
    Definition Classes
    SeqOps
  120. def orElse[A1 <: Int, B1 >: Int](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  121. def padTo[B >: Int](len: Int, elem: B): Stack[B]
    Definition Classes
    SeqOps
  122. def partition(p: (Int) => Boolean): (IntArrayStack, IntArrayStack)
    Definition Classes
    IterableOps
  123. def partitionMap[A1, A2](f: (Int) => Either[A1, A2]): (Stack[A1], Stack[A2])
    Definition Classes
    IterableOps
  124. def patch[B >: Int](from: Int, other: IterableOnce[B], replaced: Int): Stack[B]
    Definition Classes
    SeqOps
  125. def permutations: Iterator[IntArrayStack]
    Definition Classes
    SeqOps
  126. 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.

  127. def prepended[B >: Int](elem: B): Stack[B]
    Definition Classes
    IndexedSeqOps → SeqOps
  128. def prependedAll[B >: Int](prefix: IterableOnce[B]): Stack[B]
    Definition Classes
    SeqOps
  129. def product[B >: Int](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  130. 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.

  131. def push(i: Int): Unit
  132. def reduce[B >: Int](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  133. def reduceLeft[B >: Int](op: (B, Int) => B): B
    Definition Classes
    IterableOnceOps
  134. def reduceLeftOption[B >: Int](op: (B, Int) => B): Option[B]
    Definition Classes
    IterableOnceOps
  135. def reduceOption[B >: Int](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  136. def reduceRight[B >: Int](op: (Int, B) => B): B
    Definition Classes
    IterableOnceOps
  137. def reduceRightOption[B >: Int](op: (Int, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  138. def reverse: IntArrayStack
    Definition Classes
    IntArrayStack → IndexedSeqOps → SeqOps
  139. def reverseIterator: Iterator[Int]
    Definition Classes
    IndexedSeqOps → SeqOps
  140. def reversed: Iterable[Int]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  141. def runWith[U](action: (Int) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  142. def sameElements[B >: Int](that: IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  143. def scan[B >: Int](z: B)(op: (B, B) => B): Stack[B]
    Definition Classes
    IterableOps
  144. def scanLeft[B](z: B)(op: (B, Int) => B): Stack[B]
    Definition Classes
    IterableOps → IterableOnceOps
  145. def scanRight[B](z: B)(op: (Int, B) => B): Stack[B]
    Definition Classes
    IterableOps
  146. def search[B >: Int](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  147. def search[B >: Int](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  148. def segmentLength(p: (Int) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  149. final def segmentLength(p: (Int) => Boolean): Int
    Definition Classes
    SeqOps
  150. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  151. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  152. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  153. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  154. def slice(from: Int, until: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  155. def sliding(size: Int, step: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  156. def sliding(size: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  157. def sortBy[B](f: (Int) => B)(implicit ord: Ordering[B]): IntArrayStack
    Definition Classes
    SeqOps
  158. def sortInPlace[B >: Int]()(implicit ord: Ordering[B]): IntArrayStack.this.type
    Definition Classes
    IndexedSeqOps
  159. def sortInPlaceBy[B](f: (Int) => B)(implicit ord: Ordering[B]): IntArrayStack.this.type
    Definition Classes
    IndexedSeqOps
  160. def sortInPlaceWith(lt: (Int, Int) => Boolean): IntArrayStack.this.type
    Definition Classes
    IndexedSeqOps
  161. def sortWith(lt: (Int, Int) => Boolean): IntArrayStack
    Definition Classes
    SeqOps
  162. def sorted[B >: Int](implicit ord: Ordering[B]): IntArrayStack
    Definition Classes
    SeqOps
  163. def span(p: (Int) => Boolean): (IntArrayStack, IntArrayStack)
    Definition Classes
    IterableOps → IterableOnceOps
  164. def splitAt(n: Int): (IntArrayStack, IntArrayStack)
    Definition Classes
    IterableOps → IterableOnceOps
  165. def startsWith[B >: Int](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  166. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Int, S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  167. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  168. def sum[B >: Int](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  169. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  170. def tail: IntArrayStack
    Definition Classes
    IterableOps
  171. def tails: Iterator[IntArrayStack]
    Definition Classes
    IterableOps
  172. def take(n: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  173. def takeRight(n: Int): IntArrayStack
    Definition Classes
    IndexedSeqOps → IterableOps
  174. def takeWhile(p: (Int) => Boolean): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  175. def tapEach[U](f: (Int) => U): IntArrayStack
    Definition Classes
    IterableOps → IterableOnceOps
  176. def to[C1](factory: Factory[Int, C1]): C1
    Definition Classes
    IterableOnceOps
  177. def toArray: Array[Int]
  178. def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  179. final def toBuffer[B >: Int]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  180. def toIndexedSeq: IndexedSeq[Int]
    Definition Classes
    IterableOnceOps
  181. def toList: List[Int]
    Definition Classes
    IterableOnceOps
  182. def toMap[K, V](implicit ev: <:<[Int, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  183. def toSeq: Seq[Int]
    Definition Classes
    IterableOnceOps
  184. def toSet[B >: Int]: Set[B]
    Definition Classes
    IterableOnceOps
  185. def toString(): String
    Definition Classes
    IntArrayStack → Seq → Function1 → Iterable → AnyRef → Any
  186. def toVector: Vector[Int]
    Definition Classes
    IterableOnceOps
  187. 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.

  188. def transpose[B](implicit asIterable: (Int) => Iterable[B]): Stack[Stack[B]]
    Definition Classes
    IterableOps
  189. def unapply(a: Int): Option[Int]
    Definition Classes
    PartialFunction
  190. def unzip[A1, A2](implicit asPair: (Int) => (A1, A2)): (Stack[A1], Stack[A2])
    Definition Classes
    IterableOps
  191. def unzip3[A1, A2, A3](implicit asTriple: (Int) => (A1, A2, A3)): (Stack[A1], Stack[A2], Stack[A3])
    Definition Classes
    IterableOps
  192. def update(index: Int, v: Int): Unit
    Definition Classes
    IntArrayStack → SeqOps
  193. def updated[B >: Int](index: Int, elem: B): Stack[B]
    Definition Classes
    SeqOps
  194. def view: IndexedSeqView[Int]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  195. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  196. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  197. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  198. def withFilter(p: (Int) => Boolean): WithFilter[Int, [_]Stack[_]]
    Definition Classes
    IterableOps
  199. def zip[B](that: IterableOnce[B]): Stack[(Int, B)]
    Definition Classes
    IterableOps
  200. def zipAll[A1 >: Int, B](that: Iterable[B], thisElem: A1, thatElem: B): Stack[(A1, B)]
    Definition Classes
    IterableOps
  201. 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 finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  7. 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)

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

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  9. 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

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

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

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

  12. 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

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

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

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

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

  15. 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

  16. 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

  17. 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

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

Inherited from Serializable

Inherited from IndexedSeq[Int]

Inherited from IndexedSeqOps[Int, [_]Stack[_], IntArrayStack]

Inherited from IndexedSeq[Int]

Inherited from IndexedSeqOps[Int, [_]Stack[_], IntArrayStack]

Inherited from Seq[Int]

Inherited from SeqOps[Int, [_]Stack[_], IntArrayStack]

Inherited from Cloneable[IntArrayStack]

Inherited from Cloneable

Inherited from Seq[Int]

Inherited from Equals

Inherited from SeqOps[Int, [_]Stack[_], IntArrayStack]

Inherited from PartialFunction[Int, Int]

Inherited from (Int) => Int

Inherited from Iterable[Int]

Inherited from Iterable[Int]

Inherited from IterableFactoryDefaults[Int, [x]IndexedSeq[x]]

Inherited from IterableOps[Int, [_]Stack[_], IntArrayStack]

Inherited from IterableOnceOps[Int, [_]Stack[_], IntArrayStack]

Inherited from IterableOnce[Int]

Inherited from AnyRef

Inherited from Any

Ungrouped