{- |

Module : $Header$

Description : utility functions that can't be found in the libraries

Copyright : (c) Klaus Luettich, Uni Bremen 2002-2006

License : GPLv2 or higher

Maintainer : Christian.Maeder@dfki.de

Stability : provisional

Portability : portable

Utility functions that can't be found in the libraries

but should be shared across Hets.

-}

module Common.Utils

( isSingleton

, replace

, hasMany

, number

, combine

, trim

, trimLeft

, trimRight

, nubOrd

, nubOrdOn

, readMaybe

, mapAccumLM

, mapAccumLCM

, composeMap

, keepMins

, splitOn

, splitBy

, splitByList

, numberSuffix

, matchPaths

, basename

, dirname

, fileparse

, stripDir

, stripSuffix

, makeRelativeDesc

, getEnvSave

, getEnvDef

, filterMapWithList

, timeoutCommand

, withinDirectory

, writeTempFile

) where

import Data.Char

import Data.List

import Data.Maybe

import qualified Data.Map as Map

import qualified Data.Set as Set

import System.Exit

import System.IO

import System.Directory

import System.Environment

import System.Process

import System.FilePath (joinPath, makeRelative, equalFilePath, takeDirectory)

import Control.Monad

import Control.Concurrent

-- | replace first (non-empty) sublist with second one in third argument list

replace :: Eq a => [a] -> [a] -> [a] -> [a]

replace sl r = case sl of

[] -> error "Common.Utils.replace: empty list"

_ -> concat . unfoldr (\ l -> case l of

[] -> Nothing

hd : tl -> Just $ case stripPrefix sl l of

Nothing -> ([hd], tl)

Just rt -> (r, rt))

-- | add indices to a list starting from one

number :: [a] -> [(a, Int)]

number = flip zip [1 ..]

-- | /O(1)/ test if the set's size is one

isSingleton :: Set.Set a -> Bool

isSingleton s = Set.size s == 1

-- | /O(1)/ test if the set's size is greater one

hasMany :: Set.Set a -> Bool

hasMany s = Set.size s > 1

{- | Transform a list @[l1, l2, ... ln]@ to (in sloppy notation)

@[[x1, x2, ... xn] | x1 <- l1, x2 <- l2, ... xn <- ln]@

(this is just the 'sequence' function!) -}

combine :: [[a]] -> [[a]]

combine = sequence

-- see http://www.haskell.org/pipermail/haskell-cafe/2009-November/069490.html

-- | trims a string both on left and right hand side

trim :: String -> String

trim = trimRight . trimLeft

-- | trims a string only on the left side

trimLeft :: String -> String

trimLeft = dropWhile isSpace

-- | trims a string only on the right side

trimRight :: String -> String

trimRight = reverse . trimLeft . reverse

{- | The 'nubWith' function accepts as an argument a \"stop list\" update

function and an initial stop list. The stop list is a set of list elements

that 'nubWith' uses as a filter to remove duplicate elements. The stop list

is normally initially empty. The stop list update function is given a list

element a and the current stop list b, and returns 'Nothing' if the element is

already in the stop list, else 'Just' b', where b' is a new stop list updated

to contain a. -}

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

nubWith f s es = case es of

[] -> []

e : rs -> case f e s of

Just s' -> e : nubWith f s' rs

Nothing -> nubWith f s rs

nubOrd :: Ord a => [a] -> [a]

nubOrd = nubOrdOn id

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

nubOrdOn g = let f a s = let e = g a in

if Set.member e s then Nothing else Just (Set.insert e s)

in nubWith f Set.empty

readMaybe :: Read a => String -> Maybe a

readMaybe s = case filter (all isSpace . snd) $ reads s of

[(a, _)] -> Just a

_ -> Nothing

-- | generalization of mapAccumL to monads

mapAccumLM :: Monad m

=> (acc -> x -> m (acc, y))

{- ^ Function taking accumulator and list element,

returning new accumulator and modified list element -}

-> acc -- ^ Initial accumulator

-> [x] -- ^ Input list

-> m (acc, [y]) -- ^ Final accumulator and result list

mapAccumLM f s l = case l of

[] -> return (s, [])

x : xs -> do

