From eb5f361937c6e4307ac34afa93a4ffbd447ef4e0 Mon Sep 17 00:00:00 2001 From: zzak Date: Sun, 2 Jun 2013 03:05:26 +0000 Subject: * range.c: Fix rdoc on Range#bsearch [Bug #8242] [ruby-core:54143] git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@41026 b2dd03c8-39d4-4d8f-98ff-823fe69b080e --- range.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'range.c') diff --git a/range.c b/range.c index feabf6b9bf..6d6a52873e 100644 --- a/range.c +++ b/range.c @@ -512,10 +512,10 @@ is_integer_p(VALUE v) * rng.bsearch {|obj| block } -> value * * By using binary search, finds a value in range which meets the given - * condition in O(log n) where n is the size of the array. + * condition in O(log n) where n is the size of the range. * * You can use this method in two use cases: a find-minimum mode and - * a find-any mode. In either case, the elements of the array must be + * a find-any mode. In either case, the elements of the range must be * monotone (or sorted) with respect to the block. * * In find-minimum mode (this is a good choice for typical use case), -- cgit v1.2.3