mirror of
https://github.com/Mercury-Language/mercury.git
synced 2025-12-18 23:35:25 +00:00
ef55b420fd
Estimated hours taken: 12
Branches: main
Remove from std_util.m the predicates that merely call predicates in
the type_desc, construct and deconstruct modules, to reduce clutter
in std_util.m.
library/std_util.m:
Remove those predicates from std_util.m.
library/deconstruct.m:
Add a type we need that was previously defined in std_util.m.
library/construct.m:
Delete some module qualifications that have now become unnecessary,
browser/browse.m:
browser/browser_info.m:
browser/declarative_tree.m:
browser/dl.m:
browser/help.m:
browser/sized_pretty.m:
browser/term_rep.m:
compiler/bytecode_gen.m:
compiler/llds_out.m:
compiler/mlds_to_il.m:
compiler/mlds_to_managed.m:
library/assoc_list.m:
library/hash_table.m:
library/io.m:
library/pprint.m:
library/private_builtin.m:
library/prolog.m:
library/require.m:
library/rtti_implementation.m:
library/store.m:
library/term.m:
library/term_to_xml.m:
library/version_hash_table.m:
mdbcomp/program_representation.m:
Import type_desc.m, construct.m and/or deconstruct.m to provide
definitions of functions or predicates that up till now were in
std_util.m. Modify the calls if the called function or predicate
had a slightly different interface in std_util.m.
Also, convert term_to_xml.m to four-space indentation, and delete
unnecessary module qualifications in term.m.
tests/debugger/polymorphic_output.{m,inp,exp,exp2}:
tests/hard_coded/copy_pred_2.m:
tests/hard_coded/deconstruct_arg.exp:
tests/hard_coded/deconstruct_arg.exp2:
tests/hard_coded/deconstruct_arg.m:
tests/hard_coded/elim_special_pred.m:
tests/hard_coded/existential_bound_tvar.m:
tests/hard_coded/expand.m:
tests/hard_coded/foreign_type2.m:
tests/hard_coded/higher_order_type_manip.m:
tests/hard_coded/nullary_ho_func.m:
tests/hard_coded/tuple_test.m:
tests/hard_coded/type_ctor_desc.m:
tests/hard_coded/type_qual.m:
tests/hard_coded/write_xml.m:
tests/hard_coded/sub-modules/class.m:
tests/hard_coded/sub-modules/nested.m:
tests/hard_coded/sub-modules/nested2.m:
tests/hard_coded/sub-modules/nested3.m:
tests/hard_coded/sub-modules/parent.m:
tests/hard_coded/sub-modules/parent2.child.m:
tests/hard_coded/typeclasses/existential_rtti.m:
tests/recompilation/type_qual_re.m.1:
cvs update: Updating tests/submodules
cvs update: Updating tests/tabling
cvs update: Updating tests/term
cvs update: Updating tests/tools
cvs update: Updating tests/trailing
cvs update: Updating tests/typeclasses
cvs update: Updating tests/valid
tests/valid/agc_unbound_typevars.m:
tests/valid/agc_unbound_typevars2.m:
tests/valid/agc_unused_in.m:
Replace references to the deleted predicates in std_util with
references to the equivalent predicates in type_desc, construct
and/or deconstruct. In test cases that already tested both the
functionality in std_util and in the other modules, simply delete
the part exercising std_util.
46 lines
779 B
Mathematica
46 lines
779 B
Mathematica
:- module existential_bound_tvar.
|
|
|
|
:- interface.
|
|
|
|
:- pred main(io::di, io::uo) is det.
|
|
|
|
:- import_module io.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module list.
|
|
:- import_module type_desc.
|
|
|
|
main -->
|
|
{ blah(101, X) },
|
|
print("X: value = "), print(X), nl,
|
|
print("X: type = "), print(type_of(X)), nl,
|
|
|
|
{ blah2(101, Y) },
|
|
print("Y: value = "), print(Y), nl,
|
|
print("Y: type = "), print(type_of(Y)), nl,
|
|
|
|
(
|
|
{ blah3([101], Z) }
|
|
->
|
|
print("Z: value = "), print(Z), nl,
|
|
print("Z: type = "), print(type_of(Z)), nl
|
|
;
|
|
write("ERROR\n")
|
|
).
|
|
|
|
:- some [T1] pred blah(T, T1).
|
|
:- mode blah(in, out) is det.
|
|
|
|
blah(X, X).
|
|
|
|
:- some [T1] pred blah2(T, T1).
|
|
:- mode blah2(in, out) is det.
|
|
|
|
blah2(X, [X]).
|
|
|
|
:- some [T1] pred blah3(list(T), T1).
|
|
:- mode blah3(in, out) is semidet.
|
|
|
|
blah3([X], X).
|