Diff: Documentation fix

[Andrew Bromage]

G'day all.

Already committed; no need to review.

Cheers,
Andrew Bromage


Estimated hours taken: 5 mins

modes.m:
	Fix of some documentation rot: We _do_ know how to do a
	deep copy.  We just don't know how to do a partially
	instatiated deep copy.

hlds_module.m:
make_hlds.m:
mercury_to_mercury.m:
prog_io.m:
type_util.m:
typecheck.m:
	Remove some when declarations, since the NU-Prolog version
	of the compiler isn't supported any more.


Index: hlds_module.m
===================================================================
RCS file: /home/staff/zs/imp/mercury/compiler/hlds_module.m,v
retrieving revision 1.24
diff -u -r1.24 hlds_module.m
--- hlds_module.m	1997/07/27 15:00:29	1.24
+++ hlds_module.m	1997/09/01 04:11:10
@@ -1182,8 +1182,6 @@
 
 %-----------------------------------------------------------------------------%
 
-:- predicate_table_search_sym(_, X, _) when X. % NU-Prolog indexing.
-
 predicate_table_search_sym(PredicateTable, unqualified(Name), PredIdList) :-
 	predicate_table_search_name(PredicateTable, Name, PredIdList).
 predicate_table_search_sym(PredicateTable, qualified(Module, Name),
@@ -1192,8 +1190,6 @@
 		Module, Name, PredIdList),
 	PredIdList \= [].
 
-:- predicate_table_search_pred_sym(_, X, _) when X. % NU-Prolog indexing.
-
 predicate_table_search_pred_sym(PredicateTable, unqualified(Name), PredIdList)
 		:-
 	predicate_table_search_pred_name(PredicateTable, Name, PredIdList).
@@ -1203,8 +1199,6 @@
 		Module, Name, PredIdList),
 	PredIdList \= [].
 
-:- predicate_table_search_func_sym(_, X, _) when X. % NU-Prolog indexing.
-
 predicate_table_search_func_sym(PredicateTable, unqualified(Name), PredIdList)
 		:-
 	predicate_table_search_func_name(PredicateTable, Name, PredIdList).
@@ -1219,8 +1213,6 @@
 
 %-----------------------------------------------------------------------------%
 
