mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-16 18:03:36 +00:00
bb8e42ad44
library/hash_table.m:
Switch to using kv_lists to represent items in overflowing buckets.
This is both cleaner and more efficient.
Give many types, function symbols, predicates, functions and variables
more meaningful names.
Add XXXs to mark some significant potential problems.
When an operation has both function and predicate forms, make the
function form forward to the predicate form, as we do in the rest
of the standard library.
Make equality testing between a key in a hash bucket and a search key
explicit in all cases.
library/kv_list.m:
Add some functionality that hash_table.m now needs from kv_lists.
library/assoc_list.m:
Add some functionality that kv_list.m now has, to maintain parity
between the two modules.
NEWS:
Announce the changes to assoc_list.m. (The changes to kv_list are moot,
since it is a new module.)
tests/hard_coded/hash_table_test.{m,exp}:
Make the progress messages output by this test more meaningful,
and update its programming style.
150 lines
4.0 KiB
Mathematica
150 lines
4.0 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module hash_table_test.
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io::di, io::uo) is det.
|
|
|
|
%---------------------------------------------------------------------------%
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- import_module benchmarking.
|
|
:- import_module hash_table.
|
|
:- import_module int.
|
|
:- import_module list.
|
|
:- import_module require.
|
|
:- import_module string.
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
main(!IO) :-
|
|
io.command_line_arguments(Args, !IO),
|
|
(
|
|
Args = [],
|
|
A = "1000000",
|
|
B = "0.9"
|
|
;
|
|
Args = [A],
|
|
B = "0.9"
|
|
;
|
|
Args = [A, B | _]
|
|
),
|
|
Max = string.det_to_int(A),
|
|
MaxOccupancy = string.det_to_float(B),
|
|
some [!HT] (
|
|
!:HT = hash_table.init(int.hash, 1, MaxOccupancy),
|
|
|
|
io.write_string("Inserting elements\n", !IO),
|
|
inst_preserving_fold_up(do_insert, 0, Max - 1, !HT),
|
|
trace [runtime(env("HASH_TABLE_STATS"))] (
|
|
impure report_stats
|
|
),
|
|
|
|
io.write_string("Looking up elements\n", !IO),
|
|
inst_preserving_fold_up(do_lookup, 0, Max - 1, !HT),
|
|
trace [runtime(env("HASH_TABLE_STATS"))] (
|
|
impure report_stats
|
|
),
|
|
|
|
NumOccupants0 = hash_table.num_occupants(!.HT),
|
|
( if NumOccupants0 = Max then
|
|
true
|
|
else
|
|
error("num_occupants failed")
|
|
),
|
|
|
|
Half = Max / 2,
|
|
io.write_string("Deleting some elements\n", !IO),
|
|
inst_preserving_fold_up(do_delete, 0, Half - 1, !HT),
|
|
trace [runtime(env("HASH_TABLE_STATS"))] (
|
|
impure report_stats
|
|
),
|
|
|
|
NumOccupants = hash_table.num_occupants(!.HT),
|
|
( if NumOccupants = Max - Half then
|
|
true
|
|
else
|
|
error("num_occupants failed")
|
|
),
|
|
|
|
AL = hash_table.to_assoc_list(!.HT),
|
|
( if list.length(AL) = NumOccupants then
|
|
true
|
|
else
|
|
error("to_assoc_list failed")
|
|
),
|
|
|
|
io.write_string("Setting negative elements\n", !IO),
|
|
inst_preserving_fold_up(do_set_neg, 0, Max - 1, !HT),
|
|
trace [runtime(env("HASH_TABLE_STATS"))] (
|
|
impure report_stats
|
|
),
|
|
|
|
io.write_string("Looking up negative elements\n", !IO),
|
|
inst_preserving_fold_up(do_lookup_neg, 0, Max - 1, !HT),
|
|
trace [runtime(env("HASH_TABLE_STATS"))] (
|
|
impure report_stats
|
|
),
|
|
|
|
_ = !.HT
|
|
).
|
|
|
|
% Or simply hash_table_di, hash_table_uo.
|
|
:- pred inst_preserving_fold_up(pred(int, T, T), int, int, T, T).
|
|
:- mode inst_preserving_fold_up(pred(in, di(I), out(I)) is det,
|
|
in, in, di(I), out(I)) is det.
|
|
|
|
inst_preserving_fold_up(P, Lo, Hi, !A) :-
|
|
( if Lo =< Hi then
|
|
P(Lo, !A),
|
|
inst_preserving_fold_up(P, Lo + 1, Hi, !A)
|
|
else
|
|
true
|
|
).
|
|
|
|
:- pred do_insert(int::in, hash_table(int, int)::hash_table_di,
|
|
hash_table(int, int)::hash_table_uo) is det.
|
|
|
|
do_insert(I, !HT) :-
|
|
hash_table.det_insert(I, I, !HT).
|
|
|
|
:- pred do_lookup(int::in, hash_table(int, int)::hash_table_di,
|
|
hash_table(int, int)::hash_table_uo) is det.
|
|
|
|
do_lookup(I, !HT) :-
|
|
V = hash_table.lookup(!.HT, I),
|
|
( if I = V then
|
|
true
|
|
else
|
|
error("do_lookup failed")
|
|
).
|
|
|
|
:- pred do_lookup_neg(int::in, hash_table(int, int)::hash_table_di,
|
|
hash_table(int, int)::hash_table_uo) is det.
|
|
|
|
do_lookup_neg(I, !HT) :-
|
|
V = hash_table.lookup(!.HT, I),
|
|
( if -I = V then
|
|
true
|
|
else
|
|
error("do_lookup_neg failed")
|
|
).
|
|
|
|
:- pred do_delete(int::in, hash_table(int, int)::hash_table_di,
|
|
hash_table(int, int)::hash_table_uo) is det.
|
|
|
|
do_delete(I, !HT) :-
|
|
hash_table.delete(I, !HT).
|
|
|
|
:- pred do_set_neg(int::in, hash_table(int, int)::hash_table_di,
|
|
hash_table(int, int)::hash_table_uo) is det.
|
|
|
|
do_set_neg(I, !HT) :-
|
|
hash_table.set(I, -I, !HT).
|