Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Re(2): Defensive Programming and Audit Trails

by Jenda (Abbot)
on Oct 31, 2002 at 14:28 UTC ( #209408=note: print w/replies, xml ) Need Help??


in reply to Re(2): Defensive Programming and Audit Trails
in thread Defensive Programming and Audit Trails

The success mail is fine if there are two or three tasks a day. Not if there are tens and hundreds. I don't want to spam myself ;-)

I guess this is the worst problem of logging and error reporting ... you either have too few or too much. But never just as much as you want ;-)

Jenda

  • Comment on Re: Re(2): Defensive Programming and Audit Trails

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://209408]
help
Chatterbox?
[Corion]: At least if you're appending the data read to a larger buffer, this means you avoid the situation of "a delimiter was found but the other half has not been read yet"
choroba misses the context
[Corion]: choroba: Optimizing how Perl reads source code on startup (and then processes it line-by-line)
[Corion]: But in general, it seems to be an interesting approach I should think about - whenever I'm searching for something, to consider if I could search for the end of the token instead of the start of the token

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (9)
As of 2016-12-06 15:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (108 votes). Check out past polls.