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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ambiata/highlighting-kate
|
Text/Highlighting/Kate/Syntax/Changelog.hs
|
gpl-2.0
|
regex_'5cd'5cd'5cd'5cd'5cs'2a'2d'5cs'2a'5cd'5cd'5cs'2a'2d'5cs'2a'5cd'5cd'5cs'2a = compileRegex True "\\d\\d\\d\\d\\s*-\\s*\\d\\d\\s*-\\s*\\d\\d\\s*"
| 148
|
regex_'5cd'5cd'5cd'5cd'5cs'2a'2d'5cs'2a'5cd'5cd'5cs'2a'2d'5cs'2a'5cd'5cd'5cs'2a = compileRegex True "\\d\\d\\d\\d\\s*-\\s*\\d\\d\\s*-\\s*\\d\\d\\s*"
| 148
|
regex_'5cd'5cd'5cd'5cd'5cs'2a'2d'5cs'2a'5cd'5cd'5cs'2a'2d'5cs'2a'5cd'5cd'5cs'2a = compileRegex True "\\d\\d\\d\\d\\s*-\\s*\\d\\d\\s*-\\s*\\d\\d\\s*"
| 148
| false
| false
| 0
| 5
| 4
| 11
| 5
| 6
| null | null |
LambdaHack/LambdaHack
|
definition-src/Game/LambdaHack/Content/RuleKind.hs
|
bsd-3-clause
|
-- | Catch invalid rule kind definitions.
validateSingle :: RuleContent -> [Text]
validateSingle RuleContent{..} =
[ "rWidthMax < 5" | rWidthMax < 5 ] -- indented (4 prop spaces) text
++ [ "rHeightMax < 2" | rHeightMax < 2 ]
| 229
|
validateSingle :: RuleContent -> [Text]
validateSingle RuleContent{..} =
[ "rWidthMax < 5" | rWidthMax < 5 ] -- indented (4 prop spaces) text
++ [ "rHeightMax < 2" | rHeightMax < 2 ]
| 187
|
validateSingle RuleContent{..} =
[ "rWidthMax < 5" | rWidthMax < 5 ] -- indented (4 prop spaces) text
++ [ "rHeightMax < 2" | rHeightMax < 2 ]
| 147
| true
| true
| 2
| 8
| 44
| 57
| 30
| 27
| null | null |
jonsterling/tt-singletons
|
src/TT/Operator.hs
|
mit
|
refl ∷ Abt v Op t ⇒ t Z → t Z → t Z
refl α m = REFL $$ α :& m :& RNil
| 69
|
refl ∷ Abt v Op t ⇒ t Z → t Z → t Z
refl α m = REFL $$ α :& m :& RNil
| 69
|
refl α m = REFL $$ α :& m :& RNil
| 33
| false
| true
| 0
| 8
| 25
| 56
| 26
| 30
| null | null |
holoed/Junior
|
lib/transformers-0.4.3.0/Control/Monad/Trans/State/Lazy.hs
|
apache-2.0
|
evalState :: State s a -- ^state-passing computation to execute
-> s -- ^initial value
-> a -- ^return value of the state computation
evalState m s = fst (runState m s)
| 207
|
evalState :: State s a -- ^state-passing computation to execute
-> s -- ^initial value
-> a
evalState m s = fst (runState m s)
| 156
|
evalState m s = fst (runState m s)
| 34
| true
| true
| 0
| 7
| 70
| 43
| 22
| 21
| null | null |
rahulmutt/ghcvm
|
compiler/Eta/Prelude/THNames.hs
|
bsd-3-clause
|
-- data PatSynArgs = ...
prefixPatSynIdKey, infixPatSynIdKey, recordPatSynIdKey :: Unique
prefixPatSynIdKey = mkPreludeMiscIdUnique 370
| 135
|
prefixPatSynIdKey, infixPatSynIdKey, recordPatSynIdKey :: Unique
prefixPatSynIdKey = mkPreludeMiscIdUnique 370
| 110
|
prefixPatSynIdKey = mkPreludeMiscIdUnique 370
| 45
| true
| true
| 0
| 5
| 13
| 19
| 12
| 7
| null | null |
ComputationWithBoundedResources/ara-inference
|
doc/tpdb_trs/Haskell/basic_haskell/properFraction_1.hs
|
mit
|
primQuotInt (Neg x) (Pos (Succ y)) = Neg (primDivNatS x (Succ y))
| 65
|
primQuotInt (Neg x) (Pos (Succ y)) = Neg (primDivNatS x (Succ y))
| 65
|
primQuotInt (Neg x) (Pos (Succ y)) = Neg (primDivNatS x (Succ y))
| 65
| false
| false
| 0
| 9
| 11
| 46
| 22
| 24
| null | null |
mattias-lundell/timber-llvm
|
src/Scp.hs
|
bsd-3-clause
|
normLit l = l
| 35
|
normLit l = l
| 35
|
normLit l = l
| 35
| false
| false
| 0
| 5
| 25
| 9
| 4
| 5
| null | null |
zouppen/lulzcapita
|
src/LulzCapita/Bank/Nordnet.hs
|
gpl-3.0
|
nordnet :: PortfolioInfo -> Parser [Transaction]
nordnet info = do
-- Skipping head
skipMany newline
string "ID"
skipLine
-- The thing
records <- many $ record info
-- Skip tail
skipMany newline
eof
-- Suceess
return records
-- |Parses a record. Comments are in Finnish because the CSV from
-- Nordnet has Finnish comments.
| 346
|
nordnet :: PortfolioInfo -> Parser [Transaction]
nordnet info = do
-- Skipping head
skipMany newline
string "ID"
skipLine
-- The thing
records <- many $ record info
-- Skip tail
skipMany newline
eof
-- Suceess
return records
-- |Parses a record. Comments are in Finnish because the CSV from
-- Nordnet has Finnish comments.
| 346
|
nordnet info = do
-- Skipping head
skipMany newline
string "ID"
skipLine
-- The thing
records <- many $ record info
-- Skip tail
skipMany newline
eof
-- Suceess
return records
-- |Parses a record. Comments are in Finnish because the CSV from
-- Nordnet has Finnish comments.
| 297
| false
| true
| 0
| 9
| 76
| 74
| 34
| 40
| null | null |
othercriteria/blaze
|
Bonawitz_3_8.hs
|
mit
|
dbin :: Density
dbin = productDensity $ map mkBernoulli (map tagged $ children scs)
where mkBernoulli t = mkDensity [] [["cs",t]] [["p"]] bernoulli
| 151
|
dbin :: Density
dbin = productDensity $ map mkBernoulli (map tagged $ children scs)
where mkBernoulli t = mkDensity [] [["cs",t]] [["p"]] bernoulli
| 151
|
dbin = productDensity $ map mkBernoulli (map tagged $ children scs)
where mkBernoulli t = mkDensity [] [["cs",t]] [["p"]] bernoulli
| 135
| false
| true
| 0
| 9
| 26
| 76
| 37
| 39
| null | null |
romanb/amazonka
|
amazonka-ec2/gen/Network/AWS/EC2/Types.hs
|
mpl-2.0
|
-- | Indicates whether the snapshot is encrypted.
sEncrypted :: Lens' Snapshot Bool
sEncrypted = lens _sEncrypted (\s a -> s { _sEncrypted = a })
| 145
|
sEncrypted :: Lens' Snapshot Bool
sEncrypted = lens _sEncrypted (\s a -> s { _sEncrypted = a })
| 95
|
sEncrypted = lens _sEncrypted (\s a -> s { _sEncrypted = a })
| 61
| true
| true
| 0
| 9
| 25
| 47
| 23
| 24
| null | null |
vladimir-ipatov/ganeti
|
test/hs/Test/Ganeti/Utils.hs
|
gpl-2.0
|
-- | Test that functional if' behaves like the syntactic sugar if.
prop_if'if :: Bool -> Int -> Int -> Gen Prop
prop_if'if cnd a b =
if' cnd a b ==? if cnd then a else b
| 171
|
prop_if'if :: Bool -> Int -> Int -> Gen Prop
prop_if'if cnd a b =
if' cnd a b ==? if cnd then a else b
| 104
|
prop_if'if cnd a b =
if' cnd a b ==? if cnd then a else b
| 59
| true
| true
| 0
| 8
| 39
| 53
| 27
| 26
| null | null |
Frefreak/hnem
|
src/Operations.hs
|
bsd-3-clause
|
getMusicUrl :: Int -> (Log -> [AlbumDetail]) -> ST.StateT Log IO String
getMusicUrl n func = do
opt <- ST.gets _option
ad <- ST.gets func
let pick = snd $ ad !! n
r <- lift $ postToServer queryMusicUrl opt (v pick)
return . unpack $ r ^. responseBody . key "data" . nth 0 . key "url" . _String where
v pick = object ["ids" .= Array (fromList [Number pick]),
"br" .= brH]
-- the caller garenteens start <= total
| 463
|
getMusicUrl :: Int -> (Log -> [AlbumDetail]) -> ST.StateT Log IO String
getMusicUrl n func = do
opt <- ST.gets _option
ad <- ST.gets func
let pick = snd $ ad !! n
r <- lift $ postToServer queryMusicUrl opt (v pick)
return . unpack $ r ^. responseBody . key "data" . nth 0 . key "url" . _String where
v pick = object ["ids" .= Array (fromList [Number pick]),
"br" .= brH]
-- the caller garenteens start <= total
| 463
|
getMusicUrl n func = do
opt <- ST.gets _option
ad <- ST.gets func
let pick = snd $ ad !! n
r <- lift $ postToServer queryMusicUrl opt (v pick)
return . unpack $ r ^. responseBody . key "data" . nth 0 . key "url" . _String where
v pick = object ["ids" .= Array (fromList [Number pick]),
"br" .= brH]
-- the caller garenteens start <= total
| 391
| false
| true
| 0
| 14
| 133
| 191
| 91
| 100
| null | null |
beni55/hpygments
|
src/Text/Highlighting/Pygments/Lexers.hs
|
mit
|
lexerAliases :: Lexer -> [LexerAlias]
lexerAliases = _lexerAliases
| 66
|
lexerAliases :: Lexer -> [LexerAlias]
lexerAliases = _lexerAliases
| 66
|
lexerAliases = _lexerAliases
| 28
| false
| true
| 0
| 6
| 7
| 18
| 10
| 8
| null | null |
spechub/Hets
|
CASL/Morphism.hs
|
gpl-2.0
|
morphismToSymbMapAux :: Bool -> Morphism f e m -> SymbolMap
morphismToSymbMapAux b mor = let
src = msource mor
sorts = sort_map mor
ops = op_map mor
preds = pred_map mor
sortSymMap = Set.fold
(\ s -> let t = mapSort sorts s in
if b && s == t then id else
Map.insert (idToSortSymbol s) $ idToSortSymbol t)
Map.empty $ sortSet src
opSymMap = MapSet.foldWithKey
( \ i t -> let (j, k) = mapOpSym sorts ops (i, t) in
if b && i == j && opKind k == opKind t then id else
Map.insert (idToOpSymbol i t) $ idToOpSymbol j k)
Map.empty $ opMap src
predSymMap = MapSet.foldWithKey
( \ i t -> let (j, k) = mapPredSym sorts preds (i, t) in
if b && i == j then id else
Map.insert (idToPredSymbol i t) $ idToPredSymbol j k)
Map.empty $ predMap src
in foldr Map.union sortSymMap [opSymMap, predSymMap]
| 947
|
morphismToSymbMapAux :: Bool -> Morphism f e m -> SymbolMap
morphismToSymbMapAux b mor = let
src = msource mor
sorts = sort_map mor
ops = op_map mor
preds = pred_map mor
sortSymMap = Set.fold
(\ s -> let t = mapSort sorts s in
if b && s == t then id else
Map.insert (idToSortSymbol s) $ idToSortSymbol t)
Map.empty $ sortSet src
opSymMap = MapSet.foldWithKey
( \ i t -> let (j, k) = mapOpSym sorts ops (i, t) in
if b && i == j && opKind k == opKind t then id else
Map.insert (idToOpSymbol i t) $ idToOpSymbol j k)
Map.empty $ opMap src
predSymMap = MapSet.foldWithKey
( \ i t -> let (j, k) = mapPredSym sorts preds (i, t) in
if b && i == j then id else
Map.insert (idToPredSymbol i t) $ idToPredSymbol j k)
Map.empty $ predMap src
in foldr Map.union sortSymMap [opSymMap, predSymMap]
| 947
|
morphismToSymbMapAux b mor = let
src = msource mor
sorts = sort_map mor
ops = op_map mor
preds = pred_map mor
sortSymMap = Set.fold
(\ s -> let t = mapSort sorts s in
if b && s == t then id else
Map.insert (idToSortSymbol s) $ idToSortSymbol t)
Map.empty $ sortSet src
opSymMap = MapSet.foldWithKey
( \ i t -> let (j, k) = mapOpSym sorts ops (i, t) in
if b && i == j && opKind k == opKind t then id else
Map.insert (idToOpSymbol i t) $ idToOpSymbol j k)
Map.empty $ opMap src
predSymMap = MapSet.foldWithKey
( \ i t -> let (j, k) = mapPredSym sorts preds (i, t) in
if b && i == j then id else
Map.insert (idToPredSymbol i t) $ idToPredSymbol j k)
Map.empty $ predMap src
in foldr Map.union sortSymMap [opSymMap, predSymMap]
| 887
| false
| true
| 0
| 19
| 316
| 377
| 188
| 189
| null | null |
joelburget/haste-compiler
|
Tests/RoundToInteger.hs
|
bsd-3-clause
|
runTest = putStrLn $ show r
| 27
|
runTest = putStrLn $ show r
| 27
|
runTest = putStrLn $ show r
| 27
| false
| false
| 0
| 6
| 5
| 13
| 6
| 7
| null | null |
supersven/game-of-life
|
src/Main.hs
|
bsd-2-clause
|
printBoard (r:rows) = do printRow r
putChar '\n'
printBoard rows
| 114
|
printBoard (r:rows) = do printRow r
putChar '\n'
printBoard rows
| 114
|
printBoard (r:rows) = do printRow r
putChar '\n'
printBoard rows
| 114
| false
| false
| 0
| 7
| 59
| 35
| 14
| 21
| null | null |
vladimir-ipatov/ganeti
|
src/Ganeti/Constants.hs
|
gpl-2.0
|
dssParameterTypes :: Map String VType
dssParameterTypes =
Map.fromList [(dsDiskTotal, VTypeInt),
(dsDiskReserved, VTypeInt),
(dsDiskOverhead, VTypeInt)]
| 186
|
dssParameterTypes :: Map String VType
dssParameterTypes =
Map.fromList [(dsDiskTotal, VTypeInt),
(dsDiskReserved, VTypeInt),
(dsDiskOverhead, VTypeInt)]
| 186
|
dssParameterTypes =
Map.fromList [(dsDiskTotal, VTypeInt),
(dsDiskReserved, VTypeInt),
(dsDiskOverhead, VTypeInt)]
| 148
| false
| true
| 0
| 6
| 47
| 53
| 29
| 24
| null | null |
project-oak/silveroak
|
cava/Cava2HDL/TestBench.hs
|
apache-2.0
|
formatPortWithName :: PortDeclaration -> String
formatPortWithName (Coq_mkPort name Bit) = " " ++ name ++ " = %0b"
| 114
|
formatPortWithName :: PortDeclaration -> String
formatPortWithName (Coq_mkPort name Bit) = " " ++ name ++ " = %0b"
| 114
|
formatPortWithName (Coq_mkPort name Bit) = " " ++ name ++ " = %0b"
| 66
| false
| true
| 0
| 7
| 17
| 34
| 17
| 17
| null | null |
ComputationWithBoundedResources/ara-inference
|
doc/tpdb_trs/Haskell/basic_haskell/signum_2.hs
|
mit
|
primCmpInt (Pos Zero) (Neg Zero) = EQ
| 37
|
primCmpInt (Pos Zero) (Neg Zero) = EQ
| 37
|
primCmpInt (Pos Zero) (Neg Zero) = EQ
| 37
| false
| false
| 0
| 7
| 6
| 23
| 11
| 12
| null | null |
xenog/haskoin
|
src/Network/Haskoin/Script/SigHash.hs
|
unlicense
|
setAnyoneCanPayFlag :: SigHash -> SigHash
setAnyoneCanPayFlag = (.|. 0x80)
| 74
|
setAnyoneCanPayFlag :: SigHash -> SigHash
setAnyoneCanPayFlag = (.|. 0x80)
| 74
|
setAnyoneCanPayFlag = (.|. 0x80)
| 32
| false
| true
| 0
| 5
| 8
| 19
| 11
| 8
| null | null |
juhp/leksah
|
src/IDE/Metainfo/Provider.hs
|
gpl-2.0
|
searchMeta SystemScope searchString searchType = do
systemInfo' <- getSystemInfo
packageInfo' <- getPackageInfo
case systemInfo' of
Nothing ->
case packageInfo' of
Nothing -> return []
Just (GenScopeC (PackScope _ rl), _) ->
return (searchInScope searchType searchString rl)
Just (GenScopeC (PackScope _ s)) ->
case packageInfo' of
Nothing -> return (searchInScope searchType searchString s)
Just (GenScopeC (PackScope _ rl), _) -> return (searchInScope searchType searchString rl
++ searchInScope searchType searchString s)
| 736
|
searchMeta SystemScope searchString searchType = do
systemInfo' <- getSystemInfo
packageInfo' <- getPackageInfo
case systemInfo' of
Nothing ->
case packageInfo' of
Nothing -> return []
Just (GenScopeC (PackScope _ rl), _) ->
return (searchInScope searchType searchString rl)
Just (GenScopeC (PackScope _ s)) ->
case packageInfo' of
Nothing -> return (searchInScope searchType searchString s)
Just (GenScopeC (PackScope _ rl), _) -> return (searchInScope searchType searchString rl
++ searchInScope searchType searchString s)
| 736
|
searchMeta SystemScope searchString searchType = do
systemInfo' <- getSystemInfo
packageInfo' <- getPackageInfo
case systemInfo' of
Nothing ->
case packageInfo' of
Nothing -> return []
Just (GenScopeC (PackScope _ rl), _) ->
return (searchInScope searchType searchString rl)
Just (GenScopeC (PackScope _ s)) ->
case packageInfo' of
Nothing -> return (searchInScope searchType searchString s)
Just (GenScopeC (PackScope _ rl), _) -> return (searchInScope searchType searchString rl
++ searchInScope searchType searchString s)
| 736
| false
| false
| 0
| 17
| 280
| 192
| 90
| 102
| null | null |
nomeata/list-fusion-lab
|
ListImpls/FusingFoldl.hs
|
bsd-3-clause
|
iterate :: (a -> a) -> a -> [a]
iterate f x = x : iterate f (f x)
| 66
|
iterate :: (a -> a) -> a -> [a]
iterate f x = x : iterate f (f x)
| 66
|
iterate f x = x : iterate f (f x)
| 34
| false
| true
| 0
| 8
| 19
| 53
| 26
| 27
| null | null |
suhailshergill/hakaru
|
Tests/EmbedDatatypes.hs
|
bsd-3-clause
|
fromL :: Embed r => [r a] -> r (List a)
fromL = foldr consL nilL
| 64
|
fromL :: Embed r => [r a] -> r (List a)
fromL = foldr consL nilL
| 64
|
fromL = foldr consL nilL
| 24
| false
| true
| 0
| 9
| 15
| 42
| 20
| 22
| null | null |
nomeata/ghc
|
compiler/codeGen/CgPrimOp.hs
|
bsd-3-clause
|
-- Copying and setting byte arrays
emitPrimOp [] CopyByteArrayOp [src,src_off,dst,dst_off,n] live =
doCopyByteArrayOp src src_off dst dst_off n live
| 153
|
emitPrimOp [] CopyByteArrayOp [src,src_off,dst,dst_off,n] live =
doCopyByteArrayOp src src_off dst dst_off n live
| 117
|
emitPrimOp [] CopyByteArrayOp [src,src_off,dst,dst_off,n] live =
doCopyByteArrayOp src src_off dst dst_off n live
| 117
| true
| false
| 1
| 6
| 23
| 55
| 25
| 30
| null | null |
brendanhay/gogol
|
gogol-dataflow/gen/Network/Google/Dataflow/Types.hs
|
mpl-2.0
|
-- | See, edit, configure, and delete your Google Cloud Platform data
cloudPlatformScope :: Proxy '["https://www.googleapis.com/auth/cloud-platform"]
cloudPlatformScope = Proxy
| 176
|
cloudPlatformScope :: Proxy '["https://www.googleapis.com/auth/cloud-platform"]
cloudPlatformScope = Proxy
| 106
|
cloudPlatformScope = Proxy
| 26
| true
| true
| 0
| 7
| 18
| 20
| 11
| 9
| null | null |
jgoerzen/listlike
|
testsrc/runtests.hs
|
lgpl-2.1
|
prop_elem f i = LL.elem i f @?= elem i (LL.toList f)
| 52
|
prop_elem f i = LL.elem i f @?= elem i (LL.toList f)
| 52
|
prop_elem f i = LL.elem i f @?= elem i (LL.toList f)
| 52
| false
| false
| 0
| 9
| 11
| 35
| 16
| 19
| null | null |
vialette/ppattern
|
src/Data/Algorithm/PPattern/Search/ConflictSelection.hs
|
mit
|
firstConflict (Strategy.Link2.Link2 (link1, link2) : l2s)
| horizontalConflict link1 link2 = Just $ mkHorizontalConflict link1 link2
-- HorizontalConflict link2 link1 = Just $ mkHorizontalConflict link2 link1
| verticalConflict link1 link2 = Just $ mkVerticalConflict link1 link2
| verticalConflict link2 link1 = Just $ mkVerticalConflict link2 link1
| otherwise = firstConflict l2s
| 418
|
firstConflict (Strategy.Link2.Link2 (link1, link2) : l2s)
| horizontalConflict link1 link2 = Just $ mkHorizontalConflict link1 link2
-- HorizontalConflict link2 link1 = Just $ mkHorizontalConflict link2 link1
| verticalConflict link1 link2 = Just $ mkVerticalConflict link1 link2
| verticalConflict link2 link1 = Just $ mkVerticalConflict link2 link1
| otherwise = firstConflict l2s
| 418
|
firstConflict (Strategy.Link2.Link2 (link1, link2) : l2s)
| horizontalConflict link1 link2 = Just $ mkHorizontalConflict link1 link2
-- HorizontalConflict link2 link1 = Just $ mkHorizontalConflict link2 link1
| verticalConflict link1 link2 = Just $ mkVerticalConflict link1 link2
| verticalConflict link2 link1 = Just $ mkVerticalConflict link2 link1
| otherwise = firstConflict l2s
| 418
| false
| false
| 3
| 9
| 86
| 101
| 49
| 52
| null | null |
NickAger/LearningHaskell
|
learnyouahaskellforgreatgood/chapter14-zippers.hsproj/Main.hs
|
mit
|
goUp :: Zipper a -> Zipper a
goUp (t, LeftCrumb x r:bs) = (Node x t r, bs)
| 76
|
goUp :: Zipper a -> Zipper a
goUp (t, LeftCrumb x r:bs) = (Node x t r, bs)
| 74
|
goUp (t, LeftCrumb x r:bs) = (Node x t r, bs)
| 45
| false
| true
| 0
| 7
| 19
| 56
| 27
| 29
| null | null |
sdiehl/ghc
|
compiler/backpack/DriverBkp.hs
|
bsd-3-clause
|
withBkpExeSession :: [(UnitId, ModRenaming)] -> BkpM a -> BkpM a
withBkpExeSession deps do_this = do
withBkpSession (ComponentId (fsLit "main")) [] deps ExeSession do_this
| 175
|
withBkpExeSession :: [(UnitId, ModRenaming)] -> BkpM a -> BkpM a
withBkpExeSession deps do_this = do
withBkpSession (ComponentId (fsLit "main")) [] deps ExeSession do_this
| 175
|
withBkpExeSession deps do_this = do
withBkpSession (ComponentId (fsLit "main")) [] deps ExeSession do_this
| 110
| false
| true
| 0
| 11
| 26
| 67
| 33
| 34
| null | null |
ciderpunx/exercismo
|
src/RobotSimulator.hs
|
gpl-3.0
|
coordinates :: Robot -> Location
coordinates (Robot _ (x,y)) = (x,y)
| 68
|
coordinates :: Robot -> Location
coordinates (Robot _ (x,y)) = (x,y)
| 68
|
coordinates (Robot _ (x,y)) = (x,y)
| 35
| false
| true
| 0
| 8
| 10
| 38
| 21
| 17
| null | null |
mdibaiee/picedit
|
app/Main.hs
|
bsd-3-clause
|
parseArgs :: [String] -> Options -> Options
parseArgs [] opts = opts
| 70
|
parseArgs :: [String] -> Options -> Options
parseArgs [] opts = opts
| 68
|
parseArgs [] opts = opts
| 24
| false
| true
| 0
| 6
| 13
| 29
| 15
| 14
| null | null |
gleachkr/Carnap
|
Carnap/src/Carnap/Core/ModelChecking/ModelFinder.hs
|
gpl-3.0
|
toSat (MOr x y) = SOr (toSat x) (toSat y)
| 41
|
toSat (MOr x y) = SOr (toSat x) (toSat y)
| 41
|
toSat (MOr x y) = SOr (toSat x) (toSat y)
| 41
| false
| false
| 0
| 7
| 9
| 34
| 16
| 18
| null | null |
leksah/yi
|
src/library/Yi/Editor.hs
|
gpl-2.0
|
-- | Find buffer with this key
findBufferWith :: BufferRef -> Editor -> FBuffer
findBufferWith k e = case M.lookup k (buffers e) of
Just x -> x
Nothing -> error "Editor.findBufferWith: no buffer has this key"
-- | Find buffers with this name
| 246
|
findBufferWith :: BufferRef -> Editor -> FBuffer
findBufferWith k e = case M.lookup k (buffers e) of
Just x -> x
Nothing -> error "Editor.findBufferWith: no buffer has this key"
-- | Find buffers with this name
| 215
|
findBufferWith k e = case M.lookup k (buffers e) of
Just x -> x
Nothing -> error "Editor.findBufferWith: no buffer has this key"
-- | Find buffers with this name
| 166
| true
| true
| 0
| 8
| 48
| 66
| 31
| 35
| null | null |
NoxHarmonium/lithium-lang
|
src/Codegen.hs
|
mit
|
entry :: Codegen Name
entry = gets currentBlock
| 47
|
entry :: Codegen Name
entry = gets currentBlock
| 47
|
entry = gets currentBlock
| 25
| false
| true
| 0
| 6
| 7
| 23
| 9
| 14
| null | null |
alexander-at-github/eta
|
compiler/ETA/CodeGen/ArgRep.hs
|
bsd-3-clause
|
typeArgRep :: Type -> ArgRep
typeArgRep = toArgRep . typePrimRep
| 64
|
typeArgRep :: Type -> ArgRep
typeArgRep = toArgRep . typePrimRep
| 64
|
typeArgRep = toArgRep . typePrimRep
| 35
| false
| true
| 0
| 5
| 9
| 19
| 10
| 9
| null | null |
phischu/fragnix
|
tests/packages/scotty/Data.Vector.hs
|
bsd-3-clause
|
findIndices = G.findIndices
| 27
|
findIndices = G.findIndices
| 27
|
findIndices = G.findIndices
| 27
| false
| false
| 0
| 5
| 2
| 8
| 4
| 4
| null | null |
green-haskell/ghc
|
compiler/nativeGen/SPARC/Regs.hs
|
bsd-3-clause
|
realRegSqueeze :: RegClass -> RealReg -> FastInt
realRegSqueeze cls rr
= case cls of
RcInteger
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(1)
| otherwise -> _ILIT(0)
RealRegPair{} -> _ILIT(0)
RcFloat
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(0)
| otherwise -> _ILIT(1)
RealRegPair{} -> _ILIT(2)
RcDouble
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(0)
| otherwise -> _ILIT(1)
RealRegPair{} -> _ILIT(1)
_other -> _ILIT(0)
-- | All the allocatable registers in the machine,
-- including register pairs.
| 901
|
realRegSqueeze :: RegClass -> RealReg -> FastInt
realRegSqueeze cls rr
= case cls of
RcInteger
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(1)
| otherwise -> _ILIT(0)
RealRegPair{} -> _ILIT(0)
RcFloat
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(0)
| otherwise -> _ILIT(1)
RealRegPair{} -> _ILIT(2)
RcDouble
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(0)
| otherwise -> _ILIT(1)
RealRegPair{} -> _ILIT(1)
_other -> _ILIT(0)
-- | All the allocatable registers in the machine,
-- including register pairs.
| 900
|
realRegSqueeze cls rr
= case cls of
RcInteger
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(1)
| otherwise -> _ILIT(0)
RealRegPair{} -> _ILIT(0)
RcFloat
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(0)
| otherwise -> _ILIT(1)
RealRegPair{} -> _ILIT(2)
RcDouble
-> case rr of
RealRegSingle regNo
| regNo < 32 -> _ILIT(0)
| otherwise -> _ILIT(1)
RealRegPair{} -> _ILIT(1)
_other -> _ILIT(0)
-- | All the allocatable registers in the machine,
-- including register pairs.
| 851
| false
| true
| 4
| 12
| 453
| 246
| 115
| 131
| null | null |
sdiehl/ghc
|
compiler/prelude/THNames.hs
|
bsd-3-clause
|
doublePrimLName = libFun (fsLit "doublePrimL") doublePrimLIdKey
| 63
|
doublePrimLName = libFun (fsLit "doublePrimL") doublePrimLIdKey
| 63
|
doublePrimLName = libFun (fsLit "doublePrimL") doublePrimLIdKey
| 63
| false
| false
| 0
| 7
| 5
| 17
| 8
| 9
| null | null |
NorfairKing/eden
|
src/Paths.hs
|
gpl-2.0
|
inEden :: Eden c Bool
inEden = fmap isJust maybeEdenRoot
| 56
|
inEden :: Eden c Bool
inEden = fmap isJust maybeEdenRoot
| 56
|
inEden = fmap isJust maybeEdenRoot
| 34
| false
| true
| 0
| 5
| 9
| 21
| 10
| 11
| null | null |
mumuki/mulang
|
src/Language/Mulang/Transform/Normalizer.hs
|
gpl-3.0
|
normalizeObjectLevel ops e = normalize ops e
| 71
|
normalizeObjectLevel ops e = normalize ops e
| 71
|
normalizeObjectLevel ops e = normalize ops e
| 71
| false
| false
| 0
| 5
| 33
| 16
| 7
| 9
| null | null |
naushadh/persistent
|
persistent-template/Database/Persist/TH.hs
|
mit
|
parseReferences :: PersistSettings -> Text -> Q Exp
parseReferences ps s = lift $
map (mkEntityDefSqlTypeExp embedEntityMap entityMap) noCycleEnts
where
(embedEntityMap, noCycleEnts) = embedEntityDefsMap $ parse ps s
entityMap = constructEntityMap noCycleEnts
| 273
|
parseReferences :: PersistSettings -> Text -> Q Exp
parseReferences ps s = lift $
map (mkEntityDefSqlTypeExp embedEntityMap entityMap) noCycleEnts
where
(embedEntityMap, noCycleEnts) = embedEntityDefsMap $ parse ps s
entityMap = constructEntityMap noCycleEnts
| 273
|
parseReferences ps s = lift $
map (mkEntityDefSqlTypeExp embedEntityMap entityMap) noCycleEnts
where
(embedEntityMap, noCycleEnts) = embedEntityDefsMap $ parse ps s
entityMap = constructEntityMap noCycleEnts
| 221
| false
| true
| 1
| 8
| 45
| 84
| 38
| 46
| null | null |
ggazzi/hzen
|
src/Reactive/Banana/Monitors/Cpu.hs
|
mit
|
newMonitor :: IO (SourceOf CpuMonitor)
newMonitor = do
sources <- sequence . take 8 $ repeat (newBehavior 0)
let [busy, user, nice, system, idle, iowait, irq, softirq] = sources
return CpuSource
{ sbusy = busy
, suser = user
, snice = nice
, ssystem = system
, sidle = idle
, siowait = iowait
, sirq = irq
, ssoftirq = softirq
, updateCpuMonitor = updateMany sources
}
| 492
|
newMonitor :: IO (SourceOf CpuMonitor)
newMonitor = do
sources <- sequence . take 8 $ repeat (newBehavior 0)
let [busy, user, nice, system, idle, iowait, irq, softirq] = sources
return CpuSource
{ sbusy = busy
, suser = user
, snice = nice
, ssystem = system
, sidle = idle
, siowait = iowait
, sirq = irq
, ssoftirq = softirq
, updateCpuMonitor = updateMany sources
}
| 492
|
newMonitor = do
sources <- sequence . take 8 $ repeat (newBehavior 0)
let [busy, user, nice, system, idle, iowait, irq, softirq] = sources
return CpuSource
{ sbusy = busy
, suser = user
, snice = nice
, ssystem = system
, sidle = idle
, siowait = iowait
, sirq = irq
, ssoftirq = softirq
, updateCpuMonitor = updateMany sources
}
| 453
| false
| true
| 0
| 11
| 192
| 146
| 82
| 64
| null | null |
grwlf/vsim
|
src_r/VSim/Runtime/Monad.hs
|
gpl-3.0
|
terminate :: (MonadSim m) => Time -> String -> m ()
terminate t s = pause $ Report t High s
| 92
|
terminate :: (MonadSim m) => Time -> String -> m ()
terminate t s = pause $ Report t High s
| 91
|
terminate t s = pause $ Report t High s
| 39
| false
| true
| 2
| 10
| 21
| 54
| 25
| 29
| null | null |
scharris/hmq
|
Metadata/PostgreSQL.hs
|
bsd-3-clause
|
getFieldNames :: PG.Connection -> Integer -> [Int] -> IO [String]
getFieldNames conn srcTableOid attNums =
do
attNames <- quickQuery conn attsQry []
return $ map (fromSql . head) attNames
where
attsQry = "SELECT attname FROM pg_attribute WHERE attrelid = " ++ show srcTableOid
++ " AND attnum IN (" ++ listAsString show "," attNums ++ ")"
-- For testing
| 409
|
getFieldNames :: PG.Connection -> Integer -> [Int] -> IO [String]
getFieldNames conn srcTableOid attNums =
do
attNames <- quickQuery conn attsQry []
return $ map (fromSql . head) attNames
where
attsQry = "SELECT attname FROM pg_attribute WHERE attrelid = " ++ show srcTableOid
++ " AND attnum IN (" ++ listAsString show "," attNums ++ ")"
-- For testing
| 409
|
getFieldNames conn srcTableOid attNums =
do
attNames <- quickQuery conn attsQry []
return $ map (fromSql . head) attNames
where
attsQry = "SELECT attname FROM pg_attribute WHERE attrelid = " ++ show srcTableOid
++ " AND attnum IN (" ++ listAsString show "," attNums ++ ")"
-- For testing
| 343
| false
| true
| 0
| 10
| 114
| 111
| 54
| 57
| null | null |
danchoi/yahooQuote
|
src/YahooQuote.hs
|
mit
|
string2csv :: String -> Either String [[String]]
string2csv s = case parseCSV "" s of
Left _ -> Left $ "No matching symbol"
Right csv -> Right csv
| 182
|
string2csv :: String -> Either String [[String]]
string2csv s = case parseCSV "" s of
Left _ -> Left $ "No matching symbol"
Right csv -> Right csv
| 182
|
string2csv s = case parseCSV "" s of
Left _ -> Left $ "No matching symbol"
Right csv -> Right csv
| 133
| false
| true
| 0
| 8
| 63
| 63
| 30
| 33
| null | null |
randen/haddock
|
haddock-api/src/Haddock/Utils.hs
|
bsd-2-clause
|
isAlphaChar, isDigitChar, isAlphaNumChar :: Char -> Bool
isAlphaChar c = (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')
| 124
|
isAlphaChar, isDigitChar, isAlphaNumChar :: Char -> Bool
isAlphaChar c = (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')
| 124
|
isAlphaChar c = (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')
| 67
| false
| true
| 4
| 10
| 27
| 67
| 31
| 36
| null | null |
Athas/Sindre
|
tests/Properties.hs
|
mit
|
satisfied (Exact x) y = x == y
| 30
|
satisfied (Exact x) y = x == y
| 30
|
satisfied (Exact x) y = x == y
| 30
| false
| false
| 0
| 7
| 7
| 21
| 10
| 11
| null | null |
christiaanb/Idris-dev
|
src/IRTS/CodegenLLVM.hs
|
bsd-3-clause
|
cgOp (LSExt ITNative (ITFixed to)) [x]
| 32 <= nativeTyWidth to = iCoerce SExt IT32 to x
| 92
|
cgOp (LSExt ITNative (ITFixed to)) [x]
| 32 <= nativeTyWidth to = iCoerce SExt IT32 to x
| 92
|
cgOp (LSExt ITNative (ITFixed to)) [x]
| 32 <= nativeTyWidth to = iCoerce SExt IT32 to x
| 92
| false
| false
| 0
| 9
| 20
| 50
| 23
| 27
| null | null |
aloiscochard/machines
|
src/Data/Machine/Type.hs
|
bsd-3-clause
|
construct :: Monad m => PlanT k o m a -> MachineT m k o
construct m = MachineT $ runPlanT m
(const (return Stop))
(\o k -> return (Yield o (MachineT k)))
(\f k g -> return (Await (MachineT . f) k (MachineT g)))
(return Stop)
| 232
|
construct :: Monad m => PlanT k o m a -> MachineT m k o
construct m = MachineT $ runPlanT m
(const (return Stop))
(\o k -> return (Yield o (MachineT k)))
(\f k g -> return (Await (MachineT . f) k (MachineT g)))
(return Stop)
| 232
|
construct m = MachineT $ runPlanT m
(const (return Stop))
(\o k -> return (Yield o (MachineT k)))
(\f k g -> return (Await (MachineT . f) k (MachineT g)))
(return Stop)
| 176
| false
| true
| 0
| 11
| 54
| 143
| 69
| 74
| null | null |
plclub/cis670-16fa
|
projects/DynamicLang/src/LangSnl.hs
|
mit
|
look :: HList l -> Index l a -> a
look (HCons x _) Z = x
| 56
|
look :: HList l -> Index l a -> a
look (HCons x _) Z = x
| 56
|
look (HCons x _) Z = x
| 22
| false
| true
| 0
| 10
| 16
| 46
| 20
| 26
| null | null |
joehillen/aura
|
src/Aura/Languages.hs
|
gpl-3.0
|
outOfDateMsg :: Bool -> Language -> String
outOfDateMsg True = red . \case
Japanese -> "AURで要更新！"
Polish -> "Nieaktualny!"
Croatian -> "Zastarjelo!"
Swedish -> "Utdaterad!"
German -> "Veraltet!"
Spanish -> "¡Desactualizado!"
Portuguese -> "Desatualizado!"
French -> "Périmé !"
Russian -> "Устарел!"
Italian -> "Out of Date!"
Serbian -> "Застарео!"
Norwegian -> "Utdatert!"
Indonesia -> "Ketinggalan Zaman!"
_ -> "Out of Date!"
| 524
|
outOfDateMsg :: Bool -> Language -> String
outOfDateMsg True = red . \case
Japanese -> "AURで要更新！"
Polish -> "Nieaktualny!"
Croatian -> "Zastarjelo!"
Swedish -> "Utdaterad!"
German -> "Veraltet!"
Spanish -> "¡Desactualizado!"
Portuguese -> "Desatualizado!"
French -> "Périmé !"
Russian -> "Устарел!"
Italian -> "Out of Date!"
Serbian -> "Застарео!"
Norwegian -> "Utdatert!"
Indonesia -> "Ketinggalan Zaman!"
_ -> "Out of Date!"
| 524
|
outOfDateMsg True = red . \case
Japanese -> "AURで要更新！"
Polish -> "Nieaktualny!"
Croatian -> "Zastarjelo!"
Swedish -> "Utdaterad!"
German -> "Veraltet!"
Spanish -> "¡Desactualizado!"
Portuguese -> "Desatualizado!"
French -> "Périmé !"
Russian -> "Устарел!"
Italian -> "Out of Date!"
Serbian -> "Застарео!"
Norwegian -> "Utdatert!"
Indonesia -> "Ketinggalan Zaman!"
_ -> "Out of Date!"
| 481
| false
| true
| 1
| 8
| 158
| 119
| 57
| 62
| null | null |
barkmadley/etd-retreat-2014-hteam
|
src/RemosefulProber/Main.hs
|
mit
|
--main = testStrat strat [(Cooperate, Cooperate)]
main = dilemmaMain strat
| 75
|
main = dilemmaMain strat
| 24
|
main = dilemmaMain strat
| 24
| true
| false
| 0
| 5
| 10
| 10
| 5
| 5
| null | null |
htquach/HaskellLED
|
Test_LEDDisplay.hs
|
mit
|
rt = do
runTestTT tests
quickCheck prop_charToStrings
| 61
|
rt = do
runTestTT tests
quickCheck prop_charToStrings
| 61
|
rt = do
runTestTT tests
quickCheck prop_charToStrings
| 61
| false
| false
| 0
| 7
| 14
| 18
| 7
| 11
| null | null |
ezyang/ghc
|
compiler/cmm/Hoopl/Block.hs
|
bsd-3-clause
|
blockJoinTail :: Block n e O -> n O C -> Block n e C
blockJoinTail (BlockCO f b) t = BlockCC f b t
| 98
|
blockJoinTail :: Block n e O -> n O C -> Block n e C
blockJoinTail (BlockCO f b) t = BlockCC f b t
| 98
|
blockJoinTail (BlockCO f b) t = BlockCC f b t
| 45
| false
| true
| 0
| 10
| 24
| 62
| 28
| 34
| null | null |
nbartlomiej/haskeuler
|
014/problem-014.hs
|
mit
|
filter' pairs [] = pairs
| 24
|
filter' pairs [] = pairs
| 24
|
filter' pairs [] = pairs
| 24
| false
| false
| 1
| 5
| 4
| 18
| 6
| 12
| null | null |
d3sformal/bacon-core
|
src/Utils/Miscellaneous.hs
|
mit
|
doUnlessM :: Monad m => m a -> m Bool -> m ()
doUnlessM = flip unlessM
| 70
|
doUnlessM :: Monad m => m a -> m Bool -> m ()
doUnlessM = flip unlessM
| 70
|
doUnlessM = flip unlessM
| 24
| false
| true
| 0
| 9
| 16
| 40
| 18
| 22
| null | null |
BartAdv/Idris-dev
|
src/IRTS/JavaScript/AST.hs
|
bsd-3-clause
|
compileJS' indent (JSNew name args) =
"new "
`T.append` T.pack name
`T.append` "("
`T.append` T.intercalate "," (map (compileJS' 0) args)
`T.append` ")"
| 164
|
compileJS' indent (JSNew name args) =
"new "
`T.append` T.pack name
`T.append` "("
`T.append` T.intercalate "," (map (compileJS' 0) args)
`T.append` ")"
| 164
|
compileJS' indent (JSNew name args) =
"new "
`T.append` T.pack name
`T.append` "("
`T.append` T.intercalate "," (map (compileJS' 0) args)
`T.append` ")"
| 164
| false
| false
| 0
| 10
| 33
| 92
| 45
| 47
| null | null |
xnning/fcore
|
lib/simplify/SimplifyImpl.hs
|
bsd-2-clause
|
dedeBruT i as (Product ts) = Product (map (dedeBruT i as) ts)
| 67
|
dedeBruT i as (Product ts) = Product (map (dedeBruT i as) ts)
| 67
|
dedeBruT i as (Product ts) = Product (map (dedeBruT i as) ts)
| 67
| false
| false
| 0
| 9
| 17
| 38
| 18
| 20
| null | null |
green-haskell/ghc
|
compiler/hsSyn/HsExpr.hs
|
bsd-3-clause
|
matchSeparator IfAlt = ptext (sLit "->")
| 47
|
matchSeparator IfAlt = ptext (sLit "->")
| 47
|
matchSeparator IfAlt = ptext (sLit "->")
| 47
| false
| false
| 1
| 7
| 12
| 21
| 8
| 13
| null | null |
keithodulaigh/Hets
|
Propositional/AS_BASIC_Propositional.der.hs
|
gpl-2.0
|
isPrimForm :: FORMULA -> Bool
isPrimForm f = case f of
True_atom _ -> True
False_atom _ -> True
Predication _ -> True
Negation _ _ -> True
_ -> False
-- Pretty printing for formulas
| 222
|
isPrimForm :: FORMULA -> Bool
isPrimForm f = case f of
True_atom _ -> True
False_atom _ -> True
Predication _ -> True
Negation _ _ -> True
_ -> False
-- Pretty printing for formulas
| 222
|
isPrimForm f = case f of
True_atom _ -> True
False_atom _ -> True
Predication _ -> True
Negation _ _ -> True
_ -> False
-- Pretty printing for formulas
| 192
| false
| true
| 0
| 8
| 76
| 67
| 32
| 35
| null | null |
haskell-opengl/OpenGLRaw
|
src/Graphics/GL/Functions/F17.hs
|
bsd-3-clause
|
-- glMultiTexCoord3f -----------------------------------------------------------
-- | Manual page for <https://www.opengl.org/sdk/docs/man2/xhtml/glMultiTexCoord.xml OpenGL 2.x>. The vector equivalent of this command is 'glMultiTexCoord3fv'.
glMultiTexCoord3f
:: MonadIO m
=> GLenum -- ^ @target@ of type [TextureUnit](Graphics-GL-Groups.html#TextureUnit).
-> GLfloat -- ^ @s@ of type @CoordF@.
-> GLfloat -- ^ @t@ of type @CoordF@.
-> GLfloat -- ^ @r@ of type @CoordF@.
-> m ()
glMultiTexCoord3f v1 v2 v3 v4 = liftIO $ dyn549 ptr_glMultiTexCoord3f v1 v2 v3 v4
| 573
|
glMultiTexCoord3f
:: MonadIO m
=> GLenum -- ^ @target@ of type [TextureUnit](Graphics-GL-Groups.html#TextureUnit).
-> GLfloat -- ^ @s@ of type @CoordF@.
-> GLfloat -- ^ @t@ of type @CoordF@.
-> GLfloat -- ^ @r@ of type @CoordF@.
-> m ()
glMultiTexCoord3f v1 v2 v3 v4 = liftIO $ dyn549 ptr_glMultiTexCoord3f v1 v2 v3 v4
| 330
|
glMultiTexCoord3f v1 v2 v3 v4 = liftIO $ dyn549 ptr_glMultiTexCoord3f v1 v2 v3 v4
| 81
| true
| true
| 0
| 12
| 84
| 73
| 37
| 36
| null | null |
ekalosak/haskell-practice
|
pr5.hs
|
lgpl-3.0
|
(x:xs) = (f xs) ++ [x]
| 22
|
(x:xs) = (f xs) ++ [x]
| 22
|
(x:xs) = (f xs) ++ [x]
| 22
| false
| false
| 2
| 6
| 5
| 28
| 14
| 14
| null | null |
spechub/Hets
|
SoftFOL/DFGParser.hs
|
gpl-2.0
|
logicalPartP :: Parser SPLogicalPart
logicalPartP = do
sl <- optionMaybe symbolListP
dl <- optionMaybe declarationListP
fs <- many formulaList
cl <- many clauseList
pl <- many proofList
return SPLogicalPart
{ symbolList = sl
, declarationList = dl
, formulaLists = fs
, clauseLists = cl
, proofLists = pl }
-- *** Symbol List
{- |
SPASS Symbol List
-}
| 409
|
logicalPartP :: Parser SPLogicalPart
logicalPartP = do
sl <- optionMaybe symbolListP
dl <- optionMaybe declarationListP
fs <- many formulaList
cl <- many clauseList
pl <- many proofList
return SPLogicalPart
{ symbolList = sl
, declarationList = dl
, formulaLists = fs
, clauseLists = cl
, proofLists = pl }
-- *** Symbol List
{- |
SPASS Symbol List
-}
| 409
|
logicalPartP = do
sl <- optionMaybe symbolListP
dl <- optionMaybe declarationListP
fs <- many formulaList
cl <- many clauseList
pl <- many proofList
return SPLogicalPart
{ symbolList = sl
, declarationList = dl
, formulaLists = fs
, clauseLists = cl
, proofLists = pl }
-- *** Symbol List
{- |
SPASS Symbol List
-}
| 372
| false
| true
| 1
| 10
| 117
| 108
| 52
| 56
| null | null |
phaazon/linear
|
src/Linear/Matrix.hs
|
bsd-3-clause
|
-- | Scalar-matrix product
--
-- >>> 5 *!! V2 (V2 1 2) (V2 3 4)
-- V2 (V2 5 10) (V2 15 20)
(*!!) :: (Functor m, Functor r, Num a) => a -> m (r a) -> m (r a)
s *!! m = fmap (s *^) m
| 180
|
(*!!) :: (Functor m, Functor r, Num a) => a -> m (r a) -> m (r a)
s *!! m = fmap (s *^) m
| 89
|
s *!! m = fmap (s *^) m
| 23
| true
| true
| 0
| 12
| 49
| 79
| 42
| 37
| null | null |
lnunno/blaze-bootstrap3
|
Bootstrap3/Components.hs
|
mit
|
navbarFixedTop html = H.nav html ! class_ (toValue (subStyleclasses "navbar" ["default", "fixed-top"])) ! role (toValue "navigation")
| 133
|
navbarFixedTop html = H.nav html ! class_ (toValue (subStyleclasses "navbar" ["default", "fixed-top"])) ! role (toValue "navigation")
| 133
|
navbarFixedTop html = H.nav html ! class_ (toValue (subStyleclasses "navbar" ["default", "fixed-top"])) ! role (toValue "navigation")
| 133
| false
| false
| 0
| 12
| 15
| 54
| 26
| 28
| null | null |
Spheniscida/symmath
|
Symmath/Simplify.hs
|
mit
|
prodExpTermCompare (Variable _) t = GT
| 38
|
prodExpTermCompare (Variable _) t = GT
| 38
|
prodExpTermCompare (Variable _) t = GT
| 38
| false
| false
| 1
| 6
| 5
| 18
| 8
| 10
| null | null |
nevrenato/Hets_Fork
|
CSL/GuardedDependencies.hs
|
gpl-2.0
|
{- TODO:
1. analysis for missing definitions and undeclared extparams
2. Integrating extparam domain definitions
3. check for each constant if the Guards exhaust the extparam domain (in splitAS)
-}
-- | Splits the Commands into the AssignmentStore and a program sequence
splitAS :: [Named CMD] -> (GuardedMap [EXTPARAM], [Named CMD])
splitAS cl =
let f nc (m,l) = case sentence nc of
Ass c def -> (addAssignment (senAttr nc) c def m, l)
_ -> (m, nc:l)
in foldr f (Map.empty, []) cl
| 549
|
splitAS :: [Named CMD] -> (GuardedMap [EXTPARAM], [Named CMD])
splitAS cl =
let f nc (m,l) = case sentence nc of
Ass c def -> (addAssignment (senAttr nc) c def m, l)
_ -> (m, nc:l)
in foldr f (Map.empty, []) cl
| 264
|
splitAS cl =
let f nc (m,l) = case sentence nc of
Ass c def -> (addAssignment (senAttr nc) c def m, l)
_ -> (m, nc:l)
in foldr f (Map.empty, []) cl
| 201
| true
| true
| 0
| 15
| 151
| 145
| 73
| 72
| null | null |
diku-dk/futhark
|
src/Futhark/IR/Prop.hs
|
isc
|
-- | Return the variable names used in 'Var' subexpressions. May contain
-- duplicates.
subExpVars :: [SubExp] -> [VName]
subExpVars = mapMaybe subExpVar
| 154
|
subExpVars :: [SubExp] -> [VName]
subExpVars = mapMaybe subExpVar
| 65
|
subExpVars = mapMaybe subExpVar
| 31
| true
| true
| 0
| 8
| 23
| 32
| 16
| 16
| null | null |
Moskau/estuary
|
server/estuaryWebSocket.hs
|
gpl-3.0
|
main = do
putStrLn "Tidal websocket server for Estuary, listening on port 9162"
WS.runServer "0.0.0.0" 9162 $ (\pending -> do
conn <- WS.acceptRequest pending
putStrLn "received new connection"
WS.forkPingThread conn 30
(cps,getNow) <- Tidal.bpsUtils
dss <- mapM (\_ -> Tidal.dirtStream) [0..8]
loop (cps,dss) conn
)
| 348
|
main = do
putStrLn "Tidal websocket server for Estuary, listening on port 9162"
WS.runServer "0.0.0.0" 9162 $ (\pending -> do
conn <- WS.acceptRequest pending
putStrLn "received new connection"
WS.forkPingThread conn 30
(cps,getNow) <- Tidal.bpsUtils
dss <- mapM (\_ -> Tidal.dirtStream) [0..8]
loop (cps,dss) conn
)
| 348
|
main = do
putStrLn "Tidal websocket server for Estuary, listening on port 9162"
WS.runServer "0.0.0.0" 9162 $ (\pending -> do
conn <- WS.acceptRequest pending
putStrLn "received new connection"
WS.forkPingThread conn 30
(cps,getNow) <- Tidal.bpsUtils
dss <- mapM (\_ -> Tidal.dirtStream) [0..8]
loop (cps,dss) conn
)
| 348
| false
| false
| 1
| 17
| 76
| 122
| 56
| 66
| null | null |
tpltnt/Tidal
|
Sound/Tidal/Pattern.hs
|
gpl-3.0
|
filterOnsetsInRange = filterOnsets . filterStartInRange
| 55
|
filterOnsetsInRange = filterOnsets . filterStartInRange
| 55
|
filterOnsetsInRange = filterOnsets . filterStartInRange
| 55
| false
| false
| 1
| 5
| 4
| 13
| 5
| 8
| null | null |
bos/text
|
tests/Tests/Properties/Substrings.hs
|
bsd-2-clause
|
tl_splitOn_split s = unsquare $
((TL.splitOn (TL.fromStrict s) . TL.fromStrict) `eq`
(map TL.fromStrict . T.splitOn s)) . T.intercalate s
| 180
|
tl_splitOn_split s = unsquare $
((TL.splitOn (TL.fromStrict s) . TL.fromStrict) `eq`
(map TL.fromStrict . T.splitOn s)) . T.intercalate s
| 180
|
tl_splitOn_split s = unsquare $
((TL.splitOn (TL.fromStrict s) . TL.fromStrict) `eq`
(map TL.fromStrict . T.splitOn s)) . T.intercalate s
| 180
| false
| false
| 0
| 14
| 61
| 70
| 35
| 35
| null | null |
pfq/PFQ
|
user/pfq-affinity/pfq-affinity.hs
|
gpl-2.0
|
makeIrqBinding ["all-in", n] _ = IrqBinding (read n) 0 1 none
| 84
|
makeIrqBinding ["all-in", n] _ = IrqBinding (read n) 0 1 none
| 84
|
makeIrqBinding ["all-in", n] _ = IrqBinding (read n) 0 1 none
| 84
| false
| false
| 1
| 7
| 33
| 34
| 16
| 18
| null | null |
brendanhay/gogol
|
gogol-dfareporting/gen/Network/Google/DFAReporting/Types/Product.hs
|
mpl-2.0
|
-- | Additional sizes associated with this placement. When inserting or
-- updating a placement, only the size ID field is used.
p1AdditionalSizes :: Lens' Placement [Size]
p1AdditionalSizes
= lens _p1AdditionalSizes
(\ s a -> s{_p1AdditionalSizes = a})
. _Default
. _Coerce
| 294
|
p1AdditionalSizes :: Lens' Placement [Size]
p1AdditionalSizes
= lens _p1AdditionalSizes
(\ s a -> s{_p1AdditionalSizes = a})
. _Default
. _Coerce
| 165
|
p1AdditionalSizes
= lens _p1AdditionalSizes
(\ s a -> s{_p1AdditionalSizes = a})
. _Default
. _Coerce
| 121
| true
| true
| 0
| 11
| 61
| 52
| 29
| 23
| null | null |
pbl64k/HackerRank-Contests
|
2014-10-10-FP/Infer/i.nlp2.hs
|
bsd-2-clause
|
unify' (Arr ts1 tr1) (Arr ts2 tr2) = do
if length ts1 == length ts2
then do
mapM_ (uncurry unify) (ts1 `zip` ts2)
unify tr1 tr2
else error $ "Unable to unify types " ++ show (Arr ts1 tr1) ++ " and " ++ show (Arr ts2 tr2)
| 264
|
unify' (Arr ts1 tr1) (Arr ts2 tr2) = do
if length ts1 == length ts2
then do
mapM_ (uncurry unify) (ts1 `zip` ts2)
unify tr1 tr2
else error $ "Unable to unify types " ++ show (Arr ts1 tr1) ++ " and " ++ show (Arr ts2 tr2)
| 264
|
unify' (Arr ts1 tr1) (Arr ts2 tr2) = do
if length ts1 == length ts2
then do
mapM_ (uncurry unify) (ts1 `zip` ts2)
unify tr1 tr2
else error $ "Unable to unify types " ++ show (Arr ts1 tr1) ++ " and " ++ show (Arr ts2 tr2)
| 264
| false
| false
| 0
| 13
| 91
| 117
| 56
| 61
| null | null |
gglouser/brainfree
|
src/BrainFree.hs
|
mit
|
putChr :: MonadFree BFF m => Char -> m ()
putChr c = liftF $ PutChar c ()
| 73
|
putChr :: MonadFree BFF m => Char -> m ()
putChr c = liftF $ PutChar c ()
| 73
|
putChr c = liftF $ PutChar c ()
| 31
| false
| true
| 0
| 9
| 17
| 47
| 21
| 26
| null | null |
coolhacks/scripts-hacks
|
examples/shellcheck-master/ShellCheck/Analytics.hs
|
mit
|
prop_checkRedirectToSame3 = verifyNot checkRedirectToSame "cat lol | sed -e 's/a/b/g' > foo.bar && mv foo.bar lol"
| 114
|
prop_checkRedirectToSame3 = verifyNot checkRedirectToSame "cat lol | sed -e 's/a/b/g' > foo.bar && mv foo.bar lol"
| 114
|
prop_checkRedirectToSame3 = verifyNot checkRedirectToSame "cat lol | sed -e 's/a/b/g' > foo.bar && mv foo.bar lol"
| 114
| false
| false
| 0
| 5
| 15
| 11
| 5
| 6
| null | null |
pparkkin/eta
|
compiler/ETA/DeSugar/DsBinds.hs
|
bsd-3-clause
|
dsHsWrapper :: HsWrapper -> CoreExpr -> DsM CoreExpr
dsHsWrapper WpHole e = return e
| 95
|
dsHsWrapper :: HsWrapper -> CoreExpr -> DsM CoreExpr
dsHsWrapper WpHole e = return e
| 95
|
dsHsWrapper WpHole e = return e
| 42
| false
| true
| 0
| 8
| 24
| 34
| 15
| 19
| null | null |
jwiegley/github
|
src/GitHub/Endpoints/PullRequests.hs
|
bsd-3-clause
|
-- | List pull requests files.
-- See <https://developer.github.com/v3/pulls/#list-pull-requests-files>
pullRequestFilesR :: Name Owner -> Name Repo -> IssueNumber -> FetchCount -> Request k (Vector File)
pullRequestFilesR user repo prid =
pagedQuery ["repos", toPathPart user, toPathPart repo, "pulls", toPathPart prid, "files"] []
| 336
|
pullRequestFilesR :: Name Owner -> Name Repo -> IssueNumber -> FetchCount -> Request k (Vector File)
pullRequestFilesR user repo prid =
pagedQuery ["repos", toPathPart user, toPathPart repo, "pulls", toPathPart prid, "files"] []
| 232
|
pullRequestFilesR user repo prid =
pagedQuery ["repos", toPathPart user, toPathPart repo, "pulls", toPathPart prid, "files"] []
| 131
| true
| true
| 0
| 11
| 44
| 87
| 44
| 43
| null | null |
shlevy/ghc
|
compiler/types/OptCoercion.hs
|
bsd-3-clause
|
opt_univ :: LiftingContext -> SymFlag -> UnivCoProvenance -> Role
-> Type -> Type -> Coercion
opt_univ env sym (PhantomProv h) _r ty1 ty2
| sym = mkPhantomCo h' ty2' ty1'
| otherwise = mkPhantomCo h' ty1' ty2'
where
h' = opt_co4 env sym False Nominal h
ty1' = substTy (lcSubstLeft env) ty1
ty2' = substTy (lcSubstRight env) ty2
| 361
|
opt_univ :: LiftingContext -> SymFlag -> UnivCoProvenance -> Role
-> Type -> Type -> Coercion
opt_univ env sym (PhantomProv h) _r ty1 ty2
| sym = mkPhantomCo h' ty2' ty1'
| otherwise = mkPhantomCo h' ty1' ty2'
where
h' = opt_co4 env sym False Nominal h
ty1' = substTy (lcSubstLeft env) ty1
ty2' = substTy (lcSubstRight env) ty2
| 361
|
opt_univ env sym (PhantomProv h) _r ty1 ty2
| sym = mkPhantomCo h' ty2' ty1'
| otherwise = mkPhantomCo h' ty1' ty2'
where
h' = opt_co4 env sym False Nominal h
ty1' = substTy (lcSubstLeft env) ty1
ty2' = substTy (lcSubstRight env) ty2
| 258
| false
| true
| 3
| 14
| 91
| 142
| 65
| 77
| null | null |
brendanhay/gogol
|
gogol-dialogflow/gen/Network/Google/Resource/DialogFlow/Projects/Locations/Agents/Webhooks/Get.hs
|
mpl-2.0
|
-- | OAuth access token.
plawgAccessToken :: Lens' ProjectsLocationsAgentsWebhooksGet (Maybe Text)
plawgAccessToken
= lens _plawgAccessToken
(\ s a -> s{_plawgAccessToken = a})
| 184
|
plawgAccessToken :: Lens' ProjectsLocationsAgentsWebhooksGet (Maybe Text)
plawgAccessToken
= lens _plawgAccessToken
(\ s a -> s{_plawgAccessToken = a})
| 159
|
plawgAccessToken
= lens _plawgAccessToken
(\ s a -> s{_plawgAccessToken = a})
| 85
| true
| true
| 1
| 9
| 29
| 52
| 25
| 27
| null | null |
fgaray/shakespeare
|
app/servius.hs
|
mit
|
readFileUtf8 :: Text -> IO String
readFileUtf8 fp = do
bs <- S8.readFile $ T.unpack fp
let t = decodeUtf8With lenientDecode bs
return $ T.unpack t
| 158
|
readFileUtf8 :: Text -> IO String
readFileUtf8 fp = do
bs <- S8.readFile $ T.unpack fp
let t = decodeUtf8With lenientDecode bs
return $ T.unpack t
| 158
|
readFileUtf8 fp = do
bs <- S8.readFile $ T.unpack fp
let t = decodeUtf8With lenientDecode bs
return $ T.unpack t
| 124
| false
| true
| 0
| 10
| 37
| 65
| 29
| 36
| null | null |
kim/amazonka
|
amazonka-autoscaling/gen/Network/AWS/AutoScaling/Types.hs
|
mpl-2.0
|
-- | The time that the action is scheduled to end. This value can be up to one
-- month in the future.
sugaEndTime :: Lens' ScheduledUpdateGroupAction (Maybe UTCTime)
sugaEndTime = lens _sugaEndTime (\s a -> s { _sugaEndTime = a }) . mapping _Time
| 247
|
sugaEndTime :: Lens' ScheduledUpdateGroupAction (Maybe UTCTime)
sugaEndTime = lens _sugaEndTime (\s a -> s { _sugaEndTime = a }) . mapping _Time
| 144
|
sugaEndTime = lens _sugaEndTime (\s a -> s { _sugaEndTime = a }) . mapping _Time
| 80
| true
| true
| 0
| 10
| 44
| 54
| 29
| 25
| null | null |
cgorski/general-games
|
src/Game/Game/Poker.hs
|
mit
|
isHand TwoPair cards = if isTwoPair cards then True else False
| 62
|
isHand TwoPair cards = if isTwoPair cards then True else False
| 62
|
isHand TwoPair cards = if isTwoPair cards then True else False
| 62
| false
| false
| 0
| 6
| 10
| 22
| 11
| 11
| null | null |
GaloisInc/sk-dev-platform
|
user/sklite/src/Sklite/ToolMain.hs
|
bsd-3-clause
|
usageHeader :: String -> String
usageHeader n =
"Usage: " ++ n ++ " [options] <layout configuration path> <output directory>"
| 129
|
usageHeader :: String -> String
usageHeader n =
"Usage: " ++ n ++ " [options] <layout configuration path> <output directory>"
| 129
|
usageHeader n =
"Usage: " ++ n ++ " [options] <layout configuration path> <output directory>"
| 97
| false
| true
| 0
| 6
| 23
| 26
| 13
| 13
| null | null |
cyclohexanamine/haskbot
|
src/Bot/Scripting/Core.hs
|
bsd-3-clause
|
-- | Event hooks
callbacks = [ connected
, disconnected
, manageReadyStatus
, respondToPing
, managePingTimer
, respondToPong
, acquiredNick
, identSuccess
, respondToJoin
, respondToPart
, respondToKick
, unableToJoin
, opOnJoin
, respondToNAMES
, respondToWHOISUSER
, respondToWHOWASUSER
]
| 488
|
callbacks = [ connected
, disconnected
, manageReadyStatus
, respondToPing
, managePingTimer
, respondToPong
, acquiredNick
, identSuccess
, respondToJoin
, respondToPart
, respondToKick
, unableToJoin
, opOnJoin
, respondToNAMES
, respondToWHOISUSER
, respondToWHOWASUSER
]
| 471
|
callbacks = [ connected
, disconnected
, manageReadyStatus
, respondToPing
, managePingTimer
, respondToPong
, acquiredNick
, identSuccess
, respondToJoin
, respondToPart
, respondToKick
, unableToJoin
, opOnJoin
, respondToNAMES
, respondToWHOISUSER
, respondToWHOWASUSER
]
| 471
| true
| false
| 0
| 5
| 235
| 55
| 36
| 19
| null | null |
brendanhay/gogol
|
gogol-tracing/gen/Network/Google/Tracing/Types/Product.hs
|
mpl-2.0
|
-- | A list of messages that carry the error details. There will be a common
-- set of message types for APIs to use.
sDetails :: Lens' Status [StatusDetailsItem]
sDetails
= lens _sDetails (\ s a -> s{_sDetails = a}) .
_Default
. _Coerce
| 251
|
sDetails :: Lens' Status [StatusDetailsItem]
sDetails
= lens _sDetails (\ s a -> s{_sDetails = a}) .
_Default
. _Coerce
| 133
|
sDetails
= lens _sDetails (\ s a -> s{_sDetails = a}) .
_Default
. _Coerce
| 88
| true
| true
| 1
| 9
| 58
| 60
| 30
| 30
| null | null |
maggy96/haskell
|
99 Problems/31_41.hs
|
mit
|
isPrime :: Int -> Bool
isPrime n = all (== False) $ map (\x -> n `mod` x == 0) $ reverse [2,3..(n - 1)]
| 104
|
isPrime :: Int -> Bool
isPrime n = all (== False) $ map (\x -> n `mod` x == 0) $ reverse [2,3..(n - 1)]
| 104
|
isPrime n = all (== False) $ map (\x -> n `mod` x == 0) $ reverse [2,3..(n - 1)]
| 81
| false
| true
| 0
| 11
| 25
| 72
| 39
| 33
| null | null |
kejace/ethereum-client-haskell
|
src/Blockchain/Data/Wire.hs
|
bsd-3-clause
|
terminationReasonToNumber ConnectedToSelf = 0x0a
| 48
|
terminationReasonToNumber ConnectedToSelf = 0x0a
| 48
|
terminationReasonToNumber ConnectedToSelf = 0x0a
| 48
| false
| false
| 0
| 5
| 3
| 9
| 4
| 5
| null | null |
ComputationWithBoundedResources/ara-inference
|
doc/tpdb_trs/Haskell/basic_haskell/scanr1_1.hs
|
mit
|
scanr1Qs0 vw vx qs = qs
| 23
|
scanr1Qs0 vw vx qs = qs
| 23
|
scanr1Qs0 vw vx qs = qs
| 23
| false
| false
| 0
| 5
| 5
| 13
| 6
| 7
| null | null |
zaxtax/hakaru
|
haskell/Examples/OptimizationTests.hs
|
bsd-3-clause
|
prog4_before = do
bias <- unconditioned (beta 1 1)
replicateM flips (conditioned (bern bias))
return bias
| 117
|
prog4_before = do
bias <- unconditioned (beta 1 1)
replicateM flips (conditioned (bern bias))
return bias
| 117
|
prog4_before = do
bias <- unconditioned (beta 1 1)
replicateM flips (conditioned (bern bias))
return bias
| 117
| false
| false
| 0
| 11
| 27
| 50
| 22
| 28
| null | null |
rodrigogribeiro/mptc
|
test/Data/TestCase1TcExp.hs
|
bsd-3-clause
|
idf' = Ident "f"
| 16
|
idf' = Ident "f"
| 16
|
idf' = Ident "f"
| 16
| false
| false
| 1
| 5
| 3
| 12
| 4
| 8
| null | null |
yav/language-lua
|
src/Language/Lua/LexerUtils.hs
|
bsd-3-clause
|
enterLongString :: Action Mode [Lexeme Token]
enterLongString =
do inp <- startInput
len <- matchLength
setLexerState (QuoteMode inp len False)
return []
-- | Start lexing of a string literal
| 209
|
enterLongString :: Action Mode [Lexeme Token]
enterLongString =
do inp <- startInput
len <- matchLength
setLexerState (QuoteMode inp len False)
return []
-- | Start lexing of a string literal
| 209
|
enterLongString =
do inp <- startInput
len <- matchLength
setLexerState (QuoteMode inp len False)
return []
-- | Start lexing of a string literal
| 163
| false
| true
| 0
| 9
| 47
| 61
| 28
| 33
| null | null |
pbl64k/HackerRank-Contests
|
2014-10-10-FP/Infer/i.fail.hs
|
bsd-2-clause
|
instantiate u m (Pair t1 t2) = do
(t', m') <- instantiate u m t1
(t'', m'') <- instantiate u m' t2
return (Pair t' t'', m'')
| 136
|
instantiate u m (Pair t1 t2) = do
(t', m') <- instantiate u m t1
(t'', m'') <- instantiate u m' t2
return (Pair t' t'', m'')
| 136
|
instantiate u m (Pair t1 t2) = do
(t', m') <- instantiate u m t1
(t'', m'') <- instantiate u m' t2
return (Pair t' t'', m'')
| 136
| false
| false
| 0
| 9
| 38
| 81
| 38
| 43
| null | null |
josuf107/H
|
H/Test.hs
|
gpl-2.0
|
testNotCompleted :: Test
testNotCompleted = rightOrFail (parseTask "xdo this")
(task "xdo this")
| 100
|
testNotCompleted :: Test
testNotCompleted = rightOrFail (parseTask "xdo this")
(task "xdo this")
| 100
|
testNotCompleted = rightOrFail (parseTask "xdo this")
(task "xdo this")
| 75
| false
| true
| 0
| 7
| 15
| 29
| 14
| 15
| null | null |
pparkkin/eta
|
compiler/ETA/Types/TyCon.hs
|
bsd-3-clause
|
-- Quote promoted DataCons
-- in types
pprPromotionQuote (PromotedTyCon {}) = ifPprDebug (char '\'')
| 155
|
pprPromotionQuote (PromotedTyCon {}) = ifPprDebug (char '\'')
| 63
|
pprPromotionQuote (PromotedTyCon {}) = ifPprDebug (char '\'')
| 63
| true
| false
| 0
| 7
| 68
| 27
| 14
| 13
| null | null |
spechub/Hets
|
Logic/LGToJson.hs
|
gpl-2.0
|
usableProvers :: LogicGraph -> IO Json
usableProvers lg = do
ps <- mapM proversOfLogic . Map.elems $ logics lg
return $ mkJObj [("provers", mkJArr $ concat ps)]
| 164
|
usableProvers :: LogicGraph -> IO Json
usableProvers lg = do
ps <- mapM proversOfLogic . Map.elems $ logics lg
return $ mkJObj [("provers", mkJArr $ concat ps)]
| 164
|
usableProvers lg = do
ps <- mapM proversOfLogic . Map.elems $ logics lg
return $ mkJObj [("provers", mkJArr $ concat ps)]
| 125
| false
| true
| 0
| 12
| 30
| 70
| 33
| 37
| null | null |
bitemyapp/wreq
|
Network/Wreq/Lens.hs
|
bsd-3-clause
|
-- | A lens onto the hostname portion of a proxy configuration.
proxyHost :: Lens' Proxy ByteString
proxyHost = TH.proxyHost
| 124
|
proxyHost :: Lens' Proxy ByteString
proxyHost = TH.proxyHost
| 60
|
proxyHost = TH.proxyHost
| 24
| true
| true
| 0
| 5
| 19
| 19
| 10
| 9
| null | null |
wereHamster/haskell-github-hook
|
tests/Tests.hs
|
unlicense
|
parsePayload ".." = return True
| 31
|
parsePayload ".." = return True
| 31
|
parsePayload ".." = return True
| 31
| false
| false
| 0
| 5
| 4
| 12
| 5
| 7
| null | null |
nadavshemer/buildsome
|
src/Lib/Makefile/Parser.hs
|
gpl-2.0
|
horizSpaces1 :: Monad m => ParserG u m ()
horizSpaces1 = P.skipMany1 horizSpace
| 79
|
horizSpaces1 :: Monad m => ParserG u m ()
horizSpaces1 = P.skipMany1 horizSpace
| 79
|
horizSpaces1 = P.skipMany1 horizSpace
| 37
| false
| true
| 0
| 7
| 12
| 32
| 15
| 17
| null | null |
sherwoodwang/wxHaskell
|
wxcore/src/haskell/Graphics/UI/WXCore/Events.hs
|
lgpl-2.1
|
dropFileHandler :: Num a
=> (Point2 a -> [String] -> IO ())
-> IO (FunPtr
(Ptr obj -> CInt -> CInt -> Ptr (Ptr CWchar) -> CInt -> IO ())
)
dropFileHandler event =
wrapFileDropHandler $ \_obj x y carr size -> do
arr <- peekArray (fromIntegral size) carr
files <- mapM peekCWString arr
event (point (fromIntegral x) (fromIntegral y)) files
| 431
|
dropFileHandler :: Num a
=> (Point2 a -> [String] -> IO ())
-> IO (FunPtr
(Ptr obj -> CInt -> CInt -> Ptr (Ptr CWchar) -> CInt -> IO ())
)
dropFileHandler event =
wrapFileDropHandler $ \_obj x y carr size -> do
arr <- peekArray (fromIntegral size) carr
files <- mapM peekCWString arr
event (point (fromIntegral x) (fromIntegral y)) files
| 431
|
dropFileHandler event =
wrapFileDropHandler $ \_obj x y carr size -> do
arr <- peekArray (fromIntegral size) carr
files <- mapM peekCWString arr
event (point (fromIntegral x) (fromIntegral y)) files
| 214
| false
| true
| 0
| 17
| 154
| 171
| 81
| 90
| null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.