| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Tensort.Utils.WrapSortAlg
Description
This module provides convenience functions to wrap sorting algorithms that use the Sortable type so they can be used without worrying about type conversion.
Synopsis
- wrapSortAlg :: SortAlg -> [Bit] -> [Bit]
Documentation
wrapSortAlg :: SortAlg -> [Bit] -> [Bit] Source #
Wraps a sorting algorithm that uses the Sortable type so it can be used to sort Bits without worrying about type conversion.
Examples
>>>import Data.Tensort.Robustsort (robustsortM)>>>(wrapSortAlg robustsortM) [16, 23, 4, 8, 15, 42][4,8,15,16,23,42]