if (is_leaf(node))
{
+ /*
for (int i = 0; i < node->potential_buckets_count; i++)
{
if (node->potential_buckets[i] == node->bucket)
return;
}
+ */
+ assert(node->bucket != NULL);
node->potential_buckets[node->potential_buckets_count++] = node->bucket;
return;
}
assert(node != NULL);
assert(node->potential_buckets_count <= MAX_POTENTIAL_BUCKETS_COUNT);
- if (node->parent == NULL)
- assert(node->bucket != NULL);
+ //if (node->parent == NULL)
+ //assert(node->bucket != NULL);
if (is_leaf(node))
{
assert(node->potential_buckets_count > 0);
+ assert(node->potential_buckets[0] != NULL);
+ assert(node->potential_buckets[0] == node->bucket);
return;
}
if (node == NULL)
return;
- if (node->parent == NULL)
- assert(node->bucket != NULL);
+ //if (node->parent == NULL)
+ //assert(node->bucket != NULL);
assert(node->potential_buckets_count <= MAX_POTENTIAL_BUCKETS_COUNT);
if (node->parent == NULL)
{
assert(node->potential_buckets_count > 0);
- assert(node->bucket != NULL);
+ assert(node->potential_buckets[0] != NULL);
+ //assert(node->bucket != NULL);
node->bucket = node->potential_buckets[0];
goto descent;
}