Class: Array

Inherits:
Object
  • Object
show all
Defined in:
lib/array_bsearch.rb

Instance Method Summary collapse

Instance Method Details

#bsearch_first(range = 0 ... self.length, &block) ⇒ Object Also known as: bsearch

This method searches the FIRST occurrence which satisfies a condition given by a block in binary fashion and return the index of the first occurrence. Return nil if not found.



29
30
31
32
33
34
35
36
 
# File 'lib/array_bsearch.rb', line 29

def bsearch_first (range = 0 ... self.length, &block)
  boundary = bsearch_lower_boundary(range, &block)
  if boundary >= self.length || yield(self[boundary]) != 0
    return nil
  else 
    return boundary
  end
end

#bsearch_last(range = 0 ... self.length, &block) ⇒ Object

This method searches the LAST occurrence which satisfies a condition given by a block in binary fashion and return the index of the last occurrence. Return nil if not found.



62
63
64
65
66
67
68
69
70
71
 
# File 'lib/array_bsearch.rb', line 62

def bsearch_last (range = 0 ... self.length, &block)
  # `- 1' for canceling `lower + 1' in bsearch_upper_boundary.
  boundary = bsearch_upper_boundary(range, &block) - 1

  if (boundary <= -1 || yield(self[boundary]) != 0)
    return nil
  else
    return boundary
  end
end

#bsearch_lower_boundary(range = 0 ... self.length, &block) ⇒ Object

Return the lower boundary. (inside)



10
11
12
13
14
15
16
17
18
19
20
21
22
 
# File 'lib/array_bsearch.rb', line 10

def bsearch_lower_boundary (range = 0 ... self.length, &block)
  lower  = range.first() -1
  upper = if range.exclude_end? then range.last else range.last + 1 end
  while lower + 1 != upper
    mid = ((lower + upper) / 2).to_i # for working with mathn.rb (Rational)
    if yield(self[mid]) < 0
     lower = mid
    else 
    	upper = mid
    end
  end
  return upper
end

#bsearch_range(range = 0 ... self.length, &block) ⇒ Object

Return the search result as a Range object.



76
77
78
79
80
 
# File 'lib/array_bsearch.rb', line 76

def bsearch_range (range = 0 ... self.length, &block)
  lower = bsearch_lower_boundary(range, &block)
  upper = bsearch_upper_boundary(range, &block)
  return lower ... upper
end

#bsearch_upper_boundary(range = 0 ... self.length, &block) ⇒ Object

Return the upper boundary. (outside)



43
44
45
46
47
48
49
50
51
52
53
54
55
 
# File 'lib/array_bsearch.rb', line 43

def bsearch_upper_boundary (range = 0 ... self.length, &block)
  lower  = range.first() -1
  upper = if range.exclude_end? then range.last else range.last + 1 end
  while lower + 1 != upper
    mid = ((lower + upper) / 2).to_i # for working with mathn.rb (Rational)
    if yield(self[mid]) <= 0
      lower = mid
    else
      upper = mid
    end
  end
  return lower + 1 # outside of the matching range.
end