class
AsyncLongTraversable[+A] extends AnyRef
Instance Constructors
-
new
AsyncLongTraversable(traversable: LongTraversable[A])(implicit executionContext: ExecutionContext)
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
/:[B](z: B)(op: (B, A) ⇒ B): Future[B]
-
def
:\[B](z: B)(op: (A, B) ⇒ B): Future[B]
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder): Future[StringBuilder]
-
def
addString(b: StringBuilder, sep: String): Future[StringBuilder]
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): Future[StringBuilder]
-
def
aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): Future[B]
-
def
apply(idx: Long): Future[A]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
collectFirst[B](pf: PartialFunction[A, B]): Future[Option[B]]
-
def
containsSlice[B](that: Seq[B], start: Long): Future[Boolean]
-
def
containsSlice[B](that: Seq[B]): Future[Boolean]
-
def
corresponds[B](that: LongTraversable[B])(p: (A, B) ⇒ Boolean): Future[Boolean]
-
def
corresponds[B](that: Seq[B])(p: (A, B) ⇒ Boolean): Future[Boolean]
-
def
count(p: (A) ⇒ Boolean): Future[Int]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
implicit
val
executionContext: ExecutionContext
-
def
exists(p: (A) ⇒ Boolean): Future[Boolean]
-
def
finalize(): Unit
-
def
find(p: (A) ⇒ Boolean): Future[Option[A]]
-
def
fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): Future[A1]
-
def
foldLeft[B](z: B)(op: (B, A) ⇒ B): Future[B]
-
def
foldRight[B](z: B)(op: (A, B) ⇒ B): Future[B]
-
def
forall(p: (A) ⇒ Boolean): Future[Boolean]
-
def
foreach[U](f: (A) ⇒ U): Future[Unit]
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: (A) ⇒ K): Future[Map[K, LongTraversable[A]]]
-
def
hashCode(): Int
-
def
head: Future[A]
-
def
headOption: Future[Option[A]]
-
def
indexOf[B >: A](elem: B, from: Long): Future[Long]
-
def
indexOf[B >: A](elem: B): Future[Long]
-
def
isDefinedAt(idx: Long): Future[Boolean]
-
def
isEmpty: Future[Boolean]
-
final
def
isInstanceOf[T0]: Boolean
-
def
last: Future[A]
-
def
lastIndexOf[B >: A](elem: B, end: Long): Future[Long]
-
def
lastIndexOf[B >: A](elem: B): Future[Long]
-
def
lastIndexWhere(p: (A) ⇒ Boolean, end: Long): Future[Long]
-
def
lastIndexWhere(p: (A) ⇒ Boolean): Future[Long]
-
def
lastOption: Future[Option[A]]
-
def
lcount(p: (A) ⇒ Boolean): Future[Long]
-
def
limitFold[U](init: U)(op: (U, A) ⇒ FoldResult[U]): Future[U]
-
def
lsize: Future[Long]
-
def
max[B >: A](implicit cmp: Ordering[B]): Future[A]
-
def
maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): Future[A]
-
def
min[B >: A](implicit cmp: Ordering[B]): Future[A]
-
def
minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): Future[A]
-
def
mkString: Future[String]
-
def
mkString(sep: String): Future[String]
-
def
mkString(start: String, sep: String, end: String): Future[String]
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nonEmpty: Future[Boolean]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
prefixLength(p: (A) ⇒ Boolean): Future[Long]
-
def
product[B >: A](implicit num: Numeric[B]): Future[B]
-
def
reduce[A1 >: A](op: (A1, A1) ⇒ A1): Future[A1]
-
def
reduceLeft[B >: A](op: (B, A) ⇒ B): Future[B]
-
def
reduceLeftOption[B >: A](op: (B, A) ⇒ B): Future[Option[B]]
-
def
reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Future[Option[A1]]
-
def
reduceRight[B >: A](op: (A, B) ⇒ B): Future[B]
-
def
reduceRightOption[B >: A](op: (A, B) ⇒ B): Future[Option[B]]
-
def
sameElements[B >: A](that: LongTraversable[B]): Future[Boolean]
-
def
sameElements[B >: A](that: Iterable[B]): Future[Boolean]
-
def
segmentLength(p: (A) ⇒ Boolean, from: Long = 0): Future[Long]
-
def
size: Future[Int]
-
def
startsWith[B](that: Seq[B]): Future[Boolean]
-
def
startsWith[B](that: Seq[B], offset: Long): Future[Boolean]
-
def
startsWith[B](that: LongTraversable[B], offset: Long): Future[Boolean]
-
def
startsWith[B](that: LongTraversable[B]): Future[Boolean]
-
def
sum[B >: A](implicit num: Numeric[B]): Future[B]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toIndexedSeq[B >: A]: Future[IndexedSeq[A]]
-
def
toList: Future[List[A]]
-
def
toSeq: Future[Seq[A]]
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
An additional API for LongTraversable for asynchronous interaction with the LongTraversable object.
This class is not a Traversable even though the name implies that, it is instead an API that provides asynchronous access to the LongTraversable.
Most of the blocking methods in LongTraversable (like foreach, find, fold) are in this class and returns Futures instead of blocking and returning the actual value like in LongTraversable.
While non-blocking methods like map, filter are not present in the Async API because those can be safely done with LongTraversable.
The following example illustrates a non-blocking
All methods in this class are performed asynchronously from the calling thread.
User: jeichar Date: 3/18/12 Time: 8:26 PM