Now

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 finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

8. def flatMap[B](f: (A) ⇒ Eval[B]): Eval[B]

   

   Lazily perform a computation based on an Eval[A], using the function f to produce an Eval[B] given an A.

   Lazily perform a computation based on an Eval[A], using the function f to produce an Eval[B] given an A.

   This call is stack-safe -- many .flatMap calls may be chained without consumed additional stack during evaluation. It is also written to avoid left-association problems, so that repeated calls to .flatMap will be efficiently applied.

   Computation performed in f is always lazy, even when called on an eager (Now) instance.

   Definition Classes

   Eval

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

   

   Definition Classes

   AnyRef → Any

10. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

11. def map[B](f: (A) ⇒ B): Eval[B]

    

    Transform an Eval[A] into an Eval[B] given the transformation function f.

    Transform an Eval[A] into an Eval[B] given the transformation function f.

    This call is stack-safe -- many .map calls may be chained without consumed additional stack during evaluation.

    Computation performed in f is always lazy, even when called on an eager (Now) instance.

    Definition Classes

    Eval

12. def memoize: Eval[A]

    

    Ensure that the result of the computation (if any) will be memoized.

    Ensure that the result of the computation (if any) will be memoized.

    Practically, this means that when called on an Always[A] a Later[A] with an equivalent computation will be returned.

    Definition Classes

    Now → Eval

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

    

    Definition Classes

    AnyRef

14. final def notify(): Unit

    

    Definition Classes

    AnyRef

15. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

17. val value: A

    

    Evaluate the computation and return an A value.

    Evaluate the computation and return an A value.

    For lazy instances (Later, Always), any necessary computation will be performed at this point. For eager instances (Now), a value will be immediately returned.

    Definition Classes

    Now → Eval

18. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )