SortedSet < T > function ( Comparator < T > arg0 , T ... arg1 ) { SortedSet < T > loc0 = new TreeSet < T > ( arg0 ) ; Collections . addAll ( loc0 , arg1 ) ; return loc0 ; }
wraps the given items in a mutable sorted set using the given comparator . concode_field_sep PlaceHolder placeHolder concode_field_sep Set<T> toSet concode_elem_sep SortedMap<K,V> toSortedMap concode_elem_sep Map<K,V> toMap concode_elem_sep T[] toArray concode_elem_sep Set<T> toLinkedSet concode_elem_sep Properties toProperties concode_elem_sep List<T> toList concode_elem_sep List<T> toList concode_elem_sep DomainObjectSet<T> toDomainObjectSet concode_elem_sep Set<T> asSet concode_elem_sep Map<K,V> toLinkedMap