javadocs

diff --git a/gdx/src/com/badlogic/gdx/utils/Array.java b/gdx/src/com/badlogic/gdx/utils/Array.java
index 325fe31..45628d8 100644 (file)
--- a/gdx/src/com/badlogic/gdx/utils/Array.java
+++ b/gdx/src/com/badlogic/gdx/utils/Array.java
@@ -336,6 +336,7 @@ public class Array<T> implements Iterable<T> {
        }\r
 \r
        /** Selects the nth-lowest element from the Array according to Comparator ranking.\r
+        * This might partially sort the Array, affecting draw order for drawn elements.\r
         * @see Select\r
         * @param comparator used for comparison\r
         * @param nth_lowest rank of desired object according to comparison,\r

diff --git a/gdx/src/com/badlogic/gdx/utils/Select.java b/gdx/src/com/badlogic/gdx/utils/Select.java
index 772920e..c98d9ba 100644 (file)
--- a/gdx/src/com/badlogic/gdx/utils/Select.java
+++ b/gdx/src/com/badlogic/gdx/utils/Select.java
@@ -7,6 +7,7 @@ import java.util.Comparator;
  * an unordered list in faster time than sorting the whole array.
  * Typical applications include finding the nearest enemy unit(s), and other
  * operations which are likely to run as often as every x frames.
+ * Certain values of k will result in a partial sorting of the Array.
  * <p>The lowest ranking element starts at 1, not 0. 1 = first, 2 = second, 3 = third, etc.
  * calling with a value of zero will result in a {@link GdxRuntimeException} </p>
  * <p> This class uses very minimal extra memory, as it makes no copies of the array.