add new method 'uniq()'

primitiveCollections/src/main/java/org/lucares/collections/IntList.java

@@ -54,7 +54,9 @@ public final class IntList implements Serializable, Cloneable {
 
 	/**
 	 * Keeps track of whether or not the list is sorted. This allows us to use
-	 * binary search for {@link #indexOf(int)}. An empty list is sorted.
+	 * binary search for {@link #indexOf(int)} and efficient algorithms for
+	 * {@link #intersection(IntList, IntList)} / {@link #union(IntList, IntList)} /
+	 * {@link #uniq()} / {@link #removeAll(int, int)}. An empty list is sorted.
 	 */
 	private boolean sorted = true;
 
@@ -680,6 +682,38 @@ public final class IntList implements Serializable, Cloneable {
 		checkIfSorted();
 	}
 
+	/**
+	 * Removes all duplicate values from the list. The list will be sorted if it is
+	 * not already sorted.
+	 *
+	 * The list can have unused capacity. Consider using {@link #trim()}.
+	 */
+	public void uniq() {
+		if (size <= 1) {
+			// nothing to do
+			return;
+		}
+		if (!sorted) {
+			sort();
+		}
+		uniqSorted();
+	}
+
+	private void uniqSorted() {
+		int insertPosition = 1;
+		int prev = data[0];
+		for (int i = 1; i < size; i++) {
+			final int current = data[i];
+
+			if (prev != current) {
+				data[insertPosition] = current;
+				insertPosition++;
+				prev = current;
+			}
+		}
+		size = insertPosition;
+	}
+
 	private void ensureCapacity(final int newElements) {
 
 		final int requiredCapacity = size + newElements;

primitiveCollections/src/main/java/org/lucares/collections/LongList.java

@@ -39,7 +39,10 @@ public final class LongList implements Serializable, Cloneable {
 
 	/**
 	 * Keeps track of whether or not the list is sorted. This allows us to use
-	 * binary search for {@link #indexOf(int)}. An empty list is sorted.
+	 * binary search for {@link #indexOf(int)} and efficient algorithms for
+	 * {@link #intersection(LongList, LongList)} /
+	 * {@link #union(LongList, LongList)} / {@link #uniq()} /
+	 * {@link #removeAll(int, int)}. An empty list is sorted.
 	 */
 	private boolean sorted = true;
 
@@ -685,6 +688,38 @@ public final class LongList implements Serializable, Cloneable {
 		checkIfSorted();
 	}
 
+	/**
+	 * Removes all duplicate values from the list. The list will be sorted if it is
+	 * not already sorted.
+	 *
+	 * The list can have unused capacity. Consider using {@link #trim()}.
+	 */
+	public void uniq() {
+		if (size <= 1) {
+			// nothing to do
+			return;
+		}
+		if (!sorted) {
+			sort();
+		}
+		uniqSorted();
+	}
+
+	private void uniqSorted() {
+		int insertPosition = 1;
+		long prev = data[0];
+		for (int i = 1; i < size; i++) {
+			final long current = data[i];
+
+			if (prev != current) {
+				data[insertPosition] = current;
+				insertPosition++;
+				prev = current;
+			}
+		}
+		size = insertPosition;
+	}
+
 	private void ensureCapacity(final int newElements) {
 
 		final int requiredCapacity = size + newElements;
@@ -1182,4 +1217,5 @@ public final class LongList implements Serializable, Cloneable {
 			sorted = data[i - 1] <= data[i];
 		}
 	}
+
 }