scala.collection.immutable

SortedMap

trait SortedMap[A, +B] extends Map[A, B] with collection.SortedMap[A, B] with MapLike[A, B, SortedMap[A, B]] with SortedMapLike[A, B, SortedMap[A, B]]

A map whose keys are sorted.

A

the type of the keys contained in this sorted map.

B

the type of the values associated with the keys.

Self Type
SortedMap[A, B]
Source
SortedMap.scala
Version

2.8

Since

2.4

Linear Supertypes
collection.SortedMap[A, B], SortedMapLike[A, B, SortedMap[A, B]], Sorted[A, SortedMap[A, B]], Map[A, B], MapLike[A, B, SortedMap[A, B]], collection.Map[A, B], collection.MapLike[A, B, SortedMap[A, B]], Subtractable[A, SortedMap[A, B]], PartialFunction[A, B], (A) ⇒ B, GenMap[A, B], GenMapLike[A, B, SortedMap[A, B]], Iterable[(A, B)], collection.Iterable[(A, B)], IterableLike[(A, B), SortedMap[A, B]], Equals, GenIterable[(A, B)], GenIterableLike[(A, B), SortedMap[A, B]], Traversable[(A, B)], Immutable, collection.Traversable[(A, B)], GenTraversable[(A, B)], GenericTraversableTemplate[(A, B), Iterable], TraversableLike[(A, B), SortedMap[A, B]], GenTraversableLike[(A, B), SortedMap[A, B]], Parallelizable[(A, B), ParMap[A, B]], TraversableOnce[(A, B)], GenTraversableOnce[(A, B)], FilterMonadic[(A, B), SortedMap[A, B]], HasNewBuilder[(A, B), SortedMap[A, B]], AnyRef, Any
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SortedMap
  2. SortedMap
  3. SortedMapLike
  4. Sorted
  5. Map
  6. MapLike
  7. Map
  8. MapLike
  9. Subtractable
  10. PartialFunction
  11. Function1
  12. GenMap
  13. GenMapLike
  14. Iterable
  15. Iterable
  16. IterableLike
  17. Equals
  18. GenIterable
  19. GenIterableLike
  20. Traversable
  21. Immutable
  22. Traversable
  23. GenTraversable
  24. GenericTraversableTemplate
  25. TraversableLike
  26. GenTraversableLike
  27. Parallelizable
  28. TraversableOnce
  29. GenTraversableOnce
  30. FilterMonadic
  31. HasNewBuilder
  32. AnyRef
  33. Any
Implicitly
  1. by traversable2ops
  2. by MonadOps
  3. by StringAdd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  7. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class DefaultKeySet extends AbstractSet[A] with Set[A] with Serializable

    The implementation class of the set returned by keySet.

  2. class DefaultKeySortedSet extends SortedMap.DefaultKeySortedSet with SortedSet[A]

    Attributes
    protected
  3. class DefaultValuesIterable extends AbstractIterable[B] with Iterable[B] with Serializable

    The implementation class of the iterable returned by values.

  4. class FilteredKeys extends AbstractMap[A, B] with DefaultMap[A, B]

    Attributes
    protected
    Definition Classes
    MapLike
  5. class ImmutableDefaultKeySet extends DefaultKeySet with Set[A]

    Attributes
    protected
    Definition Classes
    MapLike
  6. class MappedValues[C] extends AbstractMap[A, C] with DefaultMap[A, C]

    Attributes
    protected
    Definition Classes
    MapLike
  7. type Self = SortedMap[A, B]

    The type implementing this traversable

    The type implementing this traversable

    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  8. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Abstract Value Members

  1. abstract def get(key: A): Option[B]

    Optionally returns the value associated with a key.

    Optionally returns the value associated with a key.

    key

    the key value

    returns

    an option value containing the value associated with key in this map, or None if none exists.

    Definition Classes
    MapLikeGenMapLike
  2. abstract def iterator: Iterator[(A, B)]

    Creates a new iterator over all key/value pairs of this map

    Creates a new iterator over all key/value pairs of this map

    returns

    the new iterator

    Definition Classes
    MapLikeIterableLikeGenIterableLike
  3. abstract def iteratorFrom(start: A): Iterator[(A, B)]

    Creates an iterator over all the key/value pairs contained in this map having a key greater than or equal to start according to the ordering of this map.

    Creates an iterator over all the key/value pairs contained in this map having a key greater than or equal to start according to the ordering of this map. x.iteratorFrom(y) is equivalent to but often more efficient than x.from(y).iterator.

    start

    The lower bound (inclusive) on the keys to be returned

    Definition Classes
    SortedMapLike
  4. abstract def keysIteratorFrom(start: A): Iterator[A]

    Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to start according to the ordering of this collection.

    Creates an iterator over all the keys(or elements) contained in this collection greater than or equal to start according to the ordering of this collection. x.keysIteratorFrom(y) is equivalent to but often more efficient than x.from(y).keysIterator.

    start

    The lower bound (inclusive) on the keys to be returned

    Definition Classes
    Sorted
  5. implicit abstract def ordering: Ordering[A]

    Definition Classes
    SortedMapLikeSorted
  6. abstract def rangeImpl(from: Option[A], until: Option[A]): SortedMap[A, B]

    Creates a ranged projection of this collection.

    Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa.

    Note: keys are not garuanteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.

    from

    The lower-bound (inclusive) of the ranged projection. None if there is no lower bound.

    until

    The upper-bound (exclusive) of the ranged projection. None if there is no upper bound.

    Definition Classes
    SortedMapLikeSorted
  7. abstract def valuesIteratorFrom(start: A): Iterator[B]

    Creates an iterator over all the values contained in this map that are associated with a key greater than or equal to start according to the ordering of this map.

    Creates an iterator over all the values contained in this map that are associated with a key greater than or equal to start according to the ordering of this map. x.valuesIteratorFrom(y) is equivalent to but often more efficient than x.from(y).valuesIterator.

    start

    The lower bound (inclusive) on the keys to be returned

    Definition Classes
    SortedMapLike

