From 0ff9cf362531322c10312a5df5d709a91a601c2b Mon Sep 17 00:00:00 2001 From: akr Date: Sun, 27 Sep 2009 01:58:07 +0000 Subject: fix rdoc. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@25117 b2dd03c8-39d4-4d8f-98ff-823fe69b080e --- enum.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'enum.c') diff --git a/enum.c b/enum.c index d510cea8cb..0c8ee3b350 100644 --- a/enum.c +++ b/enum.c @@ -681,7 +681,7 @@ enum_first(int argc, VALUE *argv, VALUE obj) * +1 depending on the comparison between a and b. As of * Ruby 1.8, the method Enumerable#sort_by 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 -- cgit v1.2.3