org.magicwerk.brownies.collections.primitive

Class ByteGapList

java.lang.Object

org.magicwerk.brownies.collections.primitive.IByteList

org.magicwerk.brownies.collections.primitive.ByteGapList

All Implemented Interfaces:

java.io.Serializable, java.lang.Cloneable

public class ByteGapList
extends IByteList

ByteGapList 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.

Note that this implementation is not synchronized.

Version:

$Id: ByteGapList.java 2242 2014-04-15 23:22:41Z origo $

Author:

Thomas Mauch

See Also:

List, ArrayList, LinkedList, Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
static int	DEFAULT_CAPACITY Default capacity for list

Constructor Summary

Constructors

Constructor and Description
ByteGapList() Construct a list with the default initial capacity.
ByteGapList(byte... elems) Construct a list to contain the specified elements.
ByteGapList(java.util.Collection<java.lang.Byte> coll) Construct a list to contain the specified elements.
ByteGapList(int capacity) Construct a list with specified initial capacity.

Method Summary

Methods

Modifier and Type	Method and Description
boolean	add(byte elem)
void	add(int index, byte elem)
int	binarySearch(int index, int len, byte key) Searches the specified range for an object using the binary search algorithm.
int	capacity() Returns capacity of this GapList.
ByteGapList	copy() Returns a shallow copy of this GapList instance (the new list will contain the same elements as the source list, i.e. the elements themselves are not copied).
static ByteGapList	create() Create new list.
static ByteGapList	create(byte... elems) Create new list with specified elements.
static ByteGapList	create(java.util.Collection<java.lang.Byte> coll) Create new list with specified elements.
static ByteGapList	create(int capacity) Create new list with specified capacity.
IByteList	doCreate(int capacity) Create list with specified capacity.
static ByteGapList	EMPTY()
byte	get(int index)
ByteGapList	getAll(byte elem) Returns all elements in the list equal to the specified element.
ByteGapList	getAll(int index, int len) Returns specified range of elements from list.
byte	getDefaultElem()
void	init() Initialize the list to be empty.
void	init(byte... elems) Initialize the list to contain the specified elements only.
void	init(java.util.Collection<java.lang.Byte> coll) Initialize the list to contain the specified elements only.
void	init(int capacity) Initialize the list to be empty with specified initial capacity.
<R> GapList<R>	mappedList(Mapper<java.lang.Byte,R> mapper) Create a new list by applying the specified mapper to all elements.
byte	remove(int index)
int	size()
void	sort(int index, int len) Sort specified elements in the list using the specified comparator.
void	trimToSize() Trims the capacity of this GapList instance to be the list's current size.
ByteGapList	unmodifiableList() Returns an unmodifiable view of this list.

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

addAll, addAll, addAll, addAll, addAll, addAll, addFirst, addIfAbsent, addLast, binarySearch, clear, clone, contains, containsAll, containsAny, copy, copy, drag, element, ensureCapacity, equals, fill, fill, filter, getArray, getCount, getDistinct, getFirst, getLast, hashCode, indexOf, init, isEmpty, lastIndexOf, move, move, offer, offerFirst, offerLast, peek, peekFirst, peekLast, poll, pollFirst, pollLast, pop, push, remove, remove, removeAll, removeAll, removeAll, removeElem, removeFirst, removeFirstOccurrence, removeLast, removeLastOccurrence, resize, retainAll, retainAll, reverse, reverse, rotate, rotate, set, setAll, setAll, setAll, sort, swap, swap, toArray, toArray, toArray, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Field Detail

DEFAULT_CAPACITY

public static final int DEFAULT_CAPACITY

Default capacity for list

See Also:

Constant Field Values

Constructor Detail

ByteGapList

public ByteGapList()

Construct a list with the default initial capacity.

ByteGapList

public ByteGapList(int capacity)

Construct a list with specified initial capacity.

Parameters:

capacity - capacity

ByteGapList

