Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: Re: Reputation for anonymous monks

by Chady (Priest)
on Dec 08, 2003 at 14:34 UTC ( #313089=note: print w/replies, xml ) Need Help??

in reply to Re: Reputation for anonymous monks
in thread Reputation for anonymous monks

Neither do I, but I don't see a need to defend or keep it either.

Looks like everyone(everyone who generalizes is a fool) most monks in the Monastery are programmed like this:

if ($NODE->{title} =~ /new feature/) { print [ 'You already have that feature in your browser', 'You can already do that manually with X', 'The DB server is already very loaded', 'No' # I ran out of ideas ;) ]->[rand(4)]; }

He who asks will be a fool for five minutes, but he who doesn't ask will remain a fool for life.

Chady |

Replies are listed 'Best First'.
Re: Re: Re: Reputation for anonymous monks
by PodMaster (Abbot) on Dec 08, 2003 at 15:04 UTC
    I believe you meant to write :)
    if ($NODE->{title} =~ /new feature/) { print "I like things the way they are, and your suggest does not s +eem better",$/; }

    MJD says "you can't just make shit up and expect the computer to know what you mean, retardo!"
    I run a Win32 PPM repository for perl 5.6.x and 5.8.x -- I take requests (README).
    ** The third rule of perl club is a statement of fact: pod is sexy.

      Perhaps even this:

      if ($NODE->{title} =~ /(?:XP|vote|voting|reputation)/ or $NODE->{content} =~ /(?:XP|vote|voting|reputation)/) { print "Your name has been appended to the enormous", " list of people who dislike the implementation", " of the Voting/Experience System. Perhaps one day", " the whole thing will be discarded as a horrible", " failure."; }

Re: Re: Re: Reputation for anonymous monks
by Anonymous Monk on Dec 09, 2003 at 06:37 UTC

    Give them some credit, Eliza's code is at least slightly more complex than that ;-P

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://313089]
[Eily]: if you want to store in a structure with the coordinates as key, arrays might do, since the keys are going to be 0..n
[LanX]: (Pascale path)
[Eily]: paths like that
[Discipulus]: yes Eily++ (very keen) I want to integrate my project with a 17th experiments. I want to colorize in sequence all paths
[oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves.
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)
[LanX]: oh I meant fixed amount
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted
LanX #solved

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (8)
As of 2018-03-19 11:22 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.