Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re^2: Most infamous "Last words":

by swampyankee (Parson)
on Aug 25, 2006 at 23:16 UTC ( #569749=note: print w/replies, xml ) Need Help??


in reply to Re: Most infamous "Last words":
in thread Most infamous "Last words":

You want more, do you?

Vaguely program related:

and not

  • I can cross the tracks before that train,
  • I wanted to see if it [the lawn mower's blade] was turning.
  • What do you mean I can't smoke on home oxygen?
  • I thought it wasn't loaded.

emc

Only two things are infinite, the universe and human stupidity, and I'm not sure about the former.

Albert Einstein

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://569749]
help
Chatterbox?
[Corion]: Nicholas Clark++ # read for a multichar block-delimiter by scanning for the last char, and only then check whether the whole delimiter was read.
[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 taking refuge in the Monastery: (11)
As of 2016-12-06 15:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (107 votes). Check out past polls.