import Collection;

var a = {1, 2, 3}, b = {1, 2, 3}, t = emptyHashTab (16, hash, compare);

t := addHashTab (t, a, 100);
printf ("HashTab internal structure: %s\n", internalOf (t).string);

t := addHashTab (t, b, 200);
printf ("HashTab internal structure: %s\n", internalOf (t).string);

printf ("Searching: %s\n", findHashTab (t, a).string);
printf ("Searching: %s\n", findHashTab (t, b).string);

t := addHashTab (t, a, 800);

printf ("Replaced: %s\n", findHashTab (t, a).string);

t := removeHashTab (t, a);
printf ("Restored: %s\n", findHashTab (t, a).string)