সংগ্রহ

boolean addAll(Collection<? super T> c, T... elements)

Queue<T> asLifoQueue(Deque<T> deque)

int binarySearch(List<? extends T> list, T key, Comparator<? super T> c)

Collection<E> checkedCollection(Collection<E> c, Class<E> type)

void copy(List<? super T> dest, List<? extends T> src)

boolean disjoint(Collection<?> c1, Collection<?> c2)

void fill(List<? super T> list, T obj)

int frequency(Collection<?> c, Object o)

int indexOfSubList(List<?> source, List<?> target)

int lastIndexOfSubList(List<?> source, List<?> target)

T max(Collection<? extends T> coll)

T min(Collection<? extends T> coll)

List<T>nCopies(int n, To)

boolean replaceAll(List<T> list, T oldVal, T newVal)

void reverse(List<?> list)

void shuffle(List<?> list)

List<T>singletonList(To)

void sort(List<T> list)

void swap(List<?> list, int i, int j)

Collection<T>synchronizedCollection(Collection<T> c)