A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.7/scala/collection/mutable/ArraySeq$$ofLong.html below:

Scala Standard Library 2.13.7 - scala.collection.mutable.ArraySeq.ofLong

final class ofLong extends ArraySeq[Long]



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ofLong
  2. ArraySeq
  3. Serializable
  4. StrictOptimizedSeqOps
  5. StrictOptimizedIterableOps
  6. IndexedSeq
  7. IndexedSeqOps
  8. IndexedSeq
  9. IndexedSeqOps
  10. AbstractSeq
  11. Seq
  12. SeqOps
  13. Cloneable
  14. Cloneable
  15. Iterable
  16. AbstractSeq
  17. Seq
  18. Equals
  19. SeqOps
  20. PartialFunction
  21. Function1
  22. AbstractIterable
  23. Iterable
  24. IterableFactoryDefaults
  25. IterableOps
  26. IterableOnceOps
  27. IterableOnce
  28. AnyRef
  29. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  def +(other: String): String
  4.  final def ++[B >: Long](suffix: IterableOnce[B]): ArraySeq[B]
  5.  final def ++:[B >: Long](prefix: IterableOnce[B]): ArraySeq[B]
  6.  final def +:[B >: Long](elem: B): ArraySeq[B]
  7.  def ->[B](y: B): (ofLong, B)
  8.  final def :+[B >: Long](elem: B): ArraySeq[B]
  9.  final def :++[B >: Long](suffix: IterableOnce[B]): ArraySeq[B]
  10.  final def ==(arg0: Any): Boolean
  11.  final def addString(b: StringBuilder): StringBuilder
  12.  final def addString(b: StringBuilder, sep: String): StringBuilder
  13.  def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
  14.  def andThen[C](k: PartialFunction[Long, C]): PartialFunction[Int, C]
  15.  def andThen[C](k: (Long) => C): PartialFunction[Int, C]
  16.  def appended[B >: Long](elem: B): ArraySeq[B]
  17.  def appendedAll[B >: Long](suffix: IterableOnce[B]): ArraySeq[B]
  18.  def apply(index: Int): Long
  19.  def applyOrElse[A1 <: Int, B1 >: Long](x: A1, default: (A1) => B1): B1
  20.  val array: Array[Long]
  21.  final def asInstanceOf[T0]: T0
  22.  def canEqual(that: Any): Boolean
  23.  def className: String
  24.  def clone(): ArraySeq[Long]
  25.  final def coll: ofLong.this.type
  26.  def collect[B](pf: PartialFunction[Long, B]): ArraySeq[B]
  27.  def collectFirst[B](pf: PartialFunction[Long, B]): Option[B]
  28.  def combinations(n: Int): Iterator[ArraySeq[Long]]
  29.  def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Long]
  30.  def compose[A](g: (A) => Int): (A) => Long
  31.  final def concat[B >: Long](suffix: IterableOnce[B]): ArraySeq[B]
  32.  def contains[A1 >: Long](elem: A1): Boolean
  33.  def containsSlice[B >: Long](that: collection.Seq[B]): Boolean
  34.  def copyToArray[B >: Long](xs: Array[B], start: Int, len: Int): Int
  35.  def copyToArray[B >: Long](xs: Array[B], start: Int): Int
  36.  def copyToArray[B >: Long](xs: Array[B]): Int
  37.  def corresponds[B](that: collection.Seq[B])(p: (Long, B) => Boolean): Boolean
  38.  def corresponds[B](that: IterableOnce[B])(p: (Long, B) => Boolean): Boolean
  39.  def count(p: (Long) => Boolean): Int
  40.  def diff[B >: Long](that: collection.Seq[B]): ArraySeq[Long]
  41.  def distinct: ArraySeq[Long]
  42.  def distinctBy[B](f: (Long) => B): ArraySeq[Long]
  43.  def drop(n: Int): ArraySeq[Long]
  44.  def dropRight(n: Int): ArraySeq[Long]
  45.  def dropWhile(p: (Long) => Boolean): ArraySeq[Long]
  46.  def elemTag: LongManifest
  47.  def elementWise: ElementWiseExtractor[Int, Long]
  48.  def empty: ArraySeq[Long]
  49.  def endsWith[B >: Long](that: collection.Iterable[B]): Boolean
  50.  def ensuring(cond: (ofLong) => Boolean, msg: => Any): ofLong
  51.  def ensuring(cond: (ofLong) => Boolean): ofLong
  52.  def ensuring(cond: Boolean, msg: => Any): ofLong
  53.  def ensuring(cond: Boolean): ofLong
  54.  final def eq(arg0: AnyRef): Boolean
  55.  def equals(that: Any): Boolean
  56.  def exists(p: (Long) => Boolean): Boolean
  57.  def filter(pred: (Long) => Boolean): ArraySeq[Long]
  58.  def filterImpl(pred: (Long) => Boolean, isFlipped: Boolean): ArraySeq[Long]
  59.  def filterNot(pred: (Long) => Boolean): ArraySeq[Long]
  60.  def finalize(): Unit
  61.  def find(p: (Long) => Boolean): Option[Long]
  62.  def findLast(p: (Long) => Boolean): Option[Long]
  63.  def flatMap[B](f: (Long) => IterableOnce[B]): ArraySeq[B]
  64.  def flatten[B](implicit toIterableOnce: (Long) => IterableOnce[B]): ArraySeq[B]
  65.  def fold[A1 >: Long](z: A1)(op: (A1, A1) => A1): A1
  66.  def foldLeft[B](z: B)(op: (B, Long) => B): B
  67.  def foldRight[B](z: B)(op: (Long, B) => B): B
  68.  def forall(p: (Long) => Boolean): Boolean
  69.  def foreach[U](f: (Long) => U): Unit
  70.  def fromSpecific(coll: IterableOnce[Long]): ArraySeq[Long]
  71.  final def getClass(): Class[_ <: AnyRef]
  72.  def groupBy[K](f: (Long) => K): immutable.Map[K, ArraySeq[Long]]
  73.  def groupMap[K, B](key: (Long) => K)(f: (Long) => B): immutable.Map[K, ArraySeq[B]]
  74.  def groupMapReduce[K, B](key: (Long) => K)(f: (Long) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  75.  def grouped(size: Int): Iterator[ArraySeq[Long]]
  76.  def hashCode(): Int
  77.  def head: Long
  78.  def headOption: Option[Long]
  79.  def indexOf[B >: Long](elem: B): Int
  80.  def indexOf[B >: Long](elem: B, from: Int): Int
  81.  def indexOfSlice[B >: Long](that: collection.Seq[B]): Int
  82.  def indexOfSlice[B >: Long](that: collection.Seq[B], from: Int): Int
  83.  def indexWhere(p: (Long) => Boolean): Int
  84.  def indexWhere(p: (Long) => Boolean, from: Int): Int
  85.  def indices: immutable.Range
  86.  def init: ArraySeq[Long]
  87.  def inits: Iterator[ArraySeq[Long]]
  88.  def intersect[B >: Long](that: collection.Seq[B]): ArraySeq[Long]
  89.  def isDefinedAt(idx: Int): Boolean
  90.  def isEmpty: Boolean
  91.  final def isInstanceOf[T0]: Boolean
  92.  def isTraversableAgain: Boolean
  93.  def iterableFactory: SeqFactory[ArraySeq]
  94.  def iterator: Iterator[Long]
  95.  def knownSize: Int
  96.  def last: Long
  97.  def lastIndexOf[B >: Long](elem: B, end: Int = length - 1): Int
  98.  def lastIndexOfSlice[B >: Long](that: collection.Seq[B]): Int
  99.  def lastIndexOfSlice[B >: Long](that: collection.Seq[B], end: Int): Int
  100.  def lastIndexWhere(p: (Long) => Boolean): Int
  101.  def lastIndexWhere(p: (Long) => Boolean, end: Int): Int
  102.  def lastOption: Option[Long]
  103.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Long, B, ofLong.this.type]
  104.  def length: Int
  105.  final def lengthCompare(that: collection.Iterable[_]): Int
  106.  final def lengthCompare(len: Int): Int
  107.  final def lengthIs: SizeCompareOps
  108.  def lift: (Int) => Option[Long]
  109.  def map[B](f: (Long) => B): ArraySeq[B]
  110.  def mapInPlace(f: (Long) => Long): ofLong.this.type
  111.  def max[B >: Long](implicit ord: math.Ordering[B]): Long
  112.  def maxBy[B](f: (Long) => B)(implicit cmp: math.Ordering[B]): Long
  113.  def maxByOption[B](f: (Long) => B)(implicit cmp: math.Ordering[B]): Option[Long]
  114.  def maxOption[B >: Long](implicit ord: math.Ordering[B]): Option[Long]
  115.  def min[B >: Long](implicit ord: math.Ordering[B]): Long
  116.  def minBy[B](f: (Long) => B)(implicit cmp: math.Ordering[B]): Long
  117.  def minByOption[B](f: (Long) => B)(implicit cmp: math.Ordering[B]): Option[Long]
  118.  def minOption[B >: Long](implicit ord: math.Ordering[B]): Option[Long]
  119.  final def mkString: String
  120.  final def mkString(sep: String): String
  121.  final def mkString(start: String, sep: String, end: String): String
  122.  final def ne(arg0: AnyRef): Boolean
  123.  def newSpecificBuilder: Builder[Long, ArraySeq[Long]]
  124.  def nonEmpty: Boolean
  125.  final def notify(): Unit
  126.  final def notifyAll(): Unit
  127.  def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
  128.  def orElse[A1 <: Int, B1 >: Long](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  129.  def padTo[B >: Long](len: Int, elem: B): ArraySeq[B]
  130.  def partition(p: (Long) => Boolean): (ArraySeq[Long], ArraySeq[Long])
  131.  def partitionMap[A1, A2](f: (Long) => Either[A1, A2]): (ArraySeq[A1], ArraySeq[A2])
  132.  def patch[B >: Long](from: Int, other: IterableOnce[B], replaced: Int): ArraySeq[B]
  133.  def permutations: Iterator[ArraySeq[Long]]
  134.  def prepended[B >: Long](elem: B): ArraySeq[B]
  135.  def prependedAll[B >: Long](prefix: IterableOnce[B]): ArraySeq[B]
  136.  def product[B >: Long](implicit num: math.Numeric[B]): B
  137.  def reduce[B >: Long](op: (B, B) => B): B
  138.  def reduceLeft[B >: Long](op: (B, Long) => B): B
  139.  def reduceLeftOption[B >: Long](op: (B, Long) => B): Option[B]
  140.  def reduceOption[B >: Long](op: (B, B) => B): Option[B]
  141.  def reduceRight[B >: Long](op: (Long, B) => B): B
  142.  def reduceRightOption[B >: Long](op: (Long, B) => B): Option[B]
  143.  def reverse: ArraySeq[Long]
  144.  def reverseIterator: Iterator[Long]
  145.  def reversed: collection.Iterable[Long]
  146.  def runWith[U](action: (Long) => U): (Int) => Boolean
  147.  def sameElements[B >: Long](that: IterableOnce[B]): Boolean
  148.  def scan[B >: Long](z: B)(op: (B, B) => B): ArraySeq[B]
  149.  def scanLeft[B](z: B)(op: (B, Long) => B): ArraySeq[B]
  150.  def scanRight[B](z: B)(op: (Long, B) => B): ArraySeq[B]
  151.  def search[B >: Long](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
  152.  def search[B >: Long](elem: B)(implicit ord: math.Ordering[B]): SearchResult
  153.  def segmentLength(p: (Long) => Boolean, from: Int): Int
  154.  final def segmentLength(p: (Long) => Boolean): Int
  155.  final def size: Int
  156.  final def sizeCompare(that: collection.Iterable[_]): Int
  157.  final def sizeCompare(otherSize: Int): Int
  158.  final def sizeIs: SizeCompareOps
  159.  def slice(from: Int, until: Int): ArraySeq[Long]
  160.  def sliding(size: Int, step: Int): Iterator[ArraySeq[Long]]
  161.  def sliding(size: Int): Iterator[ArraySeq[Long]]
  162.  def sortBy[B](f: (Long) => B)(implicit ord: Ordering[B]): ArraySeq[Long]
  163.  def sortInPlace[B >: Long]()(implicit ord: Ordering[B]): ofLong.this.type
  164.  def sortInPlaceBy[B](f: (Long) => B)(implicit ord: Ordering[B]): ofLong.this.type
  165.  def sortInPlaceWith(lt: (Long, Long) => Boolean): ofLong.this.type
  166.  def sortWith(lt: (Long, Long) => Boolean): ArraySeq[Long]
  167.  def sorted[B >: Long](implicit ord: Ordering[B]): ArraySeq[Long]
  168.  def span(p: (Long) => Boolean): (ArraySeq[Long], ArraySeq[Long])
  169.  def splitAt(n: Int): (ArraySeq[Long], ArraySeq[Long])
  170.  def startsWith[B >: Long](that: IterableOnce[B], offset: Int = 0): Boolean
  171.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[Long, S]): S with EfficientSplit
  172.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Long, B]): C2
  173.  final def strictOptimizedConcat[B >: Long, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  174.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (Long) => IterableOnce[B]): C2
  175.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (Long) => IterableOnce[B]): C2
  176.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (Long) => B): C2
  177.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(Long, B), C2]): C2
  178.  def stringPrefix: String
  179.  def sum[B >: Long](implicit num: math.Numeric[B]): B
  180.  final def synchronized[T0](arg0: => T0): T0
  181.  def tail: ArraySeq[Long]
  182.  def tails: Iterator[ArraySeq[Long]]
  183.  def take(n: Int): ArraySeq[Long]
  184.  def takeRight(n: Int): ArraySeq[Long]
  185.  def takeWhile(p: (Long) => Boolean): ArraySeq[Long]
  186.  def tapEach[U](f: (Long) => U): ArraySeq[Long]
  187.  def to[C1](factory: Factory[Long, C1]): C1
  188.  def toArray[B >: Long](implicit arg0: ClassTag[B]): Array[B]
  189.  final def toBuffer[B >: Long]: Buffer[B]
  190.  def toIndexedSeq: immutable.IndexedSeq[Long]
  191.  def toList: immutable.List[Long]
  192.  def toMap[K, V](implicit ev: <:<[Long, (K, V)]): immutable.Map[K, V]
  193.  def toSeq: immutable.Seq[Long]
  194.  def toSet[B >: Long]: immutable.Set[B]
  195.  def toString(): String
  196.  def toVector: immutable.Vector[Long]
  197.  def transpose[B](implicit asIterable: (Long) => collection.Iterable[B]): ArraySeq[ArraySeq[B]]
  198.  def unapply(a: Int): Option[Long]
  199.  def unzip[A1, A2](implicit asPair: (Long) => (A1, A2)): (ArraySeq[A1], ArraySeq[A2])
  200.  def unzip3[A1, A2, A3](implicit asTriple: (Long) => (A1, A2, A3)): (ArraySeq[A1], ArraySeq[A2], ArraySeq[A3])
  201.  def update(index: Int, elem: Long): Unit
  202.  def updated[B >: Long](index: Int, elem: B): ArraySeq[B]
  203.  def view: IndexedSeqView[Long]
  204.  final def wait(): Unit
  205.  final def wait(arg0: Long, arg1: Int): Unit
  206.  final def wait(arg0: Long): Unit
  207.  def withFilter(p: (Long) => Boolean): WithFilter[Long, [_]ArraySeq[_]]
  208.  def zip[B](that: IterableOnce[B]): ArraySeq[(Long, B)]
  209.  def zipAll[A1 >: Long, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): ArraySeq[(A1, B)]
  210.  def zipWithIndex: ArraySeq[(Long, Int)]
