Skip to content

Instantly share code, notes, and snippets.

@karolk
Forked from 140bytes/LICENSE.txt
Created January 3, 2012 18:29
Show Gist options
  • Save karolk/1556196 to your computer and use it in GitHub Desktop.
Save karolk/1556196 to your computer and use it in GitHub Desktop.
140byt.es -- Click ↑↑ fork ↑↑ to play!

140byt.es

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

How to play

  1. Click the Fork button above to fork this gist.
  2. Modify all the files to according to the rules below.
  3. 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

  1. an assignable, valid Javascript expression that
  2. contains no more than 140 bytes, and
  3. 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.

//http://docs.python.org/library/functions.html#range
function(
a, //STaRT
o, //SToP (never reached)
e //STeP
)
{
var r = [], //results array
m = Math.abs, //alias Math.abs,
c; //variable to cache initial start and stop relation
o == c && e == c && (o = a, a = 0); //handle 1 param only, reuse c, which is still undef
e = e || 1; //step defaults to 1
c = a < o; //cache if start is greater or smaller than stop initially
if(m(o - a) < m(o - a + e)) { //run once to check if stop is being approached
for(;a != o && !(r.push(a), //until start reaches stop, keep adding values
a += e, c != a < o);) {} //change start by a step and check that it didn't overrun stop
}
return r
}
function(a,o,e){var r=[],m=Math.abs,c;o==c&&e==c&&(o=a,a=0);e=e||1;c=a<o;if(m(o-a)<m(o-a+e))for(;a!=o&&!(r.push(a),a+=e,c!=a<o););return r}
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
Version 2, December 2004
Copyright (C) 2011 Karol Kowalski <http://github.com/karolk>
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": "python-compatible range in JS",
"description": "just pythonic range",
"keywords": [
"range",
"python",
"js"
]
}
<!DOCTYPE html>
<title>Foo</title>
<div>Expected value: <b>undefined</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 range = function(a,o,e){var r=[],m=Math.abs,c;o==c&&e==c&&(o=a,a=0);e=e||1;c=a<o;if(m(o-a)<m(o-a+e))for(;a!=o&&!(r.push(a),a+=e,c!=a<o););return r}
var tests = [
[[10], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]],
[[1,11], [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]],
[[0,30,5], [0, 5, 10, 15, 20, 25]],
[[0,10,3], [0, 3, 6, 9]],
[[0,-10,-1], [0, -1, -2, -3, -4, -5, -6, -7, -8, -9]],
[[0], []],
[[1,0], []]
]
for (var i=0,l=tests.length;i<l;i++) {
document.getElementById( "ret" ).innerHTML+='returned: ['+range.apply(null,tests[i][0])+'] expected: ['+tests[i][1]+']<br>')
}
</script>
@xpansive
Copy link

xpansive commented Jan 4, 2012

You can change !(r.push(a),a+=e,c!=a<o) to (r.push(a),a+=e,c==a<o)

Edit: found this too:
a!=o becomes a^o

@atk
Copy link

atk commented Jan 4, 2012

You can reverse the for order and put the if-test inside the for loop, saving a few bytes:

function(a,o,e){for(var r=[],m=Math.abs,c;o==c&&e==c&&(o=a,a=0);e=e||1;c=a<o;m(o-a)<m(o-a+e)&&a!=o&&!(r.push(a),a+=e,c!=a<o););return r}

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment