browser/devtools/debugger/test/code_binary_search.coffee

Thu, 22 Jan 2015 13:21:57 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Thu, 22 Jan 2015 13:21:57 +0100
branch
TOR_BUG_9701
changeset 15
b8a032363ba2
permissions
-rw-r--r--

Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6

     1 # Uses a binary search algorithm to locate a value in the specified array.
     2 window.binary_search = (items, value) ->
     4   start = 0
     5   stop  = items.length - 1
     6   pivot = Math.floor (start + stop) / 2
     8   while items[pivot] isnt value and start < stop
    10     # Adjust the search area.
    11     stop  = pivot - 1 if value < items[pivot]
    12     start = pivot + 1 if value > items[pivot]
    14     # Recalculate the pivot.
    15     pivot = Math.floor (stop + start) / 2
    17   # Make sure we've found the correct value.
    18   if items[pivot] is value then pivot else -1

mercurial