JDK源码阅读之AbstractCollection
来源:互联网 发布:js indexof 判断 编辑:程序博客网 时间:2024/05/16 15:26
/*
AbstractCollection提供了Collection的简单实现。用户如果想实现一个不可变更的Collection,只需继承AbstractCollection并实现iterator()和size()方法即可。如果是要实现一个可变更的Collection,需要在之前工作的基础上,重写add()方法,并使得iterator()方法返回的iterator实现remove()方法。
下面把编程过程中可能会出现的异常总结如下:
boolean contains(Object o):ClassCastException表示要查找的元素类型与集合不兼容
NullPointerException表示要查找的元素为null或集合内不允许出现null元素
<T> T[] toArray(T[] a):ArrayStoreException表示集合中存在一些元素,这些元素的类型不是Array的子类型
NullPointerException表示Array为null
boolean add(E e):UnsupportedOperationException表示该集合不支持add操作
ClassCastException:元素所属的类不允许其被添加到集合中
IllegalArgumentException:元素的某些属性不允许其被添加到集合中
IllegalStateException:由于插入操作被限制,导致元素无法被添加到集合
boolean remove(Object o):ClassCastException,NullPointerException,UnsupportedOperationException 跟其他方法中的异常是同样的意思。
*/
以下为AbstractCollection源码:
public abstract class AbstractCollection<E> implements Collection<E> {
protected AbstractCollection() {
}
public abstract Iterator<E> iterator();
public abstract int size();
public boolean isEmpty() {
return size() == 0;
}
public boolean contains(Object o) {
Iterator<E> it = iterator();
if (o==null) {
while (it.hasNext())
if (it.next()==null)
return true;
} else {
while (it.hasNext())
if (o.equals(it.next()))
return true;
}
return false;
}
public Object[] toArray() {
// Estimate size of array; be prepared to see more or fewer elements
Object[] r = new Object[size()];
Iterator<E> it = iterator();
for (int i = 0; i < r.length; i++) {
if (! it.hasNext()) // fewer elements than expected
return Arrays.copyOf(r, i);
r[i] = it.next();
}
return it.hasNext() ? finishToArray(r, it) : r;
}
public <T> T[] toArray(T[] a) {
// Estimate size of array; be prepared to see more or fewer elements
int size = size();
T[] r = a.length >= size ? a :
(T[])java.lang.reflect.Array
.newInstance(a.getClass().getComponentType(), size);
Iterator<E> it = iterator();
for (int i = 0; i < r.length; i++) {
if (! it.hasNext()) { // fewer elements than expected
if (a == r) {
r[i] = null; // null-terminate
} else if (a.length < i) {
return Arrays.copyOf(r, i);
} else {
System.arraycopy(r, 0, a, 0, i);
if (a.length > i) {
a[i] = null;
}
}
return a;
}
r[i] = (T)it.next();
}
// more elements than expected
return it.hasNext() ? finishToArray(r, it) : r;
}
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
private static <T> T[] finishToArray(T[] r, Iterator<?> it) {
int i = r.length;
while (it.hasNext()) {
int cap = r.length;
if (i == cap) {
int newCap = cap + (cap >> 1) + 1;
// overflow-conscious code
if (newCap - MAX_ARRAY_SIZE > 0)
newCap = hugeCapacity(cap + 1);
r = Arrays.copyOf(r, newCap);
}
r[i++] = (T)it.next();
}
// trim if overallocated
return (i == r.length) ? r : Arrays.copyOf(r, i);
}
private static int hugeCapacity(int minCapacity) {
if (minCapacity < 0) // overflow
throw new OutOfMemoryError
("Required array size too large");
return (minCapacity > MAX_ARRAY_SIZE) ?
Integer.MAX_VALUE :
MAX_ARRAY_SIZE;
}
public boolean add(E e) {
throw new UnsupportedOperationException();
}
public boolean remove(Object o) {
Iterator<E> it = iterator();
if (o==null) {
while (it.hasNext()) {
if (it.next()==null) {
it.remove();
return true;
}
}
} else {
while (it.hasNext()) {
if (o.equals(it.next())) {
it.remove();
return true;
}
}
}
return false;
}
public boolean containsAll(Collection<?> c) {
for (Object e : c)
if (!contains(e))
return false;
return true;
}
public boolean addAll(Collection<? extends E> c) {
boolean modified = false;
for (E e : c)
if (add(e))
modified = true;
return modified;
}
public boolean removeAll(Collection<?> c) {
boolean modified = false;
Iterator<?> it = iterator();
while (it.hasNext()) {
if (c.contains(it.next())) {
it.remove();
modified = true;
}
}
return modified;
}
public boolean retainAll(Collection<?> c) {
boolean modified = false;
Iterator<E> it = iterator();
while (it.hasNext()) {
if (!c.contains(it.next())) {
it.remove();
modified = true;
}
}
return modified;
}
public void clear() {
Iterator<E> it = iterator();
while (it.hasNext()) {
it.next();
it.remove();
}
}
public String toString() {
Iterator<E> it = iterator();
if (! it.hasNext())
return "[]";
StringBuilder sb = new StringBuilder();
sb.append('[');
for (;;) {
E e = it.next();
sb.append(e == this ? "(this Collection)" : e);
if (! it.hasNext())
return sb.append(']').toString();
sb.append(',').append(' ');
}
}
}
0 0
- JDK源码阅读之AbstractCollection
- JDK源码阅读之AbstractCollection抽象类
- JDK源码之AbstractCollection
- Java集合类源码阅读之AbstractCollection
- JDK 1.7源码阅读笔记(六)集合类之AbstractCollection
- JDK源码阅读之ArrayList
- JDK源码阅读之LinkedList
- JDK源码阅读之Arrays
- JDK源码阅读之String
- JDK源码阅读之AbstractList
- JDK源码阅读之AbstractMap
- JDK源码阅读之HashSet
- JDK源码阅读之 HashMap
- jdk源码阅读之AbstractList
- jdk源码阅读之ArrayList
- JDK源码阅读之二-----String
- Jdk源码阅读之Java.util.concurrent
- JDK源码阅读之Collection分析
- 怎么把ppt在线转换成PDF
- Linux服务器安全配置小结
- Android 控制ScrollView滚动到底部和顶部
- 棋牌游戏判断牌型算法---适合所有的棋牌游戏
- pdf文档转换成word教程分享
- JDK源码阅读之AbstractCollection
- java
- 冰川网络2015春招笔试题第一题
- 文件的操作-系统调用
- Linux下Nginx如何切割访问日志?
- ExtJS 4.*基础概念总结(基于Ext4.2.1)
- 第一天
- ubuntu下git的安装及使用
- 16进制转RGB (PHP代码函数)