2020-01-16 06:59:34 +03:00
|
|
|
import Collection;
|
|
|
|
|
|
2020-08-06 14:56:41 +03:00
|
|
|
local a = {1, 2, 3}, b = {1, 2, 3}, t = emptyHashTab (16, hash, compare);
|
2020-01-16 06:59:34 +03:00
|
|
|
|
|
|
|
|
t := addHashTab (t, a, 100);
|
2020-08-06 14:56:41 +03:00
|
|
|
printf ("HashTab internal structure: %s\n", internalOf (t).string);
|
2020-01-16 06:59:34 +03:00
|
|
|
|
|
|
|
|
t := addHashTab (t, b, 200);
|
2020-08-06 14:56:41 +03:00
|
|
|
printf ("HashTab internal structure: %s\n", internalOf (t).string);
|
2020-01-16 06:59:34 +03:00
|
|
|
|
|
|
|
|
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)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|