A sorted-take List monoid (not the default, you can set:
implicit val sortmon = new SortedTakeListMonoid[T](10)
to use this instead of the standard list
This returns the k least values:
equivalent to: (left ++ right).sorted.take(k)
but doesn't do a total sort
NOTE!!!! This assumes the inputs are already sorted! resorting each time kills speed
TODO remove this in algebird 0.2.0
Annotations
@deprecated
Deprecated
(Since version 0.1.8) Use TopKMonoid or PriorityQueueMonoid
Linear Supertypes
Monoid[List[T]], Semigroup[List[T]], Serializable, AnyRef, Any
A sorted-take List monoid (not the default, you can set: implicit val sortmon = new SortedTakeListMonoid[T](10) to use this instead of the standard list This returns the k least values: equivalent to: (left ++ right).sorted.take(k) but doesn't do a total sort NOTE!!!! This assumes the inputs are already sorted! resorting each time kills speed TODO remove this in algebird 0.2.0
(Since version 0.1.8) Use TopKMonoid or PriorityQueueMonoid