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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
fros1y/umbral | src/Coord.hs | bsd-3-clause | randomDeltas
:: (Random.MonadRandom m)
=> m [Coord]
randomDeltas =
Random.shuffleM
[ (Coord xs ys)
| xs <- [-1, 0, 1]
, ys <- [-1, 0, 1] ] | 174 | randomDeltas
:: (Random.MonadRandom m)
=> m [Coord]
randomDeltas =
Random.shuffleM
[ (Coord xs ys)
| xs <- [-1, 0, 1]
, ys <- [-1, 0, 1] ] | 174 | randomDeltas =
Random.shuffleM
[ (Coord xs ys)
| xs <- [-1, 0, 1]
, ys <- [-1, 0, 1] ] | 114 | false | true | 0 | 10 | 62 | 86 | 46 | 40 | null | null |
mydaum/cabal | Cabal/Distribution/PackageDescription/Parse.hs | bsd-3-clause | binfoFieldDescrs :: [FieldDescr BuildInfo]
binfoFieldDescrs =
[ boolField "buildable"
buildable (\val binfo -> binfo{buildable=val})
, commaListField "build-tools"
disp parse
buildTools (\xs binfo -> binfo{buildTools=xs})
, commaListField "build-tool-depends"
disp parse
buildToolDepends (\xs binfo -> binfo{buildToolDepends=xs})
, commaListFieldWithSep vcat "build-depends"
disp parse
targetBuildDepends (\xs binfo -> binfo{targetBuildDepends=xs})
, commaListFieldWithSep vcat "mixins"
disp parse
mixins (\xs binfo -> binfo{mixins=xs})
, spaceListField "cpp-options"
showToken parseTokenQ'
cppOptions (\val binfo -> binfo{cppOptions=val})
, spaceListField "cc-options"
showToken parseTokenQ'
ccOptions (\val binfo -> binfo{ccOptions=val})
, spaceListField "ld-options"
showToken parseTokenQ'
ldOptions (\val binfo -> binfo{ldOptions=val})
, commaListField "pkgconfig-depends"
disp parse
pkgconfigDepends (\xs binfo -> binfo{pkgconfigDepends=xs})
, listField "frameworks"
showToken parseTokenQ
frameworks (\val binfo -> binfo{frameworks=val})
, listField "extra-framework-dirs"
showToken parseFilePathQ
extraFrameworkDirs (\val binfo -> binfo{extraFrameworkDirs=val})
, listFieldWithSep vcat "c-sources"
showFilePath parseFilePathQ
cSources (\paths binfo -> binfo{cSources=paths})
, listFieldWithSep vcat "js-sources"
showFilePath parseFilePathQ
jsSources (\paths binfo -> binfo{jsSources=paths})
, simpleField "default-language"
(maybe mempty disp) (option Nothing (fmap Just parseLanguageQ))
defaultLanguage (\lang binfo -> binfo{defaultLanguage=lang})
, listField "other-languages"
disp parseLanguageQ
otherLanguages (\langs binfo -> binfo{otherLanguages=langs})
, listField "default-extensions"
disp parseExtensionQ
defaultExtensions (\exts binfo -> binfo{defaultExtensions=exts})
, listField "other-extensions"
disp parseExtensionQ
otherExtensions (\exts binfo -> binfo{otherExtensions=exts})
, listField "extensions"
disp parseExtensionQ
oldExtensions (\exts binfo -> binfo{oldExtensions=exts})
, listFieldWithSep vcat "extra-libraries"
showToken parseTokenQ
extraLibs (\xs binfo -> binfo{extraLibs=xs})
, listFieldWithSep vcat "extra-ghci-libraries"
showToken parseTokenQ
extraGHCiLibs (\xs binfo -> binfo{extraGHCiLibs=xs})
, listField "extra-lib-dirs"
showFilePath parseFilePathQ
extraLibDirs (\xs binfo -> binfo{extraLibDirs=xs})
, listFieldWithSep vcat "includes"
showFilePath parseFilePathQ
includes (\paths binfo -> binfo{includes=paths})
, listFieldWithSep vcat "install-includes"
showFilePath parseFilePathQ
installIncludes (\paths binfo -> binfo{installIncludes=paths})
, listField "include-dirs"
showFilePath parseFilePathQ
includeDirs (\paths binfo -> binfo{includeDirs=paths})
, listField "hs-source-dirs"
showFilePath parseFilePathQ
hsSourceDirs (\paths binfo -> binfo{hsSourceDirs=paths})
, listFieldWithSep vcat "other-modules"
disp parseModuleNameQ
otherModules (\val binfo -> binfo{otherModules=val})
, listFieldWithSep vcat "autogen-modules"
disp parseModuleNameQ
autogenModules (\val binfo -> binfo{autogenModules=val})
, optsField "ghc-prof-options" GHC
profOptions (\val binfo -> binfo{profOptions=val})
, optsField "ghcjs-prof-options" GHCJS
profOptions (\val binfo -> binfo{profOptions=val})
, optsField "ghc-shared-options" GHC
sharedOptions (\val binfo -> binfo{sharedOptions=val})
, optsField "ghcjs-shared-options" GHCJS
sharedOptions (\val binfo -> binfo{sharedOptions=val})
, optsField "ghc-options" GHC
options (\path binfo -> binfo{options=path})
, optsField "ghcjs-options" GHCJS
options (\path binfo -> binfo{options=path})
, optsField "jhc-options" JHC
options (\path binfo -> binfo{options=path})
-- NOTE: Hugs and NHC are not supported anymore, but these fields are kept
-- around for backwards compatibility.
, optsField "hugs-options" Hugs
options (const id)
, optsField "nhc98-options" NHC
options (const id)
] | 5,132 | binfoFieldDescrs :: [FieldDescr BuildInfo]
binfoFieldDescrs =
[ boolField "buildable"
buildable (\val binfo -> binfo{buildable=val})
, commaListField "build-tools"
disp parse
buildTools (\xs binfo -> binfo{buildTools=xs})
, commaListField "build-tool-depends"
disp parse
buildToolDepends (\xs binfo -> binfo{buildToolDepends=xs})
, commaListFieldWithSep vcat "build-depends"
disp parse
targetBuildDepends (\xs binfo -> binfo{targetBuildDepends=xs})
, commaListFieldWithSep vcat "mixins"
disp parse
mixins (\xs binfo -> binfo{mixins=xs})
, spaceListField "cpp-options"
showToken parseTokenQ'
cppOptions (\val binfo -> binfo{cppOptions=val})
, spaceListField "cc-options"
showToken parseTokenQ'
ccOptions (\val binfo -> binfo{ccOptions=val})
, spaceListField "ld-options"
showToken parseTokenQ'
ldOptions (\val binfo -> binfo{ldOptions=val})
, commaListField "pkgconfig-depends"
disp parse
pkgconfigDepends (\xs binfo -> binfo{pkgconfigDepends=xs})
, listField "frameworks"
showToken parseTokenQ
frameworks (\val binfo -> binfo{frameworks=val})
, listField "extra-framework-dirs"
showToken parseFilePathQ
extraFrameworkDirs (\val binfo -> binfo{extraFrameworkDirs=val})
, listFieldWithSep vcat "c-sources"
showFilePath parseFilePathQ
cSources (\paths binfo -> binfo{cSources=paths})
, listFieldWithSep vcat "js-sources"
showFilePath parseFilePathQ
jsSources (\paths binfo -> binfo{jsSources=paths})
, simpleField "default-language"
(maybe mempty disp) (option Nothing (fmap Just parseLanguageQ))
defaultLanguage (\lang binfo -> binfo{defaultLanguage=lang})
, listField "other-languages"
disp parseLanguageQ
otherLanguages (\langs binfo -> binfo{otherLanguages=langs})
, listField "default-extensions"
disp parseExtensionQ
defaultExtensions (\exts binfo -> binfo{defaultExtensions=exts})
, listField "other-extensions"
disp parseExtensionQ
otherExtensions (\exts binfo -> binfo{otherExtensions=exts})
, listField "extensions"
disp parseExtensionQ
oldExtensions (\exts binfo -> binfo{oldExtensions=exts})
, listFieldWithSep vcat "extra-libraries"
showToken parseTokenQ
extraLibs (\xs binfo -> binfo{extraLibs=xs})
, listFieldWithSep vcat "extra-ghci-libraries"
showToken parseTokenQ
extraGHCiLibs (\xs binfo -> binfo{extraGHCiLibs=xs})
, listField "extra-lib-dirs"
showFilePath parseFilePathQ
extraLibDirs (\xs binfo -> binfo{extraLibDirs=xs})
, listFieldWithSep vcat "includes"
showFilePath parseFilePathQ
includes (\paths binfo -> binfo{includes=paths})
, listFieldWithSep vcat "install-includes"
showFilePath parseFilePathQ
installIncludes (\paths binfo -> binfo{installIncludes=paths})
, listField "include-dirs"
showFilePath parseFilePathQ
includeDirs (\paths binfo -> binfo{includeDirs=paths})
, listField "hs-source-dirs"
showFilePath parseFilePathQ
hsSourceDirs (\paths binfo -> binfo{hsSourceDirs=paths})
, listFieldWithSep vcat "other-modules"
disp parseModuleNameQ
otherModules (\val binfo -> binfo{otherModules=val})
, listFieldWithSep vcat "autogen-modules"
disp parseModuleNameQ
autogenModules (\val binfo -> binfo{autogenModules=val})
, optsField "ghc-prof-options" GHC
profOptions (\val binfo -> binfo{profOptions=val})
, optsField "ghcjs-prof-options" GHCJS
profOptions (\val binfo -> binfo{profOptions=val})
, optsField "ghc-shared-options" GHC
sharedOptions (\val binfo -> binfo{sharedOptions=val})
, optsField "ghcjs-shared-options" GHCJS
sharedOptions (\val binfo -> binfo{sharedOptions=val})
, optsField "ghc-options" GHC
options (\path binfo -> binfo{options=path})
, optsField "ghcjs-options" GHCJS
options (\path binfo -> binfo{options=path})
, optsField "jhc-options" JHC
options (\path binfo -> binfo{options=path})
-- NOTE: Hugs and NHC are not supported anymore, but these fields are kept
-- around for backwards compatibility.
, optsField "hugs-options" Hugs
options (const id)
, optsField "nhc98-options" NHC
options (const id)
] | 5,132 | binfoFieldDescrs =
[ boolField "buildable"
buildable (\val binfo -> binfo{buildable=val})
, commaListField "build-tools"
disp parse
buildTools (\xs binfo -> binfo{buildTools=xs})
, commaListField "build-tool-depends"
disp parse
buildToolDepends (\xs binfo -> binfo{buildToolDepends=xs})
, commaListFieldWithSep vcat "build-depends"
disp parse
targetBuildDepends (\xs binfo -> binfo{targetBuildDepends=xs})
, commaListFieldWithSep vcat "mixins"
disp parse
mixins (\xs binfo -> binfo{mixins=xs})
, spaceListField "cpp-options"
showToken parseTokenQ'
cppOptions (\val binfo -> binfo{cppOptions=val})
, spaceListField "cc-options"
showToken parseTokenQ'
ccOptions (\val binfo -> binfo{ccOptions=val})
, spaceListField "ld-options"
showToken parseTokenQ'
ldOptions (\val binfo -> binfo{ldOptions=val})
, commaListField "pkgconfig-depends"
disp parse
pkgconfigDepends (\xs binfo -> binfo{pkgconfigDepends=xs})
, listField "frameworks"
showToken parseTokenQ
frameworks (\val binfo -> binfo{frameworks=val})
, listField "extra-framework-dirs"
showToken parseFilePathQ
extraFrameworkDirs (\val binfo -> binfo{extraFrameworkDirs=val})
, listFieldWithSep vcat "c-sources"
showFilePath parseFilePathQ
cSources (\paths binfo -> binfo{cSources=paths})
, listFieldWithSep vcat "js-sources"
showFilePath parseFilePathQ
jsSources (\paths binfo -> binfo{jsSources=paths})
, simpleField "default-language"
(maybe mempty disp) (option Nothing (fmap Just parseLanguageQ))
defaultLanguage (\lang binfo -> binfo{defaultLanguage=lang})
, listField "other-languages"
disp parseLanguageQ
otherLanguages (\langs binfo -> binfo{otherLanguages=langs})
, listField "default-extensions"
disp parseExtensionQ
defaultExtensions (\exts binfo -> binfo{defaultExtensions=exts})
, listField "other-extensions"
disp parseExtensionQ
otherExtensions (\exts binfo -> binfo{otherExtensions=exts})
, listField "extensions"
disp parseExtensionQ
oldExtensions (\exts binfo -> binfo{oldExtensions=exts})
, listFieldWithSep vcat "extra-libraries"
showToken parseTokenQ
extraLibs (\xs binfo -> binfo{extraLibs=xs})
, listFieldWithSep vcat "extra-ghci-libraries"
showToken parseTokenQ
extraGHCiLibs (\xs binfo -> binfo{extraGHCiLibs=xs})
, listField "extra-lib-dirs"
showFilePath parseFilePathQ
extraLibDirs (\xs binfo -> binfo{extraLibDirs=xs})
, listFieldWithSep vcat "includes"
showFilePath parseFilePathQ
includes (\paths binfo -> binfo{includes=paths})
, listFieldWithSep vcat "install-includes"
showFilePath parseFilePathQ
installIncludes (\paths binfo -> binfo{installIncludes=paths})
, listField "include-dirs"
showFilePath parseFilePathQ
includeDirs (\paths binfo -> binfo{includeDirs=paths})
, listField "hs-source-dirs"
showFilePath parseFilePathQ
hsSourceDirs (\paths binfo -> binfo{hsSourceDirs=paths})
, listFieldWithSep vcat "other-modules"
disp parseModuleNameQ
otherModules (\val binfo -> binfo{otherModules=val})
, listFieldWithSep vcat "autogen-modules"
disp parseModuleNameQ
autogenModules (\val binfo -> binfo{autogenModules=val})
, optsField "ghc-prof-options" GHC
profOptions (\val binfo -> binfo{profOptions=val})
, optsField "ghcjs-prof-options" GHCJS
profOptions (\val binfo -> binfo{profOptions=val})
, optsField "ghc-shared-options" GHC
sharedOptions (\val binfo -> binfo{sharedOptions=val})
, optsField "ghcjs-shared-options" GHCJS
sharedOptions (\val binfo -> binfo{sharedOptions=val})
, optsField "ghc-options" GHC
options (\path binfo -> binfo{options=path})
, optsField "ghcjs-options" GHCJS
options (\path binfo -> binfo{options=path})
, optsField "jhc-options" JHC
options (\path binfo -> binfo{options=path})
-- NOTE: Hugs and NHC are not supported anymore, but these fields are kept
-- around for backwards compatibility.
, optsField "hugs-options" Hugs
options (const id)
, optsField "nhc98-options" NHC
options (const id)
] | 5,089 | false | true | 0 | 10 | 1,662 | 1,169 | 654 | 515 | null | null |
chrisdone/ghc-server | src/GHC/Compat.hs | bsd-3-clause | ghcVersion = Ghc78 | 18 | ghcVersion = Ghc78 | 18 | ghcVersion = Ghc78 | 18 | false | false | 0 | 4 | 2 | 6 | 3 | 3 | null | null |
thoughtbot/carnival | Model/User.hs | mit | userGravatar :: User -> Text
userGravatar = T.pack . gravatar def . userEmail | 77 | userGravatar :: User -> Text
userGravatar = T.pack . gravatar def . userEmail | 77 | userGravatar = T.pack . gravatar def . userEmail | 48 | false | true | 0 | 7 | 12 | 35 | 15 | 20 | null | null |
kadena-io/pact | src/Pact/PersistPactDb.hs | bsd-3-clause | toTableId Pacts = pactsTable | 28 | toTableId Pacts = pactsTable | 28 | toTableId Pacts = pactsTable | 28 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
pjones/xmonad-test | vendor/xmonad-contrib/XMonad/Hooks/DebugEvents.hs | bsd-2-clause | finiteBitSize :: Bits a => a -> Int
finiteBitSize x = bitSize x | 63 | finiteBitSize :: Bits a => a -> Int
finiteBitSize x = bitSize x | 63 | finiteBitSize x = bitSize x | 27 | false | true | 0 | 8 | 12 | 33 | 14 | 19 | null | null |
kawamuray/ganeti | src/Ganeti/Kvmd.hs | gpl-2.0 | handleTargetEvent lock _ tarDir ev =
handleGenericEvent lock tarDir tarDir ev | 79 | handleTargetEvent lock _ tarDir ev =
handleGenericEvent lock tarDir tarDir ev | 79 | handleTargetEvent lock _ tarDir ev =
handleGenericEvent lock tarDir tarDir ev | 79 | false | false | 0 | 5 | 12 | 24 | 11 | 13 | null | null |
colinba/tip-toi-reveng | src/Commands.hs | mit | export :: FilePath -> FilePath -> IO ()
export inf out = do
(tt,_) <- parseTipToiFile <$> B.readFile inf
let tty = tt2ttYaml (printf "media/%s_%%s" (takeBaseName inf)) tt
ex <- doesFileExist out
if ex
then printf "File \"%s\" does already exist. Please remove it first\nif you want to export \"%s\" again.\n" out inf >> exitFailure
else writeTipToiYaml out tty | 392 | export :: FilePath -> FilePath -> IO ()
export inf out = do
(tt,_) <- parseTipToiFile <$> B.readFile inf
let tty = tt2ttYaml (printf "media/%s_%%s" (takeBaseName inf)) tt
ex <- doesFileExist out
if ex
then printf "File \"%s\" does already exist. Please remove it first\nif you want to export \"%s\" again.\n" out inf >> exitFailure
else writeTipToiYaml out tty | 392 | export inf out = do
(tt,_) <- parseTipToiFile <$> B.readFile inf
let tty = tt2ttYaml (printf "media/%s_%%s" (takeBaseName inf)) tt
ex <- doesFileExist out
if ex
then printf "File \"%s\" does already exist. Please remove it first\nif you want to export \"%s\" again.\n" out inf >> exitFailure
else writeTipToiYaml out tty | 352 | false | true | 0 | 14 | 90 | 116 | 55 | 61 | null | null |
forked-upstream-packages-for-ghcjs/ghc | compiler/simplCore/SimplMonad.hs | bsd-3-clause | checkedTick :: Tick -> SimplM ()
-- Try to take a tick, but fail if too many
checkedTick t
= SM (\st_env us sc -> if st_max_ticks st_env <= simplCountN sc
then pprPanic "Simplifier ticks exhausted" (msg sc)
else let sc' = doSimplTick (st_flags st_env) t sc
in sc' `seq` return ((), us, sc'))
where
msg sc = vcat [ ptext (sLit "When trying") <+> ppr t
, ptext (sLit "To increase the limit, use -fsimpl-tick-factor=N (default 100)")
, ptext (sLit "If you need to do this, let GHC HQ know, and what factor you needed")
, pp_details sc
, pprSimplCount sc ]
pp_details sc
| hasDetailedCounts sc = empty
| otherwise = ptext (sLit "To see detailed counts use -ddump-simpl-stats") | 848 | checkedTick :: Tick -> SimplM ()
checkedTick t
= SM (\st_env us sc -> if st_max_ticks st_env <= simplCountN sc
then pprPanic "Simplifier ticks exhausted" (msg sc)
else let sc' = doSimplTick (st_flags st_env) t sc
in sc' `seq` return ((), us, sc'))
where
msg sc = vcat [ ptext (sLit "When trying") <+> ppr t
, ptext (sLit "To increase the limit, use -fsimpl-tick-factor=N (default 100)")
, ptext (sLit "If you need to do this, let GHC HQ know, and what factor you needed")
, pp_details sc
, pprSimplCount sc ]
pp_details sc
| hasDetailedCounts sc = empty
| otherwise = ptext (sLit "To see detailed counts use -ddump-simpl-stats") | 804 | checkedTick t
= SM (\st_env us sc -> if st_max_ticks st_env <= simplCountN sc
then pprPanic "Simplifier ticks exhausted" (msg sc)
else let sc' = doSimplTick (st_flags st_env) t sc
in sc' `seq` return ((), us, sc'))
where
msg sc = vcat [ ptext (sLit "When trying") <+> ppr t
, ptext (sLit "To increase the limit, use -fsimpl-tick-factor=N (default 100)")
, ptext (sLit "If you need to do this, let GHC HQ know, and what factor you needed")
, pp_details sc
, pprSimplCount sc ]
pp_details sc
| hasDetailedCounts sc = empty
| otherwise = ptext (sLit "To see detailed counts use -ddump-simpl-stats") | 771 | true | true | 0 | 15 | 296 | 216 | 105 | 111 | null | null |
castaway/pandoc | src/Text/Pandoc/Pretty.hs | gpl-2.0 | -- | Puts a 'Doc' in square brackets.
brackets :: Doc -> Doc
brackets = inside (char '[') (char ']') | 100 | brackets :: Doc -> Doc
brackets = inside (char '[') (char ']') | 62 | brackets = inside (char '[') (char ']') | 39 | true | true | 0 | 7 | 19 | 33 | 17 | 16 | null | null |
olsner/ghc | testsuite/tests/perf/compiler/T10370.hs | bsd-3-clause | a941 :: IO (); a941 = forever $ putStrLn "a941" | 47 | a941 :: IO ()
a941 = forever $ putStrLn "a941" | 46 | a941 = forever $ putStrLn "a941" | 32 | false | true | 0 | 6 | 9 | 24 | 12 | 12 | null | null |
aldld/hasp | src/Parser.hs | bsd-3-clause | traverseExprTokens [] acc ( ")":tokens) =
throw $ SyntaxError "Unexpected token \")\"" | 90 | traverseExprTokens [] acc ( ")":tokens) =
throw $ SyntaxError "Unexpected token \")\"" | 90 | traverseExprTokens [] acc ( ")":tokens) =
throw $ SyntaxError "Unexpected token \")\"" | 90 | false | false | 0 | 7 | 15 | 29 | 14 | 15 | null | null |
facebookincubator/duckling | Duckling/Rules/ID.hs | bsd-3-clause | localeRules :: Region -> Seal Dimension -> [Rule]
localeRules region (Seal (CustomDimension dim)) = dimLocaleRules region dim | 125 | localeRules :: Region -> Seal Dimension -> [Rule]
localeRules region (Seal (CustomDimension dim)) = dimLocaleRules region dim | 125 | localeRules region (Seal (CustomDimension dim)) = dimLocaleRules region dim | 75 | false | true | 0 | 9 | 16 | 47 | 23 | 24 | null | null |
fehu/haskell-java-bridge-fork | src/Foreign/Java/Bindings/JavaTypes.hs | mit | classDependencies :: JavaClass -> [String]
-- ^ Calculate all classes that are referenced in any way by this class.
classDependencies clazz = concat [
classParents clazz,
classIfaces clazz,
concatMap methodDependencies (classMethods clazz),
concatMap constructorDependencies (classConstructors clazz) ] | 318 | classDependencies :: JavaClass -> [String]
classDependencies clazz = concat [
classParents clazz,
classIfaces clazz,
concatMap methodDependencies (classMethods clazz),
concatMap constructorDependencies (classConstructors clazz) ] | 245 | classDependencies clazz = concat [
classParents clazz,
classIfaces clazz,
concatMap methodDependencies (classMethods clazz),
concatMap constructorDependencies (classConstructors clazz) ] | 202 | true | true | 0 | 9 | 52 | 70 | 34 | 36 | null | null |
pharaun/hDirDiff | src/lib/FileHash.hs | apache-2.0 | spaces :: Parser ()
spaces = skip (\w -> w == wSpace
|| w == wTab) | 84 | spaces :: Parser ()
spaces = skip (\w -> w == wSpace
|| w == wTab) | 84 | spaces = skip (\w -> w == wSpace
|| w == wTab) | 64 | false | true | 1 | 10 | 33 | 43 | 20 | 23 | null | null |
tjakway/ghcjvm | compiler/basicTypes/Id.hs | bsd-3-clause | isDictId :: Id -> Bool
isDictId id = isDictTy (idType id) | 57 | isDictId :: Id -> Bool
isDictId id = isDictTy (idType id) | 57 | isDictId id = isDictTy (idType id) | 34 | false | true | 0 | 7 | 10 | 33 | 14 | 19 | null | null |
CulpaBS/wbBach | src/Futhark/Representation/SOACS/Simplify.hs | bsd-3-clause | soacRules :: (MonadBinder m,
LocalScope (Lore m) m,
Op (Lore m) ~ SOAC (Lore m)) => RuleBook m
soacRules = (std_td_rules <> topDownRules,
std_bu_rules <> bottomUpRules)
where (std_td_rules, std_bu_rules) = standardRules | 262 | soacRules :: (MonadBinder m,
LocalScope (Lore m) m,
Op (Lore m) ~ SOAC (Lore m)) => RuleBook m
soacRules = (std_td_rules <> topDownRules,
std_bu_rules <> bottomUpRules)
where (std_td_rules, std_bu_rules) = standardRules | 262 | soacRules = (std_td_rules <> topDownRules,
std_bu_rules <> bottomUpRules)
where (std_td_rules, std_bu_rules) = standardRules | 139 | false | true | 0 | 10 | 73 | 91 | 47 | 44 | null | null |
urbanslug/ghc | compiler/prelude/PrelNames.hs | bsd-3-clause | enumFromToClassOpKey = mkPreludeMiscIdUnique 165 | 57 | enumFromToClassOpKey = mkPreludeMiscIdUnique 165 | 57 | enumFromToClassOpKey = mkPreludeMiscIdUnique 165 | 57 | false | false | 0 | 5 | 12 | 9 | 4 | 5 | null | null |
ekmett/transients | src/Data/Transient/Primitive/SmallArray.hs | bsd-2-clause | unsafeThawSmallArray (SmallArray arr#)
= primitive (\s# -> case unsafeThawSmallArray# arr# s# of
(# s'#, arr'# #) -> (# s'#, SmallMutableArray arr'# #)) | 178 | unsafeThawSmallArray (SmallArray arr#)
= primitive (\s# -> case unsafeThawSmallArray# arr# s# of
(# s'#, arr'# #) -> (# s'#, SmallMutableArray arr'# #)) | 178 | unsafeThawSmallArray (SmallArray arr#)
= primitive (\s# -> case unsafeThawSmallArray# arr# s# of
(# s'#, arr'# #) -> (# s'#, SmallMutableArray arr'# #)) | 178 | false | false | 0 | 12 | 47 | 54 | 27 | 27 | null | null |
beni55/attoparsec | tests/QC/ByteString.hs | bsd-3-clause | takeLazyByteString :: L.ByteString -> Property
takeLazyByteString s = maybe (property False) (=== s) .
parseBS P.takeLazyByteString $ s | 158 | takeLazyByteString :: L.ByteString -> Property
takeLazyByteString s = maybe (property False) (=== s) .
parseBS P.takeLazyByteString $ s | 158 | takeLazyByteString s = maybe (property False) (=== s) .
parseBS P.takeLazyByteString $ s | 111 | false | true | 0 | 9 | 40 | 48 | 24 | 24 | null | null |
bitemyapp/ghc | compiler/typecheck/TcType.hs | bsd-3-clause | isSkolemTyVar tv
= ASSERT2( isTcTyVar tv, ppr tv )
case tcTyVarDetails tv of
MetaTv {} -> False
_other -> True | 135 | isSkolemTyVar tv
= ASSERT2( isTcTyVar tv, ppr tv )
case tcTyVarDetails tv of
MetaTv {} -> False
_other -> True | 135 | isSkolemTyVar tv
= ASSERT2( isTcTyVar tv, ppr tv )
case tcTyVarDetails tv of
MetaTv {} -> False
_other -> True | 135 | false | false | 1 | 8 | 44 | 54 | 23 | 31 | null | null |
jtojnar/haste-compiler | libraries/ghc-7.10/ghc-prim/GHC/PrimopWrappers.hs | bsd-3-clause | newArrayArray# :: Int# -> State# s -> (# State# s,MutableArrayArray# s #)
newArrayArray# a1 a2 = (GHC.Prim.newArrayArray#) a1 a2 | 128 | newArrayArray# :: Int# -> State# s -> (# State# s,MutableArrayArray# s #)
newArrayArray# a1 a2 = (GHC.Prim.newArrayArray#) a1 a2 | 128 | newArrayArray# a1 a2 = (GHC.Prim.newArrayArray#) a1 a2 | 54 | false | true | 0 | 8 | 18 | 53 | 25 | 28 | null | null |
rueshyna/gogol | gogol-fitness/gen/Network/Google/Fitness/Types/Product.hs | mpl-2.0 | -- | Session active time. While start_time_millis and end_time_millis define
-- the full session time, the active time can be shorter and specified by
-- active_time_millis. If the inactive time during the session is known, it
-- should also be inserted via a com.google.activity.segment data point
-- with a STILL activity value
sActiveTimeMillis :: Lens' Session (Maybe Int64)
sActiveTimeMillis
= lens _sActiveTimeMillis
(\ s a -> s{_sActiveTimeMillis = a})
. mapping _Coerce | 491 | sActiveTimeMillis :: Lens' Session (Maybe Int64)
sActiveTimeMillis
= lens _sActiveTimeMillis
(\ s a -> s{_sActiveTimeMillis = a})
. mapping _Coerce | 161 | sActiveTimeMillis
= lens _sActiveTimeMillis
(\ s a -> s{_sActiveTimeMillis = a})
. mapping _Coerce | 112 | true | true | 0 | 10 | 85 | 59 | 32 | 27 | null | null |
alexander-at-github/eta | compiler/ETA/Prelude/PrimOp.hs | bsd-3-clause | primOpStrictness :: PrimOp -> Arity -> StrictSig
-- See Demand.StrictnessInfo for discussion of what the results
-- The arity should be the arity of the primop; that's why
-- this function isn't exported.
primOpStrictness CatchOp = \ _arity -> mkClosedStrictSig [apply1Dmd,apply2Dmd,topDmd] topRes | 322 | primOpStrictness :: PrimOp -> Arity -> StrictSig
primOpStrictness CatchOp = \ _arity -> mkClosedStrictSig [apply1Dmd,apply2Dmd,topDmd] topRes | 142 | primOpStrictness CatchOp = \ _arity -> mkClosedStrictSig [apply1Dmd,apply2Dmd,topDmd] topRes | 93 | true | true | 0 | 7 | 66 | 44 | 25 | 19 | null | null |
nickbart1980/pandoc | src/Text/Pandoc/Readers/LaTeX.hs | gpl-2.0 | quoted' :: (Inlines -> Inlines) -> LP String -> LP () -> LP Inlines
quoted' f starter ender = do
startchs <- starter
try ((f . mconcat) <$> manyTill inline ender) <|> lit startchs | 183 | quoted' :: (Inlines -> Inlines) -> LP String -> LP () -> LP Inlines
quoted' f starter ender = do
startchs <- starter
try ((f . mconcat) <$> manyTill inline ender) <|> lit startchs | 183 | quoted' f starter ender = do
startchs <- starter
try ((f . mconcat) <$> manyTill inline ender) <|> lit startchs | 115 | false | true | 0 | 12 | 37 | 87 | 41 | 46 | null | null |
brendanhay/gogol | gogol-youtube/gen/Network/Google/YouTube/Types/Product.hs | mpl-2.0 | -- | The visitorId identifies the visitor.
mllrVisitorId :: Lens' MembershipsLevelListResponse (Maybe Text)
mllrVisitorId
= lens _mllrVisitorId
(\ s a -> s{_mllrVisitorId = a}) | 184 | mllrVisitorId :: Lens' MembershipsLevelListResponse (Maybe Text)
mllrVisitorId
= lens _mllrVisitorId
(\ s a -> s{_mllrVisitorId = a}) | 141 | mllrVisitorId
= lens _mllrVisitorId
(\ s a -> s{_mllrVisitorId = a}) | 76 | true | true | 0 | 9 | 31 | 48 | 25 | 23 | null | null |
ku-fpg/kansas-amber | tests/ExprTests/ExprWord8.hs | bsd-3-clause | prop_sign :: ArduinoConnection -> RemoteRef Word8 -> Word8 -> Property
prop_sign c r x = monadicIO $ do
let local = signum x
remote <- run $ send c $ do
writeRemoteRefE r $ signum (lit x)
v <- readRemoteRefE r
return v
assert (local == litEval8 remote) | 288 | prop_sign :: ArduinoConnection -> RemoteRef Word8 -> Word8 -> Property
prop_sign c r x = monadicIO $ do
let local = signum x
remote <- run $ send c $ do
writeRemoteRefE r $ signum (lit x)
v <- readRemoteRefE r
return v
assert (local == litEval8 remote) | 288 | prop_sign c r x = monadicIO $ do
let local = signum x
remote <- run $ send c $ do
writeRemoteRefE r $ signum (lit x)
v <- readRemoteRefE r
return v
assert (local == litEval8 remote) | 217 | false | true | 0 | 16 | 83 | 124 | 53 | 71 | null | null |
sherwoodwang/wxHaskell | wxcore/src/haskell/Graphics/UI/WXCore/Events.hs | lgpl-2.1 | fromPropertyGridEvent :: PropertyGridEvent a -> IO EventPropertyGrid
fromPropertyGridEvent propertyGridEvent
= do tp <- eventGetEventType propertyGridEvent
case lookup tp propertyGridEvents of
Just f -> f propertyGridEvent
Nothing -> return PropertyGridUnknown | 289 | fromPropertyGridEvent :: PropertyGridEvent a -> IO EventPropertyGrid
fromPropertyGridEvent propertyGridEvent
= do tp <- eventGetEventType propertyGridEvent
case lookup tp propertyGridEvents of
Just f -> f propertyGridEvent
Nothing -> return PropertyGridUnknown | 289 | fromPropertyGridEvent propertyGridEvent
= do tp <- eventGetEventType propertyGridEvent
case lookup tp propertyGridEvents of
Just f -> f propertyGridEvent
Nothing -> return PropertyGridUnknown | 220 | false | true | 0 | 10 | 57 | 67 | 29 | 38 | null | null |
binesiyu/ifl | examples/ch27/syslogclient.hs | mit | closelog :: SyslogHandle -> IO ()
closelog syslogh = sClose (slSocket syslogh) | 78 | closelog :: SyslogHandle -> IO ()
closelog syslogh = sClose (slSocket syslogh) | 78 | closelog syslogh = sClose (slSocket syslogh) | 44 | false | true | 0 | 8 | 11 | 36 | 16 | 20 | null | null |
input-output-hk/pos-haskell-prototype | chain/src/Pos/Chain/Ssc/CommitmentsMap.hs | mit | decodeCommitments :: Decoder s CommitmentsMap
decodeCommitments = do
comms <- toList <$> decode @(HashSet SignedCommitment)
unless (allDistinct (map (view _1) comms :: [PublicKey])) $ cborError $
"decodeCommitments: two commitments have the same signing key"
pure (mkCommitmentsMap comms) | 308 | decodeCommitments :: Decoder s CommitmentsMap
decodeCommitments = do
comms <- toList <$> decode @(HashSet SignedCommitment)
unless (allDistinct (map (view _1) comms :: [PublicKey])) $ cborError $
"decodeCommitments: two commitments have the same signing key"
pure (mkCommitmentsMap comms) | 308 | decodeCommitments = do
comms <- toList <$> decode @(HashSet SignedCommitment)
unless (allDistinct (map (view _1) comms :: [PublicKey])) $ cborError $
"decodeCommitments: two commitments have the same signing key"
pure (mkCommitmentsMap comms) | 262 | false | true | 0 | 16 | 56 | 96 | 44 | 52 | null | null |
phischu/fragnix | tests/packages/scotty/Control.Monad.Trans.Except.hs | bsd-3-clause | throwE :: (Monad m) => e -> ExceptT e m a
throwE = ExceptT . return . Left | 74 | throwE :: (Monad m) => e -> ExceptT e m a
throwE = ExceptT . return . Left | 74 | throwE = ExceptT . return . Left | 32 | false | true | 0 | 7 | 17 | 39 | 20 | 19 | null | null |
evgenim/tm | src/TM/OptionParser.hs | gpl-3.0 | parseOptions :: [String] -> Config -> Config
parseOptions [] config = config | 76 | parseOptions :: [String] -> Config -> Config
parseOptions [] config = config | 76 | parseOptions [] config = config | 31 | false | true | 0 | 6 | 11 | 29 | 15 | 14 | null | null |
jacekszymanski/wxHaskell | wxcore/src/haskell/Graphics/UI/WXCore/WxcDefs.hs | lgpl-2.1 | wxAUI_DOCK_LEFT :: Int
wxAUI_DOCK_LEFT = 4 | 42 | wxAUI_DOCK_LEFT :: Int
wxAUI_DOCK_LEFT = 4 | 42 | wxAUI_DOCK_LEFT = 4 | 19 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
sonyandy/tnt | Language/TNT/VarTyper.hs | bsd-3-clause | valS _ = return () | 18 | valS _ = return () | 18 | valS _ = return () | 18 | false | false | 0 | 6 | 4 | 14 | 6 | 8 | null | null |
timthelion/fenfire | Fenfire/Utils.hs | gpl-2.0 | execBreadthT :: Monad m => BreadthT m a -> m ()
execBreadthT m = do rest <- execWriterT (runBreadthT m)
when (not $ null rest) $ execBreadthT (sequence_ rest) | 178 | execBreadthT :: Monad m => BreadthT m a -> m ()
execBreadthT m = do rest <- execWriterT (runBreadthT m)
when (not $ null rest) $ execBreadthT (sequence_ rest) | 178 | execBreadthT m = do rest <- execWriterT (runBreadthT m)
when (not $ null rest) $ execBreadthT (sequence_ rest) | 130 | false | true | 0 | 12 | 48 | 85 | 37 | 48 | null | null |
vdweegen/UvA-Software_Testing | Lab5/Jordan/Lecture5.hs | gpl-3.0 | showVal :: Value -> String
showVal 0 = " " | 42 | showVal :: Value -> String
showVal 0 = " " | 42 | showVal 0 = " " | 15 | false | true | 0 | 7 | 9 | 24 | 10 | 14 | null | null |
ganeti-github-testing/ganeti-test-1 | src/Ganeti/OpParams.hs | bsd-2-clause | pGroupDiskParams :: Field
pGroupDiskParams =
withDoc "Disk templates' parameter defaults" .
optionalField $
simpleField "diskparams"
[t| GenericContainer DiskTemplate (JSObject JSValue) |] | 208 | pGroupDiskParams :: Field
pGroupDiskParams =
withDoc "Disk templates' parameter defaults" .
optionalField $
simpleField "diskparams"
[t| GenericContainer DiskTemplate (JSObject JSValue) |] | 208 | pGroupDiskParams =
withDoc "Disk templates' parameter defaults" .
optionalField $
simpleField "diskparams"
[t| GenericContainer DiskTemplate (JSObject JSValue) |] | 182 | false | true | 2 | 6 | 40 | 40 | 18 | 22 | null | null |
rad1al/hutton_exercises | ch08.hs | gpl-2.0 | isTaut :: Prop -> Bool
isTaut p = and [eval s p | s <- substs p] | 64 | isTaut :: Prop -> Bool
isTaut p = and [eval s p | s <- substs p] | 64 | isTaut p = and [eval s p | s <- substs p] | 41 | false | true | 0 | 9 | 16 | 40 | 19 | 21 | null | null |
hbrouwer/pdrt-sandbox | src/Data/PDRS/Properties.hs | apache-2.0 | isPlainPDRS (PMerge{}) = False | 34 | isPlainPDRS (PMerge{}) = False | 34 | isPlainPDRS (PMerge{}) = False | 34 | false | false | 0 | 6 | 7 | 17 | 8 | 9 | null | null |
facebookincubator/duckling | Duckling/Numeral/BN/Rules.hs | bsd-3-clause | ruleNumeralMap :: HashMap Text Integer
ruleNumeralMap = HashMap.fromList
[ ( "শূন্য", 0 )
, ( "এক", 1 )
, ( "দুই" , 2 )
, ( "তিন", 3 )
, ( "চার", 4 )
, ( "পাঁচ", 5 )
, ( "ছয়", 6 )
, ( "সাত", 7 )
, ( "আট", 8 )
, ( "নয়" , 9 )
, ( "দশ", 10 )
] | 264 | ruleNumeralMap :: HashMap Text Integer
ruleNumeralMap = HashMap.fromList
[ ( "শূন্য", 0 )
, ( "এক", 1 )
, ( "দুই" , 2 )
, ( "তিন", 3 )
, ( "চার", 4 )
, ( "পাঁচ", 5 )
, ( "ছয়", 6 )
, ( "সাত", 7 )
, ( "আট", 8 )
, ( "নয়" , 9 )
, ( "দশ", 10 )
] | 264 | ruleNumeralMap = HashMap.fromList
[ ( "শূন্য", 0 )
, ( "এক", 1 )
, ( "দুই" , 2 )
, ( "তিন", 3 )
, ( "চার", 4 )
, ( "পাঁচ", 5 )
, ( "ছয়", 6 )
, ( "সাত", 7 )
, ( "আট", 8 )
, ( "নয়" , 9 )
, ( "দশ", 10 )
] | 225 | false | true | 0 | 6 | 89 | 120 | 76 | 44 | null | null |
bergmark/clay | src/Clay/Elements.hs | bsd-3-clause | small = "small" | 15 | small = "small" | 15 | small = "small" | 15 | false | false | 1 | 5 | 2 | 10 | 3 | 7 | null | null |
DougBurke/swish | tests/RDFProofTest.hs | lgpl-2.1 | rule6 :: RDFRule
rule6 = makeRdfSimpleEntailmentRule name6 | 58 | rule6 :: RDFRule
rule6 = makeRdfSimpleEntailmentRule name6 | 58 | rule6 = makeRdfSimpleEntailmentRule name6 | 41 | false | true | 0 | 5 | 6 | 14 | 7 | 7 | null | null |
ambiata/mafia | src/Mafia/Cabal/Package.hs | bsd-3-clause | toolsOfLibrary :: Cabal.Library -> Set BuildTool
toolsOfLibrary =
toolsOfBuildInfo . libBuildInfo | 99 | toolsOfLibrary :: Cabal.Library -> Set BuildTool
toolsOfLibrary =
toolsOfBuildInfo . libBuildInfo | 99 | toolsOfLibrary =
toolsOfBuildInfo . libBuildInfo | 50 | false | true | 0 | 6 | 12 | 24 | 12 | 12 | null | null |
athanclark/sets | bench/Data/Set/Data.hs | mit | set1 :: Set.Set Int
set1 = setTo 10 | 35 | set1 :: Set.Set Int
set1 = setTo 10 | 35 | set1 = setTo 10 | 15 | false | true | 0 | 6 | 7 | 19 | 9 | 10 | null | null |
olorin/amazonka | amazonka-redshift/gen/Network/AWS/Redshift/Types/Product.hs | mpl-2.0 | -- | The pending or in-progress change of the service version.
pmvClusterVersion :: Lens' PendingModifiedValues (Maybe Text)
pmvClusterVersion = lens _pmvClusterVersion (\ s a -> s{_pmvClusterVersion = a}) | 205 | pmvClusterVersion :: Lens' PendingModifiedValues (Maybe Text)
pmvClusterVersion = lens _pmvClusterVersion (\ s a -> s{_pmvClusterVersion = a}) | 142 | pmvClusterVersion = lens _pmvClusterVersion (\ s a -> s{_pmvClusterVersion = a}) | 80 | true | true | 0 | 9 | 27 | 46 | 25 | 21 | null | null |
jmgimeno/haskell-playground | src/Prompts.hs | unlicense | guarantee :: Monad m => (a -> Maybe b) -> [m a] -> m b
guarantee extract (ma:mas) = do a <- ma
maybe (guarantee extract mas) return (extract a) | 175 | guarantee :: Monad m => (a -> Maybe b) -> [m a] -> m b
guarantee extract (ma:mas) = do a <- ma
maybe (guarantee extract mas) return (extract a) | 175 | guarantee extract (ma:mas) = do a <- ma
maybe (guarantee extract mas) return (extract a) | 120 | false | true | 0 | 9 | 61 | 88 | 42 | 46 | null | null |
snoyberg/ghc | compiler/typecheck/TcRnTypes.hs | bsd-3-clause | pprSkolInfo FamInstSkol = text "a family instance declaration" | 68 | pprSkolInfo FamInstSkol = text "a family instance declaration" | 68 | pprSkolInfo FamInstSkol = text "a family instance declaration" | 68 | false | false | 0 | 5 | 13 | 13 | 5 | 8 | null | null |
zeniuseducation/poly-euler | haskell/next/two.hs | epl-1.0 | is_prime :: Int -> Bool
is_prime p
| p == 2 = True
| even p = False
| otherwise = looper 3
where looper i
| i*i > p = True
| 0 == rem p i = False
| otherwise = looper $ i+2 | 210 | is_prime :: Int -> Bool
is_prime p
| p == 2 = True
| even p = False
| otherwise = looper 3
where looper i
| i*i > p = True
| 0 == rem p i = False
| otherwise = looper $ i+2 | 210 | is_prime p
| p == 2 = True
| even p = False
| otherwise = looper 3
where looper i
| i*i > p = True
| 0 == rem p i = False
| otherwise = looper $ i+2 | 186 | false | true | 2 | 9 | 83 | 108 | 50 | 58 | null | null |
bgamari/unordered-containers | Data/HashMap/Array.hs | bsd-3-clause | -- | Strict version of 'map'.
map' :: (a -> b) -> Array a -> Array b
map' f = \ ary ->
let !n = length ary
in run $ do
mary <- new_ n
go ary mary 0 n
where
go ary mary i n
| i >= n = return mary
| otherwise = do
write mary i $! f (index ary i)
go ary mary (i+1) n
| 339 | map' :: (a -> b) -> Array a -> Array b
map' f = \ ary ->
let !n = length ary
in run $ do
mary <- new_ n
go ary mary 0 n
where
go ary mary i n
| i >= n = return mary
| otherwise = do
write mary i $! f (index ary i)
go ary mary (i+1) n
| 309 | map' f = \ ary ->
let !n = length ary
in run $ do
mary <- new_ n
go ary mary 0 n
where
go ary mary i n
| i >= n = return mary
| otherwise = do
write mary i $! f (index ary i)
go ary mary (i+1) n
| 270 | true | true | 3 | 10 | 146 | 169 | 75 | 94 | null | null |
facebookincubator/duckling | Duckling/Numeral/VI/Rules.hs | bsd-3-clause | ruleNumerals :: Rule
ruleNumerals = Rule
{ name = "numbers 21 31 41 51 61 71 81 91"
, pattern =
[ oneOf [20, 30 .. 90]
, regex "mốt"
]
, prod = \tokens -> case tokens of
(Token Numeral NumeralData{TNumeral.value = v}:_) -> double $ v + 1
_ -> Nothing
} | 284 | ruleNumerals :: Rule
ruleNumerals = Rule
{ name = "numbers 21 31 41 51 61 71 81 91"
, pattern =
[ oneOf [20, 30 .. 90]
, regex "mốt"
]
, prod = \tokens -> case tokens of
(Token Numeral NumeralData{TNumeral.value = v}:_) -> double $ v + 1
_ -> Nothing
} | 284 | ruleNumerals = Rule
{ name = "numbers 21 31 41 51 61 71 81 91"
, pattern =
[ oneOf [20, 30 .. 90]
, regex "mốt"
]
, prod = \tokens -> case tokens of
(Token Numeral NumeralData{TNumeral.value = v}:_) -> double $ v + 1
_ -> Nothing
} | 263 | false | true | 0 | 17 | 85 | 108 | 59 | 49 | null | null |
feliposz/learning-stuff | haskell/learn_chapter4.hs | mit | A ordem dos padrões é importante. Os mais genéricos devem vir por último.
-- Uma definição recursiva de fatorial
factorial :: (Integral a) => a -> a
factorial 0 = 1
fa | 168 | factorial :: (Integral a) => a -> a
factorial 0 = 1 | 51 | factorial 0 = 1 | 15 | true | true | 2 | 7 | 32 | 72 | 33 | 39 | null | null |
brendanhay/gogol | gogol-dataproc/gen/Network/Google/Resource/Dataproc/Projects/Regions/WorkflowTemplates/InstantiateInline.hs | mpl-2.0 | -- | Upload protocol for media (e.g. \"raw\", \"multipart\").
prwtiiUploadProtocol :: Lens' ProjectsRegionsWorkflowTemplatesInstantiateInline (Maybe Text)
prwtiiUploadProtocol
= lens _prwtiiUploadProtocol
(\ s a -> s{_prwtiiUploadProtocol = a}) | 252 | prwtiiUploadProtocol :: Lens' ProjectsRegionsWorkflowTemplatesInstantiateInline (Maybe Text)
prwtiiUploadProtocol
= lens _prwtiiUploadProtocol
(\ s a -> s{_prwtiiUploadProtocol = a}) | 190 | prwtiiUploadProtocol
= lens _prwtiiUploadProtocol
(\ s a -> s{_prwtiiUploadProtocol = a}) | 97 | true | true | 1 | 9 | 33 | 51 | 25 | 26 | null | null |
ibizaman/t411-hs | src/Arguments.hs | bsd-3-clause | process :: FunctionsMap -> IO ()
process map = do
args <- getArgs
case dispatch map args of
Nothing -> putStrLn "No action given or action incorrect"
Just io -> io | 187 | process :: FunctionsMap -> IO ()
process map = do
args <- getArgs
case dispatch map args of
Nothing -> putStrLn "No action given or action incorrect"
Just io -> io | 187 | process map = do
args <- getArgs
case dispatch map args of
Nothing -> putStrLn "No action given or action incorrect"
Just io -> io | 154 | false | true | 0 | 11 | 54 | 66 | 28 | 38 | null | null |
jonathan-laurent/copilot-kind | src/Copilot/Kind/TransSys/Spec.hs | bsd-3-clause | mkExtVar node name = ExtVar node (Var name) | 43 | mkExtVar node name = ExtVar node (Var name) | 43 | mkExtVar node name = ExtVar node (Var name) | 43 | false | false | 0 | 7 | 7 | 22 | 10 | 12 | null | null |
nevrenato/Hets_Fork | Comorphisms/CASL2SubCFOL.hs | gpl-2.0 | totalizeConstraint :: Set.Set SORT -> Constraint -> Constraint
totalizeConstraint bsrts c =
(if Set.member (newSort c) bsrts then addBottomAlt else id)
c { opSymbs = map ( \ (o, is) -> (totalizeOpSymb o, is)) $ opSymbs c } | 230 | totalizeConstraint :: Set.Set SORT -> Constraint -> Constraint
totalizeConstraint bsrts c =
(if Set.member (newSort c) bsrts then addBottomAlt else id)
c { opSymbs = map ( \ (o, is) -> (totalizeOpSymb o, is)) $ opSymbs c } | 230 | totalizeConstraint bsrts c =
(if Set.member (newSort c) bsrts then addBottomAlt else id)
c { opSymbs = map ( \ (o, is) -> (totalizeOpSymb o, is)) $ opSymbs c } | 167 | false | true | 0 | 13 | 45 | 97 | 51 | 46 | null | null |
nevrenato/HetsAlloy | Static/DGNavigation.hs | gpl-2.0 | isDefLink :: LEdge DGLinkLab -> Bool
isDefLink = isDefEdge . dgl_type . linkLabel | 81 | isDefLink :: LEdge DGLinkLab -> Bool
isDefLink = isDefEdge . dgl_type . linkLabel | 81 | isDefLink = isDefEdge . dgl_type . linkLabel | 44 | false | true | 0 | 6 | 12 | 26 | 13 | 13 | null | null |
magthe/lat | src/AlertDB.hs | gpl-3.0 | deleteDistro :: T.Distro -> AlertDB ()
deleteDistro d = do
conn <- ask
liftIO $ failOnException "" $ run conn "DELETE FROM distro WHERE name=?" [toSql $ T.distroName d]
return ()
-- | List all distributions in the database. | 236 | deleteDistro :: T.Distro -> AlertDB ()
deleteDistro d = do
conn <- ask
liftIO $ failOnException "" $ run conn "DELETE FROM distro WHERE name=?" [toSql $ T.distroName d]
return ()
-- | List all distributions in the database. | 236 | deleteDistro d = do
conn <- ask
liftIO $ failOnException "" $ run conn "DELETE FROM distro WHERE name=?" [toSql $ T.distroName d]
return ()
-- | List all distributions in the database. | 197 | false | true | 0 | 12 | 51 | 74 | 34 | 40 | null | null |
facebookincubator/duckling | Duckling/Rules/ZH.hs | bsd-3-clause | langRules (Seal Distance) = Distance.rules | 42 | langRules (Seal Distance) = Distance.rules | 42 | langRules (Seal Distance) = Distance.rules | 42 | false | false | 0 | 7 | 4 | 17 | 8 | 9 | null | null |
spechub/Hets | Maude/PreComorphism.hs | gpl-2.0 | -- | checks the profile has at least one sort
atLeastOneSort :: MSign.OpMap -> MSign.OpMap
atLeastOneSort om = Map.fromList lom'
where lom = Map.toList om
lom' = filterAtLeastOneSort lom | 204 | atLeastOneSort :: MSign.OpMap -> MSign.OpMap
atLeastOneSort om = Map.fromList lom'
where lom = Map.toList om
lom' = filterAtLeastOneSort lom | 158 | atLeastOneSort om = Map.fromList lom'
where lom = Map.toList om
lom' = filterAtLeastOneSort lom | 113 | true | true | 0 | 8 | 46 | 48 | 24 | 24 | null | null |
ice1000/OI-codes | codewars/301-400/scott-encoding.hs | agpl-3.0 | isLeft :: SEither a b -> Bool
isLeft = E.isLeft . toEither | 58 | isLeft :: SEither a b -> Bool
isLeft = E.isLeft . toEither | 58 | isLeft = E.isLeft . toEither | 28 | false | true | 0 | 6 | 11 | 26 | 13 | 13 | null | null |
L8D/whip-hs | src/Whip/Parser.hs | mit | comment :: Parser String
comment = between (char ';') (char '\n') (many $ noneOf "\n") | 86 | comment :: Parser String
comment = between (char ';') (char '\n') (many $ noneOf "\n") | 86 | comment = between (char ';') (char '\n') (many $ noneOf "\n") | 61 | false | true | 0 | 8 | 14 | 43 | 21 | 22 | null | null |
rueshyna/gogol | gogol-servicemanagement/gen/Network/Google/Resource/ServiceManagement/Services/SetIAMPolicy.hs | mpl-2.0 | -- | JSONP
ssipCallback :: Lens' ServicesSetIAMPolicy (Maybe Text)
ssipCallback
= lens _ssipCallback (\ s a -> s{_ssipCallback = a}) | 134 | ssipCallback :: Lens' ServicesSetIAMPolicy (Maybe Text)
ssipCallback
= lens _ssipCallback (\ s a -> s{_ssipCallback = a}) | 123 | ssipCallback
= lens _ssipCallback (\ s a -> s{_ssipCallback = a}) | 67 | true | true | 2 | 9 | 21 | 55 | 25 | 30 | null | null |
ob-cs-hm-edu/compiler-md2html | src/Scanner.hs | bsd-3-clause | -- eine Anzahl Leerzeichen
scan str@(' ':_) = let (blanks, rest) = span (==' ') str
in ( TokenBlanks (length blanks) : ) <$> scan rest | 138 | scan str@(' ':_) = let (blanks, rest) = span (==' ') str
in ( TokenBlanks (length blanks) : ) <$> scan rest | 111 | scan str@(' ':_) = let (blanks, rest) = span (==' ') str
in ( TokenBlanks (length blanks) : ) <$> scan rest | 111 | true | false | 1 | 12 | 29 | 72 | 35 | 37 | null | null |
bitemyapp/ghc | compiler/stranal/WorkWrap.hs | bsd-3-clause | wwBind :: DynFlags
-> FamInstEnvs
-> CoreBind
-> UniqSM [CoreBind] -- returns a WwBinding intermediate form;
-- the caller will convert to Expr/Binding,
-- as appropriate.
wwBind dflags fam_envs (NonRec binder rhs) = do
new_rhs <- wwExpr dflags fam_envs rhs
new_pairs <- tryWW dflags fam_envs NonRecursive binder new_rhs
return [NonRec b e | (b,e) <- new_pairs]
-- Generated bindings must be non-recursive
-- because the original binding was. | 559 | wwBind :: DynFlags
-> FamInstEnvs
-> CoreBind
-> UniqSM [CoreBind]
wwBind dflags fam_envs (NonRec binder rhs) = do
new_rhs <- wwExpr dflags fam_envs rhs
new_pairs <- tryWW dflags fam_envs NonRecursive binder new_rhs
return [NonRec b e | (b,e) <- new_pairs]
-- Generated bindings must be non-recursive
-- because the original binding was. | 386 | wwBind dflags fam_envs (NonRec binder rhs) = do
new_rhs <- wwExpr dflags fam_envs rhs
new_pairs <- tryWW dflags fam_envs NonRecursive binder new_rhs
return [NonRec b e | (b,e) <- new_pairs]
-- Generated bindings must be non-recursive
-- because the original binding was. | 294 | true | true | 0 | 11 | 184 | 109 | 55 | 54 | null | null |
rahulmutt/ghcvm | compiler/Eta/HsSyn/HsTypes.hs | bsd-3-clause | pprHsType, pprParendHsType :: (OutputableBndr name) => HsType name -> SDoc
pprHsType ty = getPprStyle $ \sty -> ppr_mono_ty TopPrec (prepare sty ty) | 155 | pprHsType, pprParendHsType :: (OutputableBndr name) => HsType name -> SDoc
pprHsType ty = getPprStyle $ \sty -> ppr_mono_ty TopPrec (prepare sty ty) | 154 | pprHsType ty = getPprStyle $ \sty -> ppr_mono_ty TopPrec (prepare sty ty) | 79 | false | true | 0 | 9 | 28 | 54 | 28 | 26 | null | null |
spacekitteh/compdata | testsuite/tests/Data/Comp/Multi/Variables_Test.hs | bsd-3-clause | case_recFree = variables recExp @=? Set.fromList [Z] | 52 | case_recFree = variables recExp @=? Set.fromList [Z] | 52 | case_recFree = variables recExp @=? Set.fromList [Z] | 52 | false | false | 0 | 7 | 6 | 21 | 10 | 11 | null | null |
CulpaBS/wbBach | src/Futhark/Transform/FirstOrderTransform.hs | bsd-3-clause | transformFunDef :: (MonadFreshNames m, Bindable tolore,
LetAttr SOACS ~ LetAttr tolore,
CanBeAliased (Op tolore)) =>
FunDef -> m (AST.FunDef tolore)
transformFunDef (FunDef entry fname rettype params body) = do
(body',_) <-
runBinderEmptyEnv $
localScope (scopeOfFParams params) $
insertBindingsM $
transformBody body
return $ FunDef entry fname rettype params body'
-- | The constraints that a monad must uphold in order to be used for
-- first-order transformation. | 547 | transformFunDef :: (MonadFreshNames m, Bindable tolore,
LetAttr SOACS ~ LetAttr tolore,
CanBeAliased (Op tolore)) =>
FunDef -> m (AST.FunDef tolore)
transformFunDef (FunDef entry fname rettype params body) = do
(body',_) <-
runBinderEmptyEnv $
localScope (scopeOfFParams params) $
insertBindingsM $
transformBody body
return $ FunDef entry fname rettype params body'
-- | The constraints that a monad must uphold in order to be used for
-- first-order transformation. | 547 | transformFunDef (FunDef entry fname rettype params body) = do
(body',_) <-
runBinderEmptyEnv $
localScope (scopeOfFParams params) $
insertBindingsM $
transformBody body
return $ FunDef entry fname rettype params body'
-- | The constraints that a monad must uphold in order to be used for
-- first-order transformation. | 339 | false | true | 0 | 13 | 146 | 141 | 69 | 72 | null | null |
AlexanderPankiv/ghc | compiler/types/TypeRep.hs | bsd-3-clause | pprTvBndr :: TyVar -> SDoc
pprTvBndr tv
| isLiftedTypeKind kind = ppr_tvar tv
| otherwise = parens (ppr_tvar tv <+> dcolon <+> pprKind kind)
where
kind = tyVarKind tv
{-
Note [When to print foralls]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Mostly we want to print top-level foralls when (and only when) the user specifies
-fprint-explicit-foralls. But when kind polymorphism is at work, that suppresses
too much information; see Trac #9018.
So I'm trying out this rule: print explicit foralls if
a) User specifies -fprint-explicit-foralls, or
b) Any of the quantified type variables has a kind
that mentions a kind variable
This catches common situations, such as a type siguature
f :: m a
which means
f :: forall k. forall (m :: k->*) (a :: k). m a
We really want to see both the "forall k" and the kind signatures
on m and a. The latter comes from pprTvBndr.
Note [Infix type variables]
~~~~~~~~~~~~~~~~~~~~~~~~~~~
With TypeOperators you can say
f :: (a ~> b) -> b
and the (~>) is considered a type variable. However, the type
pretty-printer in this module will just see (a ~> b) as
App (App (TyVarTy "~>") (TyVarTy "a")) (TyVarTy "b")
So it'll print the type in prefix form. To avoid confusion we must
remember to parenthesise the operator, thus
(~>) a b -> b
See Trac #2766.
-} | 1,356 | pprTvBndr :: TyVar -> SDoc
pprTvBndr tv
| isLiftedTypeKind kind = ppr_tvar tv
| otherwise = parens (ppr_tvar tv <+> dcolon <+> pprKind kind)
where
kind = tyVarKind tv
{-
Note [When to print foralls]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Mostly we want to print top-level foralls when (and only when) the user specifies
-fprint-explicit-foralls. But when kind polymorphism is at work, that suppresses
too much information; see Trac #9018.
So I'm trying out this rule: print explicit foralls if
a) User specifies -fprint-explicit-foralls, or
b) Any of the quantified type variables has a kind
that mentions a kind variable
This catches common situations, such as a type siguature
f :: m a
which means
f :: forall k. forall (m :: k->*) (a :: k). m a
We really want to see both the "forall k" and the kind signatures
on m and a. The latter comes from pprTvBndr.
Note [Infix type variables]
~~~~~~~~~~~~~~~~~~~~~~~~~~~
With TypeOperators you can say
f :: (a ~> b) -> b
and the (~>) is considered a type variable. However, the type
pretty-printer in this module will just see (a ~> b) as
App (App (TyVarTy "~>") (TyVarTy "a")) (TyVarTy "b")
So it'll print the type in prefix form. To avoid confusion we must
remember to parenthesise the operator, thus
(~>) a b -> b
See Trac #2766.
-} | 1,356 | pprTvBndr tv
| isLiftedTypeKind kind = ppr_tvar tv
| otherwise = parens (ppr_tvar tv <+> dcolon <+> pprKind kind)
where
kind = tyVarKind tv
{-
Note [When to print foralls]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Mostly we want to print top-level foralls when (and only when) the user specifies
-fprint-explicit-foralls. But when kind polymorphism is at work, that suppresses
too much information; see Trac #9018.
So I'm trying out this rule: print explicit foralls if
a) User specifies -fprint-explicit-foralls, or
b) Any of the quantified type variables has a kind
that mentions a kind variable
This catches common situations, such as a type siguature
f :: m a
which means
f :: forall k. forall (m :: k->*) (a :: k). m a
We really want to see both the "forall k" and the kind signatures
on m and a. The latter comes from pprTvBndr.
Note [Infix type variables]
~~~~~~~~~~~~~~~~~~~~~~~~~~~
With TypeOperators you can say
f :: (a ~> b) -> b
and the (~>) is considered a type variable. However, the type
pretty-printer in this module will just see (a ~> b) as
App (App (TyVarTy "~>") (TyVarTy "a")) (TyVarTy "b")
So it'll print the type in prefix form. To avoid confusion we must
remember to parenthesise the operator, thus
(~>) a b -> b
See Trac #2766.
-} | 1,329 | false | true | 1 | 9 | 307 | 68 | 32 | 36 | null | null |
ganeti-github-testing/ganeti-test-1 | src/Ganeti/Constants.hs | bsd-2-clause | ieCustomSize :: String
ieCustomSize = "fd" | 42 | ieCustomSize :: String
ieCustomSize = "fd" | 42 | ieCustomSize = "fd" | 19 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
rimmington/eclogues | eclogues-impl/app/api/Eclogues/State/Monad.hs | bsd-3-clause | sealBox :: (TS m) => Job.Name -> m ()
sealBox name = do
nodes . ix name . _ABox . Job.sealed .= Job.Sealed
persist <>= Just (Persist.sealBox name)
-- | Add a reverse dependency; first parameter depends on third. | 220 | sealBox :: (TS m) => Job.Name -> m ()
sealBox name = do
nodes . ix name . _ABox . Job.sealed .= Job.Sealed
persist <>= Just (Persist.sealBox name)
-- | Add a reverse dependency; first parameter depends on third. | 220 | sealBox name = do
nodes . ix name . _ABox . Job.sealed .= Job.Sealed
persist <>= Just (Persist.sealBox name)
-- | Add a reverse dependency; first parameter depends on third. | 182 | false | true | 0 | 11 | 47 | 79 | 38 | 41 | null | null |
karamellpelle/MEnv | source/File/Binary/Reader.hs | bsd-2-clause | rNUL :: Reader ()
rNUL =
(rSatisfy (== 0x00) <?> "NUL") >> return () | 93 | rNUL :: Reader ()
rNUL =
(rSatisfy (== 0x00) <?> "NUL") >> return () | 93 | rNUL =
(rSatisfy (== 0x00) <?> "NUL") >> return () | 75 | false | true | 0 | 9 | 38 | 39 | 20 | 19 | null | null |
tjakway/ghcjvm | compiler/ghci/ByteCodeGen.hs | bsd-3-clause | getLabelsBc :: Word16 -> BcM [Word16]
getLabelsBc n
= BcM $ \st -> let ctr = nextlabel st
in return (st{nextlabel = ctr+n}, [ctr .. ctr+n-1]) | 160 | getLabelsBc :: Word16 -> BcM [Word16]
getLabelsBc n
= BcM $ \st -> let ctr = nextlabel st
in return (st{nextlabel = ctr+n}, [ctr .. ctr+n-1]) | 160 | getLabelsBc n
= BcM $ \st -> let ctr = nextlabel st
in return (st{nextlabel = ctr+n}, [ctr .. ctr+n-1]) | 122 | false | true | 0 | 13 | 44 | 82 | 43 | 39 | null | null |
haskelladdict/simgi | src/Engine.hs | gpl-3.0 | create_initial_state:: ModelState -> Output -> ModelState
create_initial_state state@(ModelState { seed = theSeed}) out =
state { rates = defaultRateList
, randGen = MT.pureMT theSeed
, currentTime = 0.0
, currentIter = 1
, outputCache = [out]
} | 299 | create_initial_state:: ModelState -> Output -> ModelState
create_initial_state state@(ModelState { seed = theSeed}) out =
state { rates = defaultRateList
, randGen = MT.pureMT theSeed
, currentTime = 0.0
, currentIter = 1
, outputCache = [out]
} | 299 | create_initial_state state@(ModelState { seed = theSeed}) out =
state { rates = defaultRateList
, randGen = MT.pureMT theSeed
, currentTime = 0.0
, currentIter = 1
, outputCache = [out]
} | 241 | false | true | 0 | 10 | 90 | 79 | 46 | 33 | null | null |
jimsnow/glome | GlomeView/TestScene.hs | gpl-2.0 | geom = group [ tex (plane (Vec 0 0 0) (Vec 0 1 0)) (t_matte (Color 0 0.8 0.3)),
bih [ tex (dodecahedron (Vec (-6) 3 0) 1) t_stripe
, tex (transform (icosahedron (Vec 4 1.5 3) 1.5) [ rotate vz (deg 11)
, rotate vx (deg 7) ] ) t_mottled
, transform (oak 11.6 (mkStdGen 42)) [ scale (Vec 1.5 1.5 1.5)]
, tex (transform (coil) [ scale (Vec (1/3) (1/3) (1/3))
, rotate (Vec 0 1 0) (deg 65)
, translate (Vec (-3.5) 1 (5))
]) t_mirror
, cone (Vec (-6) 0 0) 1 (Vec (-6) 3 0) 0
, tex (difference (sphere (Vec 0 (-4) 5) 4.7) (sphere (Vec 1.5 (1.5) 5.2) 1.6)) t_mirror
, transform (tex sphereint (t_matte (Color 0.5 0 1))) [ scale (Vec 0.6 0.6 0.6),
translate (Vec (-5.2) 1 5)]
]
] | 1,104 | geom = group [ tex (plane (Vec 0 0 0) (Vec 0 1 0)) (t_matte (Color 0 0.8 0.3)),
bih [ tex (dodecahedron (Vec (-6) 3 0) 1) t_stripe
, tex (transform (icosahedron (Vec 4 1.5 3) 1.5) [ rotate vz (deg 11)
, rotate vx (deg 7) ] ) t_mottled
, transform (oak 11.6 (mkStdGen 42)) [ scale (Vec 1.5 1.5 1.5)]
, tex (transform (coil) [ scale (Vec (1/3) (1/3) (1/3))
, rotate (Vec 0 1 0) (deg 65)
, translate (Vec (-3.5) 1 (5))
]) t_mirror
, cone (Vec (-6) 0 0) 1 (Vec (-6) 3 0) 0
, tex (difference (sphere (Vec 0 (-4) 5) 4.7) (sphere (Vec 1.5 (1.5) 5.2) 1.6)) t_mirror
, transform (tex sphereint (t_matte (Color 0.5 0 1))) [ scale (Vec 0.6 0.6 0.6),
translate (Vec (-5.2) 1 5)]
]
] | 1,104 | geom = group [ tex (plane (Vec 0 0 0) (Vec 0 1 0)) (t_matte (Color 0 0.8 0.3)),
bih [ tex (dodecahedron (Vec (-6) 3 0) 1) t_stripe
, tex (transform (icosahedron (Vec 4 1.5 3) 1.5) [ rotate vz (deg 11)
, rotate vx (deg 7) ] ) t_mottled
, transform (oak 11.6 (mkStdGen 42)) [ scale (Vec 1.5 1.5 1.5)]
, tex (transform (coil) [ scale (Vec (1/3) (1/3) (1/3))
, rotate (Vec 0 1 0) (deg 65)
, translate (Vec (-3.5) 1 (5))
]) t_mirror
, cone (Vec (-6) 0 0) 1 (Vec (-6) 3 0) 0
, tex (difference (sphere (Vec 0 (-4) 5) 4.7) (sphere (Vec 1.5 (1.5) 5.2) 1.6)) t_mirror
, transform (tex sphereint (t_matte (Color 0.5 0 1))) [ scale (Vec 0.6 0.6 0.6),
translate (Vec (-5.2) 1 5)]
]
] | 1,104 | false | false | 0 | 17 | 572 | 473 | 242 | 231 | null | null |
sakari/haskell-gherkin | tests/Main.hs | bsd-3-clause | prop :: Parser a -> String -> a
prop p str = case parse (p >>= \r -> eof >> return r) "" str of
Left e -> error $ show e
Right l -> l | 137 | prop :: Parser a -> String -> a
prop p str = case parse (p >>= \r -> eof >> return r) "" str of
Left e -> error $ show e
Right l -> l | 137 | prop p str = case parse (p >>= \r -> eof >> return r) "" str of
Left e -> error $ show e
Right l -> l | 105 | false | true | 0 | 11 | 39 | 88 | 40 | 48 | null | null |
markuspf/Idris-dev | src/IRTS/JavaScript/Codegen.hs | bsd-3-clause | isYes _ = False | 15 | isYes _ = False | 15 | isYes _ = False | 15 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
hvr/containers | Data/Map/Base.hs | bsd-3-clause | link kx x l@(Bin sizeL ky y ly ry) r@(Bin sizeR kz z lz rz)
| delta*sizeL < sizeR = balanceL kz z (link kx x l lz) rz
| delta*sizeR < sizeL = balanceR ky y ly (link kx x ry r)
| otherwise = bin kx x l r | 221 | link kx x l@(Bin sizeL ky y ly ry) r@(Bin sizeR kz z lz rz)
| delta*sizeL < sizeR = balanceL kz z (link kx x l lz) rz
| delta*sizeR < sizeL = balanceR ky y ly (link kx x ry r)
| otherwise = bin kx x l r | 221 | link kx x l@(Bin sizeL ky y ly ry) r@(Bin sizeR kz z lz rz)
| delta*sizeL < sizeR = balanceL kz z (link kx x l lz) rz
| delta*sizeR < sizeL = balanceR ky y ly (link kx x ry r)
| otherwise = bin kx x l r | 221 | false | false | 0 | 9 | 69 | 164 | 70 | 94 | null | null |
nikitaDanilenko/steamQuota | SteamQuota.hs | gpl-3.0 | keepGameLocal _ = False | 34 | keepGameLocal _ = False | 34 | keepGameLocal _ = False | 34 | false | false | 0 | 5 | 14 | 9 | 4 | 5 | null | null |
mightymoose/liquidhaskell | src/Language/Haskell/Liquid/Fresh.hs | bsd-3-clause | refreshRefType (RApp rc ts rs r)
= RApp rc <$> mapM refresh ts <*> mapM refreshRef rs <*> refresh r | 101 | refreshRefType (RApp rc ts rs r)
= RApp rc <$> mapM refresh ts <*> mapM refreshRef rs <*> refresh r | 101 | refreshRefType (RApp rc ts rs r)
= RApp rc <$> mapM refresh ts <*> mapM refreshRef rs <*> refresh r | 101 | false | false | 0 | 8 | 21 | 49 | 22 | 27 | null | null |
ezyang/ghc | compiler/codeGen/StgCmmClosure.hs | bsd-3-clause | isToplevClosure :: ClosureInfo -> Bool
isToplevClosure (ClosureInfo { closureLFInfo = lf_info })
= case lf_info of
LFReEntrant TopLevel _ _ _ _ -> True
LFThunk TopLevel _ _ _ _ -> True
_other -> False
--------------------------------------
-- Label generation
-------------------------------------- | 347 | isToplevClosure :: ClosureInfo -> Bool
isToplevClosure (ClosureInfo { closureLFInfo = lf_info })
= case lf_info of
LFReEntrant TopLevel _ _ _ _ -> True
LFThunk TopLevel _ _ _ _ -> True
_other -> False
--------------------------------------
-- Label generation
-------------------------------------- | 347 | isToplevClosure (ClosureInfo { closureLFInfo = lf_info })
= case lf_info of
LFReEntrant TopLevel _ _ _ _ -> True
LFThunk TopLevel _ _ _ _ -> True
_other -> False
--------------------------------------
-- Label generation
-------------------------------------- | 308 | false | true | 0 | 9 | 88 | 77 | 40 | 37 | null | null |
CulpaBS/wbBach | src/Futhark/Representation/AST/Attributes/Reshape.hs | bsd-3-clause | -- | @reshapeOuter newshape n oldshape@ returns a 'Reshape' expression
-- that replaces the outer @n@ dimensions of @oldshape@ with @newshape@.
reshapeOuter :: ShapeChange SubExp -> Int -> Shape -> ShapeChange SubExp
reshapeOuter newshape n oldshape =
newshape ++ map coercion_or_new (drop n (shapeDims oldshape))
where coercion_or_new
| length newshape == n = DimCoercion
| otherwise = DimNew
-- | @reshapeInner newshape n oldshape@ returns a 'Reshape' expression
-- that replaces the inner @m-n@ dimensions (where @m@ is the rank of
-- @oldshape@) of @src@ with @newshape@. | 611 | reshapeOuter :: ShapeChange SubExp -> Int -> Shape -> ShapeChange SubExp
reshapeOuter newshape n oldshape =
newshape ++ map coercion_or_new (drop n (shapeDims oldshape))
where coercion_or_new
| length newshape == n = DimCoercion
| otherwise = DimNew
-- | @reshapeInner newshape n oldshape@ returns a 'Reshape' expression
-- that replaces the inner @m-n@ dimensions (where @m@ is the rank of
-- @oldshape@) of @src@ with @newshape@. | 467 | reshapeOuter newshape n oldshape =
newshape ++ map coercion_or_new (drop n (shapeDims oldshape))
where coercion_or_new
| length newshape == n = DimCoercion
| otherwise = DimNew
-- | @reshapeInner newshape n oldshape@ returns a 'Reshape' expression
-- that replaces the inner @m-n@ dimensions (where @m@ is the rank of
-- @oldshape@) of @src@ with @newshape@. | 394 | true | true | 0 | 10 | 122 | 94 | 46 | 48 | null | null |
l29ah/monad-peel | Control/Exception/Peel.hs | bsd-3-clause | catches :: MonadPeelIO m => m a -> [Handler m a] -> m a
catches a handlers = do
k <- peelIO
join $ liftIO $ E.catches (k a) [E.Handler $ \e -> k $ handler e |
Handler handler <- handlers]
-- |Generalized version of 'E.Handler'. | 267 | catches :: MonadPeelIO m => m a -> [Handler m a] -> m a
catches a handlers = do
k <- peelIO
join $ liftIO $ E.catches (k a) [E.Handler $ \e -> k $ handler e |
Handler handler <- handlers]
-- |Generalized version of 'E.Handler'. | 267 | catches a handlers = do
k <- peelIO
join $ liftIO $ E.catches (k a) [E.Handler $ \e -> k $ handler e |
Handler handler <- handlers]
-- |Generalized version of 'E.Handler'. | 211 | false | true | 0 | 13 | 86 | 109 | 52 | 57 | null | null |
codemac/yi-editor | src/Yi/Style.hs | gpl-2.0 | grey = RGB 128 128 128 | 29 | grey = RGB 128 128 128 | 29 | grey = RGB 128 128 128 | 29 | false | false | 0 | 5 | 12 | 13 | 6 | 7 | null | null |
snoyberg/ghc | compiler/hsSyn/HsExpr.hs | bsd-3-clause | pprMatchContextNoun LambdaExpr = text "lambda abstraction" | 63 | pprMatchContextNoun LambdaExpr = text "lambda abstraction" | 63 | pprMatchContextNoun LambdaExpr = text "lambda abstraction" | 63 | false | false | 0 | 5 | 10 | 12 | 5 | 7 | null | null |
cnc-patch/disass | src/Language/Assembly/X86/Parse.hs | bsd-3-clause | parsePEXTRW :: (Stream s m Word8, Monad m) => Word8 -> ParsecT s PState m Instr
parsePEXTRW = parseUnimplemented | 112 | parsePEXTRW :: (Stream s m Word8, Monad m) => Word8 -> ParsecT s PState m Instr
parsePEXTRW = parseUnimplemented | 112 | parsePEXTRW = parseUnimplemented | 32 | false | true | 0 | 7 | 18 | 43 | 22 | 21 | null | null |
mcmaniac/ghc | compiler/llvmGen/LlvmMangler.hs | bsd-3-clause | readSections :: Handle -> Handle -> IO [Section]
readSections r w = go B.empty [] []
where
go hdr ss ls = do
e_l <- (try (B.hGetLine r))::IO (Either IOError B.ByteString)
-- Note that ".type" directives at the end of a section refer to
-- the first directive of the *next* section, therefore we take
-- it over to that section.
let (tys, ls') = span isType ls
cts = B.intercalate newLine $ reverse ls'
-- Decide whether to directly output the section or append it
-- to the list for resorting.
let finishSection
| infoSec `B.isInfixOf` hdr =
cts `seq` return $ (hdr, cts):ss
| otherwise =
writeSection w (hdr, cts) >> return ss
case e_l of
Right l | l == syntaxUnified
-> finishSection >>= \ss' -> writeSection w (l, B.empty)
>> go B.empty ss' tys
| any (`B.isPrefixOf` l) [secStmt, textStmt, dataStmt]
-> finishSection >>= \ss' -> go l ss' tys
| otherwise
-> go hdr ss (l:ls)
Left _ -> finishSection >>= \ss' -> return (reverse ss')
-- | Writes sections back | 1,230 | readSections :: Handle -> Handle -> IO [Section]
readSections r w = go B.empty [] []
where
go hdr ss ls = do
e_l <- (try (B.hGetLine r))::IO (Either IOError B.ByteString)
-- Note that ".type" directives at the end of a section refer to
-- the first directive of the *next* section, therefore we take
-- it over to that section.
let (tys, ls') = span isType ls
cts = B.intercalate newLine $ reverse ls'
-- Decide whether to directly output the section or append it
-- to the list for resorting.
let finishSection
| infoSec `B.isInfixOf` hdr =
cts `seq` return $ (hdr, cts):ss
| otherwise =
writeSection w (hdr, cts) >> return ss
case e_l of
Right l | l == syntaxUnified
-> finishSection >>= \ss' -> writeSection w (l, B.empty)
>> go B.empty ss' tys
| any (`B.isPrefixOf` l) [secStmt, textStmt, dataStmt]
-> finishSection >>= \ss' -> go l ss' tys
| otherwise
-> go hdr ss (l:ls)
Left _ -> finishSection >>= \ss' -> return (reverse ss')
-- | Writes sections back | 1,230 | readSections r w = go B.empty [] []
where
go hdr ss ls = do
e_l <- (try (B.hGetLine r))::IO (Either IOError B.ByteString)
-- Note that ".type" directives at the end of a section refer to
-- the first directive of the *next* section, therefore we take
-- it over to that section.
let (tys, ls') = span isType ls
cts = B.intercalate newLine $ reverse ls'
-- Decide whether to directly output the section or append it
-- to the list for resorting.
let finishSection
| infoSec `B.isInfixOf` hdr =
cts `seq` return $ (hdr, cts):ss
| otherwise =
writeSection w (hdr, cts) >> return ss
case e_l of
Right l | l == syntaxUnified
-> finishSection >>= \ss' -> writeSection w (l, B.empty)
>> go B.empty ss' tys
| any (`B.isPrefixOf` l) [secStmt, textStmt, dataStmt]
-> finishSection >>= \ss' -> go l ss' tys
| otherwise
-> go hdr ss (l:ls)
Left _ -> finishSection >>= \ss' -> return (reverse ss')
-- | Writes sections back | 1,181 | false | true | 0 | 16 | 446 | 366 | 185 | 181 | null | null |
faylang/fay-jquery | src/JQuery.hs | bsd-3-clause | mouseup :: (Event -> Fay ()) -> JQuery -> Fay JQuery
mouseup = ffi "%2['mouseup'](%1)" | 86 | mouseup :: (Event -> Fay ()) -> JQuery -> Fay JQuery
mouseup = ffi "%2['mouseup'](%1)" | 86 | mouseup = ffi "%2['mouseup'](%1)" | 33 | false | true | 0 | 10 | 14 | 43 | 19 | 24 | null | null |
Thell/pandoc | src/Text/Pandoc/Writers/DokuWiki.hs | gpl-2.0 | blockToDokuWiki opts x@(BulletList items) = do
oldUseTags <- stUseTags <$> ask
indent <- stIndent <$> ask
backSlash <- stBackSlashLB <$> ask
let useTags = oldUseTags || not (isSimpleList x)
if useTags
then do
contents <- local (\s -> s { stUseTags = True })
(mapM (listItemToDokuWiki opts) items)
return $ "<HTML><ul></HTML>\n" ++ vcat contents ++ "<HTML></ul></HTML>\n"
else do
contents <- local (\s -> s { stIndent = stIndent s ++ " "
, stBackSlashLB = backSlash})
(mapM (listItemToDokuWiki opts) items)
return $ vcat contents ++ if null indent then "\n" else "" | 696 | blockToDokuWiki opts x@(BulletList items) = do
oldUseTags <- stUseTags <$> ask
indent <- stIndent <$> ask
backSlash <- stBackSlashLB <$> ask
let useTags = oldUseTags || not (isSimpleList x)
if useTags
then do
contents <- local (\s -> s { stUseTags = True })
(mapM (listItemToDokuWiki opts) items)
return $ "<HTML><ul></HTML>\n" ++ vcat contents ++ "<HTML></ul></HTML>\n"
else do
contents <- local (\s -> s { stIndent = stIndent s ++ " "
, stBackSlashLB = backSlash})
(mapM (listItemToDokuWiki opts) items)
return $ vcat contents ++ if null indent then "\n" else "" | 696 | blockToDokuWiki opts x@(BulletList items) = do
oldUseTags <- stUseTags <$> ask
indent <- stIndent <$> ask
backSlash <- stBackSlashLB <$> ask
let useTags = oldUseTags || not (isSimpleList x)
if useTags
then do
contents <- local (\s -> s { stUseTags = True })
(mapM (listItemToDokuWiki opts) items)
return $ "<HTML><ul></HTML>\n" ++ vcat contents ++ "<HTML></ul></HTML>\n"
else do
contents <- local (\s -> s { stIndent = stIndent s ++ " "
, stBackSlashLB = backSlash})
(mapM (listItemToDokuWiki opts) items)
return $ vcat contents ++ if null indent then "\n" else "" | 696 | false | false | 0 | 17 | 223 | 226 | 112 | 114 | null | null |
karamellpelle/MEnv | source/MEnv/Players/IOS.hs | bsd-2-clause | -- | play with given local player.
--
-- "Never make assumptions about the format or length of player identifier
-- strings" - iOS Documentation
--
-- :)
playersHandleLocalPlayer :: a -> (Player -> a) -> MEnv res a
playersHandleLocalPlayer a f = io $ do
peek ios_players_new_local_player >>= \v -> case v of
0 -> return a
_ -> do
id <- peek ios_players_local_player_id
alias <- peek ios_players_local_player_alias
idLen <- peek ios_players_local_player_id_len
aliasLen <- peek ios_players_local_player_alias_len
id' <- peekCStringLen (id, fI idLen)
alias' <- peekCStringLen (alias, fI aliasLen)
poke ios_players_new_local_player 0
return $ f (Player id' alias') | 814 | playersHandleLocalPlayer :: a -> (Player -> a) -> MEnv res a
playersHandleLocalPlayer a f = io $ do
peek ios_players_new_local_player >>= \v -> case v of
0 -> return a
_ -> do
id <- peek ios_players_local_player_id
alias <- peek ios_players_local_player_alias
idLen <- peek ios_players_local_player_id_len
aliasLen <- peek ios_players_local_player_alias_len
id' <- peekCStringLen (id, fI idLen)
alias' <- peekCStringLen (alias, fI aliasLen)
poke ios_players_new_local_player 0
return $ f (Player id' alias') | 632 | playersHandleLocalPlayer a f = io $ do
peek ios_players_new_local_player >>= \v -> case v of
0 -> return a
_ -> do
id <- peek ios_players_local_player_id
alias <- peek ios_players_local_player_alias
idLen <- peek ios_players_local_player_id_len
aliasLen <- peek ios_players_local_player_alias_len
id' <- peekCStringLen (id, fI idLen)
alias' <- peekCStringLen (alias, fI aliasLen)
poke ios_players_new_local_player 0
return $ f (Player id' alias') | 571 | true | true | 0 | 18 | 250 | 184 | 87 | 97 | null | null |
energyflowanalysis/efa-2.1 | examples/advanced/energy/src/Modules/Output.hs | bsd-3-clause | sweepStack ::
Terminal.C term =>
(FilePath -> IO term) ->
Params.Optimisation System.Node f Sweep UV.Vector Double ->
Type.Sweep System.Node Sweep UV.Vector Double ->
Balance.Forcing System.Node Double -> IO ()
sweepStack term params _sweep balanceForcing = concurrentlyMany_ [
ModPlot.sweepStackPerStateEta term params _sweep,
ModPlot.sweepStackPerStateStoragePower term params System.Water _sweep,
ModPlot.sweepStackPerStateOpt term params balanceForcing _sweep,
ModPlot.sweepStackPerStateCondition term params _sweep
] | 546 | sweepStack ::
Terminal.C term =>
(FilePath -> IO term) ->
Params.Optimisation System.Node f Sweep UV.Vector Double ->
Type.Sweep System.Node Sweep UV.Vector Double ->
Balance.Forcing System.Node Double -> IO ()
sweepStack term params _sweep balanceForcing = concurrentlyMany_ [
ModPlot.sweepStackPerStateEta term params _sweep,
ModPlot.sweepStackPerStateStoragePower term params System.Water _sweep,
ModPlot.sweepStackPerStateOpt term params balanceForcing _sweep,
ModPlot.sweepStackPerStateCondition term params _sweep
] | 546 | sweepStack term params _sweep balanceForcing = concurrentlyMany_ [
ModPlot.sweepStackPerStateEta term params _sweep,
ModPlot.sweepStackPerStateStoragePower term params System.Water _sweep,
ModPlot.sweepStackPerStateOpt term params balanceForcing _sweep,
ModPlot.sweepStackPerStateCondition term params _sweep
] | 321 | false | true | 0 | 11 | 80 | 162 | 77 | 85 | null | null |
opentower/carnap | Carnap/src/Carnap/Languages/ModalPropositional/Logic.hs | gpl-3.0 | ofModalPropSys :: (forall r sem lex .
SupportsND r (ModalPropLexiconWith lex) sem =>
NaturalDeductionCalc r (ModalPropLexiconWith lex) sem -> a) -> String
-> Maybe a
ofModalPropSys f sys | sys == "hardegreeL" = Just $ f hardegreeLCalc
| sys == "hardegreeK" = Just $ f hardegreeKCalc
| sys == "hardegreeD" = Just $ f hardegreeDCalc
| sys == "hardegreeT" = Just $ f hardegreeTCalc
| sys == "hardegreeB" = Just $ f hardegreeBCalc
| sys == "hardegree4" = Just $ f hardegreeFourCalc
| sys == "hardegree5" = Just $ f hardegreeFiveCalc
| sys == "hardegreeWTL" = Just $ f hardegreeWTLCalc
| otherwise = Nothing | 930 | ofModalPropSys :: (forall r sem lex .
SupportsND r (ModalPropLexiconWith lex) sem =>
NaturalDeductionCalc r (ModalPropLexiconWith lex) sem -> a) -> String
-> Maybe a
ofModalPropSys f sys | sys == "hardegreeL" = Just $ f hardegreeLCalc
| sys == "hardegreeK" = Just $ f hardegreeKCalc
| sys == "hardegreeD" = Just $ f hardegreeDCalc
| sys == "hardegreeT" = Just $ f hardegreeTCalc
| sys == "hardegreeB" = Just $ f hardegreeBCalc
| sys == "hardegree4" = Just $ f hardegreeFourCalc
| sys == "hardegree5" = Just $ f hardegreeFiveCalc
| sys == "hardegreeWTL" = Just $ f hardegreeWTLCalc
| otherwise = Nothing | 930 | ofModalPropSys f sys | sys == "hardegreeL" = Just $ f hardegreeLCalc
| sys == "hardegreeK" = Just $ f hardegreeKCalc
| sys == "hardegreeD" = Just $ f hardegreeDCalc
| sys == "hardegreeT" = Just $ f hardegreeTCalc
| sys == "hardegreeB" = Just $ f hardegreeBCalc
| sys == "hardegree4" = Just $ f hardegreeFourCalc
| sys == "hardegree5" = Just $ f hardegreeFiveCalc
| sys == "hardegreeWTL" = Just $ f hardegreeWTLCalc
| otherwise = Nothing | 747 | false | true | 0 | 12 | 431 | 237 | 110 | 127 | null | null |
haskell-streaming/streaming | benchmarks/old/Stream/Types.hs | bsd-3-clause | buildList_ :: Folding_ (Of a) Identity () -> [a]
buildList_ phi = phi (\(a :> as) -> a : as)
(\(Identity xs) -> xs)
(\() -> []) | 169 | buildList_ :: Folding_ (Of a) Identity () -> [a]
buildList_ phi = phi (\(a :> as) -> a : as)
(\(Identity xs) -> xs)
(\() -> []) | 169 | buildList_ phi = phi (\(a :> as) -> a : as)
(\(Identity xs) -> xs)
(\() -> []) | 120 | false | true | 0 | 9 | 68 | 88 | 47 | 41 | null | null |
CloudI/CloudI | src/api/haskell/external/bytestring-0.10.10.0/Data/ByteString/Builder/Prim/Binary.hs | mit | word32BE = word32Host | 21 | word32BE = word32Host | 21 | word32BE = word32Host | 21 | false | false | 1 | 5 | 2 | 10 | 3 | 7 | null | null |
tjakway/ghcjvm | compiler/utils/UniqDFM.hs | bsd-3-clause | -- | Converts `UniqDFM` to a list, with elements in deterministic order.
-- It's O(n log n) while the corresponding function on `UniqFM` is O(n).
udfmToList :: UniqDFM elt -> [(Unique, elt)]
udfmToList (UDFM m _i) =
[ (getUnique k, taggedFst v)
| (k, v) <- sortBy (compare `on` (taggedSnd . snd)) $ M.toList m ] | 315 | udfmToList :: UniqDFM elt -> [(Unique, elt)]
udfmToList (UDFM m _i) =
[ (getUnique k, taggedFst v)
| (k, v) <- sortBy (compare `on` (taggedSnd . snd)) $ M.toList m ] | 169 | udfmToList (UDFM m _i) =
[ (getUnique k, taggedFst v)
| (k, v) <- sortBy (compare `on` (taggedSnd . snd)) $ M.toList m ] | 124 | true | true | 0 | 13 | 59 | 101 | 54 | 47 | null | null |
jwaldmann/haskellnews | src/HN/Types.hs | bsd-3-clause | sourceToString :: Source -> String
sourceToString i =
case i of
Reddit -> "Reddit"
Vimeo -> "Vimeo"
Twitter -> "Twitter"
Hackage -> "Hackage"
HaskellWiki -> "HaskellWiki"
Github -> "GitHub"
StackOverflow -> "Stack Overflow"
Jobs -> "Jobs"
PlanetHaskell -> "Planet Haskell"
HaskellCafe -> "Haskell Cafe"
Libraries -> "Libraries"
GhcDevs -> "GHC Devs"
GooglePlus -> "Google+"
IrcQuotes -> "IRC Quotes"
Pastes -> "Pastes"
HaskellLive -> "Haskell Live"
Events -> "Events" | 573 | sourceToString :: Source -> String
sourceToString i =
case i of
Reddit -> "Reddit"
Vimeo -> "Vimeo"
Twitter -> "Twitter"
Hackage -> "Hackage"
HaskellWiki -> "HaskellWiki"
Github -> "GitHub"
StackOverflow -> "Stack Overflow"
Jobs -> "Jobs"
PlanetHaskell -> "Planet Haskell"
HaskellCafe -> "Haskell Cafe"
Libraries -> "Libraries"
GhcDevs -> "GHC Devs"
GooglePlus -> "Google+"
IrcQuotes -> "IRC Quotes"
Pastes -> "Pastes"
HaskellLive -> "Haskell Live"
Events -> "Events" | 573 | sourceToString i =
case i of
Reddit -> "Reddit"
Vimeo -> "Vimeo"
Twitter -> "Twitter"
Hackage -> "Hackage"
HaskellWiki -> "HaskellWiki"
Github -> "GitHub"
StackOverflow -> "Stack Overflow"
Jobs -> "Jobs"
PlanetHaskell -> "Planet Haskell"
HaskellCafe -> "Haskell Cafe"
Libraries -> "Libraries"
GhcDevs -> "GHC Devs"
GooglePlus -> "Google+"
IrcQuotes -> "IRC Quotes"
Pastes -> "Pastes"
HaskellLive -> "Haskell Live"
Events -> "Events" | 538 | false | true | 0 | 7 | 173 | 124 | 62 | 62 | null | null |
konn/hskk | src/Network/Skkserv.hs | bsd-3-clause | interp :: Handle -> Maybe Response -> SignalGen Bool
interp h Nothing = liftIO (hFlush h) >> return False | 105 | interp :: Handle -> Maybe Response -> SignalGen Bool
interp h Nothing = liftIO (hFlush h) >> return False | 105 | interp h Nothing = liftIO (hFlush h) >> return False | 52 | false | true | 0 | 8 | 18 | 46 | 21 | 25 | null | null |
aslatter/hmumps | Data/MValue.hs | gpl-3.0 | mToBool (Number _) = True | 27 | mToBool (Number _) = True | 27 | mToBool (Number _) = True | 27 | false | false | 0 | 6 | 6 | 16 | 7 | 9 | null | null |
RayRacine/nucleic | Nucleic/Element.hs | gpl-3.0 | anchor :: Text -> Text -> DocumentM ANCHOR.HTMLAnchorElement
anchor txt href = do
e <- createElement "a" []
_ <- liftIO $ do
NODE.nodeSetTextContent e txt
elementSetAttribute e ("href" :: Text) href
return $ ANCHOR.castToHTMLAnchorElement e | 254 | anchor :: Text -> Text -> DocumentM ANCHOR.HTMLAnchorElement
anchor txt href = do
e <- createElement "a" []
_ <- liftIO $ do
NODE.nodeSetTextContent e txt
elementSetAttribute e ("href" :: Text) href
return $ ANCHOR.castToHTMLAnchorElement e | 254 | anchor txt href = do
e <- createElement "a" []
_ <- liftIO $ do
NODE.nodeSetTextContent e txt
elementSetAttribute e ("href" :: Text) href
return $ ANCHOR.castToHTMLAnchorElement e | 193 | false | true | 0 | 13 | 49 | 97 | 43 | 54 | null | null |
anwb/fp-one-on-one | lecture-10-hw.hs | mit | removeone x (y:ys) | x == y = ys
| otherwise = y : removeone x ys | 111 | removeone x (y:ys) | x == y = ys
| otherwise = y : removeone x ys | 111 | removeone x (y:ys) | x == y = ys
| otherwise = y : removeone x ys | 111 | false | false | 1 | 8 | 62 | 46 | 21 | 25 | null | null |
franckrasolo/pepino | examples/Arithmetic.hs | bsd-3-clause | eval (Mul e1 e2) = eval e1 * eval e2 | 36 | eval (Mul e1 e2) = eval e1 * eval e2 | 36 | eval (Mul e1 e2) = eval e1 * eval e2 | 36 | false | false | 0 | 7 | 9 | 27 | 12 | 15 | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.