UHC.Util.Utils

Set

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

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'

Inverse of a map

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

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)

double lookup, with transformer for 2nd map

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

double lookup

List

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

Get head and tail, with default if empty list

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

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

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

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

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

Split up in words by predicate

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

Possibly last element and init

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

Possibly last and preceding element and init

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

variation on last which returns empty value instead of

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

First non empty list of list of lists

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

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]

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])

filterMb :: (a -> Maybe b) -> [a] -> [b]

variant on filter, where predicate also yields a result

Tuple

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

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

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

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

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

fst3 :: (t, t1, t2) -> t

snd3 :: (t, t1, t2) -> t1

thd3 :: (t, t1, t2) -> t2

thd :: (t, t1, t2) -> t2

tup1234to1 :: (t, t1, t2, t3) -> t

tup1234to2 :: (t, t1, t2, t3) -> t1

tup1234to3 :: (t, t1, t2, t3) -> t2

tup1234to4 :: (t, t1, t2, t3) -> t3

tup1234to12 :: (t2, t3, t, t1) -> (t2, t3)

tup1234to13 :: (t2, t, t3, t1) -> (t2, t3)

tup1234to14 :: (t2, t, t1, t3) -> (t2, t3)

tup1234to23 :: (t, t2, t3, t1) -> (t2, t3)

tup1234to24 :: (t, t2, t1, t3) -> (t2, t3)

tup1234to34 :: (t, t1, t2, t3) -> (t2, t3)

tup1234to123 :: (t1, t2, t3, t) -> (t1, t2, t3)

tup1234to234 :: (t, t1, t2, t3) -> (t1, t2, t3)

tup1234to124 :: (t1, t2, t, t3) -> (t1, t2, t3)

tup1234to134 :: (t1, t, t2, t3) -> (t1, t2, t3)

tup123to1234 :: t3 -> (t, t1, t2) -> (t, t1, t2, t3)

fst4 :: (t, t1, t2, t3) -> t

snd4 :: (t, t1, t2, t3) -> t1

thd4 :: (t, t1, t2, t3) -> t2

fth4 :: (t, t1, t2, t3) -> t3

fth :: (t, t1, t2, t3) -> t3

String

strWhite :: Int -> String

Blanks

strPad :: String -> Int -> String

Pad upto size with blanks

strCapitalize :: String -> String

Capitalize first letter

strToLower :: String -> String

Lower case

strToInt :: String -> Int

Convert string to Int

splitForQualified :: String -> [String]

Split into fragments based on . convention for qualified Haskell names

Show utils

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

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

class DataAndConName x where

Minimal complete definition

Nothing

Methods

dataAndConName :: x -> (String, String)

Get datatype and constructor name for a datatype

showUnprefixed :: DataAndConName x => Int -> x -> String

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

Error, with message

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

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

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]

Sort a list by comparing the results of a key function applied to each element. sortOn f is equivalent to sortBy . comparing f, but has the performance advantage of only evaluating f once for each element in the input list. This is called the decorate-sort-undecorate paradigm, or Schwartzian transform.

Since: 4.8.0.0

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

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

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

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

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

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

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

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'])

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

orderingLexic :: [Ordering] -> Ordering

Reduce compare results lexicographically to one compare result

Maybe

panicJust :: String -> Maybe a -> a

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

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

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

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

Graph

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

Monad

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

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

breakM :: Monad m => (a -> Bool) -> [m a] -> m ([a], Maybe (a, [m a]))

Monadic equivalent of break: evaluate monads until a predicate is True, returning what is yes/no evaluated and the split point