com.twitter.util

BoundedStack

class BoundedStack [A] extends Seq[A]

A "stack" with a bounded size. If you push a new element on the top when the stack is full, the oldest element gets dropped off the bottom.

linear super types: Seq[A], SeqLike[A, Seq[A]], Iterable[A], IterableLike[A, Seq[A]], Equals, Traversable[A], GenericTraversableTemplate[A, Seq], TraversableLike[A, Seq[A]], TraversableOnce[A], FilterMonadic[A, Seq[A]], HasNewBuilder[A, Seq[A]], PartialFunction[Int, A], (Int) ⇒ A, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. BoundedStack
  2. Seq
  3. SeqLike
  4. Iterable
  5. IterableLike
  6. Equals
  7. Traversable
  8. GenericTraversableTemplate
  9. TraversableLike
  10. TraversableOnce
  11. FilterMonadic
  12. HasNewBuilder
  13. PartialFunction
  14. Function1
  15. AnyRef
  16. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new BoundedStack (maxSize: Int)(implicit arg0: ClassManifest[A])

Type Members

  1. type Self = Seq[A]

    attributes: protected
    definition classes: TraversableLike

Value Members

  1. def != (arg0: AnyRef) : Boolean

    attributes: final
    definition classes: AnyRef
  2. def != (arg0: Any) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

    false if the receiver object is equivalent to the argument; true otherwise.

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: TraversableLike
  7. def ++= (iter: Iterable[A]) : Unit

    Adds multiple elements, possibly overwriting the oldest elements in the stack.

    Adds multiple elements, possibly overwriting the oldest elements in the stack. If the given iterable contains more elements that this stack can hold, then only the last maxSize elements will end up in the stack.

  8. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: SeqLike
  9. def += (elem: A) : Unit

    Pushes an element, possibly forcing out the oldest element in the stack.

    Pushes an element, possibly forcing out the oldest element in the stack.

  10. def /: [B] (z: B)(op: (B, A) ⇒ B) : B

    definition classes: TraversableOnce
  11. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: SeqLike
  12. def :\ [B] (z: B)(op: (A, B) ⇒ B) : B

    definition classes: TraversableOnce
  13. def == (arg0: AnyRef) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: AnyRef
  14. def == (arg0: Any) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: Any
  15. def addString (b: StringBuilder) : StringBuilder

    definition classes: TraversableOnce
  16. def addString (b: StringBuilder, sep: String) : StringBuilder

    definition classes: TraversableOnce
  17. def addString (b: StringBuilder, start: String, sep: String, end: String) : StringBuilder

    definition classes: TraversableOnce
  18. def andThen [C] (k: (A) ⇒ C) : PartialFunction[Int, C]

    definition classes: PartialFunction → Function1
  19. def apply (i: Int) : A

    Gets the element from the specified index in constant time.

    Gets the element from the specified index in constant time.

    definition classes: BoundedStack → SeqLike → Function1
  20. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  21. def canEqual (that: Any) : Boolean

    definition classes: IterableLike → Equals
  22. def clear () : Unit

  23. def clone () : AnyRef

    This method creates and returns a copy of the receiver object.

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    attributes: protected
    definition classes: AnyRef
  24. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: TraversableLike
  25. def companion : GenericCompanion[Seq]

    definition classes: Seq → Iterable → Traversable → GenericTraversableTemplate
  26. def compose [A] (g: (A) ⇒ Int) : (A) ⇒ A

    definition classes: Function1
  27. def contains (elem: Any) : Boolean

    definition classes: SeqLike
  28. def containsSlice [B] (that: Seq[B]) : Boolean

    definition classes: SeqLike
  29. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int) : Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce
  30. def copyToArray [B >: A] (xs: Array[B]) : Unit

    definition classes: TraversableOnce
  31. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    definition classes: TraversableOnce
  32. def copyToBuffer [B >: A] (dest: Buffer[B]) : Unit

    definition classes: TraversableOnce
  33. def corresponds [B] (that: Seq[B])(p: (A, B) ⇒ Boolean) : Boolean

    definition classes: SeqLike
  34. def count (p: (A) ⇒ Boolean) : Int

    definition classes: TraversableOnce
  35. def diff [B >: A] (that: Seq[B]) : Seq[A]

    definition classes: SeqLike
  36. def distinct : Seq[A]

    definition classes: SeqLike
  37. def drop (n: Int) : Seq[A]

    definition classes: TraversableLike
  38. def dropRight (n: Int) : Seq[A]

    definition classes: IterableLike
  39. def dropWhile (p: (A) ⇒ Boolean) : Seq[A]

    definition classes: TraversableLike
  40. def elements : Iterator[A]

    definition classes: BoundedStack → IterableLike
  41. def endsWith [B] (that: Seq[B]) : Boolean

    definition classes: SeqLike
  42. def eq (arg0: AnyRef) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    arg0

    the object to compare against this object for reference equality.

    returns

    true if the argument is a reference to the receiver object; false otherwise.

    attributes: final
    definition classes: AnyRef
  43. def equals (that: Any) : Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation]: * It is reflexive: for any instance x of type Any, x.equals(x) should return true. * It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true. * It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same scala.Int (o1.hashCode.equals(o2.hashCode)).

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    definition classes: SeqLike → Equals → AnyRef → Any
  44. def equalsWith [B] (that: Seq[B])(f: (A, B) ⇒ Boolean) : Boolean

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

  45. def exists (p: (A) ⇒ Boolean) : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  46. def filter (p: (A) ⇒ Boolean) : Seq[A]

    definition classes: TraversableLike
  47. def filterNot (p: (A) ⇒ Boolean) : Seq[A]

    definition classes: TraversableLike
  48. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.

    attributes: protected
    definition classes: AnyRef
  49. def find (p: (A) ⇒ Boolean) : Option[A]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  50. def findIndexOf (p: (A) ⇒ Boolean) : Int

    definition classes: SeqLike
  51. def findLastIndexOf (p: (A) ⇒ Boolean) : Int

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  52. def first : A

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  53. def firstOption : Option[A]

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  54. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: TraversableLike → FilterMonadic
  55. def flatten [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : Seq[B]

    definition classes: GenericTraversableTemplate
  56. def foldLeft [B] (z: B)(op: (B, A) ⇒ B) : B

    definition classes: TraversableOnce
  57. def foldRight [B] (z: B)(op: (A, B) ⇒ B) : B

    definition classes: IterableLike → TraversableOnce
  58. def forall (p: (A) ⇒ Boolean) : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  59. def foreach [U] (f: (A) ⇒ U) : Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce → FilterMonadic
  60. def genericBuilder [B] : Builder[B, Seq[B]]

    definition classes: GenericTraversableTemplate
  61. def getClass () : java.lang.Class[_]

    Returns a representation that corresponds to the dynamic class of the receiver object.

    Returns a representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    attributes: final
    definition classes: AnyRef
  62. def groupBy [K] (f: (A) ⇒ K) : Map[K, Seq[A]]

    definition classes: TraversableLike
  63. def grouped (size: Int) : Iterator[Seq[A]]

    definition classes: IterableLike
  64. def hasDefiniteSize : Boolean

    definition classes: TraversableLike → TraversableOnce
  65. def hashCode () : Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    returns

    the hash code value for the object.

    definition classes: SeqLike → AnyRef → Any
  66. def head : A

    definition classes: IterableLike → TraversableLike
  67. def headOption : Option[A]

    definition classes: TraversableLike
  68. def indexOf [B >: A] (elem: B, from: Int) : Int

    definition classes: SeqLike
  69. def indexOf [B >: A] (elem: B) : Int

    definition classes: SeqLike
  70. def indexOfSlice [B >: A] (that: Seq[B], from: Int) : Int

    definition classes: SeqLike
  71. def indexOfSlice [B >: A] (that: Seq[B]) : Int

    definition classes: SeqLike
  72. def indexWhere (p: (A) ⇒ Boolean, from: Int) : Int

    definition classes: SeqLike
  73. def indexWhere (p: (A) ⇒ Boolean) : Int

    definition classes: SeqLike
  74. def indices : Range

    definition classes: SeqLike
  75. def init : Seq[A]

    definition classes: TraversableLike
  76. def insert (i: Int, elem: A) : Unit

    Inserts an element 'i' positions down in the stack.

    Inserts an element 'i' positions down in the stack. An 'i' value of 0 is the same as calling this += elem. This is a O(n) operation as elements need to be shifted around.

  77. def intersect [B >: A] (that: Seq[B]) : Seq[A]

    definition classes: SeqLike
  78. def isDefinedAt (idx: Int) : Boolean

    definition classes: SeqLike
  79. def isEmpty : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  80. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    attributes: final
    definition classes: Any
  81. def isTraversableAgain : Boolean

    attributes: final
    definition classes: TraversableLike → TraversableOnce
  82. def iterator : Iterator[A]

    definition classes: BoundedStack → IterableLike
  83. def last : A

    definition classes: TraversableLike
  84. def lastIndexOf [B >: A] (elem: B, end: Int) : Int

    definition classes: SeqLike
  85. def lastIndexOf [B >: A] (elem: B) : Int

    definition classes: SeqLike
  86. def lastIndexOfSlice [B >: A] (that: Seq[B], end: Int) : Int

    definition classes: SeqLike
  87. def lastIndexOfSlice [B >: A] (that: Seq[B]) : Int

    definition classes: SeqLike
  88. def lastIndexWhere (p: (A) ⇒ Boolean, end: Int) : Int

    definition classes: SeqLike
  89. def lastIndexWhere (p: (A) ⇒ Boolean) : Int

    definition classes: SeqLike
  90. def lastOption : Option[A]

    definition classes: TraversableLike
  91. def length : Int

    definition classes: BoundedStack → SeqLike
  92. def lengthCompare (len: Int) : Int

    definition classes: SeqLike
  93. def lift : (Int) ⇒ Option[A]

    definition classes: PartialFunction
  94. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: TraversableLike → FilterMonadic
  95. def max [B >: A] (implicit cmp: Ordering[B]) : A

    definition classes: TraversableOnce
  96. val maxSize : Int

  97. def min [B >: A] (implicit cmp: Ordering[B]) : A

    definition classes: TraversableOnce
  98. def mkString : String

    definition classes: TraversableOnce
  99. def mkString (sep: String) : String

    definition classes: TraversableOnce
  100. def mkString (start: String, sep: String, end: String) : String

    definition classes: TraversableOnce
  101. def ne (arg0: AnyRef) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

    false if the argument is not a reference to the receiver object; true otherwise.

    attributes: final
    definition classes: AnyRef
  102. def newBuilder : Builder[A, Seq[A]]

    attributes: protected[this]
    definition classes: GenericTraversableTemplate → HasNewBuilder
  103. def nonEmpty : Boolean

    definition classes: TraversableOnce
  104. def notify () : Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  105. def notifyAll () : Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  106. def orElse [A1 <: A, B1 >: B] (that: PartialFunction[A1, B1]) : PartialFunction[A1, B1]

    definition classes: PartialFunction
  107. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: SeqLike
  108. def partition (p: (A) ⇒ Boolean) : (Seq[A], Seq[A])

    definition classes: TraversableLike
  109. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: SeqLike
  110. def pop : A

    Removes the top element in the stack.

    Removes the top element in the stack.

  111. def prefixLength (p: (A) ⇒ Boolean) : Int

    definition classes: SeqLike
  112. def product [B >: A] (implicit num: Numeric[B]) : B

    definition classes: TraversableOnce
  113. def projection : SeqView[A, Seq[A]]

    definition classes: SeqLike → IterableLike
      deprecated:
    1. use view' instead

  114. def reduceLeft [B >: A] (op: (B, A) ⇒ B) : B

    definition classes: TraversableOnce
  115. def reduceLeftOption [B >: A] (op: (B, A) ⇒ B) : Option[B]

    definition classes: TraversableOnce
  116. def reduceRight [B >: A] (op: (A, B) ⇒ B) : B

    definition classes: IterableLike → TraversableOnce
  117. def reduceRightOption [B >: A] (op: (A, B) ⇒ B) : Option[B]

    definition classes: TraversableOnce
  118. def repr : Seq[A]

    definition classes: TraversableLike
  119. def reverse : Seq[A]

    definition classes: SeqLike
  120. def reverseIterator : Iterator[A]

    definition classes: SeqLike
  121. def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: SeqLike
  122. def reversed : List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  123. def reversedElements : Iterator[A]

    definition classes: SeqLike
      deprecated:
    1. use reverseIterator' instead

  124. def sameElements [B >: A] (that: Iterable[B]) : Boolean

    definition classes: IterableLike
  125. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: TraversableLike
  126. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: TraversableLike
  127. def segmentLength (p: (A) ⇒ Boolean, from: Int) : Int

    definition classes: SeqLike
  128. def size : Int

    definition classes: BoundedStack → SeqLike → TraversableOnce
  129. def slice (from: Int, until: Int) : Seq[A]

    definition classes: IterableLike → TraversableLike
  130. def sliding [B >: A] (size: Int, step: Int) : Iterator[Seq[A]]

    definition classes: IterableLike
  131. def sliding [B >: A] (size: Int) : Iterator[Seq[A]]

    definition classes: IterableLike
  132. def sortBy [B] (f: (A) ⇒ B)(implicit ord: Ordering[B]) : Seq[A]

    definition classes: SeqLike
  133. def sortWith (lt: (A, A) ⇒ Boolean) : Seq[A]

    definition classes: SeqLike
  134. def sorted [B >: A] (implicit ord: Ordering[B]) : Seq[A]

    definition classes: SeqLike
  135. def span (p: (A) ⇒ Boolean) : (Seq[A], Seq[A])

    definition classes: TraversableLike
  136. def splitAt (n: Int) : (Seq[A], Seq[A])

    definition classes: TraversableLike
  137. def startsWith [B] (that: Seq[B]) : Boolean

    definition classes: SeqLike
  138. def startsWith [B] (that: Seq[B], offset: Int) : Boolean

    definition classes: SeqLike
  139. def stringPrefix : String

    definition classes: TraversableLike
  140. def sum [B >: A] (implicit num: Numeric[B]) : B

    definition classes: TraversableOnce
  141. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  142. def tail : Seq[A]

    definition classes: TraversableLike
  143. def take (n: Int) : Seq[A]

    definition classes: IterableLike → TraversableLike
  144. def takeRight (n: Int) : Seq[A]

    definition classes: IterableLike
  145. def takeWhile (p: (A) ⇒ Boolean) : Seq[A]

    definition classes: IterableLike → TraversableLike
  146. def thisCollection : Seq[A]

    attributes: protected[this]
    definition classes: SeqLike → IterableLike → TraversableLike
  147. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    definition classes: TraversableOnce
  148. def toBuffer [B >: A] : Buffer[B]

    definition classes: TraversableOnce
  149. def toCollection (repr: Seq[A]) : Seq[A]

    attributes: protected[this]
    definition classes: SeqLike → IterableLike → TraversableLike
  150. def toIndexedSeq [B >: A] : IndexedSeq[B]

    definition classes: TraversableOnce
  151. def toIterable : Iterable[A]

    definition classes: IterableLike → TraversableOnce
  152. def toIterator : Iterator[A]

    definition classes: TraversableLike → TraversableOnce
  153. def toList : List[A]

    definition classes: TraversableOnce
  154. def toMap [T, U] (implicit ev: <:<[A, (T, U)]) : Map[T, U]

    definition classes: TraversableOnce
  155. def toSeq : Seq[A]

    definition classes: SeqLike → IterableLike → TraversableOnce
  156. def toSet [B >: A] : Set[B]

    definition classes: TraversableOnce
  157. def toStream : Stream[A]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  158. def toString () : String

    Returns a string representation of the object.

    Returns a string representation of the object.

    The default representation is platform dependent.

    returns

    a string representation of the object.

    definition classes: SeqLike → TraversableLike → AnyRef → Any
  159. def toTraversable : Traversable[A]

    definition classes: TraversableLike → TraversableOnce
  160. def transpose [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : Seq[Seq[B]]

    definition classes: GenericTraversableTemplate
  161. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: SeqLike
  162. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)) : (Seq[A1], Seq[A2])

    definition classes: GenericTraversableTemplate
  163. def update (index: Int, elem: A) : Unit

    Replaces an element in the stack.

    Replaces an element in the stack.

  164. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[Seq[A], B, That]) : That

    definition classes: SeqLike
  165. def view (from: Int, until: Int) : SeqView[A, Seq[A]]

    definition classes: SeqLike → IterableLike → TraversableLike
  166. def view : SeqView[A, Seq[A]]

    definition classes: SeqLike → IterableLike → TraversableLike
  167. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  168. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  169. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  170. def withFilter (p: (A) ⇒ Boolean) : FilterMonadic[A, Seq[A]]

    definition classes: TraversableLike → FilterMonadic
  171. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[Seq[A], (A1, B), That]) : That

    definition classes: IterableLike
  172. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Seq[A], (A1, B), That]) : That

    definition classes: IterableLike
  173. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[Seq[A], (A1, Int), That]) : That

    definition classes: IterableLike

Inherited from Seq[A]

Inherited from SeqLike[A, Seq[A]]

Inherited from Iterable[A]

Inherited from IterableLike[A, Seq[A]]

Inherited from Equals

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, Seq]

Inherited from TraversableLike[A, Seq[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, Seq[A]]

Inherited from HasNewBuilder[A, Seq[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from AnyRef

Inherited from Any