[m-rev.] trivial diff: yet more fixes for library documentation

[Julien Fischer]

Estimated hours taken: 0.5
Branches: main

Fix more typos in library documentation.

library/builtin.m:
	s/wheiter/whether.

library/char.m:
	s/consise/concise/

library/getopt.m:
library/getopt_io.m:
	s/keept/keep/

library/int.m:
	s/expontiation/exponentiation/

library/ops.m:
	s/precendence/precedence/

library/robdd.m:
	s/efficent/efficient/

library/set_bbbtree.m:
	s/noticable/noticeable/

library/term_to_xml.m:
	s/funtor/functor/
	s/attrinutes/attributes/
	s/fuctor/functor/

library/version_array.m:
	s/incurr/incur/

Julien.

Index: builtin.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/builtin.m,v
retrieving revision 1.107
diff -u -r1.107 builtin.m
--- builtin.m	7 Jan 2005 06:10:34 -0000	1.107
+++ builtin.m	26 Jan 2005 11:30:26 -0000
@@ -198,7 +198,7 @@
 :- type comparison_result ---> (=) ; (<) ; (>).

 	% compare(Res, X, Y) binds Res to =, <, or >
-	% depending on wheither X is =, <, or > Y in the
+	% depending on whether X is =, <, or > Y in the
 	% standard ordering.
 :- pred compare(comparison_result, T, T).
 	% Note to implementors: the modes must appear in this order:
Index: char.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/char.m,v
retrieving revision 1.48
diff -u -r1.48 char.m
--- char.m	24 Jan 2005 23:16:36 -0000	1.48
+++ char.m	26 Jan 2005 11:52:03 -0000
@@ -265,7 +265,7 @@
 	; Char = 'Z'
 	; Char = '_'
 	).