Concrete Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def +[B1 >: B](elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): SortedMap[A, B1]

    Adds two or more elements to this collection and returns a new collection.

    Adds two or more elements to this collection and returns a new collection.

    B1

    the type of the added values

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    returns

    a new map with the given bindings added to this map

    Definition Classes
    SortedMapSortedMapLikeMapLikeMapLike
  5. def +[B1 >: B](kv: (A, B1)): SortedMap[A, B1]

    Add a key/value pair to this map.

    Add a key/value pair to this map.

    B1

    the type of the value in the key/value pair.

    kv

    the key/value pair

    returns

    A new map with the new binding added to this map

    Definition Classes
    SortedMapSortedMapLikeMapMapLikeMapLikeGenMapLike
    Note

    needs to be overridden in subclasses

  6. def ++[B1 >: B](xs: GenTraversableOnce[(A, B1)]): SortedMap[A, B1]

    Adds a number of elements provided by a traversable object and returns a new collection with the added elements.

    Adds a number of elements provided by a traversable object and returns a new collection with the added elements.

    B1

    the type of the added values

    xs

    the traversable object.

    returns

    a new map with the given bindings added to this map

    Definition Classes
    SortedMapSortedMapLikeMapLikeMapLike
  7. def ++[B](that: GenTraversableOnce[B]): SortedMap[B]

    [use case] Returns a new immutable sorted map containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new immutable sorted map containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the immutable sorted map is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = LinkedList(1)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val b = LinkedList(2)
    b: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val c = a ++ b
    c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    scala> val d = LinkedList('a')
    d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)
    
    scala> val e = c ++ d
    e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new immutable sorted map which contains all elements of this immutable sorted map followed by all elements of that.

    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: (A, B), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[SortedMap[A, B], B, That]): That

  8. def ++:[B >: (A, B), That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[SortedMap[A, B], B, That]): That

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    Since TraversableOnce has no ++ method, we have to implement that directly, but Traversable and down can use the overload.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    a new collection of type That which contains all elements of this immutable sorted map followed by all elements of that.

    Definition Classes
    TraversableLike
  9. def ++:[B](that: TraversableOnce[B]): SortedMap[B]

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new immutable sorted map which contains all elements of this immutable sorted map followed by all elements of that.

    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: (A, B), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[SortedMap[A, B], B, That]): That

  10. def -(elem1: A, elem2: A, elems: A*): SortedMap[A, B]

    Creates a new immutable sorted map from this immutable sorted map with some elements removed.

    Creates a new immutable sorted map from this immutable sorted map with some elements removed.

    This method takes two or more elements to be removed. Another overloaded variant of this method handles the case where a single element is removed.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new immutable sorted map that contains all elements of the current immutable sorted map except one less occurrence of each of the given elements.

    Definition Classes
    Subtractable
  11. abstract def -(key: A): collection.Map[A, B]

    [use case] Removes a key from this map, returning a new map.

    [use case]

    Removes a key from this map, returning a new map.

    key

    the key to be removed

    returns

    a new map without a binding for key

    Definition Classes
    MapLikeSubtractableGenMapLike
    Full Signature

    abstract def -(key: A): SortedMap[A, B]

  12. def --(xs: GenTraversableOnce[A]): SortedMap[A, B]

    Creates a new immutable sorted map from this immutable sorted map by removing all elements of another collection.

    Creates a new immutable sorted map from this immutable sorted map by removing all elements of another collection.

    xs

    the collection containing the removed elements.

    returns

    a new immutable sorted map that contains all elements of the current immutable sorted map except one less occurrence of each of the elements of elems.

    Definition Classes
    Subtractable
  13. def ->[B](y: B): (SortedMap[A, B], B)

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to ArrowAssoc[SortedMap[A, B]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  14. def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B

    Applies a binary operator to a start value and all elements of this immutable sorted map, going left to right.

    Applies a binary operator to a start value and all elements of this immutable sorted map, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (5 /: a)(_+_)
    b: Int = 15
    
    scala> val c = (5 /: a)((x,y) => x + y)
    c: Int = 15

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable sorted map, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  15. def :\[B](z: B)(op: ((A, B), B) ⇒ B): B

    Applies a binary operator to all elements of this immutable sorted map and a start value, going right to left.

    Applies a binary operator to all elements of this immutable sorted map and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (a :\ 5)(_+_)
    b: Int = 15
    
    scala> val c = (a :\ 5)((x,y) => x + y)
    c: Int = 15
    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this immutable sorted map, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  16. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  18. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all bindings of this map to a string builder using start, end, and separator strings.

    Appends all bindings of this map to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations of all bindings of this map in the form of key -> value are separated by the string sep.

    b

    the builder to which strings are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    MapLikeTraversableOnce
  19. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this immutable sorted map to a string builder.

    Appends all elements of this immutable sorted map to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this immutable sorted map without any separator string.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    b: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  20. def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this immutable sorted map to a string builder using a separator string.

    Appends all elements of this immutable sorted map to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this immutable sorted map, separated by the string sep.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, ", ")
    res0: StringBuilder = 1, 2, 3, 4
    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  21. def aggregate[B](z: ⇒ B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked an arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

    pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    B

    the type of accumulated results

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation) and may be evaluated more than once

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  22. def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    Definition Classes
    PartialFunctionFunction1
  23. def apply(key: A): B

    Retrieves the value which is associated with the given key.

    Retrieves the value which is associated with the given key. This method invokes the default method of the map if there is no mapping from the given key to a value. Unless overridden, the default method throws a NoSuchElementException.

    key

    the key

    returns

    the value associated with the given key, or the result of the map's default method, if none exists.

    Definition Classes
    MapLikeGenMapLikeFunction1
  24. def applyOrElse[A1 <: A, B1 >: B](x: A1, default: (A1) ⇒ B1): B1

    Applies this partial function to the given argument when it is contained in the function domain.

    Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.

    Note that expression pf.applyOrElse(x, default) is equivalent to

    if(pf isDefinedAt x) pf(x) else default(x)

    except that applyOrElse method can be implemented more efficiently. For all partial function literals compiler generates applyOrElse implementation which avoids double evaluation of pattern matchers and guards. This makes applyOrElse the basis for the efficient implementation for many operations and scenarios, such as:

    • combining partial functions into orElse/andThen chains does not lead to excessive apply/isDefinedAt evaluation
    • lift and unlift do not evaluate source functions twice on each invocation
    • runWith allows efficient imperative-style combining of partial functions with conditionally applied actions

    For non-literal partial function classes with nontrivial isDefinedAt method it is recommended to override applyOrElse with custom implementation that avoids double isDefinedAt evaluation. This may result in better performance and more predictable behavior w.r.t. side effects.

    x

    the function argument

    default

    the fallback function

    returns

    the result of this function or fallback function application.

    Definition Classes
    PartialFunction
    Since

    2.10

  25. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  26. def asParIterable: ParIterable[(A, B)]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to TraversableOps[(A, B)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  27. def asParSeq: ParSeq[(A, B)]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to TraversableOps[(A, B)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  28. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this immutable sorted map should be compared

    returns

    true, if this immutable sorted map can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
    IterableLikeEquals
  29. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  30. def collect[B](pf: PartialFunction[A, B]): SortedMap[B]

    [use case] Builds a new collection by applying a partial function to all elements of this immutable sorted map on which the function is defined.

    [use case]

    Builds a new collection by applying a partial function to all elements of this immutable sorted map on which the function is defined.

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the immutable sorted map.

    returns

    a new immutable sorted map resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[SortedMap[A, B], B, That]): That

  31. def collectFirst[B](pf: PartialFunction[(A, B), B]): Option[B]

    Finds the first element of the immutable sorted map for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the immutable sorted map for which the given partial function is defined, and applies the partial function to it.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    pf

    the partial function

    returns

    an option value containing pf applied to the first value for which it is defined, or None if none exists.

    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  32. def companion: GenericCompanion[Iterable]

    The factory companion object that builds instances of class immutable.

    The factory companion object that builds instances of class immutable.SortedMap. (or its Iterable superclass where class immutable.SortedMap is not a Seq.)

    Definition Classes
    IterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  33. def compare(k0: A, k1: A): Int

    Comparison function that orders keys.

    Comparison function that orders keys.

    Definition Classes
    Sorted
  34. def compose[A](g: (A) ⇒ A): (A) ⇒ B

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

    a new function f such that f(x) == apply(g(x))

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  35. def contains(key: A): Boolean

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key.

    key

    the key

    returns

    true if there is a binding for key in this map, false otherwise.

    Definition Classes
    MapLikeGenMapLike
  36. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    [use case] Copies elements of this immutable sorted map to an array.

    [use case]

    Copies elements of this immutable sorted map to an array. Fills the given array xs with at most len elements of this immutable sorted map, starting at position start. Copying will stop once either the end of the current immutable sorted map is reached, or the end of the array is reached, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

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

  37. def copyToArray(xs: Array[A]): Unit

    [use case] Copies values of this immutable sorted map to an array.

    [use case]

    Copies values of this immutable sorted map to an array. Fills the given array xs with values of this immutable sorted map. Copying will stop once either the end of the current immutable sorted map is reached, or the end of the array is reached.

    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def copyToArray[B >: (A, B)](xs: Array[B]): Unit

  38. def copyToArray(xs: Array[A], start: Int): Unit

    [use case] Copies values of this immutable sorted map to an array.

    [use case]

    Copies values of this immutable sorted map to an array. Fills the given array xs with values of this immutable sorted map, beginning at index start. Copying will stop once either the end of the current immutable sorted map is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

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

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

    Copies all elements of this immutable sorted map to a buffer.

    Copies all elements of this immutable sorted map to a buffer.

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  40. def count(p: ((A, B)) ⇒ Boolean): Int

    Counts the number of elements in the immutable sorted map which satisfy a predicate.

    Counts the number of elements in the immutable sorted map which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  41. def default(key: A): B

    Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.

    Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.

    key

    the given key value for which a binding is missing.

    Definition Classes
    MapLikeGenMapLike
    Exceptions thrown
    `NoSuchElementException`

  42. def drop(n: Int): SortedMap[A, B]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to drop from this immutable sorted map.

    returns

    a immutable sorted map consisting of all elements of this immutable sorted map except the first n ones, or else the empty immutable sorted map, if this immutable sorted map has less than n elements.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  43. def dropRight(n: Int): SortedMap[A, B]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    The number of elements to take

    returns

    a immutable sorted map consisting of all elements of this immutable sorted map except the last n ones, or else the empty immutable sorted map, if this immutable sorted map has less than n elements.

    Definition Classes
    IterableLike
  44. def dropWhile(p: ((A, B)) ⇒ Boolean): SortedMap[A, B]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the longest suffix of this immutable sorted map whose first element does not satisfy the predicate p.

    Definition Classes
    TraversableLikeGenTraversableLike
  45. def empty: SortedMap[A, B]

    Needs to be overridden in subclasses.

    Needs to be overridden in subclasses.

    returns

    an empty map of type This.

    Definition Classes
    SortedMapSortedMapMapMapMapLike
  46. def ensuring(cond: (SortedMap[A, B]) ⇒ Boolean, msg: ⇒ Any): SortedMap[A, B]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to Ensuring[SortedMap[A, B]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. def ensuring(cond: (SortedMap[A, B]) ⇒ Boolean): SortedMap[A, B]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to Ensuring[SortedMap[A, B]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  48. def ensuring(cond: Boolean, msg: ⇒ Any): SortedMap[A, B]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to Ensuring[SortedMap[A, B]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  49. def ensuring(cond: Boolean): SortedMap[A, B]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to Ensuring[SortedMap[A, B]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  50. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  51. def equals(that: Any): Boolean

    Compares two maps structurally; i.

    Compares two maps structurally; i.e. checks if all mappings contained in this map are also contained in the other map, and vice versa.

    that

    the other map

    returns

    true if both maps contain exactly the same mappings, false otherwise.

    Definition Classes
    GenMapLikeEquals → AnyRef → Any
  52. def exists(p: ((A, B)) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this immutable sorted map.

    Tests whether a predicate holds for some of the elements of this immutable sorted map.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this immutable sorted map, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  53. def filter(p: ((A, B)) ⇒ Boolean): SortedMap[A, B]

    Selects all elements of this immutable sorted map which satisfy a predicate.

    Selects all elements of this immutable sorted map which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new immutable sorted map consisting of all elements of this immutable sorted map that satisfy the given predicate p. The order of the elements is preserved.

    Definition Classes
    TraversableLikeGenTraversableLike
  54. def filterKeys(p: (A) ⇒ Boolean): SortedMap[A, B]

    Filters this map by retaining only keys satisfying a predicate.

    Filters this map by retaining only keys satisfying a predicate.

    p

    the predicate used to test keys

    returns

    an immutable map consisting only of those key value pairs of this map where the key satisfies the predicate p. The resulting map wraps the original map without copying any elements.

    Definition Classes
    SortedMapSortedMapLikeMapLikeMapLikeGenMapLike
  55. def filterNot(p: ((A, B)) ⇒ Boolean): SortedMap[A, B]

    Returns a new map obtained by removing all key/value pairs for which the predicate p returns true.

    Returns a new map obtained by removing all key/value pairs for which the predicate p returns true.

    Note: This method works by successively removing elements for which the predicate is true from this set. If removal is slow, or you expect that most elements of the set will be removed, you might consider using filter with a negated predicate instead.

    p

    A predicate over key-value pairs

    returns

    A new map containing elements not satisfying the predicate.

    Definition Classes
    MapLikeTraversableLikeGenTraversableLike
  56. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  57. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]

    Finds the first element of the immutable sorted map satisfying a predicate, if any.

    Finds the first element of the immutable sorted map satisfying a predicate, if any.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the immutable sorted map that satisfies p, or None if none exists.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  58. def firstKey: A

    Returns the first key of the collection.

    Returns the first key of the collection.

    Definition Classes
    SortedMapLikeSorted
  59. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): SortedMap[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable sorted map and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this immutable sorted map and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of immutable sorted map. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new immutable sorted map resulting from applying the given collection-valued function f to each element of this immutable sorted map and concatenating the results.

    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[SortedMap[A, B], B, That]): That

  60. def flatten[B]: SortedMap[B]

    [use case] Converts this immutable sorted map of traversable collections into a immutable sorted map formed by the elements of these traversable collections.

    [use case]

    Converts this immutable sorted map of traversable collections into a immutable sorted map formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the static type of immutable sorted map. For example:

    val xs = List(Set(1, 2, 3), Set(1, 2, 3))
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(List(1, 2, 3), List(3, 2, 1))
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

    a new immutable sorted map resulting from concatenating all element immutable sorted maps.

    Definition Classes
    GenericTraversableTemplate
    Full Signature

    def flatten[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[B]

  61. def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this immutable sorted map using the specified associative binary operator.

    Folds the elements of this immutable sorted map using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

    a type parameter for the binary operator, a supertype of A.

    z

    a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.)

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Definition Classes
    TraversableOnceGenTraversableOnce
  62. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B

    Applies a binary operator to a start value and all elements of this immutable sorted map, going left to right.

    Applies a binary operator to a start value and all elements of this immutable sorted map, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable sorted map, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  63. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B

    Applies a binary operator to all elements of this immutable sorted map and a start value, going right to left.

    Applies a binary operator to all elements of this immutable sorted map and a start value, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable sorted map, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this immutable sorted map.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  64. def forall(p: ((A, B)) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this immutable sorted map.

    Tests whether a predicate holds for all elements of this immutable sorted map.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this immutable sorted map, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  65. def foreach(f: ((A, B)) ⇒ Unit): Unit

    [use case] Applies a function f to all elements of this immutable sorted map.

    [use case]

    Applies a function f to all elements of this immutable sorted map.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
    Full Signature

    def foreach[U](f: ((A, B)) ⇒ U): Unit

  66. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to StringFormat[SortedMap[A, B]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  67. def from(from: A): SortedMap[A, B]

    Creates a ranged projection of this collection with no upper-bound.

    Creates a ranged projection of this collection with no upper-bound.

    from

    The lower-bound (inclusive) of the ranged projection.

    Definition Classes
    Sorted
  68. def genericBuilder[B]: Builder[B, Iterable[B]]

    The generic builder that builds instances of immutable.

    The generic builder that builds instances of immutable.SortedMap at arbitrary element types.

    Definition Classes
    GenericTraversableTemplate
  69. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  70. def getOrElse(key: A, default: ⇒ B): B

    [use case] Returns the value associated with a key, or a default value if the key is not contained in the map.

    [use case]

    Returns the value associated with a key, or a default value if the key is not contained in the map.

    key

    the key.

    default

    a computation that yields a default value in case no binding for key is found in the map.

    returns

    the value associated with key if it exists, otherwise the result of the default computation.

    Definition Classes
    MapLikeGenMapLike
    Full Signature

    def getOrElse[B1 >: B](key: A, default: ⇒ B1): B1

  71. def groupBy[K](f: ((A, B)) ⇒ K): Map[K, SortedMap[A, B]]

    Partitions this immutable sorted map into a map of immutable sorted maps according to some discriminator function.

    Partitions this immutable sorted map into a map of immutable sorted maps according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new immutable sorted map.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to immutable sorted maps such that the following invariant holds:

    (xs partition f)(k) = xs filter (x => f(x) == k)

    That is, every key k is bound to a immutable sorted map of those elements x for which f(x) equals k.

    Definition Classes
    TraversableLikeGenTraversableLike
  72. def grouped(size: Int): Iterator[SortedMap[A, B]]

    Partitions elements in fixed size immutable sorted maps.

    Partitions elements in fixed size immutable sorted maps.

    size

    the number of elements per group

    returns

    An iterator producing immutable sorted maps of size size, except the last will be truncated if the elements don't divide evenly.

    Definition Classes
    IterableLike
    See also

    scala.collection.Iterator, method grouped

  73. def hasAll(j: Iterator[A]): Boolean

    Attributes
    protected
    Definition Classes
    Sorted
  74. def hasDefiniteSize: Boolean

    Tests whether this immutable sorted map is known to have a finite size.

    Tests whether this immutable sorted map is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

    true if this collection is known to have finite size, false otherwise.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  75. def hashCode(): Int

    Definition Classes
    GenMapLike → AnyRef → Any
  76. def head: (A, B)

    Selects the first element of this immutable sorted map.

    Selects the first element of this immutable sorted map.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this immutable sorted map.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the immutable sorted map is empty.

  77. def headOption: Option[(A, B)]

    Optionally selects the first element.

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this immutable sorted map if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLikeGenTraversableLike
  78. def ifParSeq[R](isbody: (ParSeq[(A, B)]) ⇒ R): (TraversableOps[(A, B)])#Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to TraversableOps[(A, B)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  79. def init: SortedMap[A, B]

    Selects all elements except the last.

    Selects all elements except the last.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a immutable sorted map consisting of all elements of this immutable sorted map except the last one.

    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the immutable sorted map is empty.

  80. def inits: Iterator[SortedMap[A, B]]

    Iterates over the inits of this immutable sorted map.

    Iterates over the inits of this immutable sorted map. The first value will be this immutable sorted map and the final one will be an empty immutable sorted map, with the intervening values the results of successive applications of init.

    returns

    an iterator over all the inits of this immutable sorted map

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  81. def isDefinedAt(key: A): Boolean

    Tests whether this map contains a binding for a key.

    Tests whether this map contains a binding for a key. This method, which implements an abstract method of trait PartialFunction, is equivalent to contains.

    key

    the key

    returns

    true if there is a binding for key in this map, false otherwise.

    Definition Classes
    MapLikeGenMapLikePartialFunction
  82. def isEmpty: Boolean

    Tests whether the map is empty.

    Tests whether the map is empty.

    returns

    true if the map does not contain any key/value binding, false otherwise.

    Definition Classes
    MapLikeIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  83. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  84. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to TraversableOps[(A, B)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  85. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to TraversableOps[(A, B)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  86. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to TraversableOps[(A, B)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  87. final def isTraversableAgain: Boolean

    Tests whether this immutable sorted map can be repeatedly traversed.

    Tests whether this immutable sorted map can be repeatedly traversed.

    returns

    true

    Definition Classes
    TraversableLikeGenTraversableLikeGenTraversableOnce
  88. def keySet: SortedSet[A]

    Collects all keys of this map in a set.

    Collects all keys of this map in a set.

    returns

    a set containing all keys of this map.

    Definition Classes
    SortedMapSortedMapLikeSortedMapLikeMapLikeGenMapLike
  89. def keys: collection.Iterable[A]

    Collects all keys of this map in an iterable collection.

    Collects all keys of this map in an iterable collection.

    returns

    the keys of this map as an iterable.

    Definition Classes
    MapLikeGenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) keys returns Iterable[A] rather than Iterator[A].

  90. def keysIterator: Iterator[A]

    Creates an iterator for all keys.

    Creates an iterator for all keys.

    returns

    an iterator over all keys.

    Definition Classes
    MapLikeGenMapLike
  91. def last: (A, B)

    Selects the last element.

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    The last element of this immutable sorted map.

    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    NoSuchElementException

    If the immutable sorted map is empty.

  92. def lastKey: A

    Returns the last key of the collection.

    Returns the last key of the collection.

    Definition Classes
    SortedMapLikeSorted
  93. def lastOption: Option[(A, B)]

    Optionally selects the last element.

    Optionally selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the last element of this immutable sorted map$ if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLikeGenTraversableLike
  94. def lift: (A) ⇒ Option[B]

    Turns this partial function into an plain function returning an Option result.

    Turns this partial function into an plain function returning an Option result.

    returns

    a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.

    Definition Classes
    PartialFunction
    See also

    Function.unlift

  95. def map[B](f: (A) ⇒ B): SortedMap[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable sorted map.

    [use case]

    Builds a new collection by applying a function to all elements of this immutable sorted map.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new immutable sorted map resulting from applying the given function f to each element of this immutable sorted map and collecting the results.

    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[SortedMap[A, B], B, That]): That

  96. def mapValues[C](f: (B) ⇒ C): SortedMap[A, C]

    Transforms this map by applying a function to every retrieved value.

    Transforms this map by applying a function to every retrieved value.

    f

    the function used to transform values of this map.

    returns

    a map view which maps every key of this map to f(this(key)). The resulting map wraps the original map without copying any elements.

    Definition Classes
    SortedMapSortedMapLikeMapLikeMapLikeGenMapLike
  97. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)

  98. def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnceGenTraversableOnce
  99. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this immutable sorted map

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

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

  100. def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnceGenTraversableOnce
  101. def mkString: String

    Displays all elements of this immutable sorted map in a string.

    Displays all elements of this immutable sorted map in a string.

    returns

    a string representation of this immutable sorted map. In the resulting string the string representations (w.r.t. the method toString) of all elements of this immutable sorted map follow each other without any separator string.

    Definition Classes
    TraversableOnceGenTraversableOnce
  102. def mkString(sep: String): String

    Displays all elements of this immutable sorted map in a string using a separator string.

    Displays all elements of this immutable sorted map in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this immutable sorted map. In the resulting string the string representations (w.r.t. the method toString) of all elements of this immutable sorted map are separated by the string sep.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

    Displays all elements of this immutable sorted map in a string using start, end, and separator strings.

    Displays all elements of this immutable sorted map in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this immutable sorted map. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this immutable sorted map are separated by the string sep.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  104. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  105. def newBuilder: Builder[(A, B), SortedMap[A, B]]

    A common implementation of newBuilder for all maps in terms of empty.

    A common implementation of newBuilder for all maps in terms of empty. Overridden for mutable maps in mutable.MapLike.

    Attributes
    protected[this]
    Definition Classes
    SortedMapSortedMapMapLikeGenericTraversableTemplateTraversableLikeHasNewBuilder
  106. def nonEmpty: Boolean

    Tests whether the immutable sorted map is not empty.

    Tests whether the immutable sorted map is not empty.

    returns

    true if the immutable sorted map contains at least one element, false otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  107. final def notify(): Unit

    Definition Classes
    AnyRef
  108. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  109. def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

    a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.

    Definition Classes
    PartialFunction
  110. def par: ParMap[A, B]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    Parallelizable
  111. def parCombiner: Combiner[(A, B), ParMap[A, B]]

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    MapLikeMapLikeTraversableLikeParallelizable
  112. def partition(p: ((A, B)) ⇒ Boolean): (SortedMap[A, B], SortedMap[A, B])

    Partitions this immutable sorted map in two immutable sorted maps according to a predicate.

    Partitions this immutable sorted map in two immutable sorted maps according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of immutable sorted maps: the first immutable sorted map consists of all elements that satisfy the predicate p and the second immutable sorted map consists of all elements that don't. The relative order of the elements in the resulting immutable sorted maps is the same as in the original immutable sorted map.

    Definition Classes
    TraversableLikeGenTraversableLike
  113. def product: A

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this immutable sorted map of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the immutable sorted map and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def product[B >: (A, B)](implicit num: Numeric[B]): B

  114. def range(from: A, until: A): SortedMap[A, B]

    Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

    Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

    from

    The upper-bound (exclusive) of the ranged projection.

    Definition Classes
    Sorted
  115. def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this immutable sorted map using the specified associative binary operator.

    Reduces the elements of this immutable sorted map using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the immutable sorted map is nonempty.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this immutable sorted map is empty.

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

    Applies a binary operator to all elements of this immutable sorted map, going left to right.

    Applies a binary operator to all elements of this immutable sorted map, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable sorted map, going left to right:

    op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)

    where x1, ..., xn are the elements of this immutable sorted map.

    Definition Classes
    TraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this immutable sorted map is empty.

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

    Optionally applies a binary operator to all elements of this immutable sorted map, going left to right.

    Optionally applies a binary operator to all elements of this immutable sorted map, going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this immutable sorted map is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  118. def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]

    Reduces the elements of this immutable sorted map, if any, using the specified associative binary operator.

    Reduces the elements of this immutable sorted map, if any, using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    A1

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  119. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B

    Applies a binary operator to all elements of this immutable sorted map, going right to left.

    Applies a binary operator to all elements of this immutable sorted map, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this immutable sorted map, going right to left:

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this immutable sorted map.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this immutable sorted map is empty.

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

    Optionally applies a binary operator to all elements of this immutable sorted map, going right to left.

    Optionally applies a binary operator to all elements of this immutable sorted map, going right to left.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this immutable sorted map is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  121. def repr: SortedMap[A, B]

    The collection of type immutable sorted map underlying this TraversableLike object.

    The collection of type immutable sorted map underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    Definition Classes
    TraversableLikeGenTraversableLike
  122. def reversed: scala.List[(A, B)]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  123. def runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean

    Composes this partial function with an action function which gets applied to results of this partial function.

    Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.

    Note that expression pf.runWith(action)(x) is equivalent to

    if(pf isDefinedAt x) { action(pf(x)); true } else false

    except that runWith is implemented via applyOrElse and thus potentially more efficient. Using runWith avoids double evaluation of pattern matchers and guards for partial function literals.

    action

    the action function

    returns

    a function which maps arguments x to isDefinedAt(x). The resulting function runs action(this(x)) where this is defined.

    Definition Classes
    PartialFunction
    Since

    2.10

    See also

    applyOrElse.

  124. def sameElements(that: GenIterable[A]): Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this immutable sorted map.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this immutable sorted map.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def sameElements[B >: (A, B)](that: GenIterable[B]): Boolean

  125. def scan[B >: (A, B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[SortedMap[A, B], B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new immutable sorted map containing the prefix scan of the elements in this immutable sorted map

    Definition Classes
    TraversableLikeGenTraversableLike
  126. def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[SortedMap[A, B], B, That]): That

    Produces a collection containing cumulative results of applying the operator going left to right.

    Produces a collection containing cumulative results of applying the operator going left to right.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
  127. def scanRight[B, That](z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[SortedMap[A, B], B, That]): That

    Produces a collection containing cumulative results of applying the operator going right to left.

    Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    Example:

    List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  128. def seq: Map[A, B]

    A version of this collection with all of the operations implemented sequentially (i.

    A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

    This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

    returns

    a sequential view of the collection.

    Definition Classes
    MapMapGenMapGenMapLikeIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  129. def size: Int

    The size of this immutable sorted map.

    The size of this immutable sorted map.

    returns

    the number of elements in this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  130. def slice(from: Int, until: Int): SortedMap[A, B]

    Selects an interval of elements.

    Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:

    from <= indexOf(x) < until

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a immutable sorted map containing the elements greater than or equal to index from extending up to (but not including) index until of this immutable sorted map.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  131. def sliding(size: Int, step: Int): Iterator[SortedMap[A, B]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    step

    the distance between the first elements of successive groups (defaults to 1)

    returns

    An iterator producing immutable sorted maps of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    scala.collection.Iterator, method sliding

  132. def sliding(size: Int): Iterator[SortedMap[A, B]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    returns

    An iterator producing immutable sorted maps of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    scala.collection.Iterator, method sliding

  133. def span(p: ((A, B)) ⇒ Boolean): (SortedMap[A, B], SortedMap[A, B])

    Splits this immutable sorted map into a prefix/suffix pair according to a predicate.

    Splits this immutable sorted map into a prefix/suffix pair according to a predicate.

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a pair consisting of the longest prefix of this immutable sorted map whose elements all satisfy p, and the rest of this immutable sorted map.

    Definition Classes
    TraversableLikeGenTraversableLike
  134. def splitAt(n: Int): (SortedMap[A, B], SortedMap[A, B])

    Splits this immutable sorted map into two at a given position.

    Splits this immutable sorted map into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the position at which to split.

    returns

    a pair of immutable sorted maps consisting of the first n elements of this immutable sorted map, and the other elements.

    Definition Classes
    TraversableLikeGenTraversableLike
  135. def stringPrefix: String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this immutable sorted map. Unless overridden in subclasses, the string prefix of every map is "Map".

    Definition Classes
    MapLikeTraversableLikeGenTraversableLike
  136. def sum: A

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this immutable sorted map of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the immutable sorted map and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def sum[B >: (A, B)](implicit num: Numeric[B]): B

  137. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  138. def tail: SortedMap[A, B]

    Selects all elements except the first.

    Selects all elements except the first.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a immutable sorted map consisting of all elements of this immutable sorted map except the first one.

    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the immutable sorted map is empty.

  139. def tails: Iterator[SortedMap[A, B]]

    Iterates over the tails of this immutable sorted map.

    Iterates over the tails of this immutable sorted map. The first value will be this immutable sorted map and the final one will be an empty immutable sorted map, with the intervening values the results of successive applications of tail.

    returns

    an iterator over all the tails of this immutable sorted map

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  140. def take(n: Int): SortedMap[A, B]

    Selects first n elements.

    Selects first n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to take from this immutable sorted map.

    returns

    a immutable sorted map consisting only of the first n elements of this immutable sorted map, or else the whole immutable sorted map, if it has less than n elements.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  141. def takeRight(n: Int): SortedMap[A, B]

    Selects last n elements.

    Selects last n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to take

    returns

    a immutable sorted map consisting only of the last n elements of this immutable sorted map, or else the whole immutable sorted map, if it has less than n elements.

    Definition Classes
    IterableLike
  142. def takeWhile(p: ((A, B)) ⇒ Boolean): SortedMap[A, B]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the longest prefix of this immutable sorted map whose elements all satisfy the predicate p.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  143. def thisCollection: collection.Iterable[(A, B)]

    The underlying collection seen as an instance of immutable.SortedMap.

    The underlying collection seen as an instance of immutable.SortedMap. By default this is implemented as the current collection object itself, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  144. def to(to: A): SortedMap[A, B]

    Create a range projection of this collection with no lower-bound.

    Create a range projection of this collection with no lower-bound.

    to

    The upper-bound (inclusive) of the ranged projection.

    Definition Classes
    Sorted
  145. def to[Col[_]]: Col[A]

    [use case] Converts this immutable sorted map into another by copying all elements.

    [use case]

    Converts this immutable sorted map into another by copying all elements.

    Col

    The collection type to build.

    returns

    a new collection containing all elements of this immutable sorted map.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

    def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B), Col[(A, B)]]): Col[(A, B)]

  146. def toArray: Array[A]

    [use case] Converts this immutable sorted map to an array.

    [use case]

    Converts this immutable sorted map to an array.

    returns

    an array containing all elements of this immutable sorted map. An ClassTag must be available for the element type of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def toArray[B >: (A, B)](implicit arg0: ClassTag[B]): Array[B]

  147. def toBuffer[C >: (A, B)]: Buffer[C]

    Converts this immutable sorted map to a mutable buffer.

    Converts this immutable sorted map to a mutable buffer.

    returns

    a buffer containing all elements of this immutable sorted map.

    Definition Classes
    MapLikeTraversableOnceGenTraversableOnce
  148. def toCollection(repr: SortedMap[A, B]): collection.Iterable[(A, B)]

    A conversion from collections of type Repr to immutable.SortedMap objects.

    A conversion from collections of type Repr to immutable.SortedMap objects. By default this is implemented as just a cast, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    IterableLikeTraversableLike
  149. def toIndexedSeq: IndexedSeq[(A, B)]

    Converts this immutable sorted map to an indexed sequence.

    Converts this immutable sorted map to an indexed sequence.

    returns

    an indexed sequence containing all elements of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  150. def toIterable: collection.Iterable[(A, B)]

    Converts this immutable sorted map to an iterable collection.

    Converts this immutable sorted map to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this immutable sorted map.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  151. def toIterator: Iterator[(A, B)]

    Returns an Iterator over the elements in this immutable sorted map.

    Returns an Iterator over the elements in this immutable sorted map. Will return the same Iterator if this instance is already an Iterator.

    returns

    an Iterator containing all elements of this immutable sorted map.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  152. def toList: scala.List[(A, B)]

    Converts this immutable sorted map to a list.

    Converts this immutable sorted map to a list.

    returns

    a list containing all elements of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  153. def toMap[T, U]: collection.Map[T, U]

    [use case] Converts this immutable sorted map to a map.

    [use case]

    Converts this immutable sorted map to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this immutable sorted map.

    Definition Classes
    MapTraversableOnceGenTraversableOnce
    Full Signature

    def toMap[T, U](implicit ev: <:<[(A, B), (T, U)]): Map[T, U]

  154. def toParArray: ParArray[(A, B)]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to TraversableOps[(A, B)] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  155. def toSeq: collection.Seq[(A, B)]

    Converts this immutable sorted map to a sequence.

    Converts this immutable sorted map to a sequence. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.

    returns

    a sequence containing all elements of this immutable sorted map.

    Definition Classes
    MapLikeTraversableOnceGenTraversableOnce
  156. def toSet[B >: (A, B)]: Set[B]

    Converts this immutable sorted map to a set.

    Converts this immutable sorted map to a set.

    returns

    a set containing all elements of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  157. def toStream: Stream[(A, B)]

    Converts this immutable sorted map to a stream.

    Converts this immutable sorted map to a stream.

    returns

    a stream containing all elements of this immutable sorted map.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  158. def toString(): String

    Converts this immutable sorted map to a string.

    Converts this immutable sorted map to a string.

    returns

    a string representation of this collection. By default this string consists of the stringPrefix of this immutable sorted map, followed by all elements separated by commas and enclosed in parentheses.

    Definition Classes
    MapLikeTraversableLikeFunction1 → AnyRef → Any
  159. def toTraversable: collection.Traversable[(A, B)]

    Converts this immutable sorted map to an unspecified Traversable.

    Converts this immutable sorted map to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

    returns

    a Traversable containing all elements of this immutable sorted map.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  160. def toVector: scala.Vector[(A, B)]

    Converts this immutable sorted map to a Vector.

    Converts this immutable sorted map to a Vector.

    returns

    a vector containing all elements of this immutable sorted map.

    Definition Classes
    TraversableOnceGenTraversableOnce
  161. def transform[C, That](f: (A, B) ⇒ C)(implicit bf: CanBuildFrom[SortedMap[A, B], (A, C), That]): That

    This function transforms all the values of mappings contained in this map with function f.

    This function transforms all the values of mappings contained in this map with function f.

    f

    A function over keys and values

    returns

    the updated map

    Definition Classes
    MapLike
  162. def transpose[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

    Transposes this immutable sorted map of traversable collections into a immutable sorted map of immutable sorted maps.

    Transposes this immutable sorted map of traversable collections into a immutable sorted map of immutable sorted maps.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this immutable sorted map is a Traversable.

    returns

    a two-dimensional immutable sorted map of immutable sorted maps which has as nth row the nth column of this immutable sorted map.

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

    Exceptions thrown
    `IllegalArgumentException`

    if all collections in this immutable sorted map are not of the same size.

  163. def until(until: A): SortedMap[A, B]

    Creates a ranged projection of this collection with no lower-bound.

    Creates a ranged projection of this collection with no lower-bound.

    until

    The upper-bound (exclusive) of the ranged projection.

    Definition Classes
    Sorted
  164. def unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Converts this immutable sorted map of pairs into two collections of the first and second half of each pair.

    Converts this immutable sorted map of pairs into two collections of the first and second half of each pair.

    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

    an implicit conversion which asserts that the element type of this immutable sorted map is a pair.

    returns

    a pair immutable sorted maps, containing the first, respectively second half of each element pair of this immutable sorted map.

    Definition Classes
    GenericTraversableTemplate
  165. def unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Converts this immutable sorted map of triples into three collections of the first, second, and third element of each triple.

    Converts this immutable sorted map of triples into three collections of the first, second, and third element of each triple.

    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    asTriple

    an implicit conversion which asserts that the element type of this immutable sorted map is a triple.

    returns

    a triple immutable sorted maps, containing the first, second, respectively third member of each element triple of this immutable sorted map.

    Definition Classes
    GenericTraversableTemplate
  166. def updated[B1 >: B](key: A, value: B1): SortedMap[A, B1]

    Add a key/value pair to this map.

    Add a key/value pair to this map.

    B1

    the type of the added value

    key

    the key

    value

    the value

    returns

    A new map with the new binding added to this map

    Definition Classes
    SortedMapSortedMapLikeMapMapLikeMapLikeGenMap
  167. def values: collection.Iterable[B]

    Collects all values of this map in an iterable collection.

    Collects all values of this map in an iterable collection.

    returns

    the values of this map as an iterable.

    Definition Classes
    MapLikeGenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) values returns Iterable[B] rather than Iterator[B].

  168. def valuesIterator: Iterator[B]

    Creates an iterator for all values in this map.

    Creates an iterator for all values in this map.

    returns

    an iterator over all values that are associated with some key in this map.

    Definition Classes
    MapLikeGenMapLike
  169. def view(from: Int, until: Int): IterableView[(A, B), SortedMap[A, B]]

    Creates a non-strict view of a slice of this immutable sorted map.

    Creates a non-strict view of a slice of this immutable sorted map.

    Note: the difference between view and slice is that view produces a view of the current immutable sorted map, whereas slice produces a new immutable sorted map.

    Note: view(from, to) is equivalent to view.slice(from, to)

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this immutable sorted map, starting at index from and extending up to (but not including) index until.

    Definition Classes
    IterableLikeTraversableLike
  170. def view: IterableView[(A, B), SortedMap[A, B]]

    Creates a non-strict view of this immutable sorted map.

    Creates a non-strict view of this immutable sorted map.

    returns

    a non-strict view of this immutable sorted map.

    Definition Classes
    IterableLikeTraversableLike
  171. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  172. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  173. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  174. def withDefault[B1 >: B](d: (A) ⇒ B1): Map[A, B1]

    The same map with a given default function.

    The same map with a given default function. Note: get, contains, iterator, keys, etc are not affected by withDefault.

    Invoking transformer methods (e.g. map) will not preserve the default value.

    d

    the function mapping keys to values, used for non-present keys

    returns

    a wrapper of the map with a default value

    Definition Classes
    Map
  175. def withDefaultValue[B1 >: B](d: B1): Map[A, B1]

    The same map with a given default value.

    The same map with a given default value. Note: get, contains, iterator, keys, etc are not affected by withDefaultValue.

    Invoking transformer methods (e.g. map) will not preserve the default value.

    d

    the function mapping keys to values, used for non-present keys

    returns

    a wrapper of the map with a default value

    Definition Classes
    Map
  176. def withFilter(p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), SortedMap[A, B]]

    Creates a non-strict filter of this immutable sorted map.

    Creates a non-strict filter of this immutable sorted map.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this immutable sorted map which satisfy the predicate p.

    Definition Classes
    TraversableLikeFilterMonadic
  177. def zip[B](that: GenIterable[B]): SortedMap[(A, B)]

    [use case] Returns a immutable sorted map formed from this immutable sorted map and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a immutable sorted map formed from this immutable sorted map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new immutable sorted map containing pairs consisting of corresponding elements of this immutable sorted map and that. The length of the returned collection is the minimum of the lengths of this immutable sorted map and that.

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[SortedMap[A, B], (A1, B), That]): That

  178. def zipAll[B](that: collection.Iterable[B], thisElem: A, thatElem: B): SortedMap[(A, B)]

    [use case] Returns a immutable sorted map formed from this immutable sorted map and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a immutable sorted map formed from this immutable sorted map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this immutable sorted map is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this immutable sorted map.

    returns

    a new immutable sorted map containing pairs consisting of corresponding elements of this immutable sorted map and that. The length of the returned collection is the maximum of the lengths of this immutable sorted map and that. If this immutable sorted map is shorter than that, thisElem values are used to pad the result. If that is shorter than this immutable sorted map, thatElem values are used to pad the result.

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zipAll[B, A1 >: (A, B), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[SortedMap[A, B], (A1, B), That]): That

  179. def zipWithIndex: SortedMap[(A, Int)]

    [use case] Zips this immutable sorted map with its indices.

    [use case]

    Zips this immutable sorted map with its indices.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    A new immutable sorted map containing pairs consisting of all elements of this immutable sorted map paired with their index. Indices start at 0.

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[SortedMap[A, B], (A1, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

  180. def [B](y: B): (SortedMap[A, B], B)

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to ArrowAssoc[SortedMap[A, B]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to StringAdd[SortedMap[A, B]] performed by method StringAdd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMap: StringAdd[SortedMap[A, B]]).+(other)
    Definition Classes
    StringAdd
  2. def filter(p: ((A, B)) ⇒ Boolean): TraversableOnce[(A, B)]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to MonadOps[(A, B)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMap: MonadOps[(A, B)]).filter(p)
    Definition Classes
    MonadOps
  3. def flatMap[B](f: ((A, B)) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to MonadOps[(A, B)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMap: MonadOps[(A, B)]).flatMap(f)
    Definition Classes
    MonadOps
  4. def map[B](f: ((A, B)) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to MonadOps[(A, B)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMap: MonadOps[(A, B)]).map(f)
    Definition Classes
    MonadOps
  5. def withFilter(p: ((A, B)) ⇒ Boolean): Iterator[(A, B)]

    Implicit information
    This member is added by an implicit conversion from SortedMap[A, B] to MonadOps[(A, B)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMap: MonadOps[(A, B)]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from collection.SortedMap[A, B]

Inherited from SortedMapLike[A, B, SortedMap[A, B]]

Inherited from Sorted[A, SortedMap[A, B]]

Inherited from Map[A, B]

Inherited from MapLike[A, B, SortedMap[A, B]]

Inherited from collection.Map[A, B]

Inherited from collection.MapLike[A, B, SortedMap[A, B]]

Inherited from Subtractable[A, SortedMap[A, B]]

Inherited from PartialFunction[A, B]

Inherited from (A) ⇒ B

Inherited from GenMap[A, B]

Inherited from GenMapLike[A, B, SortedMap[A, B]]

Inherited from Iterable[(A, B)]

Inherited from collection.Iterable[(A, B)]

Inherited from IterableLike[(A, B), SortedMap[A, B]]

Inherited from Equals

Inherited from GenIterable[(A, B)]

Inherited from GenIterableLike[(A, B), SortedMap[A, B]]

Inherited from Traversable[(A, B)]

Inherited from Immutable

Inherited from collection.Traversable[(A, B)]

Inherited from GenTraversable[(A, B)]

Inherited from GenericTraversableTemplate[(A, B), Iterable]

Inherited from TraversableLike[(A, B), SortedMap[A, B]]

Inherited from GenTraversableLike[(A, B), SortedMap[A, B]]

Inherited from Parallelizable[(A, B), ParMap[A, B]]

Inherited from TraversableOnce[(A, B)]

Inherited from GenTraversableOnce[(A, B)]

Inherited from FilterMonadic[(A, B), SortedMap[A, B]]

Inherited from HasNewBuilder[(A, B), SortedMap[A, B]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion traversable2ops from SortedMap[A, B] to TraversableOps[(A, B)]

Inherited by implicit conversion MonadOps from SortedMap[A, B] to MonadOps[(A, B)]

Inherited by implicit conversion StringAdd from SortedMap[A, B] to StringAdd[SortedMap[A, B]]

Inherited by implicit conversion StringFormat from SortedMap[A, B] to StringFormat[SortedMap[A, B]]

Inherited by implicit conversion Ensuring from SortedMap[A, B] to Ensuring[SortedMap[A, B]]

Inherited by implicit conversion ArrowAssoc from SortedMap[A, B] to ArrowAssoc[SortedMap[A, B]]

Inherited by implicit conversion alternateImplicit from SortedMap[A, B] to ForceImplicitAmbiguity

Ungrouped