activemq-cpp-3.6.0
|
Namespaces | |
namespace | comparators |
namespace | concurrent |
namespace | logging |
namespace | zip |
Data Structures | |
class | AbstractCollection |
This class provides a skeletal implementation of the Collection interface, to minimize the effort required to implement this interface. More... | |
class | AbstractList |
This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "random access" data store (such as an array). More... | |
class | AbstractMap |
This class provides a skeletal implementation of the Map interface, to minimize the effort required to implement this interface. More... | |
class | AbstractQueue |
This class provides skeletal implementations of some Queue operations. More... | |
class | AbstractSequentialList |
This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "sequential access" data store (such as a linked list). More... | |
class | AbstractSet |
This class provides a skeletal implementation of the Set interface to minimize the effort required to implement this interface. More... | |
class | ArrayList |
class | Arrays |
class | BitSet |
This class implements a vector of bits that grows as needed. More... | |
class | Collection |
The root interface in the collection hierarchy. More... | |
class | Collections |
class | Comparator |
A comparison function, which imposes a total ordering on some collection of objects. More... | |
class | ConcurrentModificationException |
class | Date |
Wrapper class around a time value in milliseconds. More... | |
class | Deque |
Defines a 'Double ended Queue' interface that allows for insertion and removal of elements from both ends. More... | |
struct | HashCodeUnaryBase |
struct | HashCode |
Base HashCode template, specializations are created from this to account for the various native types. More... | |
struct | HashCode< T * > |
struct | HashCode< const T & > |
struct | HashCode< bool > |
struct | HashCode< char > |
struct | HashCode< wchar_t > |
struct | HashCode< unsigned short > |
struct | HashCode< short > |
struct | HashCode< unsigned int > |
struct | HashCode< int > |
struct | HashCode< unsigned long long > |
struct | HashCode< long long > |
struct | HashCode< float > |
struct | HashCode< double > |
struct | HashCode< std::string > |
struct | HashCode< decaf::lang::Pointer< T > > |
class | HashMap |
Hash table based implementation of the Map interface. More... | |
class | Iterator |
Defines an object that can be used to iterate over the elements of a collection. More... | |
class | LinkedList |
A complete implementation of the List interface using a doubly linked list data structure. More... | |
class | List |
An ordered collection (also known as a sequence). More... | |
class | ListIterator |
An iterator for lists that allows the programmer to traverse the list in either direction, modify the list during iteration, and obtain the iterator's current position in the list. More... | |
class | LRUCache |
A Basic Least Recently Used (LRU) Cache Map. More... | |
class | Map |
An object that maps keys to values. More... | |
class | MapEntry |
class | NoSuchElementException |
class | PriorityQueueBase |
class | PriorityQueue |
An unbounded priority queue based on a binary heap algorithm. More... | |
class | Properties |
Java-like properties class for mapping string names to string values. More... | |
class | Queue |
A kind of collection provides advanced operations than other basic collections, such as insertion, extraction, and inspection. More... | |
class | Random |
Random Value Generator which is used to generate a stream of pseudorandom numbers. More... | |
class | Set |
A collection that contains no duplicate elements. More... | |
class | StlList |
List class that wraps the STL list object to provide a simpler interface and additional methods not provided by the STL type. More... | |
class | StlMap |
Map template that wraps around a std::map to provide a more user-friendly interface and to provide common functions that do not exist in std::map. More... | |
class | StlQueue |
The Queue class accepts messages with an psuh(m) command where m is the message to be queued. More... | |
class | StlSet |
Set template that wraps around a std::set to provide a more user-friendly interface and to provide common functions that do not exist in std::set. More... | |
class | StringTokenizer |
Class that allows for parsing of string based on Tokens. More... | |
class | Timer |
A facility for threads to schedule tasks for future execution in a background thread. More... | |
class | TimerTask |
A Base class for a task object that can be scheduled for one-time or repeated execution by a Timer. More... | |
class | UUID |
A class that represents an immutable universally unique identifier (UUID). More... |