string_set.cpp

// $Id: string_set.cpp,v 1.1 2019-04-15 14:54:04-07 - - $
// Wai Chun Leung
// wleung11

#include <string>
#include <unordered_set>
using namespace std;

#include "string_set.h"

unordered_set<string> string_set::set;

string_set::string_set() {
   set.max_load_factor (0.5);
}

string_set set;

const string* string_set::intern (const char* string) {
   auto handle = set.insert (string);
   return &*handle.first;
}

void string_set::dump (FILE* out) {
   static unordered_set<string>::hasher hash_fn
               = string_set::set.hash_function();
   size_t max_bucket_size = 0;
   for (size_t bucket = 0; bucket < set.bucket_count(); ++bucket) {
      bool need_index = true;
      size_t curr_size = set.bucket_size (bucket);
      if (max_bucket_size < curr_size) max_bucket_size = curr_size;
      for (auto itor = set.cbegin (bucket);
           itor != set.cend (bucket); ++itor) {
         if (need_index) fprintf (out, "string_set[%4zu]: ", bucket);
                    else fprintf (out, "           %4s   ", "");
         need_index = false;
         const string* str = &*itor;
         fprintf (out, "%20zu %p->\"%s\"\n", hash_fn(*str),
                  static_cast<const void*> (str), str->c_str());
      }
   }
   fprintf (out, "load_factor = %.3f\n", set.load_factor());
   fprintf (out, "bucket_count = %zu\n", set.bucket_count());
   fprintf (out, "max_bucket_size = %zu\n", max_bucket_size);
}