Aggregator

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. implicit def applicative[I]: Applicative[[O]Aggregator[I, _, O]]

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def const[T](t: T): MonoidAggregator[Any, Unit, T]

   This is a trivial aggregator that always returns a single value

10. def count[T](pred: (T) ⇒ Boolean): MonoidAggregator[T, Long, Long]

    How many items satisfy a predicate

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

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

13. def exists[T](pred: (T) ⇒ Boolean): MonoidAggregator[T, Boolean, Boolean]

    Do any items satisfy some predicate

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

15. def forall[T](pred: (T) ⇒ Boolean): MonoidAggregator[T, Boolean, Boolean]

    Do all items satisfy a predicate

16. def fromMonoid[F, T](implicit mon: Monoid[T], prep: (F) ⇒ T): MonoidAggregator[F, T, T]

17. def fromMonoid[T](implicit mon: Monoid[T]): MonoidAggregator[T, T, T]

18. def fromReduce[T](red: (T, T) ⇒ T): Aggregator[T, T, T]

    Using Aggregator.

    Using Aggregator.prepare,present you can add to this aggregator

19. def fromRing[F, T](implicit rng: Ring[T], prep: (F) ⇒ T): RingAggregator[F, T, T]

20. def fromRing[T](implicit rng: Ring[T]): RingAggregator[T, T, T]

21. def fromSemigroup[T](implicit sg: Semigroup[T]): Aggregator[T, T, T]

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

    Definition Classes

    AnyRef → Any

23. def hashCode(): Int

    Definition Classes

    AnyRef → Any

24. def head[T]: Aggregator[T, T, T]

    Take the first (left most in reduce order) item found

25. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

26. def last[T]: Aggregator[T, T, T]

    Take the last (right most in reduce order) item found

27. def max[T](implicit arg0: Ordering[T]): Aggregator[T, T, T]

    Get the maximum item

28. def maxBy[U, T](fn: (U) ⇒ T)(implicit arg0: Ordering[T]): Aggregator[U, U, U]

29. def min[T](implicit arg0: Ordering[T]): Aggregator[T, T, T]

    Get the minimum item

30. def minBy[U, T](fn: (U) ⇒ T)(implicit arg0: Ordering[T]): Aggregator[U, U, U]

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

    Definition Classes

    AnyRef

32. final def notify(): Unit

    Definition Classes

    AnyRef

33. final def notifyAll(): Unit

    Definition Classes

    AnyRef

34. def prepareMonoid[F, T](prep: (F) ⇒ T)(implicit m: Monoid[T]): MonoidAggregator[F, T, T]

35. def size: MonoidAggregator[Any, Long, Long]

    This returns the number of items we find

36. def sortedReverseTake[T](count: Int)(implicit arg0: Ordering[T]): MonoidAggregator[T, PriorityQueue[T], Seq[T]]

    Take the largest count items using a heap

37. def sortedTake[T](count: Int)(implicit arg0: Ordering[T]): MonoidAggregator[T, PriorityQueue[T], Seq[T]]

    Take the smallest count items using a heap

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

    Definition Classes

    AnyRef

39. def toList[T]: MonoidAggregator[T, List[T], List[T]]

    Put everything in a List.

    Put everything in a List. Note, this could fill the memory if the List is very large.

40. def toSet[T]: MonoidAggregator[T, Set[T], Set[T]]

    Put everything in a Set.

    Put everything in a Set. Note, this could fill the memory if the Set is very large.

41. def toString(): String

    Definition Classes

    AnyRef → Any

42. def uniqueCount[T]: MonoidAggregator[T, Set[T], Int]

    This builds an in-memory Set, and then finally gets the size of that set.

    This builds an in-memory Set, and then finally gets the size of that set. This may not be scalable if the Uniques are very large. You might check the HyperLogLog Aggregator to get an approximate version of this that is scalable.

43. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )