summaryrefslogtreecommitdiff
path: root/ace/Unbounded_Queue.h
diff options
context:
space:
mode:
Diffstat (limited to 'ace/Unbounded_Queue.h')
-rw-r--r--ace/Unbounded_Queue.h23
1 files changed, 23 insertions, 0 deletions
diff --git a/ace/Unbounded_Queue.h b/ace/Unbounded_Queue.h
index 52b378e43fc..e4a94b76c85 100644
--- a/ace/Unbounded_Queue.h
+++ b/ace/Unbounded_Queue.h
@@ -122,6 +122,29 @@ private:
*
* This implementation of an unbounded queue uses a circular
* linked list with a dummy node.
+ *
+ * <b> Requirements and Performance Characteristics</b>
+ * - Internal Structure
+ * Circular linked list
+ * - Duplicates allowed?
+ * Yes
+ * - Random access allowed?
+ * No
+ * - Search speed
+ * N/A
+ * - Insert/replace speed
+ * N/A
+ * - Iterator still valid after change to container?
+ * Yes
+ * - Frees memory for removed elements?
+ * Yes
+ * - Items inserted by
+ * Value
+ * - Requirements for contained type
+ * -# Default constructor
+ * -# Copy constructor
+ * -# operator=
+ *
*/
template <class T>
class ACE_Unbounded_Queue