Instance Constructors
-
new
PriorityQueueToListAggregator(max: Int)(implicit ord: Ordering[A])
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
andThenPresent[D](present2: (List[A]) ⇒ D): Aggregator[A, PriorityQueue[A], D]
-
def
append(l: PriorityQueue[A], r: A): PriorityQueue[A]
-
def
appendAll(items: TraversableOnce[A]): PriorityQueue[A]
-
def
appendAll(old: PriorityQueue[A], items: TraversableOnce[A]): PriorityQueue[A]
-
def
apply(inputs: TraversableOnce[A]): List[A]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
composePrepare[A1](prepare2: (A1) ⇒ A): Aggregator[A1, PriorityQueue[A], List[A]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
prepare(a: A): PriorityQueue[A]
-
def
present(q: PriorityQueue[A]): List[A]
-
final
def
reduce(items: TraversableOnce[PriorityQueue[A]]): PriorityQueue[A]
-
final
def
reduce(l: PriorityQueue[A], r: PriorityQueue[A]): PriorityQueue[A]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Aggregator[A, PriorityQueue[A], List[A]]
Inherited from Serializable
Inherited from AnyRef
Inherited from Any
Should probably be your default Top-K implementation