mån 2013-01-28 klockan 22:29 +0000 skrev Rainer Weikusat:
> Since Mr Rousskov was so kind to publically question my honesty and/or
> mental sanity when I claimed that replacing the O(n) event scheduler
> with a more scalable implementation would be easy (and in fact, so
> easy that even using the STL implementation wouldn't be worth the
> effort) and since I need this anyway for connection timeouts and
> possibly other stuff in the squid fork I will be maintaining for at
> least some time to come and had an hour of free time for some
> recreational programming yesterday, I thought I could just do that.
How large event queue are you expecting to see?
The code was designed using a linear list becase
a) Simplicity
b) Expected queue length is relatively short.
Regards
Henrik
Received on Wed Jan 30 2013 - 12:46:40 MST
This archive was generated by hypermail 2.2.0 : Wed Jan 30 2013 - 12:00:08 MST