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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
alekar/hugs | packages/base/Data/Set.hs | bsd-3-clause | deleteMin Tip = Tip | 31 | deleteMin Tip = Tip | 31 | deleteMin Tip = Tip | 31 | false | false | 0 | 5 | 15 | 9 | 4 | 5 | null | null |
conal/lambda-ccc | src/LambdaCCC/Unused/ToCircuit.hs | bsd-3-clause | cccToCircuit Exr = exr | 34 | cccToCircuit Exr = exr | 34 | cccToCircuit Exr = exr | 34 | false | false | 0 | 5 | 15 | 9 | 4 | 5 | null | null |
mettekou/ghc | compiler/simplCore/OccurAnal.hs | bsd-3-clause | -----------------
occAnalNonRecBind :: OccEnv -> ImpRuleEdges -> Var -> CoreExpr
-> UsageDetails -> (UsageDetails, [CoreBind])
occAnalNonRecBind env imp_rule_edges binder rhs body_usage
| isTyVar binder -- A type let; we don't gather usage info
= (body_usage, [NonRec binder rhs])
| not (binder `usedIn` body_usage) -- It's not mentioned
= (body_usage, [])
| otherwise -- It's mentioned in the body
= (body_usage' +++ rhs_usage4, [NonRec tagged_binder rhs'])
where
(body_usage', tagged_binder) = tagBinder body_usage binder
(rhs_usage1, rhs') = occAnalNonRecRhs env tagged_binder rhs
rhs_usage2 = addIdOccs rhs_usage1 (idUnfoldingVars binder)
rhs_usage3 = addIdOccs rhs_usage2 (idRuleVars binder)
-- See Note [Rules are extra RHSs] and Note [Rule dependency info]
rhs_usage4 = maybe rhs_usage3 (addIdOccs rhs_usage3) $
lookupVarEnv imp_rule_edges binder
-- See Note [Preventing loops due to imported functions rules]
----------------- | 1,058 | occAnalNonRecBind :: OccEnv -> ImpRuleEdges -> Var -> CoreExpr
-> UsageDetails -> (UsageDetails, [CoreBind])
occAnalNonRecBind env imp_rule_edges binder rhs body_usage
| isTyVar binder -- A type let; we don't gather usage info
= (body_usage, [NonRec binder rhs])
| not (binder `usedIn` body_usage) -- It's not mentioned
= (body_usage, [])
| otherwise -- It's mentioned in the body
= (body_usage' +++ rhs_usage4, [NonRec tagged_binder rhs'])
where
(body_usage', tagged_binder) = tagBinder body_usage binder
(rhs_usage1, rhs') = occAnalNonRecRhs env tagged_binder rhs
rhs_usage2 = addIdOccs rhs_usage1 (idUnfoldingVars binder)
rhs_usage3 = addIdOccs rhs_usage2 (idRuleVars binder)
-- See Note [Rules are extra RHSs] and Note [Rule dependency info]
rhs_usage4 = maybe rhs_usage3 (addIdOccs rhs_usage3) $
lookupVarEnv imp_rule_edges binder
-- See Note [Preventing loops due to imported functions rules]
----------------- | 1,040 | occAnalNonRecBind env imp_rule_edges binder rhs body_usage
| isTyVar binder -- A type let; we don't gather usage info
= (body_usage, [NonRec binder rhs])
| not (binder `usedIn` body_usage) -- It's not mentioned
= (body_usage, [])
| otherwise -- It's mentioned in the body
= (body_usage' +++ rhs_usage4, [NonRec tagged_binder rhs'])
where
(body_usage', tagged_binder) = tagBinder body_usage binder
(rhs_usage1, rhs') = occAnalNonRecRhs env tagged_binder rhs
rhs_usage2 = addIdOccs rhs_usage1 (idUnfoldingVars binder)
rhs_usage3 = addIdOccs rhs_usage2 (idRuleVars binder)
-- See Note [Rules are extra RHSs] and Note [Rule dependency info]
rhs_usage4 = maybe rhs_usage3 (addIdOccs rhs_usage3) $
lookupVarEnv imp_rule_edges binder
-- See Note [Preventing loops due to imported functions rules]
----------------- | 913 | true | true | 0 | 11 | 247 | 237 | 125 | 112 | null | null |
eklavya/Idris-dev | src/Idris/Delaborate.hs | bsd-3-clause | pprintErr' i (NotInjective p x y) =
text "Can't verify injectivity of" <+> annTm p (pprintTerm i (delabSugared i p)) <+>
text " when unifying" <+> annTm x (pprintTerm i (delabSugared i x)) <+> text "and" <+>
annTm y (pprintTerm i (delabSugared i y)) | 255 | pprintErr' i (NotInjective p x y) =
text "Can't verify injectivity of" <+> annTm p (pprintTerm i (delabSugared i p)) <+>
text " when unifying" <+> annTm x (pprintTerm i (delabSugared i x)) <+> text "and" <+>
annTm y (pprintTerm i (delabSugared i y)) | 255 | pprintErr' i (NotInjective p x y) =
text "Can't verify injectivity of" <+> annTm p (pprintTerm i (delabSugared i p)) <+>
text " when unifying" <+> annTm x (pprintTerm i (delabSugared i x)) <+> text "and" <+>
annTm y (pprintTerm i (delabSugared i y)) | 255 | false | false | 0 | 14 | 49 | 113 | 53 | 60 | null | null |
josuf107/Adverb | Adverb/Common.hs | gpl-3.0 | epithetically = id | 18 | epithetically = id | 18 | epithetically = id | 18 | false | false | 0 | 4 | 2 | 6 | 3 | 3 | null | null |
futtetennista/IntroductionToFunctionalProgramming | itfp/src/Chapter7.hs | mit | leastfreq :: Strategy
leastfreq ms =
"Paper" : map raremove freqs
where
freqs =
tail (scanl count (0, 0, 0) ms)
raremove (r, p, s)
| minfreq == r =
"Rock"
| minfreq == p =
"Paper"
| minfreq == s =
"Scissors"
where
minfreq =
minimum [r, p, s] | 326 | leastfreq :: Strategy
leastfreq ms =
"Paper" : map raremove freqs
where
freqs =
tail (scanl count (0, 0, 0) ms)
raremove (r, p, s)
| minfreq == r =
"Rock"
| minfreq == p =
"Paper"
| minfreq == s =
"Scissors"
where
minfreq =
minimum [r, p, s] | 326 | leastfreq ms =
"Paper" : map raremove freqs
where
freqs =
tail (scanl count (0, 0, 0) ms)
raremove (r, p, s)
| minfreq == r =
"Rock"
| minfreq == p =
"Paper"
| minfreq == s =
"Scissors"
where
minfreq =
minimum [r, p, s] | 304 | false | true | 4 | 8 | 134 | 144 | 67 | 77 | null | null |
sol/data-default | t/basics.hs | bsd-3-clause | runTest :: (MonadIO m) => Test a -> m a
runTest t = liftIO $ do
hSetBuffering stdout LineBuffering
r <- newIORef 1
runReaderT (unTest t) r | 150 | runTest :: (MonadIO m) => Test a -> m a
runTest t = liftIO $ do
hSetBuffering stdout LineBuffering
r <- newIORef 1
runReaderT (unTest t) r | 150 | runTest t = liftIO $ do
hSetBuffering stdout LineBuffering
r <- newIORef 1
runReaderT (unTest t) r | 110 | false | true | 2 | 10 | 38 | 75 | 32 | 43 | null | null |
sboosali/commands | commands-core/sources/Data/GUI.hs | mit | {-|
>>> showGUI (GUI (Package "package") (Module "Module.SubModule") (Identifier "identifier"))
"package-Module.SubModule.identifier"
-}
showGUI :: GUI -> String
showGUI (GUI (Package pkg) (Module mod) (Identifier occ)) = pkg ++ "-" ++ mod ++ "." ++ occ | 255 | showGUI :: GUI -> String
showGUI (GUI (Package pkg) (Module mod) (Identifier occ)) = pkg ++ "-" ++ mod ++ "." ++ occ | 116 | showGUI (GUI (Package pkg) (Module mod) (Identifier occ)) = pkg ++ "-" ++ mod ++ "." ++ occ | 91 | true | true | 0 | 9 | 36 | 63 | 32 | 31 | null | null |
dmatveev/oak | Graphics/UI/Oak/Widgets.hs | bsd-3-clause | dialog :: Identifier i
=> String
-> [(i, Widget i m)]
-> (i, Widget i m)
-> Widget i m
dialog title buttons contents =
margin 20 (unused,
vbox [ (unused, header title)
, (unused, margin 10 contents)
, (unused, hbox $ buttons ++ [(unused, Stretch)])
]
) | 373 | dialog :: Identifier i
=> String
-> [(i, Widget i m)]
-> (i, Widget i m)
-> Widget i m
dialog title buttons contents =
margin 20 (unused,
vbox [ (unused, header title)
, (unused, margin 10 contents)
, (unused, hbox $ buttons ++ [(unused, Stretch)])
]
) | 373 | dialog title buttons contents =
margin 20 (unused,
vbox [ (unused, header title)
, (unused, margin 10 contents)
, (unused, hbox $ buttons ++ [(unused, Stretch)])
]
) | 246 | false | true | 0 | 12 | 168 | 139 | 73 | 66 | null | null |
pparkkin/eta | compiler/ETA/Main/DriverPhases.hs | bsd-3-clause | javaish_suffixes = [ "java" ] ++ javaclassish_suffixes | 66 | javaish_suffixes = [ "java" ] ++ javaclassish_suffixes | 66 | javaish_suffixes = [ "java" ] ++ javaclassish_suffixes | 66 | false | false | 0 | 6 | 18 | 13 | 7 | 6 | null | null |
mrakgr/futhark | src/Futhark/Analysis/SymbolTable.hs | bsd-3-clause | setBindingDepth d (LParam entry) =
LParam $ entry { lparamBindingDepth = d } | 78 | setBindingDepth d (LParam entry) =
LParam $ entry { lparamBindingDepth = d } | 78 | setBindingDepth d (LParam entry) =
LParam $ entry { lparamBindingDepth = d } | 78 | false | false | 0 | 7 | 14 | 29 | 15 | 14 | null | null |
Chobbes/Juicy.Pixels | src/Codec/Picture/Saving.hs | bsd-3-clause | toStandardDef :: Image PixelRGBF -> Image PixelRGB8
toStandardDef = pixelMap pixelConverter
where pixelConverter (PixelRGBF rf gf bf) = PixelRGB8 r g b
where r = componentToLDR rf
g = componentToLDR gf
b = componentToLDR bf | 267 | toStandardDef :: Image PixelRGBF -> Image PixelRGB8
toStandardDef = pixelMap pixelConverter
where pixelConverter (PixelRGBF rf gf bf) = PixelRGB8 r g b
where r = componentToLDR rf
g = componentToLDR gf
b = componentToLDR bf | 267 | toStandardDef = pixelMap pixelConverter
where pixelConverter (PixelRGBF rf gf bf) = PixelRGB8 r g b
where r = componentToLDR rf
g = componentToLDR gf
b = componentToLDR bf | 215 | false | true | 0 | 7 | 78 | 77 | 37 | 40 | null | null |
anton-k/sharc-timbre | src/Sharc/Instruments/Violin.hs | bsd-3-clause | note21 :: Note
note21 = Note
(Pitch 659.255 64 "e5")
22
(Range
(NoteRange
(NoteRangeAmplitude 9888.82 15 26.53)
(NoteRangeHarmonicFreq 1 659.25))
(NoteRange
(NoteRangeAmplitude 659.25 1 2413.0)
(NoteRangeHarmonicFreq 15 9888.82)))
[Harmonic 1 1.226 2413.0
,Harmonic 2 2.298 1560.12
,Harmonic 3 0.531 1554.61
,Harmonic 4 1.661 463.45
,Harmonic 5 2.865 296.24
,Harmonic 6 (-2.171) 290.69
,Harmonic 7 2.305 118.39
,Harmonic 8 (-3.089) 207.22
,Harmonic 9 0.739 31.65
,Harmonic 10 0.427 157.15
,Harmonic 11 (-0.272) 65.09
,Harmonic 12 (-2.389) 88.39
,Harmonic 13 (-1.933) 29.45
,Harmonic 14 (-0.784) 65.68
,Harmonic 15 0.486 26.53] | 762 | note21 :: Note
note21 = Note
(Pitch 659.255 64 "e5")
22
(Range
(NoteRange
(NoteRangeAmplitude 9888.82 15 26.53)
(NoteRangeHarmonicFreq 1 659.25))
(NoteRange
(NoteRangeAmplitude 659.25 1 2413.0)
(NoteRangeHarmonicFreq 15 9888.82)))
[Harmonic 1 1.226 2413.0
,Harmonic 2 2.298 1560.12
,Harmonic 3 0.531 1554.61
,Harmonic 4 1.661 463.45
,Harmonic 5 2.865 296.24
,Harmonic 6 (-2.171) 290.69
,Harmonic 7 2.305 118.39
,Harmonic 8 (-3.089) 207.22
,Harmonic 9 0.739 31.65
,Harmonic 10 0.427 157.15
,Harmonic 11 (-0.272) 65.09
,Harmonic 12 (-2.389) 88.39
,Harmonic 13 (-1.933) 29.45
,Harmonic 14 (-0.784) 65.68
,Harmonic 15 0.486 26.53] | 762 | note21 = Note
(Pitch 659.255 64 "e5")
22
(Range
(NoteRange
(NoteRangeAmplitude 9888.82 15 26.53)
(NoteRangeHarmonicFreq 1 659.25))
(NoteRange
(NoteRangeAmplitude 659.25 1 2413.0)
(NoteRangeHarmonicFreq 15 9888.82)))
[Harmonic 1 1.226 2413.0
,Harmonic 2 2.298 1560.12
,Harmonic 3 0.531 1554.61
,Harmonic 4 1.661 463.45
,Harmonic 5 2.865 296.24
,Harmonic 6 (-2.171) 290.69
,Harmonic 7 2.305 118.39
,Harmonic 8 (-3.089) 207.22
,Harmonic 9 0.739 31.65
,Harmonic 10 0.427 157.15
,Harmonic 11 (-0.272) 65.09
,Harmonic 12 (-2.389) 88.39
,Harmonic 13 (-1.933) 29.45
,Harmonic 14 (-0.784) 65.68
,Harmonic 15 0.486 26.53] | 747 | false | true | 0 | 10 | 223 | 279 | 139 | 140 | null | null |
pdownen/sequent-core | src/Language/SequentCore/Syntax.hs | bsd-3-clause | frameCheap :: HasId b => Frame b -> Bool
frameCheap (App arg) = isTyCoArg arg | 77 | frameCheap :: HasId b => Frame b -> Bool
frameCheap (App arg) = isTyCoArg arg | 77 | frameCheap (App arg) = isTyCoArg arg | 36 | false | true | 0 | 7 | 14 | 37 | 17 | 20 | null | null |
DavidAlphaFox/darcs | src/Darcs/UI/SelectChanges.hs | gpl-2.0 | -- | Shows the patch that is actually being selected the way the user
-- should see it.
repr :: (Patchy p) => WhichChanges -> Sealed2 p -> Sealed2 p
repr First (Sealed2 p) = Sealed2 p | 183 | repr :: (Patchy p) => WhichChanges -> Sealed2 p -> Sealed2 p
repr First (Sealed2 p) = Sealed2 p | 95 | repr First (Sealed2 p) = Sealed2 p | 34 | true | true | 0 | 8 | 36 | 50 | 25 | 25 | null | null |
kejace/ethereum-client-haskell | src/Blockchain/Data/Wire.hs | bsd-3-clause | numberToTerminationReason 0x0a = ConnectedToSelf | 48 | numberToTerminationReason 0x0a = ConnectedToSelf | 48 | numberToTerminationReason 0x0a = ConnectedToSelf | 48 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
rahulmutt/codec-jvm | src/Codec/JVM/Opcode.hs | apache-2.0 | dcmpg = Opcode 0x98 | 19 | dcmpg = Opcode 0x98 | 19 | dcmpg = Opcode 0x98 | 19 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
joachifm/hsmtp | src/MTP.hs | lgpl-2.1 | -- | Get the device serial number.
getSerialNumber :: MTPHandle -> IO String
getSerialNumber h = withMTPHandle h $ \devptr ->
peekCString =<< c_get_serialnumber devptr | 169 | getSerialNumber :: MTPHandle -> IO String
getSerialNumber h = withMTPHandle h $ \devptr ->
peekCString =<< c_get_serialnumber devptr | 134 | getSerialNumber h = withMTPHandle h $ \devptr ->
peekCString =<< c_get_serialnumber devptr | 92 | true | true | 1 | 7 | 26 | 46 | 21 | 25 | null | null |
kovach/web | res2/Syntax.hs | gpl-2.0 | tokenize "!" = Just $ Modifier' Unique | 38 | tokenize "!" = Just $ Modifier' Unique | 38 | tokenize "!" = Just $ Modifier' Unique | 38 | false | false | 0 | 6 | 6 | 16 | 7 | 9 | null | null |
rahulmutt/ghcvm | compiler/Eta/Prelude/PrimOp.hs | bsd-3-clause | tagOf_PrimOp Word64SllOp = _ILIT(1069) | 38 | tagOf_PrimOp Word64SllOp = _ILIT(1069) | 38 | tagOf_PrimOp Word64SllOp = _ILIT(1069) | 38 | false | false | 0 | 6 | 3 | 15 | 7 | 8 | null | null |
keithodulaigh/Hets | OWL2/StaticAnalysis.hs | gpl-2.0 | -- | Error messages for static analysis
failMsg :: Entity -> ClassExpression -> Result a
failMsg (Entity _ ty e) desc =
fatal_error
("undeclared `" ++ showEntityType ty
++ " " ++ showQN e ++ "` in the following ClassExpression:\n"
++ showDoc desc "") $ iriPos e | 287 | failMsg :: Entity -> ClassExpression -> Result a
failMsg (Entity _ ty e) desc =
fatal_error
("undeclared `" ++ showEntityType ty
++ " " ++ showQN e ++ "` in the following ClassExpression:\n"
++ showDoc desc "") $ iriPos e | 247 | failMsg (Entity _ ty e) desc =
fatal_error
("undeclared `" ++ showEntityType ty
++ " " ++ showQN e ++ "` in the following ClassExpression:\n"
++ showDoc desc "") $ iriPos e | 198 | true | true | 0 | 12 | 72 | 86 | 40 | 46 | null | null |
kim/amazonka | amazonka-opsworks/gen/Network/AWS/OpsWorks/CreateLayer.hs | mpl-2.0 | -- | An array of 'Package' objects that describe the layer packages.
clPackages :: Lens' CreateLayer [Text]
clPackages = lens _clPackages (\s a -> s { _clPackages = a }) . _List | 177 | clPackages :: Lens' CreateLayer [Text]
clPackages = lens _clPackages (\s a -> s { _clPackages = a }) . _List | 108 | clPackages = lens _clPackages (\s a -> s { _clPackages = a }) . _List | 69 | true | true | 0 | 10 | 31 | 47 | 26 | 21 | null | null |
nevvi/Declarative-D7012E | lab2/TestStatement.hs | gpl-3.0 | p3 = fromString "write count+1;" | 32 | p3 = fromString "write count+1;" | 32 | p3 = fromString "write count+1;" | 32 | false | false | 0 | 5 | 4 | 9 | 4 | 5 | null | null |
brendanhay/gogol | gogol-containerbuilder/gen/Network/Google/Resource/Cloudbuild/Projects/Triggers/Run.hs | mpl-2.0 | -- | Required. ID of the trigger.
ptrTriggerId :: Lens' ProjectsTriggersRun Text
ptrTriggerId
= lens _ptrTriggerId (\ s a -> s{_ptrTriggerId = a}) | 148 | ptrTriggerId :: Lens' ProjectsTriggersRun Text
ptrTriggerId
= lens _ptrTriggerId (\ s a -> s{_ptrTriggerId = a}) | 114 | ptrTriggerId
= lens _ptrTriggerId (\ s a -> s{_ptrTriggerId = a}) | 67 | true | true | 0 | 9 | 24 | 42 | 22 | 20 | null | null |
rueshyna/gogol | gogol-sheets/gen/Network/Google/Sheets/Types/Product.hs | mpl-2.0 | -- | Creates a value of 'ClearValuesRequest' with the minimum fields required to make a request.
--
clearValuesRequest
:: ClearValuesRequest
clearValuesRequest = ClearValuesRequest' | 185 | clearValuesRequest
:: ClearValuesRequest
clearValuesRequest = ClearValuesRequest' | 85 | clearValuesRequest = ClearValuesRequest' | 40 | true | true | 1 | 5 | 26 | 17 | 8 | 9 | null | null |
SwiftsNamesake/Southpaw | lib/Southpaw/Picasso/Palette.hs | mit | darkslategrey = (0.18431400, 0.30980400, 0.30980400, 1.0) | 64 | darkslategrey = (0.18431400, 0.30980400, 0.30980400, 1.0) | 64 | darkslategrey = (0.18431400, 0.30980400, 0.30980400, 1.0) | 64 | false | false | 0 | 5 | 12 | 18 | 11 | 7 | null | null |
jbapple/unique | draft/Kickstart.hs | mit | toList (Braun xs) =
let fs K = []
fb (Id x) = [x]
fbb (Id x) (Id y) = Id (x,y)
fbs (Id x) K = (K,x)
fss K K = K
fsas (Id x) = (x,K)
fromSas (Id x) = Kids K x K
toSas (Kids K x K) = Id x
in toListB fs fb fbb fbs fss fsas fromSas toSas xs | 283 | toList (Braun xs) =
let fs K = []
fb (Id x) = [x]
fbb (Id x) (Id y) = Id (x,y)
fbs (Id x) K = (K,x)
fss K K = K
fsas (Id x) = (x,K)
fromSas (Id x) = Kids K x K
toSas (Kids K x K) = Id x
in toListB fs fb fbb fbs fss fsas fromSas toSas xs | 283 | toList (Braun xs) =
let fs K = []
fb (Id x) = [x]
fbb (Id x) (Id y) = Id (x,y)
fbs (Id x) K = (K,x)
fss K K = K
fsas (Id x) = (x,K)
fromSas (Id x) = Kids K x K
toSas (Kids K x K) = Id x
in toListB fs fb fbb fbs fss fsas fromSas toSas xs | 283 | false | false | 0 | 11 | 111 | 192 | 96 | 96 | null | null |
JPMoresmau/leksah | src/IDE/Pane/Variables.hs | gpl-2.0 | whiteSpace = P.whiteSpace lexer | 31 | whiteSpace = P.whiteSpace lexer | 31 | whiteSpace = P.whiteSpace lexer | 31 | false | false | 1 | 6 | 3 | 14 | 5 | 9 | null | null |
jstolarek/lattice-structure-hs | tests/Signal/Wavelet/Repa2Test.hs | bsd-3-clause | dataExtendEnd :: [(Int, Array U DIM1 Double, Array U DIM1 Double)]
dataExtendEnd = Prelude.map (\(a, b, c) -> (a, f b, f c)) DW.dataExtendEnd | 141 | dataExtendEnd :: [(Int, Array U DIM1 Double, Array U DIM1 Double)]
dataExtendEnd = Prelude.map (\(a, b, c) -> (a, f b, f c)) DW.dataExtendEnd | 141 | dataExtendEnd = Prelude.map (\(a, b, c) -> (a, f b, f c)) DW.dataExtendEnd | 74 | false | true | 0 | 9 | 23 | 78 | 43 | 35 | null | null |
kmate/imperative-edsl | src/Language/Embedded/CExp.hs | bsd-3-clause | binaryOp BiGt = Gt | 20 | binaryOp BiGt = Gt | 20 | binaryOp BiGt = Gt | 20 | false | false | 0 | 5 | 5 | 9 | 4 | 5 | null | null |
glguy/vty-hangman-helper | GameMonad.hs | bsd-3-clause | incMissCount :: Game ()
incMissCount = G (modify (\g -> g { currentMissCount = currentMissCount g + 1 })) | 105 | incMissCount :: Game ()
incMissCount = G (modify (\g -> g { currentMissCount = currentMissCount g + 1 })) | 105 | incMissCount = G (modify (\g -> g { currentMissCount = currentMissCount g + 1 })) | 81 | false | true | 0 | 13 | 18 | 54 | 26 | 28 | null | null |
silky/ImplicitCAD | tests/ParserSpec/Expr.hs | gpl-2.0 | exprSpec :: Spec
exprSpec = do
describe "literals" literalSpec
describe "identifiers" $ do
it "accepts valid variable names" $ do
"foo" --> Var "foo"
"foo_bar" --> Var "foo_bar"
describe "literals" $ literalSpec
describe "grouping" $ do
it "allows parens" $ do
"( false )" --> bool False
it "handles vectors" $ do
"[ 1, 2, 3 ]" --> ListE [num 1, num 2, num 3]
it "handles lists" $ do
"( 1, 2, 3 )" --> ListE [num 1, num 2, num 3]
it "handles generators" $
"[ a : 1 : b + 10 ]" -->
(app "list_gen" [Var "a", num 1, app "+" [Var "b", num 10]])
it "handles indexing" $
"foo[23]" --> Var "index" :$ [Var "foo", num 23]
describe "arithmetic" $ do
it "handles unary +/-" $ do
"-42" --> num (-42)
"+42" --> num 42
it "handles +" $ do
"1 + 2" --> app "+" [num 1, num 2]
"1 + 2 + 3" --> app "+" [num 1, num 2, num 3]
it "handles -" $ do
"1 - 2" --> app' "-" [num 1, num 2]
"1 - 2 - 3" --> app' "-" [app' "-" [num 1, num 2], num 3]
it "handles +/- in combination" $ do
"1 + 2 - 3" --> app "+" [num 1, app' "-" [num 2, num 3]]
"2 - 3 + 4" --> app "+" [app' "-" [num 2, num 3], num 4]
"1 + 2 - 3 + 4" --> app "+" [num 1, app' "-" [num 2, num 3], num 4]
"1 + 2 - 3 + 4 - 5 - 6" --> app "+" [num 1,
app' "-" [num 2, num 3],
app' "-" [app' "-" [num 4, num 5],
num 6]]
it "handles exponentiation" $
"x ^ y" --> app' "^" [Var "x", Var "y"]
it "handles *" $ do
"3 * 4" --> app "*" [num 3, num 4]
"3 * 4 * 5" --> app "*" [num 3, num 4, num 5]
it "handles /" $
"4.2 / 2.3" --> app' "/" [num 4.2, num 2.3]
it "handles precedence" $
parseExpr "1 + 2 / 3 * 5" `shouldBe`
(Right $ app "+" [num 1, app "*" [app' "/" [num 2, num 3], num 5]])
it "handles append" $
parseExpr "foo ++ bar ++ baz" `shouldBe`
(Right $ app "++" [Var "foo", Var "bar", Var "baz"])
describe "logical operators" logicalSpec | 2,142 | exprSpec :: Spec
exprSpec = do
describe "literals" literalSpec
describe "identifiers" $ do
it "accepts valid variable names" $ do
"foo" --> Var "foo"
"foo_bar" --> Var "foo_bar"
describe "literals" $ literalSpec
describe "grouping" $ do
it "allows parens" $ do
"( false )" --> bool False
it "handles vectors" $ do
"[ 1, 2, 3 ]" --> ListE [num 1, num 2, num 3]
it "handles lists" $ do
"( 1, 2, 3 )" --> ListE [num 1, num 2, num 3]
it "handles generators" $
"[ a : 1 : b + 10 ]" -->
(app "list_gen" [Var "a", num 1, app "+" [Var "b", num 10]])
it "handles indexing" $
"foo[23]" --> Var "index" :$ [Var "foo", num 23]
describe "arithmetic" $ do
it "handles unary +/-" $ do
"-42" --> num (-42)
"+42" --> num 42
it "handles +" $ do
"1 + 2" --> app "+" [num 1, num 2]
"1 + 2 + 3" --> app "+" [num 1, num 2, num 3]
it "handles -" $ do
"1 - 2" --> app' "-" [num 1, num 2]
"1 - 2 - 3" --> app' "-" [app' "-" [num 1, num 2], num 3]
it "handles +/- in combination" $ do
"1 + 2 - 3" --> app "+" [num 1, app' "-" [num 2, num 3]]
"2 - 3 + 4" --> app "+" [app' "-" [num 2, num 3], num 4]
"1 + 2 - 3 + 4" --> app "+" [num 1, app' "-" [num 2, num 3], num 4]
"1 + 2 - 3 + 4 - 5 - 6" --> app "+" [num 1,
app' "-" [num 2, num 3],
app' "-" [app' "-" [num 4, num 5],
num 6]]
it "handles exponentiation" $
"x ^ y" --> app' "^" [Var "x", Var "y"]
it "handles *" $ do
"3 * 4" --> app "*" [num 3, num 4]
"3 * 4 * 5" --> app "*" [num 3, num 4, num 5]
it "handles /" $
"4.2 / 2.3" --> app' "/" [num 4.2, num 2.3]
it "handles precedence" $
parseExpr "1 + 2 / 3 * 5" `shouldBe`
(Right $ app "+" [num 1, app "*" [app' "/" [num 2, num 3], num 5]])
it "handles append" $
parseExpr "foo ++ bar ++ baz" `shouldBe`
(Right $ app "++" [Var "foo", Var "bar", Var "baz"])
describe "logical operators" logicalSpec | 2,142 | exprSpec = do
describe "literals" literalSpec
describe "identifiers" $ do
it "accepts valid variable names" $ do
"foo" --> Var "foo"
"foo_bar" --> Var "foo_bar"
describe "literals" $ literalSpec
describe "grouping" $ do
it "allows parens" $ do
"( false )" --> bool False
it "handles vectors" $ do
"[ 1, 2, 3 ]" --> ListE [num 1, num 2, num 3]
it "handles lists" $ do
"( 1, 2, 3 )" --> ListE [num 1, num 2, num 3]
it "handles generators" $
"[ a : 1 : b + 10 ]" -->
(app "list_gen" [Var "a", num 1, app "+" [Var "b", num 10]])
it "handles indexing" $
"foo[23]" --> Var "index" :$ [Var "foo", num 23]
describe "arithmetic" $ do
it "handles unary +/-" $ do
"-42" --> num (-42)
"+42" --> num 42
it "handles +" $ do
"1 + 2" --> app "+" [num 1, num 2]
"1 + 2 + 3" --> app "+" [num 1, num 2, num 3]
it "handles -" $ do
"1 - 2" --> app' "-" [num 1, num 2]
"1 - 2 - 3" --> app' "-" [app' "-" [num 1, num 2], num 3]
it "handles +/- in combination" $ do
"1 + 2 - 3" --> app "+" [num 1, app' "-" [num 2, num 3]]
"2 - 3 + 4" --> app "+" [app' "-" [num 2, num 3], num 4]
"1 + 2 - 3 + 4" --> app "+" [num 1, app' "-" [num 2, num 3], num 4]
"1 + 2 - 3 + 4 - 5 - 6" --> app "+" [num 1,
app' "-" [num 2, num 3],
app' "-" [app' "-" [num 4, num 5],
num 6]]
it "handles exponentiation" $
"x ^ y" --> app' "^" [Var "x", Var "y"]
it "handles *" $ do
"3 * 4" --> app "*" [num 3, num 4]
"3 * 4 * 5" --> app "*" [num 3, num 4, num 5]
it "handles /" $
"4.2 / 2.3" --> app' "/" [num 4.2, num 2.3]
it "handles precedence" $
parseExpr "1 + 2 / 3 * 5" `shouldBe`
(Right $ app "+" [num 1, app "*" [app' "/" [num 2, num 3], num 5]])
it "handles append" $
parseExpr "foo ++ bar ++ baz" `shouldBe`
(Right $ app "++" [Var "foo", Var "bar", Var "baz"])
describe "logical operators" logicalSpec | 2,125 | false | true | 0 | 20 | 771 | 899 | 412 | 487 | null | null |
prowdsponsor/country-codes | src/Data/CountryCodes/ISO31661.hs | bsd-3-clause | fromMName "Turks and Caicos Islands" = Just TC | 46 | fromMName "Turks and Caicos Islands" = Just TC | 46 | fromMName "Turks and Caicos Islands" = Just TC | 46 | false | false | 0 | 5 | 7 | 12 | 5 | 7 | null | null |
johanneshilden/liquid-epsilon | Util/JSON.hs | bsd-3-clause | parse :: Parser a -> String -> [(a, String)]
parse (P p) = p | 60 | parse :: Parser a -> String -> [(a, String)]
parse (P p) = p | 60 | parse (P p) = p | 15 | false | true | 0 | 8 | 13 | 44 | 22 | 22 | null | null |
dbp/snaplet-wordpress | src/Web/Offset/Date.hs | bsd-3-clause | jsonParseDate :: Value -> UTCTime
jsonParseDate (String t) =
fromMaybe (error $ "Unable to parse date: " ++ show t)
$ parseWPDate "%Y-%m-%dT%H:%M:%S" t | 157 | jsonParseDate :: Value -> UTCTime
jsonParseDate (String t) =
fromMaybe (error $ "Unable to parse date: " ++ show t)
$ parseWPDate "%Y-%m-%dT%H:%M:%S" t | 157 | jsonParseDate (String t) =
fromMaybe (error $ "Unable to parse date: " ++ show t)
$ parseWPDate "%Y-%m-%dT%H:%M:%S" t | 123 | false | true | 0 | 9 | 29 | 50 | 24 | 26 | null | null |
ihc/futhark | src/Futhark/Binder/Class.hs | isc | letBind :: MonadBinder m =>
Pattern (Lore m) -> Exp (Lore m) -> m [Ident]
letBind pat e = do
bnd <- mkLetM pat e
addStm bnd
return $ patternValueIdents $ stmPattern bnd | 185 | letBind :: MonadBinder m =>
Pattern (Lore m) -> Exp (Lore m) -> m [Ident]
letBind pat e = do
bnd <- mkLetM pat e
addStm bnd
return $ patternValueIdents $ stmPattern bnd | 185 | letBind pat e = do
bnd <- mkLetM pat e
addStm bnd
return $ patternValueIdents $ stmPattern bnd | 100 | false | true | 0 | 10 | 49 | 92 | 40 | 52 | null | null |
mtlstats/mtlstats | src/Mtlstats/Control.hs | gpl-3.0 | newSeasonC True = menuController newSeasonMenu | 47 | newSeasonC True = menuController newSeasonMenu | 47 | newSeasonC True = menuController newSeasonMenu | 47 | false | false | 1 | 5 | 5 | 15 | 5 | 10 | null | null |
nevrenato/Hets_Fork | CSL/Parse_AS_Basic.hs | gpl-2.0 | -- | parser for variable declarations
parseVarDecl :: AnnoState.AParser st BASIC_ITEM
parseVarDecl = varItems >-> Var_decls | 123 | parseVarDecl :: AnnoState.AParser st BASIC_ITEM
parseVarDecl = varItems >-> Var_decls | 85 | parseVarDecl = varItems >-> Var_decls | 37 | true | true | 0 | 6 | 15 | 23 | 12 | 11 | null | null |
GaloisInc/halvm-ghc | compiler/typecheck/TcType.hs | bsd-3-clause | tcSplitAppTys :: Type -> (Type, [Type])
tcSplitAppTys ty
= go ty []
where
go ty args = case tcSplitAppTy_maybe ty of
Just (ty', arg) -> go ty' (arg:args)
Nothing -> (ty,args)
----------------------- | 253 | tcSplitAppTys :: Type -> (Type, [Type])
tcSplitAppTys ty
= go ty []
where
go ty args = case tcSplitAppTy_maybe ty of
Just (ty', arg) -> go ty' (arg:args)
Nothing -> (ty,args)
----------------------- | 253 | tcSplitAppTys ty
= go ty []
where
go ty args = case tcSplitAppTy_maybe ty of
Just (ty', arg) -> go ty' (arg:args)
Nothing -> (ty,args)
----------------------- | 213 | false | true | 1 | 10 | 86 | 105 | 50 | 55 | null | null |
SamirTalwar/advent-of-code | 2021/AOC_20_2.hs | mit | parseImagePoints :: [[Pixel]] -> Set Point
parseImagePoints pixels =
pixels
|> zipWith (\y row -> zipWith (\x pixel -> (Point y x, pixel)) [0 ..] row) [0 ..]
|> concat
|> filter ((== Light) . snd)
|> map fst
|> Set.fromList | 245 | parseImagePoints :: [[Pixel]] -> Set Point
parseImagePoints pixels =
pixels
|> zipWith (\y row -> zipWith (\x pixel -> (Point y x, pixel)) [0 ..] row) [0 ..]
|> concat
|> filter ((== Light) . snd)
|> map fst
|> Set.fromList | 245 | parseImagePoints pixels =
pixels
|> zipWith (\y row -> zipWith (\x pixel -> (Point y x, pixel)) [0 ..] row) [0 ..]
|> concat
|> filter ((== Light) . snd)
|> map fst
|> Set.fromList | 202 | false | true | 0 | 17 | 62 | 117 | 63 | 54 | null | null |
riwsky/wiwinwlh | src/partiality.hs | mit | -- Non-termination.
never :: Partiality a
never = fix (Free . Just) | 67 | never :: Partiality a
never = fix (Free . Just) | 47 | never = fix (Free . Just) | 25 | true | true | 0 | 7 | 11 | 25 | 13 | 12 | null | null |
christiaanb/ghc-typelits-extra | tests/ErrorTests.hs | bsd-2-clause | testFail8Errors =
["Expected: Proxy (CLog 1 (1 ^ y)) -> Proxy y"
," Actual: Proxy y -> Proxy y"
] | 104 | testFail8Errors =
["Expected: Proxy (CLog 1 (1 ^ y)) -> Proxy y"
," Actual: Proxy y -> Proxy y"
] | 104 | testFail8Errors =
["Expected: Proxy (CLog 1 (1 ^ y)) -> Proxy y"
," Actual: Proxy y -> Proxy y"
] | 104 | false | false | 0 | 5 | 26 | 12 | 7 | 5 | null | null |
roelvandijk/aeson | Data/Aeson/TH.hs | bsd-3-clause | stealKindForType _ t = t | 33 | stealKindForType _ t = t | 33 | stealKindForType _ t = t | 33 | false | false | 0 | 5 | 13 | 11 | 5 | 6 | null | null |
technogeeky/d-A | include/containers-0.5.0.0/Data/IntMap/Base.hs | gpl-3.0 | {- | /O(n+m)/.
The expression (@'isSubmapOfBy' f m1 m2@) returns 'True' if
all keys in @m1@ are in @m2@, and when @f@ returns 'True' when
applied to their respective values. For example, the following
expressions are all 'True':
> isSubmapOfBy (==) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
> isSubmapOfBy (<=) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
> isSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1),(2,2)])
But the following are all 'False':
> isSubmapOfBy (==) (fromList [(1,2)]) (fromList [(1,1),(2,2)])
> isSubmapOfBy (<) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
> isSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1)])
-}
isSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool
isSubmapOfBy predicate t1@(Bin p1 m1 l1 r1) (Bin p2 m2 l2 r2)
| shorter m1 m2 = False
| shorter m2 m1 = match p1 p2 m2 && (if zero p1 m2 then isSubmapOfBy predicate t1 l2
else isSubmapOfBy predicate t1 r2)
| otherwise = (p1==p2) && isSubmapOfBy predicate l1 l2 && isSubmapOfBy predicate r1 r2 | 1,100 | isSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool
isSubmapOfBy predicate t1@(Bin p1 m1 l1 r1) (Bin p2 m2 l2 r2)
| shorter m1 m2 = False
| shorter m2 m1 = match p1 p2 m2 && (if zero p1 m2 then isSubmapOfBy predicate t1 l2
else isSubmapOfBy predicate t1 r2)
| otherwise = (p1==p2) && isSubmapOfBy predicate l1 l2 && isSubmapOfBy predicate r1 r2 | 424 | isSubmapOfBy predicate t1@(Bin p1 m1 l1 r1) (Bin p2 m2 l2 r2)
| shorter m1 m2 = False
| shorter m2 m1 = match p1 p2 m2 && (if zero p1 m2 then isSubmapOfBy predicate t1 l2
else isSubmapOfBy predicate t1 r2)
| otherwise = (p1==p2) && isSubmapOfBy predicate l1 l2 && isSubmapOfBy predicate r1 r2 | 359 | true | true | 2 | 8 | 244 | 175 | 86 | 89 | null | null |
ezyang/ghc | compiler/utils/Outputable.hs | bsd-3-clause | rational n = docToSDoc $ Pretty.rational n | 43 | rational n = docToSDoc $ Pretty.rational n | 43 | rational n = docToSDoc $ Pretty.rational n | 43 | false | false | 0 | 7 | 7 | 18 | 8 | 10 | null | null |
MaximKN/Haskell1 | src/REPL.hs | gpl-3.0 | -- | Add commands to the list of commands to be executed
addCommands :: State -> [String] -> State
addCommands st cmds = st { commands = cmds ++ commands st } | 158 | addCommands :: State -> [String] -> State
addCommands st cmds = st { commands = cmds ++ commands st } | 101 | addCommands st cmds = st { commands = cmds ++ commands st } | 59 | true | true | 0 | 8 | 31 | 43 | 23 | 20 | null | null |
phylake/avm3 | vm/store.hs | mit | xform_opCode {- 0x5E -} i u d s m t (Abc.FindProperty u30) = [FindProperty u30 $ m u30] | 87 | xform_opCode {- 0x5E -} i u d s m t (Abc.FindProperty u30) = [FindProperty u30 $ m u30] | 87 | xform_opCode {- 0x5E -} i u d s m t (Abc.FindProperty u30) = [FindProperty u30 $ m u30] | 87 | false | false | 0 | 8 | 17 | 43 | 21 | 22 | null | null |
tpsinnem/Idris-dev | src/IRTS/CodegenC.hs | bsd-3-clause | doOp v (LOr ITNative) [l, r] = v ++ "INTOP(|," ++ creg l ++ ", " ++ creg r ++ ")" | 81 | doOp v (LOr ITNative) [l, r] = v ++ "INTOP(|," ++ creg l ++ ", " ++ creg r ++ ")" | 81 | doOp v (LOr ITNative) [l, r] = v ++ "INTOP(|," ++ creg l ++ ", " ++ creg r ++ ")" | 81 | false | false | 0 | 9 | 20 | 54 | 25 | 29 | null | null |
brenov/set | interpreter/Expressions.hs | mit | eval (Real x p) (Addition _) (Nat y _) = Real (x + integerToFloat(y)) p | 72 | eval (Real x p) (Addition _) (Nat y _) = Real (x + integerToFloat(y)) p | 72 | eval (Real x p) (Addition _) (Nat y _) = Real (x + integerToFloat(y)) p | 72 | false | false | 0 | 9 | 15 | 57 | 27 | 30 | null | null |
bitemyapp/7startups | Startups/Game.hs | bsd-3-clause | checkCopyCommunity :: GameMonad p ()
checkCopyCommunity = do
pm <- use playermap
ifor_ pm $ \pid stt -> when (has (cardEffects . _CopyCommunity) stt) $ do
-- get the violet cards from both neighbors
let neighs = stt ^.. pNeighborhood . both
violetCards = pm ^.. ifolded -- traverse de playerstate map
. ifiltered (const . (`elem` neighs)) -- keep only the neighbors
. pCards -- select each neighbor card list
. folded -- fold through it
. filtered (has (cType . _Community)) -- keep the violet cards
case violetCards ^? _NonEmpty of
Just nevc -> do
generalMessage (showPlayerId pid <+> "is going to use his community copy ability.")
card <- askCardSafe Age3 pid nevc "Which community would you like to copy ?"
generalMessage (showPlayerId pid <+> "copied" <+> shortCard card)
playermap . ix pid . pCards %= (card:)
Nothing -> tellPlayer pid (emph "There were no violet cards bought by your neighbors. You can't use your copy capacity.") | 1,192 | checkCopyCommunity :: GameMonad p ()
checkCopyCommunity = do
pm <- use playermap
ifor_ pm $ \pid stt -> when (has (cardEffects . _CopyCommunity) stt) $ do
-- get the violet cards from both neighbors
let neighs = stt ^.. pNeighborhood . both
violetCards = pm ^.. ifolded -- traverse de playerstate map
. ifiltered (const . (`elem` neighs)) -- keep only the neighbors
. pCards -- select each neighbor card list
. folded -- fold through it
. filtered (has (cType . _Community)) -- keep the violet cards
case violetCards ^? _NonEmpty of
Just nevc -> do
generalMessage (showPlayerId pid <+> "is going to use his community copy ability.")
card <- askCardSafe Age3 pid nevc "Which community would you like to copy ?"
generalMessage (showPlayerId pid <+> "copied" <+> shortCard card)
playermap . ix pid . pCards %= (card:)
Nothing -> tellPlayer pid (emph "There were no violet cards bought by your neighbors. You can't use your copy capacity.") | 1,192 | checkCopyCommunity = do
pm <- use playermap
ifor_ pm $ \pid stt -> when (has (cardEffects . _CopyCommunity) stt) $ do
-- get the violet cards from both neighbors
let neighs = stt ^.. pNeighborhood . both
violetCards = pm ^.. ifolded -- traverse de playerstate map
. ifiltered (const . (`elem` neighs)) -- keep only the neighbors
. pCards -- select each neighbor card list
. folded -- fold through it
. filtered (has (cType . _Community)) -- keep the violet cards
case violetCards ^? _NonEmpty of
Just nevc -> do
generalMessage (showPlayerId pid <+> "is going to use his community copy ability.")
card <- askCardSafe Age3 pid nevc "Which community would you like to copy ?"
generalMessage (showPlayerId pid <+> "copied" <+> shortCard card)
playermap . ix pid . pCards %= (card:)
Nothing -> tellPlayer pid (emph "There were no violet cards bought by your neighbors. You can't use your copy capacity.") | 1,155 | false | true | 0 | 23 | 414 | 267 | 130 | 137 | null | null |
haskell-opengl/OpenGLRaw | src/Graphics/GL/ExtensionPredicates.hs | bsd-3-clause | -- | Is the <https://www.opengl.org/registry/specs/HP/occlusion_test.txt HP_occlusion_test> extension supported?
glGetHPOcclusionTest :: MonadIO m => m Bool
glGetHPOcclusionTest = getExtensions >>= (return . member "GL_HP_occlusion_test") | 238 | glGetHPOcclusionTest :: MonadIO m => m Bool
glGetHPOcclusionTest = getExtensions >>= (return . member "GL_HP_occlusion_test") | 125 | glGetHPOcclusionTest = getExtensions >>= (return . member "GL_HP_occlusion_test") | 81 | true | true | 0 | 8 | 22 | 36 | 18 | 18 | null | null |
keithodulaigh/Hets | GMP/GMP-CoLoSS/GMP/Logics/Generic.hs | gpl-2.0 | genfDepth :: (Feature a (b (c d)), SigFeature b c d) => a (b (c d)) -> Int
genfDepth sig = case fStripFeature sig of
[phi] -> sDepth phi | 154 | genfDepth :: (Feature a (b (c d)), SigFeature b c d) => a (b (c d)) -> Int
genfDepth sig = case fStripFeature sig of
[phi] -> sDepth phi | 154 | genfDepth sig = case fStripFeature sig of
[phi] -> sDepth phi | 79 | false | true | 0 | 11 | 46 | 85 | 42 | 43 | null | null |
pgj/bead | src/Bead/Persistence/NoSQLDir.hs | bsd-3-clause | isLinkedIn :: (ForeignKey k1, ForeignKey k2) => k1 -> k2 -> FilePath -> Persist Bool
isLinkedIn object linkto subdir =
hasNoRollback . doesDirectoryExist . joinPath $ [referredPath linkto, subdir, baseName object] | 215 | isLinkedIn :: (ForeignKey k1, ForeignKey k2) => k1 -> k2 -> FilePath -> Persist Bool
isLinkedIn object linkto subdir =
hasNoRollback . doesDirectoryExist . joinPath $ [referredPath linkto, subdir, baseName object] | 215 | isLinkedIn object linkto subdir =
hasNoRollback . doesDirectoryExist . joinPath $ [referredPath linkto, subdir, baseName object] | 130 | false | true | 0 | 9 | 32 | 75 | 38 | 37 | null | null |
Bodigrim/katas | src/haskell/7-254-shades-of-grey.hs | bsd-2-clause | shadesOfGrey :: Int -> [String]
shadesOfGrey m = take m [ '#':a++a++a | a<-ds] where
ds = map (('0':) . (`showHex` "")) [1..15] ++ map (`showHex` "") [16..255] | 161 | shadesOfGrey :: Int -> [String]
shadesOfGrey m = take m [ '#':a++a++a | a<-ds] where
ds = map (('0':) . (`showHex` "")) [1..15] ++ map (`showHex` "") [16..255] | 161 | shadesOfGrey m = take m [ '#':a++a++a | a<-ds] where
ds = map (('0':) . (`showHex` "")) [1..15] ++ map (`showHex` "") [16..255] | 129 | false | true | 1 | 9 | 29 | 114 | 59 | 55 | null | null |
tpsinnem/Idris-dev | src/Idris/AbsSyntaxTree.hs | bsd-3-clause | inferDecl = PDatadecl inferTy primfc
(PType bi)
[(emptyDocstring, [], inferCon, primfc, PPi impl (sMN 0 "iType") primfc (PType bi) (
PPi expl (sMN 0 "ival") primfc (PRef bi [] (sMN 0 "iType"))
(PRef bi [] inferTy)), bi, [])] | 370 | inferDecl = PDatadecl inferTy primfc
(PType bi)
[(emptyDocstring, [], inferCon, primfc, PPi impl (sMN 0 "iType") primfc (PType bi) (
PPi expl (sMN 0 "ival") primfc (PRef bi [] (sMN 0 "iType"))
(PRef bi [] inferTy)), bi, [])] | 370 | inferDecl = PDatadecl inferTy primfc
(PType bi)
[(emptyDocstring, [], inferCon, primfc, PPi impl (sMN 0 "iType") primfc (PType bi) (
PPi expl (sMN 0 "ival") primfc (PRef bi [] (sMN 0 "iType"))
(PRef bi [] inferTy)), bi, [])] | 370 | false | false | 0 | 14 | 183 | 128 | 67 | 61 | null | null |
fffej/HS-Poker | LookupPatternMatch.hs | bsd-3-clause | getValueFromProduct 22550 = 5577 | 32 | getValueFromProduct 22550 = 5577 | 32 | getValueFromProduct 22550 = 5577 | 32 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
seereason/ghcjs | src/Gen2/Rts.hs | mit | bitsIdx :: Integer -> [Int]
bitsIdx n | n < 0 = error "bitsIdx: negative"
| otherwise = go n 0
where
go 0 _ = []
go m b | testBit m b = b : go (clearBit m b) (b+1)
| otherwise = go (clearBit m b) (b+1) | 234 | bitsIdx :: Integer -> [Int]
bitsIdx n | n < 0 = error "bitsIdx: negative"
| otherwise = go n 0
where
go 0 _ = []
go m b | testBit m b = b : go (clearBit m b) (b+1)
| otherwise = go (clearBit m b) (b+1) | 234 | bitsIdx n | n < 0 = error "bitsIdx: negative"
| otherwise = go n 0
where
go 0 _ = []
go m b | testBit m b = b : go (clearBit m b) (b+1)
| otherwise = go (clearBit m b) (b+1) | 206 | false | true | 0 | 9 | 82 | 137 | 64 | 73 | null | null |
TomMD/ghc | compiler/hsSyn/HsExpr.hs | bsd-3-clause | matchGroupArity :: MatchGroup id body -> Arity
-- Precondition: MatchGroup is non-empty
-- This is called before type checking, when mg_arg_tys is not set
matchGroupArity (MG { mg_alts = alts })
| (alt1:_) <- alts = length (hsLMatchPats alt1)
| otherwise = panic "matchGroupArity" | 291 | matchGroupArity :: MatchGroup id body -> Arity
matchGroupArity (MG { mg_alts = alts })
| (alt1:_) <- alts = length (hsLMatchPats alt1)
| otherwise = panic "matchGroupArity" | 183 | matchGroupArity (MG { mg_alts = alts })
| (alt1:_) <- alts = length (hsLMatchPats alt1)
| otherwise = panic "matchGroupArity" | 136 | true | true | 5 | 7 | 54 | 85 | 39 | 46 | null | null |
charlesrosenbauer/Bzo-Compiler | src/Query.hs | gpl-3.0 | getIds (BzS_TypDef _ ps _ df) = (getIds ps) ++ (getIds df) | 62 | getIds (BzS_TypDef _ ps _ df) = (getIds ps) ++ (getIds df) | 62 | getIds (BzS_TypDef _ ps _ df) = (getIds ps) ++ (getIds df) | 62 | false | false | 0 | 7 | 15 | 37 | 18 | 19 | null | null |
pdownen/sequent-core | src/Language/SequentCore/WiredIn.hs | bsd-3-clause | mkKontKind :: Kind -> Kind
mkKontKind kind = mkTyConApp kontKindTyCon [kind] | 76 | mkKontKind :: Kind -> Kind
mkKontKind kind = mkTyConApp kontKindTyCon [kind] | 76 | mkKontKind kind = mkTyConApp kontKindTyCon [kind] | 49 | false | true | 0 | 6 | 10 | 26 | 13 | 13 | null | null |
abdulrahimnizamani/OccamStar | LogicAgentOld.hs | gpl-2.0 | --valid (x :& F) = F
--valid (F :& x) = F
--valid (x :& Neg x) = F
--valid (Neg x :& x) = F
-- AND
valid (T :& x) = valid x | 124 | valid (T :& x) = valid x | 24 | valid (T :& x) = valid x | 24 | true | false | 0 | 7 | 35 | 24 | 14 | 10 | null | null |
psibi/persistent | persistent-mysql/Database/Persist/MySQL.hs | mit | showSqlType SqlString Nothing False = "TEXT" | 48 | showSqlType SqlString Nothing False = "TEXT" | 48 | showSqlType SqlString Nothing False = "TEXT" | 48 | false | false | 1 | 5 | 9 | 19 | 6 | 13 | null | null |
AndreasVoellmy/nettle-openflow | src/Network/Data/OpenFlow/MatchBuilder.hs | bsd-3-clause | updateDstIPAddress prefix body = body { dstIPAddress = prefix} | 62 | updateDstIPAddress prefix body = body { dstIPAddress = prefix} | 62 | updateDstIPAddress prefix body = body { dstIPAddress = prefix} | 62 | false | false | 0 | 6 | 8 | 19 | 10 | 9 | null | null |
TomMD/cryptol | sbv/Data/SBV/SMT/SMTLib1.hs | bsd-3-clause | cvtType :: SBVType -> String
cvtType (SBVType []) = error "SBV.SMT.SMTLib1.cvtType: internal: received an empty type!" | 118 | cvtType :: SBVType -> String
cvtType (SBVType []) = error "SBV.SMT.SMTLib1.cvtType: internal: received an empty type!" | 118 | cvtType (SBVType []) = error "SBV.SMT.SMTLib1.cvtType: internal: received an empty type!" | 89 | false | true | 0 | 10 | 15 | 34 | 15 | 19 | null | null |
peat/hbot | src/Main.hs | bsd-3-clause | nickMsg = Message {origin = OriginDefault, operation = CmdNick, parameters = Just (ParamDefault ["HBot"])} | 107 | nickMsg = Message {origin = OriginDefault, operation = CmdNick, parameters = Just (ParamDefault ["HBot"])} | 107 | nickMsg = Message {origin = OriginDefault, operation = CmdNick, parameters = Just (ParamDefault ["HBot"])} | 107 | false | false | 0 | 10 | 14 | 38 | 22 | 16 | null | null |
kawamuray/ganeti | src/Ganeti/Query/Export.hs | gpl-2.0 | rpcExtractor node (Left err) = [(node, rpcErrToRs err)] | 56 | rpcExtractor node (Left err) = [(node, rpcErrToRs err)] | 56 | rpcExtractor node (Left err) = [(node, rpcErrToRs err)] | 56 | false | false | 0 | 7 | 8 | 29 | 15 | 14 | null | null |
riwsky/wiwinwlh | src/typeable.hs | mit | -- Animal
example2 :: TypeRep
example2 = typeOf (Zoo [Cat, Dog]) | 65 | example2 :: TypeRep
example2 = typeOf (Zoo [Cat, Dog]) | 54 | example2 = typeOf (Zoo [Cat, Dog]) | 34 | true | true | 0 | 8 | 11 | 27 | 15 | 12 | null | null |
olsner/ghc | compiler/utils/Util.hs | bsd-3-clause | globalM :: IO a -> IORef a
globalM ma = unsafePerformIO (ma >>= newIORef) | 73 | globalM :: IO a -> IORef a
globalM ma = unsafePerformIO (ma >>= newIORef) | 73 | globalM ma = unsafePerformIO (ma >>= newIORef) | 46 | false | true | 0 | 7 | 13 | 38 | 17 | 21 | null | null |
ozgurakgun/Idris-dev | src/Idris/Core/TT.hs | bsd-3-clause | fmapMB f (PVTy t) = liftM PVTy (f t) | 39 | fmapMB f (PVTy t) = liftM PVTy (f t) | 39 | fmapMB f (PVTy t) = liftM PVTy (f t) | 39 | false | false | 0 | 7 | 11 | 30 | 13 | 17 | null | null |
Chatanga/kage | src/Graphics/Ext/Shader.hs | mit | --------------------------------------------------------------------------------
marshalShaderType :: ShaderType -> GLenum
marshalShaderType x = case x of
VertexShader -> Raw.GL_VERTEX_SHADER
TessControlShader -> Raw.GL_TESS_CONTROL_SHADER
TessEvaluationShader -> Raw.GL_TESS_EVALUATION_SHADER
GeometryShader -> Raw.GL_GEOMETRY_SHADER
FragmentShader -> Raw.GL_FRAGMENT_SHADER
ComputeShader -> Raw.GL_COMPUTE_SHADER | 433 | marshalShaderType :: ShaderType -> GLenum
marshalShaderType x = case x of
VertexShader -> Raw.GL_VERTEX_SHADER
TessControlShader -> Raw.GL_TESS_CONTROL_SHADER
TessEvaluationShader -> Raw.GL_TESS_EVALUATION_SHADER
GeometryShader -> Raw.GL_GEOMETRY_SHADER
FragmentShader -> Raw.GL_FRAGMENT_SHADER
ComputeShader -> Raw.GL_COMPUTE_SHADER | 351 | marshalShaderType x = case x of
VertexShader -> Raw.GL_VERTEX_SHADER
TessControlShader -> Raw.GL_TESS_CONTROL_SHADER
TessEvaluationShader -> Raw.GL_TESS_EVALUATION_SHADER
GeometryShader -> Raw.GL_GEOMETRY_SHADER
FragmentShader -> Raw.GL_FRAGMENT_SHADER
ComputeShader -> Raw.GL_COMPUTE_SHADER | 309 | true | true | 0 | 9 | 48 | 77 | 37 | 40 | null | null |
sdiehl/ghc | compiler/nativeGen/SPARC/Ppr.hs | bsd-3-clause | pprInstr (SLL reg1 ri reg2) = pprRegRIReg (sLit "sll") False reg1 ri reg2 | 76 | pprInstr (SLL reg1 ri reg2) = pprRegRIReg (sLit "sll") False reg1 ri reg2 | 76 | pprInstr (SLL reg1 ri reg2) = pprRegRIReg (sLit "sll") False reg1 ri reg2 | 76 | false | false | 0 | 7 | 15 | 37 | 17 | 20 | null | null |
maximilianhuber/innovation | lib/Game/Innovation/Types.hs | bsd-3-clause | getStackSize :: Stack a =>
a -> Int
getStackSize = length . getRawStack | 87 | getStackSize :: Stack a =>
a -> Int
getStackSize = length . getRawStack | 87 | getStackSize = length . getRawStack | 35 | false | true | 0 | 6 | 28 | 26 | 13 | 13 | null | null |
brendanhay/gogol | gogol-storage/gen/Network/Google/Storage/Types/Product.hs | mpl-2.0 | -- | A UUID or similar unique string that identifies this channel.
cId :: Lens' Channel (Maybe Text)
cId = lens _cId (\ s a -> s{_cId = a}) | 139 | cId :: Lens' Channel (Maybe Text)
cId = lens _cId (\ s a -> s{_cId = a}) | 72 | cId = lens _cId (\ s a -> s{_cId = a}) | 38 | true | true | 0 | 9 | 28 | 46 | 25 | 21 | null | null |
sherwoodwang/wxHaskell | wxcore/src/haskell/Graphics/UI/WXCore/WxcDefs.hs | lgpl-2.1 | wxSTC_INDIC_DIAGONAL :: Int
wxSTC_INDIC_DIAGONAL = 3 | 52 | wxSTC_INDIC_DIAGONAL :: Int
wxSTC_INDIC_DIAGONAL = 3 | 52 | wxSTC_INDIC_DIAGONAL = 3 | 24 | false | true | 0 | 6 | 5 | 18 | 7 | 11 | null | null |
urbanslug/ghc | testsuite/tests/perf/should_run/T4267.hs | bsd-3-clause | sumTree :: Int -> Tree Int -> Int
sumTree = fold' (+) | 53 | sumTree :: Int -> Tree Int -> Int
sumTree = fold' (+) | 53 | sumTree = fold' (+) | 19 | false | true | 0 | 7 | 11 | 27 | 14 | 13 | null | null |
scslab/iterIO | Data/IterIO/Search.hs | bsd-3-clause | mapLI :: (ChunkData t, LL.ListLike t e, Ord t, Eq e, Monad m) =>
[(t, a)] -> Iter t m a
mapLI = mapI . Map.fromList | 124 | mapLI :: (ChunkData t, LL.ListLike t e, Ord t, Eq e, Monad m) =>
[(t, a)] -> Iter t m a
mapLI = mapI . Map.fromList | 124 | mapLI = mapI . Map.fromList | 27 | false | true | 0 | 8 | 34 | 74 | 39 | 35 | null | null |
brendanhay/gogol | gogol-resourcemanager/gen/Network/Google/Resource/CloudResourceManager/Liens/List.hs | mpl-2.0 | -- | Creates a value of 'LiensList' with the minimum fields required to make a request.
--
-- Use one of the following lenses to modify other fields as desired:
--
-- * 'llParent'
--
-- * 'llXgafv'
--
-- * 'llUploadProtocol'
--
-- * 'llAccessToken'
--
-- * 'llUploadType'
--
-- * 'llPageToken'
--
-- * 'llPageSize'
--
-- * 'llCallback'
liensList
:: LiensList
liensList =
LiensList'
{ _llParent = Nothing
, _llXgafv = Nothing
, _llUploadProtocol = Nothing
, _llAccessToken = Nothing
, _llUploadType = Nothing
, _llPageToken = Nothing
, _llPageSize = Nothing
, _llCallback = Nothing
} | 624 | liensList
:: LiensList
liensList =
LiensList'
{ _llParent = Nothing
, _llXgafv = Nothing
, _llUploadProtocol = Nothing
, _llAccessToken = Nothing
, _llUploadType = Nothing
, _llPageToken = Nothing
, _llPageSize = Nothing
, _llCallback = Nothing
} | 288 | liensList =
LiensList'
{ _llParent = Nothing
, _llXgafv = Nothing
, _llUploadProtocol = Nothing
, _llAccessToken = Nothing
, _llUploadType = Nothing
, _llPageToken = Nothing
, _llPageSize = Nothing
, _llCallback = Nothing
} | 261 | true | true | 0 | 6 | 142 | 80 | 58 | 22 | null | null |
nushio3/ghc | compiler/utils/Util.hs | bsd-3-clause | globalM :: IO a -> IORef a
globalM ma = unsafePerformIO (ma >>= newIORef) | 73 | globalM :: IO a -> IORef a
globalM ma = unsafePerformIO (ma >>= newIORef) | 73 | globalM ma = unsafePerformIO (ma >>= newIORef) | 46 | false | true | 0 | 7 | 13 | 39 | 17 | 22 | null | null |
sir-murray/lol | Handler/OrderNew.hs | agpl-3.0 | saveOrder :: Bool -> Bool -> Phone -> Text -> Maybe AddressId -> Maybe ChargeId -> Handler Html
saveOrder card deliver p email ma charge = do
d <- getDeploymentId
u <- maybeAuthId
time <- liftIO getCurrentTime
let payment = if card then Paid else Payable
o <- runDB $ insert $ Order d u card deliver New payment ma p email charge time
ps <- query
_ <- forM ps $ \(pid, _, c, q) ->
runDB $ insert $ OrderLine o pid c q
completeOrder
redirect OrderCompleteR | 499 | saveOrder :: Bool -> Bool -> Phone -> Text -> Maybe AddressId -> Maybe ChargeId -> Handler Html
saveOrder card deliver p email ma charge = do
d <- getDeploymentId
u <- maybeAuthId
time <- liftIO getCurrentTime
let payment = if card then Paid else Payable
o <- runDB $ insert $ Order d u card deliver New payment ma p email charge time
ps <- query
_ <- forM ps $ \(pid, _, c, q) ->
runDB $ insert $ OrderLine o pid c q
completeOrder
redirect OrderCompleteR | 499 | saveOrder card deliver p email ma charge = do
d <- getDeploymentId
u <- maybeAuthId
time <- liftIO getCurrentTime
let payment = if card then Paid else Payable
o <- runDB $ insert $ Order d u card deliver New payment ma p email charge time
ps <- query
_ <- forM ps $ \(pid, _, c, q) ->
runDB $ insert $ OrderLine o pid c q
completeOrder
redirect OrderCompleteR | 403 | false | true | 0 | 11 | 132 | 200 | 95 | 105 | null | null |
gnn/Hets | TPTP/Pretty.hs | gpl-2.0 | -- NOTE: not used by parser
-- %----New material for modal logic semantics, not integrated yet
-- <logic_defn_rule> :== <logic_defn_LHS> <assignment> <logic_defn_RHS>-
-- data Logic_defn_rule = Logic_defn_rule Logic_defn_LHS Logic_defn_RHS
-- deriving (Show, Ord, Eq, Data, Typeable)
-- NOTE: not used by parser
-- <logic_defn_LHS> :== <logic_defn_value> | <thf_top_level_type> | <name>
-- <logic_defn_LHS> :== $constants | $quantification | $consequence |
-- $modalities
-- %----The $constants, $quantification, and $consequence apply to all of the
-- %----$modalities. Each of these may be specified only once, but not necessarily
-- %----all in a single annotated formula.-
-- data Logic_defn_LHS = Logic_defn_LHS_value Logic_defn_value
-- | Logic_defn_LHS_THF_Top_level_type THF_top_level_type
-- | Logic_defn_LHS_name Name
-- | LDLC_constants
-- | LDLC_quantification
-- | LDLC_consequence
-- | LDLC_modalities
-- deriving (Show, Ord, Eq, Data, Typeable)
-- NOTE: not used by parser
-- <logic_defn_RHS> :== <logic_defn_value> | <thf_unitary_formula>-
-- data Logic_defn_RHS = Logic_defn_RHS_value Logic_defn_value
-- | Logic_defn_RNG_THF_Unitary_forumla THF_unitary_formula
-- deriving (Show, Ord, Eq, Data, Typeable)
-- NOTE: not used by parser
-- <logic_defn_value> :== <defined_constant>
-- <logic_defn_value> :== $rigid | $flexible |
-- $constant | $varying | $cumulative | $decreasing |
-- $local | $global |
-- $modal_system_K | $modal_system_T | $modal_system_D |
-- $modal_system_S4 | $modal_system_S5 |
-- $modal_axiom_K | $modal_axiom_T | $modal_axiom_B |
-- $modal_axiom_D | $modal_axiom_4 | $modal_axiom_5-
-- data Logic_defn_value = Rigid
-- | Flexible
-- | Constant
-- | Varying
-- | Cumulative
-- | Decreasing
-- | Local
-- | Global
-- | Modal_system_K
-- | Modal_system_T
-- | Modal_system_D
-- | Modal_system_S4
-- | Modal_system_S5
-- | Modal_axiom_K
-- | Modal_axiom_T
-- | Modal_axiom_B
-- | Modal_axiom_D
-- | Modal_axiom_4
-- | Modal_axiom_5
-- deriving (Show, Ord, Eq, Data, Typeable)
-- %----TFX formulae
-- <tfx_formula> ::= <tfx_logic_formula> | <thf_sequent>
printTFX_formula :: TFX_formula -> Doc
printTFX_formula x = case x of
TFXF_logic a -> pretty a
TFXF_sequent a -> pretty a
-- <tfx_logic_formula> ::= <thf_logic_formula>
-- % <tfx_logic_formula> ::= <thf_binary_formula> | <thf_unitary_formula> |
-- % <tff_typed_atom> | <tff_subtype> | 3,351 | printTFX_formula :: TFX_formula -> Doc
printTFX_formula x = case x of
TFXF_logic a -> pretty a
TFXF_sequent a -> pretty a
-- <tfx_logic_formula> ::= <thf_logic_formula>
-- % <tfx_logic_formula> ::= <thf_binary_formula> | <thf_unitary_formula> |
-- % <tff_typed_atom> | <tff_subtype> | 320 | printTFX_formula x = case x of
TFXF_logic a -> pretty a
TFXF_sequent a -> pretty a
-- <tfx_logic_formula> ::= <thf_logic_formula>
-- % <tfx_logic_formula> ::= <thf_binary_formula> | <thf_unitary_formula> |
-- % <tff_typed_atom> | <tff_subtype> | 281 | true | true | 3 | 5 | 1,300 | 102 | 80 | 22 | null | null |
cgag/spock-starter | app/Main.hs | bsd-3-clause | main :: IO ()
main = serve 6666 | 31 | main :: IO ()
main = serve 6666 | 31 | main = serve 6666 | 17 | false | true | 0 | 7 | 7 | 25 | 10 | 15 | null | null |
ekmett/ghc | compiler/cmm/MkGraph.hs | bsd-3-clause | mkCbranch :: CmmExpr -> BlockId -> BlockId -> CmmAGraph
mkCbranch pred ifso ifnot = mkLast (CmmCondBranch pred ifso ifnot) | 128 | mkCbranch :: CmmExpr -> BlockId -> BlockId -> CmmAGraph
mkCbranch pred ifso ifnot = mkLast (CmmCondBranch pred ifso ifnot) | 128 | mkCbranch pred ifso ifnot = mkLast (CmmCondBranch pred ifso ifnot) | 66 | false | true | 0 | 7 | 24 | 48 | 22 | 26 | null | null |
fmapfmapfmap/amazonka | amazonka-emr/gen/Network/AWS/EMR/ListBootstrapActions.hs | mpl-2.0 | -- | The pagination token that indicates the next set of results to retrieve
-- .
lbarsMarker :: Lens' ListBootstrapActionsResponse (Maybe Text)
lbarsMarker = lens _lbarsMarker (\ s a -> s{_lbarsMarker = a}) | 207 | lbarsMarker :: Lens' ListBootstrapActionsResponse (Maybe Text)
lbarsMarker = lens _lbarsMarker (\ s a -> s{_lbarsMarker = a}) | 125 | lbarsMarker = lens _lbarsMarker (\ s a -> s{_lbarsMarker = a}) | 62 | true | true | 1 | 9 | 32 | 50 | 26 | 24 | null | null |
charliebevis/modernStandard | src/Modern.hs | bsd-3-clause | firstTwo :: [Int] -> (Int, Int)
firstTwo (a:b:xs) = (a,b) | 57 | firstTwo :: [Int] -> (Int, Int)
firstTwo (a:b:xs) = (a,b) | 57 | firstTwo (a:b:xs) = (a,b) | 25 | false | true | 0 | 8 | 9 | 44 | 25 | 19 | null | null |
ssaavedra/liquidhaskell | benchmarks/vector-0.10.0.1/Data/Vector/Storable/Mutable.hs | bsd-3-clause | drop = G.drop | 13 | drop = G.drop | 13 | drop = G.drop | 13 | false | false | 0 | 5 | 2 | 8 | 4 | 4 | null | null |
C-Elegans/linear | Type.hs | mit | isConstr _ = False | 18 | isConstr _ = False | 18 | isConstr _ = False | 18 | false | false | 0 | 4 | 3 | 10 | 4 | 6 | null | null |
kylcarte/lnfunctors | src/Control/LnMonad.hs | bsd-3-clause | mzero :: (LnMonadPlus f, Init f i i) => f i i a
mzero = lzero | 61 | mzero :: (LnMonadPlus f, Init f i i) => f i i a
mzero = lzero | 61 | mzero = lzero | 13 | false | true | 0 | 6 | 15 | 37 | 19 | 18 | null | null |
nilcons/nc-indicators | nc-indicators.hs | apache-2.0 | replaceTMVar :: TMVar a -> a -> STM ()
replaceTMVar var v = tryTakeTMVar var >> putTMVar var v | 94 | replaceTMVar :: TMVar a -> a -> STM ()
replaceTMVar var v = tryTakeTMVar var >> putTMVar var v | 94 | replaceTMVar var v = tryTakeTMVar var >> putTMVar var v | 55 | false | true | 2 | 9 | 18 | 49 | 21 | 28 | null | null |
eazy-f/yahui | src/Yahui.hs | bsd-3-clause | runNextCmd :: ErrorT String ImapSrv ()
runNextCmd = do
cmd <- readCmd
runCmd cmd
readNewLine
return () | 110 | runNextCmd :: ErrorT String ImapSrv ()
runNextCmd = do
cmd <- readCmd
runCmd cmd
readNewLine
return () | 110 | runNextCmd = do
cmd <- readCmd
runCmd cmd
readNewLine
return () | 71 | false | true | 0 | 8 | 24 | 44 | 19 | 25 | null | null |
lih/Epsilon | src/Model.hs | bsd-3-clause | -- |The index of the current node
selection = mkHookVar ((0,[]) :: (Int,[Int])) | 79 | selection = mkHookVar ((0,[]) :: (Int,[Int])) | 45 | selection = mkHookVar ((0,[]) :: (Int,[Int])) | 45 | true | false | 1 | 8 | 12 | 36 | 20 | 16 | null | null |
abuiles/turbinado-blog | tmp/dependencies/hsx-0.4.5/src/HSX/Transform.hs | bsd-3-clause | runMatch_name, baseMatch_name, manyMatch_name, gManyMatch_name :: HsName
runMatch_name = HsIdent "runMatch" | 107 | runMatch_name, baseMatch_name, manyMatch_name, gManyMatch_name :: HsName
runMatch_name = HsIdent "runMatch" | 107 | runMatch_name = HsIdent "runMatch" | 34 | false | true | 5 | 5 | 9 | 32 | 13 | 19 | null | null |
sethfowler/pygmalion | indexers/Pygmalion/Index/Source.hs | bsd-3-clause | toSourceKind C.Cursor_CaseStmt = CaseStmt | 67 | toSourceKind C.Cursor_CaseStmt = CaseStmt | 67 | toSourceKind C.Cursor_CaseStmt = CaseStmt | 67 | false | false | 0 | 6 | 29 | 11 | 5 | 6 | null | null |
spechub/Hets | Common/MathLink.hs | gpl-2.0 | liftMLIO :: (MLINK -> IO b) -> ML b
liftMLIO f = askMLink >>= liftIO . f | 72 | liftMLIO :: (MLINK -> IO b) -> ML b
liftMLIO f = askMLink >>= liftIO . f | 72 | liftMLIO f = askMLink >>= liftIO . f | 36 | false | true | 0 | 8 | 16 | 39 | 19 | 20 | null | null |
gneuvill/haskell-exos | src/Week5/StackVM.hs | bsd-3-clause | execute (_:_:_) (And:_) = errType "And" | 59 | execute (_:_:_) (And:_) = errType "And" | 59 | execute (_:_:_) (And:_) = errType "And" | 59 | false | false | 0 | 8 | 25 | 32 | 16 | 16 | null | null |
vikraman/ghc | compiler/prelude/THNames.hs | bsd-3-clause | openTypeFamilyDIdKey = mkPreludeMiscIdUnique 337 | 53 | openTypeFamilyDIdKey = mkPreludeMiscIdUnique 337 | 53 | openTypeFamilyDIdKey = mkPreludeMiscIdUnique 337 | 53 | false | false | 0 | 5 | 8 | 9 | 4 | 5 | null | null |
christiaanb/ghc | compiler/prelude/PrelNames.hs | bsd-3-clause | rec1TyConKey = mkPreludeTyConUnique 138 | 40 | rec1TyConKey = mkPreludeTyConUnique 138 | 40 | rec1TyConKey = mkPreludeTyConUnique 138 | 40 | false | false | 0 | 5 | 4 | 9 | 4 | 5 | null | null |
gitjonathan/agile | agile.hs | mit | taskShow :: IO ()
taskShow = do
contents <- readFile ".agile/tasks"
let todoTasks = lines contents
numberedTasks = zipWith (\n line -> show n ++ " - " ++ line) [0..] todoTasks
putStr $ unlines numberedTasks
--
-- Exception Handler
-- | 263 | taskShow :: IO ()
taskShow = do
contents <- readFile ".agile/tasks"
let todoTasks = lines contents
numberedTasks = zipWith (\n line -> show n ++ " - " ++ line) [0..] todoTasks
putStr $ unlines numberedTasks
--
-- Exception Handler
-- | 263 | taskShow = do
contents <- readFile ".agile/tasks"
let todoTasks = lines contents
numberedTasks = zipWith (\n line -> show n ++ " - " ++ line) [0..] todoTasks
putStr $ unlines numberedTasks
--
-- Exception Handler
-- | 245 | false | true | 0 | 15 | 70 | 87 | 43 | 44 | null | null |
brendanhay/gogol | gogol-sqladmin/gen/Network/Google/Resource/SQL/Connect/Get.hs | mpl-2.0 | -- | OAuth access token.
cgAccessToken :: Lens' ConnectGet (Maybe Text)
cgAccessToken
= lens _cgAccessToken
(\ s a -> s{_cgAccessToken = a}) | 148 | cgAccessToken :: Lens' ConnectGet (Maybe Text)
cgAccessToken
= lens _cgAccessToken
(\ s a -> s{_cgAccessToken = a}) | 123 | cgAccessToken
= lens _cgAccessToken
(\ s a -> s{_cgAccessToken = a}) | 76 | true | true | 0 | 9 | 29 | 48 | 25 | 23 | null | null |
AlexeyRaga/eta | compiler/ETA/CodeGen/Types.hs | bsd-3-clause | getJavaInfo :: DynFlags -> CgIdInfo -> (Text, Text, Text)
getJavaInfo dflags CgIdInfo { cgLocation, cgLambdaForm }
= (modClass, clName, clClass)
where (modClass, clName) = splitStaticLoc cgLocation
-- TODO: Reduce duplication
clClass = fromMaybe (qualifiedName modClass clName)
$ maybeDataConClass dflags cgLambdaForm | 365 | getJavaInfo :: DynFlags -> CgIdInfo -> (Text, Text, Text)
getJavaInfo dflags CgIdInfo { cgLocation, cgLambdaForm }
= (modClass, clName, clClass)
where (modClass, clName) = splitStaticLoc cgLocation
-- TODO: Reduce duplication
clClass = fromMaybe (qualifiedName modClass clName)
$ maybeDataConClass dflags cgLambdaForm | 365 | getJavaInfo dflags CgIdInfo { cgLocation, cgLambdaForm }
= (modClass, clName, clClass)
where (modClass, clName) = splitStaticLoc cgLocation
-- TODO: Reduce duplication
clClass = fromMaybe (qualifiedName modClass clName)
$ maybeDataConClass dflags cgLambdaForm | 307 | false | true | 0 | 8 | 87 | 95 | 51 | 44 | null | null |
jsavatgy/hatupist | code/helperCanvas.hs | gpl-2.0 | red = (1.000, 0.200, 0.400) | 30 | red = (1.000, 0.200, 0.400) | 30 | red = (1.000, 0.200, 0.400) | 30 | false | false | 0 | 5 | 7 | 15 | 9 | 6 | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.