Package com.linkedin.venice.utils

Class SparseConcurrentListWithOffset<E>

java.lang.Object

java.util.concurrent.CopyOnWriteArrayList<E>

com.linkedin.venice.utils.SparseConcurrentList<E>

com.linkedin.venice.utils.SparseConcurrentListWithOffset<E>

All Implemented Interfaces:

Serializable, Cloneable, Iterable<E>, Collection<E>, List<E>, RandomAccess

public class SparseConcurrentListWithOffset<E>
extends SparseConcurrentList<E>

A very simple subclass of SparseConcurrentList which adds some immutable offset to all index. Useful for cases where the list needs to contain negative indices. A more fancy version where the offset adjusts dynamically based on the indices it needs to contain would be interesting, but more complex. It would likely require starting from scratch, as the facilities provided by CopyOnWriteArrayList may be insufficient to achieve correct/efficient synchronization.

See Also:

• Serialized Form

Constructor Summary

Constructors

Constructor	Description
SparseConcurrentListWithOffset(int offset)

Method Summary

Modifier and Type	Method	Description
void	add(int index, E element)
boolean	addAll(int index, Collection<? extends E> c)
boolean	equals(Object o)
E	get(int index)
int	hashCode()
int	indexOf(E e, int index)
int	lastIndexOf(E e, int index)
ListIterator<E>	listIterator(int index)
E	remove(int index)	A function which behaves like Map.remove(Object), rather than List.remove(int), in the sense that it removes the item from the collection, returns the previous value (if any), but *does not* shift subsequent items to the left (as the regular List.remove(int) would.
E	set(int index, E item)	A function which behaves like Map.put(Object, Object), rather than List.set(int, Object).
List<E>	subList(int fromIndex, int toIndex)

Methods inherited from class com.linkedin.venice.utils.SparseConcurrentList

add, addAll, addAllAbsent, clear, computeIfAbsent, forEach, isEmpty, nonNullSize, remove, removeAll, removeIf, replaceAll, retainAll, sort, values

Methods inherited from class java.util.concurrent.CopyOnWriteArrayList

addIfAbsent, clone, contains, containsAll, indexOf, iterator, lastIndexOf, listIterator, size, spliterator, toArray, toArray, toString

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Collection

parallelStream, stream, toArray

Constructor Details

SparseConcurrentListWithOffset

public SparseConcurrentListWithOffset(int offset)

Method Details

add

public void add(int index,
 E element)

Specified by:

add in interface List<E>

Overrides:

add in class SparseConcurrentList<E>

addAll

public boolean addAll(int index,
 Collection<? extends E> c)

Specified by:

addAll in interface List<E>

Overrides:

addAll in class SparseConcurrentList<E>

get

public E get(int index)

Specified by:

get in interface List<E>

Overrides:

get in class SparseConcurrentList<E>

Parameters:

index - of the item to retrieve

Returns:

the item at this index, or null

indexOf

public int indexOf(E e,
 int index)

Overrides:

indexOf in class CopyOnWriteArrayList<E>

lastIndexOf

public int lastIndexOf(E e,
 int index)

Overrides:

lastIndexOf in class CopyOnWriteArrayList<E>

listIterator

public ListIterator<E> listIterator(int index)

Specified by:

listIterator in interface List<E>

Overrides:

listIterator in class CopyOnWriteArrayList<E>

remove

public E remove(int index)

Description copied from class: SparseConcurrentList

A function which behaves like Map.remove(Object), rather than List.remove(int), in the sense that it removes the item from the collection, returns the previous value (if any), but *does not* shift subsequent items to the left (as the regular List.remove(int) would.

Specified by:

remove in interface List<E>

Overrides:

remove in class SparseConcurrentList<E>

Parameters:

index - of the item to nullify

Returns:

the previous item at that

set

public E set(int index,
 E item)

Description copied from class: SparseConcurrentList

A function which behaves like Map.put(Object, Object), rather than List.set(int, Object).

Specified by:

set in interface List<E>

Overrides:

set in class SparseConcurrentList<E>

subList

public List<E> subList(int fromIndex,
 int toIndex)

Specified by:

subList in interface List<E>

Overrides:

subList in class SparseConcurrentList<E>

equals

public boolean equals(Object o)

Specified by:

equals in interface Collection<E>

Specified by:

equals in interface List<E>

Overrides:

equals in class CopyOnWriteArrayList<E>

hashCode

public int hashCode()

Specified by:

hashCode in interface Collection<E>

Specified by:

hashCode in interface List<E>

Overrides:

hashCode in class CopyOnWriteArrayList<E>