Deprecated Value Members
  1.  def /:[B](z: B)(op: (B, Long) => B): B
  2.  final def /:[B](z: B)(op: (B, Long) => B): B
  3.  def :\[B](z: B)(op: (Long, B) => B): B
  4.  final def :\[B](z: B)(op: (Long, B) => B): B
  5.  def aggregate[B](z: => B)(seqop: (B, Long) => B, combop: (B, B) => B): B
  6.  def collectFirst[B](f: PartialFunction[Long, B]): Option[B]
  7.  def companion: IterableFactory[[_]ArraySeq[_]]
  8.  def copyToBuffer(dest: Buffer[Long]): Unit
  9.  final def copyToBuffer[B >: Long](dest: Buffer[B]): Unit
  10.  def count(f: (Long) => Boolean): Int
  11.  def exists(f: (Long) => Boolean): Boolean
  12.  def filter(f: (Long) => Boolean): Iterator[Long]
  13.  def find(p: (Long) => Boolean): Option[Long]
  14.  def flatMap[B](f: (Long) => IterableOnce[B]): IterableOnce[B]
  15.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  16.  def foldLeft[B](z: B)(op: (B, Long) => B): B
  17.  def foldRight[B](z: B)(op: (Long, B) => B): B
  18.  def forall(f: (Long) => Boolean): Boolean
  19.  def foreach[U](f: (Long) => U): Unit
  20.  def formatted(fmtstr: String): String
  21.  def hasDefiniteSize: Boolean
  22.  def isEmpty: Boolean
  23.  def map[B](f: (Long) => B): IterableOnce[B]
  24.  def max(implicit ord: math.Ordering[Long]): Long
  25.  def maxBy[B](f: (Long) => B)(implicit cmp: math.Ordering[B]): Long
  26.  def min(implicit ord: math.Ordering[Long]): Long
  27.  def minBy[B](f: (Long) => B)(implicit cmp: math.Ordering[B]): Long
  28.  def mkString: String
  29.  def mkString(sep: String): String
  30.  def mkString(start: String, sep: String, end: String): String
  31.  def nonEmpty: Boolean
  32.  final def prefixLength(p: (Long) => Boolean): Int
  33.  def product(implicit num: math.Numeric[Long]): Long
  34.  def reduce(f: (Long, Long) => Long): Long
  35.  def reduceLeft(f: (Long, Long) => Long): Long
  36.  def reduceLeftOption(f: (Long, Long) => Long): Option[Long]
  37.  def reduceOption(f: (Long, Long) => Long): Option[Long]
  38.  def reduceRight(f: (Long, Long) => Long): Long
  39.  def reduceRightOption(f: (Long, Long) => Long): Option[Long]
  40.  final def repr: ArraySeq[Long]
  41.  def reverseMap[B](f: (Long) => B): ArraySeq[B]
  42.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  43.  def seq: ofLong.this.type
  44.  def size: Int
  45.  def sum(implicit num: math.Numeric[Long]): Long
  46.  def to[C1](factory: Factory[Long, C1]): C1
  47.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  48.  def toBuffer[B >: A]: Buffer[B]
  49.  def toIndexedSeq: collection.IndexedSeq[Long]
  50.  final def toIterable: collection.Iterable[Long]
  51.  final def toIterable: ofLong.this.type
  52.  def toIterator: Iterator[Long]
  53.  final def toIterator: Iterator[Long]
  54.  def toList: immutable.List[Long]
  55.  def toMap[K, V](implicit ev: <:<[Long, (K, V)]): immutable.Map[K, V]
  56.  def toSeq: immutable.Seq[Long]
  57.  def toSet[B >: A]: immutable.Set[B]
  58.  def toStream: immutable.Stream[Long]
  59.  final def toStream: immutable.Stream[Long]
  60.  final def toTraversable: collection.Traversable[Long]
  61.  final def toTraversable: collection.Traversable[Long]
  62.  def toVector: immutable.Vector[Long]
  63.  final def transform(f: (Long) => Long): ofLong.this.type
  64.  final def union[B >: Long](that: collection.Seq[B]): ArraySeq[B]
  65.  def view(from: Int, until: Int): IndexedSeqView[Long]
  66.  def withFilter(f: (Long) => Boolean): Iterator[Long]
  67.  def →[B](y: B): (ofLong, B)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4