browser/devtools/debugger/test/code_binary_search.coffee

Thu, 15 Jan 2015 21:03:48 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Thu, 15 Jan 2015 21:03:48 +0100
branch
TOR_BUG_9701
changeset 11
deefc01c0e14
permissions
-rw-r--r--

Integrate friendly tips from Tor colleagues to make (or not) 4.5 alpha 3;
This includes removal of overloaded (but unused) methods, and addition of
a overlooked call to DataStruct::SetData(nsISupports, uint32_t, bool.)

     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