mongodb/Database/MongoDB/Internal/Util.hs

117 lines
4.2 KiB
Haskell
Raw Normal View History

-- | Miscellaneous general functions and Show, Eq, and Ord instances for PortID
2010-01-17 01:22:05 +00:00
{-# LANGUAGE FlexibleInstances, UndecidableInstances, StandaloneDeriving #-}
2013-01-20 22:08:20 +00:00
{-# LANGUAGE CPP #-}
2012-02-29 19:35:55 +00:00
-- PortID instances
{-# OPTIONS_GHC -fno-warn-orphans #-}
2010-01-17 01:22:05 +00:00
module Database.MongoDB.Internal.Util where
2010-01-17 01:22:05 +00:00
#if !MIN_VERSION_base(4,8,0)
2013-12-27 11:39:22 +00:00
import Control.Applicative ((<$>))
#endif
import Control.Exception (handle, throwIO, Exception)
2012-06-10 19:47:14 +00:00
import Control.Monad (liftM, liftM2)
import Data.Bits (Bits, (.|.))
2012-06-10 19:47:14 +00:00
import Data.Word (Word8)
import Network (PortID(..))
import Numeric (showHex)
import System.Random (newStdGen)
import System.Random.Shuffle (shuffle')
import qualified Data.ByteString as S
2013-12-26 15:23:02 +00:00
import Control.Monad.Error (MonadError(..), Error(..))
2012-06-10 19:47:14 +00:00
import Control.Monad.Trans (MonadIO, liftIO)
import Data.Bson
2012-05-08 15:13:25 +00:00
import Data.Text (Text)
2012-06-10 19:47:14 +00:00
2012-05-08 15:13:25 +00:00
import qualified Data.Text as T
2013-01-20 22:08:20 +00:00
#if !MIN_VERSION_network(2, 4, 1)
deriving instance Show PortID
deriving instance Eq PortID
2013-01-20 22:08:20 +00:00
#endif
deriving instance Ord PortID
-- | A monadic sort implementation derived from the non-monadic one in ghc's Prelude
mergesortM :: Monad m => (a -> a -> m Ordering) -> [a] -> m [a]
mergesortM cmp = mergesortM' cmp . map wrap
mergesortM' :: Monad m => (a -> a -> m Ordering) -> [[a]] -> m [a]
mergesortM' _ [] = return []
mergesortM' _ [xs] = return xs
mergesortM' cmp xss = mergesortM' cmp =<< (merge_pairsM cmp xss)
merge_pairsM :: Monad m => (a -> a -> m Ordering) -> [[a]] -> m [[a]]
merge_pairsM _ [] = return []
merge_pairsM _ [xs] = return [xs]
merge_pairsM cmp (xs:ys:xss) = liftM2 (:) (mergeM cmp xs ys) (merge_pairsM cmp xss)
mergeM :: Monad m => (a -> a -> m Ordering) -> [a] -> [a] -> m [a]
mergeM _ [] ys = return ys
mergeM _ xs [] = return xs
mergeM cmp (x:xs) (y:ys)
= do
c <- x `cmp` y
case c of
GT -> liftM (y:) (mergeM cmp (x:xs) ys)
_ -> liftM (x:) (mergeM cmp xs (y:ys))
wrap :: a -> [a]
wrap x = [x]
shuffle :: [a] -> IO [a]
-- ^ Randomly shuffle items in list
2012-06-10 19:47:14 +00:00
shuffle list = shuffle' list (length list) <$> newStdGen
2017-05-09 05:47:47 +00:00
loop :: Monad m => m (Maybe a) -> m [a]
-- ^ Repeatedy execute action, collecting results, until it returns Nothing
2017-05-09 05:47:47 +00:00
loop act = act >>= maybe (return []) (\a -> (a :) `liftM` loop act)
untilSuccess :: (MonadError e m, Error e) => (a -> m b) -> [a] -> m b
-- ^ Apply action to elements one at a time until one succeeds. Throw last error if all fail. Throw 'strMsg' error if list is empty.
untilSuccess = untilSuccess' (strMsg "empty untilSuccess")
untilSuccess' :: (MonadError e m) => e -> (a -> m b) -> [a] -> m b
-- ^ Apply action to elements one at a time until one succeeds. Throw last error if all fail. Throw given error if list is empty
untilSuccess' e _ [] = throwError e
untilSuccess' _ f (x : xs) = catchError (f x) (\e -> untilSuccess' e f xs)
whenJust :: (Monad m) => Maybe a -> (a -> m ()) -> m ()
whenJust mVal act = maybe (return ()) act mVal
2013-12-26 15:23:02 +00:00
liftIOE :: (MonadIO m, Exception e, Exception e') => (e -> e') -> IO a -> m a
-- ^ lift IOE monad to ErrorT monad over some MonadIO m
2013-12-26 15:23:02 +00:00
liftIOE f = liftIO . handle (throwIO . f)
updateAssocs :: (Eq k) => k -> v -> [(k, v)] -> [(k, v)]
-- ^ Change or insert value of key in association list
updateAssocs key valu assocs = case back of [] -> (key, valu) : front; _ : back' -> front ++ (key, valu) : back'
2013-12-26 14:57:33 +00:00
where (front, back) = break ((key ==) . fst) assocs
2012-09-10 17:25:45 +00:00
bitOr :: (Num a, Bits a) => [a] -> a
-- ^ bit-or all numbers together
bitOr = foldl (.|.) 0
2012-05-08 15:13:25 +00:00
(<.>) :: Text -> Text -> Text
-- ^ Concat first and second together with period in between. Eg. @\"hello\" \<.\> \"world\" = \"hello.world\"@
2012-05-08 15:13:25 +00:00
a <.> b = T.append a (T.cons '.' b)
true1 :: Label -> Document -> Bool
-- ^ Is field's value a 1 or True (MongoDB use both Int and Bools for truth values). Error if field not in document or field not a Num or Bool.
true1 k doc = case valueAt k doc of
2013-12-26 14:57:33 +00:00
Bool b -> b
Float n -> n == 1
Int32 n -> n == 1
Int64 n -> n == 1
_ -> error $ "expected " ++ show k ++ " to be Num or Bool in " ++ show doc
2012-06-10 19:47:14 +00:00
byteStringHex :: S.ByteString -> String
-- ^ Hexadecimal string representation of a byte string. Each byte yields two hexadecimal characters.
2012-06-10 19:47:14 +00:00
byteStringHex = concatMap byteHex . S.unpack
byteHex :: Word8 -> String
-- ^ Two char hexadecimal representation of byte
byteHex b = (if b < 16 then ('0' :) else id) (showHex b "")