/** {@inheritDoc} */ @Override public boolean has(int value) { return ints.indexOf(value) >= 0; }
/** @inheritDoc */ public boolean has(int value) { return ints.indexOf(value) >= 0; }
/** {@inheritDoc} */ @Override public boolean has(int value) { return ints.indexOf(value) >= 0; }
/** @inheritDoc */ public boolean has(int value) { return ints.indexOf(value) >= 0; }
/** {@inheritDoc} */ public boolean has(int value) { return ints.indexOf(value) >= 0; }
/** * Returns whether or not the given value appears in the list. * This will do a binary search if the list is sorted or a linear * search if not. * * @see #sort * * @param value value to look for * @return whether the list contains the given value */ public boolean contains(int value) { return indexOf(value) >= 0; } }
/** * Returns whether or not the given value appears in the list. * This will do a binary search if the list is sorted or a linear * search if not. * * @see #sort * * @param value value to look for * @return whether the list contains the given value */ public boolean contains(int value) { return indexOf(value) >= 0; } }
/** * Returns whether or not the given value appears in the list. * This will do a binary search if the list is sorted or a linear * search if not. * * @see #sort * * @param value value to look for * @return whether the list contains the given value */ public boolean contains(int value) { return indexOf(value) >= 0; } }
/** @inheritDoc */ public boolean has(int value) { return ints.indexOf(value) >= 0; }
/** @inheritDoc */ public boolean has(int value) { return ints.indexOf(value) >= 0; }
/** * Returns whether or not the given value appears in the list. * This will do a binary search if the list is sorted or a linear * search if not. * * @see #sort * * @param value value to look for * @return whether the list contains the given value */ public boolean contains(int value) { return indexOf(value) >= 0; } }
/** @inheritDoc */ public boolean has(int value) { return ints.indexOf(value) >= 0; }
/** * Returns whether or not the given value appears in the list. * This will do a binary search if the list is sorted or a linear * search if not. * * @see #sort * * @param value value to look for * @return whether the list contains the given value */ public boolean contains(int value) { return indexOf(value) >= 0; } }
/** @inheritDoc */ public void remove(int value) { int index = ints.indexOf(value); if (index >= 0) { ints.removeIndex(index); } }
/** @inheritDoc */ public void remove(int value) { int index = ints.indexOf(value); if (index >= 0) { ints.removeIndex(index); } }
/** {@inheritDoc} */ public void remove(int value) { int index = ints.indexOf(value); if (index >= 0) { ints.removeIndex(index); } }
/** @inheritDoc */ public void remove(int value) { int index = ints.indexOf(value); if (index >= 0) { ints.removeIndex(index); } }
/** @inheritDoc */ public void remove(int value) { int index = ints.indexOf(value); if (index >= 0) { ints.removeIndex(index); } }
/** {@inheritDoc} */ @Override public void remove(int value) { int index = ints.indexOf(value); if (index >= 0) { ints.removeIndex(index); } }
/** @inheritDoc */ public void remove(int value) { int index = ints.indexOf(value); if (index >= 0) { ints.removeIndex(index); } }