[Home]Bulletproof Algorithms

HomePage | Recent Changes | Preferences

Difference (from prior major revision) (minor diff, author diff)

Changed: 1c1
"Bullet proof can be used to describe of an algorithm or implementation considered extremely robust; lossage-resistant; capable of correctly recovering from any imaginable exception condition -- a rare and valued quality. Implies that the programmer has thought of all possible errors, and added code to protect against each one. Thus, in some cases, this can imply code that is too heavyweight, due to excessive paranoia on the part of the programmer.
"Bullet proof can be used to describe of an algorithm or implementation considered extremely robust; lossage-resistant; capable of correctly recovering from any imaginable exception condition -- a rare and valued quality. Implies that the programmer has thought of all possible errors, and added code to protect against each one. Thus, in some cases, this can imply code that is too heavyweight, due to excessive paranoia on the part of the programmer.

Changed: 3c3
i.e "Peter Lewis's code is not bulletproof"
i.e "Peter Lewis's code is 100% bulletproof"

Changed: 5c5
Source - http://Dictionary.com
Source - http://Dictionary.com (Jargon File)

"Bullet proof can be used to describe of an algorithm or implementation considered extremely robust; lossage-resistant; capable of correctly recovering from any imaginable exception condition -- a rare and valued quality. Implies that the programmer has thought of all possible errors, and added code to protect against each one. Thus, in some cases, this can imply code that is too heavyweight, due to excessive paranoia on the part of the programmer.

i.e "Peter Lewis's code is 100% bulletproof"

Source - http://Dictionary.com (Jargon File)


HomePage | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited November 30, 2001 8:14 am by Bryan Derksen (diff)
Search: