Gecko [ beriskala.com ]

Name	Size	Permission	Date
images	[ DIR ]	drwxr-xr-x	2026-05-05 23:08
irb	[ DIR ]	drwxr-xr-x	2026-05-05 23:08
pty	[ DIR ]	drwxr-xr-x	2026-05-05 23:08
syntax	[ DIR ]	drwxr-xr-x	2026-05-05 23:08
ChangeLog	11.53 KB	-rw-r--r--	2026-03-11 13:21
README.md	3.48 KB	-rw-r--r--	2026-03-11 13:21
_regexp.rdoc	43.74 KB	-rw-r--r--	2026-03-11 13:21
_timezones.rdoc	5.61 KB	-rw-r--r--	2026-03-11 13:21
bsearch.rdoc	4.24 KB	-rw-r--r--	2026-03-11 13:21
bug_triaging.rdoc	4.04 KB	-rw-r--r--	2026-03-11 13:21
case_mapping.rdoc	3.15 KB	-rw-r--r--	2026-03-11 13:21
character_selectors.rdoc	3.38 KB	-rw-r--r--	2026-03-11 13:21
command_injection.rdoc	913 B	-rw-r--r--	2026-03-11 13:21
contributing.md	990 B	-rw-r--r--	2026-03-11 13:21
dig_methods.rdoc	2.57 KB	-rw-r--r--	2026-03-11 13:21
distribution.md	2.03 KB	-rw-r--r--	2026-03-11 13:21
dtrace_probes.rdoc	7.42 KB	-rw-r--r--	2026-03-11 13:21
encodings.rdoc	16.28 KB	-rw-r--r--	2026-03-11 13:21
exceptions.md	12.63 KB	-rw-r--r--	2026-03-11 13:21
extension.ja.rdoc	73.48 KB	-rw-r--r--	2026-03-11 13:21
extension.rdoc	75.21 KB	-rw-r--r--	2026-03-11 13:21
fiber.md	6.72 KB	-rw-r--r--	2026-03-11 13:21
format_specifications.rdoc	9.96 KB	-rw-r--r--	2026-03-11 13:21
forwardable.rd.ja	2.35 KB	-rw-r--r--	2026-03-11 13:21
globals.rdoc	8.32 KB	-rw-r--r--	2026-03-11 13:21
implicit_conversion.rdoc	5.8 KB	-rw-r--r--	2026-03-11 13:21
index.md	2.37 KB	-rw-r--r--	2026-03-11 13:21
maintainers.md	12.45 KB	-rw-r--r--	2026-03-11 13:21
marshal.rdoc	11.51 KB	-rw-r--r--	2026-03-11 13:21
memory_view.md	6.51 KB	-rw-r--r--	2026-03-11 13:21
packed_data.rdoc	23.19 KB	-rw-r--r--	2026-03-11 13:21
ractor.md	26.28 KB	-rw-r--r--	2026-03-11 13:21
ruby-exercise.stp	1.08 KB	-rw-r--r--	2026-04-07 16:37
security.rdoc	5.75 KB	-rw-r--r--	2026-03-11 13:21
signals.rdoc	3.33 KB	-rw-r--r--	2026-03-11 13:21
standard_library.md	11.14 KB	-rw-r--r--	2026-03-11 13:21
strftime_formatting.rdoc	16.33 KB	-rw-r--r--	2026-03-11 13:21
syntax.rdoc	1.27 KB	-rw-r--r--	2026-03-11 13:21
windows.md	6.71 KB	-rw-r--r--	2026-03-11 13:21
yarvarch.en	106 B	-rw-r--r--	2026-03-11 13:21
yarvarch.ja	16.41 KB	-rw-r--r--	2026-03-11 13:21

Rename

= Binary Searching

A few Ruby methods support binary searching in a collection:

Array#bsearch:: Returns an element selected via a binary search
                as determined by a given block.
Array#bsearch_index:: Returns the index of an element selected via a binary search
                      as determined by a given block.
Range#bsearch:: Returns an element selected via a binary search
                as determined by a given block.

Each of these methods returns an enumerator if no block is given.

