scrolling to a line

[Jim Ault]

Method result is that every character has at least one line
1. you could start with A-Z on successive lines, sort, then retain only
those letters whose next line is not that char.
2. put char 1 of each line into firstCharList; if {a-z} is not in
firstCharList, then append it; finally sort, thus all characters are present
in alphabetical order.  Locating a single line with a single character = no
other entries.
Albert Hall
Auditorium
B - null, empty, nada, bupkis, we recommend backspacing now
Concert in the Park
Dolby Theater

HTH

Jim Ault
Las Vegas

On 11/13/05 12:29 PM, "Charles Hartman" <charles.hartman at conncoll.edu>
wrote:
>> The second one, if applicable, it jumps to the line starting with
>> the next best choice before the missing line... That way you see it's
>missing.
> 
> That's the one I'm finding elusive
> 
>> Beeping is annoying... I'd rather have the hilite flash or something
>> quiet...
> 
> Yes, nothing I build beeps.