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

Dataset card Data Studio Files
xet
 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
pascal-knodel/haskell-craft
_/links/E'7'30.hs
mit
dropSpace :: String -> String dropSpace [] = []
47
dropSpace :: String -> String dropSpace [] = []
47
dropSpace [] = []
17
false
true
0
8
8
28
12
16
null
null
steveshogren/language-safety-data-collector
test/Spec.hs
bsd-3-clause
updateFileTest :: Assertion updateFileTest = do actual <- runReaderT (D.clearFileT >> D.updateRecordT aRecord >> D.loadT) testDb ((actual ^. languages) @?= [aRecord])
174
updateFileTest :: Assertion updateFileTest = do actual <- runReaderT (D.clearFileT >> D.updateRecordT aRecord >> D.loadT) testDb ((actual ^. languages) @?= [aRecord])
174
updateFileTest = do actual <- runReaderT (D.clearFileT >> D.updateRecordT aRecord >> D.loadT) testDb ((actual ^. languages) @?= [aRecord])
146
false
true
0
13
28
70
33
37
null
null
mzini/TcT
source/Tct/Method/DP/Simplification.hs
gpl-3.0
-- | Moves a strict dependency into the weak component -- if all predecessors in the dependency graph are strict -- and there is no edge from the rule to itself. simpPE :: T.TheTransformer (SimpPE P.AnyProcessor) simpPE = T.Transformation SimpPE `T.withArgs` (RS.selAllOf RS.selDPs :+: Nothing)
295
simpPE :: T.TheTransformer (SimpPE P.AnyProcessor) simpPE = T.Transformation SimpPE `T.withArgs` (RS.selAllOf RS.selDPs :+: Nothing)
132
simpPE = T.Transformation SimpPE `T.withArgs` (RS.selAllOf RS.selDPs :+: Nothing)
81
true
true
1
10
45
58
29
29
null
null
comonoidial/ALFIN
TestCases.hs
mit
-- path to external core file, function to call, arguments of function assumed to be all Ints exampleTest :: TestCase exampleTest = ("." ++ pathSeparator : "testcode" ++ pathSeparator : "Example.hcr", ("sumNOddSquares", [11]))
227
exampleTest :: TestCase exampleTest = ("." ++ pathSeparator : "testcode" ++ pathSeparator : "Example.hcr", ("sumNOddSquares", [11]))
132
exampleTest = ("." ++ pathSeparator : "testcode" ++ pathSeparator : "Example.hcr", ("sumNOddSquares", [11]))
108
true
true
0
9
33
43
25
18
null
null
portnov/yaledger
YaLedger/Parser/Common.hs
bsd-3-clause
readUrlText :: String -> IO Text readUrlText str = if "http://" `isPrefixOf` str then loadHTTPText str else TIO.readFile str
134
readUrlText :: String -> IO Text readUrlText str = if "http://" `isPrefixOf` str then loadHTTPText str else TIO.readFile str
134
readUrlText str = if "http://" `isPrefixOf` str then loadHTTPText str else TIO.readFile str
101
false
true
0
7
28
48
23
25
null
null
NICTA/sk-config
src/ELFFile.hs
bsd-2-clause
elfArch _ = assert False Unsupported
36
elfArch _ = assert False Unsupported
36
elfArch _ = assert False Unsupported
36
false
false
0
4
5
16
6
10
null
null
olsner/ghc
utils/genapply/Main.hs
bsd-3-clause
assignRegs :: RegStatus -- are we registerised? -> Int -- Sp of first arg -> [ArgRep] -- args -> ([(Reg,Int)], -- regs and offsets to load [ArgRep], -- left-over args Int) -- Sp of left-over args assignRegs regstatus sp args = assign sp args (availableRegs regstatus) []
398
assignRegs :: RegStatus -- are we registerised? -> Int -- Sp of first arg -> [ArgRep] -- args -> ([(Reg,Int)], -- regs and offsets to load [ArgRep], -- left-over args Int) assignRegs regstatus sp args = assign sp args (availableRegs regstatus) []
359
assignRegs regstatus sp args = assign sp args (availableRegs regstatus) []
74
true
true
0
12
174
82
46
36
null
null
ganeti/ganeti
src/Ganeti/HTools/Program/Hbal.hs
bsd-2-clause
checkNeedRebalance :: Options -> Score -> Score -> IO () checkNeedRebalance opts ini_cv opt_cv = do let min_cv = optMinScore opts when (ini_cv - opt_cv < min_cv) $ do printf "Cluster is already well balanced (initial score %.6g,\n\ \optimum score due to N+1 reservations %.6g,\n\ \minimum score %.6g).\nNothing to do, exiting\n" ini_cv opt_cv min_cv:: IO () exitSuccess -- | Main function.
460
checkNeedRebalance :: Options -> Score -> Score -> IO () checkNeedRebalance opts ini_cv opt_cv = do let min_cv = optMinScore opts when (ini_cv - opt_cv < min_cv) $ do printf "Cluster is already well balanced (initial score %.6g,\n\ \optimum score due to N+1 reservations %.6g,\n\ \minimum score %.6g).\nNothing to do, exiting\n" ini_cv opt_cv min_cv:: IO () exitSuccess -- | Main function.
460
checkNeedRebalance opts ini_cv opt_cv = do let min_cv = optMinScore opts when (ini_cv - opt_cv < min_cv) $ do printf "Cluster is already well balanced (initial score %.6g,\n\ \optimum score due to N+1 reservations %.6g,\n\ \minimum score %.6g).\nNothing to do, exiting\n" ini_cv opt_cv min_cv:: IO () exitSuccess -- | Main function.
403
false
true
0
11
131
92
43
49
null
null
mydaum/cabal
cabal-install/Distribution/Client/ProjectConfig/Legacy.hs
bsd-3-clause
legacySharedConfigFieldDescrs :: [FieldDescr LegacySharedConfig] legacySharedConfigFieldDescrs = ( liftFields legacyGlobalFlags (\flags conf -> conf { legacyGlobalFlags = flags }) . addFields [ newLineListField "local-repo" showTokenQ parseTokenQ (fromNubList . globalLocalRepos) (\v conf -> conf { globalLocalRepos = toNubList v }) ] . filterFields [ "remote-repo-cache" , "logs-dir", "ignore-expiry", "http-transport" ] . commandOptionsToFields ) (commandOptions (globalCommand []) ParseArgs) ++ ( liftFields legacyConfigureShFlags (\flags conf -> conf { legacyConfigureShFlags = flags }) . filterFields ["verbose", "builddir" ] . commandOptionsToFields ) (configureOptions ParseArgs) ++ ( liftFields legacyConfigureExFlags (\flags conf -> conf { legacyConfigureExFlags = flags }) . addFields [ commaNewLineListField "constraints" (disp . fst) (fmap (\constraint -> (constraint, constraintSrc)) parse) configExConstraints (\v conf -> conf { configExConstraints = v }) , commaNewLineListField "preferences" disp parse configPreferences (\v conf -> conf { configPreferences = v }) , simpleField "allow-older" (maybe mempty dispRelaxDeps) (fmap Just parseRelaxDeps) (fmap unAllowOlder . configAllowOlder) (\v conf -> conf { configAllowOlder = fmap AllowOlder v }) , simpleField "allow-newer" (maybe mempty dispRelaxDeps) (fmap Just parseRelaxDeps) (fmap unAllowNewer . configAllowNewer) (\v conf -> conf { configAllowNewer = fmap AllowNewer v }) ] . filterFields [ "cabal-lib-version", "solver" -- not "constraint" or "preference", we use our own plural ones above ] . commandOptionsToFields ) (configureExOptions ParseArgs constraintSrc) ++ ( liftFields legacyInstallFlags (\flags conf -> conf { legacyInstallFlags = flags }) . addFields [ newLineListField "build-summary" (showTokenQ . fromPathTemplate) (fmap toPathTemplate parseTokenQ) (fromNubList . installSummaryFile) (\v conf -> conf { installSummaryFile = toNubList v }) ] . filterFields [ "doc-index-file" , "root-cmd", "symlink-bindir" , "build-log" , "remote-build-reporting", "report-planning-failure" , "one-shot", "jobs", "keep-going", "offline", "per-component" -- solver flags: , "max-backjumps", "reorder-goals", "count-conflicts", "independent-goals" , "strong-flags" , "allow-boot-library-installs", "index-state" ] . commandOptionsToFields ) (installOptions ParseArgs) where constraintSrc = ConstraintSourceProjectConfig "TODO"
2,784
legacySharedConfigFieldDescrs :: [FieldDescr LegacySharedConfig] legacySharedConfigFieldDescrs = ( liftFields legacyGlobalFlags (\flags conf -> conf { legacyGlobalFlags = flags }) . addFields [ newLineListField "local-repo" showTokenQ parseTokenQ (fromNubList . globalLocalRepos) (\v conf -> conf { globalLocalRepos = toNubList v }) ] . filterFields [ "remote-repo-cache" , "logs-dir", "ignore-expiry", "http-transport" ] . commandOptionsToFields ) (commandOptions (globalCommand []) ParseArgs) ++ ( liftFields legacyConfigureShFlags (\flags conf -> conf { legacyConfigureShFlags = flags }) . filterFields ["verbose", "builddir" ] . commandOptionsToFields ) (configureOptions ParseArgs) ++ ( liftFields legacyConfigureExFlags (\flags conf -> conf { legacyConfigureExFlags = flags }) . addFields [ commaNewLineListField "constraints" (disp . fst) (fmap (\constraint -> (constraint, constraintSrc)) parse) configExConstraints (\v conf -> conf { configExConstraints = v }) , commaNewLineListField "preferences" disp parse configPreferences (\v conf -> conf { configPreferences = v }) , simpleField "allow-older" (maybe mempty dispRelaxDeps) (fmap Just parseRelaxDeps) (fmap unAllowOlder . configAllowOlder) (\v conf -> conf { configAllowOlder = fmap AllowOlder v }) , simpleField "allow-newer" (maybe mempty dispRelaxDeps) (fmap Just parseRelaxDeps) (fmap unAllowNewer . configAllowNewer) (\v conf -> conf { configAllowNewer = fmap AllowNewer v }) ] . filterFields [ "cabal-lib-version", "solver" -- not "constraint" or "preference", we use our own plural ones above ] . commandOptionsToFields ) (configureExOptions ParseArgs constraintSrc) ++ ( liftFields legacyInstallFlags (\flags conf -> conf { legacyInstallFlags = flags }) . addFields [ newLineListField "build-summary" (showTokenQ . fromPathTemplate) (fmap toPathTemplate parseTokenQ) (fromNubList . installSummaryFile) (\v conf -> conf { installSummaryFile = toNubList v }) ] . filterFields [ "doc-index-file" , "root-cmd", "symlink-bindir" , "build-log" , "remote-build-reporting", "report-planning-failure" , "one-shot", "jobs", "keep-going", "offline", "per-component" -- solver flags: , "max-backjumps", "reorder-goals", "count-conflicts", "independent-goals" , "strong-flags" , "allow-boot-library-installs", "index-state" ] . commandOptionsToFields ) (installOptions ParseArgs) where constraintSrc = ConstraintSourceProjectConfig "TODO"
2,784
legacySharedConfigFieldDescrs = ( liftFields legacyGlobalFlags (\flags conf -> conf { legacyGlobalFlags = flags }) . addFields [ newLineListField "local-repo" showTokenQ parseTokenQ (fromNubList . globalLocalRepos) (\v conf -> conf { globalLocalRepos = toNubList v }) ] . filterFields [ "remote-repo-cache" , "logs-dir", "ignore-expiry", "http-transport" ] . commandOptionsToFields ) (commandOptions (globalCommand []) ParseArgs) ++ ( liftFields legacyConfigureShFlags (\flags conf -> conf { legacyConfigureShFlags = flags }) . filterFields ["verbose", "builddir" ] . commandOptionsToFields ) (configureOptions ParseArgs) ++ ( liftFields legacyConfigureExFlags (\flags conf -> conf { legacyConfigureExFlags = flags }) . addFields [ commaNewLineListField "constraints" (disp . fst) (fmap (\constraint -> (constraint, constraintSrc)) parse) configExConstraints (\v conf -> conf { configExConstraints = v }) , commaNewLineListField "preferences" disp parse configPreferences (\v conf -> conf { configPreferences = v }) , simpleField "allow-older" (maybe mempty dispRelaxDeps) (fmap Just parseRelaxDeps) (fmap unAllowOlder . configAllowOlder) (\v conf -> conf { configAllowOlder = fmap AllowOlder v }) , simpleField "allow-newer" (maybe mempty dispRelaxDeps) (fmap Just parseRelaxDeps) (fmap unAllowNewer . configAllowNewer) (\v conf -> conf { configAllowNewer = fmap AllowNewer v }) ] . filterFields [ "cabal-lib-version", "solver" -- not "constraint" or "preference", we use our own plural ones above ] . commandOptionsToFields ) (configureExOptions ParseArgs constraintSrc) ++ ( liftFields legacyInstallFlags (\flags conf -> conf { legacyInstallFlags = flags }) . addFields [ newLineListField "build-summary" (showTokenQ . fromPathTemplate) (fmap toPathTemplate parseTokenQ) (fromNubList . installSummaryFile) (\v conf -> conf { installSummaryFile = toNubList v }) ] . filterFields [ "doc-index-file" , "root-cmd", "symlink-bindir" , "build-log" , "remote-build-reporting", "report-planning-failure" , "one-shot", "jobs", "keep-going", "offline", "per-component" -- solver flags: , "max-backjumps", "reorder-goals", "count-conflicts", "independent-goals" , "strong-flags" , "allow-boot-library-installs", "index-state" ] . commandOptionsToFields ) (installOptions ParseArgs) where constraintSrc = ConstraintSourceProjectConfig "TODO"
2,719
false
true
6
16
669
658
358
300
null
null
frontrowed/stratosphere
library-gen/Stratosphere/ResourceProperties/EC2LaunchTemplateLicenseSpecification.hs
mit
-- | http://docs.aws.amazon.com/AWSCloudFormation/latest/UserGuide/aws-properties-ec2-launchtemplate-licensespecification.html#cfn-ec2-launchtemplate-licensespecification-licenseconfigurationarn ecltlsLicenseConfigurationArn :: Lens' EC2LaunchTemplateLicenseSpecification (Maybe (Val Text)) ecltlsLicenseConfigurationArn = lens _eC2LaunchTemplateLicenseSpecificationLicenseConfigurationArn (\s a -> s { _eC2LaunchTemplateLicenseSpecificationLicenseConfigurationArn = a })
471
ecltlsLicenseConfigurationArn :: Lens' EC2LaunchTemplateLicenseSpecification (Maybe (Val Text)) ecltlsLicenseConfigurationArn = lens _eC2LaunchTemplateLicenseSpecificationLicenseConfigurationArn (\s a -> s { _eC2LaunchTemplateLicenseSpecificationLicenseConfigurationArn = a })
276
ecltlsLicenseConfigurationArn = lens _eC2LaunchTemplateLicenseSpecificationLicenseConfigurationArn (\s a -> s { _eC2LaunchTemplateLicenseSpecificationLicenseConfigurationArn = a })
180
true
true
0
9
22
52
28
24
null
null
Atsky/haskell-idea-plugin
data/haskellParserTests/DoNotation.hs
apache-2.0
listOfTuples :: [(Int,Char)] listOfTuples = do let nums = [1, 2] n <- nums ch <- ['a','b'] return (n,ch)
120
listOfTuples :: [(Int,Char)] listOfTuples = do let nums = [1, 2] n <- nums ch <- ['a','b'] return (n,ch)
120
listOfTuples = do let nums = [1, 2] n <- nums ch <- ['a','b'] return (n,ch)
91
false
true
0
10
34
67
36
31
null
null
chlablak/platinum-parsing
src/PP/Rule.hs
bsd-3-clause
nonTermToToken :: ([Rule], [Rule]) -> ([Rule], [Rule]) nonTermToToken (rs, lrs) = (mappers rs, mappers lrs) where mappers = map (\(Rule r xs) -> Rule r $ map (replaceNonTerm tok) xs) tok = map (\(Rule r _) -> r) lrs replaceNonTerm [] r = r replaceNonTerm (t:ts) r@(NonTerm nt) = if nt == t then TermToken t else replaceNonTerm ts r replaceNonTerm (_:ts) r = replaceNonTerm ts r -- |Remove unused lexical rules -- Apply 'regexfy' first for correct results
497
nonTermToToken :: ([Rule], [Rule]) -> ([Rule], [Rule]) nonTermToToken (rs, lrs) = (mappers rs, mappers lrs) where mappers = map (\(Rule r xs) -> Rule r $ map (replaceNonTerm tok) xs) tok = map (\(Rule r _) -> r) lrs replaceNonTerm [] r = r replaceNonTerm (t:ts) r@(NonTerm nt) = if nt == t then TermToken t else replaceNonTerm ts r replaceNonTerm (_:ts) r = replaceNonTerm ts r -- |Remove unused lexical rules -- Apply 'regexfy' first for correct results
497
nonTermToToken (rs, lrs) = (mappers rs, mappers lrs) where mappers = map (\(Rule r xs) -> Rule r $ map (replaceNonTerm tok) xs) tok = map (\(Rule r _) -> r) lrs replaceNonTerm [] r = r replaceNonTerm (t:ts) r@(NonTerm nt) = if nt == t then TermToken t else replaceNonTerm ts r replaceNonTerm (_:ts) r = replaceNonTerm ts r -- |Remove unused lexical rules -- Apply 'regexfy' first for correct results
442
false
true
2
11
121
223
115
108
null
null
nightscape/platform
shared/src/Unison/Parser.hs
mit
lineErrorUnless :: String -> Parser s a -> Parser s a lineErrorUnless s = commit . scope s
90
lineErrorUnless :: String -> Parser s a -> Parser s a lineErrorUnless s = commit . scope s
90
lineErrorUnless s = commit . scope s
36
false
true
0
7
17
39
18
21
null
null
viktorasl/tictactoe-bot
src/Tictactoe/Move/Base.hs
mit
takenAnyCorner :: Board -> Maybe Coords takenAnyCorner board = listToMaybe $ filter (\coords' -> isJust (fieldExists board coords')) [(0, 0), (0, 2), (2, 0), (2, 2)]
165
takenAnyCorner :: Board -> Maybe Coords takenAnyCorner board = listToMaybe $ filter (\coords' -> isJust (fieldExists board coords')) [(0, 0), (0, 2), (2, 0), (2, 2)]
165
takenAnyCorner board = listToMaybe $ filter (\coords' -> isJust (fieldExists board coords')) [(0, 0), (0, 2), (2, 0), (2, 2)]
125
false
true
0
11
25
89
49
40
null
null
pparkkin/eta
compiler/ETA/CodeGen/Monad.hs
bsd-3-clause
runCodeGen :: CgEnv -> CgState -> CodeGen a -> IO [ClassFile] runCodeGen env state codeGenAction = do (state'@CgState {..}, _) <- unCG codeGenAction env state -- NOTE: addInnerClasses is to ensure that any unused data types/closures -- are added to the constant pool let compiledModuleClass = addInnerClasses cgCompiledClosures $ classFromCgState state' return (compiledModuleClass : cgCompiledClosures) -- NOTE: New bindings generated by the body are forgotten after -- the body is executed
534
runCodeGen :: CgEnv -> CgState -> CodeGen a -> IO [ClassFile] runCodeGen env state codeGenAction = do (state'@CgState {..}, _) <- unCG codeGenAction env state -- NOTE: addInnerClasses is to ensure that any unused data types/closures -- are added to the constant pool let compiledModuleClass = addInnerClasses cgCompiledClosures $ classFromCgState state' return (compiledModuleClass : cgCompiledClosures) -- NOTE: New bindings generated by the body are forgotten after -- the body is executed
534
runCodeGen env state codeGenAction = do (state'@CgState {..}, _) <- unCG codeGenAction env state -- NOTE: addInnerClasses is to ensure that any unused data types/closures -- are added to the constant pool let compiledModuleClass = addInnerClasses cgCompiledClosures $ classFromCgState state' return (compiledModuleClass : cgCompiledClosures) -- NOTE: New bindings generated by the body are forgotten after -- the body is executed
472
false
true
0
12
113
110
53
57
null
null
holzensp/ghc
compiler/main/DriverPipeline.hs
bsd-3-clause
runPhase (RealPhase Splitter) input_fn dflags = do -- tmp_pfx is the prefix used for the split .s files split_s_prefix <- liftIO $ SysTools.newTempName dflags "split" let n_files_fn = split_s_prefix liftIO $ SysTools.runSplit dflags [ SysTools.FileOption "" input_fn , SysTools.FileOption "" split_s_prefix , SysTools.FileOption "" n_files_fn ] -- Save the number of split files for future references s <- liftIO $ readFile n_files_fn let n_files = read s :: Int dflags' = dflags { splitInfo = Just (split_s_prefix, n_files) } setDynFlags dflags' -- Remember to delete all these files liftIO $ addFilesToClean dflags' [ split_s_prefix ++ "__" ++ show n ++ ".s" | n <- [1..n_files]] return (RealPhase SplitAs, "**splitter**") -- we don't use the filename in SplitAs ----------------------------------------------------------------------------- -- As, SpitAs phase : Assembler -- This is for calling the assembler on a regular assembly file (not split).
1,240
runPhase (RealPhase Splitter) input_fn dflags = do -- tmp_pfx is the prefix used for the split .s files split_s_prefix <- liftIO $ SysTools.newTempName dflags "split" let n_files_fn = split_s_prefix liftIO $ SysTools.runSplit dflags [ SysTools.FileOption "" input_fn , SysTools.FileOption "" split_s_prefix , SysTools.FileOption "" n_files_fn ] -- Save the number of split files for future references s <- liftIO $ readFile n_files_fn let n_files = read s :: Int dflags' = dflags { splitInfo = Just (split_s_prefix, n_files) } setDynFlags dflags' -- Remember to delete all these files liftIO $ addFilesToClean dflags' [ split_s_prefix ++ "__" ++ show n ++ ".s" | n <- [1..n_files]] return (RealPhase SplitAs, "**splitter**") -- we don't use the filename in SplitAs ----------------------------------------------------------------------------- -- As, SpitAs phase : Assembler -- This is for calling the assembler on a regular assembly file (not split).
1,240
runPhase (RealPhase Splitter) input_fn dflags = do -- tmp_pfx is the prefix used for the split .s files split_s_prefix <- liftIO $ SysTools.newTempName dflags "split" let n_files_fn = split_s_prefix liftIO $ SysTools.runSplit dflags [ SysTools.FileOption "" input_fn , SysTools.FileOption "" split_s_prefix , SysTools.FileOption "" n_files_fn ] -- Save the number of split files for future references s <- liftIO $ readFile n_files_fn let n_files = read s :: Int dflags' = dflags { splitInfo = Just (split_s_prefix, n_files) } setDynFlags dflags' -- Remember to delete all these files liftIO $ addFilesToClean dflags' [ split_s_prefix ++ "__" ++ show n ++ ".s" | n <- [1..n_files]] return (RealPhase SplitAs, "**splitter**") -- we don't use the filename in SplitAs ----------------------------------------------------------------------------- -- As, SpitAs phase : Assembler -- This is for calling the assembler on a regular assembly file (not split).
1,240
false
false
0
13
426
212
105
107
null
null
mydaum/cabal
Cabal/Distribution/Simple/Utils.hs
bsd-3-clause
withCallStackPrefix :: WithCallStack (TraceWhen -> Verbosity -> String -> String) withCallStackPrefix tracer verbosity s = withFrozenCallStack $ (if isVerboseCallSite verbosity then parentSrcLocPrefix ++ -- Hack: need a newline before starting output marker :( if isVerboseMarkOutput verbosity then "\n" else "" else "") ++ (case traceWhen verbosity tracer of Just pre -> pre ++ prettyCallStack callStack ++ "\n" Nothing -> "") ++ s
535
withCallStackPrefix :: WithCallStack (TraceWhen -> Verbosity -> String -> String) withCallStackPrefix tracer verbosity s = withFrozenCallStack $ (if isVerboseCallSite verbosity then parentSrcLocPrefix ++ -- Hack: need a newline before starting output marker :( if isVerboseMarkOutput verbosity then "\n" else "" else "") ++ (case traceWhen verbosity tracer of Just pre -> pre ++ prettyCallStack callStack ++ "\n" Nothing -> "") ++ s
535
withCallStackPrefix tracer verbosity s = withFrozenCallStack $ (if isVerboseCallSite verbosity then parentSrcLocPrefix ++ -- Hack: need a newline before starting output marker :( if isVerboseMarkOutput verbosity then "\n" else "" else "") ++ (case traceWhen verbosity tracer of Just pre -> pre ++ prettyCallStack callStack ++ "\n" Nothing -> "") ++ s
453
false
true
0
13
164
116
59
57
null
null
tidalcycles/Tidal
src/Sound/Tidal/UI.hs
gpl-3.0
-- | Inverts all the values in a boolean pattern inv :: Functor f => f Bool -> f Bool inv = (not <$>)
101
inv :: Functor f => f Bool -> f Bool inv = (not <$>)
52
inv = (not <$>)
15
true
true
0
8
23
39
18
21
null
null
qsn/rhcalc
src/Operators.hs
mit
logic_xor [Bool a, Bool b] = [Bool $ (a || b) && not (a && b)]
62
logic_xor [Bool a, Bool b] = [Bool $ (a || b) && not (a && b)]
62
logic_xor [Bool a, Bool b] = [Bool $ (a || b) && not (a && b)]
62
false
false
0
9
15
50
25
25
null
null
pedropazello/Haskell_99_problems
lists.hs
mit
-- Problem 2 -- Find the last but one element of a list. myButLast :: [a] -> a myButLast (x:xs) | length xs == 1 = x | otherwise = myButLast xs
157
myButLast :: [a] -> a myButLast (x:xs) | length xs == 1 = x | otherwise = myButLast xs
99
myButLast (x:xs) | length xs == 1 = x | otherwise = myButLast xs
77
true
true
0
9
45
62
29
33
null
null
juanmab37/HOpenCV-0.5.0.1
src/HOpenCV/CV/ImgProc.hs
gpl-2.0
fromCvtColorFlag BayerBG2BGR = 46
33
fromCvtColorFlag BayerBG2BGR = 46
33
fromCvtColorFlag BayerBG2BGR = 46
33
false
false
0
5
3
9
4
5
null
null
roberth/uu-helium
src/Helium/Parser/CollectFunctionBindings.hs
gpl-3.0
functionBindingOfDeclaration _ = internalError "CollectFunctionBindings" "getFunctionBinding" "unexpected declaration kind"
128
functionBindingOfDeclaration _ = internalError "CollectFunctionBindings" "getFunctionBinding" "unexpected declaration kind"
128
functionBindingOfDeclaration _ = internalError "CollectFunctionBindings" "getFunctionBinding" "unexpected declaration kind"
128
false
false
0
5
13
17
7
10
null
null
sorpaas/munje
src/Main.hs
mit
main :: IO () main = do args <- getArgs if null args then interactiveShell readExp else runFile $ head args
121
main :: IO () main = do args <- getArgs if null args then interactiveShell readExp else runFile $ head args
121
main = do args <- getArgs if null args then interactiveShell readExp else runFile $ head args
107
false
true
0
9
34
47
22
25
null
null
sgillespie/ghc
compiler/prelude/PrelNames.hs
bsd-3-clause
emptyCallStackName = varQual gHC_STACK_TYPES (fsLit "emptyCallStack") emptyCallStackKey
89
emptyCallStackName = varQual gHC_STACK_TYPES (fsLit "emptyCallStack") emptyCallStackKey
89
emptyCallStackName = varQual gHC_STACK_TYPES (fsLit "emptyCallStack") emptyCallStackKey
89
false
false
1
7
8
22
9
13
null
null
brendanhay/gogol
gogol-play-moviespartner/gen/Network/Google/PlayMoviesPartner/Types/Product.hs
mpl-2.0
-- | Start of term in YYYY-MM-DD format in the timezone of the country of the -- Avail. Example: \"2013-05-14\". aStart :: Lens' Avail (Maybe Text) aStart = lens _aStart (\ s a -> s{_aStart = a})
195
aStart :: Lens' Avail (Maybe Text) aStart = lens _aStart (\ s a -> s{_aStart = a})
82
aStart = lens _aStart (\ s a -> s{_aStart = a})
47
true
true
0
9
36
47
26
21
null
null
duplode/stack
src/test/Stack/BuildPlanSpec.hs
bsd-3-clause
setup :: IO T setup = do manager <- newTLSManager unsetEnv "STACK_YAML" return T{..}
90
setup :: IO T setup = do manager <- newTLSManager unsetEnv "STACK_YAML" return T{..}
90
setup = do manager <- newTLSManager unsetEnv "STACK_YAML" return T{..}
76
false
true
0
9
19
44
18
26
null
null
m4lvin/HasCacBDD
hs/Data/HasCacBDD.hs
gpl-2.0
-- | The maximum number of variables maximumvar :: Int maximumvar = 1048576
75
maximumvar :: Int maximumvar = 1048576
38
maximumvar = 1048576
20
true
true
0
6
12
19
8
11
null
null
bgamari/pandoc
src/Text/Pandoc/Writers/RST.hs
gpl-2.0
inlineToRST (Cite _ lst) = inlineListToRST lst
49
inlineToRST (Cite _ lst) = inlineListToRST lst
49
inlineToRST (Cite _ lst) = inlineListToRST lst
49
false
false
0
7
9
20
9
11
null
null
bitemyapp/ganeti
src/Ganeti/Constants.hs
bsd-2-clause
validTagTypes :: FrozenSet String validTagTypes = ConstantUtils.mkSet $ map Types.tagKindToRaw [minBound..]
107
validTagTypes :: FrozenSet String validTagTypes = ConstantUtils.mkSet $ map Types.tagKindToRaw [minBound..]
107
validTagTypes = ConstantUtils.mkSet $ map Types.tagKindToRaw [minBound..]
73
false
true
1
7
10
33
15
18
null
null
bitemyapp/email-validate-hs
tests/Main.hs
bsd-3-clause
isEmail :: ByteString -> ByteString -> Bool isEmail l d = isValid (makeEmailLike l d)
85
isEmail :: ByteString -> ByteString -> Bool isEmail l d = isValid (makeEmailLike l d)
85
isEmail l d = isValid (makeEmailLike l d)
41
false
true
0
8
14
41
18
23
null
null
sampou-org/pfad
Code/Code06.hs
bsd-3-clause
expand' c x evs = concatMap (filter (ok' c . snd) . glue' x) evs
67
expand' c x evs = concatMap (filter (ok' c . snd) . glue' x) evs
67
expand' c x evs = concatMap (filter (ok' c . snd) . glue' x) evs
67
false
false
0
11
17
41
19
22
null
null
dorchard/camfort
src/Language/Fortran/Model/Op/Core/Eval.hs
apache-2.0
numUnop :: Op 1 'OKNum -> SVal -> SVal numUnop = \case OpNeg -> SBV.svUNeg OpPos -> id
90
numUnop :: Op 1 'OKNum -> SVal -> SVal numUnop = \case OpNeg -> SBV.svUNeg OpPos -> id
90
numUnop = \case OpNeg -> SBV.svUNeg OpPos -> id
51
false
true
0
8
21
42
21
21
null
null
alexvong1995/pandoc
src/Text/Pandoc/Writers/EPUB.hs
gpl-2.0
transformInline opts mediaRef (RawInline fmt raw) | fmt == Format "html" = do let tags = parseTags raw tags' <- mapM (transformTag opts mediaRef) tags return $ RawInline fmt (renderTags' tags')
202
transformInline opts mediaRef (RawInline fmt raw) | fmt == Format "html" = do let tags = parseTags raw tags' <- mapM (transformTag opts mediaRef) tags return $ RawInline fmt (renderTags' tags')
202
transformInline opts mediaRef (RawInline fmt raw) | fmt == Format "html" = do let tags = parseTags raw tags' <- mapM (transformTag opts mediaRef) tags return $ RawInline fmt (renderTags' tags')
202
false
false
0
11
39
84
37
47
null
null
kinghajj/BitTicker
src/BitTicker/Fetch.hs
bsd-3-clause
-- use 'wget' to fetch an HTTP object fetchHTTP :: String -> IO ByteString fetchHTTP url = createProcess wget >>= \(_, mstdout, _, _) -> case mstdout of Just h -> hGetContents h Nothing -> error "wget had no stdout handle???" where cmd = "wget --no-check-certificate -q -O - \"%s\"" wget = CreateProcess (ShellCommand $ printf cmd url) Nothing Nothing CreatePipe CreatePipe CreatePipe False False -- fetch an HTTP object and attempt to read it
566
fetchHTTP :: String -> IO ByteString fetchHTTP url = createProcess wget >>= \(_, mstdout, _, _) -> case mstdout of Just h -> hGetContents h Nothing -> error "wget had no stdout handle???" where cmd = "wget --no-check-certificate -q -O - \"%s\"" wget = CreateProcess (ShellCommand $ printf cmd url) Nothing Nothing CreatePipe CreatePipe CreatePipe False False -- fetch an HTTP object and attempt to read it
528
fetchHTTP url = createProcess wget >>= \(_, mstdout, _, _) -> case mstdout of Just h -> hGetContents h Nothing -> error "wget had no stdout handle???" where cmd = "wget --no-check-certificate -q -O - \"%s\"" wget = CreateProcess (ShellCommand $ printf cmd url) Nothing Nothing CreatePipe CreatePipe CreatePipe False False -- fetch an HTTP object and attempt to read it
491
true
true
2
10
197
124
59
65
null
null
digitalmentat/orgmode-parse
test/Drawer.hs
bsd-3-clause
testGenericDrawer :: Assertion testGenericDrawer = testParser parseDrawer ":MYDRAWER:\n whatever I want can go in here, technically... \n:END:\n"
148
testGenericDrawer :: Assertion testGenericDrawer = testParser parseDrawer ":MYDRAWER:\n whatever I want can go in here, technically... \n:END:\n"
148
testGenericDrawer = testParser parseDrawer ":MYDRAWER:\n whatever I want can go in here, technically... \n:END:\n"
117
false
true
0
5
19
16
8
8
null
null
batkot/haskell-bf
src/Lexer.hs
bsd-3-clause
toBrainFuckChar :: TokenType -> Char toBrainFuckChar MoveLeft = '<'
67
toBrainFuckChar :: TokenType -> Char toBrainFuckChar MoveLeft = '<'
67
toBrainFuckChar MoveLeft = '<'
30
false
true
0
5
8
22
10
12
null
null
Lythimus/lptv
sites/all/modules/jgm-pandoc-8be6cc2/src/Text/Pandoc/Writers/Textile.hs
gpl-2.0
inlineToTextile opts (Strikeout lst) = do contents <- inlineListToTextile opts lst return $ if '-' `elem` contents then "<del>" ++ contents ++ "</del>" else "-" ++ contents ++ "-"
211
inlineToTextile opts (Strikeout lst) = do contents <- inlineListToTextile opts lst return $ if '-' `elem` contents then "<del>" ++ contents ++ "</del>" else "-" ++ contents ++ "-"
211
inlineToTextile opts (Strikeout lst) = do contents <- inlineListToTextile opts lst return $ if '-' `elem` contents then "<del>" ++ contents ++ "</del>" else "-" ++ contents ++ "-"
211
false
false
0
10
60
68
33
35
null
null
thewoolleyman/haskellbook
11/15/eric/BinaryTree.hs
unlicense
testPostorder :: IO () testPostorder = if postorder testTree == [1, 3, 2] then print "Test passed" else error "Test failed"
135
testPostorder :: IO () testPostorder = if postorder testTree == [1, 3, 2] then print "Test passed" else error "Test failed"
135
testPostorder = if postorder testTree == [1, 3, 2] then print "Test passed" else error "Test failed"
112
false
true
0
7
32
52
25
27
null
null
elaye/turtle-options
src/Turtle/Options/Quality.hs
bsd-3-clause
defQualityHelp :: Optional HelpMessage defQualityHelp = "Quality option. QUALITY can be a percentage (20%) or a keyword: verylow / low / mediumlow / medium / mediumhigh / high / best."
184
defQualityHelp :: Optional HelpMessage defQualityHelp = "Quality option. QUALITY can be a percentage (20%) or a keyword: verylow / low / mediumlow / medium / mediumhigh / high / best."
184
defQualityHelp = "Quality option. QUALITY can be a percentage (20%) or a keyword: verylow / low / mediumlow / medium / mediumhigh / high / best."
145
false
true
0
5
29
14
7
7
null
null
chrisdone/haskelldb-demo
lib/haskelldb/examples/Select.hs
bsd-3-clause
select1 = do intTbl <- table int_tbl project $ copyAll intTbl -- | Select some columns from Int_tbl -- and some from String_tbl. No restriction is -- specified between the two tables, so -- this will be a cross join.
223
select1 = do intTbl <- table int_tbl project $ copyAll intTbl -- | Select some columns from Int_tbl -- and some from String_tbl. No restriction is -- specified between the two tables, so -- this will be a cross join.
223
select1 = do intTbl <- table int_tbl project $ copyAll intTbl -- | Select some columns from Int_tbl -- and some from String_tbl. No restriction is -- specified between the two tables, so -- this will be a cross join.
223
false
false
0
8
46
30
15
15
null
null
hvr/ghci-ng
ghc/Main.hs
bsd-3-clause
{- We split out the object files (.o, .dll) and add them to v_Ld_inputs for use by the linker. The following things should be considered compilation manager inputs: - haskell source files (strings ending in .hs, .lhs or other haskellish extension), - module names (not forgetting hierarchical module names), - things beginning with '-' are flags that were not recognised by the flag parser, and we want them to generate errors later in checkOptions, so we class them as source files (#5921) - and finally we consider everything not containing a '.' to be a comp manager input, as shorthand for a .hs or .lhs filename. Everything else is considered to be a linker object, and passed straight through to the linker. -} looks_like_an_input :: String -> Bool looks_like_an_input m = isSourceFilename m || looksLikeModuleName m || "-" `isPrefixOf` m || '.' `notElem` m
1,034
looks_like_an_input :: String -> Bool looks_like_an_input m = isSourceFilename m || looksLikeModuleName m || "-" `isPrefixOf` m || '.' `notElem` m
213
looks_like_an_input m = isSourceFilename m || looksLikeModuleName m || "-" `isPrefixOf` m || '.' `notElem` m
175
true
true
0
10
314
49
26
23
null
null
facebookincubator/duckling
Duckling/Quantity/KM/Rules.hs
bsd-3-clause
ruleNumeralUnits :: Rule ruleNumeralUnits = Rule { name = "<number><units>" , pattern = [ dimension Numeral , regex "(ចាន|ពែង|កែវ|ថូ|ស្លាបព្រា|ស្លាបព្រាបាយ|ស្លាបព្រាកាហ្វេ|នាក់|ក្បាល|ដើម|ទង|ខ្នង|គ្រឿង|កញ្ចប់|ឈុត)" ] , prod = \case (Token Numeral NumeralData{TNumeral.value = v}: Token RegexMatch (GroupMatch (match:_)): _) -> do unit <- HashMap.lookup match unitsMap Just . Token Quantity $ quantity unit v _ -> Nothing }
485
ruleNumeralUnits :: Rule ruleNumeralUnits = Rule { name = "<number><units>" , pattern = [ dimension Numeral , regex "(ចាន|ពែង|កែវ|ថូ|ស្លាបព្រា|ស្លាបព្រាបាយ|ស្លាបព្រាកាហ្វេ|នាក់|ក្បាល|ដើម|ទង|ខ្នង|គ្រឿង|កញ្ចប់|ឈុត)" ] , prod = \case (Token Numeral NumeralData{TNumeral.value = v}: Token RegexMatch (GroupMatch (match:_)): _) -> do unit <- HashMap.lookup match unitsMap Just . Token Quantity $ quantity unit v _ -> Nothing }
485
ruleNumeralUnits = Rule { name = "<number><units>" , pattern = [ dimension Numeral , regex "(ចាន|ពែង|កែវ|ថូ|ស្លាបព្រា|ស្លាបព្រាបាយ|ស្លាបព្រាកាហ្វេ|នាក់|ក្បាល|ដើម|ទង|ខ្នង|គ្រឿង|កញ្ចប់|ឈុត)" ] , prod = \case (Token Numeral NumeralData{TNumeral.value = v}: Token RegexMatch (GroupMatch (match:_)): _) -> do unit <- HashMap.lookup match unitsMap Just . Token Quantity $ quantity unit v _ -> Nothing }
460
false
true
0
18
116
145
71
74
null
null
TOSPIO/yi
src/library/Yi/Interact.hs
gpl-2.0
mkProcess (Plus a b) = \fut -> Best (mkProcess a fut) (mkProcess b fut)
71
mkProcess (Plus a b) = \fut -> Best (mkProcess a fut) (mkProcess b fut)
71
mkProcess (Plus a b) = \fut -> Best (mkProcess a fut) (mkProcess b fut)
71
false
false
0
8
13
43
21
22
null
null
ingemaradahl/bilder
src/TypeChecker/Inferring.hs
lgpl-3.0
inferExp (EAnd el tk er) = inferBoolexp tk el er
48
inferExp (EAnd el tk er) = inferBoolexp tk el er
48
inferExp (EAnd el tk er) = inferBoolexp tk el er
48
false
false
0
7
9
26
12
14
null
null
lovasko/swim
src/Command/Check/Check.hs
bsd-2-clause
perform :: CheckOptions -- ^ options -> IO () -- ^ action perform options = do story <- load (checkGetFile options) checkTimes (map fst story) checkValues (map snd story)
191
perform :: CheckOptions -- ^ options -> IO () perform options = do story <- load (checkGetFile options) checkTimes (map fst story) checkValues (map snd story)
172
perform options = do story <- load (checkGetFile options) checkTimes (map fst story) checkValues (map snd story)
118
true
true
0
11
49
74
33
41
null
null
nevrenato/Hets_Fork
CASL/QuickCheck.hs
gpl-2.0
match2 (Application opsymb1 terms1 _) (Application opsymb2 terms2 _) = -- direct match of operation symbols? if opsymb1 == opsymb2 then do substs <- mapM (uncurry match2) (zip terms1 terms2) return (concat substs) -- if not, try to exploit overloading relation else do let (opsymb1', terms1', w1) = stripInj opsymb1 terms1 (opsymb2', terms2', w2) = stripInj opsymb2 terms2 when (opSymbName opsymb1' /= opSymbName opsymb2' || w1 /= w2) Nothing substs <- mapM (uncurry match2) (zip terms1' terms2') return (concat substs)
576
match2 (Application opsymb1 terms1 _) (Application opsymb2 terms2 _) = -- direct match of operation symbols? if opsymb1 == opsymb2 then do substs <- mapM (uncurry match2) (zip terms1 terms2) return (concat substs) -- if not, try to exploit overloading relation else do let (opsymb1', terms1', w1) = stripInj opsymb1 terms1 (opsymb2', terms2', w2) = stripInj opsymb2 terms2 when (opSymbName opsymb1' /= opSymbName opsymb2' || w1 /= w2) Nothing substs <- mapM (uncurry match2) (zip terms1' terms2') return (concat substs)
576
match2 (Application opsymb1 terms1 _) (Application opsymb2 terms2 _) = -- direct match of operation symbols? if opsymb1 == opsymb2 then do substs <- mapM (uncurry match2) (zip terms1 terms2) return (concat substs) -- if not, try to exploit overloading relation else do let (opsymb1', terms1', w1) = stripInj opsymb1 terms1 (opsymb2', terms2', w2) = stripInj opsymb2 terms2 when (opSymbName opsymb1' /= opSymbName opsymb2' || w1 /= w2) Nothing substs <- mapM (uncurry match2) (zip terms1' terms2') return (concat substs)
576
false
false
1
14
136
199
94
105
null
null
kim/amazonka
amazonka-storagegateway/gen/Network/AWS/StorageGateway/UpdateChapCredentials.hs
mpl-2.0
-- | The iSCSI initiator that connects to the target. uccInitiatorName :: Lens' UpdateChapCredentials Text uccInitiatorName = lens _uccInitiatorName (\s a -> s { _uccInitiatorName = a })
186
uccInitiatorName :: Lens' UpdateChapCredentials Text uccInitiatorName = lens _uccInitiatorName (\s a -> s { _uccInitiatorName = a })
132
uccInitiatorName = lens _uccInitiatorName (\s a -> s { _uccInitiatorName = a })
79
true
true
0
9
27
40
22
18
null
null
bitemyapp/Haskell-Turtle-Library
src/Turtle/Prelude.hs
bsd-3-clause
-- | Check if a file exists testfile :: MonadIO io => FilePath -> io Bool testfile path = liftIO (Filesystem.isFile path)
121
testfile :: MonadIO io => FilePath -> io Bool testfile path = liftIO (Filesystem.isFile path)
93
testfile path = liftIO (Filesystem.isFile path)
47
true
true
0
8
21
40
19
21
null
null
stackbuilders/embrace-ambiguity
partial-type-signature/PartialTypeSignature.hs
mit
x :: _ x = True
15
x :: _ x = True
15
x = True
8
false
true
0
6
5
18
7
11
null
null
phaazon/OpenGLRaw
src/Graphics/Rendering/OpenGL/Raw/Tokens.hs
bsd-3-clause
gl_R11F_G11F_B10F :: GLenum gl_R11F_G11F_B10F = 0x8C3A
54
gl_R11F_G11F_B10F :: GLenum gl_R11F_G11F_B10F = 0x8C3A
54
gl_R11F_G11F_B10F = 0x8C3A
26
false
true
0
4
5
11
6
5
null
null
tpsinnem/Idris-dev
src/Idris/Core/Unify.hs
bsd-3-clause
highV i _ = i
13
highV i _ = i
13
highV i _ = i
13
false
false
0
4
4
13
5
8
null
null
Dr-Horv/Advent-of-code
day08/day8.hs
mit
calculateCodeSize :: String -> Int calculateCodeSize = length
61
calculateCodeSize :: String -> Int calculateCodeSize = length
61
calculateCodeSize = length
26
false
true
0
5
7
15
8
7
null
null
HSU-ANT/gstpeaq
src/optimize_settings.hs
lgpl-2.1
conf_data_path = "../BS.1387-ConformanceDatabase"
49
conf_data_path = "../BS.1387-ConformanceDatabase"
49
conf_data_path = "../BS.1387-ConformanceDatabase"
49
false
false
0
4
2
6
3
3
null
null
Helkafen/haddock
haddock-api/src/Haddock/Backends/LaTeX.hs
bsd-2-clause
------------------------------------------------------------------------------- -- * Names ------------------------------------------------------------------------------- ppBinder :: OccName -> LaTeX ppBinder n | isInfixName n = parens $ ppOccName n | otherwise = ppOccName n
285
ppBinder :: OccName -> LaTeX ppBinder n | isInfixName n = parens $ ppOccName n | otherwise = ppOccName n
112
ppBinder n | isInfixName n = parens $ ppOccName n | otherwise = ppOccName n
83
true
true
1
8
34
47
23
24
null
null
fhaust/bitcoin
src/Bitcoin/Protocol.hs
mit
last block -- ++ "01" -- relay testResponse :: ByteString testResponse = hex2bs $ "f9 be b4 d9 76 65 72 73 69 6f 6e 00 00 00 00 00" ++ "64 00 00 00 5b 6f 5f 76 71 11 01 00 01 00 00 00" ++ "00 00 00 00 8b 1f 71 51 00 00 00 00 01 00 00 00" ++ "00 00 00 00 00 00 00 00 00 00 00 00 00 00 ff ff" ++ "81 46 d9 13 e0 e2 01 00 00 00 00 00 00 00 00 00" ++ "00 00 00 00 00 00 00 00 ff ff 47 ff f3 eb 20 8d" ++ "04 d2 e0 93 45 00 b2 43 0f 2f 53 61 74 6f 73 68" ++ "69 3a 30 2e 38 2e 31 2f 9e 8a 03 00 f9 be b4 d9" ++ "76 65 72 61 63 6b 00 00 00 00 00 00 00 00 00 00" ++ "5d f6 e0 e2 f9 be b4 d9 69 6e 76 00 00 00 00 00" ++ "00 00 00 00 25 00 00 00 a9 21 22 95 01 01 00 00" ++ "00 e1 51 9c e5 79 32 c6 46 bc dd 39 86 cf c8 3a" ++ "f2 7e 5b ec eb 29 b5 50 bf 5d d5 26 37 fd 5b c4" ++ "8e f9 be b4 d9 69 6e 76 00 00 00 00 00 00 00 00" ++ "00 25 00 00 00 49 7c 0c 8c 01 01 00 00 00 f5 dc" ++ "b4 dc 61 a7 96 33 6f cf e0 63 08 64 f5 08 d3 d9" ++ "62 e4 5b 60 14 5f 1d 58 9e 05 2f 36 c2 17 f9 be" ++ "b4 d9 69 6e 76 00 00 00 00 00 00 00 00 00 25 00" ++ "00 00 32 76 72 b0 01 01 00 00 00 85 47 47 e0 c6" ++ "d0 a1 b0 eb 4d 9f 04 c6 b7 b0 40 55 c4 cc ac e8" ++ "fb 05 67 a1 76 fb 6c a8 84 e4 51 f9 be b4 d9 69" ++ "6e 76 00 00 00 00 00 00 00 00 00 25 00 00 00 da" ++ "fb 89 1e 01 01 00 00 00 0d 8e 72 02 89 eb 56 11" ++ "26 2c 35 a6 4e c6 3a 40 78 95 bf 64 fe f3 9e 48" ++ "83 a2 49 78 ae fd 28 d1 f9 be b4 d9 69 6e 76 00" ++ "00 00 00 00 00 00 00 00 25 00 00 00 4a 3b 53 86" ++ "01 01 00 00 00 da 02 11 d1 19 48 f3 92 95 91 51" ++ "35 c9 66 ad 59 18 79 f2 8e ac 84 20 14 7f 70 fc" ++ "e2 28 45 83 b2"
2,177
testResponse :: ByteString testResponse = hex2bs $ "f9 be b4 d9 76 65 72 73 69 6f 6e 00 00 00 00 00" ++ "64 00 00 00 5b 6f 5f 76 71 11 01 00 01 00 00 00" ++ "00 00 00 00 8b 1f 71 51 00 00 00 00 01 00 00 00" ++ "00 00 00 00 00 00 00 00 00 00 00 00 00 00 ff ff" ++ "81 46 d9 13 e0 e2 01 00 00 00 00 00 00 00 00 00" ++ "00 00 00 00 00 00 00 00 ff ff 47 ff f3 eb 20 8d" ++ "04 d2 e0 93 45 00 b2 43 0f 2f 53 61 74 6f 73 68" ++ "69 3a 30 2e 38 2e 31 2f 9e 8a 03 00 f9 be b4 d9" ++ "76 65 72 61 63 6b 00 00 00 00 00 00 00 00 00 00" ++ "5d f6 e0 e2 f9 be b4 d9 69 6e 76 00 00 00 00 00" ++ "00 00 00 00 25 00 00 00 a9 21 22 95 01 01 00 00" ++ "00 e1 51 9c e5 79 32 c6 46 bc dd 39 86 cf c8 3a" ++ "f2 7e 5b ec eb 29 b5 50 bf 5d d5 26 37 fd 5b c4" ++ "8e f9 be b4 d9 69 6e 76 00 00 00 00 00 00 00 00" ++ "00 25 00 00 00 49 7c 0c 8c 01 01 00 00 00 f5 dc" ++ "b4 dc 61 a7 96 33 6f cf e0 63 08 64 f5 08 d3 d9" ++ "62 e4 5b 60 14 5f 1d 58 9e 05 2f 36 c2 17 f9 be" ++ "b4 d9 69 6e 76 00 00 00 00 00 00 00 00 00 25 00" ++ "00 00 32 76 72 b0 01 01 00 00 00 85 47 47 e0 c6" ++ "d0 a1 b0 eb 4d 9f 04 c6 b7 b0 40 55 c4 cc ac e8" ++ "fb 05 67 a1 76 fb 6c a8 84 e4 51 f9 be b4 d9 69" ++ "6e 76 00 00 00 00 00 00 00 00 00 25 00 00 00 da" ++ "fb 89 1e 01 01 00 00 00 0d 8e 72 02 89 eb 56 11" ++ "26 2c 35 a6 4e c6 3a 40 78 95 bf 64 fe f3 9e 48" ++ "83 a2 49 78 ae fd 28 d1 f9 be b4 d9 69 6e 76 00" ++ "00 00 00 00 00 00 00 00 25 00 00 00 4a 3b 53 86" ++ "01 01 00 00 00 da 02 11 d1 19 48 f3 92 95 91 51" ++ "35 c9 66 ad 59 18 79 f2 8e ac 84 20 14 7f 70 fc" ++ "e2 28 45 83 b2"
2,075
testResponse = hex2bs $ "f9 be b4 d9 76 65 72 73 69 6f 6e 00 00 00 00 00" ++ "64 00 00 00 5b 6f 5f 76 71 11 01 00 01 00 00 00" ++ "00 00 00 00 8b 1f 71 51 00 00 00 00 01 00 00 00" ++ "00 00 00 00 00 00 00 00 00 00 00 00 00 00 ff ff" ++ "81 46 d9 13 e0 e2 01 00 00 00 00 00 00 00 00 00" ++ "00 00 00 00 00 00 00 00 ff ff 47 ff f3 eb 20 8d" ++ "04 d2 e0 93 45 00 b2 43 0f 2f 53 61 74 6f 73 68" ++ "69 3a 30 2e 38 2e 31 2f 9e 8a 03 00 f9 be b4 d9" ++ "76 65 72 61 63 6b 00 00 00 00 00 00 00 00 00 00" ++ "5d f6 e0 e2 f9 be b4 d9 69 6e 76 00 00 00 00 00" ++ "00 00 00 00 25 00 00 00 a9 21 22 95 01 01 00 00" ++ "00 e1 51 9c e5 79 32 c6 46 bc dd 39 86 cf c8 3a" ++ "f2 7e 5b ec eb 29 b5 50 bf 5d d5 26 37 fd 5b c4" ++ "8e f9 be b4 d9 69 6e 76 00 00 00 00 00 00 00 00" ++ "00 25 00 00 00 49 7c 0c 8c 01 01 00 00 00 f5 dc" ++ "b4 dc 61 a7 96 33 6f cf e0 63 08 64 f5 08 d3 d9" ++ "62 e4 5b 60 14 5f 1d 58 9e 05 2f 36 c2 17 f9 be" ++ "b4 d9 69 6e 76 00 00 00 00 00 00 00 00 00 25 00" ++ "00 00 32 76 72 b0 01 01 00 00 00 85 47 47 e0 c6" ++ "d0 a1 b0 eb 4d 9f 04 c6 b7 b0 40 55 c4 cc ac e8" ++ "fb 05 67 a1 76 fb 6c a8 84 e4 51 f9 be b4 d9 69" ++ "6e 76 00 00 00 00 00 00 00 00 00 25 00 00 00 da" ++ "fb 89 1e 01 01 00 00 00 0d 8e 72 02 89 eb 56 11" ++ "26 2c 35 a6 4e c6 3a 40 78 95 bf 64 fe f3 9e 48" ++ "83 a2 49 78 ae fd 28 d1 f9 be b4 d9 69 6e 76 00" ++ "00 00 00 00 00 00 00 00 25 00 00 00 4a 3b 53 86" ++ "01 01 00 00 00 da 02 11 d1 19 48 f3 92 95 91 51" ++ "35 c9 66 ad 59 18 79 f2 8e ac 84 20 14 7f 70 fc" ++ "e2 28 45 83 b2"
2,048
true
true
58
6
1,088
169
68
101
null
null
MichielDerhaeg/stack
test/integration/lib/StackTest.hs
bsd-3-clause
replGetChar :: Repl Char replGetChar = fmap replStdout ask >>= liftIO . hGetChar
80
replGetChar :: Repl Char replGetChar = fmap replStdout ask >>= liftIO . hGetChar
80
replGetChar = fmap replStdout ask >>= liftIO . hGetChar
55
false
true
0
7
12
34
14
20
null
null
forsyde/forsyde-atom
src/ForSyDe/Atom/MoC/CT/Lib.hs
bsd-3-clause
state44 ns i = MoC.state44 ns (unit4 i)
39
state44 ns i = MoC.state44 ns (unit4 i)
39
state44 ns i = MoC.state44 ns (unit4 i)
39
false
false
1
7
7
30
11
19
null
null
shlevy/ghc
compiler/typecheck/TcRnTypes.hs
bsd-3-clause
isWanted _ = False
18
isWanted _ = False
18
isWanted _ = False
18
false
false
0
4
3
10
4
6
null
null
SAdams601/HaRe
old/testing/liftToToplevel/CaseIn1.hs
bsd-3-clause
--A definition can be lifted from a where or let to the top level binding group. --Lifting a definition widens the scope of the definition. --In this example, lift 'addthree' defined in main main x y z = case x of 0 -> addthree x y z where addthree a b c=a+b+c 1 -> inc y where inc a =a+1
375
main x y z = case x of 0 -> addthree x y z where addthree a b c=a+b+c 1 -> inc y where inc a =a+1
181
main x y z = case x of 0 -> addthree x y z where addthree a b c=a+b+c 1 -> inc y where inc a =a+1
181
true
false
0
11
146
78
39
39
null
null
ditto/ditto
src/Ditto/Pretty.hs
gpl-3.0
softindent :: Doc -> Doc softindent x = group (nest 2 linebreak) <> x
69
softindent :: Doc -> Doc softindent x = group (nest 2 linebreak) <> x
69
softindent x = group (nest 2 linebreak) <> x
44
false
true
0
8
13
33
16
17
null
null
rahulmutt/ghcvm
compiler/Eta/Core/CoreUnfold.hs
bsd-3-clause
maxSize s1@(SizeIs n1 _ _) s2@(SizeIs n2 _ _) | n1 ># n2 = s1 | otherwise = s2
125
maxSize s1@(SizeIs n1 _ _) s2@(SizeIs n2 _ _) | n1 ># n2 = s1 | otherwise = s2
125
maxSize s1@(SizeIs n1 _ _) s2@(SizeIs n2 _ _) | n1 ># n2 = s1 | otherwise = s2
125
false
false
0
8
65
56
27
29
null
null
YoshikuniJujo/hake_haskell
web_page/Variables.hs
gpl-3.0
catHakefile :: String -> IO String catHakefile dir = do cont_ <- readFile $ "../samples/" ++ dir ++ "/Hakefile" let cont = flip (foldr (uncurry gsubRegexPR)) [ (">", "&gt;"), ("<", "&lt;") ] cont_ return $ "<p>&gt; cat <a href=\"../Hakefile_samples/Hakefile_" ++ dir ++ "\">Hakefile</a></p>\n" ++ "<pre><code>" ++ cont ++ "</code></pre>"
354
catHakefile :: String -> IO String catHakefile dir = do cont_ <- readFile $ "../samples/" ++ dir ++ "/Hakefile" let cont = flip (foldr (uncurry gsubRegexPR)) [ (">", "&gt;"), ("<", "&lt;") ] cont_ return $ "<p>&gt; cat <a href=\"../Hakefile_samples/Hakefile_" ++ dir ++ "\">Hakefile</a></p>\n" ++ "<pre><code>" ++ cont ++ "</code></pre>"
354
catHakefile dir = do cont_ <- readFile $ "../samples/" ++ dir ++ "/Hakefile" let cont = flip (foldr (uncurry gsubRegexPR)) [ (">", "&gt;"), ("<", "&lt;") ] cont_ return $ "<p>&gt; cat <a href=\"../Hakefile_samples/Hakefile_" ++ dir ++ "\">Hakefile</a></p>\n" ++ "<pre><code>" ++ cont ++ "</code></pre>"
319
false
true
0
14
65
113
57
56
null
null
pap/postgrest
src/PostgREST/PgStructure.hs
mit
allColumns :: [Relation] -> H.Tx P.Postgres s [Column] allColumns rels = do cols <- H.listEx $ [H.stmt| SELECT info.table_schema AS schema, info.table_name AS table_name, info.column_name AS name, info.ordinal_position AS position, info.is_nullable::boolean AS nullable, info.data_type AS col_type, info.is_updatable::boolean AS updatable, info.character_maximum_length AS max_len, info.numeric_precision AS precision, info.column_default AS default_value, array_to_string(enum_info.vals, ',') AS enum FROM ( SELECT table_schema, table_name, column_name, ordinal_position, is_nullable, data_type, is_updatable, character_maximum_length, numeric_precision, column_default, udt_name FROM information_schema.columns WHERE table_schema NOT IN ('pg_catalog', 'information_schema') ) AS info LEFT OUTER JOIN ( SELECT n.nspname AS s, t.typname AS n, array_agg(e.enumlabel ORDER BY e.enumsortorder) AS vals FROM pg_type t JOIN pg_enum e ON t.oid = e.enumtypid JOIN pg_catalog.pg_namespace n ON n.oid = t.typnamespace GROUP BY s,n ) AS enum_info ON (info.udt_name = enum_info.n) ORDER BY schema, position |] return $ map (addFK . columnFromRow) cols where addFK col = col { colFK = fk col } fk col = join $ relToFk (colName col) <$> find (lookupFn col) rels lookupFn :: Column -> Relation -> Bool lookupFn (Column{colSchema=cs, colTable=ct, colName=cn}) (Relation{relSchema=rs, relTable=rt, relColumns=rc, relType=rty}) = cs==rs && ct==rt && cn `elem` rc && rty==Child lookupFn _ _ = False relToFk cName (Relation{relFTable=t, relColumns=cs, relFColumns=fcs}) = ForeignKey t <$> c where pos = elemIndex cName cs c = (fcs !!) <$> pos
2,107
allColumns :: [Relation] -> H.Tx P.Postgres s [Column] allColumns rels = do cols <- H.listEx $ [H.stmt| SELECT info.table_schema AS schema, info.table_name AS table_name, info.column_name AS name, info.ordinal_position AS position, info.is_nullable::boolean AS nullable, info.data_type AS col_type, info.is_updatable::boolean AS updatable, info.character_maximum_length AS max_len, info.numeric_precision AS precision, info.column_default AS default_value, array_to_string(enum_info.vals, ',') AS enum FROM ( SELECT table_schema, table_name, column_name, ordinal_position, is_nullable, data_type, is_updatable, character_maximum_length, numeric_precision, column_default, udt_name FROM information_schema.columns WHERE table_schema NOT IN ('pg_catalog', 'information_schema') ) AS info LEFT OUTER JOIN ( SELECT n.nspname AS s, t.typname AS n, array_agg(e.enumlabel ORDER BY e.enumsortorder) AS vals FROM pg_type t JOIN pg_enum e ON t.oid = e.enumtypid JOIN pg_catalog.pg_namespace n ON n.oid = t.typnamespace GROUP BY s,n ) AS enum_info ON (info.udt_name = enum_info.n) ORDER BY schema, position |] return $ map (addFK . columnFromRow) cols where addFK col = col { colFK = fk col } fk col = join $ relToFk (colName col) <$> find (lookupFn col) rels lookupFn :: Column -> Relation -> Bool lookupFn (Column{colSchema=cs, colTable=ct, colName=cn}) (Relation{relSchema=rs, relTable=rt, relColumns=rc, relType=rty}) = cs==rs && ct==rt && cn `elem` rc && rty==Child lookupFn _ _ = False relToFk cName (Relation{relFTable=t, relColumns=cs, relFColumns=fcs}) = ForeignKey t <$> c where pos = elemIndex cName cs c = (fcs !!) <$> pos
2,107
allColumns rels = do cols <- H.listEx $ [H.stmt| SELECT info.table_schema AS schema, info.table_name AS table_name, info.column_name AS name, info.ordinal_position AS position, info.is_nullable::boolean AS nullable, info.data_type AS col_type, info.is_updatable::boolean AS updatable, info.character_maximum_length AS max_len, info.numeric_precision AS precision, info.column_default AS default_value, array_to_string(enum_info.vals, ',') AS enum FROM ( SELECT table_schema, table_name, column_name, ordinal_position, is_nullable, data_type, is_updatable, character_maximum_length, numeric_precision, column_default, udt_name FROM information_schema.columns WHERE table_schema NOT IN ('pg_catalog', 'information_schema') ) AS info LEFT OUTER JOIN ( SELECT n.nspname AS s, t.typname AS n, array_agg(e.enumlabel ORDER BY e.enumsortorder) AS vals FROM pg_type t JOIN pg_enum e ON t.oid = e.enumtypid JOIN pg_catalog.pg_namespace n ON n.oid = t.typnamespace GROUP BY s,n ) AS enum_info ON (info.udt_name = enum_info.n) ORDER BY schema, position |] return $ map (addFK . columnFromRow) cols where addFK col = col { colFK = fk col } fk col = join $ relToFk (colName col) <$> find (lookupFn col) rels lookupFn :: Column -> Relation -> Bool lookupFn (Column{colSchema=cs, colTable=ct, colName=cn}) (Relation{relSchema=rs, relTable=rt, relColumns=rc, relType=rty}) = cs==rs && ct==rt && cn `elem` rc && rty==Child lookupFn _ _ = False relToFk cName (Relation{relFTable=t, relColumns=cs, relFColumns=fcs}) = ForeignKey t <$> c where pos = elemIndex cName cs c = (fcs !!) <$> pos
2,052
false
true
0
11
692
314
170
144
null
null
UWNetworksLab/arrakis
hake/RuleDefs.hs
mit
flounderTHCStubPath opts ifn = (optSuffix opts) ./. (ifn ++ "_thc.c")
73
flounderTHCStubPath opts ifn = (optSuffix opts) ./. (ifn ++ "_thc.c")
73
flounderTHCStubPath opts ifn = (optSuffix opts) ./. (ifn ++ "_thc.c")
73
false
false
0
7
13
28
14
14
null
null
google/codeworld
codeworld-base/src/Extras/Colors.hs
apache-2.0
byName ("darkkhaki") = colorNamed' ("#bdb76b")
46
byName ("darkkhaki") = colorNamed' ("#bdb76b")
46
byName ("darkkhaki") = colorNamed' ("#bdb76b")
46
false
false
0
6
4
18
9
9
null
null
ghcjs/jsaddle-dom
src/JSDOM/Generated/WebGPUCommandQueue.hs
mit
-- | <https://developer.mozilla.org/en-US/docs/Web/API/WebGPUCommandQueue.label Mozilla WebGPUCommandQueue.label documentation> getLabel :: (MonadDOM m, FromJSString result) => WebGPUCommandQueue -> m result getLabel self = liftDOM ((self ^. js "label") >>= fromJSValUnchecked)
289
getLabel :: (MonadDOM m, FromJSString result) => WebGPUCommandQueue -> m result getLabel self = liftDOM ((self ^. js "label") >>= fromJSValUnchecked)
160
getLabel self = liftDOM ((self ^. js "label") >>= fromJSValUnchecked)
71
true
true
0
10
38
57
29
28
null
null
jrgdiz/tese
src/MBFetch.hs
mit
fetchTrackByTitle :: IOStateArrow s Track XmlTree fetchTrackByTitle = fetchTrackXmlByTitle >>> atTag "track"
108
fetchTrackByTitle :: IOStateArrow s Track XmlTree fetchTrackByTitle = fetchTrackXmlByTitle >>> atTag "track"
108
fetchTrackByTitle = fetchTrackXmlByTitle >>> atTag "track"
58
false
true
0
6
11
25
12
13
null
null
keithodulaigh/Hets
Temporal/NuSmv.hs
gpl-2.0
showBasicExpr (Xnor exprA exprB) True = concat [ showBasicExpr exprA False, " xnor ", showBasicExpr exprB False ]
211
showBasicExpr (Xnor exprA exprB) True = concat [ showBasicExpr exprA False, " xnor ", showBasicExpr exprB False ]
211
showBasicExpr (Xnor exprA exprB) True = concat [ showBasicExpr exprA False, " xnor ", showBasicExpr exprB False ]
211
false
false
0
7
115
43
20
23
null
null
frantisekfarka/ghc-dsi
compiler/cmm/CLabel.hs
bsd-3-clause
pprCLbl (DeadStripPreventer {}) = panic "pprCLbl DeadStripPreventer"
68
pprCLbl (DeadStripPreventer {}) = panic "pprCLbl DeadStripPreventer"
68
pprCLbl (DeadStripPreventer {}) = panic "pprCLbl DeadStripPreventer"
68
false
false
0
7
6
19
9
10
null
null
jeremyong/Yaiba
Yaiba/Map.hs
bsd-3-clause
hedgeDiffWithKey :: Ord a => (a -> b -> c -> Maybe b) -> (a -> Ordering) -> (a -> Ordering) -> Map a b -> Map a c -> Map a b hedgeDiffWithKey _ _ _ Tip _ = Tip
237
hedgeDiffWithKey :: Ord a => (a -> b -> c -> Maybe b) -> (a -> Ordering) -> (a -> Ordering) -> Map a b -> Map a c -> Map a b hedgeDiffWithKey _ _ _ Tip _ = Tip
237
hedgeDiffWithKey _ _ _ Tip _ = Tip
44
false
true
0
12
118
101
48
53
null
null
kishoredbn/barrelfish
tools/flounder/THCBackend.hs
mit
rpc_fifo_vtbl_type_x :: String -> String rpc_fifo_vtbl_type_x ifn = ifscope ifn $ "thc_rpc_fifo_x"
98
rpc_fifo_vtbl_type_x :: String -> String rpc_fifo_vtbl_type_x ifn = ifscope ifn $ "thc_rpc_fifo_x"
98
rpc_fifo_vtbl_type_x ifn = ifscope ifn $ "thc_rpc_fifo_x"
57
false
true
0
6
11
25
12
13
null
null
GaloisInc/gec
src/GEC/KeyExchange/Pure.hs
bsd-3-clause
respond _ _ _ = Left InvalidContext
35
respond _ _ _ = Left InvalidContext
35
respond _ _ _ = Left InvalidContext
35
false
false
1
5
6
16
6
10
null
null
debug-ito/wild-bind
wild-bind/src/WildBind/Exec.hs
bsd-3-clause
wildBind :: (Ord i) => Binding s i -> FrontEnd s i -> IO () wildBind = wildBind' defOption
90
wildBind :: (Ord i) => Binding s i -> FrontEnd s i -> IO () wildBind = wildBind' defOption
90
wildBind = wildBind' defOption
30
false
true
0
9
18
46
22
24
null
null
sol2man2/Learn-You-A-Haskell-For-Great-Good
src/Ch03.hs
mit
badGreeting :: String badGreeting = "Oh! Pfft. It's you."
57
badGreeting :: String badGreeting = "Oh! Pfft. It's you."
57
badGreeting = "Oh! Pfft. It's you."
35
false
true
0
4
8
11
6
5
null
null
pranjaltale16/codeworld
funblocks-client/src/Blocks/Types.hs
apache-2.0
cwScale = standardFunction "cwScale" "scaled" (Just "move-resize-variant.svg") [typePicture, typeNumber, typeNumber, typePicture] ["PICTURE", "HORZ", "VERTZ"] colorPicture "A scaled picture"
202
cwScale = standardFunction "cwScale" "scaled" (Just "move-resize-variant.svg") [typePicture, typeNumber, typeNumber, typePicture] ["PICTURE", "HORZ", "VERTZ"] colorPicture "A scaled picture"
202
cwScale = standardFunction "cwScale" "scaled" (Just "move-resize-variant.svg") [typePicture, typeNumber, typeNumber, typePicture] ["PICTURE", "HORZ", "VERTZ"] colorPicture "A scaled picture"
202
false
false
1
7
29
51
27
24
null
null
NorfairKing/the-notes
src/Probability/RandomVariable/Macro.hs
gpl-2.0
cprobs v cvs = cprob v (cs cvs)
31
cprobs v cvs = cprob v (cs cvs)
31
cprobs v cvs = cprob v (cs cvs)
31
false
false
0
7
7
23
10
13
null
null
aztek/voogie
src/Voogie/Parse/FOOL.hs
gpl-3.0
unary :: UnaryOp -> Operator Term unary = prefix <$> Unary <*> nameOf
69
unary :: UnaryOp -> Operator Term unary = prefix <$> Unary <*> nameOf
69
unary = prefix <$> Unary <*> nameOf
35
false
true
5
7
12
36
16
20
null
null
AlexBaranosky/QuickCheck
Test/QuickCheck/Arbitrary.hs
bsd-3-clause
arbitraryBoundedIntegral :: (Bounded a, Integral a) => Gen a arbitraryBoundedIntegral = do let mn = minBound mx = maxBound `asTypeOf` mn n <- choose (toInteger mn, toInteger mx) return (fromInteger n `asTypeOf` mn) -- | Generates an element of a bounded type. The element is -- chosen from the entire range of the type.
341
arbitraryBoundedIntegral :: (Bounded a, Integral a) => Gen a arbitraryBoundedIntegral = do let mn = minBound mx = maxBound `asTypeOf` mn n <- choose (toInteger mn, toInteger mx) return (fromInteger n `asTypeOf` mn) -- | Generates an element of a bounded type. The element is -- chosen from the entire range of the type.
341
arbitraryBoundedIntegral = do let mn = minBound mx = maxBound `asTypeOf` mn n <- choose (toInteger mn, toInteger mx) return (fromInteger n `asTypeOf` mn) -- | Generates an element of a bounded type. The element is -- chosen from the entire range of the type.
280
false
true
0
10
75
91
47
44
null
null
rfranek/duckling
Duckling/Time/VI/Rules.hs
bsd-3-clause
ruleByGi :: Rule ruleByGi = Rule { name = "bây giờ" , pattern = [ regex "(ngay )?(b(\x00e2)y gi(\x1edd)|l(\x00fa)c n(\x00e0)y)" ] , prod = \_ -> tt $ cycleNth TG.Second 0 }
188
ruleByGi :: Rule ruleByGi = Rule { name = "bây giờ" , pattern = [ regex "(ngay )?(b(\x00e2)y gi(\x1edd)|l(\x00fa)c n(\x00e0)y)" ] , prod = \_ -> tt $ cycleNth TG.Second 0 }
188
ruleByGi = Rule { name = "bây giờ" , pattern = [ regex "(ngay )?(b(\x00e2)y gi(\x1edd)|l(\x00fa)c n(\x00e0)y)" ] , prod = \_ -> tt $ cycleNth TG.Second 0 }
171
false
true
0
11
47
57
31
26
null
null
ocean0yohsuke/Simply-Typed-Lambda
src/Lambda/DataType/PatternMatch.hs
bsd-3-clause
unit = UNIT Nothing
19
unit = UNIT Nothing
19
unit = UNIT Nothing
19
false
false
0
5
3
9
4
5
null
null
xenog/haskoin
test/bitcoin/Network/Haskoin/Script/Tests.hs
unlicense
scriptPairTestExec :: Script -- scriptSig -> Script -- pubKey -> [ Flag ] -- Evaluation flags -> Bool scriptPairTestExec scriptSig pubKey flags = let bsScriptSig = encode scriptSig bsPubKey = encode pubKey spendTx = buildSpendTx bsScriptSig (buildCreditTx bsPubKey) in verifySpend spendTx 0 pubKey 0 flags
392
scriptPairTestExec :: Script -- scriptSig -> Script -- pubKey -> [ Flag ] -- Evaluation flags -> Bool scriptPairTestExec scriptSig pubKey flags = let bsScriptSig = encode scriptSig bsPubKey = encode pubKey spendTx = buildSpendTx bsScriptSig (buildCreditTx bsPubKey) in verifySpend spendTx 0 pubKey 0 flags
392
scriptPairTestExec scriptSig pubKey flags = let bsScriptSig = encode scriptSig bsPubKey = encode pubKey spendTx = buildSpendTx bsScriptSig (buildCreditTx bsPubKey) in verifySpend spendTx 0 pubKey 0 flags
227
false
true
0
11
131
85
43
42
null
null
begriffs/graph-rtce
src/Server.hs
mit
newClients :: IO (TVar Clients) newClients = atomically $ newTVar M.empty
74
newClients :: IO (TVar Clients) newClients = atomically $ newTVar M.empty
73
newClients = atomically $ newTVar M.empty
41
false
true
0
7
11
29
14
15
null
null
olsner/ghc
compiler/typecheck/TcBinds.hs
bsd-3-clause
tcExtendIdBinderStackForRhs :: [MonoBindInfo] -> TcM a -> TcM a -- Extend the TcIdBinderStack for the RHS of the binding, with -- the monomorphic Id. That way, if we have, say -- f = \x -> blah -- and something goes wrong in 'blah', we get a "relevant binding" -- looking like f :: alpha -> beta -- This applies if 'f' has a type signature too: -- f :: forall a. [a] -> [a] -- f x = True -- We can't unify True with [a], and a relevant binding is f :: [a] -> [a] -- If we had the *polymorphic* version of f in the TcIdBinderStack, it -- would not be reported as relevant, because its type is closed tcExtendIdBinderStackForRhs infos thing_inside = tcExtendIdBndrs [ TcIdBndr mono_id NotTopLevel | MBI { mbi_mono_id = mono_id } <- infos ] thing_inside
804
tcExtendIdBinderStackForRhs :: [MonoBindInfo] -> TcM a -> TcM a tcExtendIdBinderStackForRhs infos thing_inside = tcExtendIdBndrs [ TcIdBndr mono_id NotTopLevel | MBI { mbi_mono_id = mono_id } <- infos ] thing_inside
257
tcExtendIdBinderStackForRhs infos thing_inside = tcExtendIdBndrs [ TcIdBndr mono_id NotTopLevel | MBI { mbi_mono_id = mono_id } <- infos ] thing_inside
193
true
true
0
11
194
74
42
32
null
null
gridaphobe/ghc
compiler/stgSyn/CoreToStg.hs
bsd-3-clause
check_eq_li TopLet TopLet = True
46
check_eq_li TopLet TopLet = True
46
check_eq_li TopLet TopLet = True
46
false
false
0
5
18
13
5
8
null
null
nh2/WashNGo
WASH/HTML/HTMLMonad.hs
bsd-3-clause
center, center_S, center_T :: Monad m => HTMLCons x y m a center_S = mkElement_S "center"
89
center, center_S, center_T :: Monad m => HTMLCons x y m a center_S = mkElement_S "center"
89
center_S = mkElement_S "center"
31
false
true
0
6
15
34
18
16
null
null
agrafix/hackage-server
Distribution/Server/Users/Users.hs
bsd-3-clause
lookupAuthToken :: AuthToken -> Users -> Maybe (UserId, UserInfo) lookupAuthToken authTok users = do uid <- Map.lookup authTok (authTokenMap users) uinfo <- lookupUserId uid users return (uid, uinfo) -- | Convert a 'UserId' to a 'UserName'. If the user id doesn't exist, -- an ugly placeholder is used instead. --
332
lookupAuthToken :: AuthToken -> Users -> Maybe (UserId, UserInfo) lookupAuthToken authTok users = do uid <- Map.lookup authTok (authTokenMap users) uinfo <- lookupUserId uid users return (uid, uinfo) -- | Convert a 'UserId' to a 'UserName'. If the user id doesn't exist, -- an ugly placeholder is used instead. --
332
lookupAuthToken authTok users = do uid <- Map.lookup authTok (authTokenMap users) uinfo <- lookupUserId uid users return (uid, uinfo) -- | Convert a 'UserId' to a 'UserName'. If the user id doesn't exist, -- an ugly placeholder is used instead. --
266
false
true
0
10
68
80
40
40
null
null
sdiehl/ghc
libraries/ghc-heap/GHC/Exts/Heap/Closures.hs
bsd-3-clause
allClosures (MutVarClosure {..}) = [var]
40
allClosures (MutVarClosure {..}) = [var]
40
allClosures (MutVarClosure {..}) = [var]
40
false
false
0
8
4
21
11
10
null
null
zhiyuanshi/fcore
frontend/SymbolicEvaluator.hs
bsd-2-clause
merge (_, AND) (Exp (SBool True)) e = e
39
merge (_, AND) (Exp (SBool True)) e = e
39
merge (_, AND) (Exp (SBool True)) e = e
39
false
false
2
9
8
35
16
19
null
null
svenssonjoel/MonadObsidian
Obsidian/MonadObsidian/GenCuda.hs
bsd-3-clause
getArrayNames _ = Set.empty
27
getArrayNames _ = Set.empty
27
getArrayNames _ = Set.empty
27
false
false
0
5
3
11
5
6
null
null
GaloisInc/tower
tower-config/src/Ivory/Tower/Config/Document.hs
bsd-3-clause
getDocument :: FilePath -> [FilePath] -> IO (Either String TOML) getDocument root path = do b <- getPreprocessedFile root path case b of Right bs -> return (tomlParse bs) Left e -> return (Left e)
208
getDocument :: FilePath -> [FilePath] -> IO (Either String TOML) getDocument root path = do b <- getPreprocessedFile root path case b of Right bs -> return (tomlParse bs) Left e -> return (Left e)
208
getDocument root path = do b <- getPreprocessedFile root path case b of Right bs -> return (tomlParse bs) Left e -> return (Left e)
143
false
true
0
12
46
93
43
50
null
null
GDCN/GDCN
GDCN_proj/dGDCN/data/FalseWork/code/FalseLangermann.hs
gpl-3.0
theSum :: Vector -> Int -> Double theSum x i = sum [ (lookupVector x j - lookupMatrix aConst (i, j)) ^ 2 | j <- [1..dimensions] ]
129
theSum :: Vector -> Int -> Double theSum x i = sum [ (lookupVector x j - lookupMatrix aConst (i, j)) ^ 2 | j <- [1..dimensions] ]
129
theSum x i = sum [ (lookupVector x j - lookupMatrix aConst (i, j)) ^ 2 | j <- [1..dimensions] ]
95
false
true
0
11
27
76
37
39
null
null
bitemyapp/irc-core
driver/ClientState.hs
bsd-3-clause
prevInSorted :: Ord a => a -> Set a -> a prevInSorted x ys = case Set.lookupLT x ys of Just y -> y Nothing -> case Set.maxView ys of Just (y,_) -> y Nothing -> x
194
prevInSorted :: Ord a => a -> Set a -> a prevInSorted x ys = case Set.lookupLT x ys of Just y -> y Nothing -> case Set.maxView ys of Just (y,_) -> y Nothing -> x
194
prevInSorted x ys = case Set.lookupLT x ys of Just y -> y Nothing -> case Set.maxView ys of Just (y,_) -> y Nothing -> x
153
false
true
5
8
69
84
42
42
null
null
bitemyapp/roshask
src/executable/Analysis.hs
bsd-3-clause
-- NOTE: ROS specifies that we serialize booleans as a single byte, -- while there is an instance of Haskell's 'Storable' class for 'Bool' -- that uses four bytes for each boolean value. We handle individual -- boolean values with the 'RosBinary' instance for the Haskell 'Bool' -- type (i.e. one byte for each boolean). We must handle arrays of -- booleans specially as the serialized form must still be one byte -- per value. -- | Deserialization source code string to read a vector of bytes, -- then convert that to a vector of 'Bool's. getBoolFromWord :: ByteString getBoolFromWord = "P.fmap (V.map (P.> 0) :: V.Vector Word.Word8 \ \-> V.Vector P.Bool) get"
680
getBoolFromWord :: ByteString getBoolFromWord = "P.fmap (V.map (P.> 0) :: V.Vector Word.Word8 \ \-> V.Vector P.Bool) get"
139
getBoolFromWord = "P.fmap (V.map (P.> 0) :: V.Vector Word.Word8 \ \-> V.Vector P.Bool) get"
109
true
true
0
6
131
27
16
11
null
null
fmapfmapfmap/amazonka
amazonka-redshift/gen/Network/AWS/Redshift/CreateClusterParameterGroup.hs
mpl-2.0
-- | Undocumented member. ccpgrsClusterParameterGroup :: Lens' CreateClusterParameterGroupResponse (Maybe ClusterParameterGroup) ccpgrsClusterParameterGroup = lens _ccpgrsClusterParameterGroup (\ s a -> s{_ccpgrsClusterParameterGroup = a})
239
ccpgrsClusterParameterGroup :: Lens' CreateClusterParameterGroupResponse (Maybe ClusterParameterGroup) ccpgrsClusterParameterGroup = lens _ccpgrsClusterParameterGroup (\ s a -> s{_ccpgrsClusterParameterGroup = a})
213
ccpgrsClusterParameterGroup = lens _ccpgrsClusterParameterGroup (\ s a -> s{_ccpgrsClusterParameterGroup = a})
110
true
true
0
9
20
46
25
21
null
null
ndmitchell/tagsoup
test/TagSoup/Generate/Desugar.hs
bsd-3-clause
fExp (List (x:xs)) = fExp $ App (App (var "(:)") x) (List xs)
61
fExp (List (x:xs)) = fExp $ App (App (var "(:)") x) (List xs)
61
fExp (List (x:xs)) = fExp $ App (App (var "(:)") x) (List xs)
61
false
false
0
10
12
51
25
26
null
null
jimsnow/glome
GlomeView/Glome.hs
gpl-2.0
-- Four colors should be in order, CW or CCW. decide :: Flt -> Flt -> Flt -> Scene -> TColor -> TColor -> TColor -> TColor -> TColor decide threshold xf yf scene a b c d = let variance = fmax (cCmp a c) (cCmp b d) in if variance > threshold then let (ColorA r g b a, d) = get_color xf yf scene in (r, g, b, a, d) else cAvg a b c d
354
decide :: Flt -> Flt -> Flt -> Scene -> TColor -> TColor -> TColor -> TColor -> TColor decide threshold xf yf scene a b c d = let variance = fmax (cCmp a c) (cCmp b d) in if variance > threshold then let (ColorA r g b a, d) = get_color xf yf scene in (r, g, b, a, d) else cAvg a b c d
308
decide threshold xf yf scene a b c d = let variance = fmax (cCmp a c) (cCmp b d) in if variance > threshold then let (ColorA r g b a, d) = get_color xf yf scene in (r, g, b, a, d) else cAvg a b c d
221
true
true
0
14
102
172
84
88
null
null
DaMSL/K3
src/Language/K3/Codegen/CPP/Common.hs
apache-2.0
-- Whether the type is a primitive in C++ primitiveType :: K3 Type -> Bool primitiveType (tag &&& children -> (TTuple, [])) = True
130
primitiveType :: K3 Type -> Bool primitiveType (tag &&& children -> (TTuple, [])) = True
88
primitiveType (tag &&& children -> (TTuple, [])) = True
55
true
true
0
9
23
41
22
19
null
null
haskell-game/fungen
examples/worms/worms.hs
bsd-3-clause
-- position of the paths in the list: border1, border2, border3, free1, free2, free3 :: Int border1 = 11
106
border1, border2, border3, free1, free2, free3 :: Int border1 = 11
66
border1 = 11
12
true
true
0
4
20
22
17
5
null
null
gregorias/rummikubsolver
src/Interface/Console.hs
gpl-3.0
modifyCommand :: (Int -> Tile -> RummikubState -> Maybe RummikubState) -> Game modifyCommand modifyFunction = do (removedTiles, newTiles) <- liftIO readTiles newStateMay <- fmap (addTiles 1 newTiles <=< addTiles (-1) removedTiles) $ get maybe (liftIO $ putStrLn "This modification would lead to invalid state.") put newStateMay liftIO $ putStrLn "" where addTiles :: Int -> [Tile] -> RummikubState -> Maybe RummikubState addTiles count tiles = foldr (>=>) (Just . id) (map (modifyFunction count) tiles)
539
modifyCommand :: (Int -> Tile -> RummikubState -> Maybe RummikubState) -> Game modifyCommand modifyFunction = do (removedTiles, newTiles) <- liftIO readTiles newStateMay <- fmap (addTiles 1 newTiles <=< addTiles (-1) removedTiles) $ get maybe (liftIO $ putStrLn "This modification would lead to invalid state.") put newStateMay liftIO $ putStrLn "" where addTiles :: Int -> [Tile] -> RummikubState -> Maybe RummikubState addTiles count tiles = foldr (>=>) (Just . id) (map (modifyFunction count) tiles)
539
modifyCommand modifyFunction = do (removedTiles, newTiles) <- liftIO readTiles newStateMay <- fmap (addTiles 1 newTiles <=< addTiles (-1) removedTiles) $ get maybe (liftIO $ putStrLn "This modification would lead to invalid state.") put newStateMay liftIO $ putStrLn "" where addTiles :: Int -> [Tile] -> RummikubState -> Maybe RummikubState addTiles count tiles = foldr (>=>) (Just . id) (map (modifyFunction count) tiles)
460
false
true
0
14
110
193
92
101
null
null
typelead/epm
Cabal/Distribution/PackageDescription/Parse.hs
bsd-3-clause
-- --------------------------------------------------------------------------- -- The Library type libFieldDescrs :: [FieldDescr Library] libFieldDescrs = [ listFieldWithSep vcat "exposed-modules" disp parseModuleNameQ exposedModules (\mods lib -> lib{exposedModules=mods}) , commaListFieldWithSep vcat "reexported-modules" disp parse reexportedModules (\mods lib -> lib{reexportedModules=mods}) , listFieldWithSep vcat "required-signatures" disp parseModuleNameQ requiredSignatures (\mods lib -> lib{requiredSignatures=mods}) , listFieldWithSep vcat "exposed-signatures" disp parseModuleNameQ exposedSignatures (\mods lib -> lib{exposedSignatures=mods}) , boolField "exposed" libExposed (\val lib -> lib{libExposed=val}) ] ++ map biToLib binfoFieldDescrs where biToLib = liftField libBuildInfo (\bi lib -> lib{libBuildInfo=bi})
881
libFieldDescrs :: [FieldDescr Library] libFieldDescrs = [ listFieldWithSep vcat "exposed-modules" disp parseModuleNameQ exposedModules (\mods lib -> lib{exposedModules=mods}) , commaListFieldWithSep vcat "reexported-modules" disp parse reexportedModules (\mods lib -> lib{reexportedModules=mods}) , listFieldWithSep vcat "required-signatures" disp parseModuleNameQ requiredSignatures (\mods lib -> lib{requiredSignatures=mods}) , listFieldWithSep vcat "exposed-signatures" disp parseModuleNameQ exposedSignatures (\mods lib -> lib{exposedSignatures=mods}) , boolField "exposed" libExposed (\val lib -> lib{libExposed=val}) ] ++ map biToLib binfoFieldDescrs where biToLib = liftField libBuildInfo (\bi lib -> lib{libBuildInfo=bi})
781
libFieldDescrs = [ listFieldWithSep vcat "exposed-modules" disp parseModuleNameQ exposedModules (\mods lib -> lib{exposedModules=mods}) , commaListFieldWithSep vcat "reexported-modules" disp parse reexportedModules (\mods lib -> lib{reexportedModules=mods}) , listFieldWithSep vcat "required-signatures" disp parseModuleNameQ requiredSignatures (\mods lib -> lib{requiredSignatures=mods}) , listFieldWithSep vcat "exposed-signatures" disp parseModuleNameQ exposedSignatures (\mods lib -> lib{exposedSignatures=mods}) , boolField "exposed" libExposed (\val lib -> lib{libExposed=val}) ] ++ map biToLib binfoFieldDescrs where biToLib = liftField libBuildInfo (\bi lib -> lib{libBuildInfo=bi})
742
true
true
3
10
130
234
125
109
null
null