Class GapList<E>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- java.util.AbstractList<E>
-
- org.magicwerk.brownies.collections.IList<E>
-
- org.magicwerk.brownies.collections.GapList<E>
-
- Type Parameters:
E- type of elements stored in the list
- All Implemented Interfaces:
java.io.Serializable,java.lang.Cloneable,java.lang.Iterable<E>,java.util.Collection<E>,java.util.List<E>,java.util.RandomAccess,ICollection<E>,IListable<E>
- Direct Known Subclasses:
BigList.Block,GapList.ReadOnlyList,KeyCollectionImpl.KeyMapList
public class GapList<E> extends IList<E>
Class {link GapList} combines the strengths of bothArrayListandLinkedList. 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
Dequehowever, useIList.asDeque()to get a view implementing it.Note that this implementation is not synchronized.
Note that the iterators provided are not fail-fast.
- See Also:
List,ArrayList, Serialized Form
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description protected static classGapList.ReadOnlyList<E>A read-only version ofGapList.-
Nested classes/interfaces inherited from class org.magicwerk.brownies.collections.IList
IList.IListableFromArray<E>, IList.IListableFromCollection<E>, IList.IListableFromList<E>, IList.IListableFromMult<E>, IList.Iter, IList.ListIter
-
-
Field Summary
Fields Modifier and Type Field Description private static booleanDEBUG_CHECKIf true the invariants the GapList are checked for debuggingprivate static booleanDEBUG_DUMPIf true the internal state of the GapList is traced out for debuggingprivate static booleanDEBUG_TRACEIf true the calls to some methods are traced out for debuggingstatic intDEFAULT_CAPACITYDefault capacity for listprivate static GapListEMPTYUnmodifiable empty instanceprivate static java.lang.Object[]EMPTY_VALUESEmpty array used for default initializationprivate intendPhysical position after last elementprivate booleangapAddRightIf false (default) an element is added on the left side of the gap (favorable for adding after an insertion point, e.g.private intgapIndexLogical index of first element after gap (ignored if gapSize=0)private intgapSizeSize of gap (0 if there is no gap)private intgapStartPhysical position of first slot in gap (ignored if gapSize=0)private static longserialVersionUIDUID for serializationprivate intsizeNumber of elements stored in this GapListprivate intstartPhysical position of first elementprivate E[]valuesArray holding raw data
-
Constructor Summary
Constructors Modifier Constructor Description GapList()Construct a list with the default initial capacity.protectedGapList(boolean copy, GapList<E> that)Constructor used internally, e.g.GapList(int capacity)Construct a list with specified initial capacity.GapList(java.util.Collection<? extends E> coll)Construct a list to contain the specified elements.
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description voidadd(int index, E elem)Inserts the specified element at the specified position in this list.booleanadd(E elem)<K> intbinarySearch(int index, int len, K key, java.util.Comparator<? super K> comparator)Searches the specified range for an object using the binary search algorithm.(package private) intcalculateNewCapacity(int minCapacity)Calculate new capacity.intcapacity()Returns capacity of this list.GapList<E>clone()Returns a shallow copy of this list.GapList<E>copy()Returns a shallow copy of this list.static <E> GapList<E>create()Create new list.static <E> GapList<E>create(E... elems)Create new list with specified elements.static <E> GapList<E>create(java.util.Collection<? extends E> coll)Create new list with specified elements.GapList<E>crop()Returns a copy this list but without elements.private voiddebugCheck()Private method to check invariant of GapList.private voiddebugDump()Private method to dump fields of GapList.private voiddebugLog(java.lang.String msg)Private method write logging output.private java.lang.StringdebugPrint(E[] values)Print array values into string.private intdebugState()Private method to determine state of GapList.protected booleandoAdd(int index, E elem)Helper method for adding an element to the list.private intdoAddCreateNewGap(int index, int physIdx)private intdoAddCreateNewGap2(int index, int physIdx)private intdoAddMoveExistingGap(int index, int physIdx)private intdoAddMoveExistingGap2(int index, int physIdx, int gapEnd, boolean moveLeft)protected voiddoAssign(IList<E> that)Assign this list the content of the that list.protected voiddoClear()protected voiddoClone(IList<E> that)Initialize this object after the bitwise copy has been made by Object.clone().GapList<E>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 EdoGet(int index)Helper method for getting an element from the list.protected <T> voiddoGetAll(T[] array, int index, int len)Helper method to fill the specified elements in an array.private int[]doPhysIndex(int pidx0, int pidx1)private int[]doPhysIndex2(int pidx0, int pidx1)protected EdoRemove(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.private voiddoRemoveMiddle(int index, int physIdx)private voiddoRemoveMoveExistingGap(int index, int physIdx)protected EdoReSet(int index, E elem)Sets an element at specified position.protected EdoSet(int index, E elem)Helper method for setting an element in the list.static <EE> GapList<EE>EMPTY()(package private) voidensureNormalized(int minCapacity)Normalize data of GapList so the elements are found from values[0] to values[size-1].Eget(int index)Return element at specified positionGapList<E>getAll(int index, int len)Returns specified range of elements from list.GapList<E>getAll(E elem)Returns all elements in the list equal to the specified element.EgetDefaultElem()static <E> GapList<E>immutable(E... elems)Create new immutable list with specified elements.static <E> GapList<E>immutable(java.util.Collection<? extends E> coll)Create new immutable list with specified elements.GapList<E>immutableList()Returns an immutable copy of this list.(package private) voidinit()Initialize the list to be empty.(package private) voidinit(E... elems)Initialize the list to contain the specified elements only.(package private) voidinit(java.lang.Object[] values, int size)Initialize all instance fields.(package private) voidinit(java.util.Collection<? extends E> coll)Initialize the list to contain the specified elements only.(package private) booleanisNormalized()Checks whether elements are stored normalized, i.e.booleanisReadOnly()Returns true if this list is either unmodifiable or immutable, false otherwise.<R> GapList<R>map(java.util.function.Function<E,R> mapper)Create a new list by applying the specified mapping function to all elements.private voidmoveData(int src, int dst, int len)Move a range of elements in the values array.private voidmoveDataWithGap(int src, int dst, int len)Move a range of elements in the values array and adjust the gap.private intphysIndex(int idx)Calculate index for physical access to an element.private int[]physIndex(int idx0, int idx1)Calculate indexes for physical access to a range of elements.(package private) E[]prepareAddBuffer(int index, int len)Prepare direct access to an array buffer for fast adding elements to the list.private voidreadObject(java.io.ObjectInputStream ois)Deserialize a GapList object.(package private) voidreleaseAddBuffer(int index, int len)Releases the buffer retrieved byprepareAddBuffer(int, int).Eremove(int index)intsize()Return size of listvoidsort(int index, int len, java.util.Comparator<? super E> comparator)Sort specified elements in the list using the specified comparator.voidtrimToSize()Trims the capacity of this GapList instance to be the list's current size.GapList<E>unmodifiableList()Returns an unmodifiable view of this list.private voidwriteObject(java.io.ObjectOutputStream oos)Serialize a GapList object.-
Methods inherited from class org.magicwerk.brownies.collections.IList
addAll, addAll, addAll, addAll, addArray, addArray, addArray, addArray, addFirst, addIfAbsent, addLast, addMult, addMult, asDeque, asIListable, binarySearch, checkIndex, checkIndexAdd, checkLength, checkLengths, checkNonNull, checkRange, clear, contains, containsAll, containsAny, containsIf, copy, count, countIf, descendingIterator, doAddAll, doCreateArray, doIndexOf, doIndexOfIf, doInitAll, doLastIndexOf, doLastIndexOfIf, doModify, doPutAll, doReplace, doRotate, doTransfer, doTransferSwap, drag, element, ensureCapacity, equals, equalsElem, extract, extractIf, fill, filter, filterMap, flatMap, getDistinct, getFirst, getFirstOrNull, getIf, getLast, getLastOrNull, getSingle, getSingleOrNull, hashCode, hashCodeElem, indexOf, indexOf, indexOfIf, indexOfIf, initAll, initAll, initArray, initMult, isEmpty, iterator, lastIndexOf, lastIndexOf, lastIndexOfIf, lastIndexOfIf, listIterator, listIterator, mapFilter, move, offer, offerFirst, offerLast, peek, peekFirst, peekLast, poll, pollFirst, pollLast, pop, push, put, putAll, putAll, putArray, putMult, remove, remove, remove, removeAll, removeAll, removeAll, 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, toArray, toString, transferCopy, transferMove, transferRemove, transferSwap, transform, transformedList
-
-
-
-
Field Detail
-
DEBUG_CHECK
private static final boolean DEBUG_CHECK
If true the invariants the GapList are checked for debugging- See Also:
- Constant Field Values
-
DEBUG_TRACE
private static final boolean DEBUG_TRACE
If true the calls to some methods are traced out for debugging- See Also:
- Constant Field Values
-
DEBUG_DUMP
private static final boolean DEBUG_DUMP
If true the internal state of the GapList is traced out for debugging- See Also:
- Constant Field Values
-
EMPTY_VALUES
private static java.lang.Object[] EMPTY_VALUES
Empty array used for default initialization
-
EMPTY
private static final GapList EMPTY
Unmodifiable empty instance
-
serialVersionUID
private static final long serialVersionUID
UID for serialization- See Also:
- Constant Field Values
-
DEFAULT_CAPACITY
public static final int DEFAULT_CAPACITY
Default capacity for list- See Also:
- Constant Field Values
-
values
private E[] values
Array holding raw data
-
size
private int size
Number of elements stored in this GapList
-
start
private int start
Physical position of first element
-
end
private int end
Physical position after last element
-
gapSize
private int gapSize
Size of gap (0 if there is no gap)
-
gapIndex
private int gapIndex
Logical index of first element after gap (ignored if gapSize=0)
-
gapStart
private int gapStart
Physical position of first slot in gap (ignored if gapSize=0)
-
gapAddRight
private boolean gapAddRight
If false (default) an element is added on the left side of the gap (favorable for adding after an insertion point, e.g. indexes 5, 6, 7), if true the element is added on the right side of the gap (favorable for adding before an insertion point, e.g. indexes 5, 5, 5)
-
-
Constructor Detail
-
GapList
protected GapList(boolean copy, GapList<E> that)Constructor used internally, e.g. for ImmutableGapList.- Parameters:
copy- true to copy all instance values from source, if false nothing is donethat- list to copy
-
GapList
public GapList()
Construct a list with the default initial capacity.
-
GapList
public GapList(int capacity)
Construct a list with specified initial capacity.- Parameters:
capacity- capacity
-
GapList
public GapList(java.util.Collection<? extends E> coll)
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 Detail
-
EMPTY
public static <EE> GapList<EE> EMPTY()
- Returns:
- unmodifiable empty instance
-
create
public static <E> GapList<E> create()
Create new list.- Type Parameters:
E- type of elements stored in the list- Returns:
- created list
-
create
public static <E> GapList<E> create(java.util.Collection<? extends E> coll)
Create new list with specified elements.- Type Parameters:
E- type of elements stored in the list- Parameters:
coll- collection with elements- Returns:
- created list
-
create
@SafeVarargs public static <E> GapList<E> create(E... elems)
Create new list with specified elements.- Type Parameters:
E- type of elements stored in the list- Parameters:
elems- array with elements- Returns:
- created list
-
immutable
public static <E> GapList<E> immutable(java.util.Collection<? extends E> coll)
Create new immutable list with specified elements. To reduce the needed memory, the list's capacity will be equal to its size.- Type Parameters:
E- type of elements stored in the list- Parameters:
coll- collection with elements- Returns:
- created list
-
immutable
@SafeVarargs public static <E> GapList<E> immutable(E... elems)
Create new immutable list with specified elements. To reduce the needed memory, the list's capacity will be equal to its size.- Type Parameters:
E- type of elements stored in the list- Parameters:
elems- array with elements- Returns:
- created list
-
physIndex
private final int physIndex(int idx)
Calculate index for physical access to an element.- Parameters:
idx- logical index of element- Returns:
- physical index to access element in values[]
-
physIndex
private int[] physIndex(int idx0, int idx1)Calculate indexes for physical access to a range of elements. The method returns between one and three ranges of physical indexes.- Parameters:
idx0- start indexidx1- end index- Returns:
- array with physical start and end indexes (may contain 0, 2, 4, or 6 elements)
-
doPhysIndex
private int[] doPhysIndex(int pidx0, int pidx1)
-
doPhysIndex2
private int[] doPhysIndex2(int pidx0, int pidx1)
-
doAssign
protected void doAssign(IList<E> that)
Description copied from class:IListAssign this list the content of the that list. This is done by bitwise copying so the that list should not be used afterwards.
-
init
void init()
Initialize the list to be empty. The list will have the default initial capacity.
-
init
void init(java.util.Collection<? extends E> coll)
Initialize the list to contain the specified elements only. The list will have an initial capacity to hold these elements.- Parameters:
coll- collection with elements
-
init
void init(E... elems)
Initialize the list to contain the specified elements only. The list will have an initial capacity to hold these elements.- Parameters:
elems- array with elements
-
getDefaultElem
public E getDefaultElem()
- Specified by:
getDefaultElemin classIList<E>
-
crop
public GapList<E> crop()
Description copied from class:IListReturns a copy this list but without elements. The new list will have the same type as this list.
-
copy
public GapList<E> copy()
Description copied from class:IListReturns 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
public GapList<E> clone()
Description copied from class:IListReturns 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. UseIList.copy()to .
-
isReadOnly
public boolean isReadOnly()
Description copied from class:IListReturns true if this list is either unmodifiable or immutable, false otherwise.- Specified by:
isReadOnlyin classIList<E>
-
unmodifiableList
public GapList<E> unmodifiableList()
Description copied from class:IListReturns an unmodifiable view of this list. This method allows modules to provide users with "read-only" access to internal lists, where changes made to the original list are visible as query operations on the returned list "read through" to the specified list. Attempts to modify the returned list, whether direct or via its iterator, result in an UnsupportedOperationException. If this list is already unmodifiable, it is returned unchanged. SeeIList.immutableList()to get an immutable copy of a list.- Specified by:
unmodifiableListin classIList<E>- Returns:
- an unmodifiable view of the specified list
-
immutableList
public GapList<E> immutableList()
Description copied from class:IListReturns 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. SeeIList.unmodifiableList()to get unmodifiable view of a list.- Specified by:
immutableListin classIList<E>- Returns:
- an immutable copy of the specified list
-
doClone
protected void doClone(IList<E> that)
Description copied from class:IListInitialize this object after the bitwise copy has been made by Object.clone().
-
ensureNormalized
void ensureNormalized(int minCapacity)
Normalize data of GapList so the elements are found from values[0] to values[size-1]. This method can help to speed up operations like sort or binarySearch.
-
isNormalized
boolean isNormalized()
Checks whether elements are stored normalized, i.e. start is at position 0 and there is no gap.
-
init
void init(java.lang.Object[] values, int size)Initialize all instance fields.- Parameters:
values- new values arraysize- new size
-
size
public int size()
Description copied from interface:IListableReturn size of list
-
capacity
public int capacity()
Description copied from class:IListReturns 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
public E get(int index)
Description copied from interface:IListableReturn element at specified position
-
doGet
protected E doGet(int index)
Description copied from class:IListHelper 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 E doSet(int index, E elem)
Description copied from class:IListHelper 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 E doReSet(int index, E elem)
Description copied from class:IListSets 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
public boolean add(E elem)
-
add
public void add(int index, E elem)Description copied from class:IListInserts 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
public GapList<E> getAll(int index, int len)
Description copied from class:IListReturns specified range of elements from list.
-
getAll
public GapList<E> getAll(E elem)
Description copied from class:IListReturns all elements in the list equal to the specified element.
-
map
public <R> GapList<R> map(java.util.function.Function<E,R> mapper)
Description copied from interface:ICollection
-
prepareAddBuffer
E[] prepareAddBuffer(int index, int len)
Prepare direct access to an array buffer for fast adding elements to the list. The size of the list will be increased by len being index+len after the call. The added elements will be initialized to their default value. If not all elements prepared are used, callreleaseAddBuffer(int, int)to release them.Example:
int index = list.size() int len = 1000; byte[] values = list.getAddBuffer(index, len) int read = inputstream.read(values, index, len) list.releaseAddBuffer(index, read)
- Parameters:
index- index of first buffer position (must be equal to the size of the list)len- number of elements which the buffer can held- Returns:
- array holding the elements of the list
-
releaseAddBuffer
void releaseAddBuffer(int index, int len)Releases the buffer retrieved byprepareAddBuffer(int, int). The size of the list will be index+len after the call.- Parameters:
index- index of first buffer position as passed toprepareAddBuffer(int, int)len- number of elements used in the buffer
-
doAdd
protected boolean doAdd(int index, E elem)Description copied from class:IListHelper 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.
-
doAddCreateNewGap
private int doAddCreateNewGap(int index, int physIdx)
-
doAddCreateNewGap2
private int doAddCreateNewGap2(int index, int physIdx)
-
doAddMoveExistingGap
private int doAddMoveExistingGap(int index, int physIdx)
-
doAddMoveExistingGap2
private int doAddMoveExistingGap2(int index, int physIdx, int gapEnd, boolean moveLeft)
-
moveDataWithGap
private void moveDataWithGap(int src, int dst, int len)Move a range of elements in the values array and adjust the gap. The elements are first copied and the source range is then filled with null.- Parameters:
src- start index of source rangedst- start index of destination rangelen- number of elements to move
-
moveData
private void moveData(int src, int dst, int len)Move a range of elements in the values array. The elements are first copied and the source range is then filled with null.- Parameters:
src- start index of source rangedst- start index of destination rangelen- number of elements to move
-
remove
public E remove(int index)
-
doRemove
protected E doRemove(int index)
Description copied from class:IListHelper method to remove an element. This is the only method which really removes an element. Override if you need to validity checks before removing.
-
doRemoveMiddle
private void doRemoveMiddle(int index, int physIdx)
-
doRemoveMoveExistingGap
private void doRemoveMoveExistingGap(int index, int physIdx)
-
doEnsureCapacity
protected void doEnsureCapacity(int minCapacity)
Description copied from class:IListIncreases 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 classIList<E>- Parameters:
minCapacity- the desired minimum capacity
-
calculateNewCapacity
int calculateNewCapacity(int minCapacity)
Calculate new capacity. The capacity will not shrink, so the returned capacity can be equal to values.length.- Parameters:
minCapacity- the desired minimum capacity- Returns:
- the new capacity to use
-
trimToSize
public void trimToSize()
Trims the capacity of this GapList instance to be the list's current size. An application can use this operation to minimize the storage of an instance.- Specified by:
trimToSizein classIList<E>
-
doGetAll
protected <T> void doGetAll(T[] array, int index, int len)Description copied from class:IListHelper method to fill the specified elements in an array.
-
writeObject
private void writeObject(java.io.ObjectOutputStream oos) throws java.io.IOExceptionSerialize a GapList object.- Parameters:
oos- output stream for serialization- Throws:
java.io.IOException- if serialization fails
-
readObject
private void readObject(java.io.ObjectInputStream ois) throws java.io.IOException, java.lang.ClassNotFoundExceptionDeserialize a GapList object.- Parameters:
ois- input stream for serialization- Throws:
java.io.IOException- if serialization failsjava.lang.ClassNotFoundException- if serialization fails
-
doCreate
public GapList<E> doCreate(int capacity)
Description copied from class:IListCreate list with specified capacity.
-
doRemoveAll
protected void doRemoveAll(int index, int len)Description copied from class:IListRemove specified range of elements from list.- Overrides:
doRemoveAllin classIList<E>- 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, java.util.Comparator<? super E> comparator)Description copied from class:IListSort specified elements in the list using the specified comparator.
-
binarySearch
public <K> int binarySearch(int index, int len, K key, java.util.Comparator<? super K> comparator)Description copied from class:IListSearches 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 classIList<E>- Parameters:
index- index of first element to searchlen- number of elements to searchkey- the value to be searched forcomparator- the comparator by which the list is ordered. A null value indicates that the elements' natural ordering should be used.- 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:
Arrays.binarySearch(long[], long)
-
debugCheck
private void debugCheck()
Private method to check invariant of GapList. It is only used for debugging.
-
debugState
private int debugState()
Private method to determine state of GapList. It is only used for debugging.- Returns:
- state in which GapList is
-
debugDump
private void debugDump()
Private method to dump fields of GapList. It is only called if the code is run in development mode.
-
debugPrint
private java.lang.String debugPrint(E[] values)
Print array values into string.- Parameters:
values- array with values- Returns:
- string representing array values
-
debugLog
private void debugLog(java.lang.String msg)
Private method write logging output. It is only used for debugging.- Parameters:
msg- message to write out
-
-