|
| LinkedList () |
|
| LinkedList (const LinkedList< E > &list) |
|
| LinkedList (const Collection< E > &collection) |
|
virtual | ~LinkedList () |
|
LinkedList< E > & | operator= (const LinkedList< E > &list) |
|
LinkedList< E > & | operator= (const Collection< E > &collection) |
|
bool | operator== (const LinkedList< E > &other) const |
|
bool | operator!= (const LinkedList< E > &other) const |
|
virtual E | get (int index) const |
| Gets the element contained at position passed.- Parameters
-
index | The position to get. |
- Returns
- value at index specified.
- Exceptions
-
IndexOutOfBoundsException | if the index given is less than zero or greater than the List size. |
This implementation first gets a list iterator pointing to the indexed element (with listIterator(index)). Then, it gets the element using ListIterator.next and returns it.
|
|
virtual E | set (int index, const E &element) |
| Replaces the element at the specified position in this list with the specified element.- Parameters
-
index | The index of the element to replace. |
element | The element to be stored at the specified position. |
- Returns
- the element previously at the specified position.
- Exceptions
-
IndexOutOfBoundsException | if the index given is less than zero or greater than the List size. |
UnsupportedOperationExceptio | if this is an unmodifiable collection. |
NullPointerException | if the Collection is a container of pointers and does not allow NULL values. |
IllegalArgumentException | if some property of the element prevents it from being added to this collection |
IllegalStateException | if the element cannot be added at this time due to insertion restrictions. |
This implementation first gets a list iterator pointing to the indexed element (with listIterator(index)). Then, it gets the current element using ListIterator.next and replaces it with ListIterator.set.
|
|
virtual bool | add (const E &value) |
| Returns true if this collection changed as a result of the call.
|
|
virtual void | add (int index, const E &value) |
| Inserts the specified element at the specified position in this list.Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices).- Parameters
-
index | The index at which the specified element is to be inserted. |
element | The element to be inserted in this List. |
- Exceptions
-
IndexOutOfBoundsException | if the index is greater than size of the List. |
UnsupportedOperationExceptio | if this is an unmodifiable collection. |
NullPointerException | if the Collection is a container of pointers and does not allow NULL values. |
IllegalArgumentException | if some property of the element prevents it from being added to this collection |
IllegalStateException | if the element cannot be added at this time due to insertion restrictions. |
This implementation first gets a list iterator pointing to the indexed element (with listIterator(index)). Then, it inserts the specified element with ListIterator.add.
|
|
virtual bool | addAll (const Collection< E > &collection) |
|
virtual bool | addAll (int index, const Collection< E > &collection) |
|
virtual void | copy (const Collection< E > &collection) |
|
virtual bool | remove (const E &value) |
| Removes a single instance of the specified element from the collection.
|
|
virtual E | remove () |
| Gets and removes the element in the head of the queue.
|
|
virtual bool | isEmpty () const |
|
virtual int | size () const |
| Returns the number of elements in this collection.
|
|
virtual void | clear () |
| Removes all of the elements from this collection (optional operation).
|
|
virtual bool | contains (const E &value) const |
| Returns true if this collection contains the specified element.
|
|
virtual int | indexOf (const E &value) const |
| Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
|
virtual int | lastIndexOf (const E &value) const |
| Returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
|
virtual std::vector< E > | toArray () const |
| Returns an array containing all of the elements in this collection.
|
|
virtual bool | offer (const E &value) |
| Inserts the specified element into the queue provided that the condition allows such an operation.
|
|
virtual bool | poll (E &result) |
| Gets and removes the element in the head of the queue.
|
|
virtual bool | peek (E &result) const |
| Gets but not removes the element in the head of the queue.
|
|
virtual E | element () const |
| Gets but not removes the element in the head of the queue.
|
|
virtual void | addFirst (const E &value) |
| Inserts an element onto the front of the Deque if possible without violating the implementations capacity restrictions.
|
|
virtual void | addLast (const E &value) |
| Inserts an element onto the end of the Deque if possible without violating the implementations capacity restrictions.
|
|
virtual E & | getFirst () |
| Attempts to fetch a reference to the first element in the Deque.
|
|
virtual const E & | getFirst () const |
|
virtual E & | getLast () |
| Attempts to fetch a reference to the last element in the Deque.
|
|
virtual const E & | getLast () const |
|
virtual bool | offerFirst (const E &element) |
| This method attempts to insert the given element into the Deque at the front end.
|
|
virtual bool | offerLast (const E &element) |
| This method attempts to insert the given element into the Deque at the end.
|
|
virtual E | removeFirst () |
| Removes the topmost element from the Deque and returns it.
|
|
virtual E | removeLast () |
| Removes the last element from the Deque and returns it.
|
|
virtual bool | pollFirst (E &result) |
| Removes the first element from the Deque assigns it to the element reference passed.
|
|
virtual bool | pollLast (E &result) |
| Removes the last element from the Deque assigns it to the element reference passed.
|
|
virtual bool | peekFirst (E &result) const |
| Retrieves the first element contained in this Deque and assigns its value to the reference value passed the value however is not removed from the Deque.
|
|
virtual bool | peekLast (E &result) const |
| Retrieves the last element contained in this Deque and assigns its value to the reference value passed the value however is not removed from the Deque.
|
|
virtual E | pop () |
| Treats this Deque as a stack and attempts to pop an element off the top.
|
|
virtual void | push (const E &element) |
| Pushes an element onto the stack represented by this deque (in other words, at the head of this deque) if it is possible to do so immediately without violating capacity restrictions, otherwise it throwing an IllegalStateException if no space is currently available.
|
|
virtual bool | removeFirstOccurrence (const E &value) |
| Removes the first occurrence of the specified element from this Deque.
|
|
virtual bool | removeLastOccurrence (const E &value) |
| Removes the last occurrence of the specified element from this Deque.
|
|
virtual ListIterator< E > * | listIterator (int index) |
|
virtual ListIterator< E > * | listIterator (int index) const |
|
virtual Iterator< E > * | descendingIterator () |
| Provides an Iterator over this Collection that traverses the element in reverse order.
|
|
virtual Iterator< E > * | descendingIterator () const |
|
virtual | ~AbstractSequentialList () |
|
virtual Iterator< E > * | iterator () |
|
virtual Iterator< E > * | iterator () const |
|
virtual ListIterator< E > * | listIterator () |
|
virtual ListIterator< E > * | listIterator () const |
|
virtual bool | addAll (int index, const Collection< E > &source) |
| Inserts all of the elements in the specified collection into this list at the specified position (optional operation).Shifts the element currently at that position (if any) and any subsequent elements to the right (increases their indices). The new elements will appear in this list in the order that they are returned by the specified collection's iterator. The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (Note that this will occur if the specified collection is this list, and it's nonempty.)- Parameters
-
index | The index at which to insert the first element from the specified collection |
source | The Collection containing elements to be added to this list |
- Returns
- true if this list changed as a result of the call
- Exceptions
-
IndexOutOfBoundsException | if the index given is less than zero or greater than the List size. |
UnsupportedOperationExceptio | if this is an unmodifiable collection. |
NullPointerException | if the Collection is a container of pointers and does not allow NULL values. |
IllegalArgumentException | if some property of the element prevents it from being added to this collection |
IllegalStateException | if the element cannot be added at this time due to insertion restrictions. |
|
|
virtual E | removeAt (int index) |
| Removes the element at the specified position in this list.Shifts any subsequent elements to the left (subtracts one from their indices). Returns the element that was removed from the list.- Parameters
-
index | - the index of the element to be removed. |
- Returns
- the element previously at the specified position.
- Exceptions
-
IndexOutOfBoundsException | if the index given is less than zero or greater than the List size. |
UnsupportedOperationExceptio | if this is an unmodifiable collection. |
|
|
| AbstractList () |
|
virtual | ~AbstractList () |
|
virtual void | add (int index DECAF_UNUSED, const E &element DECAF_UNUSED) |
|
virtual E | set (int index DECAF_UNUSED, const E &element DECAF_UNUSED) |
|
| List () |
|
virtual | ~List () |
|
virtual | ~Collection () |
|
virtual | ~Iterable () |
|
virtual | ~Synchronizable () |
|
| AbstractCollection () |
|
| AbstractCollection (const AbstractCollection &other) |
| Copy Constructor, copy element from the source collection to this collection after clearing any element stored in this collection.
|
|
virtual | ~AbstractCollection () |
|
AbstractCollection< E > & | operator= (const AbstractCollection< E > &collection) |
| Assignment Operator, copy element from the source collection to this collection after clearing any element stored in this collection.
|
|
virtual bool | containsAll (const Collection< E > &collection) const |
| Returns true if this collection contains all of the elements in the specified collection.- Parameters
-
- Exceptions
-
NullPointerException | if the Collection contains pointers and the Collection does not allow for NULL elements (optional check). |
|
|
virtual bool | equals (const Collection< E > &collection) const |
| Answers true if this Collection and the one given are the same size and if each element contained in the Collection given is equal to an element contained in this collection.
|
|
virtual void | copy (const Collection< E > &collection) |
| Renders this Collection as a Copy of the given Collection.
|
|
virtual bool | add (const E &value DECAF_UNUSED) |
|
virtual bool | addAll (const Collection< E > &collection) |
| Adds all of the elements in the specified collection to this collection.The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (This implies that the behavior of this call is undefined if the specified collection is this collection, and this collection is nonempty.)- Parameters
-
collection | The Collection whose elements are added to this one. |
- Returns
- true if this collection changed as a result of the call
- Exceptions
-
UnsupportedOperationExceptio | if this is an unmodifiable collection. |
NullPointerException | if the Collection is a container of pointers and does not allow NULL values. |
IllegalArgumentException | if some property of an element prevents it from being added to this collection |
IllegalStateException | if an element cannot be added at this time due to insertion restrictions. |
|
|
virtual bool | removeAll (const Collection< E > &collection) |
| Removes all this collection's elements that are also contained in the specified collection (optional operation).After this call returns, this collection will contain no elements in common with the specified collection.- Parameters
-
collection | The Collection whose elements are to be removed from this one. |
- Returns
- true if the collection changed as a result of this call.
- Exceptions
-
UnsupportedOperationExceptio | if this is an unmodifiable collection. |
NullPointerException | if the Collection is a container of pointers and does not allow NULL values. |
|
|
virtual bool | retainAll (const Collection< E > &collection) |
| Retains only the elements in this collection that are contained in the specified collection (optional operation).In other words, removes from this collection all of its elements that are not contained in the specified collection.- Parameters
-
collection | The Collection whose elements are to be retained. |
- Returns
- true if the collection changed as a result of this call.
- Exceptions
-
UnsupportedOperationExceptio | if this is an unmodifiable collection. |
NullPointerException | if the Collection is a container of pointers and does not allow NULL values. |
|
|
virtual void | lock () |
| Locks the object.
|
|
virtual bool | tryLock () |
| Attempts to Lock the object, if the lock is already held by another thread than this method returns false.
|
|
virtual void | unlock () |
| Unlocks the object.
|
|
virtual void | wait () |
| Waits on a signal from this object, which is generated by a call to Notify.
|
|
virtual void | wait (long long millisecs) |
| Waits on a signal from this object, which is generated by a call to Notify.
|
|
virtual void | wait (long long millisecs, int nanos) |
| Waits on a signal from this object, which is generated by a call to Notify.
|
|
virtual void | notify () |
| Signals a waiter on this object that it can now wake up and continue.
|
|
virtual void | notifyAll () |
| Signals the waiters on this object that it can now wake up and continue.
|
|
virtual | ~Deque () |
|
virtual | ~Queue () |
|
template<typename E>
class activemq::util::LinkedList< E >
A complete implementation of the List interface using a doubly linked list data structure.
This class also implements the Deque interface providing a common interface for additions into the list at the front and end as well as allowing insertions anywhere in between. This class can be used then to implement other data structures such as Stacks, Queue's or double ended Queue's.
The operations on this List object that index a particular element involve iterating over the links of the list from beginning to end, starting from whichever end is closer to the location the operation is to be performed on.
- Since
- 1.0