Showing results for January 2006 - Page 2 of 4 - The Old New Thing

Jan 24, 2006
0
0

Performance consequences of polling

Raymond Chen
Raymond Chen

Polling kills. A program should not poll as a matter of course. Doing so can have serious consequences on system performance. It's like checking your watch every minute to see if it's 3 o'clock yet instead of just setting an alarm. First of all, polling means that a small amount of CPU time gets eaten up at each poll even though there is nothing ...

Code
Jan 23, 2006
0
0

There are two types of rebates, and you need to be on the alert

Raymond Chen
Raymond Chen

Many commenters to my earlier entry on sales in France had questions about rebates. Slate explained the whole rebate thing back in 2003. The short version: There are two types of rebates, manufacturer rebates and retailer rebates. Manufacturer rebates exist because they want the retail price to go down, but they are afraid that if they just lowe...

Non-Computer
Jan 23, 2006
0
0

If your callback fails, it's your responsibility to set the error code

Raymond Chen
Raymond Chen

There are many cases where a callback function is allowed to halt an operation. For example, you might decide to return to the message to prevent the window from being created, or you might decide to return to one of the many enumeration callback functions such as the callback. When you do this, the enclosing operation will return failure bac...

Code
Jan 19, 2006
0
0

How air conditioning revolutionized competitive bicycling

Raymond Chen
Raymond Chen

I'm not really interested in sports. Teams, standings, scores, who got traded to what team, none of that is interesting to me. What I am interested in, however, is "meta-sports": The business of sports, the technology of sports, the evolution of techniques, changes in the rules, that sort of thing. That's one of the reasons I'm a fan of the radio ...

Non-Computer
Jan 19, 2006
0
0

The cost of trying too hard: String searching

Raymond Chen
Raymond Chen

There are many algorithms for fast string searching, but the running of a string search is inherently O(n), where n is the length of the string being searched: If m is the length of the string being searched for (which I will call the "target string"), then any algorithm that accesses fewer than n/m elements of the string being searc...

Code
Jan 18, 2006
0
0

From Doom to Gloom: The story of a video game

Raymond Chen
Raymond Chen

NPR's Morning Edition developed a series on the subject of flops, and one of their segments was devoted to the rise and fall of John Romero. You can read more about the phenomenon known as Daikatana in a huge series on Gamespot. Set aside at least an hour if you choose to read it. You can also read the Dallas Observer story that opened the flo...

Other
Jan 18, 2006
0
0

The cost of trying too hard: Splay trees

Raymond Chen
Raymond Chen

Often, it doesn't pay off to be too clever. Back in the 1980's, I'm told the file system group was working out what in-memory data structures to use to represent the contents of a directory so that looking up a file by name was fast. One of the experiments they tried was the splay tree. Splay trees were developed in 1985 by Sleator and Tarjan as a ...

Code
Jan 16, 2006
0
0

At least there's a funny side to spam

Raymond Chen
Raymond Chen

Poorly-drawn cartoons inspired by actual spam subject lines! It's pretty much what the title says. Don't forget to read the fan mail. Sometimes it's even funny.

Non-Computer