librnr/hash.c
static void compute_bits()
{
  hash_val_t val  = HASH_VAL_T_MAX;  // Steps 1
  int bits        = 0;

  // Steps 3
  while(val)
  {
    bits++;
    val >>= 1;
  }

  hash_val_t_bit = bits;
}
/*!
 * \brief Compute the number of bits in the \ref hash_val_t type.
 *
 * We know that \ref hash_val_t is an unsigned integral type.
 * Thus the highest value it can hold is a
 * Mersenne number (power of two, less one). We initialize a \ref hash_val_t
 * object with this value and then shift bits out one by one while counting.
 *
 * \par Notes &amp; Steps:
 * \b 1.
 *    \ref HASH_VAL_T_MAX is a Mersenne number---one that is one less than a
 *    power of two. This means that its binary representation consists of all
 *    one bits, and hence ``val'' is initialized to all one bits.\n
 * \b 2.
 *    We reset the bit count to zero in case this function is invoked more than
 *    once.\n
 * \b 3.
 *    While bits remain in val, we increment the bit count and shift it to the
 *    right, replacing the topmost bit by zero.
 */
\brief Compute the number of bits in the \ref hash_val_t type.
We know that \ref hash_val_t is an unsigned integral type.
Thus the highest value it can hold is a
Mersenne number (power of two, less one). We initialize a \ref hash_val_t
object with this value and then shift bits out one by one while counting.

\par Notes & Steps:
\b 1.
\ref HASH_VAL_T_MAX is a Mersenne number---one that is one less than a
power of two. This means that its binary representation consists of all
one bits, and hence ``val'' is initialized to all one bits.\n
\b 2.
We reset the bit count to zero in case this function is invoked more than
once.\n
\b 3.
While bits remain in val, we increment the bit count and shift it to the
right, replacing the topmost bit by zero.
\ brief Compute the number of bits in the \ ref hash_val_t type . We know that \ ref hash_val_t is an unsigned integral type . Thus the highest value it can hold is a Mersenne number ( power of two less one ) . We initialize a \ ref hash_val_t object with this value and then shift bits out one by one while counting . \ par Notes & Steps : \ b 1 . \ ref HASH_VAL_T_MAX is a Mersenne number --- one that is one less than a power of two . This means that its binary representation consists of all one bits and hence ` ` val ' ' is initialized to all one bits . \ n \ b 2 . We reset the bit count to zero in case this function is invoked more than once . \ n \ b 3 . While bits remain in val we increment the bit count and shift it to the right replacing the topmost bit by zero .
static void compute_bits()
{
  hash_val_t val  = HASH_VAL_T_MAX;  
  int bits        = 0;
  while(val)
  {
    bits++;
    val >>= 1;
  }
  hash_val_t_bit = bits;
}
static void compute_bits ( ) { hash_val_t val = HASH_VAL_T_MAX ; int bits = 0 ; while ( val ) { bits ++ ; val >>= 1 ; } hash_val_t_bit = bits ; }
\brief Compute the number of bits in the \ref hash_val_t type.
\ brief Compute the number of bits in the \ ref hash_val_t type .
// Steps 1 // Steps 3