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
  • IntAppendChain
  • IntArrayStack
  • IntQueue
  • RefAccumulator
  • RefAppendChain
  • RefArrayBuffer
  • RefArrayStack

final class IntArrayStack extends IndexedSeq[Int] with IndexedSeqLike[Int, 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
Linear Supertypes
Serializable, Serializable, IndexedSeq[Int], IndexedSeqLike[Int, IntArrayStack], IndexedSeq[Int], IndexedSeqLike[Int, IntArrayStack], Seq[Int], SeqLike[Int, Seq[Int]], Cloneable[IntArrayStack], Cloneable, Cloneable, Seq[Int], SeqLike[Int, IntArrayStack], GenSeq[Int], GenSeqLike[Int, IntArrayStack], PartialFunction[Int, Int], (Int) ⇒ Int, Iterable[Int], Iterable[Int], IterableLike[Int, IntArrayStack], Equals, GenIterable[Int], GenIterableLike[Int, IntArrayStack], Traversable[Int], Mutable, Traversable[Int], GenTraversable[Int], GenericTraversableTemplate[Int, IndexedSeq], TraversableLike[Int, IntArrayStack], GenTraversableLike[Int, IntArrayStack], Parallelizable[Int, ParSeq[Int]], TraversableOnce[Int], GenTraversableOnce[Int], FilterMonadic[Int, IntArrayStack], HasNewBuilder[Int, IntArrayStack], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IntArrayStack
  2. Serializable
  3. Serializable
  4. IndexedSeq
  5. IndexedSeqLike
  6. IndexedSeq
  7. IndexedSeqLike
  8. Seq
  9. SeqLike
  10. Cloneable
  11. Cloneable
  12. Cloneable
  13. Seq
  14. SeqLike
  15. GenSeq
  16. GenSeqLike
  17. PartialFunction
  18. Function1
  19. Iterable
  20. Iterable
  21. IterableLike
  22. Equals
  23. GenIterable
  24. GenIterableLike
  25. Traversable
  26. Mutable
  27. Traversable
  28. GenTraversable
  29. GenericTraversableTemplate
  30. TraversableLike
  31. GenTraversableLike
  32. Parallelizable
  33. TraversableOnce
  34. GenTraversableOnce
  35. FilterMonadic
  36. HasNewBuilder
  37. AnyRef
  38. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IntArrayStack(initialSize: Int = 4)

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = IntArrayStack
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: Int, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: Int, That](that: Traversable[B])(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: Int, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike
  6. def +:[B >: Int, That](elem: B)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  7. def +=(i: Int): IntArrayStack.this.type

    The same as push but additionally returns this.

  8. def /:[B](z: B)(op: (B, Int) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :+[B >: Int, That](elem: B)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  10. def :\[B](z: B)(op: (Int, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  11. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  15. def aggregate[B](z: ⇒ B)(seqop: (B, Int) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. def andThen[C](k: (Int) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  17. def apply(index: Int): Int
    Definition Classes
    IntArrayStack → SeqLike → GenSeqLike → 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
    IterableLike → Equals
  21. def clone(): IntArrayStack
    Definition Classes
    IntArrayStack → Cloneable → AnyRef
  22. def collect[B, That](pf: PartialFunction[Int, B])(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  23. def collectFirst[B](pf: PartialFunction[Int, B]): Option[B]
    Definition Classes
    TraversableOnce
  24. def combinations(n: Int): Iterator[IntArrayStack]
    Definition Classes
    SeqLike
  25. def companion: GenericCompanion[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  26. def compose[A](g: (A) ⇒ Int): (A) ⇒ Int
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  27. def contains[A1 >: Int](elem: A1): Boolean
    Definition Classes
    SeqLike
  28. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  29. def copyToArray[B >: Int](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  30. def copyToArray[B >: Int](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: Int](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToBuffer[B >: Int](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  33. def corresponds[B](that: GenSeq[B])(p: (Int, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  34. def count(p: (Int) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. def diff[B >: Int](that: GenSeq[B]): IntArrayStack
    Definition Classes
    SeqLike → GenSeqLike
  36. def distinct: IntArrayStack
    Definition Classes
    SeqLike → GenSeqLike
  37. def drop(n: Int): IntArrayStack
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  38. def dropRight(n: Int): IntArrayStack
    Definition Classes
    IterableLike
  39. def dropWhile(p: (Int) ⇒ Boolean): IntArrayStack
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  41. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  43. def exists(p: (Int) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  44. def filter(p: (Int) ⇒ Boolean): IntArrayStack
    Definition Classes
    TraversableLike → GenTraversableLike
  45. def filterNot(p: (Int) ⇒ Boolean): IntArrayStack
    Definition Classes
    TraversableLike → GenTraversableLike
  46. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  47. def find(p: (Int) ⇒ Boolean): Option[Int]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. def flatMap[B, That](f: (Int) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  49. def flatten[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
    Definition Classes
    GenericTraversableTemplate
  50. def fold[A1 >: Int](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def foldLeft[B](z: B)(f: (B, Int) ⇒ B): B
    Definition Classes
    IntArrayStack → TraversableOnce → GenTraversableOnce
  52. def foldRight[B](z: B)(op: (Int, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  53. def forall(p: (Int) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  54. def foreach[U](f: (Int) ⇒ U): Unit
    Definition Classes
    IntArrayStack → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  55. def foreachReverse[U](f: (Int) ⇒ U): Unit
  56. def genericBuilder[B]: Builder[B, IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
  57. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  58. def groupBy[K](f: (Int) ⇒ K): Map[K, IntArrayStack]
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def grouped(size: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableLike
  60. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  61. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  62. 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 → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  63. def headOption: Option[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def indexOf[B >: Int](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  65. def indexOf[B >: Int](elem: B): Int
    Definition Classes
    GenSeqLike
  66. def indexOfSlice[B >: Int](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  67. def indexOfSlice[B >: Int](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  68. def indexWhere(p: (Int) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  69. def indexWhere(p: (Int) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  70. def indices: Range
    Definition Classes
    SeqLike
  71. def init: IntArrayStack
    Definition Classes
    TraversableLike → GenTraversableLike
  72. def inits: Iterator[IntArrayStack]
    Definition Classes
    TraversableLike
  73. def intersect[B >: Int](that: GenSeq[B]): IntArrayStack
    Definition Classes
    SeqLike → GenSeqLike
  74. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  75. def isEmpty: Boolean
    Definition Classes
    IntArrayStack → SeqLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
  76. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  77. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  78. 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 → IndexedSeqLike → IterableLike → GenIterableLike
    Note

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

  79. def last: Int
    Definition Classes
    IntArrayStack → TraversableLike → GenTraversableLike
  80. def lastIndexOf[B >: Int](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  81. def lastIndexOf[B >: Int](elem: B): Int
    Definition Classes
    GenSeqLike
  82. def lastIndexOfSlice[B >: Int](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  83. def lastIndexOfSlice[B >: Int](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  84. def lastIndexWhere(p: (Int) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  85. def lastIndexWhere(p: (Int) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  86. def lastOption: Option[Int]
    Definition Classes
    TraversableLike → GenTraversableLike
  87. def length: Int
    Definition Classes
    IntArrayStack → SeqLike → GenSeqLike
  88. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  89. def lift: (Int) ⇒ Option[Int]
    Definition Classes
    PartialFunction
  90. def map[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  91. def max[B >: Int](implicit cmp: Ordering[B]): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def maxBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def min[B >: Int](implicit cmp: Ordering[B]): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def minBy[B](f: (Int) ⇒ B)(implicit cmp: Ordering[B]): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  99. def newBuilder: Builder[Int, IntArrayStack]
    Definition Classes
    IntArrayStack → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  100. def nonEmpty: Boolean
    Definition Classes
    IntArrayStack → TraversableOnce → GenTraversableOnce
  101. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  102. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  103. def orElse[A1 <: Int, B1 >: Int](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  104. def padTo[B >: Int, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  105. def par: ParSeq[Int]
    Definition Classes
    Parallelizable
  106. def parCombiner: Combiner[Int, ParSeq[Int]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → SeqLike → TraversableLike → Parallelizable
  107. def partition(p: (Int) ⇒ Boolean): (IntArrayStack, IntArrayStack)
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def patch[B >: Int, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  109. def permutations: Iterator[IntArrayStack]
    Definition Classes
    SeqLike
  110. 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.

  111. def prefixLength(p: (Int) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  112. def product[B >: Int](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. 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.

  114. def push(i: Int): Unit
  115. def reduce[A1 >: Int](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduceLeft[B >: Int](op: (B, Int) ⇒ B): B
    Definition Classes
    TraversableOnce
  117. def reduceLeftOption[B >: Int](op: (B, Int) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def reduceOption[A1 >: Int](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def reduceRight[B >: Int](op: (Int, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  120. def reduceRightOption[B >: Int](op: (Int, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def repr: IntArrayStack
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def reverse: IntArrayStack
    Definition Classes
    IntArrayStack → SeqLike → GenSeqLike
  123. def reverseIterator: Iterator[Int]
    Definition Classes
    SeqLike
  124. def reverseMap[B, That](f: (Int) ⇒ B)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  125. def reversed: List[Int]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  126. def runWith[U](action: (Int) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  127. def sameElements[B >: Int](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  128. def scan[B >: Int, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  129. def scanLeft[B, That](z: B)(op: (B, Int) ⇒ B)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def scanRight[B, That](z: B)(op: (Int, B) ⇒ B)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  131. def segmentLength(p: (Int) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  132. def seq: IndexedSeq[Int]
    Definition Classes
    IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  133. def size: Int
    Definition Classes
    IntArrayStack → SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  134. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    IndexedSeqLike → GenTraversableOnce
  135. def slice(from: Int, until: Int): IntArrayStack
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  136. def sliding(size: Int, step: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableLike
  137. def sliding(size: Int): Iterator[IntArrayStack]
    Definition Classes
    IterableLike
  138. def sortBy[B](f: (Int) ⇒ B)(implicit ord: Ordering[B]): IntArrayStack
    Definition Classes
    SeqLike
  139. def sortWith(lt: (Int, Int) ⇒ Boolean): IntArrayStack
    Definition Classes
    SeqLike
  140. def sorted[B >: Int](implicit ord: Ordering[B]): IntArrayStack
    Definition Classes
    SeqLike
  141. def span(p: (Int) ⇒ Boolean): (IntArrayStack, IntArrayStack)
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def splitAt(n: Int): (IntArrayStack, IntArrayStack)
    Definition Classes
    TraversableLike → GenTraversableLike
  143. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  144. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  145. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  146. def sum[B >: Int](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  148. def tail: IntArrayStack
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def tails: Iterator[IntArrayStack]
    Definition Classes
    TraversableLike
  150. def take(n: Int): IntArrayStack
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  151. def takeRight(n: Int): IntArrayStack
    Definition Classes
    IterableLike
  152. def takeWhile(p: (Int) ⇒ Boolean): IntArrayStack
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  153. def thisCollection: IndexedSeq[Int]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  154. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Int, Col[Int]]): Col[Int]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  155. def toArray: Array[Int]
  156. def toArray[B >: Int](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def toBuffer[A1 >: Int]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  158. def toCollection(repr: IntArrayStack): IndexedSeq[Int]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  159. def toIndexedSeq: IndexedSeq[Int]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  160. def toIterable: Iterable[Int]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  161. def toIterator: Iterator[Int]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  162. def toList: List[Int]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def toMap[T, U](implicit ev: <:<[Int, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. def toSeq: Seq[Int]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  165. def toSet[B >: Int]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def toStream: Stream[Int]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  167. def toString(): String
    Definition Classes
    IntArrayStack → SeqLike → Function1 → TraversableLike → AnyRef → Any
  168. def toTraversable: Traversable[Int]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  169. def toVector: Vector[Int]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  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 transform(f: (Int) ⇒ Int): IntArrayStack.this.type
    Definition Classes
    SeqLike
  172. def transpose[B](implicit asTraversable: (Int) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  173. def union[B >: Int, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  174. def unzip[A1, A2](implicit asPair: (Int) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    GenericTraversableTemplate
  175. def unzip3[A1, A2, A3](implicit asTriple: (Int) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    GenericTraversableTemplate
  176. def update(index: Int, v: Int): Unit
    Definition Classes
    IntArrayStack → IndexedSeqLike → SeqLike
  177. def updated[B >: Int, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IntArrayStack, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  178. def view(from: Int, until: Int): IndexedSeqView[Int, IntArrayStack]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  179. def view: IndexedSeqView[Int, IntArrayStack]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  180. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  181. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  182. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  183. def withFilter(p: (Int) ⇒ Boolean): FilterMonadic[Int, IntArrayStack]
    Definition Classes
    TraversableLike → FilterMonadic
  184. def zip[A1 >: Int, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IntArrayStack, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  185. def zipAll[B, A1 >: Int, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IntArrayStack, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  186. def zipWithIndex[A1 >: Int, That](implicit bf: CanBuildFrom[IntArrayStack, (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Inherited from Serializable

Inherited from Serializable

Inherited from IndexedSeq[Int]

Inherited from IndexedSeqLike[Int, IntArrayStack]

Inherited from IndexedSeq[Int]

Inherited from IndexedSeqLike[Int, IntArrayStack]

Inherited from Seq[Int]

Inherited from SeqLike[Int, Seq[Int]]

Inherited from Cloneable[IntArrayStack]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Seq[Int]

Inherited from SeqLike[Int, IntArrayStack]

Inherited from GenSeq[Int]

Inherited from GenSeqLike[Int, IntArrayStack]

Inherited from PartialFunction[Int, Int]

Inherited from (Int) ⇒ Int

Inherited from Iterable[Int]

Inherited from Iterable[Int]

Inherited from IterableLike[Int, IntArrayStack]

Inherited from Equals

Inherited from GenIterable[Int]

Inherited from GenIterableLike[Int, IntArrayStack]

Inherited from Traversable[Int]

Inherited from Mutable

Inherited from Traversable[Int]

Inherited from GenTraversable[Int]

Inherited from GenericTraversableTemplate[Int, IndexedSeq]

Inherited from TraversableLike[Int, IntArrayStack]

Inherited from GenTraversableLike[Int, IntArrayStack]

Inherited from Parallelizable[Int, ParSeq[Int]]

Inherited from TraversableOnce[Int]

Inherited from GenTraversableOnce[Int]

Inherited from FilterMonadic[Int, IntArrayStack]

Inherited from HasNewBuilder[Int, IntArrayStack]

Inherited from AnyRef

Inherited from Any

Ungrouped