Talk:Epoll

O(1) ?
Clearly not O(1) for add and upd (only wait) and even there, without EPOLLET, I think epoll as to search for socket with available data (unless it maintain a queue internally)?

Why do they use RB-tree instead of hashtbl ? O(1) amortized with O(n) worst case feels better than O(ln(n)) ?

Could someone who have time to look at the code comment? 148.66.126.134 (talk) 22:38, 13 January 2023 (UTC)