[Lula] Intermediate C class in the LA area?

[Dan Kegel]

On 7/30/07, Jesse W <jessw at netwood.net> wrote:
> > Just generate an exhaustive set in a loop.  Easy!
> Heh.  That would be (assuming all non-tab non-space, non-newline chars
> are equivalent) 4 raised to the length of the string tested (which
> should be at least as long as the maximum tabstop), times however many
> combinations of tab stops I need to test.

Where'd that 4 come from?  You can probably get by testing
just tabstops every 2 spaces.  Cuts it down a lot.  And you don't
need 80 char lines, the equivalent of 2 tabstops should do.
That's getting down to < 2^8th tests.

But even if you ended up testing a million cases,
that's ok, computers are fast.

If this were a real problem, you might define a small
smoke test that finishes quickly, and a large test that is
more exhaustive.