Package org.eclipse.sisu.inject

Class RankedSequence<T>

java.lang.Object

java.util.concurrent.atomic.AtomicReference<RankedSequence.Content>

org.eclipse.sisu.inject.RankedSequence<T>

All Implemented Interfaces:

Serializable, Iterable<T>

final class RankedSequence<T>
extends AtomicReference<RankedSequence.Content>
implements Iterable<T>

Ordered List that arranges elements by descending rank; supports concurrent iteration and modification.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
(package private) static final class	RankedSequence.Content	Represents an immutable snapshot of ranked elements.
(package private) final class	RankedSequence.Itr	Custom Iterator that copes with modification by repositioning itself in the updated list.

Field Summary

Fields

Modifier and Type	Field	Description
private static final long	serialVersionUID

Constructor Summary

Constructors

Constructor	Description
RankedSequence()
RankedSequence(RankedSequence<T> sequence)

Method Summary

Modifier and Type	Method	Description
void	clear()
boolean	contains(Object element)
boolean	containsThis(Object element)
void	insert(T element, int rank)	Inserts the given element into the ordered list, using the assigned rank as a guide.
boolean	isEmpty()
RankedSequence<T>.Itr	iterator()
T	peek()
(package private) static long	rank2uid(int rank, int uniq)	Turns the given (potentially non-unique) rank into a unique id by appending a counter.
T	remove(Object element)
boolean	removeThis(T element)
(package private) static int	safeBinarySearch(long[] uids, long uid)	Finds the insertion point with the nearest UID, regardless of whether the UID is in the list or not.
int	size()
Iterable<T>	snapshot()
(package private) static int	uid2rank(long uid)	Extracts the original (potentially non-unique) assigned rank from the given unique id.

Methods inherited from class java.util.concurrent.atomic.AtomicReference

accumulateAndGet, compareAndExchange, compareAndExchangeAcquire, compareAndExchangeRelease, compareAndSet, get, getAcquire, getAndAccumulate, getAndSet, getAndUpdate, getOpaque, getPlain, lazySet, set, setOpaque, setPlain, setRelease, toString, updateAndGet, weakCompareAndSet, weakCompareAndSetAcquire, weakCompareAndSetPlain, weakCompareAndSetRelease, weakCompareAndSetVolatile

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Details

serialVersionUID

private static final long serialVersionUID

See Also:

• Constant Field Values

Constructor Details

RankedSequence

RankedSequence()

RankedSequence

RankedSequence(RankedSequence<T> sequence)

Method Details

insert

public void insert(T element,
 int rank)

Inserts the given element into the ordered list, using the assigned rank as a guide.

The rank can be any value from Integer.MIN_VALUE to Integer.MAX_VALUE.

Parameters:

element - The element to insert

rank - The assigned rank

peek

public T peek()

contains

public boolean contains(Object element)

containsThis

public boolean containsThis(Object element)

remove

public T remove(Object element)

removeThis

public boolean removeThis(T element)

snapshot

public Iterable<T> snapshot()

clear

public void clear()

isEmpty

public boolean isEmpty()

size

public int size()

iterator

public RankedSequence<T>.Itr iterator()

Specified by:

iterator in interface Iterable<T>

rank2uid

static long rank2uid(int rank,
 int uniq)

Turns the given (potentially non-unique) rank into a unique id by appending a counter.

Parameters:

rank - The assigned rank

uniq - The unique counter

Returns:

The unique id

uid2rank

static int uid2rank(long uid)

Extracts the original (potentially non-unique) assigned rank from the given unique id.

Parameters:

uid - The unique id

Returns:

Assigned rank

safeBinarySearch

static int safeBinarySearch(long[] uids,
 long uid)

Finds the insertion point with the nearest UID, regardless of whether the UID is in the list or not.

Unlike Arrays.binarySearch(long[], long) this will always return a number from zero to size() inclusive.

Parameters:

uids - The UIDs array

uid - The UID to find

Returns:

Index with nearest UID