stan/jdk-24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

8311517: Add performance information to ArrayList javadoc

Browse Source 
Reviewed-by: smarks, bpb
This commit is contained in:
danthe1st 2023-08-04 20:21:25 +00:00 committed by Stuart Marks
parent b2add96c35
commit b463c6d3b0
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
src/java.base/share/classes/java/util/ArrayList.java
View File

@ -40,11 +40,12 @@ import jdk.internal.util.ArraysSupport;
* {@code Vector}, except that it is unsynchronized.)
*
* <p>The {@code size}, {@code isEmpty}, {@code get}, {@code set},
* {@code iterator}, and {@code listIterator} operations run in constant
* time. The {@code add} operation runs in <i>amortized constant time</i>,
* that is, adding n elements requires O(n) time. All of the other operations
* run in linear time (roughly speaking). The constant factor is low compared
* to that for the {@code LinkedList} implementation.
* {@code getFirst}, {@code getLast}, {@code removeLast}, {@code iterator},
* {@code listIterator}, and {@code reversed} operations run in constant time.
* The {@code add}, and {@code addLast} operations runs in <i>amortized
* constant time</i>, that is, adding n elements requires O(n) time. All of
* the other operations run in linear time (roughly speaking). The constant
* factor is low compared to that for the {@code LinkedList} implementation.
*
* <p>Each {@code ArrayList} instance has a <i>capacity</i>. The capacity is
* the size of the array used to store the elements in the list. It is always