/** * Fills all keys <i>sorted ascending by their associated value</i> into the specified list. * Fills into the list, starting at index 0. * After this call returns the specified list has a new size that equals <tt>this.size()</tt>. * Primary sort criterium is "value", secondary sort criterium is "key". * This means that if any two values are equal, the smaller key comes first. * <p> * <b>Example:</b> * <br> * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> * * @param keyList the list to be filled, can have any size. */ public void keysSortedByValue(final IntArrayList keyList) { pairsSortedByValue(keyList, new ObjectArrayList(size())); } /**
/** * Fills all keys <i>sorted ascending by their associated value</i> into the specified list. * Fills into the list, starting at index 0. * After this call returns the specified list has a new size that equals <tt>this.size()</tt>. * Primary sort criterium is "value", secondary sort criterium is "key". * This means that if any two values are equal, the smaller key comes first. * <p> * <b>Example:</b> * <br> * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> * * @param keyList the list to be filled, can have any size. */ public void keysSortedByValue(final IntArrayList keyList) { pairsSortedByValue(keyList, new ObjectArrayList(size())); } /**
/** * Fills all keys <i>sorted ascending by their associated value</i> into the * specified list. Fills into the list, starting at index 0. After this call * returns the specified list has a new size that equals * <tt>this.size()</tt>. Primary sort criterium is "value", secondary sort * criterium is "key". This means that if any two values are equal, the * smaller key comes first. * <p> * <b>Example:</b> <br> * <tt>keys = (8,7,6), values = (1,2,2) --> keyList = (8,6,7)</tt> * * @param keyList * the list to be filled, can have any size. */ public void keysSortedByValue(final IntArrayList keyList) { pairsSortedByValue(keyList, new ObjectArrayList(size())); }