M

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. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. def any[A](y: Any): M[A]

7. def anyOrder[A](y: Any): M[A]

8. implicit def apply[A](l: Map[_, A]): M[A]

9. implicit def apply[A](l: Iterable[A]): M[A]

10. implicit def apply[A](l: Iterator[A]): M[A]

11. implicit def apply[A](l: List[A]): M[A]

12. implicit def apply[A](l: Option[A]): M[A]

13. implicit def apply[A](l: Traversable[A]): M[A]

14. implicit def apply[A](l: Iterator[A]): M[A]

15. final def asInstanceOf[T0]: T0

    Definition Classes

    Any

16. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

17. def count[A](x: M[A]): Int

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

    Definition Classes

    AnyRef

19. def equals[A, B](x: M[A], y: M[B])(eeq: (A, B) ⇒ Boolean): Boolean

    compare two monads, given a comparison function

    compare two monads, given a comparison function

    x

    - to compare

    y

    - to compare

    eeq

    - eq function

20. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

21. def equalsNotOrdered[A, B](x: M[A], y: M[B])(eeq: (A, B) ⇒ Boolean): Boolean

    compare two monads, regardless of the element's order.

    compare two monads, regardless of the element's order. It's expensive

    it will basically make sure that EACH element in x will have a match in y

    TODO should it and then that each element in y has a match in x?

    x

    - to compare

    y

    - to compare

    eeq

    - eq function

22. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

23. def first[A](x: M[A]): M[A]

24. def firstOpt[A](x: M[A]): Option[A]

25. def firstThat[A](x: M[A])(cond: (A) ⇒ Boolean): Option[A]

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

    Definition Classes

    AnyRef → Any

27. def hashCode(): Int

    Definition Classes

    AnyRef → Any

28. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

30. final def notify(): Unit

    Definition Classes

    AnyRef

31. final def notifyAll(): Unit

    Definition Classes

    AnyRef

32. def parmap[A, B, C](x: M[A], y: M[B])(f: (A, B) ⇒ C): M[C]

    apply f on each pair (A,B) and contain result

    apply f on each pair (A,B) and contain result

    TODO return a nice non-strict monad

33. def seq[A](l: A*): M[A]

34. def sort[A](x: M[A], lt: (A, A) ⇒ Boolean): List[A]

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

    Definition Classes

    AnyRef

36. def toList[A](x: M[A]): List[A]

37. def toString(): String

    Definition Classes

    AnyRef → Any

38. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )