On Tue, Jan 15, 2008 at 10:47:33AM -0500, Chris Shoemaker [EMAIL PROTECTED]
wrote:
It's O(N) in the number of child watchers, and runs only upon SIGCHLD.
Also, it just occured to me that this is totally misleading:
Your algorithm is O(c²) where c is the number of children in the number
of
On Tue, Jan 15, 2008 at 08:28:34PM -0700, Tony Arcieri [EMAIL PROTECTED]
wrote:
Marc, could you check out the Rubinius code? I know when you looked at Rev
you spotted some obvious problems right away. If there's a problem with the
way Rubinius is doing SIGCHLD maybe you could correct it and
I think you might be taking this personally. Please don't. I'd
really like a productive dialog here. Perhaps we're talking past each
other. Perhaps we're not looking at the same version of libev. (I'm
looking at 2.01.) Perhaps I'm an idiot. However, even if I'm an
idiot, I'm not attacking
