[m-rev.] trivial diff: fix some library documentation

Julien Fischer juliensf at students.cs.mu.OZ.AU
Wed Aug 6 15:31:25 AEST 2003


library/array.m:
library/bt_array.m:
library/io.m:
library/math.m:
library/store.m:
	Fix some spelling errors in library documentation/comments.


Index: array.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/array.m,v
retrieving revision 1.123
diff -u -r1.123 array.m
--- array.m	11 Jun 2003 12:55:49 -0000	1.123
+++ array.m	6 Aug 2003 04:54:20 -0000
@@ -264,7 +264,7 @@

 	% array__from_list takes a list,
 	% and returns an array containing those elements in
-	% the same order that they occured in the list.
+	% the same order that they occurred in the list.
 :- pred array__from_list(list(T), array(T)).
 :- mode array__from_list(in, array_uo) is det.

Index: bt_array.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/bt_array.m,v
retrieving revision 1.11
diff -u -r1.11 bt_array.m
--- bt_array.m	26 May 2003 09:00:29 -0000	1.11
+++ bt_array.m	6 Aug 2003 05:09:52 -0000
@@ -15,7 +15,7 @@
 % (`bt_array' is supposed to stand for either "binary tree array"
 % or "backtrackable array".)

-% Implementation obscurity: This implementation is biassed towards larger
+% Implementation obscurity: This implementation is biased towards larger
 % indices.  The access/update time for a bt_array of size N with index I
 % is actually O(log(N-I)).  The reason for this is so that the resize
 % operations can be optimised for a (possibly very) common case, and to
@@ -140,7 +140,7 @@

 	% `bt_array__from_list(Low, List, BtArray)' takes a list (of
 	% possibly zero length), and returns a bt_array containing
-	% those elements in the same order that they occured in the
+	% those elements in the same order that they occurred in the
 	% list.  The lower bound of the new array is `Low'.
 :- pred bt_array__from_list(int, list(T), bt_array(T)).
 :- mode bt_array__from_list(in, in, out) is det.
@@ -459,7 +459,7 @@
 % For more details on the implementation:
 %
 %	Chris Okasaki, "Purely Functional Random-Access Lists"
-%	Functional Programming Languages and Computer Architecutre,
+%	Functional Programming Languages and Computer Architecture,
 %	June 1995, pp 86-95.

 % :- module ra_list.
Index: io.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/io.m,v
retrieving revision 1.301
diff -u -r1.301 io.m
--- io.m	26 Jul 2003 15:22:34 -0000	1.301
+++ io.m	6 Aug 2003 05:02:19 -0000
@@ -1309,7 +1309,7 @@
 %		The ExitStatus will be 0 if the command completed
 %		successfully or the return value of the system call.  If a
 %		signal kills the system call, then Result will be an error
-%		indicating which signal occured.
+%		indicating which signal occurred.

 :- type io__system_result
 	--->	exited(int)
Index: math.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/math.m,v
retrieving revision 1.43
diff -u -r1.43 math.m
--- math.m	14 May 2003 14:38:46 -0000	1.43
+++ math.m	6 Aug 2003 05:08:38 -0000
@@ -199,7 +199,7 @@

 	% A domain error exception, indicates that the inputs to a function
 	% were outside the domain of the function.  The string indicates
-	% where the error occured.
+	% where the error occurred.
 	%
 	% It is possible to switch domain checking off, in which case,
 	% depending on the backend, a domain error may cause a program
Index: store.m
===================================================================
RCS file: /home/mercury1/repository/mercury/library/store.m,v
retrieving revision 1.39
diff -u -r1.39 store.m
--- store.m	29 May 2003 12:08:25 -0000	1.39
+++ store.m	6 Aug 2003 04:52:43 -0000
@@ -9,7 +9,7 @@
 % Stability: low.
 %
 % This file provides facilities for manipulating mutable stores.
-% A store can be consider a mapping from abstract keys to their values.
+% A store can be considered a mapping from abstract keys to their values.
 % A store holds a set of nodes, each of which may contain a value of any
 % type.
 %
--------------------------------------------------------------------------
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