java 1.8 集合接口一览表

柔光的暖阳◎ 2023-02-26 07:26 10阅读 0赞

<table> 
 <tbody> 
 <tr> 
 <td style="vertical-align:top;width:212pt;">Collection</td> 
 <td style="vertical-align:top;width:310pt;">集合接口</td> 
 <td style="vertical-align:top;">抽象接口，没有直接实现类</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;"> &nbsp; </td> 
 <td style="vertical-align:top;">int size()</td> 
 <td style="vertical-align:top;">返回元素个数</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">&nbsp;</td> 
 <td style="vertical-align:top;">boolean isEmpty()</td> 
 <td style="vertical-align:top;">查询是否为空</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean contains(Object o)</td> 
 <td style="vertical-align:top;">查询是否包含，通过equals方法判断</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean containsAll(Collection&lt;?&gt; c)</td> 
 <td style="vertical-align:top;">批量判断是否包含</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean add(E e)</td> 
 <td style="vertical-align:top;">添加元素，方法结束后集合一定包含指定元素, 如果集合禁止重复且元素已包含时将返回false； 当因为插入限制而无法添加时，且不是因为元素已包含时，必须抛IllegalStateException，而不是返回false</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean addAll(Collection&lt;? extends E&gt; c)</td> 
 <td style="vertical-align:top;">批量添加</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean remove(Object o)</td> 
 <td style="vertical-align:top;">删除元素，删除所有和指定对象相等的元素，当至少删除一个元素返回true</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean remove(Collection&lt;?&gt;)</td> 
 <td style="vertical-align:top;">批量删除</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">default boolean removeIf(Predicate&lt;? super E&gt; p)</td> 
 <td style="vertical-align:top;">条件删除</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean retainAll(Collection&lt;?&gt; c)</td> 
 <td style="vertical-align:top;">两个集合取交集</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">Object[] toArray()</td> 
 <td style="vertical-align:top;">元素导入新建数组</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">T[] toArray(T[] a)</td> 
 <td style="vertical-align:top;">元素导入给定数组</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">void clear()</td> 
 <td style="vertical-align:top;">清空集合</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">Iterator&lt;E&gt; iterator()</td> 
 <td style="vertical-align:top;">返回迭代器</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">default Splitrator&lt;E&gt; spliterator()</td> 
 <td style="vertical-align:top;">返回并发迭代器</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">default Stream&lt;E&gt; stream()</td> 
 <td style="vertical-align:top;">　</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">default Stream&lt;E&gt; parallelStream()</td> 
 <td style="vertical-align:top;">　</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">Set extends Collection</td> 
 <td style="vertical-align:top;">数学集合</td> 
 <td style="vertical-align:top;">元素不重复，无序,可包含一个null 通过元素的equal方法确定是否重复 注意如果元素是可变类型的，那修改一个元素使其equals另一个元素，那么Set将不保证元素的唯一性</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">@Override boolean add(E e)</td> 
 <td style="vertical-align:top;">添加元素，当指定元素已包含时，返回false</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">@Override boolean equals(Object o)</td> 
 <td style="vertical-align:top;">当指定对象也是Set类型，两个Set的元素数目一样，且当前Set包含指定Set所有元素</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">@Override int hashCode()</td> 
 <td style="vertical-align:top;">返回哈希值，等于所有元素的哈希值的和,保证了两个Set如果equals那么hashCode一定相同</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">List extends Collection</td> 
 <td style="vertical-align:top;">序列</td> 
 <td style="vertical-align:top;">元素有先后顺序，元素可重复</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">default void sort(Comparator&lt;? Super E&gt; c)</td> 
 <td style="vertical-align:top;">排序</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">default void replaceAll(UnaryOperator&lt;E&gt;)</td> 
 <td style="vertical-align:top;">更新每个元素为对应的运算结果</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E set(int index, E element)</td> 
 <td style="vertical-align:top;">更新指定位置的元素</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">void add(int index, E element)</td> 
 <td style="vertical-align:top;">在指定位置插入元素</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E remove(int index)</td> 
 <td style="vertical-align:top;">删除指定位置的元素</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">int indexOf(Object o)</td> 
 <td style="vertical-align:top;">查询和指定对象相等的第一个元素的位置</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">int lastIndexOf(Object o)</td> 
 <td style="vertical-align:top;">查询和指定对象相等的最后一个元素的位置</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">ListIterator&lt;E&gt; listIterator()</td> 
 <td style="vertical-align:top;">返回列表迭代器</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">List&lt;E&gt; subList&lt;int fromIndexm, int toIndex&gt;</td> 
 <td style="vertical-align:top;">返回子列表试图</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">@Override boolean equals(Object o)</td> 
 <td style="vertical-align:top;">当指定对象也是List类型，两个List包含相等元素且顺序相同,返回true</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">@Override int hashCode()</td> 
 <td style="vertical-align:top;">返回哈希值，保证两个List如果equals那么hashCode一定相等，但是hashCode相等的两个List并不一定equals</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">Queue extends Collection</td> 
 <td style="vertical-align:top;">队列</td> 
 <td style="vertical-align:top;">接口只定义对头出队、队尾入队和查询队头三种方法</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">&nbsp;</td> 
 <td style="vertical-align:top;">@Override boolean add(E e)</td> 
 <td style="vertical-align:top;">入队，如果队列满了，则抛IllegalStateException</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">&nbsp;</td> 
 <td style="vertical-align:top;">boolean offer(E e)</td> 
 <td style="vertical-align:top;">入队，如果队列满了，则返回false</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">&nbsp;</td> 
 <td style="vertical-align:top;">@Override E remove()</td> 
 <td style="vertical-align:top;">出队，如果队列空了，则抛NoSuchElementException</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">&nbsp;</td> 
 <td style="vertical-align:top;">E poll()</td> 
 <td style="vertical-align:top;">出队，如果队列空了，则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">&nbsp;</td> 
 <td style="vertical-align:top;">E element()</td> 
 <td style="vertical-align:top;">查询队头，如果队列空了，则抛NoSuchElementException</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">&nbsp;</td> 
 <td style="vertical-align:top;">E peek()</td> 
 <td style="vertical-align:top;">查询队头，如果队列空了，则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">BlockingQueue extends Queue</td> 
 <td style="vertical-align:top;">阻塞队列（线程安全）</td> 
 <td style="vertical-align:top;">当某些操作需要的条件当前无法满足，但可能在将来某个时间点满足时，该接口均支持4种策略： 1、抛出异常-&gt;add 、remove、 element 2、返回特殊值(false、null) -&gt;offer、 poll、 peek 3、有限等待，如果条件一致不满足，等到超时时间，返回特殊值-&gt;offer(timeout)、poll(timeout) 4、无限等待，直到条件满足 -&gt; put、 take&nbsp;</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean offer(E e, ling timeout, TimeUnit unit)</td> 
 <td style="vertical-align:top;">入队，如果队列满了，则等待指定的时间，如果仍满则返回false</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">void put(E e)</td> 
 <td style="vertical-align:top;">入队，如果队列满了，则一直等待，直到队列不满</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E poll(long timeout, TimeUnit unit)</td> 
 <td style="vertical-align:top;">出队，如果队列空了，则等待指定的时间，如果仍空则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E take()</td> 
 <td style="vertical-align:top;">出队，如果队列空了，则一致等待，直到队列不空</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">int drainTo(Collection&lt;? Super E&gt; c)</td> 
 <td style="vertical-align:top;">排水方法：所有元素依次转移到给定集合中</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">int drainTo(Collection&lt;? Super E&gt; c, int maxElements)</td> 
 <td style="vertical-align:top;">排水方法：指定数量的元素依次转移到给定集合中</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">Deque extends Queue</td> 
 <td style="vertical-align:top;">双端队列</td> 
 <td style="vertical-align:top;">只能在队尾或者队头入队出队</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">void addFirst(E e)</td> 
 <td style="vertical-align:top;">对头入队，如果队列满了，则抛IllegalStateException，当使用容量限制的deque时，通常最好使用方法offerFirst</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">void addLast(E e)</td> 
 <td style="vertical-align:top;">对尾入队，如果队列满了，则抛IllegalStateException，当使用容量限制的deque时，通常最好使用方法offerLast</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean offerFirst(E e)</td> 
 <td style="vertical-align:top;">队头入队，如果队列满了，则返回false</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean offerLast(E e)</td> 
 <td style="vertical-align:top;">队尾入队，如果队列满了，则返回false</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E removeFirst()</td> 
 <td style="vertical-align:top;">队头出队，如果队列空了，则抛NoSuchElementException</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E removeLast()</td> 
 <td style="vertical-align:top;">队尾出队，如果队列空了，则抛NoSuchElementException</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E pollFirst()</td> 
 <td style="vertical-align:top;">队头出队，如果队列空了，则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E pollLast()</td> 
 <td style="vertical-align:top;">队尾出队，如果队列空了，则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E getFirst()</td> 
 <td style="vertical-align:top;">查询队头，如果队列空了，则抛NoSuchElementException</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E getLast()</td> 
 <td style="vertical-align:top;">查询队尾，如果队列空了，则抛NoSuchElementException</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E peekFist()</td> 
 <td style="vertical-align:top;">查询队头，如果队列空了，则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E peekLast()</td> 
 <td style="vertical-align:top;">查询队尾，如果队列空了，则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean removeFirstOccurrence(Object o)</td> 
 <td style="vertical-align:top;">删除和指定对象相等的第一个元素，如果发生删除则返回true</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean removeLastOccurrence(Object o)</td> 
 <td style="vertical-align:top;">删除和指定对象相等的最后一个元素，如果发生删除则返回true</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">void push(E e)</td> 
 <td style="vertical-align:top;">意象方法，把deque看做栈，表示入栈，如果队列满了，则抛IllegalStateException，实际实现中直接调用addFirst方法</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E pop()</td> 
 <td style="vertical-align:top;">意象方法，效果和removeFirst一样，把deque看做栈，表示出栈，如果队列空了，则抛NoSuchElementException，实际实现中直接调用removeFirst方法</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">BlockingDeque extends BlockingQueue, Deque</td> 
 <td style="vertical-align:top;">阻塞双端队列（线程安全）</td> 
 <td style="vertical-align:top;">　</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean offerFist(E e, long timeout, TimeUnit unit)</td> 
 <td style="vertical-align:top;">队头入队，如果队列满了，则等待指定的时间，如果仍满则返回false</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">boolean offerLast(E e, long timeout, TimeUnit unit)</td> 
 <td style="vertical-align:top;">队尾入队，如果队列满了，则等待指定的时间，如果仍满则返回false</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">void putFist(E e)</td> 
 <td style="vertical-align:top;">队头入队，如果队列满了，则一直等待，直到队列不满</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">void putLast(E e)</td> 
 <td style="vertical-align:top;">队尾入队，如果队列满了，则一直等待，直到队列不满</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E pollFirst(long timeout, TimeUnit unit)</td> 
 <td style="vertical-align:top;">对头出队，如果队列空了，则等待指定的时间，如果仍空则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E pollLast(long timeout, TimeUnit unit)</td> 
 <td style="vertical-align:top;">对尾出队，如果队列空了，则等待指定的时间，如果仍空则返回null</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E takeFirst()</td> 
 <td style="vertical-align:top;">队头出队，如果队列空了，则一致等待，直到队列不空</td> 
 </tr> 
 <tr> 
 <td style="vertical-align:top;">　</td> 
 <td style="vertical-align:top;">E takeLast()</td> 
 <td style="vertical-align:top;">队尾出队，如果队列空了，则一致等待，直到队列不空</td> 
 </tr> 
 </tbody> 
</table>