tdunning commented on issue #703: URL: https://github.com/apache/datasketches-java/issues/703#issuecomment-3688338192
Lee, The real issue with anything other than constant size is the requirement for dynamic allocation after startup. This is an all or nothing issue. There are environments where dynamic allocation during operation is a very bad thing (the stuff I have been doing with embedded systems is an example). Even if the language has garbage collection, minimizing and simplifying the requirements for dynamic allocation pays benefits, often in terms of memory fragmentation. I agree that the different between O(1) and O(log N) space may be small in the practicalities of many situations, but there are definitely other considerations. There are cases where O(1) algorithms are much, much slower than O(log N) algorithms and there are environments where allocation is forbidden. This is just another example of your original point that your mileage *will* vary. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
