object sortedMap extends SortedMapInstances with SortedMapFunctions
- Source
- SortedMap.scala
- Alphabetic
- By Inheritance
- sortedMap
- SortedMapInstances
- SortedMapFunctions
- SortedMapInstances0
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
alter[K, A](m: SortedMap[K, A], k: K)(f: (Option[A]) ⇒ Option[A]): SortedMap[K, A]
Vary the value of
m get k
.Vary the value of
m get k
.- Definition Classes
- SortedMapFunctions
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
getOrAdd[F[_], K, A](m: SortedMap[K, A], k: K)(fa: ⇒ F[A])(implicit F: Applicative[F]): F[(SortedMap[K, A], A)]
Grab a value out of SortedMap if it's present.
Grab a value out of SortedMap if it's present. Otherwise evaluate a value to be placed at that key in the SortedMap.
- Definition Classes
- SortedMapFunctions
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
insertWith[K, A](m1: SortedMap[K, A], k: K, v: A)(f: (A, A) ⇒ A): SortedMap[K, A]
As with
SortedMap.updated
, but resolve a collision withf
.As with
SortedMap.updated
, but resolve a collision withf
. The first argument is guaranteed to be fromm1
.- Definition Classes
- SortedMapFunctions
-
final
def
intersectWith[K, A, B, C](m1: SortedMap[K, A], m2: SortedMap[K, B])(f: (A, B) ⇒ C)(implicit arg0: scala.Ordering[K]): SortedMap[K, C]
Collect only elements with matching keys, joining their associated values with
f
.Collect only elements with matching keys, joining their associated values with
f
.- Definition Classes
- SortedMapFunctions
-
final
def
intersectWithKey[K, A, B, C](m1: SortedMap[K, A], m2: SortedMap[K, B])(f: (K, A, B) ⇒ C)(implicit arg0: scala.Ordering[K]): SortedMap[K, C]
Like
intersectWith
, but tellf
about the key.Like
intersectWith
, but tellf
about the key.- Definition Classes
- SortedMapFunctions
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
mapKeys[K, K2, A](m: SortedMap[K, A])(f: (K) ⇒ K2)(implicit arg0: scala.Ordering[K2]): SortedMap[K2, A]
Exchange keys of
m
according tof
.Exchange keys of
m
according tof
. Result may be smaller iff
maps two or moreK
s to the sameK2
, in which case the resulting associated value is an arbitrary choice.- Definition Classes
- SortedMapFunctions
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
implicit
def
sortedMapBand[K, V](implicit S: Band[V], K: scala.Ordering[K]): Band[SortedMap[K, V]]
- Definition Classes
- SortedMapInstances0
-
implicit
def
sortedMapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[SortedMap[K, V]]
- Definition Classes
- SortedMapInstances0
-
implicit
def
sortedMapFoldable[K]: Foldable[[β$1$]SortedMap[K, β$1$]]
- Definition Classes
- SortedMapInstances0
-
implicit
def
sortedMapInstance[K](implicit arg0: scala.Ordering[K]): Traverse[[β$2$]SortedMap[K, β$2$]] with IsEmpty[[β$3$]SortedMap[K, β$3$]] with Bind[[β$4$]SortedMap[K, β$4$]] with Align[[β$5$]SortedMap[K, β$5$]]
Covariant over the value parameter, where
plus
applies theLast
semigroup to values.Covariant over the value parameter, where
plus
applies theLast
semigroup to values.- Definition Classes
- SortedMapInstances
-
implicit
def
sortedMapMonoid[K, V](implicit S: Semigroup[V], K: scala.Ordering[K]): Monoid[SortedMap[K, V]]
SortedMap union monoid, unifying values with
V
'sappend
.SortedMap union monoid, unifying values with
V
'sappend
.- Definition Classes
- SortedMapInstances
-
implicit
def
sortedMapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[SortedMap[K, V]]
- Definition Classes
- SortedMapInstances
-
implicit
def
sortedMapShow[K, V](implicit K: Show[K], V: Show[V]): Show[SortedMap[K, V]]
- Definition Classes
- SortedMapInstances
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
unionWith[K, A](m1: SortedMap[K, A], m2: SortedMap[K, A])(f: (A, A) ⇒ A)(implicit arg0: scala.Ordering[K]): SortedMap[K, A]
Union, resolving collisions with
f
, where the first arg is guaranteed to be fromm1
, the second fromm2
.Union, resolving collisions with
f
, where the first arg is guaranteed to be fromm1
, the second fromm2
.- Definition Classes
- SortedMapFunctions
- Note
iff
f
gives rise to a scalaz.Semigroup, so doesunionWith(_, _)(f)
.
-
final
def
unionWithKey[K, A](m1: SortedMap[K, A], m2: SortedMap[K, A])(f: (K, A, A) ⇒ A)(implicit arg0: scala.Ordering[K]): SortedMap[K, A]
Like
unionWith
, but tellingf
about the key.Like
unionWith
, but tellingf
about the key.- Definition Classes
- SortedMapFunctions
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()