Re: Wide Finder in Ada?

[Martin Krischik <krischik@users.sourceforge.net>]

braver schrieb:
> Tim Bray has a fantastic parallel programming challenge, Wide Finder,
> running at full speed:
> 
> http://www.tbray.org/ongoing/When/200x/2007/10/30/WF-Results
> 
> It originated by trying parallel Erlang live up to regular Ruby.  Now
> the top contenders are JoCaml -- parallel OCaml, Python, and there're
> many implementations in Erlang, Haskell, and even things like PHP and /
> bin/sh.  (This is the first place where I've heard "parallel gawk".)
> 
> Given the target box is Sun with 8 cores, Ada would shine there is my
> guess.  Perhaps some pro here could beat JoCaml?

First here is the original Ruby code:

http://www.tbray.org/ongoing/When/200x/2007/09/20/Wide-Finder

So we know what to implement. Basicly:

1 Read File
1.1 Search for %r{GET /ongoing/When/\d\d\dx/(\d\d\d\d/\d\d/\d\d/[^ .]+) }
1.2 Count hits on found string using a map
2 Output result
2.1 sort map
2.2 output top 10

First improvement would be the use of Splitbool instead of regular
expressions. And then reading and counting could be decoupled. Some
implementation decouple reading the file and spitting into lines.

First things First: Any Splitbool specialist which can turn the Ruby
regex into splitbool?


Martin

-- 
mailto://krischik@users.sourceforge.net
Ada programming at: http://ada.krischik.com