Class ShortBigList
java.lang.Object
org.magicwerk.brownies.collections.primitive.IShortList
org.magicwerk.brownies.collections.primitive.ShortBigList
- All Implemented Interfaces:
Serializable,Cloneable,IShortListable
- Direct Known Subclasses:
ShortBigList.ReadOnlyShortBigList
ShortBigList 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 ShortBigList 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 ShortBigList 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 TypeClassDescriptionprotected static classA read-only version of.invalid reference
Key1List(package private) static classA block stores in maximum blockSize number of elements.(package private) static classImplements an AVLNode storing a ShortBlock.Nested classes/interfaces inherited from class org.magicwerk.brownies.collections.primitive.IShortList
IShortList.IShortListableFromArray, IShortList.IShortListableFromCollection, IShortList.IShortListableFromList, IShortList.IShortListableFromMult -
Field Summary
FieldsModifier and TypeFieldDescriptionprivate intNumber of elements stored at maximum in a blockprivate static final booleanSet to true for debugging during developingprivate intModify value which must be applied before this block is not current any moreprivate ShortBigList.ShortBlockNodeCurrent nodeprivate intEnd index of current blockprivate intStart index of current blockprivate static final intDefault block sizeprivate static final ShortBigListUnmodifiable 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 ShortBigList.ShortBlockNodeThe root node in the treeprivate static final longUID for serializationprivate intNumber of elements stored in this ShortBigList -
Constructor Summary
ConstructorsModifierConstructorDescriptionDefault constructor.protectedShortBigList(boolean copy, ShortBigList that) Constructor used internally, e.g.ShortBigList(int blockSize) Constructor.privateShortBigList(int blockSize, int firstShortBlockSize) Internal constructor.ShortBigList(Collection<Short> coll) Create new list with specified elements. -
Method Summary
Modifier and TypeMethodDescriptionprivate voidaddShortBlock(int index, ShortBigList.ShortBlock obj) Adds a new element to the list.intbinarySearch(int index, int len, short key) Searches the specified range for an object using the binary search algorithm.intReturns block size used for this ShortBigList.intcapacity()As ShortBigList 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 ShortBigList.ShortBlockNodeCreate a copy of the specified node.static ShortBigListcreate()static ShortBigListcreate(short... elems) Create new list with specified elements.static ShortBigListcreate(Collection<Short> coll) Create new list with specified elements.crop()Returns a copy this list but without elements.protected booleandoAdd(int index, short element) Helper method for adding an element to the list.protected booleandoAddAll(int index, IShortListable list) Helper method for adding multiple elements to the list.private voiddoAddAllHead(IShortListable list, int addPos, int addLen, int space) private voiddoAddAllMiddle(IShortListable list, int addPos) private voiddoAddAllTail(IShortListable list, int addPos, int addLen, int space) private voiddoAddSplitShortBlock(int index, short element, int pos, ShortBigList.ShortBlock newShortBlock) protected voiddoAssign(IShortList that) Assign this list the content of the that list.protected voiddoClear()protected voiddoClone(IShortList that) Initialize this object after the bitwise copy has been made by Object.clone().protected IShortListdoCreate(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 shortdoGet(int index) Helper method for getting an element from the list.private voiddoGetShortBlock(int index, int modify) Determine node/block for the specified index.private booleandoGetShortBlockLeft(int modify, ShortBigList.ShortBlockNode nextNode, boolean wasLeft) private booleandoGetShortBlockRight(int modify, ShortBigList.ShortBlockNode nextNode, boolean wasLeft) private voiddoInit(int blockSize, int firstShortBlockSize) Initialize ShortBigList.protected shortdoRemove(int index) Helper method to remove an element.private ShortBigList.ShortBlockNodeprotected voiddoRemoveAll(int index, int len) Remove specified range of elements from list.private voiddoRemoveAll2(int index, int len, int startPos, ShortBigList.ShortBlockNode startNode, ShortBigList.ShortBlockNode endNode) protected shortdoReSet(int index, short elem) Sets an element at specified position.protected shortdoSet(int index, short elem) Helper method for setting an element in the list.static ShortBigListEMPTY()protected voidfinalize()shortprivate intgetShortBlockIndex(int index, boolean write, int modify) Returns index in block where the element with specified index is located.private intgetShortBlockIndex2(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(ShortBigList.ShortBlockNode node, int modify) Modify relativePosition of all nodes starting from the specified node.private voidmodifyLeftNode(ShortBigList.ShortBlockNode node, int modify) private voidmodifyRightNode(ShortBigList.ShortBlockNode node, int modify) private voidDeserialize a ShortBigList 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 ShortBigList object.Methods inherited from class org.magicwerk.brownies.collections.primitive.IShortList
add, add, addAll, addAll, addAll, addAll, addArray, addArray, addArray, addArray, addFirst, addIfAbsent, addLast, addMult, addMult, asIShortListable, 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 ShortBigList -
rootNode
The root node in the tree -
currNode
Current node -
currShortBlockStart
private int currShortBlockStartStart index of current block -
currShortBlockEnd
private int currShortBlockEndEnd index of current block -
currModify
private int currModifyModify value which must be applied before this block is not current any more
-
-
Constructor Details
-
ShortBigList
Constructor used internally, e.g. for ImmutableShortBigList.- Parameters:
copy- true to copy all instance values from source, if false nothing is donethat- list to copy
-
ShortBigList
public ShortBigList()Default constructor. The default block size is used. -
ShortBigList
public ShortBigList(int blockSize) Constructor.- Parameters:
blockSize- block size
-
ShortBigList
Create new list with specified elements.- Parameters:
coll- collection with element
-
ShortBigList
private ShortBigList(int blockSize, int firstShortBlockSize) Internal constructor.- Parameters:
blockSize- default block sizefirstShortBlockSize- 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 ShortBigList.- Returns:
- block size used for this ShortBigList
-
doInit
private void doInit(int blockSize, int firstShortBlockSize) Initialize ShortBigList.- Parameters:
blockSize- default block sizefirstShortBlockSize- block size of first block
-
crop
Description copied from class:IShortListReturns a copy this list but without elements. The new list will have the same type as this list.- Overrides:
cropin classIShortList- Returns:
- an empty copy of this list
-
isReadOnly
public boolean isReadOnly()Description copied from class:IShortListReturns true if this list is either unmodifiable or immutable, false otherwise.- Specified by:
isReadOnlyin classIShortList
-
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.
- Specified by:
copyin classIShortList- Returns:
- a modifiable copy of this list
-
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. UseIShortList.copy()to .The copy is realized by a copy-on-write approach so also really large lists can efficiently be handled.
- Overrides:
clonein classIShortList- Returns:
- a modifiable copy of this list
-
doAssign
Description copied from class:IShortListAssign 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 classIShortList- Parameters:
that- list to copy content from
-
doClone
Description copied from class:IShortListInitialize this object after the bitwise copy has been made by Object.clone().- Specified by:
doClonein classIShortList- Parameters:
that- source object
-
copy
Create a copy of the specified node.- Parameters:
node- source node- Returns:
- newly created copy of source
-
getDefaultElem
public short getDefaultElem()- Specified by:
getDefaultElemin classIShortList
-
finalize
protected void finalize() -
size
public int size()- Specified by:
sizein interfaceIShortListable- Specified by:
sizein classIShortList
-
capacity
public int capacity()As ShortBigList grows and shrinks automatically, the term capacity does not really make sense. Therefore always -1 is returned.- Specified by:
capacityin classIShortList- Returns:
- capacity of this list
-
doGet
protected short doGet(int index) Description copied from class:IShortListHelper 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 classIShortList- Parameters:
index- index of element to return- Returns:
- the element at the specified position in this list
-
doSet
protected short doSet(int index, short elem) Description copied from class:IShortListHelper 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 classIShortList- Parameters:
index- index where element will be placedelem- element to set- Returns:
- old element which was at the position
-
doReSet
protected short doReSet(int index, short elem) Description copied from class:IShortListSets 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 classIShortList- Parameters:
index- index where element will be placedelem- element to set- Returns:
- old element which was at the position
-
releaseShortBlock
private void releaseShortBlock()Release current block and apply modification if pending. -
getShortBlockIndex
private int getShortBlockIndex(int index, boolean write, int modify) Returns index in block where the element with specified index is located. This method also sets currShortBlock 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
-
getShortBlockIndex2
private int getShortBlockIndex2(int index, boolean write, int modify) -
isOnlyRootShortBlock
private boolean isOnlyRootShortBlock()- Returns:
- true if there is only the root block, false otherwise
-
doGetShortBlock
private void doGetShortBlock(int index, int modify) Determine node/block for the specified index. The fields currNode, currShortBlockStart, and currShortBlockEnd 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)
-
doGetShortBlockLeft
private boolean doGetShortBlockLeft(int modify, ShortBigList.ShortBlockNode nextNode, boolean wasLeft) -
doGetShortBlockRight
private boolean doGetShortBlockRight(int modify, ShortBigList.ShortBlockNode nextNode, boolean wasLeft) -
addShortBlock
Adds a new element to the list.- Parameters:
index- the index to add beforeobj- the element to add
-
doAdd
protected boolean doAdd(int index, short element) Description copied from class:IShortListHelper 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 classIShortList- Parameters:
index- index where element should be added (-1 means it is up to the implementation to choose the index)element- element to add- Returns:
- true if element has been added, false otherwise
-
doAddSplitShortBlock
private void doAddSplitShortBlock(int index, short element, int pos, ShortBigList.ShortBlock newShortBlock) -
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:IShortListHelper method for adding multiple elements to the list. This default implementation calls doAdd() for adding each element.- Overrides:
doAddAllin classIShortList- Parameters:
index- index where element should be added (-1 is valid for adding at the end)list- list with elements to add- Returns:
- true if elements have been added, false otherwise
-
doAddAllTail
-
doAddAllHead
-
doAddAllMiddle
-
doClear
protected void doClear()- Overrides:
doClearin classIShortList
-
doRemoveAll
protected void doRemoveAll(int index, int len) Description copied from class:IShortListRemove specified range of elements from list.- Overrides:
doRemoveAllin classIShortList- Parameters:
index- index of first element to removelen- number of elements to remove
-
doRemoveAll2
private void doRemoveAll2(int index, int len, int startPos, ShortBigList.ShortBlockNode startNode, ShortBigList.ShortBlockNode endNode) -
merge
Merge the specified node with the left or right neighbor if possible.- Parameters:
node- candidate node for merge
-
doRemove
protected short doRemove(int index) Description copied from class:IShortListHelper 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 classIShortList- Parameters:
index- index of element to remove- Returns:
- removed element
-
unmodifiableList
- Specified by:
unmodifiableListin classIShortList
-
immutableList
Description copied from class:IShortListReturns 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. SeeIShortList.unmodifiableList()to get unmodifiable view of a list.- Specified by:
immutableListin classIShortList- Returns:
- an immutable copy of the specified list
-
doEnsureCapacity
protected void doEnsureCapacity(int minCapacity) Description copied from class:IShortListIncreases 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 classIShortList- 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 classIShortList
-
doCreate
Description copied from class:IShortListCreate list with specified capacity.- Specified by:
doCreatein classIShortList- Parameters:
capacity- initial capacity (use -1 for default capacity)- Returns:
- created list
-
sort
public void sort(int index, int len) Description copied from class:IShortListSort specified elements in the list using the specified comparator.- Specified by:
sortin classIShortList- Parameters:
index- index of first element to sortlen- number of elements to sort- See Also:
-
binarySearch
public int binarySearch(int index, int len, short key) Description copied from class:IShortListSearches 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 classIShortList- 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 ShortBigList object.- Parameters:
oos- output stream for serialization- Throws:
IOException- if serialization fails
-
readObject
Deserialize a ShortBigList object.- Parameters:
ois- input stream for serialization- Throws:
IOException- if serialization failsClassNotFoundException- if serialization fails
-
checkNode
-
checkHeight
-
check
private void check()
-