summaryrefslogtreecommitdiff
path: root/ACE/tests/Compiler_Features_02_Test.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'ACE/tests/Compiler_Features_02_Test.cpp')
-rw-r--r--ACE/tests/Compiler_Features_02_Test.cpp83
1 files changed, 83 insertions, 0 deletions
diff --git a/ACE/tests/Compiler_Features_02_Test.cpp b/ACE/tests/Compiler_Features_02_Test.cpp
new file mode 100644
index 00000000000..d9e68ad1619
--- /dev/null
+++ b/ACE/tests/Compiler_Features_02_Test.cpp
@@ -0,0 +1,83 @@
+// $Id$
+
+/**
+ * @file
+ *
+ * This program checks if the compiler / platform supports the
+ * std::map container. The motivation for this test was a discussion
+ * on the development mailing list, and the documentation was captured
+ * in:
+ *
+ * http://bugzilla.dre.vanderbilt.edu/show_bug.cgi?id=3715
+ *
+ */
+
+#include "test_config.h"
+
+// The first part of the test is to compile this line. If the program
+// does not compile the platform is just too broken.
+#include <map>
+
+
+
+int
+run_main (int, ACE_TCHAR *[])
+{
+ ACE_START_TEST (ACE_TEXT("Compiler_Features_02_Test"));
+
+ // As usual, the exit status from the test is 0 on success, 1 on
+ // failure
+ int status = 0;
+
+ // Create a simple list ...
+ typedef std::map<int,int> collection;
+ collection c;
+
+ // ... insert some elements ...
+ c[1] = 5;
+ c[2] = 4;
+ c[3] = 3;
+ c[4] = 2;
+ c.insert(collection::value_type(5, 1));
+
+ // ... inserting twice returns a pair ...
+ std::pair<collection::iterator,bool> r =
+ c.insert(collection::value_type(5, 0));
+
+ // ... the iterator points to the element ...
+ if (r.first->first != 5 || r.first->second != 1)
+ {
+ status = 1;
+ ACE_ERROR ((LM_ERROR, ACE_TEXT("Expected to find (5,1) already in map")));
+ }
+
+ // ... and the booleans says that it is already in the map ...
+ if (r.second == true)
+ {
+ status = 1;
+ ACE_ERROR ((LM_ERROR, ACE_TEXT("Expected duplicate insert to fail")));
+ }
+
+ // ... add all the numbers to validate that they are there ...
+ int sum = 0;
+ for(collection::iterator i = c.begin(), end = c.end();
+ i != end;
+ ++i)
+ {
+ sum += i->second;
+ }
+
+ // ... remember Euler ...
+ int const expected = 5*(5+1)/2;
+ if (sum != expected)
+ {
+ status = 1;
+ ACE_ERROR ((LM_ERROR, ACE_TEXT("Expected %d got %d\n"),
+ expected, sum));
+ }
+
+ ACE_END_TEST;
+ return status;
+}
+
+