func Unique(words []string) []string {
	m := Count(words)
	s := make([]string, 0, len(m))
	for w := range m {
		s = append(s, w)
	}
	sort.Strings(s)
	return s
}
Unique returns a vector of unique words from the words input vector
sorted ascending.
package wordcount
import (
	"sort"
	"github.com/kortschak/utter"
)
func Count(words []string) map[string]int {
	m := make(map[string]int)
	for _, w := range words {
		m[w]++
	}
	return m
}
type WordStats struct {
	Count  int `rgo:"count"`
	Length int `rgo:"length"`
}
func CountWithLength(words []string) map[string]WordStats {
	m := make(map[string]WordStats)
	for _, w := range words {
		s := m[w]
		s.Count++
		s.Length = len(w)
		m[w] = s
	}
	return m
}
func PrintCountWithLength(a map[string]WordStats) { utter.Dump(a) }