public ByteGapList(java.util.Collection<java.lang.Byte> 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

ByteGapList

public ByteGapList(byte... elems)

Construct a list to contain the specified elements. The list will have an initial capacity to hold these elements.

Parameters:

elems - array with elements

Method Detail

EMPTY

public static ByteGapList EMPTY()

Returns:

unmodifiable empty instance

create

public static ByteGapList create()

Create new list.

Parameters:

type - of elements stored in the list

Returns:

created list

create

public static ByteGapList create(int capacity)

Create new list with specified capacity.

Parameters:

capacity - capacity

type - of elements stored in the list

Returns:

created list

create

public static ByteGapList create(java.util.Collection<java.lang.Byte> 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 ByteGapList create(byte... elems)

Create new list with specified elements.

Parameters:

elems - array with elements

type - of elements stored in the list

Returns:

created list

init

public void init()

Initialize the list to be empty. The list will have the default initial capacity.

init

public void init(int capacity)

Initialize the list to be empty with specified initial capacity.

Parameters:

capacity - capacity

init

public void init(java.util.Collection<java.lang.Byte> 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

public void init(byte... 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 byte getDefaultElem()

copy

public ByteGapList copy()

Description copied from class: IByteList

Returns a shallow copy of this GapList instance (the new list will contain the same elements as the source list, i.e. the elements themselves are not copied). This method is identical to clone() except that the result is casted to GapList.

Overrides:

copy in class IByteList

Returns:

a clone of this instance

See Also:

IByteList.clone()

unmodifiableList

public ByteGapList unmodifiableList()

Description copied from class: IByteList

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 IByteList

Returns:

an unmodifiable view of the specified list

size

public int size()

Specified by:

size in class IByteList

capacity

public int capacity()

Description copied from class: IByteList

Returns capacity of this GapList. Note that two GapLists are considered equal even if they have a distinct capacity. Also the capacity can be changed by operations like clone() etc.

Specified by:

capacity in class IByteList

Returns:

capacity of this GapList

get

public byte get(int index)

Overrides:

get in class IByteList

add

public boolean add(byte elem)

Overrides:

add in class IByteList

add

public void add(int index,
       byte elem)

Overrides:

add in class IByteList

getAll

public ByteGapList getAll(int index,
                 int len)

Description copied from class: IByteList

Returns specified range of elements from list.

Overrides:

getAll in class IByteList

Parameters:

index - index of first element to retrieve

len - number of elements to retrieve

Returns:

GapList containing the specified range of elements from list

getAll

public ByteGapList getAll(byte elem)

Description copied from class: IByteList

Returns all elements in the list equal to the specified element.

Overrides:

getAll in class IByteList

Parameters:

elem - element to look for

Returns:

all elements in the list equal to the specified element

mappedList

public <R> GapList<R> mappedList(Mapper<java.lang.Byte,R> mapper)

Description copied from class: IByteList

Create a new list by applying the specified mapper to all elements.

Overrides:

mappedList in class IByteList

Parameters:

mapper - mapper function

Returns:

created list

remove

public byte remove(int index)

Overrides:

remove in class IByteList

trimToSize

public void trimToSize()

Description copied from class: IByteList

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 GapList instance.

Specified by:

trimToSize in class IByteList

doCreate

public IByteList doCreate(int capacity)

Description copied from class: IByteList

Create list with specified capacity.

Parameters:

capacity - initial capacity (use -1 for default capacity)

Returns:

created list

sort

public void sort(int index,
        int len)

Description copied from class: IByteList

Sort specified elements in the list using the specified comparator.

Specified by:

sort in class IByteList

Parameters:

index - index of first element to sort

len - number of elements to sort

See Also:

Arrays.sort(long[])

binarySearch

public int binarySearch(int index,
               int len,
               byte key)

Description copied from class: IByteList

Searches the specified range for an object using the binary search algorithm.

Specified by:

binarySearch in class IByteList

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)