diff options
| author | levine <levine@ae88bc3d-4319-0410-8dbf-d08b4c9d3795> | 1998-04-14 16:42:20 +0000 |
|---|---|---|
| committer | levine <levine@ae88bc3d-4319-0410-8dbf-d08b4c9d3795> | 1998-04-14 16:42:20 +0000 |
| commit | ae017ab39c2280345d6240150761a157b14f0bba (patch) | |
| tree | d134ab24f0b53e72cdfab63c36162dbee0e59406 | |
| parent | 55b8b6ea019f11ddf15cdeb6b29e4a25f569b631 (diff) | |
| download | ATCD-ae017ab39c2280345d6240150761a157b14f0bba.tar.gz | |
made type, size_t, of String_Table_size explicit, instead of using the
default type of int.
| -rw-r--r-- | tests/Hash_Map_Manager_Test.cpp | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/tests/Hash_Map_Manager_Test.cpp b/tests/Hash_Map_Manager_Test.cpp index c20803e171c..2bb411b546f 100644 --- a/tests/Hash_Map_Manager_Test.cpp +++ b/tests/Hash_Map_Manager_Test.cpp @@ -168,17 +168,17 @@ struct String_Table static String_Table string_table[] = { - { "hello", - "guten Tag" + { "hello", + "guten Tag" }, { "goodbye", - "auf wiedersehen" + "auf wiedersehen" }, { "funny", - "lustig" + "lustig" }, { 0, - 0 + 0 } }; @@ -188,7 +188,7 @@ static const int MAX_HASH = 6; // @@ The following requires too much internal implementation // information about the <ACE_Hash_Map_Manager>. We need to figure // out how to simplify this. -static const String_Table_size = sizeof (HASH_STRING_ENTRY) * (STRING_TABLE_SIZE + MAX_HASH); +static const size_t String_Table_size = sizeof (HASH_STRING_ENTRY) * (STRING_TABLE_SIZE + MAX_HASH); static ACE_Static_Allocator<String_Table_size> allocator; static int @@ -214,15 +214,15 @@ run_test (void) if (hash.find (string_table[i].key_, entry) == 0) ACE_DEBUG ((LM_DEBUG, - "`%s' found `%s'\n", + "`%s' found `%s'\n", string_table[i].key_, ENTRY)); else ACE_ERROR_RETURN ((LM_ERROR, - "`%s' not found\n", - string_table[i].key_), + "`%s' not found\n", + string_table[i].key_), -1); - + // Let's test the iterator while we are at it. { HASH_STRING_ENTRY *entry; @@ -243,13 +243,13 @@ run_test (void) if (hash.find (string_table[i].key_, entry) == 0) ACE_DEBUG ((LM_DEBUG, - "`%s' found `%s'\n", + "`%s' found `%s'\n", string_table[i].key_, ENTRY)); else if (i != 2) ACE_ERROR_RETURN ((LM_ERROR, - "`%s' not found\n", - string_table[i].key_), + "`%s' not found\n", + string_table[i].key_), -1); // Let's test the iterator backwards. |