Public Member Functions |
| | PrimitiveList () |
| | Default Constructor, creates an Empty list.
|
| virtual | ~PrimitiveList () |
| | PrimitiveList (const decaf::util::List< PrimitiveValueNode > &src) |
| | Copy Constructor.
|
| | PrimitiveList (const PrimitiveList &src) |
| | Copy Constructor.
|
| std::string | toString () const |
| | Converts the contents into a formatted string that can be output in a Log File or other debugging tool.
|
| virtual bool | getBool (int index) const |
| | Gets the Boolean value at the specified index.
|
| virtual void | setBool (int index, bool value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| virtual unsigned char | getByte (int index) const |
| | Gets the Byte value at the specified index.
|
| virtual void | setByte (int index, unsigned char value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| virtual char | getChar (int index) const |
| | Gets the Character value at the specified index.
|
| virtual void | setChar (int index, char value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| virtual short | getShort (int index) const |
| | Gets the Short value at the specified index.
|
| virtual void | setShort (int index, short value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| virtual int | getInt (int index) const |
| | Gets the Integer value at the specified index.
|
| virtual void | setInt (int index, int value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| virtual long long | getLong (int index) const |
| | Gets the Long value at the specified index.
|
| virtual void | setLong (int index, long long value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| virtual float | getFloat (int index) const |
| | Gets the Float value at the specified index.
|
| virtual void | setFloat (int index, float value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| virtual double | getDouble (int index) const |
| | Gets the Double value at the specified index.
|
| virtual void | setDouble (int index, double value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| virtual std::string | getString (int index) const |
| | Gets the String value at the specified index.
|
| virtual void | setString (int index, const std::string &value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
virtual std::vector< unsigned
char > | getByteArray (int index) const |
| | Gets the Byte Array value at the specified index.
|
| virtual void | setByteArray (int index, const std::vector< unsigned char > &value) |
| | Sets the value at the given index to the new value specified, this method overwrites any data that was previously at the index given, but does not insert a new element if the index is greater than the size of the list.
|
| | LinkedList () |
| | LinkedList (const LinkedList< PrimitiveValueNode > &list) |
| | LinkedList (const Collection< PrimitiveValueNode > &collection) |
| virtual | ~LinkedList () |
| LinkedList< PrimitiveValueNode > & | operator= (const LinkedList< PrimitiveValueNode > &list) |
| LinkedList< PrimitiveValueNode > & | operator= (const Collection< PrimitiveValueNode > &collection) |
| virtual PrimitiveValueNode | 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 PrimitiveValueNode | set (int index, const PrimitiveValueNode &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 PrimitiveValueNode &value) |
| | Returns true if this collection changed as a result of the call.
|
| virtual void | add (int index, const PrimitiveValueNode &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< PrimitiveValueNode > &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. |
This implementation iterates over the specified collection, and adds each object returned by the iterator to this collection, in turn.Note that this implementation will throw an UnsupportedOperationException unless add is overridden (assuming the specified collection is non-empty).
|
| virtual bool | addAll (int index, const Collection< PrimitiveValueNode > &collection) |
| | 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. |
This implementation gets an iterator over the specified collection and a list iterator over this list pointing to the indexed element (with listIterator(index)). Then, it iterates over the specified collection, inserting the elements obtained from the iterator into this list, one at a time, using ListIterator.add (to skip over the added element).
|
| virtual void | copy (const Collection< PrimitiveValueNode > &collection) |
| | Renders this Collection as a Copy of the given Collection.
|
| virtual bool | remove (const PrimitiveValueNode &value) |
| | Removes a single instance of the specified element from the collection.More formally, removes an element e such that (value == NULL ? e == NULL : value == e), if this collection contains one or more such elements. Returns true if this collection contained the specified element (or equivalently, if this collection changed as a result of the call).- Parameters
-
| value | The reference to the element to remove from this Collection. |
- Returns
- true if the collection was changed, false otherwise.
- Exceptions
-
| UnsupportedOperationExceptio | if this is an unmodifiable collection. |
| NullPointerException | if the Collection is a container of pointers and does not allow NULL values. |
This implementation iterates over the collection looking for the specified element. If it finds the element, it removes the element from the collection using the iterator's remove method.Note that this implementation throws an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection contains the specified object.
|
| virtual PrimitiveValueNode | remove () |
| | Gets and removes the element in the head of the queue.
|
| virtual bool | isEmpty () const |
| | Returns true if this collection contains no elements.
|
| 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 PrimitiveValueNode &value) const |
| | Returns true if this collection contains the specified element.More formally, returns true if and only if this collection contains at least one element e such that (value == NULL ? e == NULL : value == e ).- Parameters
-
| value | The value to check for presence in the collection. |
- Returns
- true if there is at least one of the elements in the collection
- Exceptions
-
| NullPointerException | if the Collection contains pointers and the Collection does not allow for NULL elements (optional check). |
This implementation iterates over the elements in the collection, checking each element in turn for equality with the specified element.
|
| virtual int | indexOf (const PrimitiveValueNode &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 PrimitiveValueNode &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
< PrimitiveValueNode > | toArray () const |
| | Answers an STL vector containing copies of all elements contained in this Collection.
|
| virtual bool | offer (const PrimitiveValueNode &value) |
| | Inserts the specified element into the queue provided that the condition allows such an operation.
|
| virtual bool | poll (PrimitiveValueNode &result) |
| | Gets and removes the element in the head of the queue.
|
| virtual bool | peek (PrimitiveValueNode &result) const |
| | Gets but not removes the element in the head of the queue.
|
| virtual PrimitiveValueNode | element () const |
| | Gets but not removes the element in the head of the queue.
|
| virtual void | addFirst (const PrimitiveValueNode &value) |
| | Inserts an element onto the front of the Deque if possible without violating the implementations capacity restrictions.
|
| virtual void | addLast (const PrimitiveValueNode &value) |
| | Inserts an element onto the end of the Deque if possible without violating the implementations capacity restrictions.
|
| virtual PrimitiveValueNode & | getFirst () |
| | Attempts to fetch a reference to the first element in the Deque.
|
| virtual const PrimitiveValueNode & | getFirst () const |
| virtual PrimitiveValueNode & | getLast () |
| | Attempts to fetch a reference to the last element in the Deque.
|
| virtual const PrimitiveValueNode & | getLast () const |
| virtual bool | offerFirst (const PrimitiveValueNode &element) |
| | This method attempts to insert the given element into the Deque at the front end.
|
| virtual bool | offerLast (const PrimitiveValueNode &element) |
| | This method attempts to insert the given element into the Deque at the end.
|
| virtual PrimitiveValueNode | removeFirst () |
| | Removes the topmost element from the Deque and returns it.
|
| virtual PrimitiveValueNode | removeLast () |
| | Removes the last element from the Deque and returns it.
|
| virtual bool | pollFirst (PrimitiveValueNode &result) |
| | Removes the first element from the Deque assigns it to the element reference passed.
|
| virtual bool | pollLast (PrimitiveValueNode &result) |
| | Removes the last element from the Deque assigns it to the element reference passed.
|
| virtual bool | peekFirst (PrimitiveValueNode &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 (PrimitiveValueNode &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 PrimitiveValueNode | pop () |
| | Treats this Deque as a stack and attempts to pop an element off the top.
|
| virtual void | push (const PrimitiveValueNode &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 PrimitiveValueNode &value) |
| | Removes the first occurrence of the specified element from this Deque.
|
| virtual bool | removeLastOccurrence (const PrimitiveValueNode &value) |
| | Removes the last occurrence of the specified element from this Deque.
|
virtual ListIterator
< PrimitiveValueNode > * | listIterator (int index) |
virtual ListIterator
< PrimitiveValueNode > * | listIterator (int index) const |
virtual Iterator
< PrimitiveValueNode > * | descendingIterator () |
| | Provides an Iterator over this Collection that traverses the element in reverse order.
|
virtual Iterator
< PrimitiveValueNode > * | descendingIterator () const |
| virtual | ~AbstractSequentialList () |
virtual Iterator
< PrimitiveValueNode > * | iterator () |
virtual Iterator
< PrimitiveValueNode > * | iterator () const |
virtual ListIterator
< PrimitiveValueNode > * | listIterator () |
virtual ListIterator
< PrimitiveValueNode > * | listIterator () const |
| virtual PrimitiveValueNode | 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 PrimitiveValueNode &element DECAF_UNUSED) |
| virtual PrimitiveValueNode | set (int index DECAF_UNUSED, const PrimitiveValueNode &element DECAF_UNUSED) |
| | List () |
| virtual | ~List () |
| virtual | ~Collection () |
| virtual | ~Iterable () |
| virtual | ~Synchronizable () |
| | AbstractCollection () |
| virtual | ~AbstractCollection () |
AbstractCollection
< PrimitiveValueNode > & | operator= (const AbstractCollection< PrimitiveValueNode > &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< PrimitiveValueNode > &collection) const |
| | Returns true if this collection contains all of the elements in the specified collection.- Parameters
-
| collection | The Collection to compare to this one. |
- Exceptions
-
| NullPointerException | if the Collection contains pointers and the Collection does not allow for NULL elements (optional check). |
|
| virtual bool | equals (const Collection< PrimitiveValueNode > &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 bool | add (const PrimitiveValueNode &value DECAF_UNUSED) |
| |
|
| virtual bool | removeAll (const Collection< PrimitiveValueNode > &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< PrimitiveValueNode > &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 () |
Public Member Functions inherited from decaf::util::LinkedList< PrimitiveValueNode >