-% A more consise implementation is:
+% A more concise implementation is:
 %	( char__is_digit(Char) ->
 %		true
 %	;
Index: getopt.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/getopt.m,v
retrieving revision 1.32
diff -u -r1.32 getopt.m
--- getopt.m	10 Jan 2005 01:53:11 -0000	1.32
+++ getopt.m	26 Jan 2005 11:56:32 -0000
@@ -276,7 +276,7 @@
 :- implementation.
 :- import_module require, string, svset.

-% Please keept the differences between this module and getopt_io.m to the
+% Please keep the differences between this module and getopt_io.m to the
 % minimum. Most changes should done in both modules.

 :- type option_ops_special(OptionType)
Index: getopt_io.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/getopt_io.m,v
retrieving revision 1.1
diff -u -r1.1 getopt_io.m
--- getopt_io.m	10 Jan 2005 01:53:11 -0000	1.1
+++ getopt_io.m	26 Jan 2005 11:57:13 -0000
@@ -280,7 +280,7 @@
 :- implementation.
 :- import_module require, string, svset.

-% Please keept the differences between this module and getopt.m to the
+% Please keep the differences between this module and getopt.m to the
 % minimum. Most changes should done in both modules.

 :- type option_ops_special(OptionType)
Index: int.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/int.m,v
retrieving revision 1.100
diff -u -r1.100 int.m
--- int.m	8 Jul 2004 05:56:37 -0000	1.100
+++ int.m	26 Jan 2005 11:53:49 -0000
@@ -63,7 +63,7 @@
 :- pred int__to_float(int, float) is det.
 :- mode int__to_float(in, out) is det.

-	% expontiation
+	% exponentiation
 	% int__pow(X, Y, Z): Z is X raised to the Yth power
 	% Throws a `math__domain_error' exception if Y is negative.
 :- func int__pow(int, int) = int.
@@ -214,7 +214,7 @@
 :- func - int = int.
 :- mode - in = uo is det.

-	% is/2, for backwards compatiblity with Prolog (and with
+	% is/2, for backwards compatibility with Prolog (and with
 :- pred is(T, T) is det.
 :- mode is(uo, di) is det.
 :- mode is(out, in) is det.
Index: ops.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/ops.m,v
retrieving revision 1.46
diff -u -r1.46 ops.m
--- ops.m	16 Dec 2004 03:23:12 -0000	1.46
+++ ops.m	26 Jan 2005 11:25:50 -0000
@@ -66,7 +66,7 @@
 		% as the top-level functor of an argument of a compound
 		% term.
 		%
-		% This will generally be the precendence of `,/2' less one.
+		% This will generally be the precedence of `,/2' less one.
 		% If `,/2' does not appear in the op_table,
 		% `ops__max_priority' plus one may be a reasonable value.
 	func ops__arg_priority(Table) = ops__priority
Index: robdd.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/robdd.m,v
retrieving revision 1.3
diff -u -r1.3 robdd.m
--- robdd.m	21 Dec 2004 04:08:42 -0000	1.3
+++ robdd.m	26 Jan 2005 11:23:46 -0000
@@ -10,7 +10,7 @@

 % This module contains a Mercury interface to Peter Schachte's C
 % implementation of Reduced Ordered Binary Decision Diagrams (ROBDDs).
-% ROBDDs are an efficent representation for Boolean constraints.
+% ROBDDs are an efficient representation for Boolean constraints.

 % Boolean variables are represented using the type var(T) from the
 % `term' library module (see the `term' module documentation for
Index: set_bbbtree.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/set_bbbtree.m,v
retrieving revision 1.23
diff -u -r1.23 set_bbbtree.m
--- set_bbbtree.m	24 Jan 2005 23:16:38 -0000	1.23
+++ set_bbbtree.m	26 Jan 2005 11:51:19 -0000
@@ -175,7 +175,7 @@
 	% `set_bbbtree__sorted_list_to_set_len(List, Set, N)' is true iff
 	% `Set' is the set set containing only the members of `List' and `N'
 	% is the length of the list. If the length of the list is already known
-	% then a noticable speed improvement can be expected over
+	% then a noticeable speed improvement can be expected over
 	% `set_bbbtree__sorted_list_to_set' as a significant cost involved
 	% with `set_bbbtree__sorted_list_to_set' is the call to list__length.
 	% `List' must be sorted. O(n).
Index: term_to_xml.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/term_to_xml.m,v
retrieving revision 1.5
diff -u -r1.5 term_to_xml.m
--- term_to_xml.m	24 Jan 2005 23:16:40 -0000	1.5
+++ term_to_xml.m	26 Jan 2005 11:34:56 -0000
@@ -153,13 +153,13 @@
 	%	assigned the `Array' element.  The builtin types are assigned
 	% 	the elements `Int', `String', `Float' and `Char'.  All other
 	%	functors are assigned elements with the same name as the
-	%	functor provided the funtor name is well formed and does
+	%	functor provided the functor name is well formed and does
 	% 	not start with a capital letter.  Otherwise a mangled
 	%	version of the functor name is used.
 	%
 	%	All elements except `Int', `String', `Float' and `Char'
 	%	will have their `functor', `arity', `type' and `field' (if
-	%	there is a field name) attrinutes set.  `Int', `String',
+	%	there is a field name) attributes set.  `Int', `String',
 	%	`Float' and `Char' elements will just have their `type' and
 	%	possibly their `field' attributes set.
 	%
@@ -168,7 +168,7 @@
 	%	functors.
 	%
 	%	2. unique: Here we use the same mapping as `simple' except
-	%	we append the fuctor arity for discriminated unions and
+	%	we append the functor arity for discriminated unions and
 	%	a mangled version of the type name for every element.  The same
 	%	attributes as the `simple' scheme are provided.  The advantage
 	%	of this scheme is that it maps each functor to a unique
Index: version_array.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/version_array.m,v
retrieving revision 1.5
diff -u -r1.5 version_array.m
--- version_array.m	22 Jan 2005 06:10:55 -0000	1.5
+++ version_array.m	26 Jan 2005 11:26:57 -0000
@@ -13,7 +13,7 @@
 %
 % This module implements version arrays.  A version array provides O(1)
 % access and update for the "latest" version of the array.  "Older"
-% versions of the array incurr an O(k) penalty on accesses where k is
+% versions of the array incur an O(k) penalty on accesses where k is
 % the number of updates that have been made since.
 %
 % The advantage of version arrays is that in the common, singly threaded,

--------------------------------------------------------------------------
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
--------------------------------------------------------------------------