org.glassfish.grizzly.utils.ArrayUtils.indexOf java code examples

Add the Codota plugin to your IDE and get smart completions

private void myMethod () {
 Dictionary d =new Hashtable()
Bundle bundle;bundle.getHeaders()
new Properties()
Smart code suggestions by Tabnine
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * {@inheritDoc}
 */
@Override
public boolean containsAll(Collection<?> collection) {
  if (collection.isEmpty()) {
    return true;
  }
  final Object[] localArray = array;
  for (Object element : collection) {
    if (ArrayUtils.indexOf(localArray, element) == -1) {
      return false;
    }
  }
  return true;
}

/**
 * Add unique element to the array.
 * @param <T> type of the array element
 * @param array array
 * @param element element to add
 * @param replaceElementIfEquals if passed element is equal to some element
 *              in the array then depending on this parameter it will be
 *              replaced or not with the passed element.
 *
 * @return array, which will contain the new element. Either new array instance, if
 * passed array didn't contain the element, or the same array instance, if the element
 * is already present in the array.
 */
public static <T> T[] addUnique(final T[] array, final T element,
    final boolean replaceElementIfEquals) {
  
  final int idx = indexOf(array, element);
  if (idx == -1) {
    final int length = array.length;
    final T[] newArray = Arrays.copyOf(array, length + 1);
    newArray[length] = element;
    return newArray;
  }
  
  if (replaceElementIfEquals) {
    array[idx] = element;
  }
  
  return array;
}

/**
 * Add unique element to the array.
 * @param <T> type of the array element
 * @param array array
 * @param element element to add
 * @param replaceElementIfEquals if passed element is equal to some element
 *              in the array then depending on this parameter it will be
 *              replaced or not with the passed element.
 *
 * @return array, which will contain the new element. Either new array instance, if
 * passed array didn't contain the element, or the same array instance, if the element
 * is already present in the array.
 */
public static <T> T[] addUnique(final T[] array, final T element,
    final boolean replaceElementIfEquals) {
  
  final int idx = indexOf(array, element);
  if (idx == -1) {
    final int length = array.length;
    final T[] newArray = Arrays.copyOf(array, length + 1);
    newArray[length] = element;
    return newArray;
  }
  
  if (replaceElementIfEquals) {
    array[idx] = element;
  }
  
  return array;
}

/**
 * Add unique element to the array.
 * @param <T> type of the array element
 * @param array array
 * @param element element to add
 * @param replaceElementIfEquals if passed element is equal to some element
 *              in the array then depending on this parameter it will be
 *              replaced or not with the passed element.
 *
 * @return array, which will contain the new element. Either new array instance, if
 * passed array didn't contain the element, or the same array instance, if the element
 * is already present in the array.
 */
public static <T> T[] addUnique(final T[] array, final T element,
    final boolean replaceElementIfEquals) {
  
  final int idx = indexOf(array, element);
  if (idx == -1) {
    final int length = array.length;
    final T[] newArray = Arrays.copyOf(array, length + 1);
    newArray[length] = element;
    return newArray;
  }
  
  if (replaceElementIfEquals) {
    array[idx] = element;
  }
  
  return array;
}

/**
 * Add unique element to the array.
 * @param <T> type of the array element
 * @param array array
 * @param element element to add
 * @param replaceElementIfEquals if passed element is equal to some element
 *              in the array then depending on this parameter it will be
 *              replaced or not with the passed element.
 *
 * @return array, which will contain the new element. Either new array instance, if
 * passed array didn't contain the element, or the same array instance, if the element
 * is already present in the array.
 */
public static <T> T[] addUnique(final T[] array, final T element,
    final boolean replaceElementIfEquals) {
  
  final int idx = indexOf(array, element);
  if (idx == -1) {
    final int length = array.length;
    final T[] newArray = Arrays.copyOf(array, length + 1);
    newArray[length] = element;
    return newArray;
  }
  
  if (replaceElementIfEquals) {
    array[idx] = element;
  }
  
  return array;
}

/**
 * Add unique element to the array.
 * @param <T> type of the array element
 * @param array array
 * @param element element to add
 * @param replaceElementIfEquals if passed element is equal to some element
 *              in the array then depending on this parameter it will be
 *              replaced or not with the passed element.
 *
 * @return array, which will contain the new element. Either new array instance, if
 * passed array didn't contain the element, or the same array instance, if the element
 * is already present in the array.
 */
public static <T> T[] addUnique(final T[] array, final T element,
    final boolean replaceElementIfEquals) {
  
  final int idx = indexOf(array, element);
  if (idx == -1) {
    final int length = array.length;
    final T[] newArray = Arrays.copyOf(array, length + 1);
    newArray[length] = element;
    return newArray;
  }
  
  if (replaceElementIfEquals) {
    array[idx] = element;
  }
  
  return array;
}

/**
 * Add unique element to the array.
 * @param <T> type of the array element
 * @param array array
 * @param element element to add
 * @param replaceElementIfEquals if passed element is equal to some element
 *              in the array then depending on this parameter it will be
 *              replaced or not with the passed element.
 *
 * @return array, which will contain the new element. Either new array instance, if
 * passed array didn't contain the element, or the same array instance, if the element
 * is already present in the array.
 */
public static <T> T[] addUnique(final T[] array, final T element,
    final boolean replaceElementIfEquals) {
  
  final int idx = indexOf(array, element);
  if (idx == -1) {
    final int length = array.length;
    final T[] newArray = Arrays.copyOf(array, length + 1);
    newArray[length] = element;
    return newArray;
  }
  
  if (replaceElementIfEquals) {
    array[idx] = element;
  }
  
  return array;
}

final int idx = indexOf(array, element);
if (idx != -1) {
  final int length = array.length;

final int idx = indexOf(array, element);
if (idx != -1) {
  final int length = array.length;

Javadoc

Return the element index in the array.

Popular methods of ArrayUtils

addUnique
Add unique element to the array.
binarySearch
remove
Removes the element from the array.

Popular in Java

Creating JSON documents from java classes using gson
startActivity (Activity)
getContentResolver (Context)
addToBackStack (FragmentTransaction)
Path (java.nio.file)
Permission (java.security)
Legacy security code; do not use.
MessageFormat (java.text)
Produces concatenated messages in language-neutral way. New code should probably use java.util.Forma
Timer (java.util)
Timers schedule one-shot or recurring TimerTask for execution. Prefer java.util.concurrent.Scheduled
Callable (java.util.concurrent)
A task that returns a result and may throw an exception. Implementors define a single method with no
Semaphore (java.util.concurrent)
A counting semaphore. Conceptually, a semaphore maintains a set of permits. Each #acquire blocks if
Top plugins for WebStorm

How to use indexOfmethodin org.glassfish.grizzly.utils.ArrayUtils

Best Java code snippets using org.glassfish.grizzly.utils.ArrayUtils.indexOf (Showing top 20 results out of 315)

How to use
indexOf
method
in
org.glassfish.grizzly.utils.ArrayUtils