mirror of
https://github.com/Mercury-Language/mercury.git
synced 2025-12-14 21:35:49 +00:00
459847a064
Estimated hours taken: 18 Branches: main Move the univ, maybe, pair and unit types from std_util into their own modules. std_util still contains the general purpose higher-order programming constructs. library/std_util.m: Move univ, maybe, pair and unit (plus any other related types and procedures) into their own modules. library/maybe.m: New module. This contains the maybe and maybe_error types and the associated procedures. library/pair.m: New module. This contains the pair type and associated procedures. library/unit.m: New module. This contains the types unit/0 and unit/1. library/univ.m: New module. This contains the univ type and associated procedures. library/library.m: Add the new modules. library/private_builtin.m: Update the declaration of the type_ctor_info struct for univ. runtime/mercury.h: Update the declaration for the type_ctor_info struct for univ. runtime/mercury_mcpp.h: runtime/mercury_hlc_types.h: Update the definition of MR_Univ. runtime/mercury_init.h: Fix a comment: ML_type_name is now exported from type_desc.m. compiler/mlds_to_il.m: Update the the name of the module that defines univs (which are handled specially by the il code generator.) library/*.m: compiler/*.m: browser/*.m: mdbcomp/*.m: profiler/*.m: deep_profiler/*.m: Conform to the above changes. Import the new modules where they are needed; don't import std_util where it isn't needed. Fix formatting in lots of modules. Delete duplicate module imports. tests/*: Update the test suite to confrom to the above changes.
67 lines
1.8 KiB
Mathematica
67 lines
1.8 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ft=mercury ts=4 sw=4 et
|
|
%---------------------------------------------------------------------------%
|
|
% Copyright (C) 2002-2003, 2006 The University of Melbourne.
|
|
% This file may only be copied under the terms of the GNU Library General
|
|
% Public License - see the file COPYING.LIB in the Mercury distribution.
|
|
%---------------------------------------------------------------------------%
|
|
|
|
% set_cc is an implementation of sets which uses compare_representation
|
|
% instead of builtin comparison, hence it is suitable for use with terms
|
|
% that don't have a canonical representation. It is implemented using
|
|
% tree234_cc; see that module for further discussion about the implications
|
|
% of using compare_representation.
|
|
%
|
|
% Author: Mark Brown (dougl)
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module mdb.set_cc.
|
|
|
|
:- interface.
|
|
:- import_module bool.
|
|
|
|
:- type set_cc(T).
|
|
|
|
:- pred init(set_cc(T)::uo) is det.
|
|
|
|
:- pred is_empty(set_cc(T)::in) is semidet.
|
|
|
|
:- pred member(T::in, set_cc(T)::in, bool::out) is cc_multi.
|
|
|
|
:- pred insert(set_cc(T)::in, T::in, set_cc(T)::out) is cc_multi.
|
|
|
|
:- pred delete(set_cc(T)::in, T::in, set_cc(T)::out) is cc_multi.
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- import_module mdb.tree234_cc.
|
|
|
|
:- import_module maybe.
|
|
|
|
:- type set_cc(T) == tree234_cc(T, unit).
|
|
|
|
init(S) :-
|
|
tree234_cc.init(S).
|
|
|
|
is_empty(S) :-
|
|
tree234_cc.is_empty(S).
|
|
|
|
member(T, S, Bool) :-
|
|
tree234_cc.search(S, T, Maybe),
|
|
(
|
|
Maybe = yes(_),
|
|
Bool = yes
|
|
;
|
|
Maybe = no,
|
|
Bool = no
|
|
).
|
|
|
|
insert(S0, T, S) :-
|
|
tree234_cc.set(S0, T, unit, S).
|
|
|
|
delete(S0, T, S) :-
|
|
tree234_cc.delete(S0, T, S).
|