razie

# M

### Related Doc: package razie

#### object M

helper class - has all the conversions

Linear Supertypes
AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. M
2. AnyRef
3. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Value Members

1. #### final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
2. #### final def ##(): Int

Definition Classes
AnyRef → Any
3. #### final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
4. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
5. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
6. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
7. #### def equals[A, B](x: List[A], y: List[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

8. #### def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
9. #### 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

10. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
11. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
12. #### def hashCode(): Int

Definition Classes
AnyRef → Any
13. #### final def isInstanceOf[T0]: Boolean

Definition Classes
Any
14. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
15. #### final def notify(): Unit

Definition Classes
AnyRef
16. #### final def notifyAll(): Unit

Definition Classes
AnyRef
17. #### 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

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

Definition Classes
AnyRef
19. #### def toString(): String

Definition Classes
AnyRef → Any
20. #### final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )