Package jadex.collection

Class RwLinkedListWrapper<T>

java.lang.Object

jadex.collection.RwListWrapper<T>

jadex.collection.RwLinkedListWrapper<T>

All Implemented Interfaces:

IRwDataStructure, Iterable<T>, Collection<T>, Deque<T>, List<T>, Queue<T>

public class RwLinkedListWrapper<T>
extends RwListWrapper<T>
implements Deque<T>

Field Summary

Fields inherited from class jadex.collection.RwListWrapper

list

Constructor Summary

Constructors

Constructor	Description
RwLinkedListWrapper(LinkedList<T> list)	Creates the list wrapper.
RwLinkedListWrapper(LinkedList<T> list, ReadWriteLock lock)	Creates the list wrapper with a specific internal lock.

Method Summary

Modifier and Type	Method	Description
void	addFirst(T e)	Adds an element to the beginning of the list.
void	addLast(T e)	Adds an element to the end of the list.
Iterator<T>	descendingIterator()
T	element()	Gets an element from the head of the list.
T	getFirst()	Gets first list element.
T	getLast()	Gets last list element.
boolean	offer(T e)	Inserts the specified element.
boolean	offerFirst(T e)	Adds the element at the end unless it would violate capacity restrictions.
boolean	offerLast(T e)	Adds the element at the end unless it would violate capacity restrictions.
T	peek()	Gets an element from the head of the list.
T	peekFirst()	Gets first list element.
T	peekLast()	Gets last list element.
T	poll()	Removes an element from the head of the list.
T	pollFirst()	Removes the element from the beginning, returns null if this list is empty.
T	pollLast()	Removes the element from the end, returns null if this list is empty.
T	pop()	Pops an element from the head of the list.
void	push(T e)	Pushes an element to the head of the list.
T	remove()	Removes an element from the head of the list.
T	removeFirst()	Removes the element from the beginning.
boolean	removeFirstOccurrence(Object o)	Removes the first occurrence of an element.
T	removeLast()	Removes the last element in the list.
boolean	removeLastOccurrence(Object o)	Removes the last occurrence of an element.
LinkedList<T>	reversed()	Unimplemented, here to resolve default method conflict in Java 21 while avoiding reimplementation of functionality in Java 17.

Methods inherited from class jadex.collection.RwListWrapper

add, add, addAll, addAll, clear, contains, containsAll, get, getAutoLock, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, retainAll, set, size, subList, toArray, toArray

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.Collection

parallelStream, removeIf, stream, toArray

Methods inherited from interface java.util.Deque

add, addAll, contains, iterator, remove, size

Methods inherited from interface jadex.collection.IRwDataStructure

getLock, getReadLock, getWriteLock, readLock, writeLock

Methods inherited from interface java.lang.Iterable

forEach

Methods inherited from interface java.util.List

equals, hashCode, replaceAll, sort, spliterator

Constructor Details

RwLinkedListWrapper

public RwLinkedListWrapper(LinkedList<T> list)

Creates the list wrapper.

Parameters:

list - The wrapped List.

RwLinkedListWrapper

public RwLinkedListWrapper(LinkedList<T> list,
 ReadWriteLock lock)

Creates the list wrapper with a specific internal lock.

Parameters:

list - The wrapped List.

Method Details

removeLast

public T removeLast()

Removes the last element in the list.

Specified by:

removeLast in interface Deque<T>

Returns:

Element remove from list.

addFirst

public void addFirst(T e)

Adds an element to the beginning of the list.

Specified by:

addFirst in interface Deque<T>

Parameters:

e - The Element

addLast

public void addLast(T e)

Adds an element to the end of the list.

Specified by:

addLast in interface Deque<T>

Parameters:

e - The Element

offerFirst

public boolean offerFirst(T e)

Adds the element at the end unless it would violate capacity restrictions.

Specified by:

offerFirst in interface Deque<T>

Parameters:

e - The element.

Returns:

True, if the element was added.

offerLast

public boolean offerLast(T e)

Adds the element at the end unless it would violate capacity restrictions.

Specified by:

offerLast in interface Deque<T>

Parameters:

e - The element.

Returns:

True, if the element was added.

removeFirst

public T removeFirst()

Removes the element from the beginning.

Specified by:

removeFirst in interface Deque<T>

Returns:

The element that was removed.

pollFirst

public T pollFirst()

Removes the element from the beginning, returns null if this list is empty.

Specified by:

pollFirst in interface Deque<T>

Returns:

The element that was removed or null.

pollLast

public T pollLast()

Removes the element from the end, returns null if this list is empty.

Specified by:

pollLast in interface Deque<T>

Returns:

The element that was removed or null.

getFirst

public T getFirst()

Gets first list element.

Specified by:

getFirst in interface Deque<T>

Returns:

The element.

getLast

public T getLast()

Gets last list element.

Specified by:

getLast in interface Deque<T>

Returns:

The element.

peekFirst

public T peekFirst()

Gets first list element.

Specified by:

peekFirst in interface Deque<T>

Returns:

The element, null if list is empty.

peekLast

public T peekLast()

Gets last list element.

Specified by:

peekLast in interface Deque<T>

Returns:

The element, null if list is empty.

removeFirstOccurrence

public boolean removeFirstOccurrence(Object o)

Removes the first occurrence of an element.

Specified by:

removeFirstOccurrence in interface Deque<T>

Parameters:

o - Object being removed

Returns:

True, if removed.

removeLastOccurrence

public boolean removeLastOccurrence(Object o)

Removes the last occurrence of an element.

Specified by:

removeLastOccurrence in interface Deque<T>

Parameters:

o - Object being removed

Returns:

True, if removed.

offer

public boolean offer(T e)

Inserts the specified element.

Specified by:

offer in interface Deque<T>

Specified by:

offer in interface Queue<T>

Parameters:

e - The element.

Returns:

True if the element was added.

remove

public T remove()

Removes an element from the head of the list.

Specified by:

remove in interface Deque<T>

Specified by:

remove in interface Queue<T>

Returns:

The element.

poll

public T poll()

Removes an element from the head of the list.

Specified by:

poll in interface Deque<T>

Specified by:

poll in interface Queue<T>

Returns:

The element or null if empty.

element

public T element()

Gets an element from the head of the list.

Specified by:

element in interface Deque<T>

Specified by:

element in interface Queue<T>

Returns:

The element.

peek

public T peek()

Gets an element from the head of the list.

Specified by:

peek in interface Deque<T>

Specified by:

peek in interface Queue<T>

Returns:

The element, null if empty.

push

public void push(T e)

Pushes an element to the head of the list.

Specified by:

push in interface Deque<T>

Parameters:

e - The element.

pop

public T pop()

Pops an element from the head of the list.

Specified by:

pop in interface Deque<T>

Returns:

The element.

descendingIterator

public Iterator<T> descendingIterator()

Specified by:

descendingIterator in interface Deque<T>

reversed

public LinkedList<T> reversed()

Unimplemented, here to resolve default method conflict in Java 21 while avoiding reimplementation of functionality in Java 17.