Given a block, each of these methods returns an element (or element index) from +self+
as determined by a binary search.
The search finds an element of +self+ which meets
the given condition in <tt>O(log n)</tt> operations, where +n+ is the count of elements.
+self+ should be sorted, but this is not checked.

There are two search modes:

Find-minimum mode:: method +bsearch+ returns the first element for which
                    the block returns +true+;
                    the block must return +true+ or +false+.
Find-any mode:: method +bsearch+ some element, if any, for which
                the block returns zero.
                the block must return a numeric value.

The block should not mix the modes by sometimes returning +true+ or +false+
and other times returning a numeric value, but this is not checked.

<b>Find-Minimum Mode</b>

In find-minimum mode, the block must return +true+ or +false+.
The further requirement (though not checked) is that
there are no indexes +i+ and +j+ such that:

- <tt>0 <= i < j <= self.size</tt>.
- The block returns +true+ for <tt>self[i]</tt> and +false+ for <tt>self[j]</tt>.

Less formally: the block is such that all +false+-evaluating elements
precede all +true+-evaluating elements.

In find-minimum mode, method +bsearch+ returns the first element
for which the block returns +true+.

Examples:

a = [0, 4, 7, 10, 12]
  a.bsearch {|x| x >= 4 } # => 4
  a.bsearch {|x| x >= 6 } # => 7
  a.bsearch {|x| x >= -1 } # => 0
  a.bsearch {|x| x >= 100 } # => nil

r = (0...a.size)
  r.bsearch {|i| a[i] >= 4 } #=> 1
  r.bsearch {|i| a[i] >= 6 } #=> 2
  r.bsearch {|i| a[i] >= 8 } #=> 3
  r.bsearch {|i| a[i] >= 100 } #=> nil
  r = (0.0...Float::INFINITY)
  r.bsearch {|x| Math.log(x) >= 0 } #=> 1.0

These blocks make sense in find-minimum mode:

a = [0, 4, 7, 10, 12]
  a.map {|x| x >= 4 } # => [false, true, true, true, true]
  a.map {|x| x >= 6 } # => [false, false, true, true, true]
  a.map {|x| x >= -1 } # => [true, true, true, true, true]
  a.map {|x| x >= 100 } # => [false, false, false, false, false]

This would not make sense:

a.map {|x| x == 7 } # => [false, false, true, false, false]

In find-any mode, the block must return a numeric value.
The further requirement (though not checked) is that
there are no indexes +i+ and +j+ such that:

- <tt>0 <= i < j <= self.size</tt>.
- The block returns a negative value for <tt>self[i]</tt>
  and a positive value for <tt>self[j]</tt>.
- The block returns a negative value for <tt>self[i]</tt> and zero <tt>self[j]</tt>.
- The block returns zero for <tt>self[i]</tt> and a positive value for <tt>self[j]</tt>.

Less formally: the block is such that:

- All positive-evaluating elements precede all zero-evaluating elements.
- All positive-evaluating elements precede all negative-evaluating elements.
- All zero-evaluating elements precede all negative-evaluating elements.

In find-any mode, method +bsearch+ returns some element
for which the block returns zero, or +nil+ if no such element is found.

Examples:

a = [0, 4, 7, 10, 12]
  a.bsearch {|element| 7 <=> element } # => 7
  a.bsearch {|element| -1 <=> element } # => nil
  a.bsearch {|element| 5 <=> element } # => nil
  a.bsearch {|element| 15 <=> element } # => nil

a = [0, 100, 100, 100, 200]
  r = (0..4)
  r.bsearch {|i| 100 - a[i] } #=> 1, 2 or 3
  r.bsearch {|i| 300 - a[i] } #=> nil
  r.bsearch {|i|  50 - a[i] } #=> nil

These blocks make sense in find-any mode:

a = [0, 4, 7, 10, 12]
  a.map {|element| 7 <=> element } # => [1, 1, 0, -1, -1]
  a.map {|element| -1 <=> element } # => [-1, -1, -1, -1, -1]
  a.map {|element| 5 <=> element } # => [1, 1, -1, -1, -1]
  a.map {|element| 15 <=> element } # => [1, 1, 1, 1, 1]

This would not make sense:

a.map {|element| element <=> 7 } # => [-1, -1, 0, 1, 1]