[Date Prev][Date Next][Thread Prev][Thread Next]
[Date Index]
[Thread Index]
- Subject: Re: Lua table implementation
- From: roberto@... (Roberto Ierusalimschy)
- Date: Thu, 5 Oct 2006 15:24:35 -0300
> 1. There is never a hash collision: Either the root at some hash index
> is set, in which case it points to a chain of relevant hash identical
> items, or it is NULL in which case no items with that hash are present yet.
I think the firt case ("the root at some hash index is set") means a
collision, doesn't it? The chain search is your collision-resolution
method.
-- Roberto
