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.10/scala/collection/immutable/LongMap.html below:

Scala Standard Library 2.13.10 - scala.collection.immutable.LongMap

sealed abstract class LongMap[+T] extends AbstractMap[immutable.LongMapUtils.Long, T] with StrictOptimizedMapOps[immutable.LongMapUtils.Long, T, Map, LongMap[T]] with Serializable



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LongMap
  2. Serializable
  3. StrictOptimizedMapOps
  4. StrictOptimizedMapOps
  5. StrictOptimizedIterableOps
  6. AbstractMap
  7. Map
  8. MapOps
  9. Iterable
  10. AbstractMap
  11. Map
  12. Equals
  13. MapFactoryDefaults
  14. MapOps
  15. PartialFunction
  16. Function1
  17. AbstractIterable
  18. Iterable
  19. IterableFactoryDefaults
  20. IterableOps
  21. IterableOnceOps
  22. IterableOnce
  23. AnyRef
  24. Any
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  def +[S >: T](kv: (LongMapUtils.Long, S)): LongMap[S]
  4.  def ++[V1 >: T](that: IterableOnce[(LongMapUtils.Long, V1)]): LongMap[V1]
  5.  def ++[S >: T](that: LongMap[S]): LongMap[S]
  6.  final def ++[B >: (LongMapUtils.Long, T)](suffix: IterableOnce[B]): Iterable[B]
  7.  final def -(key: LongMapUtils.Long): LongMap[T]
  8.  final def --(keys: IterableOnce[LongMapUtils.Long]): LongMap[T]
  9.  def ->[B](y: B): (LongMap[T], B)
  10.  final def ==(arg0: Any): Boolean
  11.  def addString(sb: mutable.StringBuilder, start: String, sep: String, end: String): sb.type
  12.  final def addString(b: mutable.StringBuilder): b.type
  13.  final def addString(b: mutable.StringBuilder, sep: String): b.type
  14.  def andThen[C](k: PartialFunction[T, C]): PartialFunction[LongMapUtils.Long, C]
  15.  def andThen[C](k: (T) => C): PartialFunction[LongMapUtils.Long, C]
  16.  final def apply(key: LongMapUtils.Long): T
  17.  def applyOrElse[K1 <: LongMapUtils.Long, V1 >: T](x: K1, default: (K1) => V1): V1
  18.  final def asInstanceOf[T0]: T0
  19.  def canEqual(that: Any): Boolean
  20.  def className: String
  21.  def clone(): AnyRef
  22.  final def coll: LongMap.this.type
  23.  def collect[V2](pf: PartialFunction[(LongMapUtils.Long, T), (LongMapUtils.Long, V2)]): LongMap[V2]
  24.  def collect[K2, V2](pf: PartialFunction[(LongMapUtils.Long, T), (K2, V2)]): Map[K2, V2]
  25.  def collect[B](pf: PartialFunction[(LongMapUtils.Long, T), B]): Iterable[B]
  26.  def collectFirst[B](pf: PartialFunction[(LongMapUtils.Long, T), B]): Option[B]
  27.  def compose[R](k: PartialFunction[R, LongMapUtils.Long]): PartialFunction[R, T]
  28.  def compose[A](g: (A) => LongMapUtils.Long): (A) => T
  29.  def concat[V1 >: T](that: IterableOnce[(LongMapUtils.Long, V1)]): LongMap[V1]
  30.  def concat[B >: (LongMapUtils.Long, T)](suffix: IterableOnce[B]): Iterable[B]
  31.  def contains(key: LongMapUtils.Long): Boolean
  32.  def copyToArray[B >: (LongMapUtils.Long, T)](xs: Array[B], start: Int, len: Int): Int
  33.  def copyToArray[B >: (LongMapUtils.Long, T)](xs: Array[B], start: Int): Int
  34.  def copyToArray[B >: (LongMapUtils.Long, T)](xs: Array[B]): Int
  35.  def corresponds[B](that: IterableOnce[B])(p: ((LongMapUtils.Long, T), B) => Boolean): Boolean
  36.  def count(p: ((LongMapUtils.Long, T)) => Boolean): Int
  37.  def default(key: LongMapUtils.Long): T
  38.  def drop(n: Int): LongMap[T]
  39.  def dropRight(n: Int): LongMap[T]
  40.  def dropWhile(p: ((LongMapUtils.Long, T)) => Boolean): LongMap[T]
  41.  def elementWise: ElementWiseExtractor[LongMapUtils.Long, T]
  42.  def empty: LongMap[T]
  43.  def ensuring(cond: (LongMap[T]) => Boolean, msg: => Any): LongMap[T]
  44.  def ensuring(cond: (LongMap[T]) => Boolean): LongMap[T]
  45.  def ensuring(cond: Boolean, msg: => Any): LongMap[T]
  46.  def ensuring(cond: Boolean): LongMap[T]
  47.  final def eq(arg0: AnyRef): Boolean
  48.  def equals(o: Any): Boolean
  49.  def exists(p: ((LongMapUtils.Long, T)) => Boolean): Boolean
  50.  def filter(f: ((LongMapUtils.Long, T)) => Boolean): LongMap[T]
  51.  def filterImpl(pred: ((LongMapUtils.Long, T)) => Boolean, isFlipped: Boolean): LongMap[T]
  52.  def filterNot(pred: ((LongMapUtils.Long, T)) => Boolean): LongMap[T]
  53.  def finalize(): Unit
  54.  def find(p: ((LongMapUtils.Long, T)) => Boolean): Option[(LongMapUtils.Long, T)]
  55.  final def firstKey: LongMapUtils.Long
  56.  def flatMap[V2](f: ((LongMapUtils.Long, T)) => IterableOnce[(LongMapUtils.Long, V2)]): LongMap[V2]
  57.  def flatMap[K2, V2](f: ((LongMapUtils.Long, T)) => IterableOnce[(K2, V2)]): Map[K2, V2]
  58.  def flatMap[B](f: ((LongMapUtils.Long, T)) => IterableOnce[B]): Iterable[B]
  59.  def flatten[B](implicit toIterableOnce: ((LongMapUtils.Long, T)) => IterableOnce[B]): Iterable[B]
  60.  def fold[A1 >: (LongMapUtils.Long, T)](z: A1)(op: (A1, A1) => A1): A1
  61.  def foldLeft[B](z: B)(op: (B, (LongMapUtils.Long, T)) => B): B
  62.  def foldRight[B](z: B)(op: ((LongMapUtils.Long, T), B) => B): B
  63.  def forall(p: ((LongMapUtils.Long, T)) => Boolean): Boolean
  64.  final def foreach[U](f: ((LongMapUtils.Long, T)) => U): Unit
  65.  final def foreachEntry[U](f: (LongMapUtils.Long, T) => U): Unit
  66.  final def foreachKey[U](f: (LongMapUtils.Long) => U): Unit
  67.  final def foreachValue[U](f: (T) => U): Unit
  68.  def fromSpecific(coll: IterableOnce[(LongMapUtils.Long, T)]): LongMap[T]
  69.  final def get(key: LongMapUtils.Long): Option[T]
  70.  final def getClass(): Class[_ <: AnyRef]
  71.  final def getOrElse[S >: T](key: LongMapUtils.Long, default: => S): S
  72.  def groupBy[K](f: ((LongMapUtils.Long, T)) => K): Map[K, LongMap[T]]
  73.  def groupMap[K, B](key: ((LongMapUtils.Long, T)) => K)(f: ((LongMapUtils.Long, T)) => B): Map[K, Iterable[B]]
  74.  def groupMapReduce[K, B](key: ((LongMapUtils.Long, T)) => K)(f: ((LongMapUtils.Long, T)) => B)(reduce: (B, B) => B): Map[K, B]
  75.  def grouped(size: Int): Iterator[LongMap[T]]
  76.  def hashCode(): Int
  77.  def head: (LongMapUtils.Long, T)
  78.  def headOption: Option[(LongMapUtils.Long, T)]
  79.  def init: LongMap[T]
  80.  def inits: Iterator[LongMap[T]]
  81.  def intersection[R](that: LongMap[R]): LongMap[T]
  82.  def intersectionWith[S, R](that: LongMap[S], f: (LongMapUtils.Long, T, S) => R): LongMap[R]
  83.  def isDefinedAt(key: LongMapUtils.Long): Boolean
  84.  def isEmpty: Boolean
  85.  final def isInstanceOf[T0]: Boolean
  86.  def isTraversableAgain: Boolean
  87.  def iterableFactory: IterableFactory[Iterable]
  88.  def iterator: Iterator[(LongMapUtils.Long, T)]
  89.  def keySet: Set[LongMapUtils.Long]
  90.  def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[LongMapUtils.Long, S]): S
  91.  def keys: collection.Iterable[LongMapUtils.Long]
  92.  def keysIterator: Iterator[LongMapUtils.Long]
  93.  def knownSize: Int
  94.  def last: (LongMapUtils.Long, T)
  95.  final def lastKey: LongMapUtils.Long
  96.  def lastOption: Option[(LongMapUtils.Long, T)]
  97.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(LongMapUtils.Long, T), B, LongMap.this.type]
  98.  def lift: (LongMapUtils.Long) => Option[T]
  99.  def map[V2](f: ((LongMapUtils.Long, T)) => (LongMapUtils.Long, V2)): LongMap[V2]
  100.  def map[K2, V2](f: ((LongMapUtils.Long, T)) => (K2, V2)): Map[K2, V2]
  101.  def map[B](f: ((LongMapUtils.Long, T)) => B): Iterable[B]
  102.  def mapFactory: MapFactory[Map]
  103.  final def mapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)]): Map[K2, V2]
  104.  def max[B >: (LongMapUtils.Long, T)](implicit ord: math.Ordering[B]): (LongMapUtils.Long, T)
  105.  def maxBy[B](f: ((LongMapUtils.Long, T)) => B)(implicit cmp: math.Ordering[B]): (LongMapUtils.Long, T)
  106.  def maxByOption[B](f: ((LongMapUtils.Long, T)) => B)(implicit cmp: math.Ordering[B]): Option[(LongMapUtils.Long, T)]
  107.  def maxOption[B >: (LongMapUtils.Long, T)](implicit ord: math.Ordering[B]): Option[(LongMapUtils.Long, T)]
  108.  def min[B >: (LongMapUtils.Long, T)](implicit ord: math.Ordering[B]): (LongMapUtils.Long, T)
  109.  def minBy[B](f: ((LongMapUtils.Long, T)) => B)(implicit cmp: math.Ordering[B]): (LongMapUtils.Long, T)
  110.  def minByOption[B](f: ((LongMapUtils.Long, T)) => B)(implicit cmp: math.Ordering[B]): Option[(LongMapUtils.Long, T)]
  111.  def minOption[B >: (LongMapUtils.Long, T)](implicit ord: math.Ordering[B]): Option[(LongMapUtils.Long, T)]
  112.  final def mkString: String
  113.  final def mkString(sep: String): String
  114.  final def mkString(start: String, sep: String, end: String): String
  115.  def modifyOrRemove[S](f: (LongMapUtils.Long, T) => Option[S]): LongMap[S]
  116.  final def ne(arg0: AnyRef): Boolean
  117.  def newSpecificBuilder: Builder[(LongMapUtils.Long, T), LongMap[T]]
  118.  def nonEmpty: Boolean
  119.  final def notify(): Unit
  120.  final def notifyAll(): Unit
  121.  def orElse[A1 <: LongMapUtils.Long, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  122.  def partition(p: ((LongMapUtils.Long, T)) => Boolean): (LongMap[T], LongMap[T])
  123.  def partitionMap[A1, A2](f: ((LongMapUtils.Long, T)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
  124.  def product[B >: (LongMapUtils.Long, T)](implicit num: math.Numeric[B]): B
  125.  def reduce[B >: (LongMapUtils.Long, T)](op: (B, B) => B): B
  126.  def reduceLeft[B >: (LongMapUtils.Long, T)](op: (B, (LongMapUtils.Long, T)) => B): B
  127.  def reduceLeftOption[B >: (LongMapUtils.Long, T)](op: (B, (LongMapUtils.Long, T)) => B): Option[B]
  128.  def reduceOption[B >: (LongMapUtils.Long, T)](op: (B, B) => B): Option[B]
  129.  def reduceRight[B >: (LongMapUtils.Long, T)](op: ((LongMapUtils.Long, T), B) => B): B
  130.  def reduceRightOption[B >: (LongMapUtils.Long, T)](op: ((LongMapUtils.Long, T), B) => B): Option[B]
  131.  def removed(key: LongMapUtils.Long): LongMap[T]
  132.  def removedAll(keys: IterableOnce[LongMapUtils.Long]): LongMap[T]
  133.  def reversed: collection.Iterable[(LongMapUtils.Long, T)]
  134.  def runWith[U](action: (T) => U): (LongMapUtils.Long) => Boolean
  135.  def scan[B >: (LongMapUtils.Long, T)](z: B)(op: (B, B) => B): Iterable[B]
  136.  def scanLeft[B](z: B)(op: (B, (LongMapUtils.Long, T)) => B): Iterable[B]
  137.  def scanRight[B](z: B)(op: ((LongMapUtils.Long, T), B) => B): Iterable[B]
  138.  final def size: Int
  139.  def sizeCompare(that: collection.Iterable[_]): Int
  140.  def sizeCompare(otherSize: Int): Int
  141.  final def sizeIs: SizeCompareOps
  142.  def slice(from: Int, until: Int): LongMap[T]
  143.  def sliding(size: Int, step: Int): Iterator[LongMap[T]]
  144.  def sliding(size: Int): Iterator[LongMap[T]]
  145.  def span(p: ((LongMapUtils.Long, T)) => Boolean): (LongMap[T], LongMap[T])
  146.  def splitAt(n: Int): (LongMap[T], LongMap[T])
  147.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[(LongMapUtils.Long, T), S]): S
  148.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[(LongMapUtils.Long, T), B]): C2
  149.  final def strictOptimizedConcat[B >: (LongMapUtils.Long, T), C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  150.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: ((LongMapUtils.Long, T)) => IterableOnce[B]): C2
  151.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: ((LongMapUtils.Long, T)) => IterableOnce[B]): C2
  152.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: ((LongMapUtils.Long, T)) => B): C2
  153.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[((LongMapUtils.Long, T), B), C2]): C2
  154.  def stringPrefix: String
  155.  def sum[B >: (LongMapUtils.Long, T)](implicit num: math.Numeric[B]): B
  156.  final def synchronized[T0](arg0: => T0): T0
  157.  def tail: LongMap[T]
  158.  def tails: Iterator[LongMap[T]]
  159.  def take(n: Int): LongMap[T]
  160.  def takeRight(n: Int): LongMap[T]
  161.  def takeWhile(p: ((LongMapUtils.Long, T)) => Boolean): LongMap[T]
  162.  def tapEach[U](f: ((LongMapUtils.Long, T)) => U): LongMap[T]
  163.  def to[C1](factory: Factory[(LongMapUtils.Long, T), C1]): C1
  164.  def toArray[B >: (LongMapUtils.Long, T)](implicit arg0: ClassTag[B]): Array[B]
  165.  final def toBuffer[B >: (LongMapUtils.Long, T)]: Buffer[B]
  166.  def toIndexedSeq: IndexedSeq[(LongMapUtils.Long, T)]
  167.  def toList: List[(LongMapUtils.Long, T)]
  168.  final def toMap[K2, V2](implicit ev: <:<[(LongMapUtils.Long, T), (K2, V2)]): Map[K2, V2]
  169.  def toSeq: Seq[(LongMapUtils.Long, T)]
  170.  def toSet[B >: (LongMapUtils.Long, T)]: Set[B]
  171.  def toString(): String
  172.  def toVector: Vector[(LongMapUtils.Long, T)]
  173.  def transform[S](f: (LongMapUtils.Long, T) => S): LongMap[S]
  174.  def transpose[B](implicit asIterable: ((LongMapUtils.Long, T)) => collection.Iterable[B]): Iterable[Iterable[B]]
  175.  def unapply(a: LongMapUtils.Long): Option[T]
  176.  def unionWith[S >: T](that: LongMap[S], f: (LongMapUtils.Long, S, S) => S): LongMap[S]
  177.  def unlift: PartialFunction[LongMapUtils.Long, B]
  178.  def unzip[A1, A2](implicit asPair: ((LongMapUtils.Long, T)) => (A1, A2)): (Iterable[A1], Iterable[A2])
  179.  def unzip3[A1, A2, A3](implicit asTriple: ((LongMapUtils.Long, T)) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
  180.  def updateWith[S >: T](key: LongMapUtils.Long, value: S, f: (T, S) => S): LongMap[S]
  181.  def updated[S >: T](key: LongMapUtils.Long, value: S): LongMap[S]
  182.  def updatedWith[V1 >: T](key: LongMapUtils.Long)(remappingFunction: (Option[T]) => Option[V1]): Map[LongMapUtils.Long, V1]
  183.  def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
  184.  def values: collection.Iterable[T]
  185.  def valuesIterator: Iterator[T]
  186.  def view: MapView[LongMapUtils.Long, T]
  187.  final def wait(): Unit
  188.  final def wait(arg0: Long, arg1: Int): Unit
  189.  final def wait(arg0: Long): Unit
  190.  def withDefault[V1 >: T](d: (LongMapUtils.Long) => V1): Map[LongMapUtils.Long, V1]
  191.  def withDefaultValue[V1 >: T](d: V1): Map[LongMapUtils.Long, V1]
  192.  def withFilter(p: ((LongMapUtils.Long, T)) => Boolean): MapOps.WithFilter[LongMapUtils.Long, T, [x]Iterable[x], [x, y]Map[x, y]]
  193.  def writeReplace(): AnyRef
  194.  def zip[B](that: IterableOnce[B]): Iterable[((LongMapUtils.Long, T), B)]
  195.  def zipAll[A1 >: (LongMapUtils.Long, T), B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
  196.  def zipWithIndex: Iterable[((LongMapUtils.Long, T), Int)]
Deprecated Value Members
  1.  def +[V1 >: T](elem1: (LongMapUtils.Long, V1), elem2: (LongMapUtils.Long, V1), elems: (LongMapUtils.Long, V1)*): Map[LongMapUtils.Long, V1]
  2.  def ++:[V1 >: T](that: IterableOnce[(LongMapUtils.Long, V1)]): Map[LongMapUtils.Long, V1]
  3.  def ++:[B >: (LongMapUtils.Long, T)](that: IterableOnce[B]): Iterable[B]
  4.  def -(key1: LongMapUtils.Long, key2: LongMapUtils.Long, keys: LongMapUtils.Long*): LongMap[T]
  5.  def /:[B](z: B)(op: (B, (LongMapUtils.Long, T)) => B): B
  6.  final def /:[B](z: B)(op: (B, (LongMapUtils.Long, T)) => B): B
  7.  def :\[B](z: B)(op: ((LongMapUtils.Long, T), B) => B): B
  8.  final def :\[B](z: B)(op: ((LongMapUtils.Long, T), B) => B): B
  9.  def aggregate[B](z: => B)(seqop: (B, (LongMapUtils.Long, T)) => B, combop: (B, B) => B): B
  10.  def collectFirst[B](f: PartialFunction[(LongMapUtils.Long, T), B]): Option[B]
  11.  def companion: IterableFactory[[_]Iterable[_]]
  12.  def copyToBuffer(dest: Buffer[(LongMapUtils.Long, T)]): Unit
  13.  final def copyToBuffer[B >: (LongMapUtils.Long, T)](dest: Buffer[B]): Unit
  14.  def count(f: ((LongMapUtils.Long, T)) => Boolean): Int
  15.  def exists(f: ((LongMapUtils.Long, T)) => Boolean): Boolean
  16.  def filter(f: ((LongMapUtils.Long, T)) => Boolean): Iterator[(LongMapUtils.Long, T)]
  17.  def filterKeys(p: (LongMapUtils.Long) => Boolean): MapView[LongMapUtils.Long, T]
  18.  def find(p: ((LongMapUtils.Long, T)) => Boolean): Option[(LongMapUtils.Long, T)]
  19.  def flatMap[B](f: ((LongMapUtils.Long, T)) => IterableOnce[B]): IterableOnce[B]
  20.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  21.  def foldLeft[B](z: B)(op: (B, (LongMapUtils.Long, T)) => B): B
  22.  def foldRight[B](z: B)(op: ((LongMapUtils.Long, T), B) => B): B
  23.  def forall(f: ((LongMapUtils.Long, T)) => Boolean): Boolean
  24.  def foreach[U](f: ((LongMapUtils.Long, T)) => U): Unit
  25.  def formatted(fmtstr: String): String
  26.  def hasDefiniteSize: Boolean
  27.  def isEmpty: Boolean
  28.  def map[B](f: ((LongMapUtils.Long, T)) => B): IterableOnce[B]
  29.  def mapValues[W](f: (T) => W): MapView[LongMapUtils.Long, W]
  30.  def max(implicit ord: math.Ordering[(LongMapUtils.Long, T)]): (LongMapUtils.Long, T)
  31.  def maxBy[B](f: ((LongMapUtils.Long, T)) => B)(implicit cmp: math.Ordering[B]): (LongMapUtils.Long, T)
  32.  def min(implicit ord: math.Ordering[(LongMapUtils.Long, T)]): (LongMapUtils.Long, T)
  33.  def minBy[B](f: ((LongMapUtils.Long, T)) => B)(implicit cmp: math.Ordering[B]): (LongMapUtils.Long, T)
  34.  def mkString: String
  35.  def mkString(sep: String): String
  36.  def mkString(start: String, sep: String, end: String): String
  37.  def nonEmpty: Boolean
  38.  def product(implicit num: math.Numeric[(LongMapUtils.Long, T)]): (LongMapUtils.Long, T)
  39.  def reduce(f: ((LongMapUtils.Long, T), (LongMapUtils.Long, T)) => (LongMapUtils.Long, T)): (LongMapUtils.Long, T)
  40.  def reduceLeft(f: ((LongMapUtils.Long, T), (LongMapUtils.Long, T)) => (LongMapUtils.Long, T)): (LongMapUtils.Long, T)
  41.  def reduceLeftOption(f: ((LongMapUtils.Long, T), (LongMapUtils.Long, T)) => (LongMapUtils.Long, T)): Option[(LongMapUtils.Long, T)]
  42.  def reduceOption(f: ((LongMapUtils.Long, T), (LongMapUtils.Long, T)) => (LongMapUtils.Long, T)): Option[(LongMapUtils.Long, T)]
  43.  def reduceRight(f: ((LongMapUtils.Long, T), (LongMapUtils.Long, T)) => (LongMapUtils.Long, T)): (LongMapUtils.Long, T)
  44.  def reduceRightOption(f: ((LongMapUtils.Long, T), (LongMapUtils.Long, T)) => (LongMapUtils.Long, T)): Option[(LongMapUtils.Long, T)]
  45.  final def repr: LongMap[T]
  46.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  47.  def seq: LongMap.this.type
  48.  def size: Int
  49.  def sum(implicit num: math.Numeric[(LongMapUtils.Long, T)]): (LongMapUtils.Long, T)
  50.  def to[C1](factory: Factory[(LongMapUtils.Long, T), C1]): C1
  51.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  52.  def toBuffer[B >: A]: Buffer[B]
  53.  def toIndexedSeq: collection.IndexedSeq[(LongMapUtils.Long, T)]
  54.  final def toIterable: collection.Iterable[(LongMapUtils.Long, T)]
  55.  final def toIterable: LongMap.this.type
  56.  def toIterator: Iterator[(LongMapUtils.Long, T)]
  57.  final def toIterator: Iterator[(LongMapUtils.Long, T)]
  58.  def toList: List[(LongMapUtils.Long, T)]
  59.  def toMap[K, V](implicit ev: <:<[(LongMapUtils.Long, T), (K, V)]): Map[K, V]
  60.  def toSeq: Seq[(LongMapUtils.Long, T)]
  61.  def toSet[B >: A]: Set[B]
  62.  def toStream: Stream[(LongMapUtils.Long, T)]
  63.  final def toStream: Stream[(LongMapUtils.Long, T)]
  64.  final def toTraversable: collection.Traversable[(LongMapUtils.Long, T)]
  65.  final def toTraversable: collection.Traversable[(LongMapUtils.Long, T)]
  66.  def toVector: Vector[(LongMapUtils.Long, T)]
  67.  def view(from: Int, until: Int): View[(LongMapUtils.Long, T)]
  68.  def withFilter(f: ((LongMapUtils.Long, T)) => Boolean): Iterator[(LongMapUtils.Long, T)]
  69.  def →[B](y: B): (LongMap[T], B)
Inherited from Map[LongMapUtils.Long, T] Inherited from Iterable[(LongMapUtils.Long, T)]

Inherited from (LongMapUtils.Long) => T

Inherited by implicit conversion UnliftOps fromLongMap[T] to UnliftOps[LongMapUtils.Long, 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