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 RefArrayStack[N >: Null <: AnyRef] extends IndexedSeq[N] with IndexedSeqLike[N, RefArrayStack[N]] with Cloneable[RefArrayStack[N]] with Serializable

An array based implementation of a mutable stack of ref 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
RefArrayStack[N]
Note

This stack generally keeps all references and is only intended to be used to store elements that outlive the stack. Otherwise, garbage collection may be prevented.

Linear Supertypes
Serializable, Serializable, IndexedSeq[N], IndexedSeqLike[N, RefArrayStack[N]], IndexedSeq[N], IndexedSeqLike[N, RefArrayStack[N]], Seq[N], SeqLike[N, Seq[N]], Cloneable[RefArrayStack[N]], Cloneable, Cloneable, Seq[N], SeqLike[N, RefArrayStack[N]], GenSeq[N], GenSeqLike[N, RefArrayStack[N]], PartialFunction[Int, N], (Int) ⇒ N, Iterable[N], Iterable[N], IterableLike[N, RefArrayStack[N]], Equals, GenIterable[N], GenIterableLike[N, RefArrayStack[N]], Traversable[N], Mutable, Traversable[N], GenTraversable[N], GenericTraversableTemplate[N, IndexedSeq], TraversableLike[N, RefArrayStack[N]], GenTraversableLike[N, RefArrayStack[N]], Parallelizable[N, ParSeq[N]], TraversableOnce[N], GenTraversableOnce[N], FilterMonadic[N, RefArrayStack[N]], HasNewBuilder[N, RefArrayStack[N]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RefArrayStack
  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 RefArrayStack(e: N, initialSize: Int)
  2. new RefArrayStack(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 = RefArrayStack[N]
    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 >: N, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: N, That](that: Traversable[B])(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: N, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    TraversableLike
  6. final def ++=(is: TraversableOnce[N]): RefArrayStack.this.type
  7. def +:[B >: N, That](elem: B)(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  8. final def +=(i: N): RefArrayStack.this.type

    The same as push but additionally returns this.

  9. def /:[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. def :+[B >: N, That](elem: B)(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  11. def :\[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  12. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  16. def aggregate[B](z: ⇒ B)(seqop: (B, N) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. def andThen[C](k: (N) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  18. def apply(index: Int): N

    Returns the n-th value of the stack; where n = 0 identifies the top level value!

    Returns the n-th value of the stack; where n = 0 identifies the top level value!

    Definition Classes
    RefArrayStack → SeqLike → GenSeqLike → Function1
  19. def applyOrElse[A1 <: Int, B1 >: N](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  20. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  21. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  22. def clone(): RefArrayStack[N]
    Definition Classes
    RefArrayStack → Cloneable → AnyRef
  23. def collect[B, That](pf: PartialFunction[N, B])(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  24. def collectFirst[B](pf: PartialFunction[N, B]): Option[B]
    Definition Classes
    TraversableOnce
  25. def combinations(n: Int): Iterator[RefArrayStack[N]]
    Definition Classes
    SeqLike
  26. def companion: GenericCompanion[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  27. def compose[A](g: (A) ⇒ Int): (A) ⇒ N
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def contains[A1 >: N](elem: A1): Boolean
    Definition Classes
    SeqLike
  29. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  30. def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: N](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: N](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: N](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  34. def corresponds[B](that: GenSeq[B])(p: (N, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  35. def count(p: (N) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def diff[B >: N](that: GenSeq[B]): RefArrayStack[N]
    Definition Classes
    SeqLike → GenSeqLike
  37. def distinct: RefArrayStack[N]
    Definition Classes
    SeqLike → GenSeqLike
  38. def drop(n: Int): RefArrayStack[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  39. def dropRight(n: Int): RefArrayStack[N]
    Definition Classes
    IterableLike
  40. def dropWhile(p: (N) ⇒ Boolean): RefArrayStack[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  42. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  43. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  44. def exists(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  45. def filter(p: (N) ⇒ Boolean): RefArrayStack[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  46. def filterNot(p: (N) ⇒ Boolean): RefArrayStack[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  47. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  48. def find(p: (N) ⇒ Boolean): Option[N]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  49. def flatMap[B, That](f: (N) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  50. def flatten[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
    Definition Classes
    GenericTraversableTemplate
  51. def fold[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def foldLeft[B](z: B)(f: (B, N) ⇒ B): B
    Definition Classes
    RefArrayStack → TraversableOnce → GenTraversableOnce
  53. def foldRight[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  54. def forall(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  55. def foreach[U](f: (N) ⇒ U): Unit
    Definition Classes
    RefArrayStack → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  56. def fromBottom(index: Int): N

    Returns the n-th value of the stack; where n = 0 identifies the bottom value!

  57. def genericBuilder[B]: Builder[B, IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
  58. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  59. def groupBy[K](f: (N) ⇒ K): Map[K, RefArrayStack[N]]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def grouped(size: Int): Iterator[RefArrayStack[N]]
    Definition Classes
    IterableLike
  61. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  62. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  63. def head: N

    Same as top.

    Same as top.

    Definition Classes
    RefArrayStack → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  64. def headOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def indexOf[B >: N](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  66. def indexOf[B >: N](elem: B): Int
    Definition Classes
    GenSeqLike
  67. def indexOfSlice[B >: N](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  68. def indexOfSlice[B >: N](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  69. def indexWhere(p: (N) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  70. def indexWhere(p: (N) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  71. def indices: Range
    Definition Classes
    SeqLike
  72. def init: RefArrayStack[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def inits: Iterator[RefArrayStack[N]]
    Definition Classes
    TraversableLike
  74. def intersect[B >: N](that: GenSeq[B]): RefArrayStack[N]
    Definition Classes
    SeqLike → GenSeqLike
  75. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  76. def isEmpty: Boolean
    Definition Classes
    RefArrayStack → SeqLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
  77. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  78. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  79. def iterator: RefIterator[N]

    Returns an iterator which produces the values in LIFO order.

    Returns an iterator which produces the values in LIFO order.

    Definition Classes
    RefArrayStack → IndexedSeqLike → IterableLike → GenIterableLike
    Note

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

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

    See also

    top

  111. def permutations: Iterator[RefArrayStack[N]]
    Definition Classes
    SeqLike
  112. def pop(): N

    Returns and virtually removes the top most value from the stack.

    Returns and virtually removes the top most value from the stack.

    Note

    If the stack is empty a NoSuchElementException will be thrown.

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

  116. def push(i: N): Unit
  117. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def reduceLeft[B >: N](op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce
  119. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def reduceRight[B >: N](op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  122. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def repr: RefArrayStack[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def resetSize(): Unit

    Resets the size of the stack, but does not clear the underlying array; hence, the stack may prevent the garbage collection of the still referenced values.

    Resets the size of the stack, but does not clear the underlying array; hence, the stack may prevent the garbage collection of the still referenced values. This is generally not a problem, if the stack is only used locally and the referenced objects outlive the lifetime of the stack!

  125. def reverse: RefArrayStack[N]
    Definition Classes
    SeqLike → GenSeqLike
  126. def reverseIterator: Iterator[N]
    Definition Classes
    SeqLike
  127. def reverseMap[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  128. def reversed: List[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  129. def runWith[U](action: (N) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  130. def sameElements[B >: N](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  131. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[RefArrayStack[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def scanRight[B, That](z: B)(op: (N, B) ⇒ B)(implicit bf: CanBuildFrom[RefArrayStack[N], 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.

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

    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.

  173. def transform(f: (N) ⇒ N): RefArrayStack.this.type
    Definition Classes
    SeqLike
  174. def transpose[B](implicit asTraversable: (N) ⇒ 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.

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

Inherited from Serializable

Inherited from Serializable

Inherited from IndexedSeq[N]

Inherited from IndexedSeqLike[N, RefArrayStack[N]]

Inherited from IndexedSeq[N]

Inherited from IndexedSeqLike[N, RefArrayStack[N]]

Inherited from Seq[N]

Inherited from SeqLike[N, Seq[N]]

Inherited from Cloneable[RefArrayStack[N]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Seq[N]

Inherited from SeqLike[N, RefArrayStack[N]]

Inherited from GenSeq[N]

Inherited from GenSeqLike[N, RefArrayStack[N]]

Inherited from PartialFunction[Int, N]

Inherited from (Int) ⇒ N

Inherited from Iterable[N]

Inherited from Iterable[N]

Inherited from IterableLike[N, RefArrayStack[N]]

Inherited from Equals

Inherited from GenIterable[N]

Inherited from GenIterableLike[N, RefArrayStack[N]]

Inherited from Traversable[N]

Inherited from Mutable

Inherited from Traversable[N]

Inherited from GenTraversable[N]

Inherited from GenericTraversableTemplate[N, IndexedSeq]

Inherited from TraversableLike[N, RefArrayStack[N]]

Inherited from GenTraversableLike[N, RefArrayStack[N]]

Inherited from Parallelizable[N, ParSeq[N]]

Inherited from TraversableOnce[N]

Inherited from GenTraversableOnce[N]

Inherited from FilterMonadic[N, RefArrayStack[N]]

Inherited from HasNewBuilder[N, RefArrayStack[N]]

Inherited from AnyRef

Inherited from Any

Ungrouped