So you are right in your saying that when Sorted = true, Add()'s are with binary search. But there is a HACK one needs to be very careful about: If you do not set Duplicates = dupAccept, then it calls IndexOf() before inserting to see if the same value exists!!
That must have been the reason our code got that faster (not the to insert() change)! Regards, SZ On Tue, Dec 7, 2010 at 7:48 PM, Arno Garrels <arno.garr...@gmx.de> wrote: > Anton S. wrote: > > Arno wrote: > >> I don't think so, why should it? > > > > Well, the connection to HTTP client is closed when response is sent > > That depends on whether the client uses HTTP 1.0 or HTTP 1.1 and whether > or not the Keep-Alive header is sent. > > > (usually; there are some options in the request header to keep it but > > these cases are rarer). I'm just supposing, not asserting. > > IndexOf() is only used when the client disconnects in order to delete > its reference from the client list. > > -- > Arno Garrels > > -- To unsubscribe or change your settings for TWSocket mailing list please goto http://lists.elists.org/cgi-bin/mailman/listinfo/twsocket Visit our website at http://www.overbyte.be
