| 4776 | */ |
| 4777 | template <typename container_type_, typename string_extractor_> |
| 4778 | std::vector<sorted_idx_t> argsort( // |
| 4779 | container_type_ const &container, string_extractor_ const &extractor) noexcept(false) { |
| 4780 | std::vector<sorted_idx_t> order(container.size()); |
| 4781 | status_t status = try_argsort(container, extractor, order.data()); |
| 4782 | raise(status); |
| 4783 | return order; |
| 4784 | } |
| 4785 | |
| 4786 | /** |
| 4787 | * @brief Computes the permutation of an array, that would lead to sorted order. |
no test coverage detected
searching dependent graphs…