Cons

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def ++[B >: A](that: Future[Spool[B]]): Future[Spool[B]]

   

   Concatenates two spools.

   Concatenates two spools.

   Definition Classes

   Spool

4. def ++[B >: A](that: Spool[B]): Spool[B]

   

   Concatenates two spools.

   Concatenates two spools.

   Definition Classes

   Spool

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

   

   Definition Classes

   AnyRef → Any

6. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def collect[B](f: PartialFunction[A, B]): Future[Spool[B]]

   

   The standard Scala collect, in order to implement map & filter.

   The standard Scala collect, in order to implement map & filter.

   It may seem unnatural to return a Future[…] here, but we cannot know whether the first element exists until we have applied its filter.

   Definition Classes

   Spool

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

   

   Definition Classes

   AnyRef

10. def filter(f: (A) ⇒ Boolean): Future[Spool[A]]

    

    Definition Classes

    Spool

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

12. def flatMap[B](f: (A) ⇒ Future[Spool[B]]): Future[Spool[B]]

    

    Applies a function that generates a spool to each element in this spool, flattening the result into a single spool.

    Applies a function that generates a spool to each element in this spool, flattening the result into a single spool.

    Definition Classes

    Spool

13. def foldLeft[B](z: B)(f: (B, A) ⇒ B): Future[B]

    

    Definition Classes

    Spool

14. def force: Future[Unit]

    

    Eagerly executes all computation represented by this Spool (presumably for sideeffects), and returns a Future representing its completion.

    Eagerly executes all computation represented by this Spool (presumably for sideeffects), and returns a Future representing its completion.

    Definition Classes

    Spool

15. def foreach[B](f: (A) ⇒ B): Future[Unit]

    

    Apply {{f}} for each item in the spool, until the end.

    Apply {{f}} for each item in the spool, until the end. {{f}} is applied as the items become available.

    Definition Classes

    Spool

16. def foreachElem[B](f: (Option[A]) ⇒ B): Future[Unit]

    

    A version of {{foreach}} that wraps each element in an {{Option}}, terminating the stream (EOF) with {{None}}.

    A version of {{foreach}} that wraps each element in an {{Option}}, terminating the stream (EOF) with {{None}}.

    Definition Classes

    Spool

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

    

    Definition Classes

    AnyRef → Any

18. val head: A

    

    The first element of the spool.

    The first element of the spool. Invalid for empty spools.

    Definition Classes

    Cons → Spool

19. def headOption: Option[A]

    

    The first element of the spool if it is non-empty.

    The first element of the spool if it is non-empty.

    Definition Classes

    Spool

20. def isEmpty: Boolean

    

    Definition Classes

    Cons → Spool

21. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

22. def map[B](f: (A) ⇒ B): Spool[B]

    

    Definition Classes

    Spool

23. def mapFuture[B](f: (A) ⇒ Future[B]): Future[Spool[B]]

    

    Applies a function that generates a Future[B] to each element of this spool The returned future is satisfied with the head of the resulting spool is available

    Applies a function that generates a Future[B] to each element of this spool The returned future is satisfied with the head of the resulting spool is available

    Definition Classes

    Spool

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

    

    Definition Classes

    AnyRef

25. final def notify(): Unit

    

    Definition Classes

    AnyRef

26. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

27. def reduceLeft[B >: A](f: (B, A) ⇒ B): Future[B]

    

    Definition Classes

    Spool

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

    

    Definition Classes

    AnyRef

29. val tail: Future[Spool[A]]

    

    The (deferred) tail of the spool.

    The (deferred) tail of the spool. Invalid for empty spools.

    Definition Classes

    Cons → Spool

30. def take(n: Int): Spool[A]

    

    Take the first n elements of the Spool as another Spool (adapted from Stream.take)

    Take the first n elements of the Spool as another Spool (adapted from Stream.take)

    Definition Classes

    Spool

31. def takeWhile(f: (A) ⇒ Boolean): Spool[A]

    

    Take elements from the head of the Spool (lazily), while the given condition is true.

    Take elements from the head of the Spool (lazily), while the given condition is true.

    Definition Classes

    Spool

32. def toSeq: Future[Seq[A]]

    

    Fully buffer the spool to a {{Seq}}.

    Fully buffer the spool to a {{Seq}}. The returned future is satisfied when the entire result is ready.

    Definition Classes

    Spool

33. def toString(): String

    

    Definition Classes

    Cons → AnyRef → Any

34. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )