Class DoubleGapList
java.lang.Object
org.magicwerk.brownies.collections.primitive.IDoubleList
org.magicwerk.brownies.collections.primitive.DoubleGapList
- Record Components:
type- of elements stored in the list
- All Implemented Interfaces:
Serializable, Cloneable
- Direct Known Subclasses:
DoubleGapList.ReadOnlyList
Class {link DoubleGapList} 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 IDoubleList
IDoubleList.IDoubleListableFromArray, IDoubleList.IDoubleListableFromCollection, IDoubleList.IDoubleListableFromList, IDoubleList.IDoubleListableFromMult -
Field Summary
Fields -
Constructor Summary
ConstructorsModifierConstructorDescriptionConstruct a list with the default initial capacity.protectedDoubleGapList(boolean copy, DoubleGapList that) Constructor used internally, e.g. for ImmutableDoubleGapList.DoubleGapList(int capacity) Construct a list with specified initial capacity.DoubleGapList(Collection<Double> coll) Construct a list to contain the specified elements. -
Method Summary
Modifier and TypeMethodDescriptionbooleanadd(double elem) voidadd(int index, double elem) Inserts the specified element at the specified position in this list.intbinarySearch(int index, int len, double 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 DoubleGapListcreate()static DoubleGapListcreate(double... elems) Create new list with specified elements.static DoubleGapListcreate(Collection<Double> coll) Create new list with specified elements.crop()Returns a copy this list but without elements.protected booleandoAdd(int index, double elem) Helper method for adding an element to the list.protected voiddoAssign(IDoubleList that) Assign this list the content of the that list.protected voiddoClear()protected voiddoClone(IDoubleList that) Initialize 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 doubledoGet(int index) Helper method for getting an element from the list.protected voiddoGetAll(double[] array, int index, int len) Helper method to fill the specified elements in an array.protected doubledoRemove(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 doubledoReSet(int index, double elem) Sets an element at specified position.protected doubledoSet(int index, double elem) Helper method for setting an element in the list.static DoubleGapListEMPTY()doubleget(int index) getAll(double elem) Returns all elements in the list equal to the specified element.getAll(int index, int len) Returns specified range of elements from list.doublestatic DoubleGapListimmutable(double... elems) Create new immutable list with specified elements.static DoubleGapListimmutable(Collection<Double> 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> doubleremove(int index) intsize()voidsort(int index, int len) Sort specified elements in the list using the specified comparator.voidTrims the capacity of this DoubleGapList instance to be the list's current size.Methods inherited from class IDoubleList
addAll, addAll, addAll, addAll, addArray, addArray, addArray, addArray, addFirst, addIfAbsent, addLast, addMult, addMult, asIDoubleListable, 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
-
DoubleGapList
Constructor used internally, e.g. for ImmutableDoubleGapList.- Parameters:
copy- true to copy all instance values from source, if false nothing is donethat- list to copy
-
DoubleGapList
public DoubleGapList()Construct a list with the default initial capacity. -
DoubleGapList
public DoubleGapList(int capacity) Construct a list with specified initial capacity.- Parameters:
capacity- capacity
-
DoubleGapList
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
Description copied from class:IDoubleListAssign this list the content of the that list. This is done by bitwise copying so the that list should not be used afterwards.- Specified by:
doAssignin classIDoubleList- Parameters:
that- list to copy content from
-
getDefaultElem
public double getDefaultElem()- Specified by:
getDefaultElemin classIDoubleList
-
crop
Description copied from class:IDoubleListReturns a copy this list but without elements. The new list will have the same type as this list.- Overrides:
cropin classIDoubleList- Returns:
- an empty copy of this list
-
copy
Description copied from class:IDoubleListReturns 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.- Specified by:
copyin classIDoubleList- Returns:
- a modifiable copy of this list
-
clone
Description copied from class:IDoubleListReturns 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. UseIDoubleList.copy()to .- Overrides:
clonein classIDoubleList- Returns:
- a modifiable copy of this list
-
isReadOnly
public boolean isReadOnly()Description copied from class:IDoubleListReturns true if this list is either unmodifiable or immutable, false otherwise.- Specified by:
isReadOnlyin classIDoubleList
-
unmodifiableList
- Specified by:
unmodifiableListin classIDoubleList
-
immutableList
Description copied from class:IDoubleListReturns 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. SeeIDoubleList.unmodifiableList()to get unmodifiable view of a list.- Specified by:
immutableListin classIDoubleList- Returns:
- an immutable copy of the specified list
-
doClone
Description copied from class:IDoubleListInitialize this object after the bitwise copy has been made by Object.clone().- Specified by:
doClonein classIDoubleList- Parameters:
that- source object
-
doClear
protected void doClear()- Overrides:
doClearin classIDoubleList
-
size
public int size()- Specified by:
sizein classIDoubleList
-
capacity
public int capacity()Description copied from class:IDoubleListReturns 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.- Specified by:
capacityin classIDoubleList- Returns:
- capacity of this list
-
get
public double get(int index) - Overrides:
getin classIDoubleList
-
doGet
protected double doGet(int index) Description copied from class:IDoubleListHelper 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.- Specified by:
doGetin classIDoubleList- Parameters:
index- index of element to return- Returns:
- the element at the specified position in this list
-
doSet
protected double doSet(int index, double elem) Description copied from class:IDoubleListHelper 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.- Specified by:
doSetin classIDoubleList- Parameters:
index- index where element will be placedelem- element to set- Returns:
- old element which was at the position
-
doReSet
protected double doReSet(int index, double elem) Description copied from class:IDoubleListSets an element at specified position. This method is used internally if existing elements will be moved etc. Override if you need to validity checks.- Specified by:
doReSetin classIDoubleList- Parameters:
index- index where element will be placedelem- element to set- Returns:
- old element which was at the position
-
add
public boolean add(double elem) - Overrides:
addin classIDoubleList
-
add
public void add(int index, double elem) Description copied from class:IDoubleListInserts 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).- Overrides:
addin classIDoubleList- Parameters:
index- index at which the specified element is to be insertedelem- element to be inserted
-
getAll
Description copied from class:IDoubleListReturns specified range of elements from list.- Overrides:
getAllin classIDoubleList- Parameters:
index- index of first element to retrievelen- number of elements to retrieve- Returns:
- list containing the specified range of elements
-
getAll
Description copied from class:IDoubleListReturns all elements in the list equal to the specified element.- Overrides:
getAllin classIDoubleList- Parameters:
elem- element to look for- Returns:
- all elements in the list equal to the specified element
-
map
- Overrides:
mapin classIDoubleList
-
doAdd
protected boolean doAdd(int index, double elem) Description copied from class:IDoubleListHelper 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.- Specified by:
doAddin classIDoubleList- Parameters:
index- index where element should be added (-1 means it is up to the implementation to choose the index)elem- element to add- Returns:
- true if element has been added, false otherwise
-
remove
public double remove(int index) - Overrides:
removein classIDoubleList
-
doRemove
protected double doRemove(int index) Description copied from class:IDoubleListHelper method to remove an element. This is the only method which really removes an element. Override if you need to validity checks before removing.- Specified by:
doRemovein classIDoubleList- Parameters:
index- index of element to remove- Returns:
- removed element
-
doEnsureCapacity
protected void doEnsureCapacity(int minCapacity) Description copied from class:IDoubleListIncreases 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 classIDoubleList- Parameters:
minCapacity- the desired minimum capacity
-
trimToSize
public void trimToSize()Trims the capacity of this DoubleGapList instance to be the list's current size. An application can use this operation to minimize the storage of an instance.- Specified by:
trimToSizein classIDoubleList
-
doGetAll
protected void doGetAll(double[] array, int index, int len) Description copied from class:IDoubleListHelper method to fill the specified elements in an array.- Overrides:
doGetAllin classIDoubleList- Parameters:
array- array to store the list elementsindex- index of first element to copylen- number of elements to copy
-
doCreate
Description copied from class:IDoubleListCreate list with specified capacity.- Specified by:
doCreatein classIDoubleList- Parameters:
capacity- initial capacity (use -1 for default capacity)- Returns:
- created list
-
doRemoveAll
protected void doRemoveAll(int index, int len) Description copied from class:IDoubleListRemove specified range of elements from list.- Overrides:
doRemoveAllin classIDoubleList- 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
public void sort(int index, int len) Description copied from class:IDoubleListSort specified elements in the list using the specified comparator.- Specified by:
sortin classIDoubleList- Parameters:
index- index of first element to sortlen- number of elements to sort- See Also:
-
binarySearch
public int binarySearch(int index, int len, double key) Description copied from class:IDoubleListSearches 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 classIDoubleList- 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:
-