Hi all,
I noticed in some of the kernel stuctures specially in hash tables when a collision happens they have both a red-black tree and a regular link list structure for storing the same object, that is they store the same object both in a red-black tree structure and in a regular linear link list. Could anyone explain why they want to maintain the same object in two separate lists?
Thanks
st
Yahoo! DSL Something to write home about. Just $16.99/mo. or less
