// test.cpp,v 4.9 1999/06/06 21:31:01 schmidt Exp

// Tests the generated perfect hash function.

// The -v option prints diagnostics as to whether a word is in the set
// or not.  Without -v the program is useful for timing.
  
#include "ace/OS.h"

ACE_RCSID(tests, test, "test.cpp,v 4.9 1999/06/06 21:31:01 schmidt Exp")

static const int MAX_LEN = 80;

// Lookup function.
const char *in_word_set (const char *str, unsigned int len);

int 
main (int argc, char *argv[])
{
  int verbose = argc > 1 && ACE_OS::strcmp (argv[1], "-v") == 0 ? 1 : 0;
  char buf[MAX_LEN];

  while (ACE_OS::fgets (buf, sizeof buf, stdin) != 0) 
    {
      int len = ACE_OS::strlen (buf) - 1;
      buf[len] = '\0';
      if (in_word_set (buf, len) && verbose)
        printf ("in word set %s\n", buf);
      else if (verbose) 
        printf ("NOT in word set %s\n", buf);
    }

  return 0;
}