Created
March 11, 2017 22:58
-
-
Save captainkovalsky/166e9b9155697e2e84f2b925dfd5db58 to your computer and use it in GitHub Desktop.
JS Bin // source http://jsbin.com/sodexac
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> | |
<html> | |
<head> | |
<meta charset="utf-8"> | |
<meta name="viewport" content="width=device-width"> | |
<title>JS Bin</title> | |
</head> | |
<body> | |
<script id="jsbin-javascript"> | |
'use strict'; | |
var a = ['a', 'b', 'c', 'a', 'a', 'c']; | |
var count = a.reduce(function (words, word) { | |
return (words[word] ? words[word]++ : words[word] = 1, words); | |
}, {}); | |
console.log(count, 'tags'); | |
</script> | |
<script id="jsbin-source-javascript" type="text/javascript">var a = ['a', 'b', 'c', 'a', 'a', 'c']; | |
var count = a.reduce((words, word) => (words[word] ? words[word]++: words[word] = 1, words), {}); | |
console.log(count, 'tags');</script></body> | |
</html> |
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
'use strict'; | |
var a = ['a', 'b', 'c', 'a', 'a', 'c']; | |
var count = a.reduce(function (words, word) { | |
return (words[word] ? words[word]++ : words[word] = 1, words); | |
}, {}); | |
console.log(count, 'tags'); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment