mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-19 19:33:46 +00:00
95f59cf7c9
compiler/switch_util.m:
Rename dont_need_bit_vec_check variant of need_bit_vec_check to
dont_need_bit_vec_check_no_gaps.
Add dont_need_bit_vec_check_with_gaps (see below).
Make type_range return the correct min and max values used by a
subtype enum type. For now, it fails unless the range of values
is contiguous.
Make find_int_lookup_switch_params use the min and max values for a
type returned by type_range, not assuming 0 to the max value.
Make find_int_lookup_switch_params return
dont_need_bit_vec_check_with_gaps when a bit vector check is not
required before a table lookup, yet the table is expected to contain
dummy rows. This is the case for a cannot_fail switch on a subtype
enum type type, where the subtype does not use some values between
the min and max values.
compiler/dense_switch.m:
Make tagged_case_list_is_dense_switch use the min and max values for
a type returned by type_range, not assuming 0 to the max value.
compiler/ml_lookup_switch.m:
Expect the generated lookup table to contain dummy rows or not
depending on dont_need_bit_vec_check_{with_gaps,no_gaps}.
Conform to change to need_bit_vec_check.
compiler/lookup_switch.m:
compiler/ml_string_switch.m:
Conform to change to need_bit_vec_check.
tests/hard_coded/Mmakefile:
tests/hard_coded/dense_lookup_switch4.exp:
tests/hard_coded/dense_lookup_switch4.m:
tests/hard_coded/dense_lookup_switch_non2.exp:
tests/hard_coded/dense_lookup_switch_non2.m:
Add test cases.
63 lines
1.2 KiB
Mathematica
63 lines
1.2 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
:- module dense_lookup_switch4.
|
|
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io::di, io::uo) is det.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module char.
|
|
:- import_module list.
|
|
|
|
:- type foo
|
|
---> a ; b ; c ; d ; e ; f ; g ; h ; i ; j.
|
|
|
|
:- type bar =< foo
|
|
---> g ; c ; e ; f ; b ; d ; h.
|
|
% One contiguous range, deliberately misordered.
|
|
|
|
main(!IO) :-
|
|
Xs = [b, c, d, e, f, g, h],
|
|
list.foldl(test, Xs, !IO).
|
|
|
|
:- pred test(bar::in, io::di, io::uo) is det.
|
|
|
|
test(Bar, !IO) :-
|
|
io.write(Bar, !IO),
|
|
io.write_string(": ", !IO),
|
|
p1(Bar, Int),
|
|
io.write_int(Int, !IO),
|
|
io.write_string(" ", !IO),
|
|
( if p2(Bar, Char) then
|
|
io.write_char(Char, !IO)
|
|
else
|
|
io.write_string("-", !IO)
|
|
),
|
|
io.nl(!IO).
|
|
|
|
:- pred p1(bar::in, int::out) is det.
|
|
|
|
p1(b, 2).
|
|
p1(c, 3).
|
|
p1(d, 4).
|
|
p1(e, 5).
|
|
p1(f, 6).
|
|
p1(g, 7).
|
|
p1(h, 8).
|
|
|
|
:- pred p2(bar::in, char::out) is semidet.
|
|
|
|
% p2(b, 'b').
|
|
p2(c, 'c').
|
|
p2(d, 'd').
|
|
% p2(e, 'e').
|
|
p2(f, 'f').
|
|
p2(g, 'g').
|
|
% p2(h, 'h').
|