Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018
2019-04-25 18:43:33 +08:00
parent 4c34792a69
commit 705445f54e
96 changed files with 837 additions and 837 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
notes/Java 容器.md
View File

@ -24,7 +24,7 @@
## Collection
<div align="center"> <img src="/pics/73403d84-d921-49f1-93a9-d8fe050f3497.png" width="800px"> </div><br>
<div align="center"> <img src="pics/73403d84-d921-49f1-93a9-d8fe050f3497.png" width="800px"> </div><br>
### 1. Set
@ -50,7 +50,7 @@
## Map
<div align="center"> <img src="/pics/774d756b-902a-41a3-a3fd-81ca3ef688dc.png" width="500px"> </div><br>
<div align="center"> <img src="pics/774d756b-902a-41a3-a3fd-81ca3ef688dc.png" width="500px"> </div><br>
- TreeMap：基于红黑树实现。
@ -65,7 +65,7 @@
## 迭代器模式
<div align="center"> <img src="/pics/93fb1d38-83f9-464a-a733-67b2e6bfddda.png" width="600px"> </div><br>
<div align="center"> <img src="pics/93fb1d38-83f9-464a-a733-67b2e6bfddda.png" width="600px"> </div><br>
Collection 继承了 Iterable 接口，其中的 iterator() 方法能够产生一个 Iterator 对象，通过这个对象就可以迭代遍历 Collection 中的元素。
@ -126,7 +126,7 @@ public class ArrayList<E> extends AbstractList<E>
private static final int DEFAULT_CAPACITY = 10;
```
<div align="center"> <img src="/pics/52a7744f-5bce-4ff3-a6f0-8449334d9f3d.png" width="400px"> </div><br>
<div align="center"> <img src="pics/52a7744f-5bce-4ff3-a6f0-8449334d9f3d.png" width="400px"> </div><br>
### 2. 扩容
@ -389,7 +389,7 @@ transient Node<E> first;
transient Node<E> last;
```
<div align="center"> <img src="/pics/c8563120-cb00-4dd6-9213-9d9b337a7f7c.png" width="500px"> </div><br>
<div align="center"> <img src="pics/c8563120-cb00-4dd6-9213-9d9b337a7f7c.png" width="500px"> </div><br>
### 2. 与 ArrayList 的比较
@ -411,7 +411,7 @@ transient Entry[] table;
Entry 存储着键值对。它包含了四个字段，从 next 字段我们可以看出 Entry 是一个链表。即数组中的每个位置被当成一个桶，一个桶存放一个链表。HashMap 使用拉链法来解决冲突，同一个链表中存放哈希值相同的 Entry。
<div align="center"> <img src="/pics/9420a703-1f9d-42ce-808e-bcb82b56483d.png" width="550px"> </div><br>
<div align="center"> <img src="pics/9420a703-1f9d-42ce-808e-bcb82b56483d.png" width="550px"> </div><br>
```java
static class Entry<K,V> implements Map.Entry<K,V> {
@ -487,7 +487,7 @@ map.put("K3", "V3");
- 计算键值对所在的桶；
- 在链表上顺序查找，时间复杂度显然和链表的长度成正比。
<div align="center"> <img src="/pics/e0870f80-b79e-4542-ae39-7420d4b0d8fe.png" width="550px"> </div><br>
<div align="center"> <img src="pics/e0870f80-b79e-4542-ae39-7420d4b0d8fe.png" width="550px"> </div><br>
### 3. put 操作
@ -823,7 +823,7 @@ final Segment<K,V>[] segments;
static final int DEFAULT_CONCURRENCY_LEVEL = 16;
```
<div align="center"> <img src="/pics/db808eff-31d7-4229-a4ad-b8ae71870a3a.png" width="550px"> </div><br>
<div align="center"> <img src="pics/db808eff-31d7-4229-a4ad-b8ae71870a3a.png" width="550px"> </div><br>
### 2. size 操作