-:- predicate_table_search_sym_arity(_, X, _, _) when X. % NU-Prolog indexing.
-
 predicate_table_search_sym_arity(PredicateTable, qualified(Module, Name),
 		Arity, PredIdList) :-
 	predicate_table_search_m_n_a(PredicateTable, Module, Name, Arity,
@@ -1230,8 +1222,6 @@
 	predicate_table_search_name_arity(PredicateTable, Name, Arity,
 		PredIdList).
 
-:- predicate_table_search_pred_sym_arity(_, X, _, _) when X.
-
 predicate_table_search_pred_sym_arity(PredicateTable, qualified(Module, Name),
 		Arity, PredIdList) :-
 	predicate_table_search_pred_m_n_a(PredicateTable, Module, Name, Arity,
@@ -1241,8 +1231,6 @@
 	predicate_table_search_pred_name_arity(PredicateTable, Name, Arity,
 		PredIdList).
 
-:- predicate_table_search_func_sym_arity(_, X, _, _) when X.
-
 predicate_table_search_func_sym_arity(PredicateTable, qualified(Module, Name),
 		Arity, PredIdList) :-
 	predicate_table_search_func_m_n_a(PredicateTable, Module, Name, Arity,
@@ -1401,8 +1389,6 @@
 
 %-----------------------------------------------------------------------------%
 
-:- predicate_table_search_pf_m_n_a(_, X, _, _, _, _) when X.
-
 predicate_table_search_pf_m_n_a(PredicateTable, predicate, Module, Name, Arity,
 		PredIds) :-
 	predicate_table_search_pred_m_n_a(PredicateTable, Module, Name, Arity,
@@ -1413,8 +1399,6 @@
 	predicate_table_search_func_m_n_a(PredicateTable, Module, Name,
 			FuncArity, PredIds).
 
-:- predicate_table_search_pf_name_arity(_, X, _, _, _, _) when X.
-
 predicate_table_search_pf_name_arity(PredicateTable, predicate, Name, Arity,
 		PredIds) :-
 	predicate_table_search_pred_name_arity(PredicateTable, Name, Arity,
@@ -1424,8 +1408,6 @@
 	FuncArity is Arity - 1,
 	predicate_table_search_func_name_arity(PredicateTable, Name, FuncArity,
 			PredIds).
-
-:- predicate_table_search_pf_sym_arity(_, X, _, _, _) when X.
 
 predicate_table_search_pf_sym_arity(PredicateTable, PredOrFunc,
 		qualified(Module, Name), Arity, PredIdList) :-
Index: make_hlds.m
===================================================================
RCS file: /home/staff/zs/imp/mercury/compiler/make_hlds.m,v
retrieving revision 1.237
diff -u -r1.237 make_hlds.m
--- make_hlds.m	1997/08/22 13:55:16	1.237
+++ make_hlds.m	1997/09/01 04:11:27
@@ -2598,8 +2598,6 @@
 :- mode insert_arg_unifications_2(in, in, in, in, in, in, in, out,
 		out, in, out, di, uo) is det.
 
-:- insert_arg_unifications_2(A, B, _,_,_,_, _, _, _, _, _, _, _) when A and B.
-
 insert_arg_unifications_2([], [_|_], _, _, _, _, _, _, _, _, _) -->
 	{ error("insert_arg_unifications_2: length mismatch") }.
 insert_arg_unifications_2([_|_], [], _, _, _, _, _, _, _, _, _) -->
@@ -2654,8 +2652,6 @@
 	list(hlds_goal), varset, qual_info, qual_info, io__state, io__state).
 :- mode append_arg_unifications_2(in, in, in, in, in, in, in,
 	out, out, in, out, di, uo) is det.
-
-:- append_arg_unifications_2(A, B, _,_,_, _, _, _, _, _, _, _, _) when A and B.
 
 append_arg_unifications_2([], [_|_], _, _, _, _, _, _, _, _, _) -->
 	{ error("append_arg_unifications_2: length mismatch") }.
Index: mercury_to_mercury.m
===================================================================
RCS file: /home/staff/zs/imp/mercury/compiler/mercury_to_mercury.m,v
retrieving revision 1.114
diff -u -r1.114 mercury_to_mercury.m
--- mercury_to_mercury.m	1997/08/22 13:55:29	1.114
+++ mercury_to_mercury.m	1997/09/01 04:11:41
@@ -377,8 +377,6 @@
 		mercury_write_module_spec_list(ModuleNames)
 	).
 
-:- mercury_output_inst_defn(_, X, _, _, _) when X.	% NU-Prolog indexing
-
 mercury_output_inst_defn(VarSet, abstract_inst(Name, Args), Context) -->
 	io__write_string(":- inst ("),
 	{ construct_qualified_term(Name, Args, Context, InstTerm) },
Index: modes.m
===================================================================
RCS file: /home/staff/zs/imp/mercury/compiler/modes.m,v
retrieving revision 1.202
diff -u -r1.202 modes.m
--- modes.m	1997/07/27 15:01:11	1.202
+++ modes.m	1997/09/01 04:13:03
@@ -1290,7 +1290,8 @@
 		% This is the implied mode case.
 		% We do not yet handle implied modes for partially
 		% instantiated vars, since that would require
-		% doing a deep copy, and we don't know how to do that yet.
+		% doing a partially instantiated deep copy, and we
+		% don't know how to do that yet.
 		( inst_is_bound(ModuleInfo0, InitialInst) ->
 			% This is the case we can't handle
 			Var = Var0,
Index: prog_io.m
===================================================================
RCS file: /home/staff/zs/imp/mercury/compiler/prog_io.m,v
retrieving revision 1.161
diff -u -r1.161 prog_io.m
--- prog_io.m	1997/08/22 13:55:54	1.161
+++ prog_io.m	1997/09/01 04:12:17
@@ -713,8 +713,6 @@
 				maybe1(type_defn)).
 :- mode parse_type_decl_type(in, in, in, out, out) is semidet.
 
-:- parse_type_decl_type(_, [A|B], _, _, _) when A and B.
-
 parse_type_decl_type(ModuleName, "--->", [H, B], Condition, R) :-
 	/* get_condition(...), */
 	Condition = true,
Index: type_util.m
===================================================================
RCS file: /home/staff/zs/imp/mercury/compiler/type_util.m,v
retrieving revision 1.45
diff -u -r1.45 type_util.m
--- type_util.m	1997/08/22 13:56:06	1.45
+++ type_util.m	1997/09/01 04:12:29
@@ -419,8 +419,6 @@
 	% (the type variables that occur in the head of the clause),
 	% and because one day we might want to handle equivalent types.
 
-:- type_unify(X, Y, _, _, _) when X and Y.		% NU-Prolog indexing
-
 type_unify(term__variable(X), term__variable(Y), HeadTypeParams, Bindings0,
 		Bindings) :-
 	( list__member(Y, HeadTypeParams) ->
Index: typecheck.m
===================================================================
RCS file: /home/staff/zs/imp/mercury/compiler/typecheck.m,v
retrieving revision 1.211
diff -u -r1.211 typecheck.m
--- typecheck.m	1997/08/22 13:56:15	1.211
+++ typecheck.m	1997/09/01 04:12:44
@@ -1597,8 +1597,6 @@
 :- mode typecheck_unification(in, in, out, typecheck_info_di, 
 				typecheck_info_uo) is det.
 
-:- typecheck_unification(_, Y, _, _, _) when Y.
-
 typecheck_unification(X, var(Y), var(Y)) -->
 	typecheck_unify_var_var(X, Y).
 typecheck_unification(X, functor(F, As), functor(F, As)) -->
@@ -2721,8 +2719,6 @@
 :- pred convert_cons_defn_list(typecheck_info, list(hlds_cons_defn),
 				list(cons_type_info)).
 :- mode convert_cons_defn_list(typecheck_info_ui, in, out) is det.
-
-:- convert_cons_defn_list(_, L, _) when L.	% NU-Prolog indexing.
 
 convert_cons_defn_list(_TypeCheckInfo, [], []).
 convert_cons_defn_list(TypeCheckInfo, [X|Xs], [Y|Ys]) :-