summaryrefslogtreecommitdiff
path: root/ace/Containers_T.h
diff options
context:
space:
mode:
authorschmidt <douglascraigschmidt@users.noreply.github.com>2001-01-12 11:32:05 +0000
committerschmidt <douglascraigschmidt@users.noreply.github.com>2001-01-12 11:32:05 +0000
commit39821fb9b116e2a54f2458e58de8b40eda8ccdd3 (patch)
tree914fd5afe15dbbff79add22e3811f9d58fb8fd8c /ace/Containers_T.h
parentfa2f2a87da34c8c412e03372b6e6701c031378ab (diff)
downloadATCD-39821fb9b116e2a54f2458e58de8b40eda8ccdd3.tar.gz
ChangeLogTag:Wed Jan 10 23:30:21 2001 Douglas C. Schmidt <schmidt@ace.cs.wustl.edu>
Diffstat (limited to 'ace/Containers_T.h')
-rw-r--r--ace/Containers_T.h14
1 files changed, 5 insertions, 9 deletions
diff --git a/ace/Containers_T.h b/ace/Containers_T.h
index 5f21d5fd841..6bde6d71662 100644
--- a/ace/Containers_T.h
+++ b/ace/Containers_T.h
@@ -1624,15 +1624,11 @@ private:
/**
* @class ACE_Ordered_MultiSet
*
- * @brief Implement a simple ordered multiset of <T> of unbounded size.
- * This class template requires that < operator semantics be
- * defined for the parameterized type <T>, but does not impose
- * any restriction on how that ordering operator is implemented.
- *
- * This implementation of an unordered set uses a circular
- * linked list with a dummy node. This implementation does not
- * allow duplicates, but it maintains FIFO ordering of
- * insertions.
+ * @brief Implement a simple ordered multiset of <T> of unbounded size
+ * that allows duplicates. This class template requires that <
+ * operator semantics be defined for the parameterized type <T>, but
+ * does not impose any restriction on how that ordering operator is
+ * implemented.
*/
template <class T>
class ACE_Ordered_MultiSet