mirror of
https://github.com/jashkenas/coffeescript.git
synced 2026-01-15 01:38:13 -05:00
6c6c8d48bf
This was done by first checking all files in the repository root by hand, and
then by doing the following:
$ npm i get-stdin@4
$ cat clean.coffee
fs = require 'fs'
stdin = require 'get-stdin'
stdin (text) ->
for file in text.trim().split('\n')
contents = fs.readFileSync file
.toString().replace /\s*$/, '\n'
fs.writeFileSync file, contents
return
$ ls !(node_modules)/**/*.coffee | coffee clean.coffee
26 lines
763 B
CoffeeScript
26 lines
763 B
CoffeeScript
# Uses a binary search algorithm to locate a value in the specified array.
|
|
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
|
|
|
|
|
|
# Test the function.
|
|
console.log 2 is binary_search [10, 20, 30, 40, 50], 30
|
|
console.log 4 is binary_search [-97, 35, 67, 88, 1200], 1200
|
|
console.log 0 is binary_search [0, 45, 70], 0
|
|
console.log -1 is binary_search [0, 45, 70], 10
|