printHashTableState()

template<typename T>

void printHashTableState

(

const T &

cont

)

Definition at line 90 of file monomial-collection.hpp.

{
  // basic layout data
  std::cout << "size:            " << cont.size() << std::endl;
  std::cout << "buckets:         " << cont.bucket_count() << std::endl;
  std::cout << "load factor:     " << cont.load_factor() << std::endl;
  std::cout << "max load factor: " << cont.max_load_factor() << std::endl;
 
  // iterator category
  if (typeid(typename std::iterator_traits<typename T::iterator>::iterator_category)
      == typeid(std::bidirectional_iterator_tag))
    {
      std::cout << "chaining style:  doubly-linked" << std::endl;
    }
  else
    {
      std::cout << "chaining style:  singly-linked" << std::endl;
    }
 
  // elements per bucket
  std::cout << "data: " << std::endl;
  for (auto idx=0ul; idx != cont.bucket_count(); ++idx)
    {
      std::cout << " b[" << std::setw(2) << idx << "]: ";
      for (auto pos = cont.begin(idx); pos != cont.end(idx); ++pos)
        {
          std::cout << *pos << " ";
        }
      std::cout << std::endl;
    }
}

References T::size, and T.