(In reply to Magnus Melin from comment #92)
> Comment on attachment 8557496
> Patch v2
>
> Review of attachment 8557496:
> -----------------------------------------------------------------
>
> Hmm, Thomas has some point. So here's what I think we should do:
>
> if (nick == aSearchString)
> return BEST+1;
> if (nickIndex == 0)
> return BEST;
Cool! Looks like it could be an elegant solution to problems mentioned in my comment 88. Thanks, great teamwork!
(In reply to Magnus Melin from comment #92) ------- ------- ------- ------- ------- ------- ------- ------- --
> Comment on attachment 8557496
> Patch v2
>
> Review of attachment 8557496:
> -------
>
> Hmm, Thomas has some point. So here's what I think we should do:
>
> if (nick == aSearchString)
> return BEST+1;
> if (nickIndex == 0)
> return BEST;
Cool! Looks like it could be an elegant solution to problems mentioned in my comment 88. Thanks, great teamwork!