[sort] How does pdq-sort allocated memory?

From: Viktor Sehr (viktor.sehr_at_[hidden])
Date: 2021-03-17 15:35:57

According to the documentation boost::pdq_sort uses Log N additional
memory. Assuming this memory is allocated via new, is it possible to
pass an allocator, or even better, a pre-reserved std::vector<T> to
the algorithm in order to avoid allocation?

I could not find anything in the documentation about this.

/VIktor