Datasets:

blastwind

/

deprecated-github-code-haskell-function

like 0

pascal-knodel/haskell-craft

_/links/E'9'15.hs

mit

prop_FacFac2 :: Integer -> Bool prop_FacFac2 integer = fac integer == fac2 integer

prop_FacFac2 :: Integer -> Bool prop_FacFac2 integer = fac integer == fac2 integer

prop_FacFac2 integer = fac integer == fac2 integer

rkrzr/shcrabble

src/Lib.hs

bsd-3-clause

-- TODO: Placed pieces are *not* ordered - we must make sure that pp is actually the first -- character of the word! isWordFitting pf (mt, (pp:pps)) = isFirstValid && (all (isEqualOrEmpty pf mt) (init pps)) && isLastValid -- Note: If the field is empty, then all three surrounding fields must be empty -- If the field is not empty, then only the field in the same direction must be empty where isFieldValid (PlacedPiece c cs) d ds = case Map.lookup cs pf of Just (PlacedPiece c' _) -> c == c' && isNeighborEmpty cs pf d Nothing -> emptyNeighbors cs ds pf isFirstValid = case mt of Horizontal -> isFieldValid pp L [Up, Down, L] Vertical -> isFieldValid pp Down [L, R, Down] isLastValid = case mt of Horizontal -> isFieldValid (last pps) R [Up, Down, R] Vertical -> isFieldValid (last pps) Up [L, R, Up]

isWordFitting pf (mt, (pp:pps)) = isFirstValid && (all (isEqualOrEmpty pf mt) (init pps)) && isLastValid -- Note: If the field is empty, then all three surrounding fields must be empty -- If the field is not empty, then only the field in the same direction must be empty where isFieldValid (PlacedPiece c cs) d ds = case Map.lookup cs pf of Just (PlacedPiece c' _) -> c == c' && isNeighborEmpty cs pf d Nothing -> emptyNeighbors cs ds pf isFirstValid = case mt of Horizontal -> isFieldValid pp L [Up, Down, L] Vertical -> isFieldValid pp Down [L, R, Down] isLastValid = case mt of Horizontal -> isFieldValid (last pps) R [Up, Down, R] Vertical -> isFieldValid (last pps) Up [L, R, Up]

isWordFitting pf (mt, (pp:pps)) = isFirstValid && (all (isEqualOrEmpty pf mt) (init pps)) && isLastValid -- Note: If the field is empty, then all three surrounding fields must be empty -- If the field is not empty, then only the field in the same direction must be empty where isFieldValid (PlacedPiece c cs) d ds = case Map.lookup cs pf of Just (PlacedPiece c' _) -> c == c' && isNeighborEmpty cs pf d Nothing -> emptyNeighbors cs ds pf isFirstValid = case mt of Horizontal -> isFieldValid pp L [Up, Down, L] Vertical -> isFieldValid pp Down [L, R, Down] isLastValid = case mt of Horizontal -> isFieldValid (last pps) R [Up, Down, R] Vertical -> isFieldValid (last pps) Up [L, R, Up]

haskell-opengl/OpenGLRaw

src/Graphics/GL/Functions/F09.hs

bsd-3-clause

ptr_glGetBufferParameteriv :: FunPtr (GLenum -> GLenum -> Ptr GLint -> IO ()) ptr_glGetBufferParameteriv = unsafePerformIO $ getCommand "glGetBufferParameteriv"

ptr_glGetBufferParameteriv :: FunPtr (GLenum -> GLenum -> Ptr GLint -> IO ()) ptr_glGetBufferParameteriv = unsafePerformIO $ getCommand "glGetBufferParameteriv"

ptr_glGetBufferParameteriv = unsafePerformIO $ getCommand "glGetBufferParameteriv"

nevrenato/Hets_Fork

QBF/ProveDepQBF.hs

gpl-2.0

runDepQBF :: QBFProverState {- ^ logical part containing the input Sign and axioms and possibly goals that have been proved earlier as additional axioms -} -> GenericConfig ProofTree -- ^ configuration to use -> Bool -- ^ True means save QDIMACS file -> String -- ^ name of the theory in the DevGraph -> AS_Anno.Named AS.FORMULA -- ^ goal to prove -> IO (ATPRetval, GenericConfig ProofTree) -- ^ (retval, configuration with proof status and complete output) runDepQBF ps cfg saveQDIMACS thName nGoal = do let saveFile = basename thName ++ '_' : AS_Anno.senAttr nGoal ++ ".qdimacs" tl = configTimeLimit cfg prob <- showQDIMACSProblem thName ps nGoal [] when saveQDIMACS (writeFile saveFile prob) stpTmpFile <- getTempFile prob saveFile t_start <- getHetsTime (exitCode, stdoutC, stderrC) <- readProcessWithExitCode "depqbf" (show tl : extraOpts cfg ++ [stpTmpFile]) "" t_end <- getHetsTime removeFile stpTmpFile let t_u = diffHetsTime t_end t_start exitCode' = case exitCode of ExitSuccess -> 0 ExitFailure i -> i (pStat, ret) <- examineProof ps cfg stdoutC stderrC exitCode' nGoal t_u tl return (pStat, cfg { proofStatus = ret , resultOutput = lines (stdoutC ++ stderrC) , timeUsed = usedTime ret }) -- | examine Prover output

runDepQBF :: QBFProverState {- ^ logical part containing the input Sign and axioms and possibly goals that have been proved earlier as additional axioms -} -> GenericConfig ProofTree -- ^ configuration to use -> Bool -- ^ True means save QDIMACS file -> String -- ^ name of the theory in the DevGraph -> AS_Anno.Named AS.FORMULA -- ^ goal to prove -> IO (ATPRetval, GenericConfig ProofTree) runDepQBF ps cfg saveQDIMACS thName nGoal = do let saveFile = basename thName ++ '_' : AS_Anno.senAttr nGoal ++ ".qdimacs" tl = configTimeLimit cfg prob <- showQDIMACSProblem thName ps nGoal [] when saveQDIMACS (writeFile saveFile prob) stpTmpFile <- getTempFile prob saveFile t_start <- getHetsTime (exitCode, stdoutC, stderrC) <- readProcessWithExitCode "depqbf" (show tl : extraOpts cfg ++ [stpTmpFile]) "" t_end <- getHetsTime removeFile stpTmpFile let t_u = diffHetsTime t_end t_start exitCode' = case exitCode of ExitSuccess -> 0 ExitFailure i -> i (pStat, ret) <- examineProof ps cfg stdoutC stderrC exitCode' nGoal t_u tl return (pStat, cfg { proofStatus = ret , resultOutput = lines (stdoutC ++ stderrC) , timeUsed = usedTime ret }) -- | examine Prover output

runDepQBF ps cfg saveQDIMACS thName nGoal = do let saveFile = basename thName ++ '_' : AS_Anno.senAttr nGoal ++ ".qdimacs" tl = configTimeLimit cfg prob <- showQDIMACSProblem thName ps nGoal [] when saveQDIMACS (writeFile saveFile prob) stpTmpFile <- getTempFile prob saveFile t_start <- getHetsTime (exitCode, stdoutC, stderrC) <- readProcessWithExitCode "depqbf" (show tl : extraOpts cfg ++ [stpTmpFile]) "" t_end <- getHetsTime removeFile stpTmpFile let t_u = diffHetsTime t_end t_start exitCode' = case exitCode of ExitSuccess -> 0 ExitFailure i -> i (pStat, ret) <- examineProof ps cfg stdoutC stderrC exitCode' nGoal t_u tl return (pStat, cfg { proofStatus = ret , resultOutput = lines (stdoutC ++ stderrC) , timeUsed = usedTime ret }) -- | examine Prover output

roberth/uu-helium

src/Helium/Parser/Lexer.hs

gpl-3.0

isName :: String -> Bool isName [] = False

isName :: String -> Bool isName [] = False

isName [] = False

junjihashimoto/persistent

persistent/Database/Persist/Sql/Orphan/PersistQuery.hs

mit

decorateSQLWithLimitOffset::Text -> (Int,Int) -> Bool -> Text -> Text decorateSQLWithLimitOffset nolimit (limit,offset) _ sql = let lim = case (limit, offset) of (0, 0) -> "" (0, _) -> T.cons ' ' nolimit (_, _) -> " LIMIT " <> T.pack (show limit) off = if offset == 0 then "" else " OFFSET " <> T.pack (show offset) in mconcat [ sql , lim , off ]

decorateSQLWithLimitOffset::Text -> (Int,Int) -> Bool -> Text -> Text decorateSQLWithLimitOffset nolimit (limit,offset) _ sql = let lim = case (limit, offset) of (0, 0) -> "" (0, _) -> T.cons ' ' nolimit (_, _) -> " LIMIT " <> T.pack (show limit) off = if offset == 0 then "" else " OFFSET " <> T.pack (show offset) in mconcat [ sql , lim , off ]

decorateSQLWithLimitOffset nolimit (limit,offset) _ sql = let lim = case (limit, offset) of (0, 0) -> "" (0, _) -> T.cons ' ' nolimit (_, _) -> " LIMIT " <> T.pack (show limit) off = if offset == 0 then "" else " OFFSET " <> T.pack (show offset) in mconcat [ sql , lim , off ]

Pieterjaninfo/PP

FP/block1s1.hs

unlicense

allEqual (x:y:xs) | x == y = allEqual (y:xs) | otherwise = False

allEqual (x:y:xs) | x == y = allEqual (y:xs) | otherwise = False

allEqual (x:y:xs) | x == y = allEqual (y:xs) | otherwise = False

yliu120/K3

src/Language/K3/Codegen/CPP/Representation.hs

apache-2.0

binaryParens _ _ = parens

binaryParens _ _ = parens

binaryParens _ _ = parens

ricardopenyamari/ir2haskell

clir-parser-haskell-master/lib/sexp-grammar/examples/Lang.hs

gpl-2.0

gatherFreeVars :: Expr -> M.Map Ident Int gatherFreeVars e = runReader (cata alg e) S.empty where alg :: ExprF (FreeVarsM (M.Map Ident Int)) -> FreeVarsM (M.Map Ident Int) alg (Let n e r) = do e' <- e r' <- local (S.insert n) r return $ e' <> r' alg (Var n) = do bound <- asks (S.member n) return $ if bound then M.empty else M.singleton n 1 alg other = foldl (M.unionWith (+)) M.empty <$> sequence other

gatherFreeVars :: Expr -> M.Map Ident Int gatherFreeVars e = runReader (cata alg e) S.empty where alg :: ExprF (FreeVarsM (M.Map Ident Int)) -> FreeVarsM (M.Map Ident Int) alg (Let n e r) = do e' <- e r' <- local (S.insert n) r return $ e' <> r' alg (Var n) = do bound <- asks (S.member n) return $ if bound then M.empty else M.singleton n 1 alg other = foldl (M.unionWith (+)) M.empty <$> sequence other

gatherFreeVars e = runReader (cata alg e) S.empty where alg :: ExprF (FreeVarsM (M.Map Ident Int)) -> FreeVarsM (M.Map Ident Int) alg (Let n e r) = do e' <- e r' <- local (S.insert n) r return $ e' <> r' alg (Var n) = do bound <- asks (S.member n) return $ if bound then M.empty else M.singleton n 1 alg other = foldl (M.unionWith (+)) M.empty <$> sequence other

lunaris/hindent

src/HIndent/Styles/Gibiansky.hs

bsd-3-clause

collectTypes ty = [ty]

collectTypes ty = [ty]

collectTypes ty = [ty]

8c6794b6/tokyodystopia-haskell

Database/TokyoDystopia/JDB.hs

bsd-3-clause

setcache :: JDB -> Int64 -> Int -> IO Bool setcache db icsiz lcnum = FJ.c_setcache (unJDB db) icsiz (fromIntegral lcnum)

setcache :: JDB -> Int64 -> Int -> IO Bool setcache db icsiz lcnum = FJ.c_setcache (unJDB db) icsiz (fromIntegral lcnum)

setcache db icsiz lcnum = FJ.c_setcache (unJDB db) icsiz (fromIntegral lcnum)

ashnikel/haskellbook

ch11/ch11.14_ex.hs

mit

-- 4 ^ 4 = 256 -- 4 prodTBool :: (Bool, Bool, Bool) prodTBool = undefined

prodTBool :: (Bool, Bool, Bool) prodTBool = undefined

prodTBool = undefined

MaxGabriel/yesod

yesod-form/Yesod/Form/Bootstrap3.hs

mit

toOffset (ColXs columns) = "col-xs-offset-" ++ show columns

toOffset (ColXs columns) = "col-xs-offset-" ++ show columns

toOffset (ColXs columns) = "col-xs-offset-" ++ show columns

glguy/config-schema

src/Config/Schema/Docs.hs

isc

disjunction False xs = hsep (intersperse "or" xs)

disjunction False xs = hsep (intersperse "or" xs)

disjunction False xs = hsep (intersperse "or" xs)

iand675/digital-ocean

src/DigitalOcean.hs

mit

creds :: DigitalOcean Credentials creds = DigitalOcean ask

creds :: DigitalOcean Credentials creds = DigitalOcean ask

creds = DigitalOcean ask

ekmett/ghc

compiler/nativeGen/X86/Instr.hs

bsd-3-clause

shortcutStatics :: (BlockId -> Maybe JumpDest) -> (Alignment, CmmStatics) -> (Alignment, CmmStatics) shortcutStatics fn (align, Statics lbl statics) = (align, Statics lbl $ map (shortcutStatic fn) statics)

shortcutStatics :: (BlockId -> Maybe JumpDest) -> (Alignment, CmmStatics) -> (Alignment, CmmStatics) shortcutStatics fn (align, Statics lbl statics) = (align, Statics lbl $ map (shortcutStatic fn) statics)

shortcutStatics fn (align, Statics lbl statics) = (align, Statics lbl $ map (shortcutStatic fn) statics)

snoyberg/ghc

libraries/base/GHC/List.hs

bsd-3-clause

product = foldl (*) 1

product = foldl (*) 1

product = foldl (*) 1

pauloborba/plc

src/Prova2016.hs

cc0-1.0

discard 1 (x:xs) = xs

discard 1 (x:xs) = xs

discard 1 (x:xs) = xs

neongreen/megaparsec

Text/Megaparsec/Char.hs

bsd-2-clause

-- | @charCategory cat@ Parses character in Unicode General Category @cat@, -- see 'Data.Char.GeneralCategory'. charCategory :: MonadParsec s m Char => GeneralCategory -> m Char charCategory cat = satisfy ((== cat) . generalCategory) <?> categoryName cat

charCategory :: MonadParsec s m Char => GeneralCategory -> m Char charCategory cat = satisfy ((== cat) . generalCategory) <?> categoryName cat

charCategory cat = satisfy ((== cat) . generalCategory) <?> categoryName cat

phaazon/OpenGLRaw

src/Graphics/Rendering/OpenGL/Raw/Tokens.hs

bsd-3-clause

gl_INTERLACE_SGIX :: GLenum gl_INTERLACE_SGIX = 0x8094

gl_INTERLACE_SGIX :: GLenum gl_INTERLACE_SGIX = 0x8094

gl_INTERLACE_SGIX = 0x8094

gnn/Hets

OWL2/XMLKeywords.hs

gpl-2.0

objectPropertyAssertionK :: String objectPropertyAssertionK = "ObjectPropertyAssertion"

objectPropertyAssertionK :: String objectPropertyAssertionK = "ObjectPropertyAssertion"

objectPropertyAssertionK = "ObjectPropertyAssertion"

josefs/autosar

oldARSim/NewABS.hs

bsd-3-clause

newtest = do (velos_in, accels_r_in, accels_p_in, valves_r_out, valves_p_out) <- abs_system env <- environment connectAll (repeat env) velos_in connectAll (repeat env) accels_r_in connectAll (repeat env) accels_p_in connectAll valves_r_out (repeat env) connectAll valves_p_out (repeat env) where a0 = [(1,-5)] v0 = (0,18) : minim 0 (integrate 0.01 a0)

newtest = do (velos_in, accels_r_in, accels_p_in, valves_r_out, valves_p_out) <- abs_system env <- environment connectAll (repeat env) velos_in connectAll (repeat env) accels_r_in connectAll (repeat env) accels_p_in connectAll valves_r_out (repeat env) connectAll valves_p_out (repeat env) where a0 = [(1,-5)] v0 = (0,18) : minim 0 (integrate 0.01 a0)

newtest = do (velos_in, accels_r_in, accels_p_in, valves_r_out, valves_p_out) <- abs_system env <- environment connectAll (repeat env) velos_in connectAll (repeat env) accels_r_in connectAll (repeat env) accels_p_in connectAll valves_r_out (repeat env) connectAll valves_p_out (repeat env) where a0 = [(1,-5)] v0 = (0,18) : minim 0 (integrate 0.01 a0)

brendanhay/gogol

gogol-games/gen/Network/Google/Games/Types/Product.hs

mpl-2.0

-- | Uniquely identifies the type of this resource. Value is always the fixed -- string \`games#instance\`. iKind :: Lens' Instance (Maybe Text) iKind = lens _iKind (\ s a -> s{_iKind = a})

iKind :: Lens' Instance (Maybe Text) iKind = lens _iKind (\ s a -> s{_iKind = a})

iKind = lens _iKind (\ s a -> s{_iKind = a})

keithodulaigh/Hets

GMP/Proof.hs

gpl-2.0

negI :: Sequent -> [[Sequent]] negI xs = [ [p : delete f xs] | f@(Not (Not p)) <- xs]

negI :: Sequent -> [[Sequent]] negI xs = [ [p : delete f xs] | f@(Not (Not p)) <- xs]

negI xs = [ [p : delete f xs] | f@(Not (Not p)) <- xs]

rueshyna/gogol

gogol-maps-engine/gen/Network/Google/Resource/MapsEngine/Maps/Publish.hs

mpl-2.0

-- | Creates a value of 'MapsPublish' with the minimum fields required to make a request. -- -- Use one of the following lenses to modify other fields as desired: -- -- * 'mapForce' -- -- * 'mapId' mapsPublish :: Text -- ^ 'mapId' -> MapsPublish mapsPublish pMapId_ = MapsPublish' { _mapForce = Nothing , _mapId = pMapId_ }

mapsPublish :: Text -- ^ 'mapId' -> MapsPublish mapsPublish pMapId_ = MapsPublish' { _mapForce = Nothing , _mapId = pMapId_ }

mapsPublish pMapId_ = MapsPublish' { _mapForce = Nothing , _mapId = pMapId_ }

keera-studios/hsQt

Qtc/ClassTypes/Core.hs

bsd-2-clause

qFileFromPtr :: Ptr (TQFile a) -> IO (QFile a) qFileFromPtr p = objectFromPtr qtc_QFile_getFinalizer p

qFileFromPtr :: Ptr (TQFile a) -> IO (QFile a) qFileFromPtr p = objectFromPtr qtc_QFile_getFinalizer p

qFileFromPtr p = objectFromPtr qtc_QFile_getFinalizer p

alexisVallet/hnn

src/HNN/Data.hs

bsd-3-clause

randomize :: (MonadIO m, MonadRandom m) => [a] -> (a -> m b) -> Producer b m () randomize xs f = do sxs <- lift $ shuffle xs forM_ sxs $ \x -> do fx <- lift $ f x yield fx -- converts an image to a (nb_channels, height, width) shaped row-major -- vector. -- img_to_chw :: (Storable a, Image i, Pixel (ImagePixel i)) -- => (PixelChannel (ImagePixel i) -> a) -> i -> V.Vector a -- img_to_chw conv img = V.fromList [conv $ pixIndex (index img (ix2 i j)) k -- | k <- [0..c-1], -- i <- [0..h-1], -- j <- [0..w-1]] -- where Z :. h :. w = Friday.shape img -- c = nChannels img -- img_to_chw :: (Storable a, Image i, Pixel (ImagePixel i)) -- => (PixelChannel (ImagePixel i) -> a) -> i -> V.Vector a -- img_to_chw conv img = runST $ do -- let Z :. h :. w = Friday.shape img -- c = nChannels img -- imgVector = vector img -- out <- MV.new $ c * h * w -- forM_ [0..h-1] $ \i -> do -- forM_ [0..w-1] $ \j -> do -- forM_ [0..c-1] $ \k -> do -- MV.unsafeWrite out (j + w * (i + h * k)) $ conv $ pixIndex (V.unsafeIndex imgVector (j + w * i)) k -- V.unsafeFreeze out -- Converts an image to a storable-based vector by casting and sharing the inner -- data foreign pointer.

randomize :: (MonadIO m, MonadRandom m) => [a] -> (a -> m b) -> Producer b m () randomize xs f = do sxs <- lift $ shuffle xs forM_ sxs $ \x -> do fx <- lift $ f x yield fx -- converts an image to a (nb_channels, height, width) shaped row-major -- vector. -- img_to_chw :: (Storable a, Image i, Pixel (ImagePixel i)) -- => (PixelChannel (ImagePixel i) -> a) -> i -> V.Vector a -- img_to_chw conv img = V.fromList [conv $ pixIndex (index img (ix2 i j)) k -- | k <- [0..c-1], -- i <- [0..h-1], -- j <- [0..w-1]] -- where Z :. h :. w = Friday.shape img -- c = nChannels img -- img_to_chw :: (Storable a, Image i, Pixel (ImagePixel i)) -- => (PixelChannel (ImagePixel i) -> a) -> i -> V.Vector a -- img_to_chw conv img = runST $ do -- let Z :. h :. w = Friday.shape img -- c = nChannels img -- imgVector = vector img -- out <- MV.new $ c * h * w -- forM_ [0..h-1] $ \i -> do -- forM_ [0..w-1] $ \j -> do -- forM_ [0..c-1] $ \k -> do -- MV.unsafeWrite out (j + w * (i + h * k)) $ conv $ pixIndex (V.unsafeIndex imgVector (j + w * i)) k -- V.unsafeFreeze out -- Converts an image to a storable-based vector by casting and sharing the inner -- data foreign pointer.

randomize xs f = do sxs <- lift $ shuffle xs forM_ sxs $ \x -> do fx <- lift $ f x yield fx -- converts an image to a (nb_channels, height, width) shaped row-major -- vector. -- img_to_chw :: (Storable a, Image i, Pixel (ImagePixel i)) -- => (PixelChannel (ImagePixel i) -> a) -> i -> V.Vector a -- img_to_chw conv img = V.fromList [conv $ pixIndex (index img (ix2 i j)) k -- | k <- [0..c-1], -- i <- [0..h-1], -- j <- [0..w-1]] -- where Z :. h :. w = Friday.shape img -- c = nChannels img -- img_to_chw :: (Storable a, Image i, Pixel (ImagePixel i)) -- => (PixelChannel (ImagePixel i) -> a) -> i -> V.Vector a -- img_to_chw conv img = runST $ do -- let Z :. h :. w = Friday.shape img -- c = nChannels img -- imgVector = vector img -- out <- MV.new $ c * h * w -- forM_ [0..h-1] $ \i -> do -- forM_ [0..w-1] $ \j -> do -- forM_ [0..c-1] $ \k -> do -- MV.unsafeWrite out (j + w * (i + h * k)) $ conv $ pixIndex (V.unsafeIndex imgVector (j + w * i)) k -- V.unsafeFreeze out -- Converts an image to a storable-based vector by casting and sharing the inner -- data foreign pointer.

phaazon/OpenGLRaw

src/Graphics/Rendering/OpenGL/Raw/Tokens.hs

bsd-3-clause

gl_FRAMEBUFFER_BARRIER_BIT :: GLbitfield gl_FRAMEBUFFER_BARRIER_BIT = 0x00000400

gl_FRAMEBUFFER_BARRIER_BIT :: GLbitfield gl_FRAMEBUFFER_BARRIER_BIT = 0x00000400

gl_FRAMEBUFFER_BARRIER_BIT = 0x00000400

NCrashed/servant-auth-token

src/Servant/Server/Auth/Token/Common.hs

bsd-3-clause

-- | Helper to print a value to lazy bytestring showb :: Show a => a -> BSL.ByteString showb = BSL.pack . show

showb :: Show a => a -> BSL.ByteString showb = BSL.pack . show

showb = BSL.pack . show

kmate/zeldspar

src/Ziria.hs

bsd-3-clause

fuse p (Return y) k1 k2 = k2 p y

fuse p (Return y) k1 k2 = k2 p y

fuse p (Return y) k1 k2 = k2 p y

petester42/haskell-hockey

src/Hockey/Playoffs.hs

mit

groupWinningSeeds :: [(String, PlayoffSeed)] -> Int -> String -> Int -> [Int] -> [PlayoffSeed] groupWinningSeeds winningSeeds year conference round series | round == 1 && series == [1,2] = winningTeamsToPlayoffSeed teams year conference 2 1 | round == 1 && series == [3,4] = winningTeamsToPlayoffSeed teams year conference 2 2 | round == 2 = winningTeamsToPlayoffSeed teams year conference 3 1 | round == 3 = winningTeamsToPlayoffSeed teams year "f" 4 1 | otherwise = [] where teams = groupWinningTeams round $ (List.filter (\x -> filterWinningSeed x conference round series) winningSeeds)

groupWinningSeeds :: [(String, PlayoffSeed)] -> Int -> String -> Int -> [Int] -> [PlayoffSeed] groupWinningSeeds winningSeeds year conference round series | round == 1 && series == [1,2] = winningTeamsToPlayoffSeed teams year conference 2 1 | round == 1 && series == [3,4] = winningTeamsToPlayoffSeed teams year conference 2 2 | round == 2 = winningTeamsToPlayoffSeed teams year conference 3 1 | round == 3 = winningTeamsToPlayoffSeed teams year "f" 4 1 | otherwise = [] where teams = groupWinningTeams round $ (List.filter (\x -> filterWinningSeed x conference round series) winningSeeds)

groupWinningSeeds winningSeeds year conference round series | round == 1 && series == [1,2] = winningTeamsToPlayoffSeed teams year conference 2 1 | round == 1 && series == [3,4] = winningTeamsToPlayoffSeed teams year conference 2 2 | round == 2 = winningTeamsToPlayoffSeed teams year conference 3 1 | round == 3 = winningTeamsToPlayoffSeed teams year "f" 4 1 | otherwise = [] where teams = groupWinningTeams round $ (List.filter (\x -> filterWinningSeed x conference round series) winningSeeds)

pgavin/tfp

Test.hs

bsd-3-clause

testAdd2 :: DN1 :+: D1 -> D0 testAdd2 = Prelude.id

testAdd2 :: DN1 :+: D1 -> D0 testAdd2 = Prelude.id

testAdd2 = Prelude.id

jstolarek/haddock

haddock-api/src/Haddock.hs

bsd-2-clause

renderStep :: DynFlags -> [Flag] -> QualOption -> [(DocPaths, InterfaceFile)] -> [Interface] -> IO () renderStep dflags flags qual pkgs interfaces = do updateHTMLXRefs pkgs let ifaceFiles = map snd pkgs installedIfaces = concatMap ifInstalledIfaces ifaceFiles srcMap = Map.fromList [ (ifPackageKey if_, x) | ((_, Just x), if_) <- pkgs ] render dflags flags qual interfaces installedIfaces srcMap -- | Render the interfaces with whatever backend is specified in the flags.

renderStep :: DynFlags -> [Flag] -> QualOption -> [(DocPaths, InterfaceFile)] -> [Interface] -> IO () renderStep dflags flags qual pkgs interfaces = do updateHTMLXRefs pkgs let ifaceFiles = map snd pkgs installedIfaces = concatMap ifInstalledIfaces ifaceFiles srcMap = Map.fromList [ (ifPackageKey if_, x) | ((_, Just x), if_) <- pkgs ] render dflags flags qual interfaces installedIfaces srcMap -- | Render the interfaces with whatever backend is specified in the flags.

renderStep dflags flags qual pkgs interfaces = do updateHTMLXRefs pkgs let ifaceFiles = map snd pkgs installedIfaces = concatMap ifInstalledIfaces ifaceFiles srcMap = Map.fromList [ (ifPackageKey if_, x) | ((_, Just x), if_) <- pkgs ] render dflags flags qual interfaces installedIfaces srcMap -- | Render the interfaces with whatever backend is specified in the flags.

grtlr/wyas

src/Wyas/Evaluator.hs

bsd-3-clause

symbol2string _ = String ""

symbol2string _ = String ""

symbol2string _ = String ""

NatureShade/SymbolicHaskell

src/Math/Symbolic/Simplify.hs

mit

mathCompare Sym{} _ = LT

mathCompare Sym{} _ = LT

mathCompare Sym{} _ = LT

jdavidberger/project-euler

prob124.hs

lgpl-3.0

main = putStrLn $ show $ snd $ (!! (want-1)) $ prob124 limit

main = putStrLn $ show $ snd $ (!! (want-1)) $ prob124 limit

main = putStrLn $ show $ snd $ (!! (want-1)) $ prob124 limit

m4lvin/robbed

src/Data/ROBDD.hs

bsd-3-clause

-- Note: the reverse node maps of each input BDD are ignored because -- we need to build a new one on the fly for the result BDD. -- This is the main implementation of apply, but also re-used for the -- combined apply/quantify operations. applyInner :: BinBoolFunc -> EvaluationContext -> BDD -> BDD -> BDDContext (Int, NodeId, NodeId) BDD BDD applyInner op ctxt bdd1 bdd2 = appBase bdd1 bdd2 where appBase :: BDD -> BDD -> BDDContext (EvaluationContext, NodeId, NodeId) BDD BDD appBase lhs rhs = memoize (ctxt, nodeUID lhs, nodeUID rhs) $ case maybeApply op lhs rhs of Just True -> return One Just False -> return Zero Nothing -> appRec lhs rhs appRec :: BDD -> BDD -> BDDContext (EvaluationContext, NodeId, NodeId) BDD BDD appRec lhs rhs = do (v, l', h') <- genApplySubproblems appBase lhs rhs mk v l' h'

applyInner :: BinBoolFunc -> EvaluationContext -> BDD -> BDD -> BDDContext (Int, NodeId, NodeId) BDD BDD applyInner op ctxt bdd1 bdd2 = appBase bdd1 bdd2 where appBase :: BDD -> BDD -> BDDContext (EvaluationContext, NodeId, NodeId) BDD BDD appBase lhs rhs = memoize (ctxt, nodeUID lhs, nodeUID rhs) $ case maybeApply op lhs rhs of Just True -> return One Just False -> return Zero Nothing -> appRec lhs rhs appRec :: BDD -> BDD -> BDDContext (EvaluationContext, NodeId, NodeId) BDD BDD appRec lhs rhs = do (v, l', h') <- genApplySubproblems appBase lhs rhs mk v l' h'

applyInner op ctxt bdd1 bdd2 = appBase bdd1 bdd2 where appBase :: BDD -> BDD -> BDDContext (EvaluationContext, NodeId, NodeId) BDD BDD appBase lhs rhs = memoize (ctxt, nodeUID lhs, nodeUID rhs) $ case maybeApply op lhs rhs of Just True -> return One Just False -> return Zero Nothing -> appRec lhs rhs appRec :: BDD -> BDD -> BDDContext (EvaluationContext, NodeId, NodeId) BDD BDD appRec lhs rhs = do (v, l', h') <- genApplySubproblems appBase lhs rhs mk v l' h'

cullina/Extractor

src/GraphAlgorithms.hs

bsd-3-clause

keepNeighbors (v:vs) ((x,ys):es) = case compare v x of LT -> keepNeighbors vs ((x,ys):es) EQ -> (x,ys) : keepNeighbors vs es GT -> keepNeighbors (v:vs) es

keepNeighbors (v:vs) ((x,ys):es) = case compare v x of LT -> keepNeighbors vs ((x,ys):es) EQ -> (x,ys) : keepNeighbors vs es GT -> keepNeighbors (v:vs) es

keepNeighbors (v:vs) ((x,ys):es) = case compare v x of LT -> keepNeighbors vs ((x,ys):es) EQ -> (x,ys) : keepNeighbors vs es GT -> keepNeighbors (v:vs) es

thielema/wxhaskell

wxcore/src/haskell/Graphics/UI/WXCore/WxcTypes.hs

lgpl-2.1

-- marshalling 1 -- | Returns a red color component colorRed :: (Num a) => Color -> a colorRed (Color rgba) = fromIntegral ((shiftR rgba 24) .&. 0xFF)

colorRed :: (Num a) => Color -> a colorRed (Color rgba) = fromIntegral ((shiftR rgba 24) .&. 0xFF)

colorRed (Color rgba) = fromIntegral ((shiftR rgba 24) .&. 0xFF)

gnn/Hets

CSL/Parse_Test.hs

gpl-2.0

-- | In addition to scanFloat, also '1.', '.1' and '2.e-13' are recognized scanMyFloat :: CharParser st String scanMyFloat = let -- the 'E' component compE = oneOf "eE" <:> getSNumber -- the '.' component compD n = char '.' <:> n -- an optional number getNumber' = option "0" getNumber checkSign' '+' = [] checkSign' _ = "-" checkSp "-." = "-0." checkSp _ = "0." getSNumber = withS getNumber withS p = optionL (oneOf "+-" >-> checkSign') <++> p in -- '1.' or '2.e-13' or '1.213' try (getSNumber <++> (optionL (try $ compD getNumber') <++> optionL compE)) -- everything starting with a dot <|> (choice (map string ["+.", "-.", "."]) >-> checkSp) <++> getNumber <++> optionL compE

scanMyFloat :: CharParser st String scanMyFloat = let -- the 'E' component compE = oneOf "eE" <:> getSNumber -- the '.' component compD n = char '.' <:> n -- an optional number getNumber' = option "0" getNumber checkSign' '+' = [] checkSign' _ = "-" checkSp "-." = "-0." checkSp _ = "0." getSNumber = withS getNumber withS p = optionL (oneOf "+-" >-> checkSign') <++> p in -- '1.' or '2.e-13' or '1.213' try (getSNumber <++> (optionL (try $ compD getNumber') <++> optionL compE)) -- everything starting with a dot <|> (choice (map string ["+.", "-.", "."]) >-> checkSp) <++> getNumber <++> optionL compE

scanMyFloat = let -- the 'E' component compE = oneOf "eE" <:> getSNumber -- the '.' component compD n = char '.' <:> n -- an optional number getNumber' = option "0" getNumber checkSign' '+' = [] checkSign' _ = "-" checkSp "-." = "-0." checkSp _ = "0." getSNumber = withS getNumber withS p = optionL (oneOf "+-" >-> checkSign') <++> p in -- '1.' or '2.e-13' or '1.213' try (getSNumber <++> (optionL (try $ compD getNumber') <++> optionL compE)) -- everything starting with a dot <|> (choice (map string ["+.", "-.", "."]) >-> checkSp) <++> getNumber <++> optionL compE

loskutov/logic-hw

Lambdas.hs

mit

freeVars :: Lambda → Set String freeVars (Var s) = singleton s

freeVars :: Lambda → Set String freeVars (Var s) = singleton s

freeVars (Var s) = singleton s

feliposz/learning-stuff

haskell/c9lectures-ch5.hs

mit

fszip [] _ = []

fszip [] _ = []

fszip [] _ = []

dsorokin/aivika-lattice

Simulation/Aivika/Lattice/Internal/Event.hs

bsd-3-clause

-- | Process the events. processEvents :: EventProcessing -> Dynamics LIO () processEvents CurrentEvents = processEventsIncludingCurrent

processEvents :: EventProcessing -> Dynamics LIO () processEvents CurrentEvents = processEventsIncludingCurrent

processEvents CurrentEvents = processEventsIncludingCurrent

PhDP/Sphinx-AI

Faun/Parser/FOL.hs

mit

parseNot :: Parser (FOL -> FOL) parseNot = reservedOps ["Not", "NOT", "not", "~", "!", "¬"] >> return Not

parseNot :: Parser (FOL -> FOL) parseNot = reservedOps ["Not", "NOT", "not", "~", "!", "¬"] >> return Not

parseNot = reservedOps ["Not", "NOT", "not", "~", "!", "¬"] >> return Not

tomleb/portfolio

src/Web/Views/Nav.hs

mit

navBase :: _ -> H.Html navBase mLink = H.body ! A.class_ "full f f-col f-sb fi-stretch white black-text" $ do case mLink of Just l -> H.header ! A.class_ "right" $ H.a ! A.class_ "close right m4" ! A.href (toHref l) $ do H.span mempty H.span mempty Nothing -> mempty H.main ! A.class_ "f-g5 f f-row f-center fi-stretch" $ H.ul ! A.class_ "f f-col f-center" $ forM_ (map navLi links) id

navBase :: _ -> H.Html navBase mLink = H.body ! A.class_ "full f f-col f-sb fi-stretch white black-text" $ do case mLink of Just l -> H.header ! A.class_ "right" $ H.a ! A.class_ "close right m4" ! A.href (toHref l) $ do H.span mempty H.span mempty Nothing -> mempty H.main ! A.class_ "f-g5 f f-row f-center fi-stretch" $ H.ul ! A.class_ "f f-col f-center" $ forM_ (map navLi links) id

navBase mLink = H.body ! A.class_ "full f f-col f-sb fi-stretch white black-text" $ do case mLink of Just l -> H.header ! A.class_ "right" $ H.a ! A.class_ "close right m4" ! A.href (toHref l) $ do H.span mempty H.span mempty Nothing -> mempty H.main ! A.class_ "f-g5 f f-row f-center fi-stretch" $ H.ul ! A.class_ "f f-col f-center" $ forM_ (map navLi links) id

kindl/Hypatia

src/Parser.hs

mit

alts = curlyBraces (sepBy' alt (token ";"))

alts = curlyBraces (sepBy' alt (token ";"))

alts = curlyBraces (sepBy' alt (token ";"))

biegunka/biegunka

src/Control/Biegunka/Patience.hs

mit

extract :: Piles t -> [(Int, t)] extract = maybe [] (walk . NonEmpty.head . fst) . IntMap.maxView where walk (Card x a c) = (x, a) : maybe [] walk c

extract :: Piles t -> [(Int, t)] extract = maybe [] (walk . NonEmpty.head . fst) . IntMap.maxView where walk (Card x a c) = (x, a) : maybe [] walk c

extract = maybe [] (walk . NonEmpty.head . fst) . IntMap.maxView where walk (Card x a c) = (x, a) : maybe [] walk c

csrhodes/pandoc

src/Text/Pandoc/Writers/Docx.hs

gpl-2.0

popParaProp :: WS () popParaProp = modify $ \s -> s{ stParaProperties = drop 1 $ stParaProperties s }

popParaProp :: WS () popParaProp = modify $ \s -> s{ stParaProperties = drop 1 $ stParaProperties s }

popParaProp = modify $ \s -> s{ stParaProperties = drop 1 $ stParaProperties s }

ambiata/highlighting-kate

Text/Highlighting/Kate/Syntax/Prolog.hs

gpl-2.0

parseRules ("Prolog","list_functor") = (((pDetectChar False '.' >>= withAttribute FunctionTok) >>~ (popContext)) <|> (currentContext >>= \x -> guard (x == ("Prolog","list_functor")) >> pDefault >>= withAttribute ErrorTok))

parseRules ("Prolog","list_functor") = (((pDetectChar False '.' >>= withAttribute FunctionTok) >>~ (popContext)) <|> (currentContext >>= \x -> guard (x == ("Prolog","list_functor")) >> pDefault >>= withAttribute ErrorTok))

parseRules ("Prolog","list_functor") = (((pDetectChar False '.' >>= withAttribute FunctionTok) >>~ (popContext)) <|> (currentContext >>= \x -> guard (x == ("Prolog","list_functor")) >> pDefault >>= withAttribute ErrorTok))

Daniel-Diaz/processing

examples/pacman.hs

bsd-3-clause

when :: Proc_Bool -> EventM c () -> EventM c () when b x = ifM b x $ return ()

when :: Proc_Bool -> EventM c () -> EventM c () when b x = ifM b x $ return ()

when b x = ifM b x $ return ()

mightymoose/liquidhaskell

docs/blog/todo/index-dependent-maps.hs

bsd-3-clause

-- The signature for `empty` states that its domain is empty (ie is the set of indices satisfying the predicate `False`), and that the range satisfies _any_ invariant. The signature for `create`, instead, defines a _constant_ vector that maps every index to the constant `x`. -- Accessing Vectors -- ----------------- -- We can write the following `get` function for reading the contents of a vector at a given index: {-@ get :: forall a <d :: x0:Int -> Prop, r :: x0: Int -> x1:a -> Prop>. i: Int<d> -> a: (j: Int<d> -> a<r j>) -> a<r i> @-} get :: Int -> Vec a -> a get i a = a i

get :: Int -> Vec a -> a get i a = a i

get i a = a i

RefactoringTools/HaRe

test/testdata/NoMod.hs

bsd-3-clause

foo' x = case (odd x) of True -> "Odd" False -> "Even"

foo' x = case (odd x) of True -> "Odd" False -> "Even"

foo' x = case (odd x) of True -> "Odd" False -> "Even"

koba-e964/tigress

src/TigressEval.hs

bsd-3-clause

readVar :: (PrimMonad m, Monad m) => VarRef m a -> TigressT r m a readVar var = lift $ readMutVar var

readVar :: (PrimMonad m, Monad m) => VarRef m a -> TigressT r m a readVar var = lift $ readMutVar var

readVar var = lift $ readMutVar var

forked-upstream-packages-for-ghcjs/ghc

compiler/codeGen/StgCmmPrim.hs

bsd-3-clause

emitPrimOp _ res IndexByteArrayOp_Int64 args = doIndexByteArrayOp Nothing b64 res args

emitPrimOp _ res IndexByteArrayOp_Int64 args = doIndexByteArrayOp Nothing b64 res args

emitPrimOp _ res IndexByteArrayOp_Int64 args = doIndexByteArrayOp Nothing b64 res args

TransformingMusicology/adb-test-framework

src/AudioDB/Test.hs

gpl-3.0

runTest :: Bool -> Test -> IO TestRun runTest withEval test = do log' $ "Starting test: " `T.append` (T.pack $ t_identifier test) libaudioDB <- audiodb_lib_build_id >>= peekCString os <- return Sys.os arch <- return Sys.arch method <- return Serial startTime <- getCurrentTime results <- mapM (runQuery withEval) (t_queries test) endTime <- getCurrentTime return TestRun { tr_test = test , tr_results = results , tr_startTime = startTime , tr_endTime = endTime , tr_libaudioDBv = libaudioDB , tr_systemName = os , tr_systemArch = arch , tr_execMethod = method }

runTest :: Bool -> Test -> IO TestRun runTest withEval test = do log' $ "Starting test: " `T.append` (T.pack $ t_identifier test) libaudioDB <- audiodb_lib_build_id >>= peekCString os <- return Sys.os arch <- return Sys.arch method <- return Serial startTime <- getCurrentTime results <- mapM (runQuery withEval) (t_queries test) endTime <- getCurrentTime return TestRun { tr_test = test , tr_results = results , tr_startTime = startTime , tr_endTime = endTime , tr_libaudioDBv = libaudioDB , tr_systemName = os , tr_systemArch = arch , tr_execMethod = method }

runTest withEval test = do log' $ "Starting test: " `T.append` (T.pack $ t_identifier test) libaudioDB <- audiodb_lib_build_id >>= peekCString os <- return Sys.os arch <- return Sys.arch method <- return Serial startTime <- getCurrentTime results <- mapM (runQuery withEval) (t_queries test) endTime <- getCurrentTime return TestRun { tr_test = test , tr_results = results , tr_startTime = startTime , tr_endTime = endTime , tr_libaudioDBv = libaudioDB , tr_systemName = os , tr_systemArch = arch , tr_execMethod = method }

Gurrt/software-testing

week-5/Exercise5.hs

mit

iqueSol :: Node -> Bool uniqueSol node = singleton (solveNs [node]) where singleton [] = False singleton [x] = True singleton (x:y:zs) = False

uniqueSol :: Node -> Bool uniqueSol node = singleton (solveNs [node]) where singleton [] = False singleton [x] = True singleton (x:y:zs) = False

uniqueSol node = singleton (solveNs [node]) where singleton [] = False singleton [x] = True singleton (x:y:zs) = False

icostan/haskell-lang

dist/build/autogen/Paths_haskell_lang.hs

lgpl-3.0

libdir = "/Users/icostan/.cabal/lib/x86_64-osx-ghc-7.10.1/haske_DYAsM7lZ8KFK9XmNGG9nLi"

libdir = "/Users/icostan/.cabal/lib/x86_64-osx-ghc-7.10.1/haske_DYAsM7lZ8KFK9XmNGG9nLi"

libdir = "/Users/icostan/.cabal/lib/x86_64-osx-ghc-7.10.1/haske_DYAsM7lZ8KFK9XmNGG9nLi"

graninas/ICFPC2007

Endo/Test/EndoDnaTest.hs

gpl-3.0

prop_basicSubsequence8 = toDna "ICFP" |- only 6 == emptyDna

prop_basicSubsequence8 = toDna "ICFP" |- only 6 == emptyDna

prop_basicSubsequence8 = toDna "ICFP" |- only 6 == emptyDna

ihc/futhark

src/Language/Futhark/TypeChecker/Terms.hs

isc

patternUses (PatternParens p _) = patternUses p

patternUses (PatternParens p _) = patternUses p

patternUses (PatternParens p _) = patternUses p

ml9951/ghc

compiler/codeGen/StgCmmLayout.hs

bsd-3-clause

------------------------------------------------------------------------ -- Call and return sequences ------------------------------------------------------------------------ -- | Return multiple values to the sequel -- -- If the sequel is @Return@ -- -- > return (x,y) -- -- If the sequel is @AssignTo [p,q]@ -- -- > p=x; q=y; -- emitReturn :: [CmmExpr] -> FCode ReturnKind emitReturn results = do { dflags <- getDynFlags ; sequel <- getSequel ; updfr_off <- getUpdFrameOff ; case sequel of Return _ -> do { adjustHpBackwards ; let e = CmmLoad (CmmStackSlot Old updfr_off) (gcWord dflags) ; emit (mkReturn dflags (entryCode dflags e) results updfr_off) } AssignTo regs adjust -> do { when adjust adjustHpBackwards ; emitMultiAssign regs results } ; return AssignedDirectly }

emitReturn :: [CmmExpr] -> FCode ReturnKind emitReturn results = do { dflags <- getDynFlags ; sequel <- getSequel ; updfr_off <- getUpdFrameOff ; case sequel of Return _ -> do { adjustHpBackwards ; let e = CmmLoad (CmmStackSlot Old updfr_off) (gcWord dflags) ; emit (mkReturn dflags (entryCode dflags e) results updfr_off) } AssignTo regs adjust -> do { when adjust adjustHpBackwards ; emitMultiAssign regs results } ; return AssignedDirectly }

emitReturn results = do { dflags <- getDynFlags ; sequel <- getSequel ; updfr_off <- getUpdFrameOff ; case sequel of Return _ -> do { adjustHpBackwards ; let e = CmmLoad (CmmStackSlot Old updfr_off) (gcWord dflags) ; emit (mkReturn dflags (entryCode dflags e) results updfr_off) } AssignTo regs adjust -> do { when adjust adjustHpBackwards ; emitMultiAssign regs results } ; return AssignedDirectly }

snoyberg/ghc

compiler/types/Type.hs

bsd-3-clause

getCastedTyVar_maybe (TyVarTy tv) = Just (tv, mkReflCo Nominal (tyVarKind tv))

getCastedTyVar_maybe (TyVarTy tv) = Just (tv, mkReflCo Nominal (tyVarKind tv))

getCastedTyVar_maybe (TyVarTy tv) = Just (tv, mkReflCo Nominal (tyVarKind tv))

achirkin/ghcjs-webgl

src/JavaScript/WebGL/Const.hs

mit

gl_RENDERBUFFER_INTERNAL_FORMAT :: GLenum gl_RENDERBUFFER_INTERNAL_FORMAT = 0x8D44

gl_RENDERBUFFER_INTERNAL_FORMAT :: GLenum gl_RENDERBUFFER_INTERNAL_FORMAT = 0x8D44

gl_RENDERBUFFER_INTERNAL_FORMAT = 0x8D44

aelve/json-x

lib/Json/Internal/TH.hs

bsd-3-clause

(<%>) :: ExpQ -> ExpQ -> ExpQ (<%>) a b = a <^> [|B.char7 ','|] <^> b

(<%>) :: ExpQ -> ExpQ -> ExpQ (<%>) a b = a <^> [|B.char7 ','|] <^> b

(<%>) a b = a <^> [|B.char7 ','|] <^> b

snoyberg/ghc

libraries/base/GHC/List.hs

bsd-3-clause

dropWhile p xs@(x:xs') | p x = dropWhile p xs' | otherwise = xs

dropWhile p xs@(x:xs') | p x = dropWhile p xs' | otherwise = xs

dropWhile p xs@(x:xs') | p x = dropWhile p xs' | otherwise = xs

rodrigo-machado/verigraph

src/library/Abstract/Rewriting/DPO/Process.hs

gpl-3.0

allCoproduct :: (DPO morph, Cocomplete morph) => [Production morph] -> [morph] allCoproduct = calculateNCoproduct . fromList . getAllObjects

allCoproduct :: (DPO morph, Cocomplete morph) => [Production morph] -> [morph] allCoproduct = calculateNCoproduct . fromList . getAllObjects

allCoproduct = calculateNCoproduct . fromList . getAllObjects

ardumont/snake

deps/gloss-rendering/Graphics/Gloss/Internals/Data/Color.hs

bsd-3-clause

-- | Make a custom color, taking pre-clamped components. makeRawColorI :: Int -> Int -> Int -> Int -> Color makeRawColorI r g b a = RGBA (fromIntegral r / 255) (fromIntegral g / 255) (fromIntegral b / 255) (fromIntegral a / 255)

makeRawColorI :: Int -> Int -> Int -> Int -> Color makeRawColorI r g b a = RGBA (fromIntegral r / 255) (fromIntegral g / 255) (fromIntegral b / 255) (fromIntegral a / 255)

makeRawColorI r g b a = RGBA (fromIntegral r / 255) (fromIntegral g / 255) (fromIntegral b / 255) (fromIntegral a / 255)

NinjaTrappeur/DobadoBots

src/DobadoBots/Graphics/Utils.hs

bsd-3-clause

getBmpTex :: String -> SDL.Renderer -> IO (SDL.Texture, SDL.V2 CInt) getBmpTex path r = do surf <- SDL.loadBMP path tex <- SDL.createTextureFromSurface r surf dim <- SDL.surfaceDimensions surf SDL.freeSurface surf return (tex, dim) -- We know when a point is in a rectangle when -- for a rectangle A, B, C (where ab and bc are perpendicular) -- we have 0 <= dot(AB,AM) <= dot(AB,AB) && 0 <= dot(bc, bm) <= dot(bc, bc)

getBmpTex :: String -> SDL.Renderer -> IO (SDL.Texture, SDL.V2 CInt) getBmpTex path r = do surf <- SDL.loadBMP path tex <- SDL.createTextureFromSurface r surf dim <- SDL.surfaceDimensions surf SDL.freeSurface surf return (tex, dim) -- We know when a point is in a rectangle when -- for a rectangle A, B, C (where ab and bc are perpendicular) -- we have 0 <= dot(AB,AM) <= dot(AB,AB) && 0 <= dot(bc, bm) <= dot(bc, bc)

getBmpTex path r = do surf <- SDL.loadBMP path tex <- SDL.createTextureFromSurface r surf dim <- SDL.surfaceDimensions surf SDL.freeSurface surf return (tex, dim) -- We know when a point is in a rectangle when -- for a rectangle A, B, C (where ab and bc are perpendicular) -- we have 0 <= dot(AB,AM) <= dot(AB,AB) && 0 <= dot(bc, bm) <= dot(bc, bc)

vdweegen/UvA-Software_Testing

Lab4/Willem/Exercises.hs

gpl-3.0

-- | Difference props prop_difference_subset :: Set Int -> Set Int -> Bool prop_difference_subset a b = s `subSet` a where s = a `differenceSet` b

prop_difference_subset :: Set Int -> Set Int -> Bool prop_difference_subset a b = s `subSet` a where s = a `differenceSet` b

prop_difference_subset a b = s `subSet` a where s = a `differenceSet` b

dmagyar/scurry

src/Scurry/Comm/SockWrite.hs

bsd-3-clause

sendToAddr :: Socket -> ScurryMsg -> EndPoint -> IO Int sendToAddr s m = sendTo s (BSS.concat . BS.toChunks $ encode m) . epToSa

sendToAddr :: Socket -> ScurryMsg -> EndPoint -> IO Int sendToAddr s m = sendTo s (BSS.concat . BS.toChunks $ encode m) . epToSa

sendToAddr s m = sendTo s (BSS.concat . BS.toChunks $ encode m) . epToSa

uduki/hsQt

Qtc/ClassTypes/Network.hs

bsd-2-clause

withQListQTcpServerResult :: (Ptr (Ptr (TQTcpServer a)) -> IO CInt) -> IO [QTcpServer a] withQListQTcpServerResult f = withQListObjectResult qtc_QTcpServer_getFinalizer f

withQListQTcpServerResult :: (Ptr (Ptr (TQTcpServer a)) -> IO CInt) -> IO [QTcpServer a] withQListQTcpServerResult f = withQListObjectResult qtc_QTcpServer_getFinalizer f

withQListQTcpServerResult f = withQListObjectResult qtc_QTcpServer_getFinalizer f

brendanhay/gogol

gogol-oslogin/gen/Network/Google/OSLogin/Types.hs

mpl-2.0

-- | View and manage your Google Compute Engine resources computeScope :: Proxy '["https://www.googleapis.com/auth/compute"] computeScope = Proxy

computeScope :: Proxy '["https://www.googleapis.com/auth/compute"] computeScope = Proxy

computeScope = Proxy

ezyang/ghc

compiler/basicTypes/SrcLoc.hs

bsd-3-clause

isOneLineSpan (UnhelpfulSpan _) = False

isOneLineSpan (UnhelpfulSpan _) = False

isOneLineSpan (UnhelpfulSpan _) = False

joehillen/ultron

app/Main.hs

mit

runCommand :: ChannelId -> UserId -> [FilePath] -> Text -> [Text] -> IO Text runCommand cid uid dirpaths cmd args = handle handler go where handler :: SomeException -> IO Text handler e = return $ "*ERROR:* "<>tshow e go | cmd == "help" = help dirpaths | otherwise = getBin dirpaths cmd >>= \case Nothing -> return $ "*ERROR:* Unknown command: " <> cmd Just bin -> runbin bin cmdErrorResponse stdout stderr errNum = "<@"<>uid ^. getId<>">\n" <>"*ERROR:* `"<>cmd<>"` failed with exit code: "<>tshow errNum<>"\n" <>emptyIfNull "stdout" stdout <>emptyIfNull "stderr" stderr emptyIfNull _ "" = "" emptyIfNull name s = (T.intercalate "\n" [ "*" <> name <> ":*" , "```" , s , "```" ]) <> "\n" mkProc bin = (proc bin (map T.unpack args)) { env = Just [ ("ULTRON_CID", (cid ^. getId . unpacked)) , ("ULTRON_UID", (uid ^. getId . unpacked)) ] , close_fds = True } runbin bin = do (ec, stdout, stderr) <- PT.readCreateProcessWithExitCode (mkProc bin) "" return $ case ec of ExitSuccess -> stdout ExitFailure errNum -> cmdErrorResponse stdout stderr errNum

runCommand :: ChannelId -> UserId -> [FilePath] -> Text -> [Text] -> IO Text runCommand cid uid dirpaths cmd args = handle handler go where handler :: SomeException -> IO Text handler e = return $ "*ERROR:* "<>tshow e go | cmd == "help" = help dirpaths | otherwise = getBin dirpaths cmd >>= \case Nothing -> return $ "*ERROR:* Unknown command: " <> cmd Just bin -> runbin bin cmdErrorResponse stdout stderr errNum = "<@"<>uid ^. getId<>">\n" <>"*ERROR:* `"<>cmd<>"` failed with exit code: "<>tshow errNum<>"\n" <>emptyIfNull "stdout" stdout <>emptyIfNull "stderr" stderr emptyIfNull _ "" = "" emptyIfNull name s = (T.intercalate "\n" [ "*" <> name <> ":*" , "```" , s , "```" ]) <> "\n" mkProc bin = (proc bin (map T.unpack args)) { env = Just [ ("ULTRON_CID", (cid ^. getId . unpacked)) , ("ULTRON_UID", (uid ^. getId . unpacked)) ] , close_fds = True } runbin bin = do (ec, stdout, stderr) <- PT.readCreateProcessWithExitCode (mkProc bin) "" return $ case ec of ExitSuccess -> stdout ExitFailure errNum -> cmdErrorResponse stdout stderr errNum

runCommand cid uid dirpaths cmd args = handle handler go where handler :: SomeException -> IO Text handler e = return $ "*ERROR:* "<>tshow e go | cmd == "help" = help dirpaths | otherwise = getBin dirpaths cmd >>= \case Nothing -> return $ "*ERROR:* Unknown command: " <> cmd Just bin -> runbin bin cmdErrorResponse stdout stderr errNum = "<@"<>uid ^. getId<>">\n" <>"*ERROR:* `"<>cmd<>"` failed with exit code: "<>tshow errNum<>"\n" <>emptyIfNull "stdout" stdout <>emptyIfNull "stderr" stderr emptyIfNull _ "" = "" emptyIfNull name s = (T.intercalate "\n" [ "*" <> name <> ":*" , "```" , s , "```" ]) <> "\n" mkProc bin = (proc bin (map T.unpack args)) { env = Just [ ("ULTRON_CID", (cid ^. getId . unpacked)) , ("ULTRON_UID", (uid ^. getId . unpacked)) ] , close_fds = True } runbin bin = do (ec, stdout, stderr) <- PT.readCreateProcessWithExitCode (mkProc bin) "" return $ case ec of ExitSuccess -> stdout ExitFailure errNum -> cmdErrorResponse stdout stderr errNum

ctford/Idris-Elba-dev

src/IRTS/System.hs

bsd-3-clause

getExecutablePom = do dir <- getDataDir return $ dir </> "java" </> "executable_pom.xml"

getExecutablePom = do dir <- getDataDir return $ dir </> "java" </> "executable_pom.xml"

getExecutablePom = do dir <- getDataDir return $ dir </> "java" </> "executable_pom.xml"

jwiegley/ghc-release

utils/haddock/src/Haddock/Interface/Rename.hs

gpl-3.0

getLookupRn :: RnM (Name -> (Bool, DocName)) getLookupRn = RnM (\lkp -> (lkp,[]))

getLookupRn :: RnM (Name -> (Bool, DocName)) getLookupRn = RnM (\lkp -> (lkp,[]))

getLookupRn = RnM (\lkp -> (lkp,[]))

athanclark/Idris-dev

src/Idris/Reflection.hs

bsd-3-clause

rawBool :: Bool -> Raw rawBool True = Var (sNS (sUN "True") ["Bool", "Prelude"])

rawBool :: Bool -> Raw rawBool True = Var (sNS (sUN "True") ["Bool", "Prelude"])

rawBool True = Var (sNS (sUN "True") ["Bool", "Prelude"])

SavinaRoja/SavinaRoja.github.io

assets/centraldogma_algebraic.hs

mit

geneticCode (Codon Adenine Thymine Guanosine) = Methionine

geneticCode (Codon Adenine Thymine Guanosine) = Methionine

geneticCode (Codon Adenine Thymine Guanosine) = Methionine

PipocaQuemada/ermine

src/Ermine/Syntax/Scope.hs

bsd-2-clause

splitScope :: (Applicative c, Monad c) => Scope (Var b1 b2) c a -> Scope b1 (Scope b2 c) a -- c (Var (Var b1 b2) (c a)) -- Scope b2 c (Var b1 (Scope b2 c a)) splitScope (Scope e) = Scope . lift $ swizzle <$> e where swizzle (B (B b1)) = B b1 swizzle (B (F b2)) = F . Scope . pure . B $ b2 swizzle (F a) = F $ lift a -- | Enables a partial rebinding and instantiation of the bound variables in a -- 'Scope'.

splitScope :: (Applicative c, Monad c) => Scope (Var b1 b2) c a -> Scope b1 (Scope b2 c) a splitScope (Scope e) = Scope . lift $ swizzle <$> e where swizzle (B (B b1)) = B b1 swizzle (B (F b2)) = F . Scope . pure . B $ b2 swizzle (F a) = F $ lift a -- | Enables a partial rebinding and instantiation of the bound variables in a -- 'Scope'.

splitScope (Scope e) = Scope . lift $ swizzle <$> e where swizzle (B (B b1)) = B b1 swizzle (B (F b2)) = F . Scope . pure . B $ b2 swizzle (F a) = F $ lift a -- | Enables a partial rebinding and instantiation of the bound variables in a -- 'Scope'.

vincenthz/language-c

src/Language/C/Analysis/TypeCheck.hs

bsd-3-clause

notFound :: Ident -> Either String a notFound i = Left $ "not found: " ++ identToString i

notFound :: Ident -> Either String a notFound i = Left $ "not found: " ++ identToString i

notFound i = Left $ "not found: " ++ identToString i

UU-ComputerScience/uulib

src/UU/Parsing/Derived.hs

bsd-3-clause

pFoldr1Sep :: (IsParser p s) => (a -> b -> b, b) -> p a1 -> p a -> p b pFoldr1Sep alg sep p = pFoldr1Sep_gr alg sep p

pFoldr1Sep :: (IsParser p s) => (a -> b -> b, b) -> p a1 -> p a -> p b pFoldr1Sep alg sep p = pFoldr1Sep_gr alg sep p

pFoldr1Sep alg sep p = pFoldr1Sep_gr alg sep p

dsorokin/aivika-experiment-chart

examples/TruckHaulingSituation/Experiment.hs

bsd-3-clause

truckQueue = T.Queue $ resultByName "truckQueue"

truckQueue = T.Queue $ resultByName "truckQueue"

truckQueue = T.Queue $ resultByName "truckQueue"

brendanhay/gogol

gogol-dlp/gen/Network/Google/DLP/Types/Product.hs

mpl-2.0

-- | Creates a value of 'GooglePrivacyDlpV2CategoricalStatsResult' with the minimum fields required to make a request. -- -- Use one of the following lenses to modify other fields as desired: -- -- * 'gpdvcsrValueFrequencyHistogramBuckets' googlePrivacyDlpV2CategoricalStatsResult :: GooglePrivacyDlpV2CategoricalStatsResult googlePrivacyDlpV2CategoricalStatsResult = GooglePrivacyDlpV2CategoricalStatsResult' {_gpdvcsrValueFrequencyHistogramBuckets = Nothing}

googlePrivacyDlpV2CategoricalStatsResult :: GooglePrivacyDlpV2CategoricalStatsResult googlePrivacyDlpV2CategoricalStatsResult = GooglePrivacyDlpV2CategoricalStatsResult' {_gpdvcsrValueFrequencyHistogramBuckets = Nothing}

googlePrivacyDlpV2CategoricalStatsResult = GooglePrivacyDlpV2CategoricalStatsResult' {_gpdvcsrValueFrequencyHistogramBuckets = Nothing}

erantapaa/happstack-server

src/Happstack/Server/Internal/TimeoutTable.hs

bsd-3-clause

killAll :: TimeoutTable -> IO () killAll (TimeoutTable maps _) = do V.mapM_ k maps where k psqMV = modifyMVar_ psqMV $ \psq -> do mapM_ killThread $ PSQ.keys psq return PSQ.empty

killAll :: TimeoutTable -> IO () killAll (TimeoutTable maps _) = do V.mapM_ k maps where k psqMV = modifyMVar_ psqMV $ \psq -> do mapM_ killThread $ PSQ.keys psq return PSQ.empty

killAll (TimeoutTable maps _) = do V.mapM_ k maps where k psqMV = modifyMVar_ psqMV $ \psq -> do mapM_ killThread $ PSQ.keys psq return PSQ.empty

pseudonom/persistent

persistent-test/src/HtmlTest.hs

mit

cleanDB :: (MonadIO m, PersistQuery backend, PersistEntityBackend HtmlTable ~ backend) => ReaderT backend m () cleanDB = do deleteWhere ([] :: [Filter HtmlTable])

cleanDB :: (MonadIO m, PersistQuery backend, PersistEntityBackend HtmlTable ~ backend) => ReaderT backend m () cleanDB = do deleteWhere ([] :: [Filter HtmlTable])

cleanDB = do deleteWhere ([] :: [Filter HtmlTable])

luisgepeto/HaskellLearning

10 Functionally Solving Problems/02_heathrow_to_london.hs

mit

--make a function that splits a list into a list of lists of same size groupsOf :: Int -> [a] -> [[a]] groupsOf 0 _ = undefined

groupsOf :: Int -> [a] -> [[a]] groupsOf 0 _ = undefined

groupsOf 0 _ = undefined

leshchevds/ganeti

src/Ganeti/Constants.hs

bsd-2-clause

oobCommands :: FrozenSet String oobCommands = ConstantUtils.mkSet $ map Types.oobCommandToRaw [minBound..]

oobCommands :: FrozenSet String oobCommands = ConstantUtils.mkSet $ map Types.oobCommandToRaw [minBound..]

oobCommands = ConstantUtils.mkSet $ map Types.oobCommandToRaw [minBound..]

andrewthad/yesod

yesod-core/Yesod/Core/Handler.hs

mit

-- | Get the URL rendering function. getUrlRender :: MonadHandler m => m (Route (HandlerSite m) -> Text) getUrlRender = do x <- rheRender `liftM` askHandlerEnv return $ flip x [] -- | The URL rendering function with query-string parameters.

getUrlRender :: MonadHandler m => m (Route (HandlerSite m) -> Text) getUrlRender = do x <- rheRender `liftM` askHandlerEnv return $ flip x [] -- | The URL rendering function with query-string parameters.

getUrlRender = do x <- rheRender `liftM` askHandlerEnv return $ flip x [] -- | The URL rendering function with query-string parameters.

luzhuomi/xhaskell-regex-deriv

Text/Regex/Deriv/ByteString/BitCode.hs

bsd-3-clause

-- not in used extractSR (PChoice [p] _) (Choice [r] _) u start_index = extractSR p r u start_index

extractSR (PChoice [p] _) (Choice [r] _) u start_index = extractSR p r u start_index

extractSR (PChoice [p] _) (Choice [r] _) u start_index = extractSR p r u start_index

brendanhay/gogol

gogol-storage/gen/Network/Google/Storage/Types/Product.hs

mpl-2.0

-- | A Boolean value to indicate whether payload is wanted. Optional. cPayload :: Lens' Channel (Maybe Bool) cPayload = lens _cPayload (\ s a -> s{_cPayload = a})

cPayload :: Lens' Channel (Maybe Bool) cPayload = lens _cPayload (\ s a -> s{_cPayload = a})

cPayload = lens _cPayload (\ s a -> s{_cPayload = a})

aavogt/DimMat

examples/controlspace.hs

bsd-3-clause

testIsLTI = (\ a b c d -> case isLTI (1 *~ second) x u y a (colMat b) c (colMat d) of _ -> do print $ vsep [text "A = " </> indent 0 (pretty (zeroes `asTypeOf` a)), text "B = " </> indent 0 (pretty (zeroes `asTypeOf` b)), text "C = " </> indent 0 (pretty (zeroes `asTypeOf` c)), text "D = " </> indent 0 (pretty (zeroes `asTypeOf` d))] ) undefined undefined undefined undefined

testIsLTI = (\ a b c d -> case isLTI (1 *~ second) x u y a (colMat b) c (colMat d) of _ -> do print $ vsep [text "A = " </> indent 0 (pretty (zeroes `asTypeOf` a)), text "B = " </> indent 0 (pretty (zeroes `asTypeOf` b)), text "C = " </> indent 0 (pretty (zeroes `asTypeOf` c)), text "D = " </> indent 0 (pretty (zeroes `asTypeOf` d))] ) undefined undefined undefined undefined

testIsLTI = (\ a b c d -> case isLTI (1 *~ second) x u y a (colMat b) c (colMat d) of _ -> do print $ vsep [text "A = " </> indent 0 (pretty (zeroes `asTypeOf` a)), text "B = " </> indent 0 (pretty (zeroes `asTypeOf` b)), text "C = " </> indent 0 (pretty (zeroes `asTypeOf` c)), text "D = " </> indent 0 (pretty (zeroes `asTypeOf` d))] ) undefined undefined undefined undefined

ChristopherKing42/tagsoup

Text/HTML/TagSoup/Type.hs

bsd-3-clause

-- | Extract the string from within 'TagText', crashes if not a 'TagText' fromTagText :: Show str => Tag str -> str fromTagText (TagText x) = x

fromTagText :: Show str => Tag str -> str fromTagText (TagText x) = x

fromTagText (TagText x) = x

farrellm/advent

src/Template.hs

mit

p1 = 0

p1 = 0

p1 = 0

saclark/wyas

src/Wyas/Eval.hs

mit

eval (List [Atom "quote", val]) = return val

eval (List [Atom "quote", val]) = return val

eval (List [Atom "quote", val]) = return val

urbanslug/ghc

compiler/ghci/ByteCodeAsm.hs

bsd-3-clause

inspectAsm :: DynFlags -> Bool -> Word -> Assembler a -> (Word, LabelEnvMap) inspectAsm dflags long_jumps initial_offset = go (InspectState initial_offset 0 0 Map.empty) where go s (NullAsm _) = (instrCount s, lblEnv s) go s (AllocPtr _ k) = go (s { ptrCount = n + 1 }) (k n) where n = ptrCount s go s (AllocLit ls k) = go (s { litCount = n + genericLength ls }) (k n) where n = litCount s go s (AllocLabel lbl k) = go s' k where s' = s { lblEnv = Map.insert lbl (instrCount s) (lblEnv s) } go s (Emit _ ops k) = go s' k where s' = s { instrCount = instrCount s + size } size = sum (map count ops) + 1 largeOps = any (largeOp long_jumps) ops count (SmallOp _) = 1 count (LabelOp _) = count (Op 0) count (Op _) = if largeOps then largeArg16s dflags else 1 -- count (LargeOp _) = largeArg16s dflags -- Bring in all the bci_ bytecode constants. #include "rts/Bytecodes.h"

inspectAsm :: DynFlags -> Bool -> Word -> Assembler a -> (Word, LabelEnvMap) inspectAsm dflags long_jumps initial_offset = go (InspectState initial_offset 0 0 Map.empty) where go s (NullAsm _) = (instrCount s, lblEnv s) go s (AllocPtr _ k) = go (s { ptrCount = n + 1 }) (k n) where n = ptrCount s go s (AllocLit ls k) = go (s { litCount = n + genericLength ls }) (k n) where n = litCount s go s (AllocLabel lbl k) = go s' k where s' = s { lblEnv = Map.insert lbl (instrCount s) (lblEnv s) } go s (Emit _ ops k) = go s' k where s' = s { instrCount = instrCount s + size } size = sum (map count ops) + 1 largeOps = any (largeOp long_jumps) ops count (SmallOp _) = 1 count (LabelOp _) = count (Op 0) count (Op _) = if largeOps then largeArg16s dflags else 1 -- count (LargeOp _) = largeArg16s dflags -- Bring in all the bci_ bytecode constants. #include "rts/Bytecodes.h"

inspectAsm dflags long_jumps initial_offset = go (InspectState initial_offset 0 0 Map.empty) where go s (NullAsm _) = (instrCount s, lblEnv s) go s (AllocPtr _ k) = go (s { ptrCount = n + 1 }) (k n) where n = ptrCount s go s (AllocLit ls k) = go (s { litCount = n + genericLength ls }) (k n) where n = litCount s go s (AllocLabel lbl k) = go s' k where s' = s { lblEnv = Map.insert lbl (instrCount s) (lblEnv s) } go s (Emit _ ops k) = go s' k where s' = s { instrCount = instrCount s + size } size = sum (map count ops) + 1 largeOps = any (largeOp long_jumps) ops count (SmallOp _) = 1 count (LabelOp _) = count (Op 0) count (Op _) = if largeOps then largeArg16s dflags else 1 -- count (LargeOp _) = largeArg16s dflags -- Bring in all the bci_ bytecode constants. #include "rts/Bytecodes.h"

brendanhay/gogol

gogol-gmail/gen/Network/Google/Gmail/Types/Product.hs

mpl-2.0

-- | Creates a value of 'ImapSettings' with the minimum fields required to make a request. -- -- Use one of the following lenses to modify other fields as desired: -- -- * 'isEnabled' -- -- * 'isExpungeBehavior' -- -- * 'isAutoExpunge' -- -- * 'isMaxFolderSize' imapSettings :: ImapSettings imapSettings = ImapSettings' { _isEnabled = Nothing , _isExpungeBehavior = Nothing , _isAutoExpunge = Nothing , _isMaxFolderSize = Nothing }

imapSettings :: ImapSettings imapSettings = ImapSettings' { _isEnabled = Nothing , _isExpungeBehavior = Nothing , _isAutoExpunge = Nothing , _isMaxFolderSize = Nothing }

imapSettings = ImapSettings' { _isEnabled = Nothing , _isExpungeBehavior = Nothing , _isAutoExpunge = Nothing , _isMaxFolderSize = Nothing }

GaloisInc/galua

galua/src/Galua/MachUtils.hs

mit

newMachineEnv :: AllocRef -> MachConfig -> IO MachineEnv newMachineEnv aref machConfig = do let refLoc = RefLoc { refLocCaller = MachSetup , refLocSite = MachSetup } machGlobals <- newTable aref refLoc 0 0 machRegistry <- newTable aref refLoc 0 0 machNextChunkId <- newIORef 0 machMetatablesRef <- newIORef Map.empty machLuaServer <- atomically newEmptyTMVar machCServer <- newEmptyMVar machGarbage <- newIORef [] machStablePtr <- newStablePtr ExternalLuaState { extLuaStateLuaServer = machLuaServer , extLuaStateCServer = machCServer } machMainThreadRef <- allocNewThread machStablePtr aref refLoc ThreadRunning setTableRaw machRegistry (Number 1) (Thread machMainThreadRef) setTableRaw machRegistry (Number 2) (Table machGlobals) machNameCache <- newIORef (cacheEmpty 50000) machCFunInfo <- cfunInfoFun machJIT <- newIORef Map.empty return MachineEnv { .. }

newMachineEnv :: AllocRef -> MachConfig -> IO MachineEnv newMachineEnv aref machConfig = do let refLoc = RefLoc { refLocCaller = MachSetup , refLocSite = MachSetup } machGlobals <- newTable aref refLoc 0 0 machRegistry <- newTable aref refLoc 0 0 machNextChunkId <- newIORef 0 machMetatablesRef <- newIORef Map.empty machLuaServer <- atomically newEmptyTMVar machCServer <- newEmptyMVar machGarbage <- newIORef [] machStablePtr <- newStablePtr ExternalLuaState { extLuaStateLuaServer = machLuaServer , extLuaStateCServer = machCServer } machMainThreadRef <- allocNewThread machStablePtr aref refLoc ThreadRunning setTableRaw machRegistry (Number 1) (Thread machMainThreadRef) setTableRaw machRegistry (Number 2) (Table machGlobals) machNameCache <- newIORef (cacheEmpty 50000) machCFunInfo <- cfunInfoFun machJIT <- newIORef Map.empty return MachineEnv { .. }

newMachineEnv aref machConfig = do let refLoc = RefLoc { refLocCaller = MachSetup , refLocSite = MachSetup } machGlobals <- newTable aref refLoc 0 0 machRegistry <- newTable aref refLoc 0 0 machNextChunkId <- newIORef 0 machMetatablesRef <- newIORef Map.empty machLuaServer <- atomically newEmptyTMVar machCServer <- newEmptyMVar machGarbage <- newIORef [] machStablePtr <- newStablePtr ExternalLuaState { extLuaStateLuaServer = machLuaServer , extLuaStateCServer = machCServer } machMainThreadRef <- allocNewThread machStablePtr aref refLoc ThreadRunning setTableRaw machRegistry (Number 1) (Thread machMainThreadRef) setTableRaw machRegistry (Number 2) (Table machGlobals) machNameCache <- newIORef (cacheEmpty 50000) machCFunInfo <- cfunInfoFun machJIT <- newIORef Map.empty return MachineEnv { .. }

xixi4Den/BSUIR-Haskell-lw1

src/FCM.hs

mit

hammingDistance :: [Double] -> [Double] -> Double hammingDistance a b = sum $ zipWith (\ai bi -> abs (ai - bi)) a b

hammingDistance :: [Double] -> [Double] -> Double hammingDistance a b = sum $ zipWith (\ai bi -> abs (ai - bi)) a b

hammingDistance a b = sum $ zipWith (\ai bi -> abs (ai - bi)) a b

lspitzner/brittany

source/library/Language/Haskell/Brittany/Internal/Utils.hs

agpl-3.0

traceIfDumpConf :: (MonadMultiReader Config m, Show a) => String -> (DebugConfig -> Identity (Semigroup.Last Bool)) -> a -> m () traceIfDumpConf s accessor val = do whenM (mAsk <&> _conf_debug .> accessor .> confUnpack) $ do trace ("---- " ++ s ++ " ----\n" ++ show val) $ return ()

traceIfDumpConf :: (MonadMultiReader Config m, Show a) => String -> (DebugConfig -> Identity (Semigroup.Last Bool)) -> a -> m () traceIfDumpConf s accessor val = do whenM (mAsk <&> _conf_debug .> accessor .> confUnpack) $ do trace ("---- " ++ s ++ " ----\n" ++ show val) $ return ()

traceIfDumpConf s accessor val = do whenM (mAsk <&> _conf_debug .> accessor .> confUnpack) $ do trace ("---- " ++ s ++ " ----\n" ++ show val) $ return ()

oldmanmike/ghc

compiler/utils/Outputable.hs

bsd-3-clause

text s = docToSDoc $ Pretty.text s

text s = docToSDoc $ Pretty.text s

text s = docToSDoc $ Pretty.text s

aelve/sqlite-simple-x

lib/Database/SQLite/Simple/X.hs

bsd-3-clause

notNull :: TableSpec -> TableSpec notNull = censor (map (<> " NOT NULL"))

notNull :: TableSpec -> TableSpec notNull = censor (map (<> " NOT NULL"))

notNull = censor (map (<> " NOT NULL"))