For IntelliJ IDEA,

Android Studio or Eclipse

/** * Sorts the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the characteristics of the data set. * * This implementation simply calls <tt>sortFromTo(...)</tt>. * Override <tt>sortFromTo(...)</tt> if you can determine which sort is most appropriate for the given data set. */ public final void sort() { sortFromTo(0, size()-1); } /**

/** * Sorts the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the * characteristics of the data set. * * This implementation simply calls <tt>sortFromTo(...)</tt>. Override * <tt>sortFromTo(...)</tt> if you can determine which sort is most * appropriate for the given data set. */ public final void sort() { sortFromTo(0, size() - 1); }

/** * Sorts the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the characteristics of the data set. * * This implementation simply calls <tt>sortFromTo(...)</tt>. * Override <tt>sortFromTo(...)</tt> if you can determine which sort is most appropriate for the given data set. */ public final void sort() { sortFromTo(0, size()-1); } /**

/** * Sorts the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the * characteristics of the data set. * * This implementation simply calls <tt>sortFromTo(...)</tt>. Override * <tt>sortFromTo(...)</tt> if you can determine which sort is most * appropriate for the given data set. */ public final void sort() { sortFromTo(0, size() - 1); }

/** * Sorts the receiver into ascending order. * * The sorting algorithm is dynamically chosen according to the * characteristics of the data set. * * This implementation simply calls <tt>sortFromTo(...)</tt>. Override * <tt>sortFromTo(...)</tt> if you can determine which sort is most * appropriate for the given data set. */ public final void sort() { sortFromTo(0, size() - 1); }