diff --git a/ChangeLog b/ChangeLog index 5ef25c2401..526f659302 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,7 @@ +Sun Jun 2 12:03:58 2013 Zachary Scott + + * range.c: Fix rdoc on Range#bsearch [Bug #8242] [ruby-core:54143] + Sun Jun 2 02:08:37 2013 NARUSE, Yui * enc/euc_jp.c: fix typo: the name of EUC-JIS-2004. 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),