summaryrefslogtreecommitdiff
path: root/src/mongo/util/string_map_test.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/mongo/util/string_map_test.cpp')
-rw-r--r--src/mongo/util/string_map_test.cpp274
1 files changed, 137 insertions, 137 deletions
diff --git a/src/mongo/util/string_map_test.cpp b/src/mongo/util/string_map_test.cpp
index 4b1c320b818..6e49d34bdc5 100644
--- a/src/mongo/util/string_map_test.cpp
+++ b/src/mongo/util/string_map_test.cpp
@@ -38,171 +38,171 @@
#include "mongo/util/timer.h"
namespace {
- using namespace mongo;
+using namespace mongo;
- TEST(StringMapTest, Hash1) {
- StringMapDefaultHash h;
- ASSERT_EQUALS( h(""), h("") );
- ASSERT_EQUALS( h("a"), h("a") );
- ASSERT_EQUALS( h("abc"), h("abc") );
+TEST(StringMapTest, Hash1) {
+ StringMapDefaultHash h;
+ ASSERT_EQUALS(h(""), h(""));
+ ASSERT_EQUALS(h("a"), h("a"));
+ ASSERT_EQUALS(h("abc"), h("abc"));
- ASSERT_NOT_EQUALS( h(""), h("a") );
- ASSERT_NOT_EQUALS( h("a"), h("ab") );
+ ASSERT_NOT_EQUALS(h(""), h("a"));
+ ASSERT_NOT_EQUALS(h("a"), h("ab"));
- ASSERT_NOT_EQUALS( h("foo28"), h("foo35") );
- }
+ ASSERT_NOT_EQUALS(h("foo28"), h("foo35"));
+}
-#define equalsBothWays(a,b) \
- ASSERT_TRUE( e( (a), (b) ) ); \
- ASSERT_TRUE( e( (b), (a) ) );
+#define equalsBothWays(a, b) \
+ ASSERT_TRUE(e((a), (b))); \
+ ASSERT_TRUE(e((b), (a)));
-#define notEqualsBothWays(a,b) \
- ASSERT_FALSE( e( (a), (b) ) ); \
- ASSERT_FALSE( e( (b), (a) ) );
+#define notEqualsBothWays(a, b) \
+ ASSERT_FALSE(e((a), (b))); \
+ ASSERT_FALSE(e((b), (a)));
- TEST(StringMapTest, Equals1 ){
- StringMapDefaultEqual e;
+TEST(StringMapTest, Equals1) {
+ StringMapDefaultEqual e;
- equalsBothWays( "", "" );
- equalsBothWays( "a", "a" );
- equalsBothWays( "bbbbb", "bbbbb" );
+ equalsBothWays("", "");
+ equalsBothWays("a", "a");
+ equalsBothWays("bbbbb", "bbbbb");
- notEqualsBothWays( "", "a" );
- notEqualsBothWays( "a", "b" );
- notEqualsBothWays( "abc", "def" );
- notEqualsBothWays( "abc", "defasdasd" );
- }
+ notEqualsBothWays("", "a");
+ notEqualsBothWays("a", "b");
+ notEqualsBothWays("abc", "def");
+ notEqualsBothWays("abc", "defasdasd");
+}
- TEST(StringMapTest, Basic1) {
- StringMap<int> m;
- ASSERT_EQUALS( 0U, m.size() );
- ASSERT_EQUALS( true, m.empty() );
- m["eliot"] = 5;
- ASSERT_EQUALS( 5, m["eliot"] );
- ASSERT_EQUALS( 1U, m.size() );
- ASSERT_EQUALS( false, m.empty() );
- }
+TEST(StringMapTest, Basic1) {
+ StringMap<int> m;
+ ASSERT_EQUALS(0U, m.size());
+ ASSERT_EQUALS(true, m.empty());
+ m["eliot"] = 5;
+ ASSERT_EQUALS(5, m["eliot"]);
+ ASSERT_EQUALS(1U, m.size());
+ ASSERT_EQUALS(false, m.empty());
+}
- TEST(StringMapTest, Big1) {
- StringMap<int> m;
- char buf[64];
+TEST(StringMapTest, Big1) {
+ StringMap<int> m;
+ char buf[64];
- for ( int i=0; i<10000; i++ ) {
- sprintf( buf, "foo%d", i );
- m[buf] = i;
- }
+ for (int i = 0; i < 10000; i++) {
+ sprintf(buf, "foo%d", i);
+ m[buf] = i;
+ }
- for ( int i=0; i<10000; i++ ) {
- sprintf( buf, "foo%d", i );
- ASSERT_EQUALS( m[buf], i );
- }
+ for (int i = 0; i < 10000; i++) {
+ sprintf(buf, "foo%d", i);
+ ASSERT_EQUALS(m[buf], i);
}
+}
- TEST(StringMapTest, find1 ) {
- StringMap<int> m;
+TEST(StringMapTest, find1) {
+ StringMap<int> m;
- ASSERT_TRUE( m.end() == m.find( "foo" ) );
+ ASSERT_TRUE(m.end() == m.find("foo"));
- m["foo"] = 5;
- StringMap<int>::const_iterator i = m.find( "foo" );
- ASSERT_TRUE( i != m.end() );
- ASSERT_EQUALS( 5, i->second );
- ASSERT_EQUALS( "foo", i->first );
- ++i;
- ASSERT_TRUE( i == m.end() );
- }
+ m["foo"] = 5;
+ StringMap<int>::const_iterator i = m.find("foo");
+ ASSERT_TRUE(i != m.end());
+ ASSERT_EQUALS(5, i->second);
+ ASSERT_EQUALS("foo", i->first);
+ ++i;
+ ASSERT_TRUE(i == m.end());
+}
- TEST(StringMapTest, Erase1 ) {
- StringMap<int> m;
- char buf[64];
-
- m["eliot"] = 5;
- ASSERT_EQUALS( 5, m["eliot"] );
- ASSERT_EQUALS( 1U, m.size() );
- ASSERT_EQUALS( false, m.empty() );
- ASSERT_EQUALS( 1U, m.erase( "eliot" ) );
- ASSERT( m.end() == m.find( "eliot" ) );
- ASSERT_EQUALS( 0U, m.size() );
- ASSERT_EQUALS( true, m.empty() );
- ASSERT_EQUALS( 0, m["eliot"] );
- ASSERT_EQUALS( 1U, m.size() );
- ASSERT_EQUALS( false, m.empty() );
- ASSERT_EQUALS( 1U, m.erase( "eliot" ) );
- ASSERT( m.end() == m.find( "eliot" ) );
- ASSERT_EQUALS( 0U, m.erase( "eliot" ) );
-
- size_t before = m.capacity();
- for ( int i = 0; i < 10000; i++ ) {
- sprintf( buf, "foo%d", i );
- m[buf] = i;
- ASSERT_EQUALS( i, m[buf] );
- ASSERT_EQUALS( 1U, m.erase( buf ) );
- ASSERT( m.end() == m.find( buf ) );
- }
- ASSERT_EQUALS( before, m.capacity() );
+TEST(StringMapTest, Erase1) {
+ StringMap<int> m;
+ char buf[64];
+
+ m["eliot"] = 5;
+ ASSERT_EQUALS(5, m["eliot"]);
+ ASSERT_EQUALS(1U, m.size());
+ ASSERT_EQUALS(false, m.empty());
+ ASSERT_EQUALS(1U, m.erase("eliot"));
+ ASSERT(m.end() == m.find("eliot"));
+ ASSERT_EQUALS(0U, m.size());
+ ASSERT_EQUALS(true, m.empty());
+ ASSERT_EQUALS(0, m["eliot"]);
+ ASSERT_EQUALS(1U, m.size());
+ ASSERT_EQUALS(false, m.empty());
+ ASSERT_EQUALS(1U, m.erase("eliot"));
+ ASSERT(m.end() == m.find("eliot"));
+ ASSERT_EQUALS(0U, m.erase("eliot"));
+
+ size_t before = m.capacity();
+ for (int i = 0; i < 10000; i++) {
+ sprintf(buf, "foo%d", i);
+ m[buf] = i;
+ ASSERT_EQUALS(i, m[buf]);
+ ASSERT_EQUALS(1U, m.erase(buf));
+ ASSERT(m.end() == m.find(buf));
}
+ ASSERT_EQUALS(before, m.capacity());
+}
- TEST( StringMapTest, Erase2 ) {
- StringMap<int> m;
- m["eliot"] = 5;
- ASSERT_EQUALS( 1U, m.size() );
- ASSERT_EQUALS( false, m.empty() );
- StringMap<int>::const_iterator i = m.find( "eliot" );
- ASSERT_EQUALS( 5, i->second );
- m.erase( i );
- ASSERT_EQUALS( 0U, m.size() );
- ASSERT_EQUALS( true, m.empty() );
- }
+TEST(StringMapTest, Erase2) {
+ StringMap<int> m;
+ m["eliot"] = 5;
+ ASSERT_EQUALS(1U, m.size());
+ ASSERT_EQUALS(false, m.empty());
+ StringMap<int>::const_iterator i = m.find("eliot");
+ ASSERT_EQUALS(5, i->second);
+ m.erase(i);
+ ASSERT_EQUALS(0U, m.size());
+ ASSERT_EQUALS(true, m.empty());
+}
- TEST( StringMapTest, Iterator1 ) {
- StringMap<int> m;
- ASSERT( m.begin() == m.end() );
- }
+TEST(StringMapTest, Iterator1) {
+ StringMap<int> m;
+ ASSERT(m.begin() == m.end());
+}
- TEST( StringMapTest, Iterator2 ) {
- StringMap<int> m;
- m["eliot"] = 5;
- StringMap<int>::const_iterator i = m.begin();
- ASSERT_EQUALS( "eliot", i->first );
- ASSERT_EQUALS( 5, i->second );
- ++i;
- ASSERT( i == m.end() );
- }
+TEST(StringMapTest, Iterator2) {
+ StringMap<int> m;
+ m["eliot"] = 5;
+ StringMap<int>::const_iterator i = m.begin();
+ ASSERT_EQUALS("eliot", i->first);
+ ASSERT_EQUALS(5, i->second);
+ ++i;
+ ASSERT(i == m.end());
+}
- TEST( StringMapTest, Iterator3 ) {
- StringMap<int> m;
- m["eliot"] = 5;
- m["bob"] = 6;
- StringMap<int>::const_iterator i = m.begin();
- int sum = 0;
- for ( ; i != m.end(); ++i ) {
- sum += i->second;
- }
- ASSERT_EQUALS( 11, sum );
+TEST(StringMapTest, Iterator3) {
+ StringMap<int> m;
+ m["eliot"] = 5;
+ m["bob"] = 6;
+ StringMap<int>::const_iterator i = m.begin();
+ int sum = 0;
+ for (; i != m.end(); ++i) {
+ sum += i->second;
}
+ ASSERT_EQUALS(11, sum);
+}
- TEST( StringMapTest, Copy1 ) {
- StringMap<int> m;
- m["eliot"] = 5;
- StringMap<int> y = m;
- ASSERT_EQUALS( 5, y["eliot"] );
+TEST(StringMapTest, Copy1) {
+ StringMap<int> m;
+ m["eliot"] = 5;
+ StringMap<int> y = m;
+ ASSERT_EQUALS(5, y["eliot"]);
- m["eliot"] = 6;
- ASSERT_EQUALS( 6, m["eliot"] );
- ASSERT_EQUALS( 5, y["eliot"] );
- }
+ m["eliot"] = 6;
+ ASSERT_EQUALS(6, m["eliot"]);
+ ASSERT_EQUALS(5, y["eliot"]);
+}
- TEST( StringMapTest, Assign ) {
- StringMap<int> m;
- m["eliot"] = 5;
+TEST(StringMapTest, Assign) {
+ StringMap<int> m;
+ m["eliot"] = 5;
- StringMap<int> y;
- y["eliot"] = 6;
- ASSERT_EQUALS( 6, y["eliot"] );
+ StringMap<int> y;
+ y["eliot"] = 6;
+ ASSERT_EQUALS(6, y["eliot"]);
- y = m;
- ASSERT_EQUALS( 5, y["eliot"] );
- }
+ y = m;
+ ASSERT_EQUALS(5, y["eliot"]);
+}
}
View Lorry Controller Status