scalaz

==>>

sealed abstract class ==>>[A, B] extends AnyRef

Source
Map.scala
Since

7.0.3

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ==>>
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ==>>()

Abstract Value Members

  1. abstract val size: Int

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 +(a: (A, B))(implicit o: Order[A]): ==>>[A, B]

  5. def -(k: A)(implicit o: Order[A]): ==>>[A, B]

  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  8. def \\(other: ==>>[A, B])(implicit o: Order[A]): ==>>[A, B]

  9. def adjust(k: A, f: (B) ⇒ B)(implicit o: Order[A]): ==>>[A, B]

  10. def adjustWithKey(k: A, f: (A, B) ⇒ B)(implicit o: Order[A]): ==>>[A, B]

  11. def alter(k: A, f: (Option[B]) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

  12. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  13. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  14. def delete(k: A)(implicit n: Order[A]): ==>>[A, B]

  15. def deleteAt(i: Int): ==>>[A, B]

  16. def deleteMax: ==>>[A, B]

  17. def deleteMin: ==>>[A, B]

  18. def difference(other: ==>>[A, B])(implicit o: Order[A]): ==>>[A, B]

  19. def differenceWith[C](other: ==>>[A, C], f: (B, C) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

  20. def differenceWithKey[C](other: ==>>[A, C], f: (A, B, C) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

  21. def elemAt(i: Int): Option[(A, B)]

  22. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  23. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  24. def filter(p: (B) ⇒ Boolean)(implicit o: Order[A]): ==>>[A, B]

  25. def filterWithKey(p: (A, B) ⇒ Boolean)(implicit o: Order[A]): ==>>[A, B]

  26. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  27. def findMax: Option[(A, B)]

  28. def findMin: Option[(A, B)]

  29. def fold[C](z: C)(f: (A, B, C) ⇒ C): C

  30. def foldlWithKey[C](z: C)(f: (C, A, B) ⇒ C): C

  31. def foldrWithKey[C](z: C)(f: (A, B, C) ⇒ C): C

  32. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  33. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  34. def insert(kx: A, x: B)(implicit n: Order[A]): ==>>[A, B]

  35. def insertWith(f: (B, B) ⇒ B, kx: A, x: B)(implicit o: Order[A]): ==>>[A, B]

  36. def insertWithKey(f: (A, B, B) ⇒ B, kx: A, x: B)(implicit o: Order[A]): ==>>[A, B]

  37. def intersection[C](other: ==>>[A, C])(implicit o: Order[A]): ==>>[A, B]

  38. def intersectionWith[C, D](other: ==>>[A, C])(f: (B, C) ⇒ D)(implicit o: Order[A]): ==>>[A, D]

  39. def intersectionWithKey[C, D](other: ==>>[A, C])(f: (A, B, C) ⇒ D)(implicit o: Order[A]): ==>>[A, D]

  40. def isEmpty: Boolean

  41. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  42. def isSubmapOf(a: ==>>[A, B])(implicit o: Order[A], e: Equal[B]): Boolean

  43. def isSubmapOfBy(a: ==>>[A, B], f: (B, B) ⇒ Boolean)(implicit o: Order[A]): Boolean

  44. def keySet: Set[A]

  45. def keys: List[A]

  46. def lookup(k: A)(implicit n: Order[A]): Option[B]

  47. def lookupAssoc(k: A)(implicit n: Order[A]): Option[(A, B)]

  48. def lookupIndex(k: A)(implicit o: Order[A]): Option[Int]

  49. def map[C](f: (B) ⇒ C): ==>>[A, C]

  50. def mapAccum[C](z: C)(f: (C, B) ⇒ (C, B)): (C, ==>>[A, B])

  51. def mapAccumL[C](a: C)(f: (C, A, B) ⇒ (C, B)): (C, ==>>[A, B])

  52. def mapAccumWithKey[C](z: C)(f: (C, A, B) ⇒ (C, B)): (C, ==>>[A, B])

  53. def mapEither[C, D](f: (B) ⇒ \/[C, D])(implicit o: Order[A]): (==>>[A, C], ==>>[A, D])

  54. def mapEitherWithKey[C, D](f: (A, B) ⇒ \/[C, D])(implicit o: Order[A]): (==>>[A, C], ==>>[A, D])

  55. def mapKeys[C](f: (A) ⇒ C)(implicit o: Order[C]): ==>>[C, B]

  56. def mapKeysWith[C](f: (A) ⇒ C, f2: (B, B) ⇒ B)(implicit o: Order[C]): ==>>[C, B]

  57. def mapOption[C](f: (B) ⇒ Option[C])(implicit o: Order[A]): ==>>[A, C]

  58. def mapOptionWithKey[C](f: (A, B) ⇒ Option[C])(implicit o: Order[A]): ==>>[A, C]

  59. def mapWithKey[C](f: (A, B) ⇒ C): ==>>[A, C]

  60. def maxView: Option[(B, ==>>[A, B])]

  61. def maxViewWithKey: Option[((A, B), ==>>[A, B])]

  62. def member(k: A)(implicit n: Order[A]): Boolean

  63. def minView: Option[(B, ==>>[A, B])]

  64. def minViewWithKey: Option[((A, B), ==>>[A, B])]

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

    Definition Classes
    AnyRef

  66. def notMember(k: A)(implicit n: Order[A]): Boolean

  67. final def notify(): Unit

    Definition Classes
    AnyRef

  68. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  69. def partition(p: (B) ⇒ Boolean)(implicit o: Order[A]): (==>>[A, B], ==>>[A, B])

  70. def partitionWithKey(p: (A, B) ⇒ Boolean)(implicit o: Order[A]): (==>>[A, B], ==>>[A, B])

  71. def split(k: A)(implicit o: Order[A]): (==>>[A, B], ==>>[A, B])

  72. def splitLookup(k: A)(implicit o: Order[A]): (==>>[A, B], Option[B], ==>>[A, B])

  73. def splitLookupWithKey(k: A)(implicit o: Order[A]): (==>>[A, B], Option[(A, B)], ==>>[A, B])

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

    Definition Classes
    AnyRef

  75. def toAscList: List[(A, B)]

  76. def toDescList: List[(A, B)]

  77. def toList: List[(A, B)]

  78. def toString(): String

    Definition Classes
    AnyRef → Any

  79. def trim(lo: (A) ⇒ Ordering, hi: (A) ⇒ Ordering): ==>>[A, B]

  80. def trimLookupLo(lo: A, cmphi: (A) ⇒ Ordering)(implicit o: Order[A]): (Option[(A, B)], ==>>[A, B])

  81. def union(other: ==>>[A, B])(implicit k: Order[A]): ==>>[A, B]

  82. def unionWith(other: ==>>[A, B])(f: (B, B) ⇒ B)(implicit o: Order[A]): ==>>[A, B]

  83. def unionWithKey(other: ==>>[A, B])(f: (A, B, B) ⇒ B)(implicit o: Order[A]): ==>>[A, B]

  84. def update(k: A, f: (B) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

  85. def updateAt(i: Int, f: (A, B) ⇒ Option[B]): ==>>[A, B]

  86. def updateLookupWithKey(k: A, f: (A, B) ⇒ Option[B])(implicit o: Order[A]): (Option[B], ==>>[A, B])

  87. def updateMax(f: (B) ⇒ Option[B]): ==>>[A, B]

  88. def updateMaxWithKey(f: (A, B) ⇒ Option[B]): ==>>[A, B]

  89. def updateMin(f: (B) ⇒ Option[B]): ==>>[A, B]

  90. def updateMinWithKey(f: (A, B) ⇒ Option[B]): ==>>[A, B]

  91. def updateWithKey(k: A, f: (A, B) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

  92. def values: List[B]

  93. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  94. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  95. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped