static void
test_boundaries (void)
{
ACE_Handle_Set handle_set;
ACE_Unbounded_Set<ACE_HANDLE> set;
ACE_HANDLE handle;
// First test an empty set.
for (ACE_Handle_Set_Iterator i1 (handle_set);
(handle = i1 ()) != ACE_INVALID_HANDLE;
)
{
ACE_ASSERT (0 ==
ACE_TEXT ("this shouldn't get called since ")
ACE_TEXT ("the set is empty!\n"));
}
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("ACE_DEFAULT_SELECT_REACTOR_SIZE %d\n"),
ACE_DEFAULT_SELECT_REACTOR_SIZE));
// Insert the vector of <ACE_HANDLE>s into the set.
#if defined (ACE_WIN64)
// The casts below are legit...
# pragma warning(push)
# pragma warning(disable : 4312)
#endif /* ACE_WIN64 */
for (int i = 0;
handle_vector[i] != ACE_INVALID_HANDLE;
i++)
{
if (handle_vector[i] < (ACE_HANDLE) ACE_DEFAULT_SELECT_REACTOR_SIZE)
{
handle_set.set_bit (handle_vector[i]);
set.insert (handle_vector[i]);
}
}
#if defined (ACE_WIN64)
# pragma warning(pop)
#endif /* ACE_WIN64 */
int count = 0;
for (ACE_Handle_Set_Iterator i2 (handle_set);
(handle = i2 ()) != ACE_INVALID_HANDLE;
)
{
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("obtained handle %d\n"),
handle));
int done = set.remove (handle);
ACE_ASSERT (done == 0);
count++;
}
ACE_ASSERT (count == handle_set.num_set ());
}
static void
test_boundaries (void)
{
ACE_Handle_Set handle_set;
ACE_Unbounded_Set<ACE_HANDLE> set;
ACE_HANDLE handle;
// First test an empty set.
for (ACE_Handle_Set_Iterator i1 (handle_set);
(handle = i1 ()) != ACE_INVALID_HANDLE;
)
{
#if defined (ACE_PSOS_DIAB)
// Workaround for some compiler confusion with strings in
// assertions.
const int SET_IS_EMPTY_SO_SHOULD_NOT_SEE_THIS = 1;
ACE_ASSERT (0 == SET_IS_EMPTY_SO_SHOULD_NOT_SEE_THIS);
#else /* ! defined (ACE_PSOS_DIAB) */
ACE_ASSERT (0 ==
ACE_TEXT ("this shouldn't get called since ")
ACE_TEXT ("the set is empty!\n"));
#endif /* defined (ACE_PSOS_DIAB) */
}
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("ACE_DEFAULT_SELECT_REACTOR_SIZE %d\n"),
ACE_DEFAULT_SELECT_REACTOR_SIZE));
// Insert the vector of <ACE_HANDLE>s into the set.
for (int i = 0;
handle_vector[i] != ACE_INVALID_HANDLE;
i++)
{
if (handle_vector[i] < (ACE_HANDLE) ACE_DEFAULT_SELECT_REACTOR_SIZE)
{
handle_set.set_bit (handle_vector[i]);
set.insert (handle_vector[i]);
}
}
int count = 0;
for (ACE_Handle_Set_Iterator i2 (handle_set);
(handle = i2 ()) != ACE_INVALID_HANDLE;
)
{
ACE_DEBUG ((LM_DEBUG,
ACE_TEXT ("obtained handle %d\n"),
handle));
int done = set.remove (handle);
ACE_ASSERT (done == 0);
count++;
}
ACE_ASSERT (count == handle_set.num_set ());
}
int
run_main (int, ACE_TCHAR *[])
{
int r;
int retval = 0;
unsigned k;
MyNode node (1);
ACE_START_TEST (ACE_TEXT ("Unbounded_Set_Test"));
ACE_Unbounded_Set<MyNode> ubs;
if (ubs.size () != 0)
{
ACE_ERROR ((LM_ERROR, "Error: ubs.size () != 0\n"));
retval = -1;
}
if (!ubs.is_empty ())
{
ACE_ERROR ((LM_ERROR, "Error: !ubs.is_empty ()\n"));
retval = -1;
}
// Insert a value. Immediately remove it.
r = ubs.insert (node);
if (r != 0)
{
ACE_ERROR ((LM_ERROR, "Error: r != 0\n"));
retval = -1;
}
if (ubs.size () != 1)
{
ACE_ERROR ((LM_ERROR, "Error: ubs.size () != 1\n"));
retval = -1;
}
r = ubs.remove (node);
if (r != 0)
{
ACE_ERROR ((LM_ERROR, "Error: r != 0\n"));
retval = -1;
}
if (ubs.size () != 0)
{
ACE_ERROR ((LM_ERROR, "Error: ubs.size () != 0\n"));
retval = -1;
}
// Insert several different values.
for (node.k = 1; node.k <= 5; node.k++)
{
r = ubs.insert (node);
if (r != 0)
{
ACE_ERROR ((LM_ERROR, "Error: r != 0\n"));
retval = -1;
}
if (ubs.size () != node.k)
{
ACE_ERROR ((LM_ERROR, "Error: ubs.size () != node.k\n"));
retval = -1;
}
}
// Test assigment of sets.
// To do that, we also test some of the iterator methods.
typedef ACE_Unbounded_Set<MyNode> MySet;
MySet ubs2 = ubs; // Test a typedef of a set.
if (ubs2.size() != ubs.size())
{
ACE_ERROR ((LM_ERROR, "Error: ubs2.size() != ubs.size()\n"));
retval = -1;
}
{
MySet::ITERATOR it1 (ubs);
MySet::iterator it2 (ubs2);
for (k = 1; k <= 5; k++)
{
if (it1.done ())
{
ACE_ERROR ((LM_ERROR, "Error: it1.done ()\n"));
retval = -1;
}
if (it2.done ())
{
ACE_ERROR ((LM_ERROR, "Error: it2.done ()\n"));
retval = -1;
}
MyNode n1 = *it1;
MyNode n2 = *it2;
if (!(n1 == n2))
{
ACE_ERROR ((LM_ERROR, "Error: !(n1 == n2)\n"));
retval = -1;
}
it1.advance ();
it2.advance ();
}
if (!it1.done ())
{
ACE_ERROR ((LM_ERROR, "Error: !it1.done ()\n"));
retval = -1;
}
if (!it2.done ())
{
ACE_ERROR ((LM_ERROR, "Error: !it2.done ()\n"));
retval = -1;
}
// Verify that a set may be emptied while an iterator on the set is
// in-scope but inactive:
ubs.reset ();
// Restore original set from ubs2
ubs = ubs2;
}
// Selective deletion of elements and element retrieval.
{
MySet::iterator it (ubs2);
int deleted = 0;
while (! it.done ())
{
MyNode n = *it;
it.advance (); /* Being friendly here: Move the iterator on
so that element removal does not interfere
with the current iterator position.
The less friendly case, removal under the
current iterator position, is below. */
if (n.k % 2 == 1)
{
r = ubs2.remove (n);
deleted++;
}
}
if (ubs2.size () + deleted != ubs.size())
{
ACE_ERROR ((LM_ERROR, "Error: ubs2.size () + deleted != ubs.size()\n"));
retval = -1;
}
MyNode node2 (2);
if (ubs2.find (node2) != 0)
{
ACE_ERROR ((LM_ERROR, "Error: ubs2.find (node2) != 0\n"));
retval = -1;
}
MyNode node3 (3);
if (ubs2.find (node3) == 0)
{
ACE_ERROR ((LM_ERROR, "Error: ubs2.find (node3) == 0\n"));
retval = -1;
}
ubs2.insert (node3);
}
size_t s = count_const_set (ubs);
if (s != ubs.size ())
{
ACE_ERROR ((LM_ERROR, "Error: s != ubs.size ()\n"));
retval = -1;
}
ACE_Unbounded_Set<MyNode> ubs_insert;
MyNode node4 (4);
if (ubs_insert.insert (node4) != 0)
{
ACE_ERROR ((LM_ERROR, "Error: insert node4 failed\n"));
retval = -1;
}
if (ubs_insert.insert (node4) != 1)
{
ACE_ERROR ((LM_ERROR, "Error: insert node4 didn't return 1\n"));
retval = -1;
}
// Test iterating through a set and deleting elements.
{
ACE_Unbounded_Set<MyNode*> ubs3;
MyNode *n = 0;
for (int i = 0; i < 10; ++i)
{
n = new MyNode (i);
ubs3.insert (n);
}
MyNode **i_n = 0;
ACE_Unbounded_Set_Iterator<MyNode*> ubs3_iter (ubs3.begin ());
for (; ubs3_iter.next (i_n); ++ubs3_iter)
delete *i_n;
}
ACE_END_TEST;
return retval;
}
int
run_main (int, ACE_TCHAR *[])
{
int r;
unsigned k;
MyNode node (1);
ACE_START_TEST (ACE_TEXT ("Unbounded_Set_Test"));
ACE_Unbounded_Set<MyNode> ubs;
ACE_ASSERT (ubs.size () == 0);
// Insert a value. Immediately remove it.
r = ubs.insert (node);
ACE_ASSERT (r == 0);
ACE_ASSERT (ubs.size () == 1);
r = ubs.remove (node);
ACE_ASSERT (r == 0);
ACE_ASSERT (ubs.size () == 0);
// Insert several different values.
for (node.k = 1; node.k <= 5; node.k++)
{
r = ubs.insert (node);
ACE_ASSERT (r == 0);
ACE_ASSERT (ubs.size () == node.k);
}
// Test assigment of sets.
// To do that, we also test some of the iterator methods.
typedef ACE_Unbounded_Set<MyNode> MySet;
MySet ubs2 = ubs; // Test a typedef of a set.
ACE_ASSERT (ubs2.size() == ubs.size());
{
MySet::ITERATOR it1 (ubs);
MySet::iterator it2 (ubs2);
for (k = 1; k <= 5; k++)
{
ACE_ASSERT (! it1.done ());
ACE_ASSERT (! it2.done ());
MyNode n1 = *it1;
MyNode n2 = *it2;
ACE_ASSERT (n1 == n2);
it1.advance ();
it2.advance ();
}
ACE_ASSERT (it1.done ());
ACE_ASSERT (it2.done ());
// Verify that a set may be emptied while an iterator on the set is
// in-scope but inactive:
ubs.reset ();
// Restore original set from ubs2
ubs = ubs2;
}
// Selective deletion of elements and element retrieval.
{
MySet::iterator it (ubs2);
int deleted = 0;
while (! it.done ())
{
MyNode n = *it;
it.advance (); /* Being friendly here: Move the iterator on
so that element removal does not interfere
with the current iterator position.
The less friendly case, removal under the
current iterator position, is below. */
if (n.k % 2 == 1)
{
r = ubs2.remove (n);
deleted++;
}
}
ACE_ASSERT (ubs2.size () + deleted == ubs.size());
MyNode node2 (2);
ACE_ASSERT (ubs2.find (node2) == 0);
MyNode node3 (3);
ACE_ASSERT (ubs2.find (node3) != 0);
ubs2.insert (node3);
}
size_t s = count_const_set (ubs);
ACE_ASSERT (s == ubs.size ());
// Test deletion under the cursor.
// This is the regression test for Bugzilla bug 1460.
{
MySet::iterator end = ubs2.end ();
for (MySet::iterator i = ubs2.begin (); i != end; i++)
{
r = ubs2.remove (*i);
ACE_ASSERT (r == 0);
}
ACE_ASSERT (ubs2.size () == 0);
}
ACE_ASSERT (ubs2.is_empty ());
ACE_END_TEST;
return 0;
}