概述
集合框架是用来表示和操控集合的统一架构,包含以下内容:
- 接口:集合的抽象数据类型
- 实现类:集合接口的具体实现,即可重复使用的数据结构
- 算法:实现集合接口的对象可执行的有效计算,例如搜索和排序
Java集合框架主要包括两种接口类型:
- 集合(Collection):存储一个元素集合
- 图(Map):存储键/值对映射
类图
Collection
常用方法
遍历
两个重要接口:Iterable和Iterator
Iterable
其中iterator()是抽象方法
Iterator
其中hasnext()和next()是抽象方法
Collection接口继承了Iterable接口,因此所有实现Collection接口的集合类都有iterator()方法,用于返回一个实现了Iterator接口的对象,即迭代器
三种方式
- 迭代器
Collection c = new ArrayList();
Iterator iter = c.iterator();
while(iter.hasNext()) {
Object obj = iter.next();
}
注意:使用迭代器遍历时的删除操作
(1)可以使用Iterator对象中的void remove()
方法进行删除,但是注意两种情况会抛出IllegalStateException
//还未调用next()
Collection c = new ArrayList();
Iterator iter = c.iterator();
while(iter.hasNext()) {
iter.remove(); //IllegalStateException
}
//调用next()后已经调用remove()
Collection c = new ArrayList();
Iterator iter = c.iterator();
while(iter.hasNext()) {
Object obj = iter.next();
iter.remove();
iter.remove(); //IllegalStateException
}
(2)不能使用集合对象的boolean remove(Object o)
方法进行删除,可能抛出ConcurrentModificationException
Collection c = new ArrayList();
Iterator iter = c.iterator();
while(iter.hasNext()) {
Object obj = iter.next();
c.remove(obj); //ConcurrentModificationException
}
- 增强for循环
(1)适用于数组对象或实现了Iterable接口的对象
(2)对于数组,实际是使用下标进行遍历;对于集合,实际还是调用迭代器
Collection c = new ArrayList();
for(Object obj : c) {
//...
}
- forEach方法和Lambda表达式
Collection c = new ArrayList();
c.forEach(obj -> System.out.println(obj));
List
Collection的子接口,存储一组可重复,有序(可通过索引访问)的对象
索引
相较于Collection,List新增了根据索引操作的一系列方法:
- void add(int index, E element)
- boolean addAll(int index, Collection<? extends E> c)
- E remove(int index)
- E get(int index)
- E set(int index)
- int indexOf(Object o)
- int lastIndexOf(Object o)
- List<E> subList(int fromIndex, int toIndex)
迭代器
此外,还增加了用于创建ListIterator的方法:
ListIterator<E> listIterator()
ListIterator<E> listIterator(int index)
ListIterator是Iterator的子接口,支持双向遍历
List l = new ArrayList();
ListIterator iter = l.listIterator();
//forward
while(iter.hasNext()) {
System.out.println(iter.next());
}
//backward
while(iter.hasPrevious()) {
System.out.println(iter.previous());
}
Vector & ArrayList
- 底层实现都是数组
- 优点:根据下标访问速度很快
缺点:需要开辟连续的存储空间,并且有扩容,移动元素等操作 - Vector:线程安全的 (基本方法被synchronized修饰),默认扩容机制是2倍,支持旧的迭代器Enumeration
ArrayList:线程不安全的,扩容机制是1.5倍 - 保证线程安全的加锁和释放锁操作需要一定的系统开销,所以在单线程环境下,ArrayList效率更高
Vector源码分析 (jdk11)
构造器
//initialCapacity:初始容量
//capacityIncrement:扩容时的增量
public Vector(int initialCapacity, int capacityIncrement) {
super();
//判断initialCapacity是否合法
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal Capacity: " + initialCapacity);
//创建数组
this.elementData = new Object[initialCapacity];
this.capacityIncrement = capacityIncrement;
}
public Vector(int initialCapacity) {
//默认capacityIncrement为0
this(initialCapacity, 0);
}
public Vector() {
//默认initialCapacity为10,capacityIncrement为0
this(10);
}
public Vector(Collection<? extends E> c) {
Object[] a = c.toArray();
elementCount = a.length;
//toArray()不一定返回Object[]类型,需要判断
if (c.getClass() == ArrayList.class) {
elementData = a;
} else {
elementData = Arrays.copyOf(a, elementCount, Object[].class);
}
}
扩容
//数组能被分配的最大空间
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
private Object[] grow(int minCapacity) {
//elementData:原数组
//newCapacity(minCapacity):新数组长度
//若新数组长度大于原数组长度,则用null填充
return elementData = Arrays.copyOf(elementData, newCapacity(minCapacity));
}
private Object[] grow() {
return grow(elementCount + 1);
}
private int newCapacity(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
//扩容机制
int newCapacity = oldCapacity + ((capacityIncrement > 0) ?
capacityIncrement : oldCapacity);
//newCapacity <= minCapacity (一次扩容没有满足要求)
if (newCapacity - minCapacity <= 0) {
if (minCapacity < 0) // overflow
throw new OutOfMemoryError();
return minCapacity;
}
//newCapacity > minCapacity (判断新容量是否超过最大限制)
return (newCapacity - MAX_ARRAY_SIZE <= 0)
? newCapacity
: hugeCapacity(minCapacity);
}
private static int hugeCapacity(int minCapacity) {
if (minCapacity < 0) // overflow
throw new OutOfMemoryError();
//此时minCapacity也较大
return (minCapacity > MAX_ARRAY_SIZE) ?
Integer.MAX_VALUE :
MAX_ARRAY_SIZE;
}
添加元素
//第一种:添加到数组末尾
public synchronized boolean add(E e) {
modCount++;
add(e, elementData, elementCount);
return true;
}
public synchronized void addElement(E obj) {
modCount++;
add(obj, elementData, elementCount);
}
private void add(E e, Object[] elementData, int s) {
if (s == elementData.length)
elementData = grow();
elementData[s] = e;
elementCount = s + 1;
}
//第二种:添加到指定index
public void add(int index, E element) {
insertElementAt(element, index);
}
public synchronized void insertElementAt(E obj, int index) {
if (index > elementCount) {
throw new ArrayIndexOutOfBoundsException(index
+ " > " + elementCount);
}
modCount++;
final int s = elementCount;
Object[] elementData = this.elementData;
if (s == elementData.length)
elementData = grow();
//移动元素
System.arraycopy(elementData, index,
elementData, index + 1,
s - index);
elementData[index] = obj;
elementCount = s + 1;
}
删除元素
//第一种:根据元素删除
public boolean remove(Object o) {
return removeElement(o);
}
public synchronized boolean removeElement(Object obj) {
modCount++;
int i = indexOf(obj);
if (i >= 0) {
removeElementAt(i);
return true;
}
return false;
}
public int indexOf(Object o) {
return indexOf(o, 0);
}
public synchronized int indexOf(Object o, int index) {
if (o == null) {
for (int i = index ; i < elementCount ; i++)
if (elementData[i]==null)
return i;
} else {
for (int i = index ; i < elementCount ; i++)
if (o.equals(elementData[i]))
return i;
}
return -1;
}
public synchronized void removeElementAt(int index) {
if (index >= elementCount) {
throw new ArrayIndexOutOfBoundsException(index + " >= " +
elementCount);
}
else if (index < 0) {
throw new ArrayIndexOutOfBoundsException(index);
}
//移动元素
int j = elementCount - index - 1;
if (j > 0) {
System.arraycopy(elementData, index + 1, elementData, index, j);
}
modCount++;
elementCount--;
elementData[elementCount] = null; /* to let gc do its work */
}
//第二种:根据index删除
public synchronized E remove(int index) {
modCount++;
if (index >= elementCount)
throw new ArrayIndexOutOfBoundsException(index);
E oldValue = elementData(index);
//移动元素
int numMoved = elementCount - index - 1;
if (numMoved > 0)
System.arraycopy(elementData, index+1, elementData, index,
numMoved);
elementData[--elementCount] = null; // Let gc do its work
return oldValue;
}
ArrayList源码分析 (jdk11)
构造器
//默认初始容量
private static final int DEFAULT_CAPACITY = 10;
//两者都是空数组,区别在于前者用于有参构造,后者用于无参构造;避免重复创建空数组
private static final Object[] EMPTY_ELEMENTDATA = {};
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
public ArrayList(int initialCapacity) {
if (initialCapacity > 0) {
this.elementData = new Object[initialCapacity];
} else if (initialCapacity == 0) {
this.elementData = EMPTY_ELEMENTDATA;
} else {
throw new IllegalArgumentException("Illegal Capacity: "+
initialCapacity);
}
}
//和Vector不同,不会直接创建初始容量为10的数组
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
public ArrayList(Collection<? extends E> c) {
Object[] a = c.toArray();
if ((size = a.length) != 0) {
//toArray()不一定返回Object[]类型,需要判断
if (c.getClass() == ArrayList.class) {
elementData = a;
} else {
elementData = Arrays.copyOf(a, size, Object[].class);
}
} else {
// replace with empty array.
elementData = EMPTY_ELEMENTDATA;
}
}
扩容
//grow和hugeCapacity方法和Vector的一样,newCapacity方法略有差别
private int newCapacity(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
//扩容1.5倍
int newCapacity = oldCapacity + (oldCapacity >> 1);
if (newCapacity - minCapacity <= 0) {
//DEE数组初次扩容时,容量至少为10
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA)
return Math.max(DEFAULT_CAPACITY, minCapacity);
if (minCapacity < 0) // overflow
throw new OutOfMemoryError();
return minCapacity;
}
return (newCapacity - MAX_ARRAY_SIZE <= 0)
? newCapacity
: hugeCapacity(minCapacity);
}
添加元素
//基本操作和Vector一致,优化了代码结构并弃用了部分方法
//第一种:添加到数组末尾
public boolean add(E e) {
modCount++;
add(e, elementData, size);
return true;
}
private void add(E e, Object[] elementData, int s) {
if (s == elementData.length)
elementData = grow();
elementData[s] = e;
size = s + 1;
}
//第二种:添加到指定index
public void add(int index, E element) {
rangeCheckForAdd(index);
modCount++;
final int s;
Object[] elementData;
if ((s = size) == (elementData = this.elementData).length)
elementData = grow();
System.arraycopy(elementData, index,
elementData, index + 1,
s - index);
elementData[index] = element;
size = s + 1;
}
private void rangeCheckForAdd(int index) {
if (index > size || index < 0)
throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
}
删除元素
//基本操作和Vector一致,优化了代码结构并弃用了部分方法
private void fastRemove(Object[] es, int i) {
modCount++;
final int newSize;
//移动元素
if ((newSize = size - 1) > i)
System.arraycopy(es, i + 1, es, i, newSize - i);
es[size = newSize] = null;
}
//第一种:根据元素删除
public boolean remove(Object o) {
final Object[] es = elementData;
final int size = this.size;
int i = 0;
//定位该元素
found: {
if (o == null) {
for (; i < size; i++)
if (es[i] == null)
break found;
} else {
for (; i < size; i++)
if (o.equals(es[i]))
break found;
}
return false;
}
//删除该元素
fastRemove(es, i);
return true;
}
//第二种:根据index删除
public E remove(int index) {
//检查index是否在[0,size)范围内
Objects.checkIndex(index, size);
final Object[] es = elementData;
@SuppressWarnings("unchecked") E oldValue = (E) es[index];
fastRemove(es, index);
return oldValue;
}
Stack
Vector的子类,新增了一些方法来表现“先进后出/后进先出”的特点:
- boolean empty():判断栈是否为空
- E peek():返回栈顶元素
- E pop():弹出栈顶元素并返回
- E push():将元素压入栈顶并返回
注意:数组(elementData)末尾为栈顶
LinkedList
- 实现了List接口和Deque接口;底层实现是双向链表,可作为多种数据结构使用
- 优点:增加或删除元素时,只用改变前后节点的引用关系
缺点:查询元素只能从头或尾(链表)开始 - LinkedList是线程不安全的
源码分析 (jdk11)
节点
private修饰的静态内部类
private static class Node<E> {
E item;
Node<E> next;
Node<E> prev;
Node(Node<E> prev, E element, Node<E> next) {
this.item = element;
this.next = next;
this.prev = prev;
}
}
构造器
public LinkedList() {
}
public LinkedList(Collection<? extends E> c) {
this();
addAll(c);
}
链表的增删操作
private void linkFirst(E e) {
final Node<E> f = first;
//创建newNode
final Node<E> newNode = new Node<>(null, e, f);
first = newNode;
//判断newNode是否为最后一个节点
if (f == null)
last = newNode;
else
f.prev = newNode;
size++;
modCount++;
}
void linkLast(E e) {
final Node<E> l = last;
//创建newNode
final Node<E> newNode = new Node<>(l, e, null);
last = newNode;
//判断newNode是否为第一个节点
if (l == null)
first = newNode;
else
l.next = newNode;
size++;
modCount++;
}
void linkBefore(E e, Node<E> succ) {
// assert succ != null;
final Node<E> pred = succ.prev;
final Node<E> newNode = new Node<>(pred, e, succ);
succ.prev = newNode;
//判断newNode是否为第一个节点
if (pred == null)
first = newNode;
else
pred.next = newNode;
size++;
modCount++;
}
private E unlinkFirst(Node<E> f) {
// assert f == first && f != null;
final E element = f.item;
final Node<E> next = f.next;
f.item = null;
f.next = null; // help GC
first = next;
//判断f后面是否有节点
if (next == null)
last = null;
else
next.prev = null;
size--;
modCount++;
return element;
}
private E unlinkLast(Node<E> l) {
// assert l == last && l != null;
final E element = l.item;
final Node<E> prev = l.prev;
l.item = null;
l.prev = null; // help GC
last = prev;
//判断l前面是否有节点
if (prev == null)
first = null;
else
prev.next = null;
size--;
modCount++;
return element;
}
E unlink(Node<E> x) {
// assert x != null;
final E element = x.item;
final Node<E> next = x.next;
final Node<E> prev = x.prev;
//判断x前面是否有节点
if (prev == null) {
first = next;
} else {
prev.next = next;
x.prev = null;
}
//判断x后面是否有节点
if (next == null) {
last = prev;
} else {
next.prev = prev;
x.next = null;
}
x.item = null;
size--;
modCount++;
return element;
}
public boolean addAll(int index, Collection<? extends E> c) {
//判断index是否在[0, size]的范围内
checkPositionIndex(index);
Object[] a = c.toArray();
int numNew = a.length;
if (numNew == 0)
return false;
Node<E> pred, succ;
if (index == size) {
succ = null;
pred = last;
} else {
succ = node(index);
pred = succ.prev;
}
for (Object o : a) {
@SuppressWarnings("unchecked") E e = (E) o;
Node<E> newNode = new Node<>(pred, e, null);
if (pred == null)
first = newNode;
else
pred.next = newNode;
pred = newNode;
}
if (succ == null) {
last = pred;
} else {
pred.next = succ;
succ.prev = pred;
}
size += numNew;
modCount++;
return true;
}
Map
存储具有<key, value>映射关系的元素;key不能重复
Entry<K, V>
Entry接口是Map接口的内部接口,所有Map接口的实现类的键值对类型都实现了这个接口
HashMap:用一个静态内部类(jdk1.7是Entry,jdk1.8是Node)来实现Entry接口
TreeMap:用一个final修饰的静态内部类(Entry)来实现Entry接口
常用方法
//1. 增加、删除、修改
V put(K key, V value)
void putAll(Map<? extends K, ? extends V> m)
V remove(Object key)
void clear()
//2. 查询
V get(Object key)
boolean containsKey(Object key)
boolean containsValue(Object value)
int size()
boolean isEmpty()
boolean equals(Object o)
int hashCode()
//3. 元视图
Collection<V> values()
Set<K> keySet()
Set<Map.Entry<K, V>> entrySet()
HashMap
- 底层实现:
jdk1.7:数组 + 链表
jdk1.8:数组 + 链表/红黑树
- HashMap是无序的,即元素迭代时的顺序并不是插入时的顺序
- HashMap & Hashtable
HashMap:线程不安全的;key和value都可以是null
Hashtable:线程安全的;key和value都不能是null(过时,多线程环境下一般用ConcurrentHashMap)
注意:HashMap判断元素是否相等的方式
先比较hashCode(),再看equals()的返回值
因此,HashMap存储的对象的所属类一定要重写equals和hashCode方法,且两者保持一致性
源码分析 (jdk11)
概念
size:map中键值对的数量
capacity:table数组的长度,总是2的整数次幂
//默认初始容量
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // aka 16
//最大容量
static final int MAXIMUM_CAPACITY = 1 << 30;
loadFactor:装载因子,表示HashMap满的程度
//默认装载因子
static final float DEFAULT_LOAD_FACTOR = 0.75f;
threshold:
当table未初始化时,threshold表示初始容量,默认值0表示使用DEFAULT_INITIAL_CAPACITY
当size>threshold时,执行resize操作,threshold = capacity * loadFactor
构造器
public HashMap(int initialCapacity, float loadFactor) {
//判断参数的合法性
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal initial capacity: " +
initialCapacity);
if (initialCapacity > MAXIMUM_CAPACITY)
initialCapacity = MAXIMUM_CAPACITY;
if (loadFactor <= 0 || Float.isNaN(loadFactor))
throw new IllegalArgumentException("Illegal load factor: " +
loadFactor);
this.loadFactor = loadFactor;
this.threshold = tableSizeFor(initialCapacity);
}
//返回大于等于cap的最小2的整数次幂
static final int tableSizeFor(int cap) {
int n = -1 >>> Integer.numberOfLeadingZeros(cap - 1);
return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
}
public HashMap(int initialCapacity) {
this(initialCapacity, DEFAULT_LOAD_FACTOR);
}
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
//threshold为默认值0
}
//涉及resize和putVal操作
public HashMap(Map<? extends K, ? extends V> m) {
this.loadFactor = DEFAULT_LOAD_FACTOR;
putMapEntries(m, false);
}
添加元素
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}
//若onlyIfAbsent为true,不改变已经存在的值
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
//若数组为空,则初始化数组
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
//i = (n - 1) & hash 计算数组中插入的位置
//当n为2的整数次幂时,(n - 1) & hash 相当于 hash % n,位运算比取模运算效率更高
//该位置为空,直接创建新节点
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
//该位置不为空,哈希冲突
else {
Node<K,V> e; K k;
//数组该位置的元素和插入元素的key相同
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
e = p;
//红黑树
else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
//链表
else {
//遍历链表
for (int binCount = 0; ; ++binCount) {
//不存在key相同的元素,在链表尾部创建新节点
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
//链表中节点数达到阈值8时,转换为红黑树
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);
break;
}
//该元素和插入元素的key相同
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
//HashMap中存在key相同的元素,新的value替换旧的value
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
//判断是否需要扩容
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}
扩容
final Node<K,V>[] resize() {
Node<K,V>[] oldTab = table;
int oldCap = (oldTab == null) ? 0 : oldTab.length;
int oldThr = threshold;
int newCap, newThr = 0;
//扩容
if (oldCap > 0) {
//数组已经最大,不允许继续扩容
if (oldCap >= MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return oldTab;
}
//容量和阈值都变成之前的2倍
else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
oldCap >= DEFAULT_INITIAL_CAPACITY)
newThr = oldThr << 1; // double threshold
}
//初始化
//1. threshold != 0,即通过HashMap(int initialCapacity, float loadFactor)或HashMap(int initialCapacity)创建
else if (oldThr > 0) // initial capacity was placed in threshold
newCap = oldThr; //1.1
//2. threshold == 0,即通过HashMap()创建
else { // zero initial threshold signifies using defaults
newCap = DEFAULT_INITIAL_CAPACITY; //2.1
newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY); //2.2
}
if (newThr == 0) {
float ft = (float)newCap * loadFactor;
newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ? //1.2
(int)ft : Integer.MAX_VALUE);
}
threshold = newThr;
@SuppressWarnings({"rawtypes","unchecked"})
Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
table = newTab;
//把旧数组的数据复制到新数组中
if (oldTab != null) {
for (int j = 0; j < oldCap; ++j) {
Node<K,V> e;
if ((e = oldTab[j]) != null) {
oldTab[j] = null;
//该位置没有链表
if (e.next == null)
newTab[e.hash & (newCap - 1)] = e;
//红黑树
else if (e instanceof TreeNode)
((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
//链表
else { // preserve order
Node<K,V> loHead = null, loTail = null;
Node<K,V> hiHead = null, hiTail = null;
Node<K,V> next;
do {
next = e.next;
//根据e.hash & oldCap是否为0,将原链表分为两部分
if ((e.hash & oldCap) == 0) {
if (loTail == null)
loHead = e;
else
loTail.next = e;
loTail = e;
}
else {
if (hiTail == null)
hiHead = e;
else
hiTail.next = e;
hiTail = e;
}
} while ((e = next) != null);
//新索引 = 旧索引
//当e.hash & oldCap == 0时,(newCap - 1) & e.hash == (oldCap - 1) & e.hash
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
//新索引 = 旧索引 + 旧数组的长度
//当e.hash & oldCap != 0时,(newCap - 1) & e.hash == (oldCap - 1) & e.hash + oldCap
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;
}
}
}
}
}
return newTab;
}
LinkedHashMap
HashMap的子类,在HashMap的基础上,使用双向链表来记录数据存储的先后顺序(有序的)
-
Entry<K, V>:新增before,after用于维护双向链表
注意:next维护的是数组每个位置上元素的连接顺序,before和after维护的是元素的插入顺序 -
头节点(head):最先插入的元素
尾节点(tail):最后插入的元素
-
迭代顺序
true:按照访问顺序迭代(LRU算法)
false:按照插入顺序迭代
注意:创建LinkedHashMap时,不指定accessOrder则默认为false -
LinkedHashMap对元素的操作基本和HashMap一样,只是重写了
afterNodeAccess:将新访问的节点放到双向链表的尾部
afterNodeInsertion:当map作为缓存器的时候,可能移除首节点
afterNodeRemoval:删除节点后,维护双向链表中前后节点的引用关系
等方法
TreeMap
底层实现:红黑树
Comparator
TreeMap可以根据key的自然顺序或自定义的comparator对元素进行排序
注意:TreeMap只能存储同一个类的对象
自然排序下:对应类必须实现Comparable接口,按照compareTo方法排序
自定义排序下:使用public TreeMap(Comparator<? super K> comparator)
,按照comparator中定义的compare方法排序
Properties
Hashtable的子类,用于处理配置文件
key和value都是String类型
常用方法:
- String getProperty(String key)
- Object setProperty(String key, String value)
Properties pros = new Properties();
pros.load(new FileInputStream("jdbc.properties"));
String user = pros.getProperty("user");
String password = pros.getProperty("password");
Set
Collection的子接口,存储一组不可重复的对象
HashSet
底层实现是HashMap
key是存储的元素,value是Object类型的常量对象PRESENT
private transient HashMap<E,Object> map;
private static final Object PRESENT = new Object();
public HashSet() { map = new HashMap<>(); }
public HashSet(Collection<? extends E> c) {
map = new HashMap<>(Math.max((int) (c.size()/.75f) + 1, 16));
addAll(c);
}
public HashSet(int initialCapacity, float loadFactor) {
map = new HashMap<>(initialCapacity, loadFactor);
}
public HashSet(int initialCapacity) {
map = new HashMap<>(initialCapacity);
}
//提供给LinkedHashSet使用的
HashSet(int initialCapacity, float loadFactor, boolean dummy) {
map = new LinkedHashMap<>(initialCapacity, loadFactor);
}
所有操作基本都是通过HashMap的方法来完成
LinkedHashSet
HashSet的子类
通过调用HashSet的构造器创建LinkedHashMap
TreeSet
底层实现是TreeMap
key是存储的元素,value是Object类型的常量对象PRESENT
private transient NavigableMap<E,Object> m;
private static final Object PRESENT = new Object();
所有操作基本都是通过TreeMap的方法来完成
Collections
操作Collection和Map的工具类
排序
//以下方法都是静态方法
void reverse(List) //反转List中元素的顺序
void shuffle(List) //对List中元素进行随机排序
void sort(List) //根据自然顺序对List中元素按升序排序
void sort(List, Comparator) //根据指定的Comparator对List中的元素排序
void swap(List, int, int) //将List中的i处元素和j处元素进行交换
查找和替换
//以下方法都是静态方法
T max(Collection)
T max(Collection, Comparator)
T min(Collection)
T min(Collection, Comparator)
int frequency(Collection, Object)
void copy(List dest, List src)
boolean replaceAll(List list, T oldVal, T newVal)
同步控制
Collections类提供了多个synchronizedXxx()方法,该方法可以将指定集合包装成线程同步的集合,从而解决线程安全问题