RE: Lua table implementation

["Couwenberg, Wim" <wim.couwenberg@...>]

> > 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.

Yes, terminology is wrong here, sorry.  I meant the fact that in Lua's
table a hash slot can be occupied by an item with a different hash (so
from a different chain).  Such an item has to be moved when inserting a
new item, etc.

--
Wim

This message and attachment(s) are intended solely for the use of the addressee and may contain information that is privileged, confidential or otherwise exempt from disclosure under applicable law.  
If you are not the intended recipient or agent thereof responsible for delivering this message to the intended recipient, you are hereby notified that any dissemination, distribution, or copying of this communication is strictly prohibited.  
If you have received this communication in error, please notify the sender immediately by telephone and with a "reply" message.  
Thank you for your cooperation.