[Lula] Intermediate C class in the LA area?

[Jesse W]

On Jul 30, 2007, at 5:57 PM, Dan Kegel wrote:
> On 7/30/07, Jesse W <jessw at netwood.net> wrote:
>> I understand that framework well enough -- what I'm stuck on is
>> deciding what permutations would be necessary to test.
>
> 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.

As for what tab stop lists I need to try, that would be, um, at least, 
[1], [2], [10], [1, 2], [1, 10], [1, 2, 10], [10, 20], [10, 11], and 
other things I'm also not sure of.  If I were to make a exhaustive set, 
even if I limited it to 80 char lines, and only three tab stops, it'd 
still be thousands and thousands of sets...

Somehow, I don't think an exhaustive set test is a good choice here, 
unless I'm missing something...

Jesse Weinstein