How would you modify this version of wordcount for So ?

[serge-hulne]

I suppose you just would have to implement a scanner and a sort routine (quicksort?).

package main

import (
	"bufio"
	"fmt"
	"log"
	"os"
	"sort"
)

func main() {

	var counts = make(map[string]float64)
	//var countTotal float64

	file, err := os.Open(os.Args[1])
	if err != nil {
		log.Fatal(err)
	}

	scanner := bufio.NewScanner(file)
	scanner.Split(bufio.ScanWords)
	for scanner.Scan() {
		counts[scanner.Text()] += 1.0
		//countTotal += 1.0
	}

	var words = make([]string, 0, len(counts))
	for word := range counts {
		words = append(words, word)
	}

	sort.SliceStable(words, func(i, j int) bool {
		return counts[words[i]] > counts[words[j]]
	})

	cpt := 0
	for _, word := range words {
		if cpt < 9 {
			//fmt.Println(word, ": ", counts[word]/countTotal)
			fmt.Println(word, ": ", counts[word])
			cpt++
		}
	}

}

[nalgeon]

So is currently missing the bufio package. Sorting is already implemented in the slices package.

You can see the packages planned for v0.1.0 in the roadmap. Stay tuned!

[serge-hulne]

Thanks!