How to use

isEmpty

method

in

jodd.util.collection.SortedArrayList

/**
 * Adds an Object to sorted list. Object is inserted at correct place, found
 * using binary search. If the same item exist, it will be put to the end of
 * the range.
 * <p>
 * This method breaks original list contract since objects are not
 * added at the list end, but in sorted manner.
 */
@Override
public boolean add(E o) {
  int idx = 0;
  if (!isEmpty()) {
    idx = findInsertionPoint(o);
  }
  super.add(idx, o);
  return true;
}

/**
 * Adds an Object to sorted list. Object is inserted at correct place, found
 * using binary search. If the same item exist, it will be put to the end of
 * the range.
 * <p>
 * This method breaks original list contract since objects are not
 * added at the list end, but in sorted manner.
 */
@Override
public boolean add(final E o) {
  int idx = 0;
  if (!isEmpty()) {
    idx = findInsertionPoint(o);
  }
  super.add(idx, o);
  return true;
}

/**
 * Adds an Object to sorted list. Object is inserted at correct place, found
 * using binary search. If the same item exist, it will be put to the end of
 * the range.
 * <p>
 * This method breaks original list contract since objects are not
 * added at the list end, but in sorted manner.
 */
@Override
public boolean add(E o) {
  int idx = 0;
  if (isEmpty() == false) {
    idx = findInsertionPoint(o);
  }
  super.add(idx, o);
  return true;
}

/**
 * Adds an Object to sorted list. Object is inserted at correct place, found
 * using binary search. If the same item exist, it will be put to the end of
 * the range.
 * <p>
 * This method breaks original list contract since objects are not
 * added at the list end, but in sorted manner.
 */
@Override
public boolean add(final E o) {
  int idx = 0;
  if (!isEmpty()) {
    idx = findInsertionPoint(o);
  }
  super.add(idx, o);
  return true;
}