 | vector-algorithms-0.3.4: Efficient algorithms for vector arrays | Contents | Index |
|
| Data.Vector.Algorithms.Combinators | | Portability | Non-portable (rank-2 types) | | Stability | Experimental | | Maintainer | Dan Doel <dan.doel@gmail.com> |
|
|
|
| Description |
| The purpose of this module is to supply various combinators for commonly
used idioms for the algorithms in this package. Examples at the time of
this writing include running an algorithm keyed on some function of the
elements (but only computing said function once per element), and safely
applying the algorithms on mutable arrays to immutable arrays.
|
|
| Synopsis |
|
|
|
| Documentation |
|
| apply :: Vector v e => (forall s mv. MVector mv e => mv s e -> ST s ()) -> v e -> v e |
| Safely applies a mutable array algorithm to an immutable array.
|
|
| Produced by Haddock version 2.7.2 |