summaryrefslogtreecommitdiffstats
path: root/devtools/client/debugger/test/mochitest/code_binary_search.coffee
blob: e3dacdaaab50602ee03f6eeae8579c8a38b978b2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
# Uses a binary search algorithm to locate a value in the specified array.
window.binary_search = (items, value) ->

  start = 0
  stop  = items.length - 1
  pivot = Math.floor (start + stop) / 2

  while items[pivot] isnt value and start < stop

    # Adjust the search area.
    stop  = pivot - 1 if value < items[pivot]
    start = pivot + 1 if value > items[pivot]

    # Recalculate the pivot.
    pivot = Math.floor (stop + start) / 2

  # Make sure we've found the correct value.
  if items[pivot] is value then pivot else -1