Letter frequency: Difference between revisions
Content added Content deleted
(Added FreeBASIC) |
(Added Kotlin) |
||
Line 1,480: | Line 1,480: | ||
("d";1) |
("d";1) |
||
("!";1)) |
("!";1)) |
||
</pre> |
|||
=={{header|Kotlin}}== |
|||
<lang scala>// version 1.1.1 |
|||
import java.io.File |
|||
fun main(args: Array<String>) { |
|||
val text = File("input.txt").readText().toLowerCase() |
|||
val letterMap = text.filter { it in 'a'..'z' }.groupBy { it }.toSortedMap() |
|||
for (letter in letterMap) println("${letter.key} = ${letter.value.size}") |
|||
val sum = letterMap.values.sumBy { it.size } |
|||
println("\nTotal letters = $sum") |
|||
}</lang> |
|||
{{out}} |
|||
'input.txt' just contains two pangrams: |
|||
The quick brown fox jumps over the lazy dog. |
|||
Sphinx of black quartz, judge my vow. |
|||
<pre> |
|||
a = 3 |
|||
b = 2 |
|||
c = 2 |
|||
d = 2 |
|||
e = 4 |
|||
f = 2 |
|||
g = 2 |
|||
h = 3 |
|||
i = 2 |
|||
j = 2 |
|||
k = 2 |
|||
l = 2 |
|||
m = 2 |
|||
n = 2 |
|||
o = 6 |
|||
p = 2 |
|||
q = 2 |
|||
r = 3 |
|||
s = 2 |
|||
t = 3 |
|||
u = 4 |
|||
v = 2 |
|||
w = 2 |
|||
x = 2 |
|||
y = 2 |
|||
z = 2 |
|||
Total letters = 64 |
|||
</pre> |
</pre> |
||