Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • This is my instinct as well. But what got me thinking about it is when performance gaurantees on frameworks. Example: if I recall correctly, the stl has some gaurantees around algorithmic complexity (could be off here). Commented Aug 10, 2011 at 22:48
  • Just because a library provides some guarantees doesn't mean they have to be unit-testable. Commented Aug 10, 2011 at 23:14
  • @Tobias Brick: Testing something and defining something are two different things. Commented Aug 11, 2011 at 15:05
  • Demonstrating performance is tough. It involves lots of sample points for varying parameters. It is easier when the individual functions are trivial, but beyond that ... Your load, your RAM, front bus speed, CPU, number of cores, compiler aggressiveness, degree of pollution of the registry will all affect the run time of a particular sample. Commented Aug 11, 2011 at 15:11