Java Utililty Methods List Sort

Collections.sort(list, new Comparator<String>() {
    @Override
    public int compare(String o1, String o2) {
        return compareRepositoryNames(o1, o2);
});

if (list != null && list.size() > 0) {
    Collections.sort(list, SIMPLE_NAME_COMPARATOR);
return list;

if (list != null && list.size() > 0) {
    Collections.sort(list, SIMPLE_NAME_COMPARATOR);
return list;

if (lists == null) {
    return null;
} else {
    List<String> result = new ArrayList<String>();
    for (String domain : lists) {
        result.add(domain);
    Collections.sort(result);
...

Vector sorted = new Vector();
while (list.hasMoreElements())
    orderedStringInsert((String) list.nextElement(), sorted);
sorted.trimToSize();
return sorted;

List<String> ret = new ArrayList<String>();
ret.addAll(l);
return ret;

List<String> newList = new ArrayList<String>();
newList.addAll(stringList);
Collections.sort(newList);
return newList;

List<String> list = new ArrayList<>();
for (String item : listToSort) {
    if (isSupported(priorityList, item)) {
        list.add(item);
for (String item : listToSort) {
    if (!isSupported(priorityList, item)) {
...

HashSet<String> tmp = new HashSet<String>();
for (String a : list) {
    tmp.add(a);
List<String> result = new ArrayList<String>();
result.addAll(tmp);
Collections.sort(result);
return result;
...

List<String> sorted = new ArrayList<String>();
for (String t : unsortedTags) {
    t = t.trim();
    if (sorted.contains(t) == false) {
        sorted.add(t);
return sorted;
...