SeqMethods

Value Members

1. def ++[B >: A, That](that: Traversable[B])(bf: CanBuildFrom[This, B, That]): That

2. def ++[B >: A, That](that: Iterator[B])(bf: CanBuildFrom[This, B, That]): That

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

4. def :\[B](z: B)(op: (A, B) ⇒ B): B

5. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

6. def addString(b: StringBuilder, sep: String): StringBuilder

7. def addString(b: StringBuilder): StringBuilder

8. def apply(idx: Int): A

9. def contains(elem: Any): Boolean

10. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

11. def copyToArray[B >: A](xs: Array[B], start: Int): Unit

12. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

13. def count(p: (A) ⇒ Boolean): Int

14. def diff[B >: A, That](that: Seq[B]): This

15. def drop(n: Int): Traversable[A]

16. def dropRight(n: Int): Iterable[A]

17. def dropWhile(p: (A) ⇒ Boolean): Traversable[A]

18. def endsWith[B](that: Seq[B]): Boolean

19. def equals(arg0: 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 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 Int (o1.hashCode.equals(o2.hashCode)).

    arg0

    the object to compare against this object for equality.

    returns

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

    definition classes: AnyRef ⇐ Any

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

21. def filter(p: (A) ⇒ Boolean): Traversable[A]

22. def filterNot(p: (A) ⇒ Boolean): Traversable[A]

23. def find(p: (A) ⇒ Boolean): Option[A]

24. def flatMap[B, That](f: (A) ⇒ Traversable[B])(bf: CanBuildFrom[This, B, That]): That

25. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

26. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

27. def forall(p: (A) ⇒ Boolean): Boolean

28. def foreach[U](f: (A) ⇒ U): Unit

29. def groupBy[K](f: (A) ⇒ K): Map[K, Traversable[A]]

30. def hasDefiniteSize: Boolean

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

    definition classes: AnyRef ⇐ Any

32. def head: A

33. def headOption: Option[A]

34. def indexOf[B >: A](elem: B, from: Int): Int

35. def indexOf[B >: A](elem: B): Int

36. def indexOfSlice[B >: A](that: Seq[B], fromIndex: Int): Int

37. def indexOfSlice[B >: A](that: Seq[B]): Int

38. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int

39. def indexWhere(p: (A) ⇒ Boolean): Int

40. def indices: Range

41. def init: Traversable[A]

42. def intersect[B >: A, That](that: Seq[B]): This

43. def isDefinedAt(x: Int): Boolean

44. def isEmpty: Boolean

45. def iterator: Iterator[A]

46. def last: A

47. def lastIndexOf[B >: A](elem: B, end: Int): Int

48. def lastIndexOf[B >: A](elem: B): Int

49. def lastIndexOfSlice[B >: A](that: Seq[B], fromIndex: Int): Int

50. def lastIndexOfSlice[B >: A](that: Seq[B]): Int

51. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int

52. def lastIndexWhere(p: (A) ⇒ Boolean): Int

53. def lastOption: Option[A]

54. def length: Int

55. def lengthCompare(len: Int): Int

56. def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[This, B, That]): That

57. def mkString: String

58. def mkString(start: String, sep: String, end: String): String

59. def mkString(sep: String): String

60. def nonEmpty: Boolean

61. def padTo[B >: A, That](len: Int, elem: B)(bf: CanBuildFrom[This, B, That]): That

62. def partialMap[B, That](pf: PartialFunction[A, B])(bf: CanBuildFrom[This, B, That]): That

63. def partition(p: (A) ⇒ Boolean): (Traversable[A], Traversable[A])

64. def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(bf: CanBuildFrom[This, B, That]): That

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

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

67. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

68. def reduceRight[B >: A](op: (A, B) ⇒ B): B

69. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

70. def removeDuplicates: This

71. def reverse: This

72. def reverseIterator: Iterator[A]

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

74. def segmentLength(p: (A) ⇒ Boolean, from: Int): Int

75. def size: Int

76. def slice(from: Int, until: Int): Traversable[A]

77. def sortWith(lt: (A, A) ⇒ Boolean)(m: ClassManifest[A]): This

78. def span(p: (A) ⇒ Boolean): (Traversable[A], Traversable[A])

79. def splitAt(n: Int): (Traversable[A], Traversable[A])

80. def startsWith[B](that: Seq[B], offset: Int): Boolean

81. def startsWith[B](that: Seq[B]): Boolean

82. def stringPrefix: String

83. def tail: Traversable[A]

84. def take(n: Int): Traversable[A]

85. def takeRight(n: Int): Iterable[A]

86. def takeWhile(p: (A) ⇒ Boolean): Traversable[A]

87. def toArray[B >: A](arg0: ClassManifest[B]): Array[B]

88. def toIndexedSeq[B >: A]: IndexedSeq[B]

89. def toIterable: Iterable[A]

90. def toList: List[A]

91. def toSeq: Seq[A]

92. def toSet[B >: A]: Set[B]

93. def toStream: Stream[A]

94. def toString(): String

    Returns a string representation of the object

    Returns a string representation of the object.

    The default representation is platform dependent.

    definition classes: AnyRef ⇐ Any

95. def union[B >: A, That](that: Seq[B])(bf: CanBuildFrom[This, B, That]): That

96. def view(from: Int, until: Int): SeqView[A, This]

97. def view: SeqView[A, This]

98. def zip[A1 >: A, B, That](that: Iterable[B])(bf: CanBuildFrom[This, (A1, B), That]): That

99. def zipAll[B, A1 >: A, That](that: Iterable[B], e1: A1, e2: B)(bf: CanBuildFrom[This, (A1, B), That]): That

100. def zipWithIndex[A1 >: A, That](bf: CanBuildFrom[This, (A1, Int), That]): That