Class LongBigList
java.lang.Object
org.magicwerk.brownies.collections.primitive.ILongList
org.magicwerk.brownies.collections.primitive.LongBigList
- All Implemented Interfaces:
Serializable,Cloneable,ILongListable
- Direct Known Subclasses:
LongBigList.ReadOnlyLongBigList
LongBigList is a list optimized for storing large number of elements.
It stores the elements in fixed size blocks and the blocks itself are maintained in a tree for fast access.
It also offers specialized methods for bulk processing of elements.
Also copying a LongBigList is efficiently possible as its implemented using a copy-on-write approach.
Note that this implementation is not synchronized. Due to data caching used for exploiting locality of reference, performance can decrease if LongBigList is accessed by several threads at different positions.
Note that the iterators provided are not fail-fast.
- See Also:
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescription(package private) static classA block stores in maximum blockSize number of elements.(package private) static classImplements an AVLNode storing a LongBlock.protected static classA read-only version of.invalid reference
Key1ListNested classes/interfaces inherited from class org.magicwerk.brownies.collections.primitive.ILongList
ILongList.ILongListableFromArray, ILongList.ILongListableFromCollection, ILongList.ILongListableFromList, ILongList.ILongListableFromMult -
Field Summary
FieldsModifier and TypeFieldDescriptionprivate intNumber of elements stored at maximum in a blockprivate static final booleanSet to true for debugging during developingprivate intEnd index of current blockprivate intStart index of current blockprivate intModify value which must be applied before this block is not current any moreprivate LongBigList.LongBlockNodeCurrent nodeprivate static final intDefault block sizeprivate static final LongBigListUnmodifiable empty instanceprivate static final floatIf an element is added to the list at the head or tail, the block is only filled until it has FILL_THRESHOLD*blockSize elements (so there is room for insertion without need to split).private static final floatIf two adjacent blocks both less than MERGE_THRESHOLD*blockSize elements, they are mergedprivate LongBigList.LongBlockNodeThe root node in the treeprivate static final longUID for serializationprivate intNumber of elements stored in this LongBigList -
Constructor Summary
ConstructorsModifierConstructorDescriptionDefault constructor.protectedLongBigList(boolean copy, LongBigList that) Constructor used internally, e.g.LongBigList(int blockSize) Constructor.privateLongBigList(int blockSize, int firstLongBlockSize) Internal constructor.LongBigList(Collection<Long> coll) Create new list with specified elements. -
Method Summary
Modifier and TypeMethodDescriptionprivate voidaddLongBlock(int index, LongBigList.LongBlock obj) Adds a new element to the list.intbinarySearch(int index, int len, long key) Searches the specified range for an object using the binary search algorithm.intReturns block size used for this LongBigList.intcapacity()As LongBigList grows and shrinks automatically, the term capacity does not really make sense.private voidcheck()private voidprivate voidclone()Returns a shallow copy of this list.copy()Returns a shallow copy of this list.private LongBigList.LongBlockNodeCreate a copy of the specified node.static LongBigListcreate()static LongBigListcreate(long... elems) Create new list with specified elements.static LongBigListcreate(Collection<Long> coll) Create new list with specified elements.crop()Returns a copy this list but without elements.protected booleandoAdd(int index, long element) Helper method for adding an element to the list.protected booleandoAddAll(int index, ILongListable list) Helper method for adding multiple elements to the list.private voiddoAddAllHead(ILongListable list, int addPos, int addLen, int space) private voiddoAddAllMiddle(ILongListable list, int addPos) private voiddoAddAllTail(ILongListable list, int addPos, int addLen, int space) private voiddoAddSplitLongBlock(int index, long element, int pos, LongBigList.LongBlock newLongBlock) 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().protected ILongListdoCreate(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.private voiddoGetLongBlock(int index, int modify) Determine node/block for the specified index.private booleandoGetLongBlockLeft(int modify, LongBigList.LongBlockNode nextNode, boolean wasLeft) private booleandoGetLongBlockRight(int modify, LongBigList.LongBlockNode nextNode, boolean wasLeft) private voiddoInit(int blockSize, int firstLongBlockSize) Initialize LongBigList.protected longdoRemove(int index) Helper method to remove an element.private LongBigList.LongBlockNodeprotected voiddoRemoveAll(int index, int len) Remove specified range of elements from list.private voiddoRemoveAll2(int index, int len, int startPos, LongBigList.LongBlockNode startNode, LongBigList.LongBlockNode endNode) 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 LongBigListEMPTY()protected voidfinalize()longprivate intgetLongBlockIndex(int index, boolean write, int modify) Returns index in block where the element with specified index is located.private intgetLongBlockIndex2(int index, boolean write, int modify) Returns an immutable copy of this list.private booleanbooleanReturns true if this list is either unmodifiable or immutable, false otherwise.private voidMerge the specified node with the left or right neighbor if possible.private voidmodify(LongBigList.LongBlockNode node, int modify) Modify relativePosition of all nodes starting from the specified node.private voidmodifyLeftNode(LongBigList.LongBlockNode node, int modify) private voidmodifyRightNode(LongBigList.LongBlockNode node, int modify) private voidDeserialize a LongBigList object.private voidRelease current block and apply modification if pending.intsize()voidsort(int index, int len) Sort specified elements in the list using the specified comparator.voidPack as many elements in the blocks as allowed.private voidSerialize a LongBigList object.Methods inherited from class org.magicwerk.brownies.collections.primitive.ILongList
add, add, 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, doCreateArray, doGetAll, doIndexOf, doIndexOfIf, doInitAll, doLastIndexOf, doLastIndexOfIf, doModify, doPutAll, doReplace, doRotate, doTransfer, doTransferSwap, drag, element, ensureCapacity, equals, equalsElem, extract, extractIf, fill, filter, filterMap, flatMap, get, getAll, getAll, getDistinct, getFirst, getFirstOrNull, getIf, getLast, getLastOrNull, getSingle, getSingleOrNull, hashCode, hashCodeElem, indexOf, indexOf, indexOfIf, indexOfIf, initAll, initAll, initArray, initMult, isEmpty, lastIndexOf, lastIndexOf, lastIndexOfIf, lastIndexOfIf, map, mapFilter, move, offer, offerFirst, offerLast, peek, peekFirst, peekLast, poll, pollFirst, pollLast, pop, push, put, putAll, putAll, putArray, putMult, remove, 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
-
serialVersionUID
private static final long serialVersionUIDUID for serialization- See Also:
-
DEFAULT_BLOCK_SIZE
private static final int DEFAULT_BLOCK_SIZEDefault block size- See Also:
-
MERGE_THRESHOLD
private static final float MERGE_THRESHOLDIf two adjacent blocks both less than MERGE_THRESHOLD*blockSize elements, they are merged- See Also:
-
FILL_THRESHOLD
private static final float FILL_THRESHOLDIf an element is added to the list at the head or tail, the block is only filled until it has FILL_THRESHOLD*blockSize elements (so there is room for insertion without need to split).- See Also:
-
CHECK
private static final boolean CHECKSet to true for debugging during developing- See Also:
-
EMPTY
Unmodifiable empty instance -
blockSize
private int blockSizeNumber of elements stored at maximum in a block -
size
private int sizeNumber of elements stored in this LongBigList -
rootNode
The root node in the tree -
currNode
Current node -
currLongBlockStart
private int currLongBlockStartStart index of current block -
currLongBlockEnd
private int currLongBlockEndEnd index of current block -
currModify
private int currModifyModify value which must be applied before this block is not current any more
-
-
Constructor Details
-
LongBigList
Constructor used internally, e.g. for ImmutableLongBigList.- Parameters:
copy- true to copy all instance values from source, if false nothing is donethat- list to copy
-
LongBigList
public LongBigList()Default constructor. The default block size is used. -
LongBigList
public LongBigList(int blockSize) Constructor.- Parameters:
blockSize- block size
-
LongBigList
Create new list with specified elements.- Parameters:
coll- collection with element
-
LongBigList
private LongBigList(int blockSize, int firstLongBlockSize) Internal constructor.- Parameters:
blockSize- default block sizefirstLongBlockSize- block size of first block
-
-
Method Details
-
EMPTY
- Returns:
- unmodifiable empty instance
-
create
-
create
Create new list with specified elements.- Parameters:
coll- collection with elementtype- 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
-
blockSize
public int blockSize()Returns block size used for this LongBigList.- Returns:
- block size used for this LongBigList
-
doInit
private void doInit(int blockSize, int firstLongBlockSize) Initialize LongBigList.- Parameters:
blockSize- default block sizefirstLongBlockSize- block size of first block
-
crop
Description copied from class:ILongListReturns a copy this list but without elements. The new list will have the same type as this list. -
isReadOnly
public boolean isReadOnly()Description copied from class:ILongListReturns true if this list is either unmodifiable or immutable, false otherwise.- Specified by:
isReadOnlyin classILongList
-
copy
Returns 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.The copy is realized by a copy-on-write approach so also really large lists can efficiently be handled.
-
clone
Returns 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 .The copy is realized by a copy-on-write approach so also really large lists can efficiently be handled.
-
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. -
doClone
Description copied from class:ILongListInitialize this object after the bitwise copy has been made by Object.clone(). -
copy
Create a copy of the specified node.- Parameters:
node- source node- Returns:
- newly created copy of source
-
getDefaultElem
public long getDefaultElem()- Specified by:
getDefaultElemin classILongList
-
finalize
protected void finalize() -
size
public int size()- Specified by:
sizein interfaceILongListable- Specified by:
sizein classILongList
-
capacity
public int capacity()As LongBigList grows and shrinks automatically, the term capacity does not really make sense. Therefore always -1 is returned. -
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. -
releaseLongBlock
private void releaseLongBlock()Release current block and apply modification if pending. -
getLongBlockIndex
private int getLongBlockIndex(int index, boolean write, int modify) Returns index in block where the element with specified index is located. This method also sets currLongBlock to remember this last used block.- Parameters:
index- list index (0 invalid input: '<'= index invalid input: '<'= size())write- true if the block is needed for a write operation (set, add, remove)modify- modify instruction (N>0: N elements are added, Ninvalid input: '<'0: N elements are removed, 0 no change)- Returns:
- relative index within block
-
getLongBlockIndex2
private int getLongBlockIndex2(int index, boolean write, int modify) -
isOnlyRootLongBlock
private boolean isOnlyRootLongBlock()- Returns:
- true if there is only the root block, false otherwise
-
doGetLongBlock
private void doGetLongBlock(int index, int modify) Determine node/block for the specified index. The fields currNode, currLongBlockStart, and currLongBlockEnd are set. During the traversing the tree node, the nodes relative positions are changed according to the modify instruction.- Parameters:
index- list index for which block must be determinedmodify- modify instruction (N>0: N elements are added, Ninvalid input: '<'0: N elements are removed, 0 no change)
-
doGetLongBlockLeft
-
doGetLongBlockRight
private boolean doGetLongBlockRight(int modify, LongBigList.LongBlockNode nextNode, boolean wasLeft) -
addLongBlock
Adds a new element to the list.- Parameters:
index- the index to add beforeobj- the element to add
-
doAdd
protected boolean doAdd(int index, long element) 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. -
doAddSplitLongBlock
private void doAddSplitLongBlock(int index, long element, int pos, LongBigList.LongBlock newLongBlock) -
modify
Modify relativePosition of all nodes starting from the specified node.- Parameters:
node- node whose position value must be changedmodify- modify value (>0 for add, invalid input: '<'0 for delete)
-
modifyLeftNode
-
modifyRightNode
-
doRemove
-
doAddAll
Description copied from class:ILongListHelper method for adding multiple elements to the list. This default implementation calls doAdd() for adding each element. -
doAddAllTail
-
doAddAllHead
-
doAddAllMiddle
-
doClear
protected void doClear() -
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
-
doRemoveAll2
private void doRemoveAll2(int index, int len, int startPos, LongBigList.LongBlockNode startNode, LongBigList.LongBlockNode endNode) -
merge
Merge the specified node with the left or right neighbor if possible.- Parameters:
node- candidate node for merge
-
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. -
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
-
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
-
trimToSize
public void trimToSize()Pack as many elements in the blocks as allowed. An application can use this operation to minimize the storage of an instance.- Specified by:
trimToSizein classILongList
-
doCreate
Description copied from class:ILongListCreate list with specified capacity. -
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:
-
writeObject
Serialize a LongBigList object.- Parameters:
oos- output stream for serialization- Throws:
IOException- if serialization fails
-
readObject
Deserialize a LongBigList object.- Parameters:
ois- input stream for serialization- Throws:
IOException- if serialization failsClassNotFoundException- if serialization fails
-
checkNode
-
checkHeight
-
check
private void check()
-