Description
Provides efficient algorithms for Haskell vector arrays. It adds operations such as sorting and other array transformations designed to work with vector data structures.
It is useful for data processing, numeric code, ranking, indexing, simulations, and performance-sensitive algorithms. Developers should pay attention to mutability and memory use when applying large in-place operations.