Apache
/
commons-lang
mirror of https://github.com/apache/commons-lang.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Remove trailing whitespaces

This commit is contained in:
Benedikt Ritter 2016-09-11 14:49:45 +02:00
parent f83e93685b
commit 5ceb5f5721
1 changed files with 47 additions and 47 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

94
src/main/java/org/apache/commons/lang3/ArrayUtils.java
View File

@ -7643,10 +7643,10 @@ public static boolean isSorted(boolean[] array) {
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7655,16 +7655,16 @@ public static boolean[] removeAllOccurences(final boolean[] array, final boolean
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
return removeAll(array, Arrays.copyOf(indices, count));
}
/**
@ -7672,10 +7672,10 @@ public static boolean[] removeAllOccurences(final boolean[] array, final boolean
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7684,16 +7684,16 @@ public static char[] removeAllOccurences(final char[] array, final char element)
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
return removeAll(array, Arrays.copyOf(indices, count));
}
/**
@ -7701,10 +7701,10 @@ public static char[] removeAllOccurences(final char[] array, final char element)
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7713,15 +7713,15 @@ public static byte[] removeAllOccurences(final byte[] array, final byte element)
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
}
@ -7730,10 +7730,10 @@ public static byte[] removeAllOccurences(final byte[] array, final byte element)
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7742,15 +7742,15 @@ public static short[] removeAllOccurences(final short[] array, final short eleme
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
}
@ -7759,10 +7759,10 @@ public static short[] removeAllOccurences(final short[] array, final short eleme
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7771,15 +7771,15 @@ public static int[] removeAllOccurences(final int[] array, final int element) {
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
}
@ -7788,10 +7788,10 @@ public static int[] removeAllOccurences(final int[] array, final int element) {
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7800,15 +7800,15 @@ public static long[] removeAllOccurences(final long[] array, final long element)
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
}
@ -7817,10 +7817,10 @@ public static long[] removeAllOccurences(final long[] array, final long element)
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7829,15 +7829,15 @@ public static float[] removeAllOccurences(final float[] array, final float eleme
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
}
@ -7846,10 +7846,10 @@ public static float[] removeAllOccurences(final float[] array, final float eleme
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7858,15 +7858,15 @@ public static double[] removeAllOccurences(final double[] array, final double el
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
}
@ -7875,11 +7875,11 @@ public static double[] removeAllOccurences(final double[] array, final double el
* Removes the occurrences of the specified element from the specified array. All subsequent elements are shifted to
* the left (subtracts one from their indices). If the array doesn't contains such an element, no elements are
* removed from the array. <code>null</code> will be returned if the input array is <code>null</code>
*
*
* @param <T> the type of object in the array
* @param element the element to remove
* @param array the input array
*
*
* @return A new array containing the existing elements except the occurrences of the specified element.
* @since 3.5
*/
@ -7888,15 +7888,15 @@ public static <T> T[] removeAllOccurences(final T[] array, final T element) {
if (index == INDEX_NOT_FOUND) {
return clone(array);
}
int[] indices = new int[array.length - index];
indices[0] = index;
int count = 1;
while ((index = indexOf(array, element, indices[count - 1] + 1)) != INDEX_NOT_FOUND) {
indices[count++] = index;
}
return removeAll(array, Arrays.copyOf(indices, count));
}
}