Class LongGapList
java.lang.Object
org.magicwerk.brownies.collections.primitive.ILongList
org.magicwerk.brownies.collections.primitive.LongGapList
- Record Components:
type- of elements stored in the list
- All Implemented Interfaces:
Serializable,Cloneable,ILongListable
- Direct Known Subclasses:
LongBigList.LongBlock,LongGapList.ReadOnlyList
Class {link LongGapList} 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.
- See Also:
-
Nested Class Summary
Nested ClassesNested classes/interfaces inherited from class org.magicwerk.brownies.collections.primitive.ILongList
ILongList.ILongListableFromArray, ILongList.ILongListableFromCollection, ILongList.ILongListableFromList, ILongList.ILongListableFromMult -
Field Summary
FieldsModifier and TypeFieldDescriptionprivate static final booleanIf true the invariants the LongGapList are checked for debuggingprivate static final booleanIf true the internal state of the LongGapList is traced out for debuggingprivate static final booleanIf true the calls to some methods are traced out for debuggingstatic final intDefault capacity for listprivate static final LongGapListUnmodifiable empty instanceprivate static long[]Empty array used for default initializationprivate intPhysical position after last elementprivate booleanIf false (default) an element is added on the left side of the gap (favorable for adding after an insertion point, e.g.private intLogical index of first element after gap (ignored if gapSize=0)private intSize of gap (0 if there is no gap)private intPhysical position of first slot in gap (ignored if gapSize=0)private static final longUID for serializationprivate intNumber of elements stored in this LongGapListprivate intPhysical position of first elementprivate long[]Array holding raw data -
Constructor Summary
ConstructorsModifierConstructorDescriptionConstruct a list with the default initial capacity.protectedLongGapList(boolean copy, LongGapList that) Constructor used internally, e.g.LongGapList(int capacity) Construct a list with specified initial capacity.LongGapList(Collection<Long> coll) Construct a list to contain the specified elements. -
Method Summary
Modifier and TypeMethodDescriptionvoidadd(int index, long elem) Inserts the specified element at the specified position in this list.booleanadd(long elem) intbinarySearch(int index, int len, long key) 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.clone()Returns a shallow copy of this list.copy()Returns a shallow copy of this list.static LongGapListcreate()static LongGapListcreate(long... elems) Create new list with specified elements.static LongGapListcreate(Collection<Long> coll) Create new list with specified elements.crop()Returns a copy this list but without elements.private voidPrivate method to check invariant of LongGapList.private voidPrivate method to dump fields of LongGapList.private voidPrivate method write logging output.private StringdebugPrint(long[] values) Print array values into string.private intPrivate method to determine state of LongGapList.protected booleandoAdd(int index, long 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 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 longdoGet(int index) Helper method for getting an element from the list.protected voiddoGetAll(long[] 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 longdoRemove(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 longdoReSet(int index, long elem) Sets an element at specified position.protected longdoSet(int index, long elem) Helper method for setting an element in the list.static LongGapListEMPTY()(package private) voidensureNormalized(int minCapacity) Normalize data of LongGapList so the elements are found from values[0] to values[size-1].longget(int index) getAll(int index, int len) Returns specified range of elements from list.getAll(long elem) Returns all elements in the list equal to the specified element.longstatic LongGapListimmutable(long... elems) Create new immutable list with specified elements.static LongGapListimmutable(Collection<Long> coll) Create new immutable list with specified elements.Returns an immutable copy of this list.(package private) voidinit()Initialize the list to be empty.(package private) voidinit(long... elems) Initialize the list to contain the specified elements only.(package private) voidinit(long[] values, int size) Initialize all instance fields.(package private) voidinit(Collection<Long> coll) Initialize the list to contain the specified elements only.(package private) booleanChecks whether elements are stored normalized, i.e.booleanReturns true if this list is either unmodifiable or immutable, false otherwise.<R> GapList<R> 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 final 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) long[]prepareAddBuffer(int index, int len) Prepare direct access to an array buffer for fast adding elements to the list.private voidDeserialize a LongGapList object.(package private) voidreleaseAddBuffer(int index, int len) Releases the buffer retrieved byprepareAddBuffer(int, int).longremove(int index) intsize()voidsort(int index, int len) Sort specified elements in the list using the specified comparator.voidTrims the capacity of this LongGapList instance to be the list's current size.private voidSerialize a LongGapList object.Methods inherited from class org.magicwerk.brownies.collections.primitive.ILongList
addAll, addAll, addAll, addAll, addArray, addArray, addArray, addArray, addFirst, addIfAbsent, addLast, addMult, addMult, asILongListable, 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, 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, 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, toArray, toString, transferCopy, transferMove, transferRemove, transferSwap, transform, transformedList
-
Field Details
-
DEBUG_CHECK
private static final boolean DEBUG_CHECKIf true the invariants the LongGapList are checked for debugging- See Also:
-
DEBUG_TRACE
private static final boolean DEBUG_TRACEIf true the calls to some methods are traced out for debugging- See Also:
-
DEBUG_DUMP
private static final boolean DEBUG_DUMPIf true the internal state of the LongGapList is traced out for debugging- See Also:
-
EMPTY_VALUES
private static long[] EMPTY_VALUESEmpty array used for default initialization -
EMPTY
Unmodifiable empty instance -
serialVersionUID
private static final long serialVersionUIDUID for serialization- See Also:
-
DEFAULT_CAPACITY
public static final int DEFAULT_CAPACITYDefault capacity for list- See Also:
-
values
private long[] valuesArray holding raw data -
size
private int sizeNumber of elements stored in this LongGapList -
start
private int startPhysical position of first element -
end
private int endPhysical position after last element -
gapSize
private int gapSizeSize of gap (0 if there is no gap) -
gapIndex
private int gapIndexLogical index of first element after gap (ignored if gapSize=0) -
gapStart
private int gapStartPhysical position of first slot in gap (ignored if gapSize=0) -
gapAddRight
private boolean gapAddRightIf 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 Details
-
LongGapList
Constructor used internally, e.g. for ImmutableLongGapList.- Parameters:
copy- true to copy all instance values from source, if false nothing is donethat- list to copy
-
LongGapList
public LongGapList()Construct a list with the default initial capacity. -
LongGapList
public LongGapList(int capacity) Construct a list with specified initial capacity.- Parameters:
capacity- capacity
-
LongGapList
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
-
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
Description copied from class:ILongListAssign 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
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(long... 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 long getDefaultElem()- Specified by:
getDefaultElemin classILongList
-
crop
Description copied from class:ILongListReturns a copy this list but without elements. The new list will have the same type as this list. -
copy
Description copied from class:ILongListReturns 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:ILongListReturns 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. UseILongList.copy()to . -
isReadOnly
public boolean isReadOnly()Description copied from class:ILongListReturns true if this list is either unmodifiable or immutable, false otherwise.- Specified by:
isReadOnlyin classILongList
-
unmodifiableList
- Specified by:
unmodifiableListin classILongList
-
immutableList
Description copied from class:ILongListReturns 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. SeeILongList.unmodifiableList()to get unmodifiable view of a list.- Specified by:
immutableListin classILongList- Returns:
- an immutable copy of the specified list
-
doClone
Description copied from class:ILongListInitialize this object after the bitwise copy has been made by Object.clone(). -
ensureNormalized
void ensureNormalized(int minCapacity) Normalize data of LongGapList 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(long[] values, int size) Initialize all instance fields.- Parameters:
values- new values arraysize- new size
-
doClear
protected void doClear() -
size
public int size()- Specified by:
sizein interfaceILongListable- Specified by:
sizein classILongList
-
capacity
public int capacity()Description copied from class:ILongListReturns 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 long get(int index) - Specified by:
getin interfaceILongListable- Overrides:
getin classILongList
-
doGet
protected long doGet(int index) Description copied from class:ILongListHelper 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 long doSet(int index, long elem) Description copied from class:ILongListHelper 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 long doReSet(int index, long elem) Description copied from class:ILongListSets 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(long elem) -
add
public void add(int index, long elem) Description copied from class:ILongListInserts 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:ILongListReturns specified range of elements from list. -
getAll
Description copied from class:ILongListReturns all elements in the list equal to the specified element. -
map
-
prepareAddBuffer
long[] 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, long elem) Description copied from class:ILongListHelper 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 long remove(int index) -
doRemove
protected long doRemove(int index) Description copied from class:ILongListHelper 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:ILongListIncreases 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 classILongList- 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 LongGapList instance to be the list's current size. An application can use this operation to minimize the storage of an instance.- Specified by:
trimToSizein classILongList
-
doGetAll
protected void doGetAll(long[] array, int index, int len) Description copied from class:ILongListHelper method to fill the specified elements in an array. -
writeObject
Serialize a LongGapList object.- Parameters:
oos- output stream for serialization- Throws:
IOException- if serialization fails
-
readObject
Deserialize a LongGapList object.- Parameters:
ois- input stream for serialization- Throws:
IOException- if serialization failsClassNotFoundException- if serialization fails
-
doCreate
Description copied from class:ILongListCreate list with specified capacity. -
doRemoveAll
protected void doRemoveAll(int index, int len) Description copied from class:ILongListRemove specified range of elements from list.- Overrides:
doRemoveAllin classILongList- 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:ILongListSort specified elements in the list using the specified comparator. -
binarySearch
public int binarySearch(int index, int len, long key) Description copied from class:ILongListSearches 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 classILongList- 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:
-
debugCheck
private void debugCheck()Private method to check invariant of LongGapList. It is only used for debugging. -
debugState
private int debugState()Private method to determine state of LongGapList. It is only used for debugging.- Returns:
- state in which LongGapList is
-
debugDump
private void debugDump()Private method to dump fields of LongGapList. It is only called if the code is run in development mode. -
debugPrint
Print array values into string.- Parameters:
values- array with values- Returns:
- string representing array values
-
debugLog
Private method write logging output. It is only used for debugging.- Parameters:
msg- message to write out
-