public class CharArrayList extends AbstractCharList implements RandomAccess, Cloneable, Serializable
This class implements a lightweight, fast, open, optimized,
reuse-oriented version of array-based lists. Instances of this class
represent a list with an array that is enlarged as needed when new entries
are created (by doubling its current length), but is
never made smaller (even on a clear()). A family of
trimming methods lets you control the size of the
backing array; this is particularly useful if you reuse instances of this class.
Range checks are equivalent to those of java.util's classes, but
they are delayed as much as possible. The backing array is exposed by the
elements() method.
This class implements the bulk methods removeElements(),
addElements() and getElements() using
high-performance system calls (e.g., System.arraycopy() instead of
expensive loops.
ArrayList,
Serialized FormAbstractCharList.CharSubList| Modifier and Type | Field and Description |
|---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list.
|
| Constructor and Description |
|---|
CharArrayList()
Creates a new array list with
DEFAULT_INITIAL_CAPACITY capacity. |
CharArrayList(char[] a)
Creates a new array list and fills it with the elements of a given array.
|
CharArrayList(char[] a,
int offset,
int length)
Creates a new array list and fills it with the elements of a given array.
|
CharArrayList(CharCollection c)
Creates a new array list and fills it with a given type-specific collection.
|
CharArrayList(CharIterator i)
Creates a new array list and fills it with the elements returned by a type-specific iterator..
|
CharArrayList(CharList l)
Creates a new array list and fills it with a given type-specific list.
|
CharArrayList(Collection<? extends Character> c)
Creates a new array list and fills it with a given collection.
|
CharArrayList(int capacity)
Creates a new array list with given capacity.
|
CharArrayList(Iterator<? extends Character> i)
Creates a new array list and fills it with the elements returned by an iterator..
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(char k)
Ensures that this collection contains the specified element (optional operation).
|
void |
add(int index,
char k)
Inserts the specified element at the specified position in this list (optional operation).
|
boolean |
addAll(int index,
CharCollection c)
Inserts all of the elements in the specified type-specific collection into this type-specific list at the specified position (optional operation).
|
boolean |
addAll(int index,
CharList l)
Inserts all of the elements in the specified type-specific list into this type-specific list at the specified position (optional operation).
|
void |
addElements(int index,
char[] a,
int offset,
int length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear()
This implementation delegates to
AbstractCharList.removeElements(int, int). |
CharArrayList |
clone() |
int |
compareTo(CharArrayList l)
Compares this array list to another array list.
|
char[] |
elements()
Returns the backing array of this list.
|
void |
ensureCapacity(int capacity)
Ensures that this array list can contain the given number of entries without resizing.
|
boolean |
equals(CharArrayList l)
Compares this type-specific array list to another one.
|
char |
getChar(int index)
Returns the element at the specified position in this list.
|
void |
getElements(int from,
char[] a,
int offset,
int length)
Copies element of this type-specific list into the given array using optimized system calls.
|
int |
indexOf(char k)
Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
boolean |
isEmpty()
Checks whether the stack is empty.
|
int |
lastIndexOf(char k)
Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
CharListIterator |
listIterator(int index)
Returns a type-specific list iterator on the list starting at a given index.
|
boolean |
rem(char k)
Removes a single instance of the specified element from this collection, if it is present (optional operation).
|
boolean |
removeAll(CharCollection c)
Remove from this collection all elements in the given type-specific collection.
|
boolean |
removeAll(Collection<?> c) |
char |
removeChar(int index)
Removes the element at the specified position in this list (optional operation).
|
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
char |
set(int index,
char k)
Replaces the element at the specified position in this list with the specified element (optional operation).
|
void |
setElements(int index,
char[] a,
int offset,
int length)
Sets elements to this type-specific list using optimized system calls.
|
int |
size() |
void |
size(int size)
Sets the size of this list.
|
void |
sort(CharComparator comp)
Sort a list using a type-specific comparator.
|
char[] |
toArray(char[] a)
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array.
|
void |
trim()
Trims this array list so that the capacity is equal to the size.
|
void |
trim(int n)
Trims the backing array if it is too large.
|
void |
unstableSort(CharComparator comp)
Sorts this list using a sort not assured to be stable.
|
static CharArrayList |
wrap(char[] a)
Wraps a given array into an array list.
|
static CharArrayList |
wrap(char[] a,
int length)
Wraps a given array into an array list of given size.
|
addAll, addAll, addAll, addAll, addElements, compareTo, contains, equals, hashCode, iterator, listIterator, peekChar, popChar, push, subList, topChar, toStringadd, contains, containsAll, remove, retainAll, toCharArray, toCharArraycontainsAll, retainAll, toArray, toArrayadd, add, contains, get, indexOf, lastIndexOf, remove, remove, set, setElements, setElements, sort, unstableSortcontainsAll, replaceAll, retainAll, spliterator, toArray, toArraycontainsAll, removeIf, removeIf, retainAll, toCharArray, toCharArrayparallelStream, streamforEach, forEachpublic static final int DEFAULT_INITIAL_CAPACITY
public CharArrayList(int capacity)
capacity - the initial capacity of the array list (may be 0).public CharArrayList()
DEFAULT_INITIAL_CAPACITY capacity.public CharArrayList(Collection<? extends Character> c)
c - a collection that will be used to fill the array list.public CharArrayList(CharCollection c)
c - a type-specific collection that will be used to fill the array list.public CharArrayList(CharList l)
l - a type-specific list that will be used to fill the array list.public CharArrayList(char[] a)
a - an array whose elements will be used to fill the array list.public CharArrayList(char[] a,
int offset,
int length)
a - an array whose elements will be used to fill the array list.offset - the first element to use.length - the number of elements to use.public CharArrayList(Iterator<? extends Character> i)
i - an iterator whose returned elements will fill the array list.public CharArrayList(CharIterator i)
i - a type-specific iterator whose returned elements will fill the array list.public char[] elements()
public static CharArrayList wrap(char[] a, int length)
Note it is guaranteed
that the type of the array returned by elements() will be the same
(see the comments in the class documentation).
a - an array to wrap.length - the length of the resulting array list.public static CharArrayList wrap(char[] a)
Note it is guaranteed
that the type of the array returned by elements() will be the same
(see the comments in the class documentation).
a - an array to wrap.public void ensureCapacity(int capacity)
capacity - the new minimum capacity for this array list.public void add(int index,
char k)
AbstractCharListThis implementation always throws an UnsupportedOperationException.
add in interface CharListadd in class AbstractCharListList.add(int,Object)public boolean add(char k)
AbstractCharListThis implementation always throws an UnsupportedOperationException.
This implementation delegates to the type-specific version of List.add(int, Object).
add in interface CharCollectionadd in interface CharListadd in class AbstractCharListCollection.add(Object)public char getChar(int index)
CharListgetChar in interface CharListList.get(int)public int indexOf(char k)
CharListindexOf in interface CharListindexOf in class AbstractCharListList.indexOf(Object)public int lastIndexOf(char k)
CharListlastIndexOf in interface CharListlastIndexOf in class AbstractCharListList.lastIndexOf(Object)public char removeChar(int index)
AbstractCharListThis implementation always throws an UnsupportedOperationException.
removeChar in interface CharListremoveChar in class AbstractCharListList.remove(int)public boolean rem(char k)
AbstractCharListThis implementation delegates to indexOf().
rem in interface CharCollectionrem in class AbstractCharListList.remove(Object)public char set(int index,
char k)
AbstractCharListThis implementation always throws an UnsupportedOperationException.
set in interface CharListset in class AbstractCharListList.set(int,Object)public void clear()
AbstractCharListThis implementation delegates to AbstractCharList.removeElements(int, int).
clear in interface Collection<Character>clear in interface List<Character>clear in class AbstractCharListpublic int size()
size in interface Collection<Character>size in interface List<Character>size in class AbstractCollection<Character>public void size(int size)
CharListIf the specified size is smaller than the current size, the last elements are
discarded. Otherwise, they are filled with 0/null/false.
size in interface CharListsize in class AbstractCharListsize - the new size.public boolean isEmpty()
Stackpublic void trim()
ArrayList.trimToSize()public void trim(int n)
n, this method does nothing. Otherwise, it trims the
array length to the maximum between n and size().
This method is useful when reusing lists. Clearing a list leaves the array length untouched. If you are reusing a list many times, you can call this method with a typical size to avoid keeping around a very large array just because of a few large transient lists.
n - the threshold for the trimming.public void getElements(int from,
char[] a,
int offset,
int length)
getElements in interface CharListgetElements in class AbstractCharListfrom - the start index (inclusive).a - the destination array.offset - the offset into the destination array where to store the first element copied.length - the number of elements to be copied.public void removeElements(int from,
int to)
removeElements in interface CharListremoveElements in class AbstractCharListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
char[] a,
int offset,
int length)
addElements in interface CharListaddElements in class AbstractCharListindex - the index at which to add elements.a - the array containing the elements.offset - the offset of the first element to add.length - the number of elements to add.public void setElements(int index,
char[] a,
int offset,
int length)
setElements in interface CharListindex - the index at which to start setting elements.a - the array containing the elements.offset - the offset of the first element to add.length - the number of elements to add.public char[] toArray(char[] a)
CharCollectionNote that, contrarily to Collection.toArray(Object[]), this
methods just writes all elements of this collection: no special
value will be added after the last one.
toArray in interface CharCollectiontoArray in class AbstractCharCollectiona - if this array is big enough, it will be used to store this collection.Collection.toArray(Object[])public boolean addAll(int index,
CharCollection c)
CharListaddAll in interface CharListaddAll in class AbstractCharListList.addAll(int,java.util.Collection)public boolean addAll(int index,
CharList l)
AbstractCharListThis implementation delegates to the type-specific version of List.addAll(int, Collection).
addAll in interface CharListaddAll in class AbstractCharListList.add(int,Object)public boolean removeAll(CharCollection c)
CharCollectionremoveAll in interface CharCollectionremoveAll in class AbstractCharCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.removeAll(Collection)public boolean removeAll(Collection<?> c)
removeAll in interface Collection<Character>removeAll in interface List<Character>removeAll in class AbstractCollection<Character>public CharListIterator listIterator(int index)
AbstractCharListThis implementation is based on the random-access methods.
listIterator in interface CharListlistIterator in interface List<Character>listIterator in class AbstractCharListList.listIterator(int)public void sort(CharComparator comp)
CharListPass null to sort using natural ordering.
sort in interface CharListList.sort(java.util.Comparator)public void unstableSort(CharComparator comp)
CharListPass null to sort using natural ordering.
This differs from List.sort(java.util.Comparator) in that the results are
not assured to be stable, but may be a bit faster.
Unless a subclass specifies otherwise, the results of the method if the list is concurrently modified during the sort are unspecified.
unstableSort in interface CharListpublic CharArrayList clone()
public boolean equals(CharArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a type-specific array list.public int compareTo(CharArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - an array list.