ruby-changes:3318
From: ko1@a...
Date: 31 Dec 2007 15:43:45 +0900
Subject: [ruby-changes:3318] akr - Ruby:r14811 (trunk): fix typos.
akr 2007-12-31 15:43:32 +0900 (Mon, 31 Dec 2007)
New Revision: 14811
Modified files:
trunk/array.c
trunk/bignum.c
trunk/dir.c
trunk/enum.c
trunk/error.c
trunk/hash.c
trunk/numeric.c
Log:
fix typos.
http://svn.ruby-lang.org/cgi-bin/viewvc.cgi/trunk/numeric.c?r1=14811&r2=14810
http://svn.ruby-lang.org/cgi-bin/viewvc.cgi/trunk/hash.c?r1=14811&r2=14810
http://svn.ruby-lang.org/cgi-bin/viewvc.cgi/trunk/array.c?r1=14811&r2=14810
http://svn.ruby-lang.org/cgi-bin/viewvc.cgi/trunk/bignum.c?r1=14811&r2=14810
http://svn.ruby-lang.org/cgi-bin/viewvc.cgi/trunk/error.c?r1=14811&r2=14810
http://svn.ruby-lang.org/cgi-bin/viewvc.cgi/trunk/enum.c?r1=14811&r2=14810
http://svn.ruby-lang.org/cgi-bin/viewvc.cgi/trunk/dir.c?r1=14811&r2=14810
Index: array.c
===================================================================
--- array.c (revision 14810)
+++ array.c (revision 14811)
@@ -2819,7 +2819,7 @@
* Flattens _self_ in place.
* Returns <code>nil</code> if no modifications were made (i.e.,
* <i>array</i> contains no subarrays.) If the optional <i>level</i>
- * argument determins the level of recursion to flatten.
+ * argument determines the level of recursion to flatten.
*
* a = [ 1, 2, [3, [4, 5] ] ]
* a.flatten! #=> [1, 2, 3, 4, 5]
@@ -2854,7 +2854,7 @@
* Returns a new array that is a one-dimensional flattening of this
* array (recursively). That is, for every element that is an array,
* extract its elements into the new array. If the optional
- * <i>level</i> argument determins the level of recursion to flatten.
+ * <i>level</i> argument determines the level of recursion to flatten.
*
* s = [ 1, 2, 3 ] #=> [1, 2, 3]
* t = [ 4, 5, 6, [7, 8] ] #=> [4, 5, 6, [7, 8]]
Index: enum.c
===================================================================
--- enum.c (revision 14810)
+++ enum.c (revision 14811)
@@ -1112,8 +1112,8 @@
* enum.minmax => [min,max]
* enum.minmax {|a,b| block } => [min,max]
*
- * Returns two elements array which contains the mininum and the
- * maxinum value in the enumerable. The first form assumes all
+ * Returns two elements array which contains the minimum and the
+ * maximum value in the enumerable. The first form assumes all
* objects implement <code>Comparable</code>; the second uses the
* block to return <em>a <=> b</em>.
*
@@ -1255,7 +1255,7 @@
* enum.minmax_by {| obj| block } => [min, max]
*
* Returns two elements array array containing the objects in
- * <i>enum</i> that gives the minmum and maximum values respectively
+ * <i>enum</i> that gives the minimum and maximum values respectively
* from the given block.
*
* a = %w(albatross dog horse)
Index: dir.c
===================================================================
--- dir.c (revision 14810)
+++ dir.c (revision 14811)
@@ -1035,7 +1035,7 @@
return (char *)p-1;
}
-/* Remove escaping baskclashes */
+/* Remove escaping backslashes */
static void
remove_backslashes(char *p)
{
Index: hash.c
===================================================================
--- hash.c (revision 14810)
+++ hash.c (revision 14811)
@@ -1536,7 +1536,7 @@
* Adds the contents of <i>other_hash</i> to <i>hsh</i>. If no
* block is specified entries with duplicate keys are overwritten
* with the values from <i>other_hash</i>, otherwise the value
- * of each duplicate key is detemined by calling the block with
+ * of each duplicate key is determined by calling the block with
* the key, its value in <i>hsh</i> and its value in <i>other_hash</i>.
*
* h1 = { "a" => 100, "b" => 200 }
@@ -1661,7 +1661,7 @@
* hash. That is, for every key or value that is an array, extract
* its elements into the new array. Unlike Array#flatten, this
* method does not flatten recursively by default. If the optional
- * <i>level</i> argument determins the level of recursion to flatten.
+ * <i>level</i> argument determines the level of recursion to flatten.
*
* a = {1=> "one", 2 => [2,"two"], 3 => "three"}
* a.flatten # => [1, "one", 2, [2, "two"], 3, "three"]
Index: error.c
===================================================================
--- error.c (revision 14810)
+++ error.c (revision 14811)
@@ -667,7 +667,7 @@
* call-seq:
* name_error.to_s => string
*
- * Produce a nicely-formated string representing the +NameError+.
+ * Produce a nicely-formatted string representing the +NameError+.
*/
static VALUE
@@ -993,7 +993,7 @@
}
/*
- * Descendents of class <code>Exception</code> are used to communicate
+ * Descendants of class <code>Exception</code> are used to communicate
* between <code>raise</code> methods and <code>rescue</code>
* statements in <code>begin/end</code> blocks. <code>Exception</code>
* objects carry information about the exception---its type (the
Index: numeric.c
===================================================================
--- numeric.c (revision 14810)
+++ numeric.c (revision 14811)
@@ -2549,7 +2549,7 @@
* fix <= other => true or false
*
* Returns <code>true</code> if the value of <code>fix</code> is
- * less thanor equal to that of <code>other</code>.
+ * less than or equal to that of <code>other</code>.
*/
static VALUE
Index: bignum.c
===================================================================
--- bignum.c (revision 14810)
+++ bignum.c (revision 14811)
@@ -470,7 +470,7 @@
}
break;
}
- if (*str == '0') { /* squeeze preceeding 0s */
+ if (*str == '0') { /* squeeze preceding 0s */
while (*++str == '0');
if (!(c = *str) || ISSPACE(c)) --str;
}
--
ML: ruby-changes@q...
Info: http://www.atdot.net/~ko1/quickml