On Sat, 26 Aug 2023, Timothe Litt via curl-library wrote:
Not very efficient if there are lots of handles. You will scan the list
O(n^2) looking for prev each time - or, I suppose create a hash.
Between each invoke there may be N new handles added and M handles may have
been removed. How would the hash work?
--
/ daniel.haxx.se
| Commercial curl support up to 24x7 is available!
| Private help, bug fixes, support, ports, new features
| https://curl.se/support.html
--
Unsubscribe: https://lists.haxx.se/mailman/listinfo/curl-library
Etiquette: https://curl.se/mail/etiquette.html
