TopKSelector < T > function ( int arg0 , Comparator < ? super T > arg1 ) { return new TopKSelector < T > ( arg1 , arg0 ) ; }
returns a topkselector that collects the lowest k elements added to it , relative to the specified comparator , and returns them via #topk in ascending 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> greatest concode_elem_sep TopKSelector<T> greatest concode_elem_sep TopKSelector<T> combine