void function ( Iterable < ? extends T > arg0 ) { offerAll ( arg0 . iterator ( ) ) ; }
adds each member of elements as a candidate for the top k elements . thisoperation takes amortized linear time in the length of elements . if all input data to this topkselector is in a single iterable , prefer ordering #leastof iterable , int , which provides a simpler api for that use case . 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 TopKSelector<T> least concode_elem_sep TopKSelector<T> least concode_elem_sep TopKSelector<T> greatest concode_elem_sep TopKSelector<T> greatest concode_elem_sep TopKSelector<T> combine