archive/ruby
1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2025-09-17 17:43:59 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 7

merge revision(s) 41026: [Backport #8242]

Browse source 
* range.c: Fix rdoc on Range#bsearch [Bug #8242] [ruby-core:54143]


git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/branches/ruby_2_0_0@41033 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
nagachika 2013-06-02 13:39:50 +00:00
parent 7e53569b1d
commit 6f617028a4
3 changed files with 10 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

4
ChangeLog
View file

@ -1,3 +1,7 @@
Sun Jun 2 22:39:24 2013 Zachary Scott <zachary@zacharyscott.net>
* range.c: Fix rdoc on Range#bsearch [Bug #8242] [ruby-core:54143]
Mon May 20 04:00:48 2013 Zachary Scott <zachary@zacharyscott.net>
* lib/yaml.rb: YAML documentation from #8344 [Bug #8355]

4
range.c
View file

@ -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),

8
version.h
View file

@ -1,10 +1,10 @@
#define RUBY_VERSION "2.0.0"
#define RUBY_RELEASE_DATE "2013-05-20"
#define RUBY_PATCHLEVEL 197
#define RUBY_RELEASE_DATE "2013-06-02"
#define RUBY_PATCHLEVEL 198
#define RUBY_RELEASE_YEAR 2013
#define RUBY_RELEASE_MONTH 5
#define RUBY_RELEASE_DAY 20
#define RUBY_RELEASE_MONTH 6
#define RUBY_RELEASE_DAY 2
#include "ruby/version.h"