(s', y) <- f s x

(s'', ys) <- mapAccumLM f s' xs

return (s'', y : ys)

-- | generalization of mapAccumL to monads with combine function

mapAccumLCM :: (Monad m) => (a -> b -> c) -> (acc -> a -> m (acc, b))

-> acc -> [a] -> m (acc, [c])

mapAccumLCM g f s l = case l of

[] -> return (s, [])

x : xs -> do

(s', y) <- f s x

(s'', ys) <- mapAccumLCM g f s' xs

return (s'', g x y : ys)

-- | composition of arbitrary maps

composeMap :: Ord a => Map.Map a b -> Map.Map a a -> Map.Map a a -> Map.Map a a

composeMap s m1 m2 = if Map.null m2 then m1 else Map.intersection

(Map.foldWithKey ( \ i j ->

let k = Map.findWithDefault j j m2 in

if i == k then Map.delete i else Map.insert i k) m2 m1) s

-- | keep only minimal elements

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

keepMins lt l = case l of

[] -> []

x : r -> let s = filter (not . lt x) r

m = keepMins lt s

in if any (`lt` x) s then m

else x : m

{- |

A function inspired by the perl function split. A list is splitted

on a seperator element in smaller non-empty lists.

The seperator element is dropped from the resulting list.

-}

splitOn :: Eq a => a -- ^ seperator

-> [a] -- ^ list to split

-> [[a]]

splitOn x = filter (not . null) . splitBy x

{- |

Same as splitOn but empty lists are kept. Even the empty list is split into

a singleton list containing the empty list.

-}

splitBy :: Eq a => a -- ^ seperator

-> [a] -- ^ list to split

-> [[a]]

splitBy c l = let (p, q) = break (c ==) l in

if null q then [p] else p : splitBy c (tail q)

-- | Same as splitBy but the seperator is a sublist not only one element.

splitByList :: Eq a => [a] -> [a] -> [[a]]

splitByList sep l = split' [] [] l where

split' acc bag l' = case l' of

[] -> bag ++ [acc]

x : xs -> case stripPrefix sep l' of

Nothing -> split' (acc ++ [x]) bag xs

Just l'' -> split' [] (bag ++ [acc]) l''

{- | Returns all initial segments of the second list where the continuing

list matches a nonempty prefix of the first list. The first list is

concatenated to each such segment and the size of the matching prefix is

attached to the entry in the output list.

Subsumed entries are not returned. Example:

> prefixsAsInfixs "bac" "dbabacabd" ==

> [(1, "dbabacabac"), (3, "dbabac"), (2, "dbac")]

-}

prefixsAsInfixs :: (Eq a, Show a) => [a] -> [a] -> [(Int, [a])]

prefixsAsInfixs [] _ = []

prefixsAsInfixs sep l = f [] [] sep [] l where

-- acc: the input list until the current match

-- bag: the output bag containing all matches

updB bag acc c = (length c, acc ++ sep) : bag

f bag _ _ [] [] = bag

f bag acc _ c [] = updB bag acc c

f bag acc [] c l' = f (updB bag acc c) (acc ++ c) sep [] l'

f bag acc (s : sl) c xl@(x : xs)

| s == x = f bag acc sl (c ++ [x]) xs

| null c = f bag (acc ++ [x]) sep [] xs

| otherwise = f (updB bag acc c) (acc ++ [head c]) sep [] $ tail c ++ xl

-- | If the given string is terminated by a decimal number

-- this number and the nonnumber prefix is returned.

numberSuffix :: String -> Maybe (String, Int)

numberSuffix s =

let f a r@(x, y, b) =

let b' = isDigit a

y' = y + x * digitToInt a

out | not b = r

| b && b' = (x * 10, y', b')

| otherwise = (x, y, False)

in out

in case foldr f (1, 0, True) s of

(1, _, _) ->

Nothing

(p, n, _) ->

Just (take (1 + length s - length (show p)) s, n)

{- | Matches first relative path against second absolute path. Example:

> matchPaths "a/b/c" "/x/y/a/d" == "/x/y/a/b/c"

> (not "/x/y/a/a/b/c" !)

-}

matchPaths :: FilePath -- ^ relative path

-> FilePath -- ^ reference path for matching

-> Maybe FilePath -- ^ path

matchPaths rFP refFP =

let rp = splitBy '/' rFP

refp = splitBy '/' refFP

rpI = init rp

refpI = init refp

matchs = prefixsAsInfixs rp refpI

cmp (n, s) (n', s') = case compare n n' of

EQ -> compare (length s) (length s')

od -> od

(_, bestmatch) = maximumBy cmp matchs

in if null rpI then Just $ intercalate "/" $ refpI ++ [rFP]

else case matchs of

[] -> Nothing

_ -> Just $ intercalate "/" bestmatch

{- |

A function inspired by a perl function from the standard perl-module

File::Basename. It removes the directory part of a filepath.

-}

basename :: FilePath -> FilePath

basename = snd . stripDir

{- |

A function inspired by a perl function from the standard perl-module

File::Basename. It gives the directory part of a filepath.

-}

dirname :: FilePath -> FilePath

dirname = fst . stripDir

{- |

A function inspired by a perl function from the standard perl-module

File::Basename. It splits a filepath into the basename, the

directory and gives the suffix that matched from the list of

suffixes. If a suffix matched it is removed from the basename.

-}

fileparse :: [String] -- ^ list of suffixes

-> FilePath

-> (FilePath, FilePath, Maybe String)

-- ^ (basename,directory,matched suffix)

fileparse sufs fp = let (path, base) = stripDir fp

(base', suf) = stripSuffix sufs base

in (base', path, suf)

stripDir :: FilePath -> (FilePath, FilePath)

stripDir =

(\ (x, y) -> (if null y then "./" else reverse y, reverse x))

. break (== '/') . reverse

stripSuffix :: [String] -> FilePath -> (FilePath, Maybe String)

stripSuffix suf fp = case filter isJust $ map (stripSuf fp) suf of

Just (x, s) : _ -> (x, Just s)

_ -> (fp, Nothing)

where stripSuf f s | s `isSuffixOf` f =

Just (take (length f - length s) f, s)

| otherwise = Nothing

{- |

This function generalizes makeRelative in that it computes also a relative

path with descents such as ../../test.txt

-}

makeRelativeDesc :: FilePath -- ^ path to a directory

-> FilePath -- ^ to be computed relatively to given directory

-> FilePath -- ^ resulting relative path

makeRelativeDesc dp fp = f dp fp []

where f "" y l = joinPath $ l ++ [y]

f x y l = let y' = makeRelative x y

in if equalFilePath y y'

then f (takeDirectory x) y $ ".." : l

else joinPath $ l ++ [y']

{- | filter a map according to a given list of keys (it dosen't hurt

if a key is not present in the map) -}

filterMapWithList :: Ord k => [k] -> Map.Map k e -> Map.Map k e

filterMapWithList = filterMapWithSet . Set.fromList

{- | filter a map according to a given set of keys (it dosen't hurt if

a key is not present in the map) -}

filterMapWithSet :: Ord k => Set.Set k -> Map.Map k e -> Map.Map k e

filterMapWithSet s = Map.filterWithKey (\ k _ -> Set.member k s)

{- | get, parse and check an environment variable; provide the default

value, only if the envionment variable is not set or the

parse-check-function returns a Left value -}

getEnvSave :: a -- ^ default value

-> String -- ^ name of environment variable

-> (String -> Maybe a)

{- ^ parse and check value of variable;

for every b the default value is returned -}

-> IO a

getEnvSave defValue envVar readFun =

liftM (maybe defValue (fromMaybe defValue . readFun)

. lookup envVar) getEnvironment

-- | get environment variable

getEnvDef :: String -- ^ environment variable

-> String -- ^ default value

-> IO String

getEnvDef envVar defValue = getEnvSave defValue envVar Just

-- | runs a command with timeout

timeoutCommand :: Int -> String -> IO (Maybe ExitCode, Handle, Handle)

timeoutCommand time cmd = do

wait <- newEmptyMVar

(_, outh, errh, proch) <- runInteractiveCommand cmd

tid1 <- forkIO $ do

exit <- waitForProcess proch

putMVar wait $ Just exit

tid2 <- forkIO $ do

threadDelay $ time * 1000000

putMVar wait Nothing

terminateProcess proch

res <- takeMVar wait

killThread (if isJust res then tid2 else tid1) `catch` print

return (res, outh, errh)

{- | runs an action in a different directory without changing the current

directory globally. -}

withinDirectory :: FilePath -> IO a -> IO a

withinDirectory p a = do

d <- getCurrentDirectory

setCurrentDirectory p

r <- a

setCurrentDirectory d

return r

-- | calls openTempFile but directly writes content and closes the file

writeTempFile :: String -- ^ Content

-> FilePath -- ^ Directory in which to create the file

-> String -- ^ File name template

-> IO FilePath -- ^ create file

writeTempFile str tmpDir file = do

(tmpFile, hdl) <- openTempFile tmpDir file

hPutStr hdl str

hFlush hdl

hClose hdl

return tmpFile