yefremov/LICENSE.txt

## README.md

      
    Raw
  

              README.md
            
          
    140byt.es

A tweet-sized, fork-to-play, community-curated collection of JavaScript.
How to play


Click the  button above to fork this gist.
Modify all the files to according to the rules below.
Save your entry and tweet it up!

Keep in mind that thanks to the awesome sensibilities of the GitHub team, gists are just repos. So feel free to clone yours and work locally for a more comfortable environment, and to allow commit messages.
Rules

All entries must exist in an index.js file, whose contents are

an assignable, valid Javascript expression that
contains no more than 140 bytes, and
does not leak to the global scope.

All entries must also be licensed under the WTFPL or equally permissive license.
For more information

See the 140byt.es site for a showcase of entries (built itself using 140-byte entries!), and follow @140bytes on Twitter.
To learn about byte-saving hacks for your own code, or to contribute what you've learned, head to the wiki.
140byt.es is brought to you by Jed Schmidt, with help from Alex Kloss. It was inspired by work from Thomas Fuchs and Dustin Diaz.

  
## annotated.js
function (
  a,                    // ordered array
  b,                    // search value
  c,                    // placeholder for high index
  d,                    // placeholder for low index
  e                     // placeholder for current index
) {
  c = a.length;         // start index for high
  d = -1;               // start index for low
  for (;c - d > 1;)     // traverse while (high - low) is greater than first element index
    a[e = c + d >> 1]   // shift right (high + low) index to set current index and get current value
    >                   // if current value is greater
    b                   // than search value
    ?                   //
    c = e               // lower high index to current
    :                   // else
    d = e               // raise low index to current
  return (
    a[c] - b            // if high value
    >                   // is closer
    b - a[d]            // to search value
    ?                   // than low value
    d                   // return high index
    :                   // else
    c                   // return low index
  )
}

## index.js
function(a,b,c,d,e){c=a.length;d=-1;for(;c-d>1;)a[e=c+d>>1]>b?c=e:d=e;return a[c]-b>b-a[d]?d:c}

## LICENSE.txt
            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
                    Version 2, December 2004

 Copyright (C) 2011 YOUR_NAME_HERE <YOUR_URL_HERE>

 Everyone is permitted to copy and distribute verbatim or modified
 copies of this license document, and changing it is allowed as long
 as the name is changed.

            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION

  0. You just DO WHAT THE FUCK YOU WANT TO.

## package.json
{
  "name": "closestNumberInOrderedArray",

  "description": "Find closest number in  ordered array",

  "keywords": [
    "number",
    "array",
    "right shift",
    "search",
    "find",
    "closest",
    "nearest"
  ]
}

## test.html
<!DOCTYPE html>
<title>Foo</title>
<div>Expected value: <b>-12, -22, 8, 39, 128</b></div>
<div>Actual value: <b id="ret"></b></div>
<script>
  // write a small example that shows off the API for your example
  // and tests it in one fell swoop.
  var numbers = [-31, -22, -21, -12, -11, -4, -2, 0, 3, 8, 12, 22, 23, 25, 31, 39, 44, 56, 128];
  var myFunction = function(a,b,c,d,e){c=a.length;d=-1;for(;c-d>1;)a[e=c+d>>1]>b?c=e:d=e;return a[c]-b>b-a[d]?d:c}

  document.getElementById( "ret" ).innerHTML = numbers[myFunction(numbers,-15)] + ', ' + numbers[myFunction(numbers,-25)] + ', ' + numbers[myFunction(numbers,7)] + ', ' + numbers[myFunction(numbers,35)] + ', ' + numbers[myFunction(numbers,99)];
</script>
	function (
	a, // ordered array
	b, // search value
	c, // placeholder for high index
	d, // placeholder for low index
	e // placeholder for current index
	) {
	c = a.length; // start index for high
	d = -1; // start index for low
	for (;c - d > 1;) // traverse while (high - low) is greater than first element index
	a[e = c + d >> 1] // shift right (high + low) index to set current index and get current value
	> // if current value is greater
	b // than search value
	? //
	c = e // lower high index to current
	: // else
	d = e // raise low index to current
	return (
	a[c] - b // if high value
	> // is closer
	b - a[d] // to search value
	? // than low value
	d // return high index
	: // else
	c // return low index
	)
	}
	DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
	Version 2, December 2004

	Copyright (C) 2011 YOUR_NAME_HERE <YOUR_URL_HERE>

	Everyone is permitted to copy and distribute verbatim or modified
	copies of this license document, and changing it is allowed as long
	as the name is changed.

	DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
	TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION

	0. You just DO WHAT THE FUCK YOU WANT TO.
	{
	"name": "closestNumberInOrderedArray",

	"description": "Find closest number in ordered array",

	"keywords": [
	"number",
	"array",
	"right shift",
	"search",
	"find",
	"closest",
	"nearest"
	]
	}
	<!DOCTYPE html>
	<title>Foo</title>
	<div>Expected value: <b>-12, -22, 8, 39, 128</b></div>
	<div>Actual value: <b id="ret"></b></div>
	<script>
	// write a small example that shows off the API for your example
	// and tests it in one fell swoop.
	var numbers = [-31, -22, -21, -12, -11, -4, -2, 0, 3, 8, 12, 22, 23, 25, 31, 39, 44, 56, 128];
	var myFunction = function(a,b,c,d,e){c=a.length;d=-1;for(;c-d>1;)a[e=c+d>>1]>b?c=e:d=e;return a[c]-b>b-a[d]?d:c}

	document.getElementById( "ret" ).innerHTML = numbers[myFunction(numbers,-15)] + ', ' + numbers[myFunction(numbers,-25)] + ', ' + numbers[myFunction(numbers,7)] + ', ' + numbers[myFunction(numbers,35)] + ', ' + numbers[myFunction(numbers,99)];
	</script>