unsigned int i;
assert (offset <= UINT_BIT);
- for (i = offset; i-- > 0; )
+ for (i = offset; i-- > 0;)
if (pattern & (1u << i))
{
*start = i;
if (node_ == NULL)
return;
- node = abt_data (node_, struct range_tower_node, abt_node);
+ node = ABT_DATA (node_, struct range_tower_node, abt_node);
printf ("%lu+%lu/%d", node->n_zeros, node->n_ones, node->abt_node.level);
if (node->abt_node.down[0] || node->abt_node.down[1])
{
return rt;
}
-/* Returns an unsigned int with bits OFS...OFS+CNT (exclusive)
+/* Returns an unsigned int with bits OFS...OFS+N (exclusive)
tower to 1, other bits tower to 0. */
static unsigned int
-bit_range (unsigned int ofs, unsigned int cnt)
+bit_range (unsigned int ofs, unsigned int n)
{
assert (ofs < UINT_BIT);
- assert (cnt <= UINT_BIT);
- assert (ofs + cnt <= UINT_BIT);
+ assert (n <= UINT_BIT);
+ assert (ofs + n <= UINT_BIT);
- return cnt < UINT_BIT ? ((1u << cnt) - 1) << ofs : UINT_MAX;
+ return n < UINT_BIT ? ((1u << n) - 1) << ofs : UINT_MAX;
}
\f
/* Tests setting all possible ranges of 1s into all possible range sets (up to