Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

Re (tilly) 1: Development of the Perl Monks Code of Conduct

by tilly (Archbishop)
on Nov 22, 2000 at 22:02 UTC ( #42984=note: print w/replies, xml ) Need Help??

in reply to Development of the Perl Monks Code of Conduct

These rules are going to change over time.

I have mentioned before that I think we should borrow from the various wikis the idea of communally edited documents with change history (so that if someone messes up we can go back to the old version). Perhaps limit editing control on them to people above a certain level.

If you provide that then I am sure that needs like this particular document, better site documentation, better tutorials, etc would naturally be filled.

  • Comment on Re (tilly) 1: Development of the Perl Monks Code of Conduct

Replies are listed 'Best First'.
Re: Re (tilly) 1: Development of the Perl Monks Code of Conduct
by arturo (Vicar) on Nov 22, 2000 at 23:04 UTC

    I like this, tho' complicated a a bit:

    Perhaps a Perlmonks wiki server? The pages could be periodically fetched and the relevant data formatted a la PM and displayed on

    Or a standard CVS server?

    Philosophy can be made out of anything. Or less -- Jerry A. Fodor

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://42984]
[james28909]: i am manually parsing html, and am trying to wrap my head around keeping up with tag counts
[james28909]: i can extract a certain tree manually by regexing the html file for a starting anchor, then i send the position of the match to a sub and then seek to that position in the file and keep up with div tags (for now)
[james28909]: how can i manage multiple tags? other than div?
[james28909]: i count the div and /div and when count == 0 it means i have got that nested tree

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (9)
As of 2017-04-25 03:55 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (448 votes). Check out past polls.