Datasets:
blastwind
/
deprecated-github-code-haskell-function

Dataset card Data Studio Files Community
1
Search is not available for this dataset
repo_name
string
path
string
license
string
full_code
string
full_size
int64
uncommented_code
string
uncommented_size
int64
function_only_code
string
function_only_size
int64
is_commented
bool
is_signatured
bool
n_ast_errors
int64
ast_max_depth
int64
n_whitespaces
int64
n_ast_nodes
int64
n_ast_terminals
int64
n_ast_nonterminals
int64
loc
int64
cycloplexity
int64
codeq/language-py
src/Language/Py/ParserMonad.hs
bsd-3-clause
setInput :: String -> P () setInput inp = modify $ \s -> s { input = inp }
74
setInput :: String -> P () setInput inp = modify $ \s -> s { input = inp }
74
setInput inp = modify $ \s -> s { input = inp }
47
false
true
0
8
18
40
21
19
null
null
ambiata/mafia
src/Mafia/Hoogle.hs
bsd-3-clause
detectHoogleVersion :: File -> EitherT MafiaError IO HoogleVersion detectHoogleVersion hf = do res <- T.init . unOut <$> call MafiaProcessError hf ["--version"] if T.isPrefixOf "Hoogle v4." res then pure Hoogle4x else if T.isPrefixOf "Hoogle 5." res then pure Hoogle5x else left . MafiaParseError $ "Invalid hoogle version: " <> res
352
detectHoogleVersion :: File -> EitherT MafiaError IO HoogleVersion detectHoogleVersion hf = do res <- T.init . unOut <$> call MafiaProcessError hf ["--version"] if T.isPrefixOf "Hoogle v4." res then pure Hoogle4x else if T.isPrefixOf "Hoogle 5." res then pure Hoogle5x else left . MafiaParseError $ "Invalid hoogle version: " <> res
352
detectHoogleVersion hf = do res <- T.init . unOut <$> call MafiaProcessError hf ["--version"] if T.isPrefixOf "Hoogle v4." res then pure Hoogle4x else if T.isPrefixOf "Hoogle 5." res then pure Hoogle5x else left . MafiaParseError $ "Invalid hoogle version: " <> res
285
false
true
0
11
69
103
50
53
null
null
YellPika/effin
src/Control/Effect/Reader.hs
bsd-3-clause
-- | Retrieves the current environment. ask :: EffectReader r l => Effect l r ask = send Ask
94
ask :: EffectReader r l => Effect l r ask = send Ask
52
ask = send Ask
14
true
true
0
7
20
34
15
19
null
null
jbapple/three-finger-trees
Spinal.hs
agpl-3.0
restConcatMap f (R1 x) = f x
28
restConcatMap f (R1 x) = f x
28
restConcatMap f (R1 x) = f x
28
false
false
0
6
6
22
9
13
null
null
opentower/carnap
Carnap/src/Carnap/Languages/ModalPropositional/Parser.hs
gpl-3.0
parseWorld :: (IndexingLang lex (Term World) (Form c) (Form b), Monad m) => ParsecT String u m (FixLang lex (Term World)) parseWorld = do digits <- many1 digit return $ world (read digits)
204
parseWorld :: (IndexingLang lex (Term World) (Form c) (Form b), Monad m) => ParsecT String u m (FixLang lex (Term World)) parseWorld = do digits <- many1 digit return $ world (read digits)
204
parseWorld = do digits <- many1 digit return $ world (read digits)
82
false
true
0
11
48
105
49
56
null
null
brow/noise
src/Text/Noise/Parser/Token/Internal.hs
mit
escMap = zip "abfnrtv\\\"\'" "\a\b\f\n\r\t\v\\\"\'"
60
escMap = zip "abfnrtv\\\"\'" "\a\b\f\n\r\t\v\\\"\'"
60
escMap = zip "abfnrtv\\\"\'" "\a\b\f\n\r\t\v\\\"\'"
60
false
false
0
5
13
11
5
6
null
null
ezyang/ghc
compiler/nativeGen/PPC/CodeGen.hs
bsd-3-clause
condIntCode, condFltCode :: Cond -> CmmExpr -> CmmExpr -> NatM CondCode -- optimize pointer tag checks. Operation andi. sets condition register -- so cmpi ..., 0 is redundant. condIntCode cond (CmmMachOp (MO_And _) [x, CmmLit (CmmInt imm rep)]) (CmmLit (CmmInt 0 _)) | not $ condUnsigned cond, Just src2 <- makeImmediate rep False imm = do (src1, code) <- getSomeReg x let code' = code `snocOL` AND r0 src1 (RIImm src2) return (CondCode False cond code')
498
condIntCode, condFltCode :: Cond -> CmmExpr -> CmmExpr -> NatM CondCode condIntCode cond (CmmMachOp (MO_And _) [x, CmmLit (CmmInt imm rep)]) (CmmLit (CmmInt 0 _)) | not $ condUnsigned cond, Just src2 <- makeImmediate rep False imm = do (src1, code) <- getSomeReg x let code' = code `snocOL` AND r0 src1 (RIImm src2) return (CondCode False cond code')
393
condIntCode cond (CmmMachOp (MO_And _) [x, CmmLit (CmmInt imm rep)]) (CmmLit (CmmInt 0 _)) | not $ condUnsigned cond, Just src2 <- makeImmediate rep False imm = do (src1, code) <- getSomeReg x let code' = code `snocOL` AND r0 src1 (RIImm src2) return (CondCode False cond code')
321
true
true
2
14
119
180
85
95
null
null
garetxe/cabal
Cabal/Distribution/Simple.hs
bsd-3-clause
hookedAction :: (UserHooks -> Args -> flags -> IO HookedBuildInfo) -> (UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> flags -> IO ()) -> (UserHooks -> Args -> flags -> PackageDescription -> LocalBuildInfo -> IO ()) -> IO LocalBuildInfo -> UserHooks -> flags -> Args -> IO () hookedAction pre_hook cmd_hook = hookedActionWithArgs pre_hook (\h _ pd lbi uh flags -> cmd_hook h pd lbi uh flags)
489
hookedAction :: (UserHooks -> Args -> flags -> IO HookedBuildInfo) -> (UserHooks -> PackageDescription -> LocalBuildInfo -> UserHooks -> flags -> IO ()) -> (UserHooks -> Args -> flags -> PackageDescription -> LocalBuildInfo -> IO ()) -> IO LocalBuildInfo -> UserHooks -> flags -> Args -> IO () hookedAction pre_hook cmd_hook = hookedActionWithArgs pre_hook (\h _ pd lbi uh flags -> cmd_hook h pd lbi uh flags)
489
hookedAction pre_hook cmd_hook = hookedActionWithArgs pre_hook (\h _ pd lbi uh flags -> cmd_hook h pd lbi uh flags)
119
false
true
0
15
146
160
79
81
null
null
dackerman/reflex-jsx
test/Main.hs
bsd-3-clause
-- These test antiquotation (MonadWidget values + dynamic attributes) anti1, anti2, anti3, anti4, anti5 :: (MonadWidget t m) => m () anti1 = [jsx|<div>{Dom.text "Hello"}</div>|]
177
anti1, anti2, anti3, anti4, anti5 :: (MonadWidget t m) => m () anti1 = [jsx|<div>{Dom.text "Hello"}</div>|]
107
anti1 = [jsx|<div>{Dom.text "Hello"}</div>|]
44
true
true
0
7
24
40
27
13
null
null
toonn/wyah
src/PolyCInfer.hs
bsd-2-clause
inferTop env ((name, ex):xs) = case inferExpr env ex of Left err -> Left err Right ty -> inferTop (extend env (name, ty)) xs
128
inferTop env ((name, ex):xs) = case inferExpr env ex of Left err -> Left err Right ty -> inferTop (extend env (name, ty)) xs
128
inferTop env ((name, ex):xs) = case inferExpr env ex of Left err -> Left err Right ty -> inferTop (extend env (name, ty)) xs
128
false
false
4
10
27
72
36
36
null
null
rCEx/feldspar-lang-small
src/Feldspar/Core/Frontend/Conversion.hs
bsd-3-clause
b2i :: Integral a => Data Bool -> Data a b2i = sugarSymF B2I
60
b2i :: Integral a => Data Bool -> Data a b2i = sugarSymF B2I
60
b2i = sugarSymF B2I
19
false
true
0
7
13
31
14
17
null
null
roberth/uu-helium
lib/Prelude.hs
gpl-3.0
min :: Ord a => a -> a -> a min x y = if x < y then x else y
60
min :: Ord a => a -> a -> a min x y = if x < y then x else y
60
min x y = if x < y then x else y
32
false
true
0
7
21
43
22
21
null
null
JacquesCarette/literate-scientific-software
code/drasil-example/Drasil/Template/Body.hs
bsd-2-clause
printSetting :: PrintingInformation printSetting = PI symbMap Equational defaultConfiguration
93
printSetting :: PrintingInformation printSetting = PI symbMap Equational defaultConfiguration
93
printSetting = PI symbMap Equational defaultConfiguration
57
false
true
0
5
8
18
9
9
null
null
raboof/xmobar
src/IPC/DBus.hs
bsd-3-clause
objectPath :: ObjectPath objectPath = objectPath_ "/org/Xmobar/Control"
71
objectPath :: ObjectPath objectPath = objectPath_ "/org/Xmobar/Control"
71
objectPath = objectPath_ "/org/Xmobar/Control"
46
false
true
0
5
6
14
7
7
null
null
metabrainz/musicbrainz-email
src/MusicBrainz/Email.hs
gpl-3.0
outboxQueue, unroutableQueue, invalidQueue :: Text outboxExchange = T.pack "outbox"
84
outboxQueue, unroutableQueue, invalidQueue :: Text outboxExchange = T.pack "outbox"
83
outboxExchange = T.pack "outbox"
32
false
true
4
6
9
32
12
20
null
null
sgillespie/ghc
compiler/stgSyn/StgSyn.hs
bsd-3-clause
topStgBindHasCafRefs (StgRec binds) = any topRhsHasCafRefs (map snd binds)
76
topStgBindHasCafRefs (StgRec binds) = any topRhsHasCafRefs (map snd binds)
76
topStgBindHasCafRefs (StgRec binds) = any topRhsHasCafRefs (map snd binds)
76
false
false
0
7
10
28
13
15
null
null
mauriciofierrom/cis194-homework
homework06/src/Fibonacci.hs
mit
fibs1 :: [Integer] fibs1 = map fib [0..]
40
fibs1 :: [Integer] fibs1 = map fib [0..]
40
fibs1 = map fib [0..]
21
false
true
0
7
7
30
13
17
null
null
ghcjs/jsaddle-dom
src/JSDOM/Generated/SourceBuffer.hs
mit
-- | <https://developer.mozilla.org/en-US/docs/Web/API/SourceBuffer.appendWindowEnd Mozilla SourceBuffer.appendWindowEnd documentation> getAppendWindowEnd :: (MonadDOM m) => SourceBuffer -> m Double getAppendWindowEnd self = liftDOM ((self ^. js "appendWindowEnd") >>= valToNumber)
284
getAppendWindowEnd :: (MonadDOM m) => SourceBuffer -> m Double getAppendWindowEnd self = liftDOM ((self ^. js "appendWindowEnd") >>= valToNumber)
147
getAppendWindowEnd self = liftDOM ((self ^. js "appendWindowEnd") >>= valToNumber)
84
true
true
0
10
27
56
27
29
null
null
mwu-tow/cuda
examples/src/bandwidthTest/BandwidthTest.hs
bsd-3-clause
bandwidth HostToDevice Pageable n = CUDA.allocaArray n $ \d_ptr -> withArray [1..n] $ \h_ptr -> bench n (CUDA.pokeArray n h_ptr d_ptr)
142
bandwidth HostToDevice Pageable n = CUDA.allocaArray n $ \d_ptr -> withArray [1..n] $ \h_ptr -> bench n (CUDA.pokeArray n h_ptr d_ptr)
142
bandwidth HostToDevice Pageable n = CUDA.allocaArray n $ \d_ptr -> withArray [1..n] $ \h_ptr -> bench n (CUDA.pokeArray n h_ptr d_ptr)
142
false
false
0
12
28
61
30
31
null
null
mrkkrp/stack
src/Stack/Path.hs
bsd-3-clause
deprecatedPathKeys :: [(Text, Text)] deprecatedPathKeys = [ (T.pack deprecatedStackRootOptionName, T.pack stackRootOptionName) , ("ghc-paths", "programs") , ("local-bin-path", "local-bin") ]
206
deprecatedPathKeys :: [(Text, Text)] deprecatedPathKeys = [ (T.pack deprecatedStackRootOptionName, T.pack stackRootOptionName) , ("ghc-paths", "programs") , ("local-bin-path", "local-bin") ]
206
deprecatedPathKeys = [ (T.pack deprecatedStackRootOptionName, T.pack stackRootOptionName) , ("ghc-paths", "programs") , ("local-bin-path", "local-bin") ]
169
false
true
0
8
33
57
34
23
null
null
lucasbraun/mt-rewrite
multimap/multimap-1.2.1/src/Data/MultiMap.hs
bsd-3-clause
map :: (a -> b) -> MultiMap k a -> MultiMap k b -- ^ Map a function over all values in the map. map f (MultiMap (nk, nv, map)) = MultiMap (nk, nv, Map.map (P.map f) map)
169
map :: (a -> b) -> MultiMap k a -> MultiMap k b map f (MultiMap (nk, nv, map)) = MultiMap (nk, nv, Map.map (P.map f) map)
121
map f (MultiMap (nk, nv, map)) = MultiMap (nk, nv, Map.map (P.map f) map)
73
true
true
0
10
37
88
45
43
null
null
ideas-edu/ideas
src/Ideas/Service/FeedbackScript/Run.hs
apache-2.0
toText :: Environment a -> Script -> Text -> Maybe Text toText env script = eval env script . Right
100
toText :: Environment a -> Script -> Text -> Maybe Text toText env script = eval env script . Right
99
toText env script = eval env script . Right
43
false
true
0
8
20
48
21
27
null
null
tpsinnem/Idris-dev
src/Idris/Core/TT.hs
bsd-3-clause
fmapMB f (Pi i t k) = liftM2 (Pi i) (f t) (f k)
48
fmapMB f (Pi i t k) = liftM2 (Pi i) (f t) (f k)
48
fmapMB f (Pi i t k) = liftM2 (Pi i) (f t) (f k)
48
false
false
0
7
14
46
22
24
null
null
kkspeed/SICP-Practise
Interpreter/code/Eval.hs
lgpl-3.0
readProc :: [LispVal] -> IOThrowsError LispVal readProc [] = readProc [Port stdin]
82
readProc :: [LispVal] -> IOThrowsError LispVal readProc [] = readProc [Port stdin]
82
readProc [] = readProc [Port stdin]
35
false
true
0
7
11
35
17
18
null
null
bixuanzju/fcore
lib/Desugar.hs
bsd-2-clause
transType _ Unit = F.Unit
33
transType _ Unit = F.Unit
33
transType _ Unit = F.Unit
33
false
false
0
5
12
13
6
7
null
null
jacekszymanski/wxHaskell
wxcore/src/haskell/Graphics/UI/WXCore/WxcDefs.hs
lgpl-2.1
wxLANGUAGE_ARABIC_LEBANON :: Int wxLANGUAGE_ARABIC_LEBANON = 14
63
wxLANGUAGE_ARABIC_LEBANON :: Int wxLANGUAGE_ARABIC_LEBANON = 14
63
wxLANGUAGE_ARABIC_LEBANON = 14
30
false
true
0
4
5
11
6
5
null
null
keera-studios/pang-a-lambda
src/Game/Levels.hs
gpl-3.0
objBlocks 3 = [ oscillatingBlock "block1" (324, 200) (100, 57) 200 6 0 0 , oscillatingBlock "block2" (700, 200) (100, 57) 200 6 100 10 ]
169
objBlocks 3 = [ oscillatingBlock "block1" (324, 200) (100, 57) 200 6 0 0 , oscillatingBlock "block2" (700, 200) (100, 57) 200 6 100 10 ]
169
objBlocks 3 = [ oscillatingBlock "block1" (324, 200) (100, 57) 200 6 0 0 , oscillatingBlock "block2" (700, 200) (100, 57) 200 6 100 10 ]
169
false
false
1
8
58
73
38
35
null
null
arybczak/haskell-mcl
src/MCL/Internal/Field.hs
bsd-3-clause
negateFp :: forall fp. HasArith fp => fp -> fp negateFp = unsafeOp1_ $ c_negate (proxy# :: Proxy# fp)
101
negateFp :: forall fp. HasArith fp => fp -> fp negateFp = unsafeOp1_ $ c_negate (proxy# :: Proxy# fp)
101
negateFp = unsafeOp1_ $ c_negate (proxy# :: Proxy# fp)
54
false
true
2
9
18
50
23
27
null
null
ghc-android/ghc
compiler/ghci/ByteCodeGen.hs
bsd-3-clause
isVAtom :: AnnExpr' Var ann -> Bool isVAtom e | Just e' <- bcView e = isVAtom e'
80
isVAtom :: AnnExpr' Var ann -> Bool isVAtom e | Just e' <- bcView e = isVAtom e'
80
isVAtom e | Just e' <- bcView e = isVAtom e'
44
false
true
0
9
17
47
19
28
null
null
d12frosted/optparse-applicative-kb
tests/Tests.hs
bsd-3-clause
case_show_default :: Assertion case_show_default = do let p = option auto ( short 'n' <> help "set count" <> value (0 :: Int) <> showDefault ) i = info (p <**> helper) idm result = run i ["--help"] case result of Failure failure -> do let (msg, _) = renderFailure failure "test" assertHasLine " -n ARG set count (default: 0)" msg Success r -> assertFailure $ "unexpected result: " ++ show r CompletionInvoked _ -> assertFailure "unexpected completion"
566
case_show_default :: Assertion case_show_default = do let p = option auto ( short 'n' <> help "set count" <> value (0 :: Int) <> showDefault ) i = info (p <**> helper) idm result = run i ["--help"] case result of Failure failure -> do let (msg, _) = renderFailure failure "test" assertHasLine " -n ARG set count (default: 0)" msg Success r -> assertFailure $ "unexpected result: " ++ show r CompletionInvoked _ -> assertFailure "unexpected completion"
566
case_show_default = do let p = option auto ( short 'n' <> help "set count" <> value (0 :: Int) <> showDefault ) i = info (p <**> helper) idm result = run i ["--help"] case result of Failure failure -> do let (msg, _) = renderFailure failure "test" assertHasLine " -n ARG set count (default: 0)" msg Success r -> assertFailure $ "unexpected result: " ++ show r CompletionInvoked _ -> assertFailure "unexpected completion"
535
false
true
0
15
192
162
77
85
null
null
softwaremechanic/Miscellaneous
Haskell/Circular_convolution.hs
gpl-2.0
circShiftL :: [a] -> [a] circShiftL [] = []
43
circShiftL :: [a] -> [a] circShiftL [] = []
43
circShiftL [] = []
18
false
true
0
6
8
28
15
13
null
null
ambiata/highlighting-kate
Text/Highlighting/Kate/Syntax/Html.hs
gpl-2.0
regex_'3caside'5cb = compileRegex True "<aside\\b"
50
regex_'3caside'5cb = compileRegex True "<aside\\b"
50
regex_'3caside'5cb = compileRegex True "<aside\\b"
50
false
false
0
5
4
11
5
6
null
null
infotroph/pandoc
src/Text/Pandoc/Writers/Custom.hs
gpl-2.0
inlineToCustom lua (SmallCaps lst) = callfunc lua "SmallCaps" lst
65
inlineToCustom lua (SmallCaps lst) = callfunc lua "SmallCaps" lst
65
inlineToCustom lua (SmallCaps lst) = callfunc lua "SmallCaps" lst
65
false
false
0
7
8
24
11
13
null
null
amccausl/Swish
Swish/HaskellRDF/BuiltInMapTest.hs
lgpl-2.1
testVarMod01 = testJust "testVarMod01" $ findRDFOpenVarBindingModifier (swishName "rdfVarBindingUriRef")
109
testVarMod01 = testJust "testVarMod01" $ findRDFOpenVarBindingModifier (swishName "rdfVarBindingUriRef")
109
testVarMod01 = testJust "testVarMod01" $ findRDFOpenVarBindingModifier (swishName "rdfVarBindingUriRef")
109
false
false
0
8
12
22
10
12
null
null
alexander-at-github/eta
libraries/base/GHC/IO/Exception.hs
bsd-3-clause
ioException :: IOException -> IO a ioException err = throwIO err
68
ioException :: IOException -> IO a ioException err = throwIO err
68
ioException err = throwIO err
29
false
true
0
6
14
24
11
13
null
null
aardvarrk/hlibuv
src/Network/UV.hs
bsd-3-clause
createLoop :: IO Loop createLoop = do ptr <- c_uv_loop_new return $ Loop ptr -- | Run the given loop.
110
createLoop :: IO Loop createLoop = do ptr <- c_uv_loop_new return $ Loop ptr -- | Run the given loop.
110
createLoop = do ptr <- c_uv_loop_new return $ Loop ptr -- | Run the given loop.
88
false
true
0
9
28
38
16
22
null
null
andreasabel/helf
src/Monolith.hs
mit
eid = abs "A" $ abs "x" $ var' "x"
34
eid = abs "A" $ abs "x" $ var' "x"
34
eid = abs "A" $ abs "x" $ var' "x"
34
false
false
1
7
9
26
10
16
null
null
jfischoff/repa-image
src/Resizer.hs
bsd-3-clause
main = execParser opts >>= run
30
main = execParser opts >>= run
30
main = execParser opts >>= run
30
false
false
1
6
5
17
6
11
null
null
whittle/euler
src/Euler/Problem030.hs
mit
hasDigits 0 _ = False
21
hasDigits 0 _ = False
21
hasDigits 0 _ = False
21
false
false
0
5
4
11
5
6
null
null
siddhanathan/ghc
testsuite/tests/rename/should_compile/timing001.hs
bsd-3-clause
a419 = a420
11
a419 = a420
11
a419 = a420
11
false
false
1
5
2
10
3
7
null
null
sopvop/cabal
Cabal/Distribution/Simple/SrcDist.hs
bsd-3-clause
prepareTree :: Verbosity -- ^verbosity -> PackageDescription -- ^info from the cabal file -> Maybe LocalBuildInfo -> FilePath -- ^source tree to populate -> [PPSuffixHandler] -- ^extra preprocessors (includes suffixes) -> IO () prepareTree verbosity pkg_descr0 mb_lbi targetDir pps = do -- If the package was configured then we can run platform-independent -- pre-processors and include those generated files. case mb_lbi of Just lbi | not (null pps) -> do let lbi' = lbi{ buildDir = targetDir </> buildDir lbi } withAllComponentsInBuildOrder pkg_descr lbi' $ \c clbi -> preprocessComponent pkg_descr c lbi' clbi True verbosity pps _ -> return () (ordinary, mExecutable) <- listPackageSources verbosity pkg_descr0 pps installOrdinaryFiles verbosity targetDir (zip (repeat []) ordinary) installMaybeExecutableFiles verbosity targetDir (zip (repeat []) mExecutable) maybeCreateDefaultSetupScript targetDir where pkg_descr = filterAutogenModules pkg_descr0 -- | Find the setup script file, if it exists.
1,139
prepareTree :: Verbosity -- ^verbosity -> PackageDescription -- ^info from the cabal file -> Maybe LocalBuildInfo -> FilePath -- ^source tree to populate -> [PPSuffixHandler] -- ^extra preprocessors (includes suffixes) -> IO () prepareTree verbosity pkg_descr0 mb_lbi targetDir pps = do -- If the package was configured then we can run platform-independent -- pre-processors and include those generated files. case mb_lbi of Just lbi | not (null pps) -> do let lbi' = lbi{ buildDir = targetDir </> buildDir lbi } withAllComponentsInBuildOrder pkg_descr lbi' $ \c clbi -> preprocessComponent pkg_descr c lbi' clbi True verbosity pps _ -> return () (ordinary, mExecutable) <- listPackageSources verbosity pkg_descr0 pps installOrdinaryFiles verbosity targetDir (zip (repeat []) ordinary) installMaybeExecutableFiles verbosity targetDir (zip (repeat []) mExecutable) maybeCreateDefaultSetupScript targetDir where pkg_descr = filterAutogenModules pkg_descr0 -- | Find the setup script file, if it exists.
1,139
prepareTree verbosity pkg_descr0 mb_lbi targetDir pps = do -- If the package was configured then we can run platform-independent -- pre-processors and include those generated files. case mb_lbi of Just lbi | not (null pps) -> do let lbi' = lbi{ buildDir = targetDir </> buildDir lbi } withAllComponentsInBuildOrder pkg_descr lbi' $ \c clbi -> preprocessComponent pkg_descr c lbi' clbi True verbosity pps _ -> return () (ordinary, mExecutable) <- listPackageSources verbosity pkg_descr0 pps installOrdinaryFiles verbosity targetDir (zip (repeat []) ordinary) installMaybeExecutableFiles verbosity targetDir (zip (repeat []) mExecutable) maybeCreateDefaultSetupScript targetDir where pkg_descr = filterAutogenModules pkg_descr0 -- | Find the setup script file, if it exists.
831
false
true
1
19
276
256
121
135
null
null
mightymoose/liquidhaskell
benchmarks/xmonad-0.11/XMonad/StackSet.hs
bsd-3-clause
-- | /O(1) on current window, O(n) in general/. -- Return 'Just' the workspace tag of the given window, or 'Nothing' -- if the window is not in the 'StackSet'. findTag :: Eq a => a -> StackSet i l a s sd -> Maybe i findTag a s = listToMaybe [ tag w | w <- workspaces s, has a (stack w) ] where has _ Nothing = False has x (Just (Stack t l r)) = x `elem` (t : l ++ r) -- --------------------------------------------------------------------- -- $modifyStackset -- | -- /O(n)/. (Complexity due to duplicate check). Insert a new element -- into the stack, above the currently focused element. The new -- element is given focus; the previously focused element is moved -- down. -- -- If the element is already in the stackset, the original stackset is -- returned unmodified. -- -- Semantics in Huet's paper is that insert doesn't move the cursor. -- However, we choose to insert above, and move the focus. -- {-@ insertUp :: Eq a => a -> StackSet i l a s sd -> StackSet i l a s sd @-}
1,008
findTag :: Eq a => a -> StackSet i l a s sd -> Maybe i findTag a s = listToMaybe [ tag w | w <- workspaces s, has a (stack w) ] where has _ Nothing = False has x (Just (Stack t l r)) = x `elem` (t : l ++ r) -- --------------------------------------------------------------------- -- $modifyStackset -- | -- /O(n)/. (Complexity due to duplicate check). Insert a new element -- into the stack, above the currently focused element. The new -- element is given focus; the previously focused element is moved -- down. -- -- If the element is already in the stackset, the original stackset is -- returned unmodified. -- -- Semantics in Huet's paper is that insert doesn't move the cursor. -- However, we choose to insert above, and move the focus. -- {-@ insertUp :: Eq a => a -> StackSet i l a s sd -> StackSet i l a s sd @-}
848
findTag a s = listToMaybe [ tag w | w <- workspaces s, has a (stack w) ] where has _ Nothing = False has x (Just (Stack t l r)) = x `elem` (t : l ++ r) -- --------------------------------------------------------------------- -- $modifyStackset -- | -- /O(n)/. (Complexity due to duplicate check). Insert a new element -- into the stack, above the currently focused element. The new -- element is given focus; the previously focused element is moved -- down. -- -- If the element is already in the stackset, the original stackset is -- returned unmodified. -- -- Semantics in Huet's paper is that insert doesn't move the cursor. -- However, we choose to insert above, and move the focus. -- {-@ insertUp :: Eq a => a -> StackSet i l a s sd -> StackSet i l a s sd @-}
793
true
true
1
10
217
159
85
74
null
null
geigerzaehler/pladen
Pladen/Tar.hs
mit
defPerm :: Word32 defPerm = 0o664
33
defPerm :: Word32 defPerm = 0o664
33
defPerm = 0o664
15
false
true
0
4
5
11
6
5
null
null
Teaspot-Studio/Urho3D-Haskell
src/Graphics/Urho3D/Resource/Image.hs
mit
imageGetComponents :: (Pointer p a, Parent Image a, MonadIO m) => p -- ^ Pointer to image or child -> m Word imageGetComponents p = liftIO $ do let ptr = parentPointer p fromIntegral <$> [C.exp| int {$(Image* ptr)->GetComponents()} |] -- | Return number of color components..
284
imageGetComponents :: (Pointer p a, Parent Image a, MonadIO m) => p -- ^ Pointer to image or child -> m Word imageGetComponents p = liftIO $ do let ptr = parentPointer p fromIntegral <$> [C.exp| int {$(Image* ptr)->GetComponents()} |] -- | Return number of color components..
284
imageGetComponents p = liftIO $ do let ptr = parentPointer p fromIntegral <$> [C.exp| int {$(Image* ptr)->GetComponents()} |] -- | Return number of color components..
171
false
true
0
11
55
78
40
38
null
null
sjakobi/heist
src/Heist/Internal/Types/HeistState.hs
bsd-3-clause
------------------------------------------------------------------------------ -- | Evaluates a template monad as a computation in the underlying monad. evalHeistT :: (Monad m) => HeistT n m a -> X.Node -> HeistState n -> m a evalHeistT m r s = do (a, _) <- runHeistT m r s return a
335
evalHeistT :: (Monad m) => HeistT n m a -> X.Node -> HeistState n -> m a evalHeistT m r s = do (a, _) <- runHeistT m r s return a
182
evalHeistT m r s = do (a, _) <- runHeistT m r s return a
65
true
true
0
9
98
82
40
42
null
null
trskop/cabal
cabal-install/Distribution/Client/Setup.hs
bsd-3-clause
-- 'cabal unpack' is a deprecated alias for 'cabal get'. unpackCommand :: CommandUI GetFlags unpackCommand = getCommand { commandName = "unpack", commandUsage = usagePackages "unpack" }
192
unpackCommand :: CommandUI GetFlags unpackCommand = getCommand { commandName = "unpack", commandUsage = usagePackages "unpack" }
135
unpackCommand = getCommand { commandName = "unpack", commandUsage = usagePackages "unpack" }
99
true
true
0
7
32
32
18
14
null
null
siddhanathan/ghc
ghc/Main.hs
bsd-3-clause
showSupportedExtensionsMode = mkPreStartupMode ShowSupportedExtensions
70
showSupportedExtensionsMode = mkPreStartupMode ShowSupportedExtensions
70
showSupportedExtensionsMode = mkPreStartupMode ShowSupportedExtensions
70
false
false
0
5
3
9
4
5
null
null
alpicola/mel
src/Backend/PrettyPrint.hs
mit
ppInst (LExtCall s ns) = write $ ('%' : s) ++ " " ++ intercalate ", " (map show ns)
85
ppInst (LExtCall s ns) = write $ ('%' : s) ++ " " ++ intercalate ", " (map show ns)
85
ppInst (LExtCall s ns) = write $ ('%' : s) ++ " " ++ intercalate ", " (map show ns)
85
false
false
0
9
21
49
24
25
null
null
mrkkrp/stack
src/Stack/Docker.hs
bsd-3-clause
pullImage :: (MonadLogger m,MonadIO m,MonadThrow m) => EnvOverride -> DockerOpts -> String -> m () pullImage envOverride docker image = do $logInfo (concatT ["Pulling image from registry: '",image,"'"]) when (dockerRegistryLogin docker) (do $logInfo "You may need to log in." callProcess $ Cmd Nothing "docker" envOverride (concat [["login"] ,maybe [] (\n -> ["--username=" ++ n]) (dockerRegistryUsername docker) ,maybe [] (\p -> ["--password=" ++ p]) (dockerRegistryPassword docker) ,[takeWhile (/= '/') image]])) -- We redirect the stdout of the process to stderr so that the output -- of @docker pull@ will not interfere with the output of other -- commands when using --auto-docker-pull. See issue #2733. let stdoutToStderr cp = cp { std_out = UseHandle stderr , std_err = UseHandle stderr , std_in = CreatePipe } (Just hin, _, _, ph) <- createProcess' "pullImage" stdoutToStderr $ Cmd Nothing "docker" envOverride ["pull",image] liftIO (hClose hin) ec <- liftIO (waitForProcess ph) case ec of ExitSuccess -> return () ExitFailure _ -> throwM (PullFailedException image) -- | Check docker version (throws exception if incorrect)
1,419
pullImage :: (MonadLogger m,MonadIO m,MonadThrow m) => EnvOverride -> DockerOpts -> String -> m () pullImage envOverride docker image = do $logInfo (concatT ["Pulling image from registry: '",image,"'"]) when (dockerRegistryLogin docker) (do $logInfo "You may need to log in." callProcess $ Cmd Nothing "docker" envOverride (concat [["login"] ,maybe [] (\n -> ["--username=" ++ n]) (dockerRegistryUsername docker) ,maybe [] (\p -> ["--password=" ++ p]) (dockerRegistryPassword docker) ,[takeWhile (/= '/') image]])) -- We redirect the stdout of the process to stderr so that the output -- of @docker pull@ will not interfere with the output of other -- commands when using --auto-docker-pull. See issue #2733. let stdoutToStderr cp = cp { std_out = UseHandle stderr , std_err = UseHandle stderr , std_in = CreatePipe } (Just hin, _, _, ph) <- createProcess' "pullImage" stdoutToStderr $ Cmd Nothing "docker" envOverride ["pull",image] liftIO (hClose hin) ec <- liftIO (waitForProcess ph) case ec of ExitSuccess -> return () ExitFailure _ -> throwM (PullFailedException image) -- | Check docker version (throws exception if incorrect)
1,419
pullImage envOverride docker image = do $logInfo (concatT ["Pulling image from registry: '",image,"'"]) when (dockerRegistryLogin docker) (do $logInfo "You may need to log in." callProcess $ Cmd Nothing "docker" envOverride (concat [["login"] ,maybe [] (\n -> ["--username=" ++ n]) (dockerRegistryUsername docker) ,maybe [] (\p -> ["--password=" ++ p]) (dockerRegistryPassword docker) ,[takeWhile (/= '/') image]])) -- We redirect the stdout of the process to stderr so that the output -- of @docker pull@ will not interfere with the output of other -- commands when using --auto-docker-pull. See issue #2733. let stdoutToStderr cp = cp { std_out = UseHandle stderr , std_err = UseHandle stderr , std_in = CreatePipe } (Just hin, _, _, ph) <- createProcess' "pullImage" stdoutToStderr $ Cmd Nothing "docker" envOverride ["pull",image] liftIO (hClose hin) ec <- liftIO (waitForProcess ph) case ec of ExitSuccess -> return () ExitFailure _ -> throwM (PullFailedException image) -- | Check docker version (throws exception if incorrect)
1,310
false
true
0
20
454
363
184
179
null
null
wangbj/haskell
venom.hs
bsd-2-clause
--readi3 = snd . readj3 pr = foldr p1 "" where p1 x = shows x . showString "\n" p1 :: Int64 -> ShowS {-# INLINE p1 #-}
137
pr = foldr p1 "" where p1 x = shows x . showString "\n" p1 :: Int64 -> ShowS {-# INLINE p1 #-}
113
pr = foldr p1 "" where p1 x = shows x . showString "\n" p1 :: Int64 -> ShowS {-# INLINE p1 #-}
113
true
false
0
6
46
42
21
21
null
null
siddhanathan/ghc
compiler/typecheck/TcRnTypes.hs
bsd-3-clause
pprSkolInfo :: SkolemInfo -> SDoc -- Complete the sentence "is a rigid type variable bound by..." pprSkolInfo (SigSkol ctxt ty) = pprSigSkolInfo ctxt ty
152
pprSkolInfo :: SkolemInfo -> SDoc pprSkolInfo (SigSkol ctxt ty) = pprSigSkolInfo ctxt ty
88
pprSkolInfo (SigSkol ctxt ty) = pprSigSkolInfo ctxt ty
54
true
true
0
7
23
32
16
16
null
null
green-haskell/ghc
libraries/base/GHC/Conc/Sync.hs
bsd-3-clause
par :: a -> b -> b par x y = case (par# x) of { _ -> lazy y }
62
par :: a -> b -> b par x y = case (par# x) of { _ -> lazy y }
62
par x y = case (par# x) of { _ -> lazy y }
43
false
true
0
8
21
45
23
22
null
null
abesto/brainfuck-hs
Brainfuck.hs
mit
calcDepth :: String -> Int -> [Int] calcDepth ('[':s) n = n : (calcDepth s $ n + 1)
83
calcDepth :: String -> Int -> [Int] calcDepth ('[':s) n = n : (calcDepth s $ n + 1)
83
calcDepth ('[':s) n = n : (calcDepth s $ n + 1)
47
false
true
0
9
18
52
27
25
null
null
kazu-yamamoto/cab
Distribution/Cab/Commands.hs
bsd-3-clause
lookupPkg [name,ver] db = checkOne $ lookupByVersion name ver db
64
lookupPkg [name,ver] db = checkOne $ lookupByVersion name ver db
64
lookupPkg [name,ver] db = checkOne $ lookupByVersion name ver db
64
false
false
1
7
9
31
14
17
null
null
alios/lcars
Lcars/DHT/Servers.hs
bsd-3-clause
dhtLocalServer :: LocalServer DhtLocalServerState dhtLocalServer = defaultServer
80
dhtLocalServer :: LocalServer DhtLocalServerState dhtLocalServer = defaultServer
80
dhtLocalServer = defaultServer
30
false
true
0
5
6
14
7
7
null
null
keithodulaigh/Hets
CommonLogic/Sign.hs
gpl-2.0
-- | pretty printing for Signatures printSign :: Sign -> Doc printSign s = vsep [ text "%{" , text "discourseNames: " <+> sepByCommas (map pretty $ Set.toList $ discourseNames s) , text "nondiscourseNames: " <+> sepByCommas (map pretty $ Set.toList $ nondiscourseNames s) , text "sequenceMarkers: " <+> sepByCommas (map pretty $ Set.toList $ sequenceMarkers s) , text "}%"]
433
printSign :: Sign -> Doc printSign s = vsep [ text "%{" , text "discourseNames: " <+> sepByCommas (map pretty $ Set.toList $ discourseNames s) , text "nondiscourseNames: " <+> sepByCommas (map pretty $ Set.toList $ nondiscourseNames s) , text "sequenceMarkers: " <+> sepByCommas (map pretty $ Set.toList $ sequenceMarkers s) , text "}%"]
397
printSign s = vsep [ text "%{" , text "discourseNames: " <+> sepByCommas (map pretty $ Set.toList $ discourseNames s) , text "nondiscourseNames: " <+> sepByCommas (map pretty $ Set.toList $ nondiscourseNames s) , text "sequenceMarkers: " <+> sepByCommas (map pretty $ Set.toList $ sequenceMarkers s) , text "}%"]
372
true
true
0
12
119
130
62
68
null
null
brendanhay/gogol
gogol-partners/gen/Network/Google/Resource/Partners/Users/UpdateProFile.hs
mpl-2.0
-- | Logged-in user ID to impersonate instead of the user\'s ID. uupfRequestMetadataUserOverridesUserId :: Lens' UsersUpdateProFile (Maybe Text) uupfRequestMetadataUserOverridesUserId = lens _uupfRequestMetadataUserOverridesUserId (\ s a -> s{_uupfRequestMetadataUserOverridesUserId = a})
305
uupfRequestMetadataUserOverridesUserId :: Lens' UsersUpdateProFile (Maybe Text) uupfRequestMetadataUserOverridesUserId = lens _uupfRequestMetadataUserOverridesUserId (\ s a -> s{_uupfRequestMetadataUserOverridesUserId = a})
240
uupfRequestMetadataUserOverridesUserId = lens _uupfRequestMetadataUserOverridesUserId (\ s a -> s{_uupfRequestMetadataUserOverridesUserId = a})
160
true
true
0
9
45
48
25
23
null
null
raymoo/NEET
src/Neet/Network.hs
gpl-3.0
stepNetwork :: Network -> [Double] -> Network stepNetwork net@Network{..} ins = net { netState = newNeurons } where pairs = zipWith (\x y -> (getNodeId x, y)) netInputs (ins ++ [1]) acts = IM.map activation netState -- | The previous state, except updated to have new inputs modState = foldl' (flip $ uncurry IM.insert) acts pairs newNeurons = IM.map (stepNeuron modState) netState -- | Steps a network for at least its depth
464
stepNetwork :: Network -> [Double] -> Network stepNetwork net@Network{..} ins = net { netState = newNeurons } where pairs = zipWith (\x y -> (getNodeId x, y)) netInputs (ins ++ [1]) acts = IM.map activation netState -- | The previous state, except updated to have new inputs modState = foldl' (flip $ uncurry IM.insert) acts pairs newNeurons = IM.map (stepNeuron modState) netState -- | Steps a network for at least its depth
464
stepNetwork net@Network{..} ins = net { netState = newNeurons } where pairs = zipWith (\x y -> (getNodeId x, y)) netInputs (ins ++ [1]) acts = IM.map activation netState -- | The previous state, except updated to have new inputs modState = foldl' (flip $ uncurry IM.insert) acts pairs newNeurons = IM.map (stepNeuron modState) netState -- | Steps a network for at least its depth
418
false
true
8
9
110
160
78
82
null
null
JoeLoser/CS4450-Principles-of-Programming
homeworks/hw5/hw5_sdk/ImpInterp.hs
mit
parseFunctionDefs :: [FunDefn] -> String parseFunctionDefs = concatMap parseFunctionDef
88
parseFunctionDefs :: [FunDefn] -> String parseFunctionDefs = concatMap parseFunctionDef
87
parseFunctionDefs = concatMap parseFunctionDef
46
false
true
0
6
9
21
11
10
null
null
SaneApp/hedis-simple
src/Database/Redis/Simple.hs
mit
incrBy :: (R.RedisCtx mi r, WrappedRedis m mi r) => ByteString -> Integer -> m Integer incrBy k = wrap . R.incrby k
115
incrBy :: (R.RedisCtx mi r, WrappedRedis m mi r) => ByteString -> Integer -> m Integer incrBy k = wrap . R.incrby k
115
incrBy k = wrap . R.incrby k
28
false
true
0
8
22
57
28
29
null
null
ekmett/transformers
Control/Monad/Trans/RWS/Lazy.hs
bsd-3-clause
-- | Unwrap an RWS computation as a function. -- (The inverse of 'rws'.) runRWS :: RWS r w s a -> r -> s -> (a, s, w) runRWS m r s = runIdentity (runRWST m r s)
160
runRWS :: RWS r w s a -> r -> s -> (a, s, w) runRWS m r s = runIdentity (runRWST m r s)
87
runRWS m r s = runIdentity (runRWST m r s)
42
true
true
0
8
38
63
33
30
null
null
emwap/feldspar-language
src/Feldspar/Core/Constructs/Tuple.hs
bsd-3-clause
sel3Size Tup14Type{} = $(proj 14 2)
35
sel3Size Tup14Type{} = $(proj 14 2)
35
sel3Size Tup14Type{} = $(proj 14 2)
35
false
false
0
7
5
22
10
12
null
null
kajigor/uKanren_transformations
test/resources/Program/List.hs
bsd-3-clause
(%) :: Term a -> Term a -> Term a x % y = C "Cons" [x, y]
57
(%) :: Term a -> Term a -> Term a x % y = C "Cons" [x, y]
57
x % y = C "Cons" [x, y]
23
false
true
0
9
17
51
24
27
null
null
apoorvingle/h-reversi
test/MovePropSpec.hs
mit
discIncSpec :: Spec discIncSpec = describe "Disc Increment Property" $ it "Total increase in no. of discs should be equal to one" $ property $ forAll (arbitrary :: Gen GameState) $ \gs -> prop_disc_inc gs
223
discIncSpec :: Spec discIncSpec = describe "Disc Increment Property" $ it "Total increase in no. of discs should be equal to one" $ property $ forAll (arbitrary :: Gen GameState) $ \gs -> prop_disc_inc gs
223
discIncSpec = describe "Disc Increment Property" $ it "Total increase in no. of discs should be equal to one" $ property $ forAll (arbitrary :: Gen GameState) $ \gs -> prop_disc_inc gs
203
false
true
4
9
53
55
26
29
null
null
lukexi/ghc-7.8-arm64
compiler/llvmGen/LlvmCodeGen.hs
bsd-3-clause
cmmDataLlvmGens :: [(Section,CmmStatics)] -> LlvmM () cmmDataLlvmGens statics = do lmdatas <- mapM genLlvmData statics let (gss, tss) = unzip lmdatas let regGlobal (LMGlobal (LMGlobalVar l ty _ _ _ _) _) = funInsert l ty regGlobal _ = return () mapM_ regGlobal (concat gss) gss' <- mapM aliasify $ concat gss renderLlvm $ pprLlvmData (concat gss', concat tss) -- | Complete LLVM code generation phase for a single top-level chunk of Cmm.
516
cmmDataLlvmGens :: [(Section,CmmStatics)] -> LlvmM () cmmDataLlvmGens statics = do lmdatas <- mapM genLlvmData statics let (gss, tss) = unzip lmdatas let regGlobal (LMGlobal (LMGlobalVar l ty _ _ _ _) _) = funInsert l ty regGlobal _ = return () mapM_ regGlobal (concat gss) gss' <- mapM aliasify $ concat gss renderLlvm $ pprLlvmData (concat gss', concat tss) -- | Complete LLVM code generation phase for a single top-level chunk of Cmm.
515
cmmDataLlvmGens statics = do lmdatas <- mapM genLlvmData statics let (gss, tss) = unzip lmdatas let regGlobal (LMGlobal (LMGlobalVar l ty _ _ _ _) _) = funInsert l ty regGlobal _ = return () mapM_ regGlobal (concat gss) gss' <- mapM aliasify $ concat gss renderLlvm $ pprLlvmData (concat gss', concat tss) -- | Complete LLVM code generation phase for a single top-level chunk of Cmm.
461
false
true
0
15
151
176
81
95
null
null
nathyong/microghc-ghc
compiler/typecheck/TcType.hs
bsd-3-clause
tcTyVarsOfType (LitTy {}) = emptyVarSet
49
tcTyVarsOfType (LitTy {}) = emptyVarSet
49
tcTyVarsOfType (LitTy {}) = emptyVarSet
49
false
false
0
6
14
17
8
9
null
null
mgaut72/cbf
src/Language/BrainFuck/Compile.hs
mit
convert Sub = "mem[p]--\n"
31
convert Sub = "mem[p]--\n"
31
convert Sub = "mem[p]--\n"
31
false
false
0
5
8
9
4
5
null
null
bendmorris/scotch
Scotch/Eval/Calc.hs
gpl-3.0
vdiv _ (Val (NumInt a)) (Val (NumInt 0)) = div_by_zero
54
vdiv _ (Val (NumInt a)) (Val (NumInt 0)) = div_by_zero
54
vdiv _ (Val (NumInt a)) (Val (NumInt 0)) = div_by_zero
54
false
false
1
8
9
41
18
23
null
null
kawu/ltag
src/NLP/LTAG/Early4.hs
bsd-2-clause
expectEnd :: (Ord n, Ord t) => Lab n t -> Pos -> P.ListT (Earley n t) (State n t) expectEnd x i = do EarSt{..} <- lift RWS.get listValues (x, i) doneExpEnd -- | Return all completed states with: -- * the given root non-terminal value -- * the given span
267
expectEnd :: (Ord n, Ord t) => Lab n t -> Pos -> P.ListT (Earley n t) (State n t) expectEnd x i = do EarSt{..} <- lift RWS.get listValues (x, i) doneExpEnd -- | Return all completed states with: -- * the given root non-terminal value -- * the given span
267
expectEnd x i = do EarSt{..} <- lift RWS.get listValues (x, i) doneExpEnd -- | Return all completed states with: -- * the given root non-terminal value -- * the given span
177
false
true
0
11
65
107
52
55
null
null
brendanhay/gogol
gogol-doubleclick-bids/gen/Network/Google/Resource/DoubleClickBidManager/Lineitems/Uploadlineitems.hs
mpl-2.0
-- | Creates a value of 'LineitemsUploadlineitems' with the minimum fields required to make a request. -- -- Use one of the following lenses to modify other fields as desired: -- -- * 'luXgafv' -- -- * 'luUploadProtocol' -- -- * 'luAccessToken' -- -- * 'luUploadType' -- -- * 'luPayload' -- -- * 'luCallback' lineitemsUploadlineitems :: UploadLineItemsRequest -- ^ 'luPayload' -> LineitemsUploadlineitems lineitemsUploadlineitems pLuPayload_ = LineitemsUploadlineitems' { _luXgafv = Nothing , _luUploadProtocol = Nothing , _luAccessToken = Nothing , _luUploadType = Nothing , _luPayload = pLuPayload_ , _luCallback = Nothing }
664
lineitemsUploadlineitems :: UploadLineItemsRequest -- ^ 'luPayload' -> LineitemsUploadlineitems lineitemsUploadlineitems pLuPayload_ = LineitemsUploadlineitems' { _luXgafv = Nothing , _luUploadProtocol = Nothing , _luAccessToken = Nothing , _luUploadType = Nothing , _luPayload = pLuPayload_ , _luCallback = Nothing }
355
lineitemsUploadlineitems pLuPayload_ = LineitemsUploadlineitems' { _luXgafv = Nothing , _luUploadProtocol = Nothing , _luAccessToken = Nothing , _luUploadType = Nothing , _luPayload = pLuPayload_ , _luCallback = Nothing }
251
true
true
0
7
128
81
52
29
null
null
ShellShoccar-jpn/Open-usp-Tukubai
COMMANDS.HS/cjoin2.hs
mit
mainProc :: String -> String -> String -> String -> IO () mainProc delim key master tran = do ms <- readF master ts <- readF tran mainProc' (parseKey key) ms ts (readDelim delim)
250
mainProc :: String -> String -> String -> String -> IO () mainProc delim key master tran = do ms <- readF master ts <- readF tran mainProc' (parseKey key) ms ts (readDelim delim)
250
mainProc delim key master tran = do ms <- readF master ts <- readF tran mainProc' (parseKey key) ms ts (readDelim delim)
192
false
true
0
11
105
90
40
50
null
null
rootzlevel/hlwm-haskell
examples/HerbstClient.hs
bsd-2-clause
withQConnection :: Quiet -> a -> (HerbstConnection -> IO a) -> IO a withQConnection q x f = withConnection f >>= \case Nothing -> case q of Quiet True -> return x Quiet False -> hPutStrLn stderr "Could not connect to server" >> return x Just y -> return y
268
withQConnection :: Quiet -> a -> (HerbstConnection -> IO a) -> IO a withQConnection q x f = withConnection f >>= \case Nothing -> case q of Quiet True -> return x Quiet False -> hPutStrLn stderr "Could not connect to server" >> return x Just y -> return y
268
withQConnection q x f = withConnection f >>= \case Nothing -> case q of Quiet True -> return x Quiet False -> hPutStrLn stderr "Could not connect to server" >> return x Just y -> return y
200
false
true
0
13
62
107
49
58
null
null
andyarvanitis/Idris-dev
src/Idris/IBC.hs
bsd-3-clause
ibc i (IBCLineApp fp l t) f = return f { ibc_lineapps = (fp,l,t) : ibc_lineapps f }
88
ibc i (IBCLineApp fp l t) f = return f { ibc_lineapps = (fp,l,t) : ibc_lineapps f }
88
ibc i (IBCLineApp fp l t) f = return f { ibc_lineapps = (fp,l,t) : ibc_lineapps f }
88
false
false
1
9
22
59
27
32
null
null
lfairy/nationstates
NationStates/Core.hs
apache-2.0
-- | The version of the NationStates API used by this package. -- -- Every request to NationStates includes this number. This means that -- if the response format changes, existing code will continue to work -- under the old API. -- -- This number should match the current API version, as given by -- <https://www.nationstates.net/cgi-bin/api.cgi?a=version>. If not, -- please file an issue. apiVersion :: Integer apiVersion = 7
428
apiVersion :: Integer apiVersion = 7
36
apiVersion = 7
14
true
true
0
4
68
20
15
5
null
null
rahulmutt/ghcvm
compiler/Eta/BasicTypes/Literal.hs
bsd-3-clause
isZeroLit _ = False
32
isZeroLit _ = False
32
isZeroLit _ = False
32
false
false
0
5
16
9
4
5
null
null
kim/amazonka
amazonka-codedeploy/gen/Network/AWS/CodeDeploy/ListApplicationRevisions.hs
mpl-2.0
-- | An identifier that was returned from the previous list application revisions -- call, which can be used to return the next set of applications in the list. larNextToken :: Lens' ListApplicationRevisions (Maybe Text) larNextToken = lens _larNextToken (\s a -> s { _larNextToken = a })
288
larNextToken :: Lens' ListApplicationRevisions (Maybe Text) larNextToken = lens _larNextToken (\s a -> s { _larNextToken = a })
127
larNextToken = lens _larNextToken (\s a -> s { _larNextToken = a })
67
true
true
0
9
47
47
26
21
null
null
naoto-ogawa/h-xproto-mysql
src/DataBase/MySQLX/Model.hs
mit
getInsert :: (MonadThrow m) => B.ByteString -> m PI.Insert getInsert = getMessage
168
getInsert :: (MonadThrow m) => B.ByteString -> m PI.Insert getInsert = getMessage
139
getInsert = getMessage
51
false
true
0
8
98
31
16
15
null
null
bitemyapp/pronunciations
src/Pronunciations.hs
bsd-3-clause
getWord :: Word -> Text getWord (Word word) = word
62
getWord :: Word -> Text getWord (Word word) = word
62
getWord (Word word) = word
38
false
true
0
7
21
24
12
12
null
null
ssaavedra/liquidhaskell
benchmarks/containers-0.5.0.0/benchmarks/Map.hs
bsd-3-clause
maybeDel :: Int -> Maybe Int maybeDel n | n `mod` 3 == 0 = Nothing | otherwise = Just n
103
maybeDel :: Int -> Maybe Int maybeDel n | n `mod` 3 == 0 = Nothing | otherwise = Just n
103
maybeDel n | n `mod` 3 == 0 = Nothing | otherwise = Just n
74
false
true
0
9
36
49
23
26
null
null
bobjflong/yesod-csp
src/Yesod/Csp/Example.hs
mit
cdn :: Source cdn = Host (fromJust $ escapeAndParseURI "https://cdn.com")
73
cdn :: Source cdn = Host (fromJust $ escapeAndParseURI "https://cdn.com")
73
cdn = Host (fromJust $ escapeAndParseURI "https://cdn.com")
59
false
true
0
8
9
24
12
12
null
null
markflorisson/hpack
testrepo/bytestring-0.10.4.1/Data/ByteString/Builder/ASCII.hs
bsd-3-clause
int64HexFixed :: Int64 -> Builder int64HexFixed = P.primFixed P.int64HexFixed
77
int64HexFixed :: Int64 -> Builder int64HexFixed = P.primFixed P.int64HexFixed
77
int64HexFixed = P.primFixed P.int64HexFixed
43
false
true
0
7
8
29
12
17
null
null
jrclogic/SMCDEL
src/SMCDEL/Examples/WhatSum.hs
gpl-2.0
aIs, bIs, cIs :: Int -> Form aIs n = booloutofForm (powerset aProps !! n) aProps
80
aIs, bIs, cIs :: Int -> Form aIs n = booloutofForm (powerset aProps !! n) aProps
80
aIs n = booloutofForm (powerset aProps !! n) aProps
51
false
true
2
8
15
41
20
21
null
null
shlomobauer/BuildIT
src/OutBuild.hs
apache-2.0
obuildsbl h (BlockList a b) = do obuildsbl h a obuildsb h b
62
obuildsbl h (BlockList a b) = do obuildsbl h a obuildsb h b
62
obuildsbl h (BlockList a b) = do obuildsbl h a obuildsb h b
62
false
false
0
7
15
35
15
20
null
null
mahrz/hit
src/Numeric/Information/Model/IT.hs
mit
(-<=) :: (Eq a) => [[a]] -> [[a]] -> Bool (-<=) a b = foldr q True b where q bel cur = cur && (not . null $ filter (\ael -> subset ael bel) a )
146
(-<=) :: (Eq a) => [[a]] -> [[a]] -> Bool (-<=) a b = foldr q True b where q bel cur = cur && (not . null $ filter (\ael -> subset ael bel) a )
146
(-<=) a b = foldr q True b where q bel cur = cur && (not . null $ filter (\ael -> subset ael bel) a )
104
false
true
0
11
39
101
55
46
null
null
Ian-Stewart-Binks/courseography
dependencies/HaXml-1.25.3/src/Text/XML/HaXml/DtdToHaskell/TypeDef.hs
gpl-3.0
---- obsolete -- elementname_at :: String -> Name -- elementname_at n = Name n (mangle n ++ "_Attrs") -- | Convert an XML name to a Haskell conid. mangle :: String -> String mangle (n:ns) | isLower n = notPrelude (toUpper n: map decolonify ns) | isDigit n = 'I': n: map decolonify ns | otherwise = notPrelude (n: map decolonify ns)
351
mangle :: String -> String mangle (n:ns) | isLower n = notPrelude (toUpper n: map decolonify ns) | isDigit n = 'I': n: map decolonify ns | otherwise = notPrelude (n: map decolonify ns)
202
mangle (n:ns) | isLower n = notPrelude (toUpper n: map decolonify ns) | isDigit n = 'I': n: map decolonify ns | otherwise = notPrelude (n: map decolonify ns)
175
true
true
0
9
81
105
50
55
null
null
asakamirai/kazura-queue
test/Test/Expectations.hs
bsd-3-clause
assertNotEqual :: (Show x, Eq x) => x -> x -> IO () assertNotEqual expected actual = assertTrue (expected /= actual) desc where desc = mkDesc 80 "expected not to be" expectedStr <> "\n" <> mkDesc 80 "actual" actualStr expectedStr = show expected actualStr = show actual
296
assertNotEqual :: (Show x, Eq x) => x -> x -> IO () assertNotEqual expected actual = assertTrue (expected /= actual) desc where desc = mkDesc 80 "expected not to be" expectedStr <> "\n" <> mkDesc 80 "actual" actualStr expectedStr = show expected actualStr = show actual
296
assertNotEqual expected actual = assertTrue (expected /= actual) desc where desc = mkDesc 80 "expected not to be" expectedStr <> "\n" <> mkDesc 80 "actual" actualStr expectedStr = show expected actualStr = show actual
244
false
true
0
9
73
102
50
52
null
null
dmuneras/LambdaMethods
src/GramaticaConcreta.hs
gpl-2.0
{-Parser que reconoce la funcion Cosecante -} pCsc :: Parser Token Func pCsc = FCsc <$> (pKey "Csc" *> pFunc)
112
pCsc :: Parser Token Func pCsc = FCsc <$> (pKey "Csc" *> pFunc)
63
pCsc = FCsc <$> (pKey "Csc" *> pFunc)
37
true
true
3
8
22
37
16
21
null
null
DavidAlphaFox/ghc
libraries/transformers/Control/Monad/Trans/Maybe.hs
bsd-3-clause
-- | Convert a 'ExceptT' computation to 'MaybeT', discarding the -- value of any exception. exceptToMaybeT :: (Functor m) => ExceptT e m a -> MaybeT m a exceptToMaybeT (ExceptT m) = MaybeT $ fmap (either (const Nothing) Just) m
227
exceptToMaybeT :: (Functor m) => ExceptT e m a -> MaybeT m a exceptToMaybeT (ExceptT m) = MaybeT $ fmap (either (const Nothing) Just) m
135
exceptToMaybeT (ExceptT m) = MaybeT $ fmap (either (const Nothing) Just) m
74
true
true
0
10
39
70
35
35
null
null
dlilja/hxsc
src/Numeric/HXSC/Interval.hs
bsd-3-clause
hull :: (Ord a, Ord b) => Interval a b -> Interval a b -> Interval a b hull (Interval inf1 sup1) (Interval inf2 sup2) = Interval (min inf1 inf2) (max sup1 sup2)
160
hull :: (Ord a, Ord b) => Interval a b -> Interval a b -> Interval a b hull (Interval inf1 sup1) (Interval inf2 sup2) = Interval (min inf1 inf2) (max sup1 sup2)
160
hull (Interval inf1 sup1) (Interval inf2 sup2) = Interval (min inf1 inf2) (max sup1 sup2)
89
false
true
0
8
32
91
44
47
null
null
glguy/irc-core
src/Client/Commands/Queries.hs
isc
cmdVersion :: NetworkCommand (Maybe String) cmdVersion cs st mbservername = do sendMsg cs $ ircVersion $ case mbservername of Just s -> Text.pack s Nothing -> "" commandSuccess st
251
cmdVersion :: NetworkCommand (Maybe String) cmdVersion cs st mbservername = do sendMsg cs $ ircVersion $ case mbservername of Just s -> Text.pack s Nothing -> "" commandSuccess st
251
cmdVersion cs st mbservername = do sendMsg cs $ ircVersion $ case mbservername of Just s -> Text.pack s Nothing -> "" commandSuccess st
207
false
true
1
13
100
77
32
45
null
null
karknu/rws
src/Parser.hs
bsd-3-clause
parsePacket :: Parser [Packet] parsePacket = do whiteSpace many1 packetDecl
83
parsePacket :: Parser [Packet] parsePacket = do whiteSpace many1 packetDecl
83
parsePacket = do whiteSpace many1 packetDecl
52
false
true
0
7
17
26
12
14
null
null
jhstanton/Basket
src/FRP/Basket.hs
bsd-3-clause
-- Uses getCPUTime to get the time then converts it to milliseconds sampleDiscretely :: Time -> IO a -> Signal s a (b, Bool) -> HList s -> (b -> Bool -> IO ()) -> IO () sampleDiscretely dt sampler sf initState sync = do startTimeIO <- getCPUTime let startTime = (fromInteger startTimeIO) * 1e-9 let op s tp = do currentTimeIO <- getCPUTime let currentTime = (fromInteger currentTimeIO) * 1e-9 if currentTime - tp < dt then op s tp else do systemIn <- sampler let ((b, complete), s') = runSignal sf (currentTime - startTime) s systemIn if complete then sync b complete else sync b complete >> op s' currentTime op initState 0
755
sampleDiscretely :: Time -> IO a -> Signal s a (b, Bool) -> HList s -> (b -> Bool -> IO ()) -> IO () sampleDiscretely dt sampler sf initState sync = do startTimeIO <- getCPUTime let startTime = (fromInteger startTimeIO) * 1e-9 let op s tp = do currentTimeIO <- getCPUTime let currentTime = (fromInteger currentTimeIO) * 1e-9 if currentTime - tp < dt then op s tp else do systemIn <- sampler let ((b, complete), s') = runSignal sf (currentTime - startTime) s systemIn if complete then sync b complete else sync b complete >> op s' currentTime op initState 0
687
sampleDiscretely dt sampler sf initState sync = do startTimeIO <- getCPUTime let startTime = (fromInteger startTimeIO) * 1e-9 let op s tp = do currentTimeIO <- getCPUTime let currentTime = (fromInteger currentTimeIO) * 1e-9 if currentTime - tp < dt then op s tp else do systemIn <- sampler let ((b, complete), s') = runSignal sf (currentTime - startTime) s systemIn if complete then sync b complete else sync b complete >> op s' currentTime op initState 0
586
true
true
0
22
245
262
124
138
null
null
trskop/type-proxies
src/Data/Proxy/Monoid.hs
bsd-3-clause
-- {{{ All and Any ------------------------------------------------------------ -- | Type proxy for 'All' data type. anAll :: Proxy All anAll = Proxy
150
anAll :: Proxy All anAll = Proxy
32
anAll = Proxy
13
true
true
0
6
21
22
10
12
null
null
ComputationWithBoundedResources/tct-its
src/Tct/Its/Data/Sizebounds.hs
bsd-3-clause
updateSizebounds :: TGraph -> RVGraph -> Timebounds -> Sizebounds -> LocalSizebounds -> Sizebounds updateSizebounds tgraph rvgraph tbounds sbounds lbounds = foldl k sbounds (RVG.sccs rvgraph) where k nsbounds scc = case scc of RVG.Trivial rv -> sizebound tgraph lbounds rv nsbounds RVG.NonTrivial rvs -> sizebounds tbounds nsbounds lbounds rvgraph rvs
372
updateSizebounds :: TGraph -> RVGraph -> Timebounds -> Sizebounds -> LocalSizebounds -> Sizebounds updateSizebounds tgraph rvgraph tbounds sbounds lbounds = foldl k sbounds (RVG.sccs rvgraph) where k nsbounds scc = case scc of RVG.Trivial rv -> sizebound tgraph lbounds rv nsbounds RVG.NonTrivial rvs -> sizebounds tbounds nsbounds lbounds rvgraph rvs
372
updateSizebounds tgraph rvgraph tbounds sbounds lbounds = foldl k sbounds (RVG.sccs rvgraph) where k nsbounds scc = case scc of RVG.Trivial rv -> sizebound tgraph lbounds rv nsbounds RVG.NonTrivial rvs -> sizebounds tbounds nsbounds lbounds rvgraph rvs
273
false
true
3
9
70
114
55
59
null
null
aristidb/datastorage
src/TypedBinary.hs
bsd-3-clause
typeBuilder (TUInt l) = B.string7 "uint" <> maybe mempty B.intDec l
67
typeBuilder (TUInt l) = B.string7 "uint" <> maybe mempty B.intDec l
67
typeBuilder (TUInt l) = B.string7 "uint" <> maybe mempty B.intDec l
67
false
false
0
7
10
33
15
18
null
null
erochest/cabal-brew
CabalBrew/Types.hs
apache-2.0
execCabalBrew :: (Functor m, MonadIO m) => CabalBrewRun a -> m (Either String a) execCabalBrew = fmap fst . runCabalBrew
120
execCabalBrew :: (Functor m, MonadIO m) => CabalBrewRun a -> m (Either String a) execCabalBrew = fmap fst . runCabalBrew
120
execCabalBrew = fmap fst . runCabalBrew
39
false
true
0
10
19
56
26
30
null
null
andre-artus/handbook-of-practical-logic-and-automated-reasoning-haskell
src/ATP/Order.hs
gpl-3.0
earlier [] _ _ = False
22
earlier [] _ _ = False
22
earlier [] _ _ = False
22
false
false
1
5
5
17
7
10
null
null
mvr/cf
src/Math/ContinuedFraction/Interval.hs
mit
Interval Infinity (Finite a) _ `smallerThan` Interval (Finite b) Infinity _ = a <= -b
85
Interval Infinity (Finite a) _ `smallerThan` Interval (Finite b) Infinity _ = a <= -b
85
Interval Infinity (Finite a) _ `smallerThan` Interval (Finite b) Infinity _ = a <= -b
85
false
false
0
8
14
46
22
24
null
null
nevrenato/Hets_Fork
Comorphisms/Hs2HOLCFaux.hs
gpl-2.0
--------------------------- filters ----------------------------------- nothingFiOut :: [(a, (Maybe b, c))] -> [(a, (b, c))] nothingFiOut ls = [(x, (y, w)) | (x, (Just y, w)) <- ls]
182
nothingFiOut :: [(a, (Maybe b, c))] -> [(a, (b, c))] nothingFiOut ls = [(x, (y, w)) | (x, (Just y, w)) <- ls]
109
nothingFiOut ls = [(x, (y, w)) | (x, (Just y, w)) <- ls]
56
true
true
0
10
26
90
54
36
null
null
geophf/1HaskellADay
exercises/HAD/Y2021/M06/D01/Exercise.hs
mit
tday :: Connection -> Query -> IO [TaggedType Day] tday = query_
64
tday :: Connection -> Query -> IO [TaggedType Day] tday = query_
64
tday = query_
13
false
true
0
9
11
28
14
14
null
null