All items are now properly created, copied and destroyed.
  (too much copying - should avoid in later development)

Modified API of dns-simple 'library':
  Added destructors which take ** to the object
    and are setting the pointer to NULL.
  dnss_dname_to_wire() now takes the position and allocated size as parameters.
  dnss_create_response(), dnss_create_error_response() and dnss_wire_format()
    now all return errors as appropriate.

Fixed copying issues in dns-simple 'library':
  Questions and RRs are now copied entirely, not just pointers.
    (See functions dnss_copy_questions() and dnss_copy_rrs().)
  Added some checks for NULL-pointers when deallocating.

Added pointer to hash table item destructor function to the hash table.

ck_destroy_table() rewritten to destroy individual items in the table and buffer.

A lot of checks added (mostly for result of malloc).

Redundant and old code removed.

Bugfix in default A RR value (was string, should be 4 integers).
Ignoring query if response too long.
Removed some redundant code.
Added some debug output.

Modified functions hash_from_file() and test_lookup_from_file().
Some additional checks for successful memory allocation added.

Added use of the socket manager to listen for queries.
Added function answer_request() to be called from worker threads.

Replaced some macros by (static) const variables.
Added answer_request() function to be called.
Corrected dnss_create_response().
Added dnss_create_error_response().
dnss_wire_format() fixed.
dnss_parse_query() fixed.
socket manager fixed.

Creating default A RRs with dummy address (loopback), this has no implications
  on performance testing.
Fixed some bugs in dns-simple.
Added header common.h to contain common typedefs, constants and macros.
More consistent debug messages (better #ifdefs)

Removed read_domain_names() and test_lookup() functions.
Added dnss_wire_format(), dnss_dname_to_wire() and dnss_parse_query().
Many functions in universal-system.h and bitset.h not inline any more
  (should check it later and find a way to make them inline).

Classic (2-ary) cuckoo hash table with char* keys.
  (Insert, find, delete implemented.)
Simple bitset (not used right now).
Several hash functions downloaded from web.
Universal system of hash functions (according to J. Katajainen & M. Lykke
  of University of Copenhagen).
Several basic data structures for DNS data - not finished yet.