Fixes the problem, as opposed to what? What about the htable implementation does not
satisfy you now?
There are only a few ways of dealing with collisions: put them in a flat list attached to
the bucket, devise some algorithm for moving the data to neighbouring buckets, etc. The
list approach is by far the most common and straightforward. The best way to minimise
collisions entirely is to use a good hash algorithm appropriate to the types of keys being
hashed.
On 20 October 2014 12:41:50 GMT-04:00, Vik Killa <vipkilla(a)gmail.com> wrote:
Alex,
It is a collision resolution, yes collisions will still happen but it
essentially fixes the problem.
/V
On Mon, Oct 20, 2014 at 12:13 PM, Alex Balashov
<abalashov(a)evaristesys.com>
wrote:
On 10/20/2014 11:17 AM, Vik Killa wrote:
Why isn't htable designed to use separate chains to avoid collisions
altogether?
Chains do not avoid collisions; they're attached to buckets, and
simply
represent a particular data structure for
handling allocations into
the
same bucket.
--
Alex Balashov - Principal
Evariste Systems LLC
Tel: +1-678-954-0670
Web:
http://www.evaristesys.com/,
http://www.alexbalashov.com/
Please be kind to the English language:
http://www.entrepreneur.com/article/232906
_______________________________________________
SIP Express Router (SER) and Kamailio (OpenSER) - sr-users mailing
list
------------------------------------------------------------------------
_______________________________________________
SIP Express Router (SER) and Kamailio (OpenSER) - sr-users mailing list
sr-users(a)lists.sip-router.org
http://lists.sip-router.org/cgi-bin/mailman/listinfo/sr-users
--
Sent from my mobile, and thus lacking in the refinement one might expect from a fully
fledged keyboard.
Alex Balashov - Principal
Evariste Systems LLC
235 E Ponce de Leon Ave
Suite 106
Decatur, GA 30030
United States
Tel: +1-678-954-0671
Web:
http://www.evaristesys.com/,
http://www.alexbalashov.com