uhc-util-0.1.6.0: UHC utilities

Safe HaskellSafe-Inferred
LanguageHaskell98

UHC.Util.Utils

Contents

Synopsis

Set

unionMapSet :: Ord b => (a -> Set b) -> Set a -> Set b Source

Union a set where each element itself is mapped to a set

Map

inverseMap :: (Ord k, Ord v') => (k -> v -> (v', k')) -> Map k v -> Map v' k' Source

Inverse of a map

showStringMapKeys :: Map String x -> String -> String Source

Show keys of map using a separator

mapLookup2' :: (Ord k1, Ord k2) => (v1 -> Map k2 v2) -> k1 -> k2 -> Map k1 v1 -> Maybe (Map k2 v2, v2) Source

double lookup, with transformer for 2nd map

mapLookup2 :: (Ord k1, Ord k2) => k1 -> k2 -> Map k1 (Map k2 v2) -> Maybe v2 Source

double lookup

List

hdAndTl' :: a -> [a] -> (a, [a]) Source

Get head and tail, with default if empty list

hdAndTl :: [a] -> (a, [a]) Source

Get head and tail, with panic/error if empty list

maybeNull :: r -> ([a] -> r) -> [a] -> r Source

maybeHd :: r -> (a -> r) -> [a] -> r Source

wordsBy :: (a -> Bool) -> [a] -> [[a]] Source

Split up in words by predicate

initlast :: [a] -> Maybe ([a], a) Source

Possibly last element and init

initlast2 :: [a] -> Maybe ([a], a, a) Source

Possibly last and preceding element and init

last' :: a -> [a] -> a Source

variation on last which returns empty value instead of

firstNotEmpty :: [[x]] -> [x] Source

First non empty list of list of lists

listSaturate :: (Enum a, Ord a) => a -> a -> (x -> a) -> (a -> x) -> [x] -> [x] Source

Saturate a list, that is: for all indices i between min and max, if there is no listelement x for which get x returns i, add an element mk i to the list

listSaturateWith :: (Enum a, Ord a) => a -> a -> (x -> a) -> [(a, x)] -> [x] -> [x] Source

Saturate a list with values from assoc list, that is: for all indices i between min and max, if there is no listelement x for which get x returns i, add a candidate from the associationlist (which must be present) to the list

spanOnRest :: ([a] -> Bool) -> [a] -> ([a], [a]) Source

Tuple

tup123to1 :: (t, t1, t2) -> t Source

tup123to2 :: (t, t1, t2) -> t1 Source

tup123to12 :: (t1, t2, t) -> (t1, t2) Source

tup123to23 :: (t, t1, t2) -> (t1, t2) Source

tup12to123 :: t2 -> (t, t1) -> (t, t1, t2) Source

String

strPad :: String -> Int -> String Source

Pad upto size with blanks

strCapitalize :: String -> String Source

Capitalize first letter

strToLower :: String -> String Source

Lower case

strToInt :: String -> Int Source

Convert string to Int

splitForQualified :: String -> [String] Source

Split into fragments based on . convention for qualified Haskell names

Show

showUnprefixedWithTypeable :: (Show x, Typeable x) => Int -> x -> String Source

Show, additionally removing type name prefix, assuming constructor names are prefixed with type name, possibly with additional underscore (or something like that)

Misc

panic :: [Char] -> t Source

Error, with message

isSortedByOn :: (b -> b -> Ordering) -> (a -> b) -> [a] -> Bool Source

sortOnLazy :: Ord b => (a -> b) -> [a] -> [a] Source

A slightly more lazy version of Data.List.sortOn. See also https://github.com/UU-ComputerScience/uhc-util/issues/5 .

sortOn :: Ord b => (a -> b) -> [a] -> [a] Source

The original Data.List.sortOn. See also https://github.com/UU-ComputerScience/uhc-util/issues/5 .

sortByOn :: (b -> b -> Ordering) -> (a -> b) -> [a] -> [a] Source

groupOn :: Eq b => (a -> b) -> [a] -> [[a]] Source

groupByOn :: (b -> b -> Bool) -> (a -> b) -> [a] -> [[a]] Source

groupSortOn :: Ord b => (a -> b) -> [a] -> [[a]] Source

groupSortByOn :: (b -> b -> Ordering) -> (a -> b) -> [a] -> [[a]] Source

nubOn :: Eq b => (a -> b) -> [a] -> [a] Source

consecutiveBy :: (a -> a -> Bool) -> [a] -> [[a]] Source

The consecutiveBy function groups like groupBy, but based on a function which says whether 2 elements are consecutive

partitionAndRebuild :: (v -> Bool) -> [v] -> ([v], [v], [v'] -> [v'] -> [v']) Source

Partition, but also return a function which will rebuild according to the original ordering of list elements

orderingLexic :: [Ordering] -> Ordering Source

Reduce compare results lexicographically to one compare result

Maybe

($?) :: (a -> Maybe b) -> Maybe a -> Maybe b infixr 0 Source

orMb :: Maybe a -> Maybe a -> Maybe a Source

maybeAnd :: x -> (a -> b -> x) -> Maybe a -> Maybe b -> x Source

maybeOr :: x -> (a -> x) -> (b -> x) -> Maybe a -> Maybe b -> x Source

Graph

scc :: Ord n => [(n, [n])] -> [[n]] Source

Monad

firstMaybeM :: Monad m => a -> [a -> m (Maybe a)] -> m a Source

loop over monads yielding a Maybe from a start value, yielding the first Just or the start (when no Just is returned)