On Wed, Apr 7, 2010 at 8:25 PM, Eric Dumazet <eric.dumazet@xxxxxxxxx> wrote: > > Yes, a hash table would be good, but cost 8 bytes per slot. > > Changli, did you tried RBL tree ? It might fit better both your needs > and Patrick concerns... I don't think rbtree is better than idr. rbtree's time complexity is O(log2(n)), but idr is a kind of radix tree with O(1) time complexity. -- Regards， Changli Gao(xiaosuo@xxxxxxxxx) -- To unsubscribe from this list: send the line "unsubscribe netfilter-devel" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
