Copyright | (c) OleksandrZhabenko 2019-2021 |
---|---|
License | MIT |
Maintainer | olexandr543@yahoo.com |
Stability | Experimental |
Safe Haskell | None |
Language | Haskell2010 |
Synopsis
- getBFst' :: (Ord a, Unbox a, Unbox b) => (b, Vector (a, b)) -> a -> b
- getBFst :: (Ord a, Unbox a, Unbox b) => Vector (a, b) -> b -> [a] -> [b]
- getBFstV :: (Ord a, Unbox a, Unbox b) => Vector (a, b) -> b -> Vector a -> Vector b
- sortFst :: (Ord a, Unbox a, Unbox b) => [(a, b)] -> [(a, b)]
- sortFstV :: (Ord a, Unbox a, Unbox b) => [(a, b)] -> Vector (a, b)
- filterP :: (Ord a, Unbox a, Unbox b) => ((a, b) -> Bool) -> [(a, b)] -> Vector (a, b)
Function that can be used instead of case ... of
construction
:: (Ord a, Unbox a, Unbox b) | |
=> (b, Vector (a, b)) |
|
-> a | an element for which the corresponding resulting b must be found |
-> b | the result |
:: (Ord a, Unbox a, Unbox b) | |
=> Vector (a, b) | Vector of the |
-> b | a default value that can be substituted if there is no correspendence in the set of |
-> [a] | a list of values needed to be transformed accordingly to the correct |
-> [b] | the resulting list |
:: (Ord a, Unbox a, Unbox b) | |
=> Vector (a, b) | Vector of the |
-> b | a default value that can be substituted if there is no correspendence in the set of |
-> Vector a | a Vector needed to be transformed accordingly to the correct |
-> Vector b | the resulting Vector |
Additional functions that are used to sort a list of pairs (which can be obtained e. g. by zip
)
sortFst :: (Ord a, Unbox a, Unbox b) => [(a, b)] -> [(a, b)] Source #
A variant of the sortFst
that operates on the unboxed Vector
. It is inspired by the work: https://wiki.haskell.org/Introduction
Function that can be used for changing the Vector (a, b)
during its creation
:: (Ord a, Unbox a, Unbox b) | |
=> ((a, b) -> Bool) | The predicate |
-> [(a, b)] | The list of |
-> Vector (a, b) | The resulting filtered |