[m-rev.] trivial diff: standardize comment position in library
Julien Fischer
juliensf at cs.mu.OZ.AU
Tue Jan 25 13:19:41 AEDT 2005
Estimated hours taken: 0.5
Branches: main
library/set_ctree234.m:
library/set_tree234.m:
library/svarray.m:
library/sveqvclass.m:
library/svqueue.m:
library/svset.m:
Standardize the positioning of descriptive comments.
Julien.
Index: set_ctree234.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/set_ctree234.m,v
retrieving revision 1.1
diff -u -r1.1 set_ctree234.m
--- set_ctree234.m 21 Jan 2005 03:32:17 -0000 1.1
+++ set_ctree234.m 24 Jan 2005 23:23:24 -0000
@@ -28,12 +28,12 @@
:- type set_ctree234(_T).
% `set_ctree234__init = Set' is true iff `Set' is an empty set.
-
+ %
:- func set_ctree234__init = set_ctree234(T).
% `set_ctree234__singleton_set(Elem, Set)' is true iff `Set' is the set
% containing just the single element `Elem'.
-
+ %
:- pred set_ctree234__singleton_set(T, set_ctree234(T)).
:- mode set_ctree234__singleton_set(in, out) is det.
:- mode set_ctree234__singleton_set(out, in) is semidet.
@@ -41,66 +41,66 @@
:- func set_ctree234__make_singleton_set(T) = set_ctree234(T).
% `set_ctree234__empty(Set)' is true iff `Set' is an empty set.
-
+ %
:- pred set_ctree234__empty(set_ctree234(_T)::in) is semidet.
% `set_ctree234__one_member(X, Set)' is true iff `X' is a member of `Set'.
-
+ %
:- pred set_ctree234__one_member(set_ctree234(T)::in, T::out) is nondet.
% `set_ctree234__is_member(Set, X, Result)' returns
% `Result = yes' iff `X' is a member of `Set'.
-
+ %
:- pred set_ctree234__is_member(set_ctree234(T)::in, T::in, bool::out) is det.
:- func set_ctree234__is_member(set_ctree234(T), T) = bool.
% `set_ctree234__contains(Set, X)' is true iff `X' is a member of `Set'.
-
+ %
:- pred set_ctree234__contains(set_ctree234(T)::in, T::in) is semidet.
% `set_ctree234__list_to_set(List) = Set' is true iff `Set' is the set
% containing only the members of `List'.
-
+ %
:- func set_ctree234__list_to_set(list(T)) = set_ctree234(T).
% `set_ctree234__sorted_list_to_set(List) = Set' is true iff `Set' is
% the set containing only the members of `List'. `List' must be sorted.
-
+ %
:- func set_ctree234__sorted_list_to_set(list(T)) = set_ctree234(T).
% `set_ctree234__to_sorted_list(Set) = List' is true iff `List' is the
% list of all the members of `Set', in sorted order.
-
+ %
:- func set_ctree234__to_sorted_list(set_ctree234(T)) = list(T).
% `set_ctree234__equal(SetA, SetB)' is true iff
% `SetA' and `SetB' contain the same elements.
-
+ %
:- pred set_ctree234__equal(set_ctree234(T)::in, set_ctree234(T)::in)
is semidet.
% `set_ctree234__subset(SetA, SetB)' is true iff `SetA' is a subset of
% `SetB'.
-
+ %
:- pred set_ctree234__subset(set_ctree234(T)::in, set_ctree234(T)::in)
is semidet.
% `set_ctree234__superset(SetA, SetB)' is true iff `SetA' is a
% superset of `SetB'.
-
+ %
:- pred set_ctree234__superset(set_ctree234(T)::in, set_ctree234(T)::in)
is semidet.
% `set_ctree234__insert(X, Set0, Set)' is true iff `Set' is the union
% of `Set0' and the set containing only `X'.
-
+ %
:- pred set_ctree234__insert(T::in, set_ctree234(T)::in, set_ctree234(T)::out)
is det.
:- func set_ctree234__insert(T, set_ctree234(T)) = set_ctree234(T).
% `set_ctree234__insert_list(Xs, Set0, Set)' is true iff `Set' is the
% union of `Set0' and the set containing only the members of `Xs'.
-
+ %
:- pred set_ctree234__insert_list(list(T)::in,
set_ctree234(T)::in, set_ctree234(T)::out) is det.
:- func set_ctree234__insert_list(list(T), set_ctree234(T)) = set_ctree234(T).
@@ -109,7 +109,7 @@
% relative complement of `Set0' and the set containing only `X', i.e.
% if `Set' is the set which contains all the elements of `Set0'
% except `X'.
-
+ %
:- pred set_ctree234__delete(T::in, set_ctree234(T)::in, set_ctree234(T)::out)
is det.
:- func set_ctree234__delete(T, set_ctree234(T)) = set_ctree234(T).
@@ -117,7 +117,7 @@
% `set_ctree234__delete_list(Xs, Set0, Set)' is true iff `Set' is the
% relative complement of `Set0' and the set containing only the members
% of `Xs'.
-
+ %
:- pred set_ctree234__delete_list(list(T)::in,
set_ctree234(T)::in, set_ctree234(T)::out) is det.
:- func set_ctree234__delete_list(list(T), set_ctree234(T)) = set_ctree234(T).
@@ -126,7 +126,7 @@
% and `Set' is the relative complement of `Set0' and the set
% containing only `X', i.e. if `Set' is the set which contains
% all the elements of `Set0' except `X'.
-
+ %
:- pred set_ctree234__remove(T::in, set_ctree234(T)::in, set_ctree234(T)::out)
is semidet.
@@ -134,20 +134,20 @@
% contain any duplicates, `Set0' contains every member of `Xs',
% and `Set' is the relative complement of `Set0' and the set
% containing only the members of `Xs'.
-
+ %
:- pred set_ctree234__remove_list(list(T)::in,
set_ctree234(T)::in, set_ctree234(T)::out) is semidet.
% `set_ctree234__remove_least(X, Set0, Set)' is true iff `X' is the
% least element in `Set0', and `Set' is the set which contains all the
% elements of `Set0' except `X'.
-
+ %
:- pred set_ctree234__remove_least(T::out,
set_ctree234(T)::in, set_ctree234(T)::out) is semidet.
% `set_ctree234(SetA, SetB) = Set' is true iff `Set' is the union
% of `SetA' and `SetB'.
-
+ %
:- pred set_ctree234__union(set_ctree234(T)::in, set_ctree234(T)::in,
set_ctree234(T)::out) is det.
:- func set_ctree234__union(set_ctree234(T), set_ctree234(T)) = set_ctree234(T).
@@ -161,7 +161,7 @@
% `set_ctree234__power_union(A) = B' is true iff `B' is the union of
% all the sets in `A'
-
+ %
:- pred set_ctree234__power_union(set_ctree234(set_ctree234(T))::in,
set_ctree234(T)::out) is det.
:- func set_ctree234__power_union(set_ctree234(set_ctree234(T)))
@@ -169,7 +169,7 @@
% `set_ctree234__intersect(SetA, SetB) = Set' is true iff `Set' is the
% intersection of `SetA' and `SetB'.
-
+ %
:- pred set_ctree234__intersect(set_ctree234(T)::in, set_ctree234(T)::in,
set_ctree234(T)::out) is det.
:- func set_ctree234__intersect(set_ctree234(T), set_ctree234(T))
@@ -177,19 +177,19 @@
% `set_ctree234__power_intersect(A, B)' is true iff `B' is the
% intersection of all the sets in `A'.
-
+ %
:- func set_ctree234__power_intersect(set_ctree234(set_ctree234(T)))
= set_ctree234(T).
% `set_ctree234__intersect_list(A, B)' is true iff `B' is the
% intersection of all the sets in `A'.
-
+ %
:- func set_ctree234__intersect_list(list(set_ctree234(T))) = set_ctree234(T).
% `set_ctree234__difference(SetA, SetB, Set)' is true iff `Set' is the
% set containing all the elements of `SetA' except those that
% occur in `SetB'.
-
+ %
:- pred set_ctree234__difference(set_ctree234(T)::in, set_ctree234(T)::in,
set_ctree234(T)::out) is det.
:- func set_ctree234__difference(set_ctree234(T), set_ctree234(T))
@@ -197,7 +197,7 @@
% `set_ctree234__count(Set, Count)' is true iff `Set' has
% `Count' elements.
-
+ %
:- func set_ctree234__count(set_ctree234(T)) = int.
:- pred set_ctree234__map(pred(T1, T2)::in(pred(in, out) is det),
@@ -218,6 +218,7 @@
% set_ctree234__divide(Pred, Set, TruePart, FalsePart):
% TruePart consists of those elements of Set for which Pred succeeds;
% FalsePart consists of those elements of Set for which Pred fails.
+ %
:- pred set_ctree234__divide(pred(T)::in(pred(in) is semidet),
set_ctree234(T)::in, set_ctree234(T)::out, set_ctree234(T)::out) is det.
@@ -225,11 +226,13 @@
% InPart consists of those elements of Set which are also in
% DivideBySet; OutPart consists of those elements of which are
% not in DivideBySet.
+ %
:- pred set_ctree234__divide_by_set(set_ctree234(T)::in, set_ctree234(T)::in,
set_ctree234(T)::out, set_ctree234(T)::out) is det.
:- pred verify_depths(set_ctree234(T)::in, list(int)::out) is det.
+%--------------------------------------------------------------------------%
%--------------------------------------------------------------------------%
:- implementation.
Index: set_tree234.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/set_tree234.m,v
retrieving revision 1.1
diff -u -r1.1 set_tree234.m
--- set_tree234.m 21 Jan 2005 03:32:17 -0000 1.1
+++ set_tree234.m 24 Jan 2005 23:25:37 -0000
@@ -18,12 +18,12 @@
:- type set_tree234(_T).
% `set_tree234__init = Set' is true iff `Set' is an empty set.
-
+ %
:- func set_tree234__init = set_tree234(T).
% `set_tree234__singleton_set(Elem, Set)' is true iff `Set' is the set
% containing just the single element `Elem'.
-
+ %
:- pred set_tree234__singleton_set(T, set_tree234(T)).
:- mode set_tree234__singleton_set(in, out) is det.
:- mode set_tree234__singleton_set(out, in) is semidet.
@@ -31,64 +31,64 @@
:- func set_tree234__make_singleton_set(T) = set_tree234(T).
% `set_tree234__empty(Set)' is true iff `Set' is an empty set.
-
+ %
:- pred set_tree234__empty(set_tree234(_T)::in) is semidet.
% `set_tree234__member(X, Set)' is true iff `X' is a member of `Set'.
-
+ %
:- pred set_tree234__member(set_tree234(T)::in, T::out) is nondet.
% `set_tree234__is_member(Set, X, Result)' returns
% `Result = yes' iff `X' is a member of `Set'.
-
+ %
:- pred set_tree234__is_member(set_tree234(T)::in, T::in, bool::out) is det.
:- func set_tree234__is_member(set_tree234(T), T) = bool.
% `set_tree234__contains(Set, X)' is true iff `X' is a member of `Set'.
-
+ %
:- pred set_tree234__contains(set_tree234(T)::in, T::in) is semidet.
% `set_tree234__list_to_set(List) = Set' is true iff `Set' is the set
% containing only the members of `List'.
-
+ %
:- func set_tree234__list_to_set(list(T)) = set_tree234(T).
% `set_tree234__sorted_list_to_set(List) = Set' is true iff `Set' is
% the set containing only the members of `List'. `List' must be sorted.
-
+ %
:- func set_tree234__sorted_list_to_set(list(T)) = set_tree234(T).
% `set_tree234__to_sorted_list(Set) = List' is true iff `List' is the
% list of all the members of `Set', in sorted order.
-
+ %
:- func set_tree234__to_sorted_list(set_tree234(T)) = list(T).
% `set_tree234__equal(SetA, SetB)' is true iff
% `SetA' and `SetB' contain the same elements.
-
+ %
:- pred set_tree234__equal(set_tree234(T)::in, set_tree234(T)::in) is semidet.
% `set_tree234__subset(SetA, SetB)' is true iff `SetA' is a subset of
% `SetB'.
-
+ %
:- pred set_tree234__subset(set_tree234(T)::in, set_tree234(T)::in) is semidet.
% `set_tree234__superset(SetA, SetB)' is true iff `SetA' is a
% superset of `SetB'.
-
+ %
:- pred set_tree234__superset(set_tree234(T)::in, set_tree234(T)::in)
is semidet.
% `set_tree234__insert(X, Set0, Set)' is true iff `Set' is the union
% of `Set0' and the set containing only `X'.
-
+ %
:- pred set_tree234__insert(T::in, set_tree234(T)::in, set_tree234(T)::out)
is det.
:- func set_tree234__insert(T, set_tree234(T)) = set_tree234(T).
% `set_tree234__insert_list(Xs, Set0, Set)' is true iff `Set' is the
% union of `Set0' and the set containing only the members of `Xs'.
-
+ %
:- pred set_tree234__insert_list(list(T)::in,
set_tree234(T)::in, set_tree234(T)::out) is det.
:- func set_tree234__insert_list(list(T), set_tree234(T)) = set_tree234(T).
@@ -97,7 +97,7 @@
% relative complement of `Set0' and the set containing only `X', i.e.
% if `Set' is the set which contains all the elements of `Set0'
% except `X'.
-
+ %
:- pred set_tree234__delete(T::in, set_tree234(T)::in, set_tree234(T)::out)
is det.
:- func set_tree234__delete(T, set_tree234(T)) = set_tree234(T).
@@ -105,7 +105,7 @@
% `set_tree234__delete_list(Xs, Set0, Set)' is true iff `Set' is the
% relative complement of `Set0' and the set containing only the members
% of `Xs'.
-
+ %
:- pred set_tree234__delete_list(list(T)::in,
set_tree234(T)::in, set_tree234(T)::out) is det.
:- func set_tree234__delete_list(list(T), set_tree234(T)) = set_tree234(T).
@@ -114,7 +114,7 @@
% and `Set' is the relative complement of `Set0' and the set
% containing only `X', i.e. if `Set' is the set which contains
% all the elements of `Set0' except `X'.
-
+ %
:- pred set_tree234__remove(T::in, set_tree234(T)::in, set_tree234(T)::out)
is semidet.
@@ -122,41 +122,41 @@
% contain any duplicates, `Set0' contains every member of `Xs',
% and `Set' is the relative complement of `Set0' and the set
% containing only the members of `Xs'.
-
+ %
:- pred set_tree234__remove_list(list(T)::in,
set_tree234(T)::in, set_tree234(T)::out) is semidet.
% `set_tree234__remove_least(X, Set0, Set)' is true iff `X' is the
% least element in `Set0', and `Set' is the set which contains all the
% elements of `Set0' except `X'.
-
+ %
:- pred set_tree234__remove_least(T::out,
set_tree234(T)::in, set_tree234(T)::out) is semidet.
% `set_tree234_union(SetA, SetB) = Set' is true iff `Set' is the union
% of `SetA' and `SetB'.
-
+ %
:- pred set_tree234__union(set_tree234(T)::in, set_tree234(T)::in,
set_tree234(T)::out) is det.
:- func set_tree234__union(set_tree234(T), set_tree234(T)) = set_tree234(T).
% `set_tree234__union_list(A, B)' is true iff `B' is the union of
% all the sets in `A'
-
+ %
:- pred set_tree234__union_list(list(set_tree234(T))::in, set_tree234(T)::out)
is det.
:- func set_tree234__union_list(list(set_tree234(T))) = set_tree234(T).
% `set_tree234__power_union(A) = B' is true iff `B' is the union of
% all the sets in `A'
-
+ %
:- pred set_tree234__power_union(set_tree234(set_tree234(T))::in,
set_tree234(T)::out) is det.
:- func set_tree234__power_union(set_tree234(set_tree234(T))) = set_tree234(T).
% `set_tree234__intersect(SetA, SetB) = Set' is true iff `Set' is the
% intersection of `SetA' and `SetB'.
-
+ %
:- pred set_tree234__intersect(set_tree234(T)::in, set_tree234(T)::in,
set_tree234(T)::out) is det.
:- func set_tree234__intersect(set_tree234(T), set_tree234(T))
@@ -164,19 +164,19 @@
% `set_tree234__power_intersect(A, B)' is true iff `B' is the
% intersection of all the sets in `A'.
-
+ %
:- func set_tree234__power_intersect(set_tree234(set_tree234(T)))
= set_tree234(T).
% `set_tree234__intersect_list(A, B)' is true iff `B' is the
% intersection of all the sets in `A'.
-
+ %
:- func set_tree234__intersect_list(list(set_tree234(T))) = set_tree234(T).
% `set_tree234__difference(SetA, SetB, Set)' is true iff `Set' is the
% set containing all the elements of `SetA' except those that
% occur in `SetB'.
-
+ %
:- pred set_tree234__difference(set_tree234(T)::in, set_tree234(T)::in,
set_tree234(T)::out) is det.
:- func set_tree234__difference(set_tree234(T), set_tree234(T))
@@ -184,7 +184,7 @@
% `set_tree234__count(Set, Count)' is true iff `Set' has
% `Count' elements.
-
+ %
:- func set_tree234__count(set_tree234(T)) = int.
:- pred set_tree234__map(pred(T1, T2)::in(pred(in, out) is det),
@@ -205,6 +205,7 @@
% set_tree234__divide(Pred, Set, TruePart, FalsePart):
% TruePart consists of those elements of Set for which Pred succeeds;
% FalsePart consists of those elements of Set for which Pred fails.
+ %
:- pred set_tree234__divide(pred(T)::in(pred(in) is semidet),
set_tree234(T)::in, set_tree234(T)::out, set_tree234(T)::out) is det.
@@ -212,9 +213,11 @@
% InPart consists of those elements of Set which are also in
% DivideBySet; OutPart consists of those elements of which are
% not in DivideBySet.
+ %
:- pred set_tree234__divide_by_set(set_tree234(T)::in, set_tree234(T)::in,
set_tree234(T)::out, set_tree234(T)::out) is det.
+%--------------------------------------------------------------------------%
%--------------------------------------------------------------------------%
:- implementation.
Index: svarray.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/svarray.m,v
retrieving revision 1.1
diff -u -r1.1 svarray.m
--- svarray.m 6 Jan 2005 05:08:15 -0000 1.1
+++ svarray.m 24 Jan 2005 23:29:26 -0000
@@ -23,12 +23,14 @@
% svarray__set sets the nth element of an array, and returns the
% resulting array (good opportunity for destructive update ;-).
% Throws an exception if the index is out of bounds.
+ %
:- pred svarray__set(int::in, T::in, array(T)::array_di, array(T)::array_uo)
is det.
% svarray__semidet_set sets the nth element of an array,
% and returns the resulting array.
% It fails if the index is out of bounds.
+ %
:- pred svarray__semidet_set(int::in, T::in,
array(T)::array_di, array(T)::array_uo) is semidet.
@@ -37,6 +39,7 @@
% required to be unique, so the implementation may not be able to use
% destructive update.
% It is an error if the index is out of bounds.
+ %
:- pred svarray__slow_set(int, T, array(T), array(T)).
:- mode svarray__slow_set(in, in, array_ui, array_uo) is det.
:- mode svarray__slow_set(in, in, in, array_uo) is det.
@@ -46,6 +49,7 @@
% required to be unique, so the implementation may not be able to use
% destructive update.
% It fails if the index is out of bounds.
+ %
:- pred svarray__semidet_slow_set(int, T, array(T), array(T)).
:- mode svarray__semidet_slow_set(in, in, array_ui, array_uo) is semidet.
:- mode svarray__semidet_slow_set(in, in, in, array_uo) is semidet.
@@ -54,15 +58,18 @@
% The array is expanded or shrunk to make it fit
% the new size `Size'. Any new entries are filled
% with `Init'.
+ %
:- pred svarray__resize(int::in, T::in, array(T)::array_di, array(T)::array_uo)
is det.
% svarray__shrink(Size, Array0, Array):
% The array is shrunk to make it fit the new size `Size'.
% Throws an exception if `Size' is larger than the size of `Array0'.
+ %
:- pred svarray__shrink(int::in, array(T)::array_di, array(T)::array_uo)
is det.
+%-----------------------------------------------------------------------------%
%-----------------------------------------------------------------------------%
:- implementation.
Index: sveqvclass.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/sveqvclass.m,v
retrieving revision 1.1
diff -u -r1.1 sveqvclass.m
--- sveqvclass.m 14 Jan 2005 06:04:22 -0000 1.1
+++ sveqvclass.m 24 Jan 2005 23:28:22 -0000
@@ -25,35 +25,36 @@
% Make an element known to the equivalence class.
% The element may already be known to the class;
% if it isn't, it is created without any equivalence relationships.
-
+ %
:- pred sveqvclass__ensure_element(T::in, eqvclass(T)::in, eqvclass(T)::out)
is det.
% Make an element known to the equivalence class.
% The element must not already be known to the class;
% it is created without any equivalence relationships.
-
+ %
:- pred sveqvclass__new_element(T::in, eqvclass(T)::in, eqvclass(T)::out)
is det.
% Make two elements of the equivalence class equivalent.
% It is ok if they already are.
-
+ %
:- pred sveqvclass__ensure_equivalence(T::in, T::in,
eqvclass(T)::in, eqvclass(T)::out) is det.
% Make two elements of the equivalence class equivalent.
% It is an error if they are already equivalent.
-
+ %
:- pred sveqvclass__new_equivalence(T::in, T::in,
eqvclass(T)::in, eqvclass(T)::out) is det.
% Remove the given element and all other elements equivalent to it
% from the given equivalence class.
-
+ %
:- pred sveqvclass__remove_equivalent_elements(T::in,
eqvclass(T)::in, eqvclass(T)::out) is det.
+%---------------------------------------------------------------------------%
%---------------------------------------------------------------------------%
:- implementation.
Index: svqueue.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/svqueue.m,v
retrieving revision 1.1
diff -u -r1.1 svqueue.m
--- svqueue.m 6 Jan 2005 05:08:15 -0000 1.1
+++ svqueue.m 24 Jan 2005 23:27:16 -0000
@@ -24,27 +24,29 @@
% `svqueue__put(Elem, Queue0, Queue)' is true iff `Queue' is
% the queue which results from appending `Elem' onto the end
% of `Queue0'.
-
+ %
:- pred svqueue__put(T::in, queue(T)::in, queue(T)::out) is det.
% `svqueue__put_list(Elems, Queue0, Queue)' is true iff `Queue'
% is the queue which results from inserting the items in the
% list `Elems' into `Queue0'.
-
+ %
:- pred svqueue__put_list(list(T)::in, queue(T)::in, queue(T)::out) is det.
% `svqueue__get(Elem, Queue0, Queue)' is true iff `Queue0' is
% a non-empty queue whose first element is `Elem', and `Queue'
% the queue which results from removing that element from
% the front of `Queue0'.
-
+ %
:- pred svqueue__get(T::out, queue(T)::in, queue(T)::out) is semidet.
% `svqueue__delete_all(Elem, Queue0, Queue)' is true iff `Queue' is
% the same queue as `Queue0' with all occurences of `Elem' removed
% from it.
+ %
:- pred svqueue__delete_all(T::in, queue(T)::in, queue(T)::out) is det.
+%--------------------------------------------------------------------------%
%--------------------------------------------------------------------------%
:- implementation.
Index: svset.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/svset.m,v
retrieving revision 1.2
diff -u -r1.2 svset.m
--- svset.m 6 Jan 2005 05:08:15 -0000 1.2
+++ svset.m 24 Jan 2005 23:26:28 -0000
@@ -21,39 +21,39 @@
% `svset__insert(X, Set0, Set)' is true iff `Set' is the union of
% `Set0' and the set containing only `X'.
-
+ %
:- pred svset__insert(T::in, set(T)::in, set(T)::out) is det.
% `svset__insert_list(Xs, Set0, Set)' is true iff `Set' is the union of
% `Set0' and the set containing only the members of `Xs'.
-
+ %
:- pred svset__insert_list(list(T)::in, set(T)::in, set(T)::out) is det.
% `svset__delete(X, Set0, Set)' is true iff `Set' is the relative
% complement of `Set0' and the set containing only `X', i.e.
% if `Set' is the set which contains all the elements of `Set0'
% except `X'.
-
+ %
:- pred svset__delete(T::in, set(T)::in, set(T)::out) is det.
% `svset__delete_list(Xs, Set0, Set)' is true iff `Set' is the relative
% complement of `Set0' and the set containing only the members of
% `Xs'.
-
+ %
:- pred svset__delete_list(list(T)::in, set(T)::in, set(T)::out) is det.
% `svset__remove(X, Set0, Set)' is true iff `Set0' contains `X',
% and `Set' is the relative complement of `Set0' and the set
% containing only `X', i.e. if `Set' is the set which contains
% all the elements of `Set0' except `X'.
-
+ %
:- pred svset__remove(T::in, set(T)::in, set(T)::out) is semidet.
% `svset__remove_list(Xs, Set0, Set)' is true iff `Xs' does not
% contain any duplicates, `Set0' contains every member of `Xs',
% and `Set' is the relative complement of `Set0' and the set
% containing only the members of `Xs'.
-
+ %
:- pred svset__remove_list(list(T)::in, set(T)::in, set(T)::out) is semidet.
% `svset__remove_least(Elem, Set0, Set)' is true iff
@@ -61,9 +61,10 @@
% (with elements ordered using the standard ordering given
% by compare/3), and `Set' is the set containing all the
% elements of `Set0' except `Elem'.
-
+ %
:- pred svset__remove_least(T::out, set(T)::in, set(T)::out) is semidet.
+%--------------------------------------------------------------------------%
%--------------------------------------------------------------------------%
:- implementation.
--------------------------------------------------------------------------
mercury-reviews mailing list
post: mercury-reviews at cs.mu.oz.au
administrative address: owner-mercury-reviews at cs.mu.oz.au
unsubscribe: Address: mercury-reviews-request at cs.mu.oz.au Message: unsubscribe
subscribe: Address: mercury-reviews-request at cs.mu.oz.au Message: subscribe
--------------------------------------------------------------------------
More information about the reviews
mailing list