Class IntGapList
java.lang.Object
org.magicwerk.brownies.collections.primitive.IIntList
org.magicwerk.brownies.collections.primitive.IntGapList
- Record Components:
type- of elements stored in the list
- All Implemented Interfaces:
Serializable, Cloneable
- Direct Known Subclasses:
IntGapList.ReadOnlyList
Class {link IntGapList} combines the strengths of both
ArrayList and LinkedList.
It is implemented to offer both efficient random access to elements
by index (as ArrayList does) and at the same time efficient adding
and removing elements to and from beginning and end (as LinkedList does).
It also exploits the locality of reference often seen in applications
to further improve performance, e.g. for iterating over the list.
The class can be used as drop-in replacement for ArrayList.
It is also source compatible to LinkedList/Deque as it implements all needed methods.
It cannot implement Deque however, use
to get a view implementing it.
invalid reference
#asDeque
Note that this implementation is not synchronized.
Note that the iterators provided are not fail-fast.
- Author:
- Thomas Mauch
- See Also:
-
Nested Class Summary
Nested ClassesNested classes/interfaces inherited from class IIntList
IIntList.IIntListableFromArray, IIntList.IIntListableFromCollection, IIntList.IIntListableFromList, IIntList.IIntListableFromMult -
Field Summary
Fields -
Constructor Summary
ConstructorsModifierConstructorDescriptionConstruct a list with the default initial capacity.protectedIntGapList(boolean copy, IntGapList that) Constructor used internally, e.g. for ImmutableIntGapList.IntGapList(int capacity) Construct a list with specified initial capacity.IntGapList(Collection<Integer> coll) Construct a list to contain the specified elements. -
Method Summary
Modifier and TypeMethodDescriptionbooleanadd(int elem) voidadd(int index, int elem) Inserts the specified element at the specified position in this list.intbinarySearch(int index, int len, int key) Searches the specified range for an object using the binary search algorithm.intcapacity()Returns capacity of this list.clone()Returns a shallow copy of this list.copy()Returns a shallow copy of this list.static IntGapListcreate()static IntGapListcreate(int... elems) Create new list with specified elements.static IntGapListcreate(Collection<Integer> coll) Create new list with specified elements.crop()Returns a copy this list but without elements.protected booleandoAdd(int index, int elem) Helper method for adding an element to the list.protected voidAssign this list the content of the that list.protected voiddoClear()protected voidInitialize this object after the bitwise copy has been made by Object.clone().doCreate(int capacity) Create list with specified capacity.protected voiddoEnsureCapacity(int minCapacity) Increases the capacity of this list instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.protected intdoGet(int index) Helper method for getting an element from the list.protected voiddoGetAll(int[] array, int index, int len) Helper method to fill the specified elements in an array.protected intdoRemove(int index) Helper method to remove an element.protected voiddoRemoveAll(int index, int len) Remove specified range of elements from list.protected booleandoRemoveAllFast(int index, int len) Remove specified range of elements from list as specialized fast operation.protected intdoReSet(int index, int elem) Sets an element at specified position.protected intdoSet(int index, int elem) Helper method for setting an element in the list.static IntGapListEMPTY()intget(int index) getAll(int elem) Returns all elements in the list equal to the specified element.getAll(int index, int len) Returns specified range of elements from list.intstatic IntGapListimmutable(int... elems) Create new immutable list with specified elements.static IntGapListimmutable(Collection<Integer> coll) Create new immutable list with specified elements.Returns an immutable copy of this list.booleanReturns true if this list is either unmodifiable or immutable, false otherwise.<R> GapList<R> intremove(int index) intsize()voidsort(int index, int len) Sort specified elements in the list using the specified comparator.voidTrims the capacity of this IntGapList instance to be the list's current size.Methods inherited from class IIntList
addAll, addAll, addAll, addAll, addArray, addArray, addArray, addArray, addFirst, addIfAbsent, addLast, addMult, addMult, asIIntListable, binarySearch, checkIndex, checkIndexAdd, checkLength, checkLengths, checkNonNull, checkRange, clear, contains, containsAll, containsAny, containsIf, copy, count, countIf, doAddAll, doCreateArray, doIndexOf, doIndexOfIf, doInitAll, doLastIndexOf, doLastIndexOfIf, doModify, doPutAll, doReplace, doRotate, drag, element, ensureCapacity, equals, extract, extractIf, fill, filter, filterMap, flatMap, getDistinct, getFirst, getFirstOrNull, getIf, getLast, getLastOrNull, getSingle, getSingleOrNull, hashCode, indexOf, indexOf, indexOfIf, indexOfIf, initAll, initAll, initArray, initMult, isEmpty, lastIndexOf, lastIndexOf, lastIndexOfIf, lastIndexOfIf, mapFilter, move, offer, offerFirst, offerLast, peek, peekFirst, peekLast, poll, pollFirst, pollLast, pop, push, put, putAll, putAll, putArray, putMult, remove, remove, removeAll, removeAll, removeAll, removeElem, removeFirst, removeFirstOccurrence, removeIf, removeLast, removeLastOccurrence, replace, replaceAll, replaceAll, replaceArray, replaceMult, resize, retain, retainAll, retainAll, retainIf, reverse, reverse, rotate, rotate, set, setAll, setAll, setArray, setArray, setMult, sort, swap, toArray, toArray, toArray, toArray, toArray, toArray, toString, transferCopy, transferMove, transferRemove, transferSwap, transform, transformedList
-
Field Details
-
DEFAULT_CAPACITY
public static final int DEFAULT_CAPACITYDefault capacity for list- See Also:
-
-
Constructor Details
-
IntGapList
Constructor used internally, e.g. for ImmutableIntGapList.- Parameters:
copy- true to copy all instance values from source, if false nothing is donethat- list to copy
-
IntGapList
public IntGapList()Construct a list with the default initial capacity. -
IntGapList
public IntGapList(int capacity) Construct a list with specified initial capacity.- Parameters:
capacity- capacity
-
IntGapList
Construct a list to contain the specified elements. The list will have an initial capacity to hold these elements.- Parameters:
coll- collection with elements
-
-
Method Details
-
EMPTY
- Returns:
- unmodifiable empty instance
-
create
-
create
Create new list with specified elements.- Parameters:
coll- collection with elementstype- of elements stored in the list- Returns:
- created list
-
create
Create new list with specified elements.- Parameters:
elems- array with elementstype- of elements stored in the list- Returns:
- created list
-
immutable
Create new immutable list with specified elements. To reduce the needed memory, the list's capacity will be equal to its size.- Parameters:
coll- collection with elementstype- of elements stored in the list- Returns:
- created list
-
immutable
Create new immutable list with specified elements. To reduce the needed memory, the list's capacity will be equal to its size.- Parameters:
elems- array with elementstype- of elements stored in the list- Returns:
- created list
-
doAssign
-
getDefaultElem
public int getDefaultElem()- Specified by:
getDefaultElemin classIIntList
-
crop
Description copied from class:IIntListReturns a copy this list but without elements. The new list will have the same type as this list. -
copy
Description copied from class:IIntListReturns a shallow copy of this list. The new list will contain the same elements as the source list, i.e. the elements themselves are not copied. The capacity of the list will be set to the number of elements, i.e. size and capacity are equal. This returned list will be modifiable, i.e. a read-only list will be copied and be modifiable again. -
clone
Description copied from class:IIntListReturns a shallow copy of this list. The new list will contain the same elements as the source list, i.e. the elements themselves are not copied. The capacity of the list will be set to the number of elements, i.e. size and capacity are equal. If the list is read-only, the same list is returned without change. UseIIntList.copy()to . -
isReadOnly
public boolean isReadOnly()Description copied from class:IIntListReturns true if this list is either unmodifiable or immutable, false otherwise.- Specified by:
isReadOnlyin classIIntList
-
unmodifiableList
- Specified by:
unmodifiableListin classIIntList
-
immutableList
Description copied from class:IIntListReturns an immutable copy of this list. The returned list is independent from the original list, i.e. changes done later are not seen. Attempts to modify the returned list, whether direct or via its iterator, result in an UnsupportedOperationException. If this list is already immutable, it is returned unchanged. SeeIIntList.unmodifiableList()to get unmodifiable view of a list.- Specified by:
immutableListin classIIntList- Returns:
- an immutable copy of the specified list
-
doClone
-
doClear
-
size
-
capacity
public int capacity()Description copied from class:IIntListReturns capacity of this list. Note that two lists are considered equal even if they have a distinct capacity. Also the capacity can be changed by operations like clone() etc. -
get
-
doGet
protected int doGet(int index) Description copied from class:IIntListHelper method for getting an element from the list. This is the only method which really gets an element. Override if you need to validity checks before getting. -
doSet
protected int doSet(int index, int elem) Description copied from class:IIntListHelper method for setting an element in the list. This is the only method which really sets an element. Override if you need to validity checks before setting. -
doReSet
protected int doReSet(int index, int elem) Description copied from class:IIntListSets an element at specified position. This method is used internally if existing elements will be moved etc. Override if you need to validity checks. -
add
-
add
public void add(int index, int elem) Description copied from class:IIntListInserts the specified element at the specified position in this list. Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices). -
getAll
Description copied from class:IIntListReturns specified range of elements from list. -
getAll
Description copied from class:IIntListReturns all elements in the list equal to the specified element. -
map
-
doAdd
protected boolean doAdd(int index, int elem) Description copied from class:IIntListHelper method for adding an element to the list. This is the only method which really adds an element. Override if you need to validity checks before adding. -
remove
-
doRemove
protected int doRemove(int index) Description copied from class:IIntListHelper method to remove an element. This is the only method which really removes an element. Override if you need to validity checks before removing. -
doEnsureCapacity
protected void doEnsureCapacity(int minCapacity) Description copied from class:IIntListIncreases the capacity of this list instance, if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument.- Specified by:
doEnsureCapacityin classIIntList- Parameters:
minCapacity- the desired minimum capacity
-
trimToSize
public void trimToSize()Trims the capacity of this IntGapList instance to be the list's current size. An application can use this operation to minimize the storage of an instance.- Specified by:
trimToSizein classIIntList
-
doGetAll
protected void doGetAll(int[] array, int index, int len) Description copied from class:IIntListHelper method to fill the specified elements in an array. -
doCreate
Description copied from class:IIntListCreate list with specified capacity. -
doRemoveAll
protected void doRemoveAll(int index, int len) Description copied from class:IIntListRemove specified range of elements from list.- Overrides:
doRemoveAllin classIIntList- Parameters:
index- index of first element to removelen- number of elements to remove
-
doRemoveAllFast
protected boolean doRemoveAllFast(int index, int len) Remove specified range of elements from list as specialized fast operation.- Parameters:
index- index of first element to removelen- number of elements to remove- Returns:
- true if removal could be done, false otherwise
-
sort
-
binarySearch
public int binarySearch(int index, int len, int key) Description copied from class:IIntListSearches the specified range for an object using the binary search algorithm.Note that the method is defined to work with an arbitrary type <K>. This allows to search directly for a key field in the object without the need to construct an object containing the key:
persons.binarySearch("john", new SearchByName()); class SearchByName implements Comparator<Object> { public int compare(Object o1, Object o2) { String s1 = (o1 instanceof String) ? (String) o1 : ((Name) o1).getName(); String s2 = (o2 instanceof String) ? (String) o2 : ((Name) o2).getName(); return s1.compareTo(s2); } }/- Specified by:
binarySearchin classIIntList- Parameters:
index- index of first element to searchlen- number of elements to searchkey- the value to be searched for- Returns:
- index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.
- See Also:
-