This is a simple array sum function for javascript in only 89 bytes !
I could have done an array prototype, witch would have remove the "is array" check, but i wanted to do it this way.
-
-
Save whoknows/1925057 to your computer and use it in GitHub Desktop.
140byt.es -- Javascript ArraySum
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function (a //This is the array you want to sum | |
| ,b //Placeholder used as a counter | |
| ,c //Placeholder used as the total value | |
| ,d){ //Placeholder used to store the array length | |
| d=a.length; //Storing array length, it's used twice so its shorter this way | |
| return d? //First we check if a is an array | |
| function(){ //If so we start the sum function | |
| for(b=c=0; //Initialising b (counter) and c (sum) | |
| b<d; //While b is lower than d (array length) | |
| c+=a[b++]); //We put in c the actual value of a then increment b | |
| return c }() //To finish we return c | |
| :!1 //If a wasn't an array we return false | |
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function(a,b,c,d){d=a.length;return d?function(){for(b=c=0;b<d;c+=a[b++]);return c}():!1} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE | |
| Version 2, December 2004 | |
| Copyright (C) 2011 GUILLAUME COSTE <@Guillaume_Coste> | |
| 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. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "name": "JavascriptArraySum", | |
| "description": "As its name say, it's an array sum function for javascript", | |
| "keywords": [ | |
| "array", | |
| "sum", | |
| "arraysum", | |
| "array sum", | |
| "140bytes" | |
| ] | |
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <title>Javascript ArraySum</title> | |
| <div>Expected value: <b>38.4foo</b></div> | |
| <div>Actual value: <b id="ret"></b></div> | |
| <script> | |
| var arraySum = function (a,b,c,d){d=a.length;return d?function(){for(b=c=0;b<d;c+=a[b++]);return c}():!1} | |
| //We can use any type of data inside the array : | |
| document.getElementById( "ret" ).innerHTML = arraySum([4,9,6,7,12.4,'foo']) | |
| </script> |
Well I didn't even think of that, nice one !
If you don't care about non-array arguments:
function(a,b,c){c=0;for(b in a){c+=a[b]};return c}
Still wondering about concatenation problem: [1,'q'] get concatenated to '1q'.
Well, if you do this in that way, then
function(a,b,c){for(b in a)c=~~c+a[b];return c}
is even shorter.
Yes, but it rounds float to integer.
Maybe something like function(a,b,c){c=0;for(b in a){c+=+a[b]||0};return c} can do the trick.
You are right. I forget that bitwise operators round float to integer.
By the way, if you don't mind destroying the original array, then the following code can check if the input is an array:
function(a){with(a)for(a=0;length;a+=+pop()||0);return a}
And another version based on ECMAScript 5:
function f(a,b){return b?a+(+b||0):a.reduce(f)}
Another great work, but it will fail on empty arrays (it can be fixed with a.reduce(f,0)) and w/o any arguments.
A really brittle (and naughty) solution:
f = function(a){return eval(a.join("+").replace(/[^+\-1-9\.]/g,0))}
@minikomi: It can be shortened like this:
function(a){return eval(a.join("+").replace(/[^+\d.-]/g,0))}
@tsaniel Unfortunately it gives weird results for arrays with strings which include numbers before letters eg.
[1,"3dogs"] => 30001
So maybe it wasn't the right way to go in the first place 💔
function (a,b){for(b in a){a[b]=(a[b]-0)};return eval(a.join("+").replace("NaN", 0))}
What about using map? It's a bit different from your approach but this is how I would do it.
function(a,c){c=0;return a.map&&a.map(function(b){c+=isNaN(b)?0:b})&&c}
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
What about this?
function(a,b,c){for(b=c=0;b<a.length;c+=a[b++]);return!!c&&c}