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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
idupree/haskell-time-steward | TestSim.hs | gpl-3.0 | showList__ :: String -> String -> String -> (a -> ShowS) -> [a] -> ShowS
showList__ beg end _sep _ [] s = beg ++ end ++ s | 130 | showList__ :: String -> String -> String -> (a -> ShowS) -> [a] -> ShowS
showList__ beg end _sep _ [] s = beg ++ end ++ s | 130 | showList__ beg end _sep _ [] s = beg ++ end ++ s | 56 | false | true | 0 | 10 | 36 | 64 | 33 | 31 | null | null |
joelburget/tapl | Untyped/parse2.hs | bsd-3-clause | command :: TermParser Command
command = cmdBinder <|> cmdTerm where
cmdTerm = Eval Info <$> term
cmdBinder = try $ do
identifier <- lowerIdentifier
bind <- binder
modify ((identifier, bind):)
return $ Bind Info identifier bind
-- | "Right-hand sides of top-level bindings" | 313 | command :: TermParser Command
command = cmdBinder <|> cmdTerm where
cmdTerm = Eval Info <$> term
cmdBinder = try $ do
identifier <- lowerIdentifier
bind <- binder
modify ((identifier, bind):)
return $ Bind Info identifier bind
-- | "Right-hand sides of top-level bindings" | 313 | command = cmdBinder <|> cmdTerm where
cmdTerm = Eval Info <$> term
cmdBinder = try $ do
identifier <- lowerIdentifier
bind <- binder
modify ((identifier, bind):)
return $ Bind Info identifier bind
-- | "Right-hand sides of top-level bindings" | 283 | false | true | 0 | 10 | 83 | 85 | 43 | 42 | null | null |
Gabriel439/succinct | tests/poppyTest.hs | bsd-2-clause | case_Poppy_is_RankNaive_63 = testForLength 63 | 45 | case_Poppy_is_RankNaive_63 = testForLength 63 | 45 | case_Poppy_is_RankNaive_63 = testForLength 63 | 45 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
andersk/haskell-cgi | Network/CGI/Accept.hs | bsd-3-clause | compareSpecificity :: Acceptable a => a -> a -> Ordering
compareSpecificity x y
| x `includes` y && y `includes` x = EQ
| x `includes` y = GT
| y `includes` x = LT
| otherwise = error "Non-comparable Acceptables" | 229 | compareSpecificity :: Acceptable a => a -> a -> Ordering
compareSpecificity x y
| x `includes` y && y `includes` x = EQ
| x `includes` y = GT
| y `includes` x = LT
| otherwise = error "Non-comparable Acceptables" | 229 | compareSpecificity x y
| x `includes` y && y `includes` x = EQ
| x `includes` y = GT
| y `includes` x = LT
| otherwise = error "Non-comparable Acceptables" | 172 | false | true | 0 | 10 | 57 | 95 | 48 | 47 | null | null |
bitemyapp/ghc | compiler/cmm/CLabel.hs | bsd-3-clause | needsCDecl (DynamicLinkerLabel {}) = panic "needsCDecl DynamicLinkerLabel" | 79 | needsCDecl (DynamicLinkerLabel {}) = panic "needsCDecl DynamicLinkerLabel" | 79 | needsCDecl (DynamicLinkerLabel {}) = panic "needsCDecl DynamicLinkerLabel" | 79 | false | false | 0 | 7 | 11 | 19 | 9 | 10 | null | null |
jwbuurlage/category-theory-programmers | examples/folds/folds.hs | mit | maxf :: (Bounded a, Ord a) => [a] -> a
maxf = foldr max minBound | 64 | maxf :: (Bounded a, Ord a) => [a] -> a
maxf = foldr max minBound | 64 | maxf = foldr max minBound | 25 | false | true | 0 | 8 | 14 | 44 | 21 | 23 | null | null |
bitemyapp/ganeti | src/Ganeti/Runtime.hs | bsd-2-clause | daemonGroup (DaemonGroup GanetiMond) = AutoConf.mondGroup | 60 | daemonGroup (DaemonGroup GanetiMond) = AutoConf.mondGroup | 60 | daemonGroup (DaemonGroup GanetiMond) = AutoConf.mondGroup | 60 | false | false | 0 | 7 | 7 | 17 | 8 | 9 | null | null |
lukexi/rumpus | src/Rumpus/Systems/Creator.hs | bsd-3-clause | checkForDestruction :: (MonadIO m, MonadState ECS m) => WhichHand -> m Bool
checkForDestruction whichHand = do
let otherHand = otherHandFrom whichHand
maybePendingDestruction <- viewSystem sysCreator $
(crtPendingDestruction . at otherHand)
forM_ maybePendingDestruction $ \destroyID -> do
sceneWatcherRemoveEntity destroyID
return (isJust maybePendingDestruction) | 396 | checkForDestruction :: (MonadIO m, MonadState ECS m) => WhichHand -> m Bool
checkForDestruction whichHand = do
let otherHand = otherHandFrom whichHand
maybePendingDestruction <- viewSystem sysCreator $
(crtPendingDestruction . at otherHand)
forM_ maybePendingDestruction $ \destroyID -> do
sceneWatcherRemoveEntity destroyID
return (isJust maybePendingDestruction) | 396 | checkForDestruction whichHand = do
let otherHand = otherHandFrom whichHand
maybePendingDestruction <- viewSystem sysCreator $
(crtPendingDestruction . at otherHand)
forM_ maybePendingDestruction $ \destroyID -> do
sceneWatcherRemoveEntity destroyID
return (isJust maybePendingDestruction) | 320 | false | true | 0 | 11 | 72 | 107 | 49 | 58 | null | null |
ranjitjhala/gradr | Auth/Account.hs | mit | -- import Text.Blaze.Internal (Markup)
getNewAccountR :: YesodAuthAccount db site
=> HandlerT Auth (HandlerT site IO) Html
getNewAccountR = do
tm <- getRouteToParent
lift $ defaultLayout $ do
setTitleI Msg.RegisterLong
customNewAccountWidget tm | 297 | getNewAccountR :: YesodAuthAccount db site
=> HandlerT Auth (HandlerT site IO) Html
getNewAccountR = do
tm <- getRouteToParent
lift $ defaultLayout $ do
setTitleI Msg.RegisterLong
customNewAccountWidget tm | 247 | getNewAccountR = do
tm <- getRouteToParent
lift $ defaultLayout $ do
setTitleI Msg.RegisterLong
customNewAccountWidget tm | 145 | true | true | 0 | 11 | 83 | 68 | 31 | 37 | null | null |
Dobiasd/HackerRank-solutions | Algorithms/Warmup/Service_Lane/Main.hs | mit | solve :: [Int] -> [Int] -> Int
solve widths [i, j] = sublist i (j + 1) widths |> minimum | 88 | solve :: [Int] -> [Int] -> Int
solve widths [i, j] = sublist i (j + 1) widths |> minimum | 88 | solve widths [i, j] = sublist i (j + 1) widths |> minimum | 57 | false | true | 0 | 8 | 19 | 54 | 29 | 25 | null | null |
melted/idris-lua | src/IRTS/CodegenLua.hs | isc | cgOp (LSLt _) [l, r]
= boolInt $ Binop L.LT l r | 52 | cgOp (LSLt _) [l, r]
= boolInt $ Binop L.LT l r | 52 | cgOp (LSLt _) [l, r]
= boolInt $ Binop L.LT l r | 52 | false | false | 3 | 6 | 16 | 39 | 18 | 21 | null | null |
thomie/cabal | Cabal/Distribution/PackageDescription.hs | bsd-3-clause | cNot c = CNot c | 22 | cNot c = CNot c | 22 | cNot c = CNot c | 22 | false | false | 0 | 5 | 11 | 12 | 5 | 7 | null | null |
rgrempel/frelm.org | vendor/elm-format/parser/src/Parse/Helpers.hs | mit | spaceySepBy1 :: IParser sep -> IParser a -> IParser (ExposedCommentedList a)
spaceySepBy1 sep parser =
let
-- step :: PostCommented (WithEol a) -> [Commented (WithEol a)] -> Comments -> IParser (ExposedCommentedList a)
step first rest post =
do
next <- withEol parser
choice
[ try (padded sep)
>>= (\(preSep, _, postSep) -> step first (Commented post next preSep : rest) postSep)
, return $ Multiple first (reverse rest) (post, next)
]
in
do
value <- withEol parser
choice
[ try (padded sep)
>>= (\(preSep, _, postSep) -> step (value, preSep) [] postSep)
, return $ Single value
]
-- DEPRECATED: use spaceySepBy1 instead | 875 | spaceySepBy1 :: IParser sep -> IParser a -> IParser (ExposedCommentedList a)
spaceySepBy1 sep parser =
let
-- step :: PostCommented (WithEol a) -> [Commented (WithEol a)] -> Comments -> IParser (ExposedCommentedList a)
step first rest post =
do
next <- withEol parser
choice
[ try (padded sep)
>>= (\(preSep, _, postSep) -> step first (Commented post next preSep : rest) postSep)
, return $ Multiple first (reverse rest) (post, next)
]
in
do
value <- withEol parser
choice
[ try (padded sep)
>>= (\(preSep, _, postSep) -> step (value, preSep) [] postSep)
, return $ Single value
]
-- DEPRECATED: use spaceySepBy1 instead | 875 | spaceySepBy1 sep parser =
let
-- step :: PostCommented (WithEol a) -> [Commented (WithEol a)] -> Comments -> IParser (ExposedCommentedList a)
step first rest post =
do
next <- withEol parser
choice
[ try (padded sep)
>>= (\(preSep, _, postSep) -> step first (Commented post next preSep : rest) postSep)
, return $ Multiple first (reverse rest) (post, next)
]
in
do
value <- withEol parser
choice
[ try (padded sep)
>>= (\(preSep, _, postSep) -> step (value, preSep) [] postSep)
, return $ Single value
]
-- DEPRECATED: use spaceySepBy1 instead | 798 | false | true | 0 | 19 | 357 | 229 | 115 | 114 | null | null |
leshchevds/ganeti | src/Ganeti/OpCodes.hs | bsd-2-clause | opSummaryVal OpNodeModifyStorage { opNodeName = s } = Just (fromNonEmpty s) | 75 | opSummaryVal OpNodeModifyStorage { opNodeName = s } = Just (fromNonEmpty s) | 75 | opSummaryVal OpNodeModifyStorage { opNodeName = s } = Just (fromNonEmpty s) | 75 | false | false | 0 | 8 | 10 | 27 | 13 | 14 | null | null |
chrisdotcode/hackage-server | Distribution/Server/Framework/BackupRestore.hs | bsd-3-clause | formatUTCTime :: UTCTime -> String
formatUTCTime = Time.formatTime defaultTimeLocale timeFormatSpec | 99 | formatUTCTime :: UTCTime -> String
formatUTCTime = Time.formatTime defaultTimeLocale timeFormatSpec | 99 | formatUTCTime = Time.formatTime defaultTimeLocale timeFormatSpec | 64 | false | true | 0 | 6 | 9 | 22 | 11 | 11 | null | null |
jff/translate | src/Text/Language/Translate.hs | bsd-3-clause | translate :: String -> String -> String -> IO (Maybe String)
translate from to what = do
r <- curl - trans_api from to what
case r of
Nothing -> return - Nothing
Just x ->
let status = x.decodeJSON
in
if status.responseStatus == 200
then do
let rgood = x.decodeJSON
return - Just - rgood.responseData.translatedText
else do
return Nothing | 415 | translate :: String -> String -> String -> IO (Maybe String)
translate from to what = do
r <- curl - trans_api from to what
case r of
Nothing -> return - Nothing
Just x ->
let status = x.decodeJSON
in
if status.responseStatus == 200
then do
let rgood = x.decodeJSON
return - Just - rgood.responseData.translatedText
else do
return Nothing | 415 | translate from to what = do
r <- curl - trans_api from to what
case r of
Nothing -> return - Nothing
Just x ->
let status = x.decodeJSON
in
if status.responseStatus == 200
then do
let rgood = x.decodeJSON
return - Just - rgood.responseData.translatedText
else do
return Nothing | 354 | false | true | 0 | 19 | 136 | 148 | 68 | 80 | null | null |
beni55/texmath | src/Text/TeXMath/Readers/TeX.hs | gpl-2.0 | label :: TP ()
label = ctrlseq "label" *> braces (skipMany (noneOf "}")) | 72 | label :: TP ()
label = ctrlseq "label" *> braces (skipMany (noneOf "}")) | 72 | label = ctrlseq "label" *> braces (skipMany (noneOf "}")) | 57 | false | true | 2 | 9 | 12 | 45 | 20 | 25 | null | null |
mitochon/hexercise | src/haskellbook/ch17/ch17.hs | mit | -- 3
x' :: Maybe Int
x' = elemIndex 3 [1,2,3,4,5] | 50 | x' :: Maybe Int
x' = elemIndex 3 [1,2,3,4,5] | 44 | x' = elemIndex 3 [1,2,3,4,5] | 28 | true | true | 1 | 6 | 11 | 38 | 20 | 18 | null | null |
dylex/wai | warp/Network/Wai/Handler/Warp/Header.hs | mit | responseKeyIndex "server" = idxServer | 45 | responseKeyIndex "server" = idxServer | 45 | responseKeyIndex "server" = idxServer | 45 | false | false | 0 | 5 | 11 | 9 | 4 | 5 | null | null |
pushkinma/frag | src/Collision.hs | gpl-2.0 | xCheck Nothing = (False,False,False,1.0, (0.0,0.0,0.0))
| 57 | fixCheck Nothing = (False,False,False,1.0, (0.0,0.0,0.0)) | 57 | fixCheck Nothing = (False,False,False,1.0, (0.0,0.0,0.0)) | 57 | false | false | 0 | 6 | 6 | 33 | 20 | 13 | null | null |
johnpmayer/elm-compiler | src/Reporting/Error/Syntax.hs | bsd-3-clause | -- REPORTING PARSE ERRORS
parseErrorReport :: [Parsec.Message] -> Report.Report
parseErrorReport messages =
let
addMsg message hint =
case message of
Parsec.SysUnExpect _msg ->
hint
Parsec.UnExpect _msg ->
hint
Parsec.Expect msg ->
let
msg' =
if msg `elem` [whitespace, newline, freshLine]
then "whitespace"
else msg
in
hint { _expected = Set.insert msg' (_expected hint) }
Parsec.Message msg ->
hint { _messages = msg : _messages hint }
(ParseHint msgs expects) =
foldr addMsg emptyHint messages
preHint =
case msgs of
[msg] ->
case unkeyword msg of
Just kwd ->
"It looks like the keyword `" ++ kwd ++ "` is being used as a variable.\n"
++ "Try renaming it to something else."
Nothing ->
msg
_ -> "I ran into something unexpected when parsing your code!"
postHint =
if Set.null expects
then ""
else
"I am looking for one of the following things:\n"
++ concatMap ("\n "++) (Set.toList expects)
in
Report.simple "SYNTAX PROBLEM" preHint postHint | 1,307 | parseErrorReport :: [Parsec.Message] -> Report.Report
parseErrorReport messages =
let
addMsg message hint =
case message of
Parsec.SysUnExpect _msg ->
hint
Parsec.UnExpect _msg ->
hint
Parsec.Expect msg ->
let
msg' =
if msg `elem` [whitespace, newline, freshLine]
then "whitespace"
else msg
in
hint { _expected = Set.insert msg' (_expected hint) }
Parsec.Message msg ->
hint { _messages = msg : _messages hint }
(ParseHint msgs expects) =
foldr addMsg emptyHint messages
preHint =
case msgs of
[msg] ->
case unkeyword msg of
Just kwd ->
"It looks like the keyword `" ++ kwd ++ "` is being used as a variable.\n"
++ "Try renaming it to something else."
Nothing ->
msg
_ -> "I ran into something unexpected when parsing your code!"
postHint =
if Set.null expects
then ""
else
"I am looking for one of the following things:\n"
++ concatMap ("\n "++) (Set.toList expects)
in
Report.simple "SYNTAX PROBLEM" preHint postHint | 1,280 | parseErrorReport messages =
let
addMsg message hint =
case message of
Parsec.SysUnExpect _msg ->
hint
Parsec.UnExpect _msg ->
hint
Parsec.Expect msg ->
let
msg' =
if msg `elem` [whitespace, newline, freshLine]
then "whitespace"
else msg
in
hint { _expected = Set.insert msg' (_expected hint) }
Parsec.Message msg ->
hint { _messages = msg : _messages hint }
(ParseHint msgs expects) =
foldr addMsg emptyHint messages
preHint =
case msgs of
[msg] ->
case unkeyword msg of
Just kwd ->
"It looks like the keyword `" ++ kwd ++ "` is being used as a variable.\n"
++ "Try renaming it to something else."
Nothing ->
msg
_ -> "I ran into something unexpected when parsing your code!"
postHint =
if Set.null expects
then ""
else
"I am looking for one of the following things:\n"
++ concatMap ("\n "++) (Set.toList expects)
in
Report.simple "SYNTAX PROBLEM" preHint postHint | 1,226 | true | true | 0 | 18 | 516 | 287 | 146 | 141 | null | null |
Saulzar/Ants | Ant/Scenario.hs | bsd-3-clause | readSquares :: Size -> Handle -> IO Map
readSquares size handle = do
squares <- liftM concat $ readLines handle mapLine
return $ fromSquares size squares | 161 | readSquares :: Size -> Handle -> IO Map
readSquares size handle = do
squares <- liftM concat $ readLines handle mapLine
return $ fromSquares size squares | 161 | readSquares size handle = do
squares <- liftM concat $ readLines handle mapLine
return $ fromSquares size squares | 121 | false | true | 0 | 9 | 33 | 58 | 26 | 32 | null | null |
Mahdi89/eTeak | src/ParseTree.hs | bsd-3-clause | exprRef (OpenChanRead _ _ _ ref) = Just ref | 43 | exprRef (OpenChanRead _ _ _ ref) = Just ref | 43 | exprRef (OpenChanRead _ _ _ ref) = Just ref | 43 | false | false | 0 | 7 | 8 | 24 | 11 | 13 | null | null |
chrisdone/hl | src/HL/M/Wiki.hs | bsd-3-clause | showSpoon :: Show a => a -> Maybe a
showSpoon a =
(fmap (const a)
(spoon (length (show a)))) | 102 | showSpoon :: Show a => a -> Maybe a
showSpoon a =
(fmap (const a)
(spoon (length (show a)))) | 102 | showSpoon a =
(fmap (const a)
(spoon (length (show a)))) | 66 | false | true | 0 | 12 | 28 | 60 | 29 | 31 | null | null |
sdiehl/ghc | compiler/GHC/Stg/Unarise.hs | bsd-3-clause | elimCase _ args bndr alt_ty alts
= pprPanic "elimCase - unhandled case"
(ppr args <+> ppr bndr <+> ppr alt_ty $$ ppr alts) | 130 | elimCase _ args bndr alt_ty alts
= pprPanic "elimCase - unhandled case"
(ppr args <+> ppr bndr <+> ppr alt_ty $$ ppr alts) | 130 | elimCase _ args bndr alt_ty alts
= pprPanic "elimCase - unhandled case"
(ppr args <+> ppr bndr <+> ppr alt_ty $$ ppr alts) | 130 | false | false | 0 | 9 | 30 | 50 | 22 | 28 | null | null |
brendanhay/pagerduty | src/Network/PagerDuty/REST/Services.hs | mpl-2.0 | -- | Regenerate a new service key for an existing service.
--
-- _Warning! The service's previous key will be invalidated, and existing
-- monitoring integrations will need to be modified to use the new key!_
--
-- @POST services\/\:id\/regenerate_key@
--
-- /See:/ <http://developer.pagerduty.com/documentation/rest/services/regenerate_key>
regenerateKey :: ServiceId -> Request Empty s Service
regenerateKey i = empty & meth .~ POST & path .~ services % i % "regenerate_key" | 476 | regenerateKey :: ServiceId -> Request Empty s Service
regenerateKey i = empty & meth .~ POST & path .~ services % i % "regenerate_key" | 134 | regenerateKey i = empty & meth .~ POST & path .~ services % i % "regenerate_key" | 80 | true | true | 0 | 10 | 67 | 57 | 32 | 25 | null | null |
myuon/OoP | src/Character.hs | mit | commandList :: Lens' Character CommandList
commandList = lens _commandList (\f x -> f { _commandList = x }) | 107 | commandList :: Lens' Character CommandList
commandList = lens _commandList (\f x -> f { _commandList = x }) | 107 | commandList = lens _commandList (\f x -> f { _commandList = x }) | 64 | false | true | 0 | 9 | 17 | 39 | 21 | 18 | null | null |
tfausak/exercism-solutions | haskell/bank-account/BankAccount.hs | mit | incrementBalance :: BankAccount -> Integer -> IO (Maybe Integer)
incrementBalance account amount = do
atomically $ modifyTVar (balance account) (fmap (+ amount))
getBalance account | 188 | incrementBalance :: BankAccount -> Integer -> IO (Maybe Integer)
incrementBalance account amount = do
atomically $ modifyTVar (balance account) (fmap (+ amount))
getBalance account | 188 | incrementBalance account amount = do
atomically $ modifyTVar (balance account) (fmap (+ amount))
getBalance account | 123 | false | true | 0 | 11 | 31 | 67 | 32 | 35 | null | null |
vinnymac/glot-www | Model/Language.hs | mit | languageAceMode Perl6 = "ace/mode/perl" | 39 | languageAceMode Perl6 = "ace/mode/perl" | 39 | languageAceMode Perl6 = "ace/mode/perl" | 39 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
AndreasVoellmy/openflow | src/Network/Data/OF13/Message.hs | bsd-3-clause | fieldCode (OXM { oxmOFField = VLANPCP _}) = 7 | 48 | fieldCode (OXM { oxmOFField = VLANPCP _}) = 7 | 48 | fieldCode (OXM { oxmOFField = VLANPCP _}) = 7 | 48 | false | false | 0 | 10 | 11 | 24 | 12 | 12 | null | null |
ben-schulz/Idris-dev | src/Idris/Elab/Quasiquote.hs | bsd-3-clause | extract2 :: Int -> (PTerm -> PTerm -> a) -> PTerm -> PTerm -> Elab' aux (a, [(Name, PTerm)])
extract2 n c a b = do (a', ex1) <- extractUnquotes n a
(b', ex2) <- extractUnquotes n b
return (c a' b', ex1 ++ ex2) | 253 | extract2 :: Int -> (PTerm -> PTerm -> a) -> PTerm -> PTerm -> Elab' aux (a, [(Name, PTerm)])
extract2 n c a b = do (a', ex1) <- extractUnquotes n a
(b', ex2) <- extractUnquotes n b
return (c a' b', ex1 ++ ex2) | 253 | extract2 n c a b = do (a', ex1) <- extractUnquotes n a
(b', ex2) <- extractUnquotes n b
return (c a' b', ex1 ++ ex2) | 160 | false | true | 0 | 12 | 88 | 124 | 64 | 60 | null | null |
haskell-distributed/distributed-process-platform | src/Control/Distributed/Process/Platform/Supervisor.hs | bsd-3-clause | -- | Delete a supervised child. The child must already be stopped (see
-- 'terminateChild').
--
deleteChild :: Addressable a => a -> ChildKey -> Process DeleteChildResult
deleteChild sid childKey = Unsafe.call sid $ DeleteChild childKey | 236 | deleteChild :: Addressable a => a -> ChildKey -> Process DeleteChildResult
deleteChild sid childKey = Unsafe.call sid $ DeleteChild childKey | 140 | deleteChild sid childKey = Unsafe.call sid $ DeleteChild childKey | 65 | true | true | 0 | 8 | 35 | 53 | 25 | 28 | null | null |
OS2World/DEV-UTIL-HUGS | libraries/Graphics/UI/GLUT/Callbacks/Window.hs | bsd-3-clause | --------------------------------------------------------------------------------
setKeyboardUpCallback :: Maybe KeyboardCallback -> IO ()
setKeyboardUpCallback =
setCallback KeyboardUpCB glutKeyboardUpFunc
(makeKeyboardCallback . unmarshal)
where unmarshal cb c x y = cb (chr (fromIntegral c))
(Position (fromIntegral x) (fromIntegral y)) | 393 | setKeyboardUpCallback :: Maybe KeyboardCallback -> IO ()
setKeyboardUpCallback =
setCallback KeyboardUpCB glutKeyboardUpFunc
(makeKeyboardCallback . unmarshal)
where unmarshal cb c x y = cb (chr (fromIntegral c))
(Position (fromIntegral x) (fromIntegral y)) | 311 | setKeyboardUpCallback =
setCallback KeyboardUpCB glutKeyboardUpFunc
(makeKeyboardCallback . unmarshal)
where unmarshal cb c x y = cb (chr (fromIntegral c))
(Position (fromIntegral x) (fromIntegral y)) | 254 | true | true | 0 | 9 | 86 | 91 | 45 | 46 | null | null |
brendanhay/gogol | gogol-youtube/gen/Network/Google/Resource/YouTube/LiveBroadcasts/Transition.hs | mpl-2.0 | -- | Broadcast to transition.
lbtId :: Lens' LiveBroadcastsTransition Text
lbtId = lens _lbtId (\ s a -> s{_lbtId = a}) | 119 | lbtId :: Lens' LiveBroadcastsTransition Text
lbtId = lens _lbtId (\ s a -> s{_lbtId = a}) | 89 | lbtId = lens _lbtId (\ s a -> s{_lbtId = a}) | 44 | true | true | 0 | 9 | 20 | 40 | 22 | 18 | null | null |
google/haskell-indexer | haskell-indexer-backend-ghc/src/Language/Haskell/Indexer/Backend/Ghc.hs | apache-2.0 | setIdSpan :: Maybe Span -> Decl -> Decl
setIdSpan s d = d { declIdentifierSpan = s } | 84 | setIdSpan :: Maybe Span -> Decl -> Decl
setIdSpan s d = d { declIdentifierSpan = s } | 84 | setIdSpan s d = d { declIdentifierSpan = s } | 44 | false | true | 0 | 6 | 17 | 35 | 18 | 17 | null | null |
ekmett/wxHaskell | wxcore/src/haskell/Graphics/UI/WXCore/WxcDefs.hs | lgpl-2.1 | -- Symbolic font sizes as defined in CSS specification.
-- enum wxFontSymbolicSize
wxFONTSIZE_XX_SMALL :: Int
wxFONTSIZE_XX_SMALL = -3 | 134 | wxFONTSIZE_XX_SMALL :: Int
wxFONTSIZE_XX_SMALL = -3 | 51 | wxFONTSIZE_XX_SMALL = -3 | 24 | true | true | 0 | 6 | 17 | 21 | 10 | 11 | null | null |
EEviston/distro_api | src/UseHaskellAPI.hs | bsd-3-clause | -- mongo 27051
dir1_replica_port2 = "8002" :: String | 52 | dir1_replica_port2 = "8002" :: String | 37 | dir1_replica_port2 = "8002" :: String | 37 | true | false | 0 | 4 | 7 | 10 | 6 | 4 | null | null |
worksap-ate/aws-sdk | test/RDSTests/DBSubnetGroupTests.hs | bsd-3-clause | createDeleteModifyDBSubnetGroupTest :: Spec
createDeleteModifyDBSubnetGroupTest = do
describe "{create,delete,modify}DBSubnetGroup doesn't fail" $ do
it "{create,delete,modify}DBSubnetGroup doesn't throw any exception" $ do
testRDS region (do
sgs <- describeDBSubnetGroups Nothing Nothing Nothing
createDBSubnetGroup name (subnets sgs) "test"
modifyDBSubnetGroup name (Just "test-modified") (subnets sgs)
deleteDBSubnetGroup name
) `miss` anyConnectionException
where
name = "hspec-test-subnet-group"
subnets = map subnetIdentifier . dbSubnets . head | 664 | createDeleteModifyDBSubnetGroupTest :: Spec
createDeleteModifyDBSubnetGroupTest = do
describe "{create,delete,modify}DBSubnetGroup doesn't fail" $ do
it "{create,delete,modify}DBSubnetGroup doesn't throw any exception" $ do
testRDS region (do
sgs <- describeDBSubnetGroups Nothing Nothing Nothing
createDBSubnetGroup name (subnets sgs) "test"
modifyDBSubnetGroup name (Just "test-modified") (subnets sgs)
deleteDBSubnetGroup name
) `miss` anyConnectionException
where
name = "hspec-test-subnet-group"
subnets = map subnetIdentifier . dbSubnets . head | 664 | createDeleteModifyDBSubnetGroupTest = do
describe "{create,delete,modify}DBSubnetGroup doesn't fail" $ do
it "{create,delete,modify}DBSubnetGroup doesn't throw any exception" $ do
testRDS region (do
sgs <- describeDBSubnetGroups Nothing Nothing Nothing
createDBSubnetGroup name (subnets sgs) "test"
modifyDBSubnetGroup name (Just "test-modified") (subnets sgs)
deleteDBSubnetGroup name
) `miss` anyConnectionException
where
name = "hspec-test-subnet-group"
subnets = map subnetIdentifier . dbSubnets . head | 620 | false | true | 0 | 20 | 170 | 133 | 60 | 73 | null | null |
ian-mi/haskell-riak-client | Network/Riak/MessageCode.hs | apache-2.0 | messageCode 14 = DeleteResponseCode | 35 | messageCode 14 = DeleteResponseCode | 35 | messageCode 14 = DeleteResponseCode | 35 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
hemslo/seven-in-seven | haskell/day2/day2.hs | mit | -- • Write a function that takes an argument x and returns a lazy sequence that has every third number, starting with x. Then, write a function that includes every fifth number, beginning with y. Combine these functions through composition to return every eighth number, beginning with x + y.
third x = [x, (x + 3) ..] | 320 | third x = [x, (x + 3) ..] | 25 | third x = [x, (x + 3) ..] | 25 | true | false | 0 | 7 | 59 | 24 | 14 | 10 | null | null |
vinit-ivar/apertium-gf | MorphDisambiguator.hs | gpl-2.0 | getWord _ ('/':xs) = ' ' : getWord False xs | 45 | getWord _ ('/':xs) = ' ' : getWord False xs | 45 | getWord _ ('/':xs) = ' ' : getWord False xs | 45 | false | false | 0 | 7 | 11 | 27 | 13 | 14 | null | null |
MateVM/harpy | Harpy/X86CodeGen.hs | gpl-2.0 | x86_test_membase_reg basereg disp reg =
do emit8 0x85 ; x86_membase_emit reg basereg disp | 93 | x86_test_membase_reg basereg disp reg =
do emit8 0x85 ; x86_membase_emit reg basereg disp | 93 | x86_test_membase_reg basereg disp reg =
do emit8 0x85 ; x86_membase_emit reg basereg disp | 93 | false | false | 0 | 7 | 16 | 30 | 13 | 17 | null | null |
yalpul/CENG242 | H99/61-69/p64.hs | gpl-3.0 | countN (Branch _ l r) = 1 + countN l + countN r | 47 | countN (Branch _ l r) = 1 + countN l + countN r | 47 | countN (Branch _ l r) = 1 + countN l + countN r | 47 | false | false | 0 | 7 | 12 | 33 | 15 | 18 | null | null |
pparkkin/eta | compiler/ETA/Prelude/TysWiredIn.hs | bsd-3-clause | {-
************************************************************************
* *
\subsection{Wired in type constructors}
* *
************************************************************************
If you change which things are wired in, make sure you change their
names in PrelNames, so they use wTcQual, wDataQual, etc
-}
-- This list is used only to define PrelInfo.wiredInThings. That in turn
-- is used to initialise the name environment carried around by the renamer.
-- This means that if we look up the name of a TyCon (or its implicit binders)
-- that occurs in this list that name will be assigned the wired-in key we
-- define here.
--
-- Because of their infinite nature, this list excludes tuples, Any and implicit
-- parameter TyCons. Instead, we have a hack in lookupOrigNameCache to deal with
-- these names.
--
-- See also Note [Known-key names]
wiredInTyCons :: [TyCon]
wiredInTyCons = [ unitTyCon -- Not treated like other tuples, because
-- it's defined in GHC.Base, and there's only
-- one of it. We put it in wiredInTyCons so
-- that it'll pre-populate the name cache, so
-- the special case in lookupOrigNameCache
-- doesn't need to look out for it
, boolTyCon
, charTyCon
, doubleTyCon
, floatTyCon
, intTyCon
, wordTyCon
, listTyCon
, maybeTyCon
, jstringTyCon
, parrTyCon
, eqTyCon
, coercibleTyCon
, typeNatKindCon
, typeSymbolKindCon
] | 1,879 | wiredInTyCons :: [TyCon]
wiredInTyCons = [ unitTyCon -- Not treated like other tuples, because
-- it's defined in GHC.Base, and there's only
-- one of it. We put it in wiredInTyCons so
-- that it'll pre-populate the name cache, so
-- the special case in lookupOrigNameCache
-- doesn't need to look out for it
, boolTyCon
, charTyCon
, doubleTyCon
, floatTyCon
, intTyCon
, wordTyCon
, listTyCon
, maybeTyCon
, jstringTyCon
, parrTyCon
, eqTyCon
, coercibleTyCon
, typeNatKindCon
, typeSymbolKindCon
] | 875 | wiredInTyCons = [ unitTyCon -- Not treated like other tuples, because
-- it's defined in GHC.Base, and there's only
-- one of it. We put it in wiredInTyCons so
-- that it'll pre-populate the name cache, so
-- the special case in lookupOrigNameCache
-- doesn't need to look out for it
, boolTyCon
, charTyCon
, doubleTyCon
, floatTyCon
, intTyCon
, wordTyCon
, listTyCon
, maybeTyCon
, jstringTyCon
, parrTyCon
, eqTyCon
, coercibleTyCon
, typeNatKindCon
, typeSymbolKindCon
] | 850 | true | true | 0 | 5 | 729 | 77 | 56 | 21 | null | null |
technogeeky/d-A | include/containers-0.5.0.0/Data/IntMap/Base.hs | gpl-3.0 | -- | /O(n)/. A strict version of 'foldrWithKey'. Each application of the operator is
-- evaluated before using the result in the next application. This
-- function is strict in the starting value.
foldrWithKey' :: (Int -> a -> b -> b) -> b -> IntMap a -> b
foldrWithKey' f z = \t -> -- Use lambda t to be inlinable with two arguments only.
case t of Bin _ m l r | m < 0 -> go (go z l) r -- put negative numbers before
| otherwise -> go (go z r) l
_ -> go z t
where
STRICT_1_OF_2(go)
go z' Nil = z'
go z' (Tip kx x) = f kx x z'
go z' (Bin _ _ l r) = go (go z' r) l
| 638 | foldrWithKey' :: (Int -> a -> b -> b) -> b -> IntMap a -> b
foldrWithKey' f z = \t -> -- Use lambda t to be inlinable with two arguments only.
case t of Bin _ m l r | m < 0 -> go (go z l) r -- put negative numbers before
| otherwise -> go (go z r) l
_ -> go z t
where
STRICT_1_OF_2(go)
go z' Nil = z'
go z' (Tip kx x) = f kx x z'
go z' (Bin _ _ l r) = go (go z' r) l
| 441 | foldrWithKey' f z = \t -> -- Use lambda t to be inlinable with two arguments only.
case t of Bin _ m l r | m < 0 -> go (go z l) r -- put negative numbers before
| otherwise -> go (go z r) l
_ -> go z t
where
STRICT_1_OF_2(go)
go z' Nil = z'
go z' (Tip kx x) = f kx x z'
go z' (Bin _ _ l r) = go (go z' r) l
| 381 | true | true | 0 | 12 | 206 | 213 | 104 | 109 | null | null |
shouya/projz | emulator/Processor.hs | bsd-2-clause | inst_jnz = cond_jmp_inst cond_nz | 32 | inst_jnz = cond_jmp_inst cond_nz | 32 | inst_jnz = cond_jmp_inst cond_nz | 32 | false | false | 1 | 5 | 3 | 13 | 4 | 9 | null | null |
dimara/ganeti | src/Ganeti/Constants.hs | bsd-2-clause | hvLxcDropCapabilities :: String
hvLxcDropCapabilities = "drop_capabilities" | 75 | hvLxcDropCapabilities :: String
hvLxcDropCapabilities = "drop_capabilities" | 75 | hvLxcDropCapabilities = "drop_capabilities" | 43 | false | true | 0 | 6 | 5 | 18 | 7 | 11 | null | null |
rueshyna/gogol | gogol-genomics/gen/Network/Google/Genomics/Types/Product.hs | mpl-2.0 | -- | The continuation token, which is used to page through large result sets.
-- To get the next page of results, set this parameter to the value of
-- \`nextPageToken\` from the previous response.
sarPageToken :: Lens' SearchAnnotationsRequest (Maybe Text)
sarPageToken
= lens _sarPageToken (\ s a -> s{_sarPageToken = a}) | 325 | sarPageToken :: Lens' SearchAnnotationsRequest (Maybe Text)
sarPageToken
= lens _sarPageToken (\ s a -> s{_sarPageToken = a}) | 127 | sarPageToken
= lens _sarPageToken (\ s a -> s{_sarPageToken = a}) | 67 | true | true | 0 | 9 | 53 | 50 | 27 | 23 | null | null |
graninas/Haskell-Algorithms | Tests/TransitionGraph/transition-graph/app/Main.hs | gpl-3.0 | travel2Graph :: AGGraph () ()
travel2Graph = graph $
with location2
<~> on "forward" travel3Graph
<~> on "list" (leaf list) | 133 | travel2Graph :: AGGraph () ()
travel2Graph = graph $
with location2
<~> on "forward" travel3Graph
<~> on "list" (leaf list) | 133 | travel2Graph = graph $
with location2
<~> on "forward" travel3Graph
<~> on "list" (leaf list) | 103 | false | true | 4 | 7 | 29 | 53 | 24 | 29 | null | null |
winterland1989/stdio | Data/Vector.hs | bsd-3-clause | compareBytes (PrimVector (PrimArray (ByteArray baA#)) sA lA)
(PrimVector (PrimArray (ByteArray baB#)) sB lB) =
let r = c_memcmp baA# (fromIntegral sA)
baB# (fromIntegral sB) (fromIntegral $ min lA lB)
in case r `compare` 0 of
EQ -> lA `compare` lB
x -> x
#if MIN_VERSION_base(4,9,0) | 343 | compareBytes (PrimVector (PrimArray (ByteArray baA#)) sA lA)
(PrimVector (PrimArray (ByteArray baB#)) sB lB) =
let r = c_memcmp baA# (fromIntegral sA)
baB# (fromIntegral sB) (fromIntegral $ min lA lB)
in case r `compare` 0 of
EQ -> lA `compare` lB
x -> x
#if MIN_VERSION_base(4,9,0) | 343 | compareBytes (PrimVector (PrimArray (ByteArray baA#)) sA lA)
(PrimVector (PrimArray (ByteArray baB#)) sB lB) =
let r = c_memcmp baA# (fromIntegral sA)
baB# (fromIntegral sB) (fromIntegral $ min lA lB)
in case r `compare` 0 of
EQ -> lA `compare` lB
x -> x
#if MIN_VERSION_base(4,9,0) | 343 | false | false | 0 | 12 | 105 | 130 | 66 | 64 | null | null |
ezyang/ghc | compiler/rename/RnUtils.hs | bsd-3-clause | {-
************************************************************************
* *
\subsection{Envt utility functions}
* *
************************************************************************
-}
warnUnusedTopBinds :: [GlobalRdrElt] -> RnM ()
warnUnusedTopBinds gres
= whenWOptM Opt_WarnUnusedTopBinds
$ do env <- getGblEnv
let isBoot = tcg_src env == HsBootFile
let noParent gre = case gre_par gre of
NoParent -> True
_ -> False
-- Don't warn about unused bindings with parents in
-- .hs-boot files, as you are sometimes required to give
-- unused bindings (trac #3449).
-- HOWEVER, in a signature file, you are never obligated to put a
-- definition in the main text. Thus, if you define something
-- and forget to export it, we really DO want to warn.
gres' = if isBoot then filter noParent gres
else gres
warnUnusedGREs gres' | 1,205 | warnUnusedTopBinds :: [GlobalRdrElt] -> RnM ()
warnUnusedTopBinds gres
= whenWOptM Opt_WarnUnusedTopBinds
$ do env <- getGblEnv
let isBoot = tcg_src env == HsBootFile
let noParent gre = case gre_par gre of
NoParent -> True
_ -> False
-- Don't warn about unused bindings with parents in
-- .hs-boot files, as you are sometimes required to give
-- unused bindings (trac #3449).
-- HOWEVER, in a signature file, you are never obligated to put a
-- definition in the main text. Thus, if you define something
-- and forget to export it, we really DO want to warn.
gres' = if isBoot then filter noParent gres
else gres
warnUnusedGREs gres' | 870 | warnUnusedTopBinds gres
= whenWOptM Opt_WarnUnusedTopBinds
$ do env <- getGblEnv
let isBoot = tcg_src env == HsBootFile
let noParent gre = case gre_par gre of
NoParent -> True
_ -> False
-- Don't warn about unused bindings with parents in
-- .hs-boot files, as you are sometimes required to give
-- unused bindings (trac #3449).
-- HOWEVER, in a signature file, you are never obligated to put a
-- definition in the main text. Thus, if you define something
-- and forget to export it, we really DO want to warn.
gres' = if isBoot then filter noParent gres
else gres
warnUnusedGREs gres' | 823 | true | true | 2 | 10 | 495 | 96 | 51 | 45 | null | null |
GaloisInc/halvm-ghc | compiler/main/TidyPgm.hs | bsd-3-clause | dffvExpr (Lam v e) = extendScope v (dffvExpr e) | 58 | dffvExpr (Lam v e) = extendScope v (dffvExpr e) | 58 | dffvExpr (Lam v e) = extendScope v (dffvExpr e) | 58 | false | false | 0 | 7 | 19 | 28 | 13 | 15 | null | null |
olsner/ghc | compiler/cmm/CLabel.hs | bsd-3-clause | pprCLbl (AsmTempLabel {}) = panic "pprCLbl AsmTempLabel" | 62 | pprCLbl (AsmTempLabel {}) = panic "pprCLbl AsmTempLabel" | 62 | pprCLbl (AsmTempLabel {}) = panic "pprCLbl AsmTempLabel" | 62 | false | false | 0 | 6 | 12 | 20 | 9 | 11 | null | null |
mmarx/jebediah | src/Jebediah/Counterpoint.hs | gpl-3.0 | outline' :: Note -> Note -> [Note]
outline' from to
| abs dist <= 1 = [from, to]
| otherwise = ladder from (1 - dist) ++ [to]
where dist = interval from to | 161 | outline' :: Note -> Note -> [Note]
outline' from to
| abs dist <= 1 = [from, to]
| otherwise = ladder from (1 - dist) ++ [to]
where dist = interval from to | 161 | outline' from to
| abs dist <= 1 = [from, to]
| otherwise = ladder from (1 - dist) ++ [to]
where dist = interval from to | 126 | false | true | 1 | 9 | 39 | 97 | 45 | 52 | null | null |
Macil-dev/verhface-ll | src/Bindings/Verba/ErrorCodes.hs | unlicense | verr 105 = VerbaError 105 "ERR_UZ" "Ошибка чтения UZ" | 67 | verr 105 = VerbaError 105 "ERR_UZ" "Ошибка чтения UZ" | 67 | verr 105 = VerbaError 105 "ERR_UZ" "Ошибка чтения UZ" | 67 | false | false | 1 | 5 | 22 | 19 | 7 | 12 | null | null |
dysinger/amazonka | amazonka-rds/gen/Network/AWS/RDS/Types.hs | mpl-2.0 | -- | The frequency of the recurring charge.
rcRecurringChargeFrequency :: Lens' RecurringCharge (Maybe Text)
rcRecurringChargeFrequency =
lens _rcRecurringChargeFrequency
(\s a -> s { _rcRecurringChargeFrequency = a }) | 230 | rcRecurringChargeFrequency :: Lens' RecurringCharge (Maybe Text)
rcRecurringChargeFrequency =
lens _rcRecurringChargeFrequency
(\s a -> s { _rcRecurringChargeFrequency = a }) | 186 | rcRecurringChargeFrequency =
lens _rcRecurringChargeFrequency
(\s a -> s { _rcRecurringChargeFrequency = a }) | 121 | true | true | 0 | 9 | 38 | 46 | 25 | 21 | null | null |
sakana/HaPy | example/haskell/ExampleModule.hs | mit | arr_ret :: Int -> [Int]
arr_ret i = [1..i] | 42 | arr_ret :: Int -> [Int]
arr_ret i = [1..i] | 42 | arr_ret i = [1..i] | 18 | false | true | 0 | 6 | 8 | 26 | 14 | 12 | null | null |
kumasento/accelerate | Data/Array/Accelerate/Analysis/Match.hs | bsd-3-clause | hashPrimFun (PrimMax _) = hash "PrimMax" | 56 | hashPrimFun (PrimMax _) = hash "PrimMax" | 56 | hashPrimFun (PrimMax _) = hash "PrimMax" | 56 | false | false | 0 | 7 | 21 | 18 | 8 | 10 | null | null |
tolysz/prepare-ghcjs | spec-lts8/ghc-boot/GHC/PackageDb.hs | bsd-3-clause | -- | Read the part of the package DB that GHC is interested in.
--
readPackageDbForGhc :: RepInstalledPackageInfo a b c d =>
FilePath -> IO [InstalledPackageInfo a b c d]
readPackageDbForGhc file =
decodeFromFile file getDbForGhc
where
getDbForGhc = do
_version <- getHeader
_ghcPartLen <- get :: Get Word32
ghcPart <- get
-- the next part is for ghc-pkg, but we stop here.
return ghcPart
-- | Read the part of the package DB that ghc-pkg is interested in
--
-- Note that the Binary instance for ghc-pkg's representation of packages
-- is not defined in this package. This is because ghc-pkg uses Cabal types
-- (and Binary instances for these) which this package does not depend on.
-- | 757 | readPackageDbForGhc :: RepInstalledPackageInfo a b c d =>
FilePath -> IO [InstalledPackageInfo a b c d]
readPackageDbForGhc file =
decodeFromFile file getDbForGhc
where
getDbForGhc = do
_version <- getHeader
_ghcPartLen <- get :: Get Word32
ghcPart <- get
-- the next part is for ghc-pkg, but we stop here.
return ghcPart
-- | Read the part of the package DB that ghc-pkg is interested in
--
-- Note that the Binary instance for ghc-pkg's representation of packages
-- is not defined in this package. This is because ghc-pkg uses Cabal types
-- (and Binary instances for these) which this package does not depend on.
-- | 690 | readPackageDbForGhc file =
decodeFromFile file getDbForGhc
where
getDbForGhc = do
_version <- getHeader
_ghcPartLen <- get :: Get Word32
ghcPart <- get
-- the next part is for ghc-pkg, but we stop here.
return ghcPart
-- | Read the part of the package DB that ghc-pkg is interested in
--
-- Note that the Binary instance for ghc-pkg's representation of packages
-- is not defined in this package. This is because ghc-pkg uses Cabal types
-- (and Binary instances for these) which this package does not depend on.
-- | 563 | true | true | 0 | 9 | 190 | 101 | 51 | 50 | null | null |
lambdageek/insomnia | src/Insomnia/Typecheck/Env.hs | bsd-3-clause | conInt :: TypeConstructor
conInt = builtinCon "Int" | 51 | conInt :: TypeConstructor
conInt = builtinCon "Int" | 51 | conInt = builtinCon "Int" | 25 | false | true | 0 | 6 | 6 | 21 | 8 | 13 | null | null |
kaisellgren/ankka | src/Util/Vector2.hs | mit | vneg :: Vector2 -> Vector2
vneg (Vector2 x y) = Vector2 (-x) (-y) | 65 | vneg :: Vector2 -> Vector2
vneg (Vector2 x y) = Vector2 (-x) (-y) | 65 | vneg (Vector2 x y) = Vector2 (-x) (-y) | 38 | false | true | 0 | 9 | 12 | 46 | 22 | 24 | null | null |
eddywestbrook/hobbits | archival/Term.hs | bsd-3-clause | -- TAPL small step cbv evaluator
eval1 :: Term a -> Maybe (Term a)
eval1 (Var _) = Nothing | 91 | eval1 :: Term a -> Maybe (Term a)
eval1 (Var _) = Nothing | 57 | eval1 (Var _) = Nothing | 23 | true | true | 0 | 9 | 19 | 42 | 19 | 23 | null | null |
tomwadeson/adventofcode | 07.hs | mit | parseOr :: ReadP Gate
parseOr = do
i1 <- parseInput
string " OR "
i2 <- parseInput
return $ Or i1 i2 | 108 | parseOr :: ReadP Gate
parseOr = do
i1 <- parseInput
string " OR "
i2 <- parseInput
return $ Or i1 i2 | 108 | parseOr = do
i1 <- parseInput
string " OR "
i2 <- parseInput
return $ Or i1 i2 | 86 | false | true | 0 | 9 | 29 | 52 | 21 | 31 | null | null |
ben-schulz/Idris-dev | src/Idris/Info.hs | bsd-3-clause | getIdrisFlagsLib :: IO [String]
getIdrisFlagsLib = S.getLibFlags | 64 | getIdrisFlagsLib :: IO [String]
getIdrisFlagsLib = S.getLibFlags | 64 | getIdrisFlagsLib = S.getLibFlags | 32 | false | true | 0 | 6 | 6 | 19 | 10 | 9 | null | null |
adarqui/Codex | src/Codex/Meetup/M1/Compression/Tournament.hs | bsd-3-clause | testor :: (B.ByteString, T.Tournament) -> IO ()
testor (bs, t) = do
maybe (print "no results") (mapM_ print) rs
where
ms = T.keys t
rs = T.results t | 154 | testor :: (B.ByteString, T.Tournament) -> IO ()
testor (bs, t) = do
maybe (print "no results") (mapM_ print) rs
where
ms = T.keys t
rs = T.results t | 154 | testor (bs, t) = do
maybe (print "no results") (mapM_ print) rs
where
ms = T.keys t
rs = T.results t | 106 | false | true | 0 | 9 | 33 | 84 | 42 | 42 | null | null |
conal/reify-core | src/ReifyCore/Lambda.hs | bsd-3-clause | eval' (Lam p e) env = \ x -> eval' e (extendEnv p x env) | 59 | eval' (Lam p e) env = \ x -> eval' e (extendEnv p x env) | 59 | eval' (Lam p e) env = \ x -> eval' e (extendEnv p x env) | 59 | false | false | 0 | 8 | 17 | 39 | 19 | 20 | null | null |
copton/hgdbmi | src/Gdbmi/Commands.hs | bsd-3-clause | replace :: Char -> String -> String -> String -- {{{2
replace old new = join new . split old
where
join delim l = concat (intersperse delim l)
split _ [] = []
split c str =
let (str', rest) = break (==c) str in
if null rest
then [str']
else str' : split c (tail rest) | 309 | replace :: Char -> String -> String -> String
replace old new = join new . split old
where
join delim l = concat (intersperse delim l)
split _ [] = []
split c str =
let (str', rest) = break (==c) str in
if null rest
then [str']
else str' : split c (tail rest) | 301 | replace old new = join new . split old
where
join delim l = concat (intersperse delim l)
split _ [] = []
split c str =
let (str', rest) = break (==c) str in
if null rest
then [str']
else str' : split c (tail rest) | 255 | true | true | 2 | 12 | 99 | 142 | 71 | 71 | null | null |
zmthy/mandelbrot | Main.hs | gpl-3.0 | ------------------------------------------------------------------------------
parMap :: NFData b => (a -> b) -> [a] -> [b]
parMap f = P.withStrategy (parBuffer 100 P.rdeepseq) . map f | 184 | parMap :: NFData b => (a -> b) -> [a] -> [b]
parMap f = P.withStrategy (parBuffer 100 P.rdeepseq) . map f | 105 | parMap f = P.withStrategy (parBuffer 100 P.rdeepseq) . map f | 60 | true | true | 0 | 9 | 22 | 65 | 33 | 32 | null | null |
Lyapunov/haskell-programming-from-first-principles | chapter_3/solution2.hs | mit | trans1 x = x ++ "!" | 19 | trans1 x = x ++ "!" | 19 | trans1 x = x ++ "!" | 19 | false | false | 0 | 5 | 5 | 13 | 6 | 7 | null | null |
bryant/punkt | lib/NLP/Punkt.hs | mit | ask_ortho :: Text -> Punkt OrthoFreq
ask_ortho w_ = return . Map.lookupDefault (OrthoFreq 0 0 0 0 0) (norm w_)
=<< fmap ortho_count Reader.ask | 157 | ask_ortho :: Text -> Punkt OrthoFreq
ask_ortho w_ = return . Map.lookupDefault (OrthoFreq 0 0 0 0 0) (norm w_)
=<< fmap ortho_count Reader.ask | 157 | ask_ortho w_ = return . Map.lookupDefault (OrthoFreq 0 0 0 0 0) (norm w_)
=<< fmap ortho_count Reader.ask | 120 | false | true | 0 | 9 | 38 | 63 | 30 | 33 | null | null |
TueHaulund/ROOPLC | src/CodeGenerator.hs | mit | cgStatement (Loop e1 s1 s2 e2) = cgLoop e1 s1 s2 e2 | 51 | cgStatement (Loop e1 s1 s2 e2) = cgLoop e1 s1 s2 e2 | 51 | cgStatement (Loop e1 s1 s2 e2) = cgLoop e1 s1 s2 e2 | 51 | false | false | 0 | 7 | 11 | 30 | 14 | 16 | null | null |
da-x/lamdu | bottlelib/Data/Store/Transaction.hs | gpl-3.0 | isEmpty :: Monad m => Transaction m Bool
isEmpty = liftChangesMap (State.gets Map.null) | 87 | isEmpty :: Monad m => Transaction m Bool
isEmpty = liftChangesMap (State.gets Map.null) | 87 | isEmpty = liftChangesMap (State.gets Map.null) | 46 | false | true | 0 | 8 | 12 | 41 | 18 | 23 | null | null |
mmarx/milkman | src/Milkman/Covers/Conceptual.hs | gpl-3.0 | -- |Check whether a given set of concepts covers a given set of crosses.
coversCrosses :: [Concept] -> [Cross] -> Bool
coversCrosses cs = all (\cr -> any (coversCross cr) cs) | 174 | coversCrosses :: [Concept] -> [Cross] -> Bool
coversCrosses cs = all (\cr -> any (coversCross cr) cs) | 101 | coversCrosses cs = all (\cr -> any (coversCross cr) cs) | 55 | true | true | 0 | 10 | 30 | 51 | 27 | 24 | null | null |
fmthoma/ghc | compiler/rename/RnTypes.hs | bsd-3-clause | --------------------------------------
mkConOpPatRn :: Located Name -> Fixity -> LPat Name -> LPat Name
-> RnM (Pat Name)
mkConOpPatRn op2 fix2 p1@(L loc (ConPatIn op1 (InfixCon p11 p12))) p2
= do { fix1 <- lookupFixityRn (unLoc op1)
; let (nofix_error, associate_right) = compareFixity fix1 fix2
; if nofix_error then do
{ precParseErr (unLoc op1,fix1) (unLoc op2,fix2)
; return (ConPatIn op2 (InfixCon p1 p2)) }
else if associate_right then do
{ new_p <- mkConOpPatRn op2 fix2 p12 p2
; return (ConPatIn op1 (InfixCon p11 (L loc new_p))) } -- XXX loc right?
else return (ConPatIn op2 (InfixCon p1 p2)) } | 723 | mkConOpPatRn :: Located Name -> Fixity -> LPat Name -> LPat Name
-> RnM (Pat Name)
mkConOpPatRn op2 fix2 p1@(L loc (ConPatIn op1 (InfixCon p11 p12))) p2
= do { fix1 <- lookupFixityRn (unLoc op1)
; let (nofix_error, associate_right) = compareFixity fix1 fix2
; if nofix_error then do
{ precParseErr (unLoc op1,fix1) (unLoc op2,fix2)
; return (ConPatIn op2 (InfixCon p1 p2)) }
else if associate_right then do
{ new_p <- mkConOpPatRn op2 fix2 p12 p2
; return (ConPatIn op1 (InfixCon p11 (L loc new_p))) } -- XXX loc right?
else return (ConPatIn op2 (InfixCon p1 p2)) } | 683 | mkConOpPatRn op2 fix2 p1@(L loc (ConPatIn op1 (InfixCon p11 p12))) p2
= do { fix1 <- lookupFixityRn (unLoc op1)
; let (nofix_error, associate_right) = compareFixity fix1 fix2
; if nofix_error then do
{ precParseErr (unLoc op1,fix1) (unLoc op2,fix2)
; return (ConPatIn op2 (InfixCon p1 p2)) }
else if associate_right then do
{ new_p <- mkConOpPatRn op2 fix2 p12 p2
; return (ConPatIn op1 (InfixCon p11 (L loc new_p))) } -- XXX loc right?
else return (ConPatIn op2 (InfixCon p1 p2)) } | 587 | true | true | 0 | 17 | 216 | 262 | 132 | 130 | null | null |
kemskems/cis194-spring13 | src/HW05/HW05Tests.hs | bsd-3-clause | ex03Tests :: [Test]
ex03Tests = [ Test "ExprT lit test" testLit
[ (5, Lit 5)
, (0, Lit 0)
]
, Test "ExprT add test" testAdd
[ (Lit 5, Lit 10, Add (Lit 5) (Lit 10))
, (Lit 0, Lit 0, Add (Lit 0) (Lit 0))
, (Lit 0, Lit 12, Add (Lit 0) (Lit 12))
]
, Test "ExprT mul test" testMul
[ (Lit 5, Lit 10, Mul (Lit 5) (Lit 10))
, (Add (Lit 2) (Lit 3), Lit 4, Mul (Add (Lit 2) (Lit 3)) (Lit 4))
]
] | 581 | ex03Tests :: [Test]
ex03Tests = [ Test "ExprT lit test" testLit
[ (5, Lit 5)
, (0, Lit 0)
]
, Test "ExprT add test" testAdd
[ (Lit 5, Lit 10, Add (Lit 5) (Lit 10))
, (Lit 0, Lit 0, Add (Lit 0) (Lit 0))
, (Lit 0, Lit 12, Add (Lit 0) (Lit 12))
]
, Test "ExprT mul test" testMul
[ (Lit 5, Lit 10, Mul (Lit 5) (Lit 10))
, (Add (Lit 2) (Lit 3), Lit 4, Mul (Add (Lit 2) (Lit 3)) (Lit 4))
]
] | 581 | ex03Tests = [ Test "ExprT lit test" testLit
[ (5, Lit 5)
, (0, Lit 0)
]
, Test "ExprT add test" testAdd
[ (Lit 5, Lit 10, Add (Lit 5) (Lit 10))
, (Lit 0, Lit 0, Add (Lit 0) (Lit 0))
, (Lit 0, Lit 12, Add (Lit 0) (Lit 12))
]
, Test "ExprT mul test" testMul
[ (Lit 5, Lit 10, Mul (Lit 5) (Lit 10))
, (Add (Lit 2) (Lit 3), Lit 4, Mul (Add (Lit 2) (Lit 3)) (Lit 4))
]
] | 561 | false | true | 0 | 13 | 286 | 271 | 141 | 130 | null | null |
sgillespie/ghc | compiler/typecheck/TcType.hs | bsd-3-clause | isIntTy = is_tc intTyConKey | 34 | isIntTy = is_tc intTyConKey | 34 | isIntTy = is_tc intTyConKey | 34 | false | false | 1 | 5 | 10 | 13 | 4 | 9 | null | null |
yshnb/haskell-tutorial | examples/functional_sum.hs | mit | myAvg x = Just (mySum x / fromIntegral (myLength x)) | 53 | myAvg x = Just (mySum x / fromIntegral (myLength x)) | 53 | myAvg x = Just (mySum x / fromIntegral (myLength x)) | 53 | false | false | 1 | 10 | 10 | 34 | 14 | 20 | null | null |
kowey/pandoc-old | src/Text/Pandoc/Writers/Man.hs | gpl-2.0 | notesToMan :: WriterOptions -> [[Block]] -> State WriterState Doc
notesToMan opts notes =
if null notes
then return empty
else mapM (\(num, note) -> noteToMan opts num note) (zip [1..] notes) >>=
return . (text ".SH NOTES" $$) . vcat | 256 | notesToMan :: WriterOptions -> [[Block]] -> State WriterState Doc
notesToMan opts notes =
if null notes
then return empty
else mapM (\(num, note) -> noteToMan opts num note) (zip [1..] notes) >>=
return . (text ".SH NOTES" $$) . vcat | 256 | notesToMan opts notes =
if null notes
then return empty
else mapM (\(num, note) -> noteToMan opts num note) (zip [1..] notes) >>=
return . (text ".SH NOTES" $$) . vcat | 190 | false | true | 0 | 12 | 62 | 105 | 55 | 50 | null | null |
pparkkin/eta | compiler/ETA/TypeCheck/TcGenDeriv.hs | bsd-3-clause | a_Expr, c_Expr, f_Expr, z_Expr, ltTag_Expr, eqTag_Expr, gtTag_Expr,
false_Expr, true_Expr, fmap_Expr, pure_Expr, mempty_Expr, foldMap_Expr, traverse_Expr :: LHsExpr RdrName
a_Expr = nlHsVar a_RDR | 208 | a_Expr, c_Expr, f_Expr, z_Expr, ltTag_Expr, eqTag_Expr, gtTag_Expr,
false_Expr, true_Expr, fmap_Expr, pure_Expr, mempty_Expr, foldMap_Expr, traverse_Expr :: LHsExpr RdrName
a_Expr = nlHsVar a_RDR | 208 | a_Expr = nlHsVar a_RDR | 31 | false | true | 2 | 5 | 33 | 47 | 34 | 13 | null | null |
ezrakilty/narc | Database/Narc/ExampleEmbedded.hs | bsd-2-clause | {- Dummies, not yet implemented as part of the actual language. -}
-- | Take the "first" @n@ elements resulting from @query@. TBD: implement!
takeNarc n query = query | 167 | takeNarc n query = query | 24 | takeNarc n query = query | 24 | true | false | 0 | 5 | 29 | 13 | 7 | 6 | null | null |
bobgru/tree-derivations | src/LSystem5.hs | mit | distribute (Node p ts) = map (p ++) (map rootLabel ts) | 54 | distribute (Node p ts) = map (p ++) (map rootLabel ts) | 54 | distribute (Node p ts) = map (p ++) (map rootLabel ts) | 54 | false | false | 0 | 7 | 10 | 34 | 17 | 17 | null | null |
janschulz/pandoc | src/Text/Pandoc/Readers/EPUB.hs | gpl-2.0 | renameMeta :: String -> String
renameMeta "creator" = "author" | 62 | renameMeta :: String -> String
renameMeta "creator" = "author" | 62 | renameMeta "creator" = "author" | 31 | false | true | 0 | 5 | 8 | 22 | 10 | 12 | null | null |
d0kt0r0/Tidal | src/Sound/Tidal/old/Scales.hs | gpl-3.0 | spanish :: Num a => [a]
spanish = [0,1,4,5,7,8,10] | 50 | spanish :: Num a => [a]
spanish = [0,1,4,5,7,8,10] | 50 | spanish = [0,1,4,5,7,8,10] | 26 | false | true | 0 | 6 | 8 | 42 | 25 | 17 | null | null |
badp/ganeti | src/Ganeti/HTools/Backend/Text.hs | gpl-2.0 | loadGroup [name, gid, apol, tags] = loadGroup [name, gid, apol, tags, ""] | 73 | loadGroup [name, gid, apol, tags] = loadGroup [name, gid, apol, tags, ""] | 73 | loadGroup [name, gid, apol, tags] = loadGroup [name, gid, apol, tags, ""] | 73 | false | false | 0 | 6 | 11 | 39 | 23 | 16 | null | null |
ghc-android/ghc | compiler/nativeGen/RegAlloc/Linear/X86_64/FreeRegs.hs | bsd-3-clause | llocateReg :: RealReg -> FreeRegs -> FreeRegs
allocateReg (RealRegSingle r) (FreeRegs f)
= FreeRegs (f .&. complement (1 `shiftL` r))
| 142 | allocateReg :: RealReg -> FreeRegs -> FreeRegs
allocateReg (RealRegSingle r) (FreeRegs f)
= FreeRegs (f .&. complement (1 `shiftL` r)) | 142 | allocateReg (RealRegSingle r) (FreeRegs f)
= FreeRegs (f .&. complement (1 `shiftL` r)) | 95 | false | true | 0 | 10 | 28 | 58 | 30 | 28 | null | null |
plow-technologies/persistent | persistent/Database/Persist/Sql/Class.hs | mit | to4 :: ((a,b),(c,d)) -> (a,b,c,d)
to4 ((a,b),(c,d)) = (a,b,c,d) | 63 | to4 :: ((a,b),(c,d)) -> (a,b,c,d)
to4 ((a,b),(c,d)) = (a,b,c,d) | 63 | to4 ((a,b),(c,d)) = (a,b,c,d) | 29 | false | true | 0 | 7 | 8 | 78 | 49 | 29 | null | null |
Cosocket-LLC/kahn | v2.0/src/KAHN/ProcessCommand.hs | bsd-3-clause | rdCmd :: String -> ICmd
rdCmd q = case reads q of
[(term,tail)] -> if all isSpace tail then term else ERROR q
[] -> ERROR q
_ -> ERROR q | 143 | rdCmd :: String -> ICmd
rdCmd q = case reads q of
[(term,tail)] -> if all isSpace tail then term else ERROR q
[] -> ERROR q
_ -> ERROR q | 143 | rdCmd q = case reads q of
[(term,tail)] -> if all isSpace tail then term else ERROR q
[] -> ERROR q
_ -> ERROR q | 119 | false | true | 0 | 9 | 37 | 81 | 39 | 42 | null | null |
creichert/persistent | persistent-template/Database/Persist/TH.hs | mit | instanceD :: Cxt -> Type -> [Dec] -> Dec
instanceD = InstanceD Nothing | 70 | instanceD :: Cxt -> Type -> [Dec] -> Dec
instanceD = InstanceD Nothing | 70 | instanceD = InstanceD Nothing | 29 | false | true | 0 | 8 | 12 | 29 | 15 | 14 | null | null |
olsner/ghc | compiler/main/TidyPgm.hs | bsd-3-clause | cafRefsV :: CafRefEnv -> Id -> Bool
cafRefsV (subst, _) id
| not (isLocalId id) = mayHaveCafRefs (idCafInfo id)
| Just id' <- lookupVarEnv subst id = mayHaveCafRefs (idCafInfo id')
| otherwise = False | 245 | cafRefsV :: CafRefEnv -> Id -> Bool
cafRefsV (subst, _) id
| not (isLocalId id) = mayHaveCafRefs (idCafInfo id)
| Just id' <- lookupVarEnv subst id = mayHaveCafRefs (idCafInfo id')
| otherwise = False | 245 | cafRefsV (subst, _) id
| not (isLocalId id) = mayHaveCafRefs (idCafInfo id)
| Just id' <- lookupVarEnv subst id = mayHaveCafRefs (idCafInfo id')
| otherwise = False | 209 | false | true | 1 | 10 | 78 | 99 | 45 | 54 | null | null |
ku-fpg/aframe-server | src/Text/AFrame/DSL.hs | bsd-3-clause | torus :: DSL a -> DSL a
torus = primitiveEntity "a-torus" | 57 | torus :: DSL a -> DSL a
torus = primitiveEntity "a-torus" | 57 | torus = primitiveEntity "a-torus" | 33 | false | true | 0 | 7 | 10 | 29 | 12 | 17 | null | null |
VinylRecords/Vinyl | Data/Vinyl/Core.hs | mit | rtraverse
:: Applicative h
=> (forall x. f x -> h (g x))
-> Rec f rs
-> h (Rec g rs)
rtraverse _ RNil = pure RNil | 126 | rtraverse
:: Applicative h
=> (forall x. f x -> h (g x))
-> Rec f rs
-> h (Rec g rs)
rtraverse _ RNil = pure RNil | 126 | rtraverse _ RNil = pure RNil | 33 | false | true | 0 | 13 | 40 | 78 | 36 | 42 | null | null |
ducis/haAni | hs/common/Graphics/Rendering/OpenGL/GLU/ErrorsInternal.hs | gpl-2.0 | --------------------------------------------------------------------------------
-- The returned error string is statically allocated, so peekCString
-- does the right thing here. No malloc/free necessary here.
makeError :: GLenum -> IO Error
makeError e = do
let category = unmarshalErrorCategory e
ptr <- gluErrorString e
description <- peekCString (castPtr ptr)
return $ Error category description
--------------------------------------------------------------------------------
-- This seems to be a common Haskell hack nowadays: A plain old global variable
-- with an associated getter and mutator. Perhaps some language/library support
-- is needed?
| 673 | makeError :: GLenum -> IO Error
makeError e = do
let category = unmarshalErrorCategory e
ptr <- gluErrorString e
description <- peekCString (castPtr ptr)
return $ Error category description
--------------------------------------------------------------------------------
-- This seems to be a common Haskell hack nowadays: A plain old global variable
-- with an associated getter and mutator. Perhaps some language/library support
-- is needed?
| 460 | makeError e = do
let category = unmarshalErrorCategory e
ptr <- gluErrorString e
description <- peekCString (castPtr ptr)
return $ Error category description
--------------------------------------------------------------------------------
-- This seems to be a common Haskell hack nowadays: A plain old global variable
-- with an associated getter and mutator. Perhaps some language/library support
-- is needed?
| 428 | true | true | 0 | 10 | 97 | 78 | 38 | 40 | null | null |
fmthoma/ghc | compiler/types/Type.hs | bsd-3-clause | getEqPredTys_maybe :: PredType -> Maybe (Role, Type, Type)
getEqPredTys_maybe ty
= case splitTyConApp_maybe ty of
Just (tc, [_, ty1, ty2])
| tc `hasKey` eqTyConKey -> Just (Nominal, ty1, ty2)
| tc `hasKey` coercibleTyConKey -> Just (Representational, ty1, ty2)
_ -> Nothing | 303 | getEqPredTys_maybe :: PredType -> Maybe (Role, Type, Type)
getEqPredTys_maybe ty
= case splitTyConApp_maybe ty of
Just (tc, [_, ty1, ty2])
| tc `hasKey` eqTyConKey -> Just (Nominal, ty1, ty2)
| tc `hasKey` coercibleTyConKey -> Just (Representational, ty1, ty2)
_ -> Nothing | 303 | getEqPredTys_maybe ty
= case splitTyConApp_maybe ty of
Just (tc, [_, ty1, ty2])
| tc `hasKey` eqTyConKey -> Just (Nominal, ty1, ty2)
| tc `hasKey` coercibleTyConKey -> Just (Representational, ty1, ty2)
_ -> Nothing | 244 | false | true | 0 | 11 | 70 | 118 | 64 | 54 | null | null |
trskop/freer-extra | src/Control/Monad/Freer/Exception/Extra.hs | bsd-3-clause | evalError :: (e -> Eff effs a) -> Eff (Exc e ': effs) a -> Eff effs a
evalError h = handleRelay pure $ \(Exc e) _k -> h e | 121 | evalError :: (e -> Eff effs a) -> Eff (Exc e ': effs) a -> Eff effs a
evalError h = handleRelay pure $ \(Exc e) _k -> h e | 121 | evalError h = handleRelay pure $ \(Exc e) _k -> h e | 51 | false | true | 0 | 11 | 29 | 83 | 39 | 44 | null | null |
fmapfmapfmap/amazonka | amazonka-opsworks/gen/Network/AWS/OpsWorks/UpdateLayer.hs | mpl-2.0 | -- | Whether to install operating system and package updates when the
-- instance boots. The default value is 'true'. To control when updates are
-- installed, set this value to 'false'. You must then update your
-- instances manually by using CreateDeployment to run the
-- 'update_dependencies' stack command or manually running 'yum' (Amazon
-- Linux) or 'apt-get' (Ubuntu) on the instances.
--
-- We strongly recommend using the default value of 'true', to ensure that
-- your instances have the latest security updates.
ulInstallUpdatesOnBoot :: Lens' UpdateLayer (Maybe Bool)
ulInstallUpdatesOnBoot = lens _ulInstallUpdatesOnBoot (\ s a -> s{_ulInstallUpdatesOnBoot = a}) | 677 | ulInstallUpdatesOnBoot :: Lens' UpdateLayer (Maybe Bool)
ulInstallUpdatesOnBoot = lens _ulInstallUpdatesOnBoot (\ s a -> s{_ulInstallUpdatesOnBoot = a}) | 152 | ulInstallUpdatesOnBoot = lens _ulInstallUpdatesOnBoot (\ s a -> s{_ulInstallUpdatesOnBoot = a}) | 95 | true | true | 0 | 9 | 101 | 54 | 33 | 21 | null | null |
urbanslug/ghc | compiler/deSugar/Coverage.hs | bsd-3-clause | addTickHsIPBinds :: HsIPBinds Id -> TM (HsIPBinds Id)
addTickHsIPBinds (IPBinds ipbinds dictbinds) =
liftM2 IPBinds
(mapM (liftL (addTickIPBind)) ipbinds)
(return dictbinds) | 213 | addTickHsIPBinds :: HsIPBinds Id -> TM (HsIPBinds Id)
addTickHsIPBinds (IPBinds ipbinds dictbinds) =
liftM2 IPBinds
(mapM (liftL (addTickIPBind)) ipbinds)
(return dictbinds) | 213 | addTickHsIPBinds (IPBinds ipbinds dictbinds) =
liftM2 IPBinds
(mapM (liftL (addTickIPBind)) ipbinds)
(return dictbinds) | 159 | false | true | 0 | 10 | 60 | 68 | 33 | 35 | null | null |
danr/hipspec | src/HipSpec/Pretty.hs | gpl-3.0 | showBody :: S.Body Id -> String
showBody = render . R.ppExpr 0 Don'tShow docId . S.injectBody | 93 | showBody :: S.Body Id -> String
showBody = render . R.ppExpr 0 Don'tShow docId . S.injectBody | 93 | showBody = render . R.ppExpr 0 Don'tShow docId . S.injectBody | 61 | false | true | 1 | 8 | 15 | 47 | 20 | 27 | null | null |
tjakway/ghcjvm | compiler/cmm/CmmMachOp.hs | bsd-3-clause | mo_WordTo64 dflags = MO_UU_Conv (wordWidth dflags) W64 | 58 | mo_WordTo64 dflags = MO_UU_Conv (wordWidth dflags) W64 | 58 | mo_WordTo64 dflags = MO_UU_Conv (wordWidth dflags) W64 | 58 | false | false | 0 | 7 | 10 | 20 | 9 | 11 | null | null |
kmate/HaRe | old/testing/asPatterns/A7.hs | bsd-3-clause | f :: String -> String
f newPat_2@((x : xs)) = newPat_2 | 54 | f :: String -> String
f newPat_2@((x : xs)) = newPat_2 | 54 | f newPat_2@((x : xs)) = newPat_2 | 32 | false | true | 2 | 8 | 10 | 37 | 18 | 19 | null | null |
cryptica/slapnet | src/Printer/SPEC.hs | gpl-3.0 | renderProperty :: Property -> Builder
renderProperty (Property _ (Safety f)) = renderFormula f | 94 | renderProperty :: Property -> Builder
renderProperty (Property _ (Safety f)) = renderFormula f | 94 | renderProperty (Property _ (Safety f)) = renderFormula f | 56 | false | true | 0 | 9 | 12 | 35 | 17 | 18 | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.