mirror of
https://github.com/Snailclimb/JavaGuide
synced 2025-08-01 16:28:03 +08:00
Update HashMap.md
This commit is contained in:
parent
d85f369cf4
commit
10fbec0713
@ -173,23 +173,23 @@ static final class TreeNode<K,V> extends LinkedHashMap.Entry<K,V> {
|
|||||||

|

|
||||||
```java
|
```java
|
||||||
// 默认构造函数。
|
// 默认构造函数。
|
||||||
public More ...HashMap() {
|
public HashMap() {
|
||||||
this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
|
this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
|
||||||
}
|
}
|
||||||
|
|
||||||
// 包含另一个“Map”的构造函数
|
// 包含另一个“Map”的构造函数
|
||||||
public More ...HashMap(Map<? extends K, ? extends V> m) {
|
public HashMap(Map<? extends K, ? extends V> m) {
|
||||||
this.loadFactor = DEFAULT_LOAD_FACTOR;
|
this.loadFactor = DEFAULT_LOAD_FACTOR;
|
||||||
putMapEntries(m, false);//下面会分析到这个方法
|
putMapEntries(m, false);//下面会分析到这个方法
|
||||||
}
|
}
|
||||||
|
|
||||||
// 指定“容量大小”的构造函数
|
// 指定“容量大小”的构造函数
|
||||||
public More ...HashMap(int initialCapacity) {
|
public HashMap(int initialCapacity) {
|
||||||
this(initialCapacity, DEFAULT_LOAD_FACTOR);
|
this(initialCapacity, DEFAULT_LOAD_FACTOR);
|
||||||
}
|
}
|
||||||
|
|
||||||
// 指定“容量大小”和“加载因子”的构造函数
|
// 指定“容量大小”和“加载因子”的构造函数
|
||||||
public More ...HashMap(int initialCapacity, float loadFactor) {
|
public HashMap(int initialCapacity, float loadFactor) {
|
||||||
if (initialCapacity < 0)
|
if (initialCapacity < 0)
|
||||||
throw new IllegalArgumentException("Illegal initial capacity: " + initialCapacity);
|
throw new IllegalArgumentException("Illegal initial capacity: " + initialCapacity);
|
||||||
if (initialCapacity > MAXIMUM_CAPACITY)
|
if (initialCapacity > MAXIMUM_CAPACITY)
|
||||||
|
Loading…
x
Reference in New Issue
Block a user