Re: Fastest Rising Monks


Perl: the Markov chain saw
	PerlMonks

Re: Fastest Rising Monks - Revisited

by halley (Prior)

on Mar 18, 2004 at 14:40 UTC ( [id://337690]=note: print w/replies, xml )

Need Help??

in reply to Fastest Rising Monks - Revisited

I was on blakem's "fastest rising" list for most of my ascent, but dropped off it quickly just about exactly at the moment I hit level 10. Real work intrudes.

One statistic I would far rather see is a ranking of Monks by the total reps of all of the Monk's nodes/writeups, completely disregarding the rep of the Monk. (A side query could split the ranks by Total Rep, Total +Rep disregarding --votes, Total -Rep disregarding ++votes.) Does anyone already have one of these specialized queries available?

--
[ e d @ h a l l e y . c c ]

Comment on Re: Fastest Rising Monks - Revisited

Replies are listed 'Best First'.

Re: Re: Fastest Rising Monks - Revisited
by Limbic~Region (Chancellor) on Mar 18, 2004 at 14:46 UTC

halley

Does anyone already have one of these specialized queries available?

Not that I know of, but it would be trivial to do so. I "stole" blakem's table parsing code and stuck it into a SQLite database. You would only need to add the write ups column to my code and build your SQL queries accordingly. After 24 hours, this project isn't fun anymore so I will leave implementation up to you.

L~R

[reply]

In Section Perl Monks Discussion