<s>[INST] sorts source and adds the first n entries to dest . if source contains less than n entries , all of them are added to dest . if adding an entry to dest does not increase the collection 's size , for example if dest is a set and already contained the inserted contact , an additional entry of source will be added , if available . this guarantees that n new , distinct entries are added to collection dest as long as this can be fulfilled with the contents of source , and as dest does recognise duplicate entries . consequently , this guarantee does not hold for simple lists . both collections may not be null . concode_field_sep PlaceHolder placeHolder concode_field_sep void filter concode_elem_sep void copyNSortedAndFiltered concode_elem_sep void filterMap concode_elem_sep double getQuantile concode_elem_sep void splitMap concode_elem_sep List<T> getRandomPartFrom concode_elem_sep E getRandomEntry concode_elem_sep E getRandomEntry concode_elem_sep void copyUntilFull concode_elem_sep List<Tt> transformList [/INST] void function ( final Collection < ? extends T > arg0 , final Collection < ? super T > arg1 , final Comparator < ? super T > arg2 , final int arg3 ) { final List < ? extends T > loc0 = Collections . list ( Collections . enumeration ( arg0 ) ) ; Collections . sort ( loc0 , arg2 ) ; final Iterator < ? extends T > loc1 = loc0 . iterator ( ) ; final int loc2 = arg1 . size ( ) + arg3 ; while ( loc1 . hasNext ( ) && arg1 . size ( ) < loc2 ) { arg1 . add ( loc1 . next ( ) ) ; } </s>