returns a topkselector that collects the greatest k elements added to it , relative to the natural ordering of the elements , and returns them via #topk indescending order . concode_field_sep Comparator<? super T> comparator concode_elem_sep T threshold concode_elem_sep int k concode_elem_sep T[] buffer concode_elem_sep int bufferSize concode_field_sep void offer concode_elem_sep List<T> topK concode_elem_sep int partition concode_elem_sep void trim concode_elem_sep void swap concode_elem_sep void offerAll concode_elem_sep void offerAll concode_elem_sep TopKSelector<T> least concode_elem_sep TopKSelector<T> least concode_elem_sep TopKSelector<T> combine