1
0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
v/examples/word_counter/word_counter.v

71 lines
1.4 KiB
V
Raw Normal View History

2023-03-28 23:55:57 +03:00
// Copyright (c) 2019-2023 Alexander Medvednikov. All rights reserved.
2019-06-23 05:21:30 +03:00
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.
2019-06-22 21:20:28 +03:00
import os
fn main() {
2019-06-28 16:24:46 +03:00
mut path := 'cinderella.txt'
2019-06-22 21:20:28 +03:00
if os.args.len != 2 {
println('usage: word_counter [text_file]')
println('using ${path}')
} else {
2019-06-22 21:20:28 +03:00
path = os.args[1]
}
2019-06-26 19:01:31 +03:00
contents := os.read_file(path.trim_space()) or {
println('failed to open ${path}')
2019-06-26 19:01:31 +03:00
return
}
mut m := map[string]int{}
2019-10-16 02:52:37 +03:00
for word in extract_words(contents) {
m[word]++
2019-06-22 21:20:28 +03:00
}
// Sort the keys
2020-04-26 14:49:31 +03:00
mut keys := m.keys()
2019-06-22 21:20:28 +03:00
keys.sort()
// Print the map
for key in keys {
val := m[key]
println('${key} => ${val}')
2019-06-22 21:20:28 +03:00
}
}
2019-10-16 02:52:37 +03:00
// Creates an array of words from a given string
fn extract_words(contents string) []string {
2023-05-25 16:54:46 +03:00
mut splits := []string{}
for space_split in contents.to_lower().split(' ') {
if space_split.contains('\n') {
splits << space_split.split('\n')
} else {
2023-05-25 16:54:46 +03:00
splits << space_split
2019-10-16 02:52:37 +03:00
}
}
2020-04-26 14:49:31 +03:00
mut results := []string{}
2023-05-25 16:54:46 +03:00
for s in splits {
2019-10-16 02:52:37 +03:00
result := filter_word(s)
if result == '' {
continue
}
results << result
}
return results
}
2019-06-22 21:20:28 +03:00
// Removes punctuation
fn filter_word(word string) string {
if word == '' || word == ' ' {
return ''
}
mut i := 0
2019-10-22 08:00:28 +03:00
for i < word.len && !word[i].is_letter() {
2019-06-22 21:20:28 +03:00
i++
}
start := i
2019-10-22 08:00:28 +03:00
for i < word.len && word[i].is_letter() {
2019-06-22 21:20:28 +03:00
i++
}
end := i
return word[start..end]
2019-06-22 21:20:28 +03:00
}