Java Utililty Methods List Move Item

StringBuilder b = new StringBuilder();
if (removed.isEmpty()) {
    b.append(list.subList(from, to));
    b.append(" added at ").append(from);
} else {
    b.append(removed);
    if (from == to) {
        b.append(" removed at ").append(from);
...

boolean result;
result = false;
if (indices.length > 0) {
    if (indices[0] > 0)
        result = true;
return result;

String result = null;
String toInvestigate = removeParts(text, partsToRemove);
String longest = "";
String words[] = toInvestigate.split(separator);
for (int i = 0; i < words.length; i++) {
    String word = words[i];
    if (word.length() > longest.length()) {
        longest = word;
...

Set<E> set1 = new LinkedHashSet<E>(list1);
set1.removeAll(list2);
return new ArrayList<E>(set1);

List<T> minusedList = new ArrayList<T>(initialList);
minusedList.removeAll(elementsToRemove);
return minusedList;

if (anIndex1 < 0 || anIndex1 >= aList.size() || anIndex2 < 0 || anIndex2 >= aList.size())
    return;
Object obj = aList.remove(anIndex1);
aList.add(anIndex2, obj);

if (indexToMoveAt >= indexToMoveFrom) {
    Collections.rotate(collection.subList(indexToMoveFrom, indexToMoveAt + 1), -1);
} else {
    Collections.rotate(collection.subList(indexToMoveAt, indexToMoveFrom + 1), 1);

if (indices.length == 0)
    return false; 
Arrays.sort(indices);
if (indices[0] == 0)
    return false; 
for (final int idx : indices) {
    final T element = list.get(idx);
    list.set(idx, list.get(idx - 1));
...

int index = list.indexOf(referenceElement);
if (index != -1) {
    list.remove(element);
    list.add(index, element);
    return true;
return false;

List<String> moved = null;
List<String> compare = null;
if (added != null) {
    for (String child : added) {
        if (compare == null) {
            compare = new ArrayList<String>(nu);
        compare.remove(child);
...