@Override
  public void sort(Comparator<? super Content> comp) {

    if (comp == null) {
      // sort by the 'natural order', which, there is none.
      // options, throw exception, or let the current-order represent the natural order.
      // do nothing is the better alternative.
      return;
    }

    final int sz = size;
    int[] indexes = new int[sz];
    for (int i = 0; i < sz; i++) {
      final int ip = binarySearch(indexes, i, i, comp);
      if (ip < i) {
        System.arraycopy(indexes, ip, indexes, ip + 1, i - ip);
      }
      indexes[ip] = i;
    }
    sortInPlace(indexes);
  }
@Override
  public void sort(Comparator<? super Content> comp)