mirror of
https://github.com/Snailclimb/JavaGuide
synced 2025-06-20 22:17:09 +08:00
commit
f0d2b98524
@ -1,4 +1,3 @@
|
|||||||
|
|
||||||
<!-- MarkdownTOC -->
|
<!-- MarkdownTOC -->
|
||||||
|
|
||||||
- [ArrayList简介](#arraylist简介)
|
- [ArrayList简介](#arraylist简介)
|
||||||
@ -177,7 +176,7 @@ public class ArrayList<E> extends AbstractList<E>
|
|||||||
newCapacity = minCapacity;
|
newCapacity = minCapacity;
|
||||||
//再检查新容量是否超出了ArrayList所定义的最大容量,
|
//再检查新容量是否超出了ArrayList所定义的最大容量,
|
||||||
//若超出了,则调用hugeCapacity()来比较minCapacity和 MAX_ARRAY_SIZE,
|
//若超出了,则调用hugeCapacity()来比较minCapacity和 MAX_ARRAY_SIZE,
|
||||||
//如果minCapacity大于最大容量,则新容量则为ArrayList定义的最大容量,否则,新容量大小则为 minCapacity。
|
//如果minCapacity大于MAX_ARRAY_SIZE,则新容量则为Interger.MAX_VALUE,否则,新容量大小则为 MAX_ARRAY_SIZE。
|
||||||
if (newCapacity - MAX_ARRAY_SIZE > 0)
|
if (newCapacity - MAX_ARRAY_SIZE > 0)
|
||||||
newCapacity = hugeCapacity(minCapacity);
|
newCapacity = hugeCapacity(minCapacity);
|
||||||
// minCapacity is usually close to size, so this is a win:
|
// minCapacity is usually close to size, so this is a win:
|
||||||
@ -631,7 +630,7 @@ public class ArrayList<E> extends AbstractList<E>
|
|||||||
newCapacity = minCapacity;
|
newCapacity = minCapacity;
|
||||||
//再检查新容量是否超出了ArrayList所定义的最大容量,
|
//再检查新容量是否超出了ArrayList所定义的最大容量,
|
||||||
//若超出了,则调用hugeCapacity()来比较minCapacity和 MAX_ARRAY_SIZE,
|
//若超出了,则调用hugeCapacity()来比较minCapacity和 MAX_ARRAY_SIZE,
|
||||||
//如果minCapacity大于最大容量,则新容量则为ArrayList定义的最大容量,否则,新容量大小则为 minCapacity。
|
//如果minCapacity大于MAX_ARRAY_SIZE,则新容量则为Interger.MAX_VALUE,否则,新容量大小则为 MAX_ARRAY_SIZE。
|
||||||
if (newCapacity - MAX_ARRAY_SIZE > 0)
|
if (newCapacity - MAX_ARRAY_SIZE > 0)
|
||||||
newCapacity = hugeCapacity(minCapacity);
|
newCapacity = hugeCapacity(minCapacity);
|
||||||
// minCapacity is usually close to size, so this is a win:
|
// minCapacity is usually close to size, so this is a win:
|
||||||
|
Loading…
x
Reference in New Issue
Block a user