mirror of
https://github.com/Mercury-Language/mercury.git
synced 2025-12-19 07:45:09 +00:00
0f6a3d59d1
Makefile: added entries for the new files. codegen.nl: This is really a new file (well almost). Contains the top level of the code generator. doit.nl: Added the new files (and mode_error which was missing). hlds.nl: Changed the type declaration for unifications to use arg_mode instead of mode. hlds_out.nl: Small change for the above alteration. llds.nl: Minor changes. mode_util.nl: Change the modes to arg_modes for unifications. modes.nl: ditto. std_util.nl: more assoc_list predicates... term.nl: Fixed a small but nasty by in term__vars_list (and don't forget Fergus that you owe me a chocolate biscuit).
144 lines
4.4 KiB
Mathematica
144 lines
4.4 KiB
Mathematica
%-----------------------------------------------------------------------------%
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% File: std_util.nl.
|
|
% Main author: fjh.
|
|
|
|
% This file is intended for all the useful standard utilities
|
|
% that don't belong elsewhere, like <stdlib.h> in C.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- module std_util.
|
|
:- interface.
|
|
:- import_module list.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% The universal type.
|
|
% Note that the current NU-Prolog implementation of univ_to_type
|
|
% is buggy in that it always succeeds, even if the types didn't
|
|
% match, so until this gets implemented correctly, don't use
|
|
% univ_to_type unless you are sure that the types will definely match.
|
|
|
|
:- type univ.
|
|
|
|
:- pred type_to_univ(_T, univ).
|
|
:- mode type_to_univ(in, out).
|
|
:- mode type_to_univ(out, in).
|
|
|
|
:- pred univ_to_type(univ, _T).
|
|
:- mode univ_to_type(in, out).
|
|
:- mode univ_to_type(out, in).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% The boolean type.
|
|
% Unlike most languages, we use `yes' and `no' as boolean constants
|
|
% rather than `true' and `false'. This is to avoid confusion
|
|
% with the predicates `true' and `fail'.
|
|
|
|
:- type bool ---> yes ; no.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% compare/3 is not possible in a strictly parametric polymorphic type
|
|
% system such as that of Goedel.
|
|
|
|
:- type comparison_result ---> (=) ; (<) ; (>).
|
|
|
|
:- pred compare(comparison_result, T, T).
|
|
:- mode compare(out, in, in).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- type unit ---> unit.
|
|
|
|
:- type pair(T1, T2) ---> (T1 - T2).
|
|
:- type pair(T) == pair(T,T).
|
|
|
|
:- type assoc_list(K,V) == list(pair(K,V)).
|
|
|
|
:- pred assoc_list__reverse_members(assoc_list(K, V), assoc_list(V, K)).
|
|
:- mode assoc_list__reverse_members(in, out) is det.
|
|
|
|
:- pred assoc_list__from_corresponding_lists(list(K), list(V),
|
|
assoc_list(K, V)).
|
|
:- mode assoc_list__from_corresponding_lists(in, in, out) is det.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- pred gc_call(pred).
|
|
|
|
:- pred solutions(pred(T), list(T)).
|
|
:- mode solutions(complicated_mode, out).
|
|
|
|
% The following is a temporary hack until we implement higher-order
|
|
% modes.
|
|
|
|
:- mode complicated_mode :: input.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% Declaratively, `report_stats' is the same as `true'.
|
|
% It has the side-effect of reporting some memory and time usage statistics
|
|
% to stdout. (Technically, every Mercury implementation must offer
|
|
% a mode of invokation which disables this side-effect.)
|
|
|
|
:- pred report_stats.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% `semidet_succeed' is exactly the same as `true', except that
|
|
% the compiler thinks that it is semi-deterministic. You can
|
|
% use calls to `semidet_succeed' to suppress warnings about
|
|
% determinism declarations which could be stricter.
|
|
|
|
:- pred semidet_succeed is semidet.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- import_module require.
|
|
|
|
/*
|
|
:- external("NU-Prolog", gc_call/1).
|
|
:- external("NU-Prolog", report_stats/0).
|
|
:- external("NU-Prolog", solutions/2).
|
|
:- external("NU-Prolog", type_to_univ).
|
|
*/
|
|
|
|
assoc_list__reverse_members([], []).
|
|
assoc_list__reverse_members([K-V|KVs], [V-K|VKs]) :-
|
|
assoc_list__reverse_members(KVs, VKs).
|
|
|
|
assoc_list__from_corresponding_lists(As, Bs, ABs) :-
|
|
(
|
|
assoc_list__from_corresponding_lists_2(As, Bs, ABs0)
|
|
->
|
|
ABs = ABs0
|
|
;
|
|
error("Lists have different lengths.")
|
|
).
|
|
|
|
:- pred assoc_list__from_corresponding_lists_2(list(K), list(V),
|
|
assoc_list(K, V)).
|
|
:- mode assoc_list__from_corresponding_lists_2(in, in, out).
|
|
|
|
assoc_list__from_corresponding_lists_2([], [], []).
|
|
assoc_list__from_corresponding_lists_2([A|As], [B|Bs], [A - B|ABs]) :-
|
|
assoc_list__from_corresponding_lists_2(As, Bs, ABs).
|
|
|
|
univ_to_type(Univ, X) :- type_to_univ(X, Univ).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% Some hacks to prevent compiler warnings.
|
|
|
|
semidet_succeed :-
|
|
1 = 1.
|
|
|
|
%-----------------------------------------------------------------------------%
|