ShortBigList

java.lang.Object
- org.magicwerk.brownies.collections.primitive.IShortList
- - org.magicwerk.brownies.collections.primitive.ShortBigList

All Implemented Interfaces:

java.io.Serializable, java.lang.Cloneable
```
public class ShortBigList
extends IShortList
```
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.

Version:

$Id: ShortBigList.java 3408 2016-12-06 00:20:45Z origo $

Author:

Thomas Mauch

See Also:

Serialized Form

Constructor Summary

Constructors
Constructor and Description
`ShortBigList()` Default constructor.
`ShortBigList(java.util.Collection<java.lang.Short> coll)` Create new list with specified elements.
`ShortBigList(int blockSize)` Constructor.

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`int`	`binarySearch(int index, int len, short key)` Searches the specified range for an object using the binary search algorithm.
`int`	`blockSize()` Returns block size used for this ShortBigList.
`int`	`capacity()` As ShortBigList grows and shrinks automatically, the term capacity does not really make sense.
`java.lang.Object`	`clone()` Returns a shallow copy of this `ShortBigList` instance The copy is realized by a copy-on-write approach so also really large lists can efficiently be copied.
`ShortBigList`	`copy()` Returns a copy of this `ShortBigList` instance.
`static ShortBigList`	`create()` Create new list.
`static ShortBigList`	`create(java.util.Collection<java.lang.Short> coll)` Create new list with specified elements.
`static ShortBigList`	`create(short... elems)` Create new list with specified elements.
`static ShortBigList`	`EMPTY()`
`short`	`getDefaultElem()`
`static IShortList`	`of(java.util.List<java.lang.Short> values)`
`static IShortList`	`of(short[] values)`
`static IShortList`	`of(java.lang.Short[] values)`
`int`	`size()`
`void`	`sort(int index, int len)` Sort specified elements in the list using the specified comparator.
`void`	`trimToSize()` Pack as many elements in the blocks as allowed.
`ShortBigList`	`unmodifiableList()` Returns an unmodifiable view of this list.

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, binarySearch, clear, contains, containsAll, containsAny, containsIf, copy, drag, element, ensureCapacity, equals, extract, extractIf, fill, filter, filteredList, get, getAll, getAll, getCount, getDistinct, getFirst, getIf, getLast, getSingle, getSingleOrEmpty, hashCode, indexOf, indexOf, indexOfIf, initAll, initAll, initArray, initMult, isEmpty, lastIndexOf, lastIndexOf, mappedList, 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, replaceAll, replaceAll, replaceArray, replaceMult, resize, retainAll, retainAll, retainIf, reverse, reverse, rotate, rotate, set, setAll, setAll, setArray, setArray, setMult, sort, swap, toArray, toArray, toArray, toArray, toArray, toArray, toString, transferCopy, transferMove, transferRemove, transferSwap, transform, transformedList

Methods inherited from class java.lang.Object
getClass, notify, notifyAll, wait, wait, wait

- Constructor Detail
  - ShortBigList
```
public ShortBigList()
```
    Default constructor. The default block size is used.
  - ShortBigList
```
public ShortBigList(int blockSize)
```
    Constructor.
    
    Parameters:
    
    blockSize - block size
  - ShortBigList
```
public ShortBigList(java.util.Collection<java.lang.Short> coll)
```
    Create new list with specified elements.
    
    Parameters:
    
    coll - collection with element
- Method Detail
  - of
```
public static IShortList of(short[] values)
```
  - of
```
public static IShortList of(java.lang.Short[] values)
```
  - of
```
public static IShortList of(java.util.List<java.lang.Short> values)
```
  - EMPTY
```
public static ShortBigList EMPTY()
```
    Returns:
    
    unmodifiable empty instance
  - create
```
public static ShortBigList create()
```
    Create new list.
    
    Parameters:
    
    type - of elements stored in the list
    
    Returns:
    
    created list
  - create
```
public static ShortBigList create(java.util.Collection<java.lang.Short> coll)
```
    Create new list with specified elements.
    
    Parameters:
    
    coll - collection with element
    
    type - of elements stored in the list
    
    Returns:
    
    created list
  - create
```
public static ShortBigList create(short... elems)
```
    Create new list with specified elements.
    
    Parameters:
    
    elems - array with elements
    
    type - 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
  - copy
```
public ShortBigList copy()
```
    Returns a copy of this ShortBigList instance. The copy is realized by a copy-on-write approach so also really large lists can efficiently be copied. This method is identical to clone() except that the result is casted to ShortBigList.
    
    Overrides:
    
    copy in class IShortList
    
    Returns:
    
    a copy of this ShortBigList instance
    
    See Also:
    
    IShortList.clone()
  - clone
```
public java.lang.Object clone()
```
    Returns a shallow copy of this ShortBigList instance The copy is realized by a copy-on-write approach so also really large lists can efficiently be copied.
    
    Overrides:
    
    clone in class IShortList
    
    Returns:
    
    a copy of this ShortBigList instance
  - getDefaultElem
```
public short getDefaultElem()
```
  - size
```
public int size()
```
    Specified by:
    
    size in class IShortList
  - 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:
    
    capacity in class IShortList
    
    Returns:
    
    capacity of this list
  - unmodifiableList
```
public ShortBigList unmodifiableList()
```
    Description copied from class: IShortList
    
    Returns an unmodifiable view of this list. This method allows modules to provide users with "read-only" access to internal lists. Query operations on the returned list "read through" to the specified list, and attempts to modify the returned list, whether direct or via its iterator, result in an UnsupportedOperationException.
    
    Specified by:
    
    unmodifiableList in class IShortList
    
    Returns:
    
    an unmodifiable view of the specified list
  - 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:
    
    trimToSize in class IShortList
  - sort
```
public void sort(int index,
                 int len)
```
    Description copied from class: IShortList
    
    Sort specified elements in the list using the specified comparator.
    
    Specified by:
    
    sort in class IShortList
    
    Parameters:
    
    index - index of first element to sort
    
    len - number of elements to sort
    
    See Also:
    
    Arrays.sort(int[])
  - binarySearch
```
public int binarySearch(int index,
                        int len,
                        short key)
```
    Description copied from class: IShortList
    
    Searches the specified range for an object using the binary search algorithm.
    
    Specified by:
    
    binarySearch in class IShortList
    
    Parameters:
    
    index - index of first element to search
    
    len - number of elements to search
    
    key - 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:
    
    Arrays.binarySearch(long[], long)

Class ShortBigList

Constructor Summary

Method Summary

Methods inherited from class org.magicwerk.brownies.collections.primitive.IShortList

Methods inherited from class java.lang.Object

Constructor Detail

ShortBigList

ShortBigList

ShortBigList

Method Detail

of

of

of

EMPTY

create

create

create

blockSize

copy

clone

getDefaultElem

size

capacity

unmodifiableList

trimToSize

sort

binarySearch