Slide 37
Slide 37 text
Node’s Concurrency Model
1 while (true) {
2 int r = select(nfds, readfds, writefds, errorfds, 0);
3 if (r === 0) {
4 continue;
5 }
6
7 // Figure out which fds had activity, accept() on server fds, read() on
// connection fds, write() queued writes
8 }
Abstracted by libuv
Different on Windows