List < Map . Entry < K , V >> function ( Collection < Map . Entry < K , V >> arg0 ) { List < Entry < K , V >> loc0 = new ArrayList < > ( arg0 ) ; Collections . sort ( loc0 , ( e1 , e2 ) -> e1 . getKey ( ) . compareTo ( e2 . getKey ( ) ) ) ; return loc0 ; }
sorts a list of entries . this method is here since the entries might come from a counter . concode_field_sep PlaceHolder placeHolder concode_field_sep Map<T,V> getAll concode_elem_sep Map<Y,X> invert concode_elem_sep Map<Y,Set<X>> invertSet concode_elem_sep void putIntoValueArrayList concode_elem_sep void putIntoValueCollection concode_elem_sep Map<X,Z> compose concode_elem_sep void addAll concode_elem_sep void main concode_elem_sep String toString concode_elem_sep void putIntoValueHashSet concode_elem_sep void toStringSorted concode_elem_sep String toStringSorted concode_elem_sep void removeKeys