Splits numbers with commas to make them more readable. Thanks to @maettig for being awesome
-
-
Save williammalo/2363615 to your computer and use it in GitHub Desktop.
number splitter
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(n){ | |
return //return | |
(""+n) //the number converted to a sting | |
.replace(/\B(?=(...)+$)/g,",") //with a comma inserted every 3 characters | |
} |
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
//simple version: | |
function(n){return(""+n).replace(/\B(?=(...)+$)/g,",")} | |
//Does not fuck decimals up version: | |
function f(a,b,c){return b||(c?a+',':a+'').replace(/(\.\d*)|\d(?=(\d{3})+\b)/g,f)} |
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": "numSplit", | |
"description": "Splits numbers with commas to make them more readable.", | |
"keywords": [ | |
"number", | |
"comma", | |
"math", | |
"format" | |
] | |
} |
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
<script> | |
numSplit = function(n){return(""+n).replace(/\B(?=(...)+$)/g,",")} | |
document.write(numSplit(3255325235523632)) | |
</script> |
I like it!
What about saving 2 bytes with split?
function(n){return''+(''+n).split(/\B(?=(?:...)+$)/)}
123456789..toLocaleString() seems doing the trick.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Yep, that's cool. This will start recursive calls of
replace
but it will stop immediately becausea
contains single digits only. When you do a benchmark you will see it's slower but this can be ignored because of the fast regular expression engines nowadays.