mame	2012-11-20 20:13:45 +0900 (Tue, 20 Nov 2012)

  New Revision: 37755

  http://svn.ruby-lang.org/cgi-bin/viewvc.cgi?view=rev&revision=37755

  Log:
    * 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.

  Modified files:
    trunk/ChangeLog
    trunk/array.c
    trunk/range.c

Index: array.c
===================================================================
--- array.c	(revision 37754)
+++ array.c	(revision 37755)
@@ -2378,7 +2378,7 @@
  *     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
Index: ChangeLog
===================================================================
--- ChangeLog	(revision 37754)
+++ ChangeLog	(revision 37755)
@@ -1,3 +1,10 @@
+Tue Nov 20 20:10:23 2012  Yusuke Endoh  <mame@t...>
+
+	* 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@a...>
 
 	* vm_trace.c: rename and add TracePoint APIs.
Index: range.c
===================================================================
--- range.c	(revision 37754)
+++ range.c	(revision 37755)
@@ -475,7 +475,7 @@
  *     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

--
ML: ruby-changes@q...
Info: http://www.atdot.net/~ko1/quickml/