1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2022-11-09 12:17:21 -05:00

* array.c (rb_ary_bsearch): fix rdoc bug (O(n log n) -> O(log n)).

Patch by Charlie Somerville.  [ruby-core:49661] [Bug #7409]

* range.c (range_bsearch): ditto.

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@37755 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
mame 2012-11-20 11:13:45 +00:00
parent f1aee6327a
commit 4c37c520e2
3 changed files with 9 additions and 2 deletions

View file

@ -1,3 +1,10 @@
Tue Nov 20 20:10:23 2012 Yusuke Endoh <mame@tsg.ne.jp>
* array.c (rb_ary_bsearch): fix rdoc bug (O(n log n) -> O(log n)).
Patch by Charlie Somerville. [ruby-core:49661] [Bug #7409]
* range.c (range_bsearch): ditto.
Tue Nov 20 19:02:44 2012 Koichi Sasada <ko1@atdot.net>
* vm_trace.c: rename and add TracePoint APIs.

View file

@ -2378,7 +2378,7 @@ rb_ary_sort(VALUE ary)
* ary.bsearch {|x| block } -> elem
*
* By using binary search, finds a value from this array which meets
* the given condition in O(n log n) where n is the size of the array.
* the given condition in O(log n) where n is the size of the array.
*
* 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

View file

@ -475,7 +475,7 @@ range_step(int argc, VALUE *argv, VALUE range)
* rng.bsearch {|obj| block } -> value
*
* By using binary search, finds a value in range which meets the given
* condition in O(n log n) where n is the size of the array.
* condition in O(log n) where n is the size of the array.
*
* 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