Talk:epoll

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Linux Low‑importance This article is within the scope of WikiProject Linux, a collaborative effort to improve the coverage of Linux on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.LinuxWikipedia:WikiProject LinuxTemplate:WikiProject LinuxLinux articles Low This article has been rated as Low-importance on the project's importance scale. Computing: Software / Free and open-source software Low‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles Low This article has been rated as Low-importance on the project's importance scale. This article is supported by WikiProject Software. This article is supported by Free and open-source software (assessed as Low-importance).

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)[reply]