summaryrefslogtreecommitdiff
path: root/cesar/lib/test/set
diff options
context:
space:
mode:
authorschodet2009-03-04 10:41:33 +0000
committerschodet2009-03-04 10:41:33 +0000
commit4ddfa7d3c074d199e239249707ac99de9b1f625f (patch)
tree859019b0e65794a6e27a88a668c8589b4c238302 /cesar/lib/test/set
parentc0899faae66dcc35c9ebb63040c85991c7ce860b (diff)
* lib/set:
- added set_node_in_any_set. git-svn-id: svn+ssh://pessac/svn/cesar/trunk@4149 017c9cb6-072f-447c-8318-d5b54f68fe89
Diffstat (limited to 'cesar/lib/test/set')
-rw-r--r--cesar/lib/test/set/src/test_set.c9
1 files changed, 9 insertions, 0 deletions
diff --git a/cesar/lib/test/set/src/test_set.c b/cesar/lib/test/set/src/test_set.c
index 971c699cec..1a4544e0ef 100644
--- a/cesar/lib/test/set/src/test_set.c
+++ b/cesar/lib/test/set/src/test_set.c
@@ -73,6 +73,8 @@ set_check_node (test_t t, set_node_t *node, uint *depth, set_node_less_t less)
uint size, ldepth, rdepth;
dbg_assert (node && node != node->left);
dbg_assert (depth);
+ /* Node is in a set. */
+ test_fail_unless (set_node_in_any_set (node));
/* AA-tree structure checks. */
test_fail_unless (node->level > node->right->right->level);
test_fail_unless (node->level == node->left->level + 1);
@@ -220,6 +222,8 @@ set_basic_test_case (test_t t)
{
test_fail_unless (set_empty (&set));
test_fail_unless (set_begin (&set) == set_end (&set));
+ for (i = 0; i < COUNT (nodes); i++)
+ test_fail_unless (!set_node_in_any_set (&nodes[i].node));
} test_end;
/* Insert. */
test_begin (t, "insert")
@@ -228,7 +232,9 @@ set_basic_test_case (test_t t)
test_fail_unless (0 == set_check (t, &set, &depth));
for (i = 0; i < COUNT (nodes); i++)
{
+ test_fail_if (set_node_in_any_set (&nodes[i].node));
test_fail_unless (set_insert (&set, &nodes[i].node));
+ test_fail_unless (set_node_in_any_set (&nodes[i].node));
if (DEBUG)
{
test_fail_unless (i + 1 == set_check (t, &set, &depth));
@@ -266,6 +272,7 @@ set_basic_test_case (test_t t)
n = &nodes[lib_rnd_uniform (rnd, NB_NODES)];
k.data = n->data;
test_fail_unless (set_find (&set, &k.node) == &n->node);
+ test_fail_unless (set_node_in_any_set (&n->node));
}
else
{
@@ -296,6 +303,7 @@ set_basic_test_case (test_t t)
} while (set_find (&set, &k.node));
/* Remove. */
set_remove (&set, &n->node);
+ test_fail_if (set_node_in_any_set (&n->node));
if (DEBUG)
{
test_fail_unless (COUNT (nodes) - 1
@@ -307,6 +315,7 @@ set_basic_test_case (test_t t)
/* Insert. */
n->data = r;
test_fail_unless (set_insert (&set, &n->node));
+ test_fail_unless (set_node_in_any_set (&n->node));
if (DEBUG)
{
test_fail_unless (COUNT (nodes)