help methods for manipulating arrays
This commit is contained in:
parent
ac11dc90d8
commit
fe0f03a5fd
1 changed files with 90 additions and 0 deletions
90
tools/cooja/java/se/sics/cooja/util/ArrayUtils.java
Normal file
90
tools/cooja/java/se/sics/cooja/util/ArrayUtils.java
Normal file
|
@ -0,0 +1,90 @@
|
||||||
|
/*
|
||||||
|
* Copyright (c) 2009, Swedish Institute of Computer Science. All rights
|
||||||
|
* reserved.
|
||||||
|
*
|
||||||
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
* modification, are permitted provided that the following conditions are met:
|
||||||
|
* 1. Redistributions of source code must retain the above copyright notice,
|
||||||
|
* this list of conditions and the following disclaimer. 2. Redistributions in
|
||||||
|
* binary form must reproduce the above copyright notice, this list of
|
||||||
|
* conditions and the following disclaimer in the documentation and/or other
|
||||||
|
* materials provided with the distribution. 3. Neither the name of the
|
||||||
|
* Institute nor the names of its contributors may be used to endorse or promote
|
||||||
|
* products derived from this software without specific prior written
|
||||||
|
* permission.
|
||||||
|
*
|
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND ANY
|
||||||
|
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||||
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||||
|
* DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE FOR ANY
|
||||||
|
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||||||
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||||||
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||||
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||||||
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||||
|
*
|
||||||
|
* $Id: ArrayUtils.java,v 1.1 2009/07/02 11:58:37 fros4943 Exp $
|
||||||
|
*/
|
||||||
|
|
||||||
|
package se.sics.cooja.util;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Some utility methods for managing arrays.
|
||||||
|
*
|
||||||
|
* @author Niclas Finne, Fredrik Osterlind
|
||||||
|
*/
|
||||||
|
public class ArrayUtils {
|
||||||
|
|
||||||
|
@SuppressWarnings("unchecked")
|
||||||
|
public static <T> T[] add(T[] array, T value) {
|
||||||
|
T[] tmp = (T[]) java.lang.reflect.Array.newInstance(
|
||||||
|
((Class<? extends T>)array.getClass()).getComponentType(),
|
||||||
|
array.length + 1);
|
||||||
|
System.arraycopy(array, 0, tmp, 0, array.length);
|
||||||
|
tmp[array.length] = value;
|
||||||
|
return tmp;
|
||||||
|
}
|
||||||
|
|
||||||
|
@SuppressWarnings("unchecked")
|
||||||
|
public static <T> T[] remove(T[] array, int index) {
|
||||||
|
if ((index < 0) || (index >= array.length)) {
|
||||||
|
throw new ArrayIndexOutOfBoundsException(index);
|
||||||
|
}
|
||||||
|
|
||||||
|
T[] tmp = (T[]) java.lang.reflect.Array.newInstance(
|
||||||
|
((Class<? extends T>)array.getClass()).getComponentType(),
|
||||||
|
array.length - 1);
|
||||||
|
if (index > 0) {
|
||||||
|
System.arraycopy(array, 0, tmp, 0, index);
|
||||||
|
}
|
||||||
|
if (index < tmp.length) {
|
||||||
|
System.arraycopy(array, index + 1, tmp, index, tmp.length - index);
|
||||||
|
}
|
||||||
|
return tmp;
|
||||||
|
}
|
||||||
|
|
||||||
|
public static <T> T[] remove(T[] array, T element) {
|
||||||
|
int index = indexOf(array, element);
|
||||||
|
return (index >= 0) ? remove(array, index) : array;
|
||||||
|
}
|
||||||
|
|
||||||
|
public static <T> int indexOf(T[] array, T element) {
|
||||||
|
if (array != null) {
|
||||||
|
if (element == null) {
|
||||||
|
for (int i = 0, n = array.length; i < n; i++) {
|
||||||
|
if (array[i] == null) {
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
for (int i = 0, n = array.length; i < n; i++) {
|
||||||
|
if (element.equals(array[i])) {
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
}
|
Loading…
Reference in a new issue