Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot

dhoss's scratchpad

by stonecolddevin (Vicar)
on Jun 02, 2004 at 01:49 UTC ( #358977=scratchpad: print w/replies, xml ) Need Help??

package main import ( "strings" "" ) func WordCount(s string) map[string]int { words := strings.Fields(s) wordCount := make(map[string]int) for i := range words { wordCount[words[i]]++ } return wordCount } func main() { wc.Test(WordCount) }
Log In?

What's my password?
Create A New User
Discipulus sometimes i'm here alone with you, bony brother
[Discipulus]: ok a Perl one: how approach the task of getting all distinct paths from the edge to a node of a pascal triangle (nobackwards)?
[Discipulus]: each node has 2 descendants only: can i just compose hash keys usinng coords?
[karlgoethebier]: Discipulus: you shouldn't smoke turkish spices before noon
[Discipulus]: karl you says the same of my mom: in your place I'd been
[Discipulus]: preoccupied.. ;=)
Discipulus stopped with turkisk spices anyway.. but better hashes than arrays!

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (12)
As of 2018-03-19 10:55 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.