activemq-cpp-3.9.0
|
An unbounded priority queue based on a binary heap algorithm. More...
#include <src/main/decaf/util/PriorityQueue.h>
Public Member Functions | |||||||||||
PriorityQueue () | |||||||||||
Creates a Priority Queue with the default initial capacity. More... | |||||||||||
PriorityQueue (int initialCapacity) | |||||||||||
Creates a Priority Queue with the capacity value supplied. More... | |||||||||||
PriorityQueue (int initialCapacity, Comparator< E > *comparator) | |||||||||||
Creates a Priority Queue with the default initial capacity. More... | |||||||||||
PriorityQueue (const Collection< E > &source) | |||||||||||
Creates a PriorityQueue containing the elements in the specified Collection. More... | |||||||||||
PriorityQueue (const PriorityQueue< E > &source) | |||||||||||
Creates a PriorityQueue containing the elements in the specified priority queue. More... | |||||||||||
virtual | ~PriorityQueue () | ||||||||||
PriorityQueue< E > & | operator= (const Collection< E > &source) | ||||||||||
Assignment operator, assign another Collection to this one. More... | |||||||||||
PriorityQueue< E > & | operator= (const PriorityQueue< E > &source) | ||||||||||
Assignment operator, assign another PriorityQueue to this one. More... | |||||||||||
virtual decaf::util::Iterator < E > * | iterator () | ||||||||||
virtual decaf::util::Iterator < E > * | iterator () const | ||||||||||
virtual int | size () const | ||||||||||
Returns the number of elements in this collection. More... | |||||||||||
virtual void | clear () | ||||||||||
Removes all of the elements from this collection (optional operation).The collection will be empty after this method returns.This implementation iterates over this collection, removing each element using the Iterator.remove operation. Most implementations will probably choose to override this method for efficiency.Note that this implementation will throw an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection is non-empty.
| |||||||||||
virtual bool | offer (const E &value) | ||||||||||
Inserts the specified element into the queue provided that the condition allows such an operation. More... | |||||||||||
virtual bool | poll (E &result) | ||||||||||
Gets and removes the element in the head of the queue. More... | |||||||||||
virtual bool | peek (E &result) const | ||||||||||
Gets but not removes the element in the head of the queue. More... | |||||||||||
virtual E | remove () | ||||||||||
Gets and removes the element in the head of the queue.Throws a NoSuchElementException if there is no element in the queue.
| |||||||||||
virtual bool | remove (const E &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).
| |||||||||||
virtual bool | add (const E &value) | ||||||||||
Returns true if this collection changed as a result of the call.(Returns false if this collection does not permit duplicates and already contains the specified element.)Collections that support this operation may place limitations on what elements may be added to this collection. In particular, some collections will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. Collection classes should clearly specify in their documentation any restrictions on what elements may be added.If a collection refuses to add a particular element for any reason other than that it already contains the element, it must throw an exception (rather than returning false). This preserves the invariant that a collection always contains the specified element after this call returns.For non-pointer values, i.e. class instances or string's the object will be copied into the collection, thus the object must support being copied, must not hide the copy constructor and assignment operator.
| |||||||||||
decaf::lang::Pointer < Comparator< E > > | comparator () const | ||||||||||
obtains a Copy of the Pointer instance that this PriorityQueue is using to compare the elements in the queue with. More... | |||||||||||
Public Member Functions inherited from decaf::util::AbstractQueue< E > | |||||||||||
AbstractQueue () | |||||||||||
virtual | ~AbstractQueue () | ||||||||||
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.)
| |||||||||||
virtual E | element () const | ||||||||||
Gets but not removes the element in the head of the queue.Throws a NoSuchElementException if there is no element in the queue.
| |||||||||||
Public Member Functions inherited from decaf::util::Queue< E > | |||||||||||
virtual | ~Queue () | ||||||||||
Public Member Functions inherited from decaf::util::Collection< E > | |||||||||||
virtual | ~Collection () | ||||||||||
Public Member Functions inherited from decaf::lang::Iterable< E > | |||||||||||
virtual | ~Iterable () | ||||||||||
Public Member Functions inherited from decaf::util::concurrent::Synchronizable | |||||||||||
virtual | ~Synchronizable () | ||||||||||
Public Member Functions inherited from decaf::util::AbstractCollection< E > | |||||||||||
AbstractCollection () | |||||||||||
AbstractCollection (const AbstractCollection &other) | |||||||||||
Copy Constructor, copy element from the source collection to this collection after clearing any element stored in this collection. More... | |||||||||||
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. More... | |||||||||||
virtual bool | contains (const E &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 ).
| |||||||||||
virtual bool | containsAll (const Collection< E > &collection) const | ||||||||||
Returns true if this collection contains all of the elements in the specified collection.
| |||||||||||
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. More... | |||||||||||
virtual void | copy (const Collection< E > &collection) | ||||||||||
Renders this Collection as a Copy of the given Collection. More... | |||||||||||
virtual bool | isEmpty () const | ||||||||||
Returns true if this collection contains no elements. More... | |||||||||||
virtual bool | add (const E &value DECAF_UNUSED) | ||||||||||
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.
| |||||||||||
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.
| |||||||||||
virtual std::vector< E > | toArray () const | ||||||||||
Answers an STL vector containing copies of all elements contained in this Collection. More... | |||||||||||
virtual void | lock () | ||||||||||
Locks the object. More... | |||||||||||
virtual bool | tryLock () | ||||||||||
Attempts to Lock the object, if the lock is already held by another thread than this method returns false. More... | |||||||||||
virtual void | unlock () | ||||||||||
Unlocks the object. More... | |||||||||||
virtual void | wait () | ||||||||||
Waits on a signal from this object, which is generated by a call to Notify. More... | |||||||||||
virtual void | wait (long long millisecs) | ||||||||||
Waits on a signal from this object, which is generated by a call to Notify. More... | |||||||||||
virtual void | wait (long long millisecs, int nanos) | ||||||||||
Waits on a signal from this object, which is generated by a call to Notify. More... | |||||||||||
virtual void | notify () | ||||||||||
Signals a waiter on this object that it can now wake up and continue. More... | |||||||||||
virtual void | notifyAll () | ||||||||||
Signals the waiters on this object that it can now wake up and continue. More... | |||||||||||
Friends | |
class | PriorityQueueIterator |
Additional Inherited Members | |
Protected Attributes inherited from decaf::util::AbstractCollection< E > | |
util::concurrent::Mutex | mutex |
An unbounded priority queue based on a binary heap algorithm.
The elements of the priority queue are ordered according to their natural ordering, or by a Comparator provided to one of the constructors that accepts Comparators. A priority queue relying on natural ordering also does not permit insertion of non-comparable objects (doing so may result in a compiler error).
The head of this queue is the least element with respect to the specified ordering. If multiple elements are tied for least value, the head is one of those elements – ties are broken arbitrarily. The queue retrieval operations poll, remove, peek, and element access the element at the head of the queue.
A priority queue is unbounded, but has an internal capacity governing the size of an array used to store the elements on the queue. It is always at least as large as the queue size. As elements are added to a priority queue, its capacity grows automatically. The details of the growth policy are not specified.
This class and its iterator implement all of the optional methods of the Collection and Iterator interfaces. The Iterator provided in method iterator() is not guaranteed to traverse the elements of the priority queue in any particular order. If you need ordered traversal, consider using Arrays::sort( pq.toArray() )
.
Note that this implementation is not synchronized. Multiple threads should not access a PriorityQueue instance concurrently if any of the threads modifies the queue. Instead, use the thread-safe PriorityBlockingQueue class.
Implementation note: this implementation provides O(log(n)) time for the enqueing and dequeing methods (offer, poll, remove() and add); linear time for the remove(Object) and contains(Object) methods; and constant time for the retrieval methods (peek, element, and size).
|
inline |
Creates a Priority Queue with the default initial capacity.
References decaf::util::PriorityQueueBase::DEFAULT_CAPACITY.
|
inline |
Creates a Priority Queue with the capacity value supplied.
initialCapacity | The initial number of elements allocated to this PriorityQueue. |
|
inline |
Creates a Priority Queue with the default initial capacity.
This new PriorityQueue takes ownership of the passed Comparator instance and uses that to determine the ordering of the elements in the Queue.
initialCapacity | The initial number of elements allocated to this PriorityQueue. |
comparator | The Comparator instance to use in sorting the elements in the Queue. |
NullPointerException | if the passed Comparator is NULL. |
References NULL.
|
inline |
Creates a PriorityQueue containing the elements in the specified Collection.
source | the Collection whose elements are to be placed into this priority queue |
|
inline |
Creates a PriorityQueue containing the elements in the specified priority queue.
This priority queue will be ordered according to the same ordering as the given priority queue.
source | the priority queue whose elements are to be placed into this priority queue |
|
inlinevirtual |
|
inlinevirtual |
Returns true if this collection changed as a result of the call.(Returns false if this collection does not permit duplicates and already contains the specified element.)Collections that support this operation may place limitations on what elements may be added to this collection. In particular, some collections will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. Collection classes should clearly specify in their documentation any restrictions on what elements may be added.If a collection refuses to add a particular element for any reason other than that it already contains the element, it must throw an exception (rather than returning false). This preserves the invariant that a collection always contains the specified element after this call returns.For non-pointer values, i.e. class instances or string's the object will be copied into the collection, thus the object must support being copied, must not hide the copy constructor and assignment operator.
value | The reference to the element to add to this Collection. |
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 returns true if offer succeeds, else throws an IllegalStateException.
Reimplemented from decaf::util::AbstractQueue< E >.
References DECAF_CATCH_EXCEPTION_CONVERT, DECAF_CATCH_RETHROW, DECAF_CATCHALL_THROW, and decaf::util::PriorityQueue< E >::offer().
|
inlinevirtual |
Removes all of the elements from this collection (optional operation).The collection will be empty after this method returns.This implementation iterates over this collection, removing each element using the Iterator.remove operation. Most implementations will probably choose to override this method for efficiency.Note that this implementation will throw an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection is non-empty.
UnsupportedOperationException | if the clear operation is not supported by this collection |
This implementation repeatedly invokes poll until it returns false.
Reimplemented from decaf::util::AbstractQueue< E >.
References decaf::util::PriorityQueueBase::DEFAULT_CAPACITY.
|
inline |
obtains a Copy of the Pointer instance that this PriorityQueue is using to compare the elements in the queue with.
The returned value is a copy, the caller cannot change the value if the internal Pointer value.
|
inlinevirtual |
Implements decaf::lang::Iterable< E >.
References decaf::util::PriorityQueue< E >::PriorityQueueIterator.
|
inlinevirtual |
Implements decaf::lang::Iterable< E >.
|
inlinevirtual |
Inserts the specified element into the queue provided that the condition allows such an operation.
The method is generally preferable to the collection.add(E), since the latter might throw an exception if the operation fails.
value | the specified element to insert into the queue. |
NullPointerException | if the Queue implementation does not allow Null values to be inserted into the Queue. |
IllegalArgumentException | if some property of the specified element prevents it from being added to this queue |
Implements decaf::util::Queue< E >.
Referenced by decaf::util::PriorityQueue< E >::add().
|
inline |
Assignment operator, assign another Collection to this one.
source | The Collection to copy to this one. |
|
inline |
Assignment operator, assign another PriorityQueue to this one.
source | The PriorityQueue to copy to this one. |
|
inlinevirtual |
Gets but not removes the element in the head of the queue.
The result if successful is assigned to the result parameter.
result | Reference to an instance of the contained type to assigned the removed value to. |
Implements decaf::util::Queue< E >.
References decaf::util::AbstractCollection< E >::isEmpty().
|
inlinevirtual |
Gets and removes the element in the head of the queue.
If the operation succeeds the value of the element at the head of the Queue is assigned to the result parameter and the method returns true. If the operation fails the method returns false and the value of the result parameter is undefined.
result | Reference to an instance of the contained type to assigned the removed value to. |
Implements decaf::util::Queue< E >.
References decaf::util::AbstractCollection< E >::isEmpty().
|
inlinevirtual |
Gets and removes the element in the head of the queue.Throws a NoSuchElementException if there is no element in the queue.
NoSuchElementException | if there is no element in the queue. |
This implementation returns the result of poll unless the queue is empty.
Reimplemented from decaf::util::AbstractQueue< E >.
References decaf::util::AbstractCollection< E >::isEmpty().
|
inlinevirtual |
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).
value | The reference to the element to remove from this Collection. |
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.
Reimplemented from decaf::util::AbstractCollection< E >.
|
inlinevirtual |
Returns the number of elements in this collection.
If this collection contains more than Integer::MAX_VALUE elements, returns Integer::MAX_VALUE.
Implements decaf::util::Collection< E >.
|
friend |
Referenced by decaf::util::PriorityQueue< E >::iterator().