How match.c hash_search works with multiple checksums that have identical tags

[Wayne Davison]

On Mon, Jan 26, 2004 at 11:28:44AM -0500, Wallace Matthews wrote:
> For any set of targets with identical tags, the highest valued index
> is the resulting value in that location in the table.

No, it's the lowest index because the loop is run in reverse:

	for (i = s->count; i-- > 0; )
                tag_table[targets[i].t] = i;

Thus, the loop that scans the targets with the j++ increment is handling
things correctly.

..wayne..