diff options
author | akr <akr@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2009-09-27 01:58:07 +0000 |
---|---|---|
committer | akr <akr@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2009-09-27 01:58:07 +0000 |
commit | 0ff9cf362531322c10312a5df5d709a91a601c2b (patch) | |
tree | 338f6bf2722bd2e3504cb61c18e86b3d44570733 /enum.c | |
parent | 810775bb203c3a7f1cac0e71f33be69e0556f674 (diff) | |
download | ruby-0ff9cf362531322c10312a5df5d709a91a601c2b.tar.gz |
fix rdoc.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@25117 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'enum.c')
-rw-r--r-- | enum.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -681,7 +681,7 @@ enum_first(int argc, VALUE *argv, VALUE obj) * +1 depending on the comparison between <i>a</i> and <i>b</i>. As of * Ruby 1.8, the method <code>Enumerable#sort_by</code> implements a * built-in Schwartzian Transform, useful when key computation or - * comparison is expensive.. + * comparison is expensive. * * %w(rhea kea flea).sort #=> ["flea", "kea", "rhea"] * (1..10).sort {|a,b| b <=> a} #=> [10, 9, 8, 7, 6, 5, 4, 3, 2, 1] @@ -2067,7 +2067,7 @@ chunk_i(VALUE yielder, VALUE enumerator, int argc, VALUE *argv) * _initial_state_ argument can be used. * If non-nil value is given, * it is duplicated for each "each" method invocation of the enumerator. - * The duplicated object is passed to 2nd argument of the block for "chunk" method.. + * The duplicated object is passed to 2nd argument of the block for "chunk" method. * */ static VALUE |