tisonkun opened a new issue, #269: URL: https://github.com/apache/datasketches-rust/issues/269
Aggregation pipelines often own multiple partial `TDigestMut` states. Repeated borrowed `merge` calls recompress intermediate results, so consuming an iterator of digests should combine them with one compression pass while retaining the existing borrowed API. PR #261 explored `FromIterator<TDigestMut>`. A first implementation collected sorted slices into a `BinaryHeap` and then collected all centroids again, which added allocations and obscured the data flow. The revised approach lazily k-way merges fully compressed sorted buffers directly into compression; inputs with unsorted update tails are materialized and stably sorted once because sorting every tail separately was slower. A focused PR should cover empty and single inputs, mixed `k` values, stable tie ordering, compressed and uncompressed inputs, allocation-aware benchmarks, and the clone tradeoff between borrowed `merge` and consuming collection. -- 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]
