c

aptus

Seq_

implicit final class Seq_[A] extends AnyVal

Linear Supertypes
AnyVal, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Seq_
  2. AnyVal
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Seq_(coll: Seq[A])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    Any
  2. final def ##(): Int
    Definition Classes
    Any
  3. def #@@: String
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    Any
  5. def @@: String
  6. def IQR(implicit num: Numeric[A]): Double
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def assertDistinct(): Seq[A]
  9. def assertDistinctBy[B](f: (A) ⇒ B): Seq[A]
  10. def assertNonEmpty(): Seq[A]
  11. def assertSorted()(implicit ord: Ordering[A]): Seq[A]
  12. def assertSortedBy[B](f: (A) ⇒ B)(implicit arg0: Ordering[B]): Seq[A]
  13. val coll: Seq[A]
  14. def containsAllOf(that: Seq[A]): Boolean
  15. def countBySelf: List[(A, Int)]
  16. def data: Data[A]
  17. def debug: Seq[A]
    Annotations
    @fordevonly( message = ... )
  18. def distinctByAdjacency: Seq[A]
  19. def drop(n: Option[Int]): Seq[A]
  20. def duplicates: Seq[A]
  21. def filterBy[B](p: (B) ⇒ Boolean)(f: (A) ⇒ B): Seq[A]
  22. def filterByNot[B](p: (B) ⇒ Boolean)(f: (A) ⇒ B): Seq[A]
  23. def force: Force[A]
  24. def forceStats(implicit num: Numeric[A]): DoubleStats
  25. def getClass(): Class[_ <: AnyVal]
    Definition Classes
    AnyVal → Any
  26. def groupByKey[K, V](implicit ev: <:<[A, (K, V)]): Map[K, Seq[V]]
  27. def groupByKeyWithListMap[K, V](implicit ev: <:<[A, (K, V)]): ListMap[K, Seq[V]]
  28. def ifEmptyThenError(msg: String): Seq[A]
  29. def ifOneElement[B](ifOne: (A) ⇒ B, otherwise: (Seq[A]) ⇒ B): B
  30. def ifOneElementOpt: Option[A]
  31. def ifOneElementOrElse(errorMessage: (Seq[A]) ⇒ Any): A
  32. def initOption: Option[Seq[A]]
  33. def innerJoin[B](that: Seq[B]): InnerJoin[A, B]
  34. def isDisjointWith[B >: A](that: Iterable[B]): Boolean
  35. def isDistinct: Boolean
  36. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  37. def isSorted(implicit ev: Ordering[A]): Boolean
  38. def isSortedBy[B](f: (A) ⇒ B)(implicit arg0: Ordering[B]): Boolean
  39. def join: String
  40. def join(sep: aptus.Separator): String
  41. def joinln: String
  42. def joinlnln: String
  43. def jointab: String
  44. def mapAssociateLeft[K](f: (A) ⇒ K): Seq[(K, A)]
  45. def mapAssociateRight[V](f: (A) ⇒ V): Seq[(A, V)]
  46. def mapIf[B <: A](pred: (A) ⇒ Boolean)(f: (A) ⇒ B): Seq[A]
  47. def mapIf[B <: A](test: Boolean)(f: (A) ⇒ B): Seq[A]
  48. def mean(implicit num: Numeric[A]): Double
  49. def median(implicit num: Numeric[A]): Double
  50. def minMax(implicit num: Numeric[A]): (A, A)
  51. def percentile(n: Double)(implicit num: Numeric[A]): Double
  52. def pivot[K, V](implicit ev: <:<[A, (K, V)]): ListMap[V, Seq[K]]

    no prior grouping of key/values

  53. def range[B >: A](implicit cmp: Ordering[B], num: Numeric[B]): B
  54. def requireDistinct(): Seq[A]
  55. def requireDistinctBy[B](f: (A) ⇒ B): Seq[A]
  56. def requireNonEmpty(): Seq[A]
  57. def requireSorted()(implicit ord: Ordering[A]): Seq[A]
  58. def requireSortedBy[B](f: (A) ⇒ B)(implicit arg0: Ordering[B]): Seq[A]
  59. def roll(n: Int): Seq[A]
  60. def section(n: Int)(title: String): String
  61. def section(title: String): String
  62. def section: String
  63. def section2(title: String): String
  64. def section2: String
  65. def slidingList(n: Int): List[List[A]]
  66. def slidingPairs: List[(A, A)]
  67. def slidingPairsWithNext: Seq[(A, Option[A])]
  68. def slidingPairsWithPrevious: Seq[(Option[A], A)]
  69. def splitAtHead: (A, Seq[A])
  70. def splitAtLast: (Seq[A], A)
  71. def statsOpt(implicit num: Numeric[A]): Option[DoubleStats]
  72. def stdev(mean: Double)(implicit num: Numeric[A]): Double
  73. def stdev(implicit num: Numeric[A]): Double
  74. def systemCall()(implicit ev: =:=[A, String]): String
  75. def systemCallWithErrorRedirection()(implicit ev: =:=[A, String]): String
  76. def tailOption: Option[Seq[A]]
  77. def take(n: Option[Int]): Seq[A]
  78. def toListMap[K, V](implicit ev: <:<[A, (K, V)]): ListMap[K, V]
  79. def toMutableMap[K, V](implicit ev: <:<[A, (K, V)]): HashMap[K, V]
  80. def toOptionalSeq[B](implicit ev: <:<[A, Option[B]]): Option[Seq[B]]
  81. def toString(): String
    Definition Classes
    Any
  82. def toTreeMap[K, V](implicit ev: <:<[A, (K, V)], ord: Ordering[K]): TreeMap[K, V]
  83. def writeFileLines(path: aptus.FilePath): aptus.FilePath
  84. def zipSameSize[B](that: Seq[B], debug: (Seq[_]) ⇒ Any): Seq[(A, B)]
  85. def zipSameSize[B](that: Seq[B]): Seq[(A, B)]
  86. def zipWithIsFirst: Seq[(A, Boolean)]
  87. def zipWithIsLast: Seq[(A, Boolean)]
  88. def zipWithRank: Seq[(A, aptus.Rank)]

Inherited from AnyVal

Inherited from Any

Ungrouped