KFind patch for incremental searching

[Arend van Beelen jr.]

Oh, of course I will strip the debug messages before committing ;)

On Monday 07 June 2004 01:55, Arend van Beelen jr. wrote:
> Hi guys,
>
> I've completed my patch for incremental search in KFind. It does involve
> quite some extra logic to KFind though, so I'd like to post it for review
> before I commit.
> The incremental search will be used by the type-ahead find feature so it
> will be more efficient and can better respond to the path through which the
> user searches. To accomplish this, all data block set by KFind::setData()
> are cached and the search algorithm will track in which block and at which
> position every match (of the current search pattern and its substrings) is.
> If the incremental search then decrements it will select the same matches
> as it encountered during its first run. This means if the user would press
> F3 a few times between incrementing the search pattern, this path is
> followed in reverse when decrementing the pattern.
> Finally, the patch also fixes a small memleak in KFind::setOptions().
> What'd you say?

-- 
Arend van Beelen jr.
http://www.liacs.nl/~dvbeelen

So if you want my address, it's number one at the end of the bar.
-- Marillion