PF binary search tree

doesn't happen until you have over 6 state entries. Daniel I have been doing some research and I came across this message from some time ago. Is this still relevant? If so, can anyone tell me if the PF binary search tree is more or less memory efficient than the ipfilter hash table? What

Re: PF binary search tree

is that it scales on a fixed curve as the number of states increases. Hash tables can fill unevenly, or be filled unevenly by an attacher. If so, can anyone tell me if the PF binary search tree is more or less memory efficient than the ipfilter hash table? I'd imagine they're approximately the same in terms