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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
spinda/liquidhaskell | src/Language/Haskell/Liquid/Desugar710/Check.hs | bsd-3-clause | remove_var :: (EqnNo, EquationInfo) -> (EqnNo, EquationInfo)
remove_var (n, eqn@(EqnInfo { eqn_pats = WildPat _ : ps})) = (n, eqn { eqn_pats = ps }) | 148 | remove_var :: (EqnNo, EquationInfo) -> (EqnNo, EquationInfo)
remove_var (n, eqn@(EqnInfo { eqn_pats = WildPat _ : ps})) = (n, eqn { eqn_pats = ps }) | 148 | remove_var (n, eqn@(EqnInfo { eqn_pats = WildPat _ : ps})) = (n, eqn { eqn_pats = ps }) | 87 | false | true | 0 | 13 | 24 | 72 | 42 | 30 | null | null |
tabemann/amphibian | src/Network/IRC/Client/Amphibian/IRCConnection.hs | bsd-3-clause | ircConnectionStateOfConnectionState (ConnectionSendError failure) =
IRCConnectionSendError failure | 100 | ircConnectionStateOfConnectionState (ConnectionSendError failure) =
IRCConnectionSendError failure | 100 | ircConnectionStateOfConnectionState (ConnectionSendError failure) =
IRCConnectionSendError failure | 100 | false | false | 0 | 7 | 7 | 18 | 8 | 10 | null | null |
davideGiovannini/scheme-repl | test/TestParsing.hs | bsd-3-clause | parser :: String -> String -> Result
parser = P.parse parseExpr | 63 | parser :: String -> String -> Result
parser = P.parse parseExpr | 63 | parser = P.parse parseExpr | 26 | false | true | 0 | 8 | 10 | 31 | 13 | 18 | null | null |
ekmett/hadoom | Geometry.hs | bsd-3-clause | triangleArea :: Fractional a => V2 a -> V2 a -> V2 a -> a
triangleArea a b c =
let toV3 (V2 x y) = V3 x y 1
det =
det33 (V3 (toV3 a)
(toV3 b)
(toV3 c))
in 0.5 * det | 218 | triangleArea :: Fractional a => V2 a -> V2 a -> V2 a -> a
triangleArea a b c =
let toV3 (V2 x y) = V3 x y 1
det =
det33 (V3 (toV3 a)
(toV3 b)
(toV3 c))
in 0.5 * det | 218 | triangleArea a b c =
let toV3 (V2 x y) = V3 x y 1
det =
det33 (V3 (toV3 a)
(toV3 b)
(toV3 c))
in 0.5 * det | 160 | false | true | 1 | 13 | 97 | 122 | 55 | 67 | null | null |
olsner/ghc | testsuite/tests/gadt/Nilsson.hs | bsd-3-clause | fdComp fd1 FDI = fd1 | 34 | fdComp fd1 FDI = fd1 | 34 | fdComp fd1 FDI = fd1 | 34 | false | false | 1 | 5 | 18 | 16 | 5 | 11 | null | null |
beni55/haste-compiler | libraries/ghc-7.10/ghc-prim/GHC/Prim.hs | bsd-3-clause | -- | Read a vector from specified index of immutable array.
indexInt16X16Array# :: ByteArray# -> Int# -> Int16X16#
indexInt16X16Array# = let x = x in x | 153 | indexInt16X16Array# :: ByteArray# -> Int# -> Int16X16#
indexInt16X16Array# = let x = x in x | 91 | indexInt16X16Array# = let x = x in x | 36 | true | true | 0 | 8 | 27 | 38 | 17 | 21 | null | null |
shlevy/ghc | compiler/coreSyn/CoreFVs.hs | bsd-3-clause | bndrRuleAndUnfoldingVarsDSet :: Id -> DVarSet
bndrRuleAndUnfoldingVarsDSet id = fvDVarSet $ bndrRuleAndUnfoldingFVs id | 118 | bndrRuleAndUnfoldingVarsDSet :: Id -> DVarSet
bndrRuleAndUnfoldingVarsDSet id = fvDVarSet $ bndrRuleAndUnfoldingFVs id | 118 | bndrRuleAndUnfoldingVarsDSet id = fvDVarSet $ bndrRuleAndUnfoldingFVs id | 72 | false | true | 0 | 6 | 11 | 25 | 12 | 13 | null | null |
cdxr/haskell-interface | src/Data/Interface/Type/Env.hs | bsd-3-clause | -- | Apply the given transformation to the corresponding module map.
-- If there is no map for that module, it is created.
updateModule ::
ModuleName ->
(NameMap TypeCon -> NameMap TypeCon) ->
TypeEnv -> TypeEnv
updateModule modName f =
TypeEnv . Map.alter (Just . f . fromMaybe emptyNameMap) modName . typeEnvMap | 329 | updateModule ::
ModuleName ->
(NameMap TypeCon -> NameMap TypeCon) ->
TypeEnv -> TypeEnv
updateModule modName f =
TypeEnv . Map.alter (Just . f . fromMaybe emptyNameMap) modName . typeEnvMap | 206 | updateModule modName f =
TypeEnv . Map.alter (Just . f . fromMaybe emptyNameMap) modName . typeEnvMap | 105 | true | true | 1 | 10 | 67 | 80 | 37 | 43 | null | null |
DarrenMowat/blackbox | src/Function/TypeLineInsert.hs | unlicense | insertType :: FilePath -> FilePath -> [Tok] -> [[Tok]] -> IO [[Tok]]
insertType ghci file line tokens = do
let (filePath, fileName) = splitPath file
-- 1) Extract Function Name from line
case extractFunctionNameFromLine line of
Nothing -> return tokens
Just fnName -> do
let (str, fn, end) = extractFunction fnName tokens
fn <- ensureFunctionHasType ghci fnName fn file
let fn2 = deleteFirstTokenOcc tlIdentifier fn
return (str ++ fn2 ++ end)
{-|
Make sure that the set of tokens for the function passed in contains a
high level type line.
If it doesn't attempt to get one from GHCI
-} | 652 | insertType :: FilePath -> FilePath -> [Tok] -> [[Tok]] -> IO [[Tok]]
insertType ghci file line tokens = do
let (filePath, fileName) = splitPath file
-- 1) Extract Function Name from line
case extractFunctionNameFromLine line of
Nothing -> return tokens
Just fnName -> do
let (str, fn, end) = extractFunction fnName tokens
fn <- ensureFunctionHasType ghci fnName fn file
let fn2 = deleteFirstTokenOcc tlIdentifier fn
return (str ++ fn2 ++ end)
{-|
Make sure that the set of tokens for the function passed in contains a
high level type line.
If it doesn't attempt to get one from GHCI
-} | 652 | insertType ghci file line tokens = do
let (filePath, fileName) = splitPath file
-- 1) Extract Function Name from line
case extractFunctionNameFromLine line of
Nothing -> return tokens
Just fnName -> do
let (str, fn, end) = extractFunction fnName tokens
fn <- ensureFunctionHasType ghci fnName fn file
let fn2 = deleteFirstTokenOcc tlIdentifier fn
return (str ++ fn2 ++ end)
{-|
Make sure that the set of tokens for the function passed in contains a
high level type line.
If it doesn't attempt to get one from GHCI
-} | 583 | false | true | 0 | 13 | 166 | 174 | 85 | 89 | null | null |
scottgw/eiffel-typecheck | Language/Eiffel/TypeCheck/Context.hs | bsd-3-clause | throwErrorPos :: String -> TypingBodyExpr body expr a
throwErrorPos e = do
p <- currentPos
throwError (e ++ " @ " ++ show p) | 128 | throwErrorPos :: String -> TypingBodyExpr body expr a
throwErrorPos e = do
p <- currentPos
throwError (e ++ " @ " ++ show p) | 128 | throwErrorPos e = do
p <- currentPos
throwError (e ++ " @ " ++ show p) | 74 | false | true | 0 | 10 | 27 | 52 | 24 | 28 | null | null |
ghc-android/ghc | compiler/ghci/ByteCodeGen.hs | bsd-3-clause | getCurrentModule :: BcM Module
getCurrentModule = BcM $ \st -> return (st, thisModule st) | 89 | getCurrentModule :: BcM Module
getCurrentModule = BcM $ \st -> return (st, thisModule st) | 89 | getCurrentModule = BcM $ \st -> return (st, thisModule st) | 58 | false | true | 2 | 7 | 13 | 42 | 19 | 23 | null | null |
ocramz/petsc-hs | src/Numerical/PETSc/Internal/InlineC.hs | gpl-3.0 | -- PetscErrorCode EPSGetEigenvector(EPS eps,PetscInt i,Vec Vr,Vec Vi)
-- Logically Collective on EPS
-- Input Parameters :
-- eps - eigensolver context
-- i - index of the solution
-- Output Parameters :
-- Vr - real part of eigenvector
-- Vi - imaginary part of eigenvector
-- Notes :
-- The caller must provide valid Vec objects, i.e., they must be created by the calling program with e.g. MatCreateVecs().
-- If the corresponding eigenvalue is real, then Vi is set to zero. If PETSc is configured with complex scalars the eigenvector is stored directly in Vr (Vi is set to zero). In both cases, the user can pass NULL in Vi.
epsGetEigenvector' :: EPS -> PetscInt_ -> Vec -> Vec -> IO CInt
epsGetEigenvector' eps ii vr vi =
[C.exp|int{EPSGetEigenvector($(EPS eps),$(PetscInt ii),$(Vec vr),$(Vec vi))}|] | 810 | epsGetEigenvector' :: EPS -> PetscInt_ -> Vec -> Vec -> IO CInt
epsGetEigenvector' eps ii vr vi =
[C.exp|int{EPSGetEigenvector($(EPS eps),$(PetscInt ii),$(Vec vr),$(Vec vi))}|] | 178 | epsGetEigenvector' eps ii vr vi =
[C.exp|int{EPSGetEigenvector($(EPS eps),$(PetscInt ii),$(Vec vr),$(Vec vi))}|] | 114 | true | true | 0 | 9 | 139 | 56 | 35 | 21 | null | null |
KrzyStar/binary-low-level | src/Data/Binary/Strict/Get.hs | bsd-3-clause | shiftl_w32 (W32# w) (I# i) = W32# (w `uncheckedShiftL#` i) | 60 | shiftl_w32 (W32# w) (I# i) = W32# (w `uncheckedShiftL#` i) | 60 | shiftl_w32 (W32# w) (I# i) = W32# (w `uncheckedShiftL#` i) | 60 | false | false | 0 | 6 | 11 | 37 | 18 | 19 | null | null |
ptitfred/ftv-vods | src/GoogleAPIsClient/Secrets.hs | bsd-3-clause | openSession :: Client -> IO ObjectPath
openSession client = do
reply <- call_ client (methodCall "/org/freedesktop/secrets" "org.freedesktop.Secret.Service" "OpenSession")
{ methodCallDestination = Just "org.freedesktop.secrets"
, methodCallBody = [toVariant ("plain" :: String), toVariant (toVariant ("" :: String))]
}
return $ fromJust $ fromVariant $ methodReturnBody reply !! 1 | 397 | openSession :: Client -> IO ObjectPath
openSession client = do
reply <- call_ client (methodCall "/org/freedesktop/secrets" "org.freedesktop.Secret.Service" "OpenSession")
{ methodCallDestination = Just "org.freedesktop.secrets"
, methodCallBody = [toVariant ("plain" :: String), toVariant (toVariant ("" :: String))]
}
return $ fromJust $ fromVariant $ methodReturnBody reply !! 1 | 397 | openSession client = do
reply <- call_ client (methodCall "/org/freedesktop/secrets" "org.freedesktop.Secret.Service" "OpenSession")
{ methodCallDestination = Just "org.freedesktop.secrets"
, methodCallBody = [toVariant ("plain" :: String), toVariant (toVariant ("" :: String))]
}
return $ fromJust $ fromVariant $ methodReturnBody reply !! 1 | 358 | false | true | 0 | 15 | 61 | 112 | 57 | 55 | null | null |
ghcjs/ghcjs-base | test/Tests/Properties/Numeric.hs | mit | j_hexadecimal_int16 (a::Int16) = j_hex a | 40 | j_hexadecimal_int16 (a::Int16) = j_hex a | 40 | j_hexadecimal_int16 (a::Int16) = j_hex a | 40 | false | false | 0 | 7 | 4 | 19 | 9 | 10 | null | null |
rdnetto/persistent | persistent-test/src/DataTypeTest.hs | mit | asIO :: IO a -> IO a
asIO = id | 30 | asIO :: IO a -> IO a
asIO = id | 30 | asIO = id | 9 | false | true | 0 | 6 | 9 | 21 | 10 | 11 | null | null |
graninas/ICFPC2007 | Endo/Application/Game/Engine/Core.hs | gpl-3.0 | quitWith = inhibit | 18 | quitWith = inhibit | 18 | quitWith = inhibit | 18 | false | false | 0 | 4 | 2 | 6 | 3 | 3 | null | null |
Balletie/.xmonad | lib/XMobar.hs | unlicense | greenColor = xmobarColor C.green "" | 35 | greenColor = xmobarColor C.green "" | 35 | greenColor = xmobarColor C.green "" | 35 | false | false | 0 | 6 | 4 | 13 | 6 | 7 | null | null |
brendanhay/gogol | gogol-games-management/gen/Network/Google/Resource/GamesManagement/Achievements/ResetAll.hs | mpl-2.0 | -- | Legacy upload protocol for media (e.g. \"media\", \"multipart\").
araUploadType :: Lens' AchievementsResetAll (Maybe Text)
araUploadType
= lens _araUploadType
(\ s a -> s{_araUploadType = a}) | 204 | araUploadType :: Lens' AchievementsResetAll (Maybe Text)
araUploadType
= lens _araUploadType
(\ s a -> s{_araUploadType = a}) | 133 | araUploadType
= lens _araUploadType
(\ s a -> s{_araUploadType = a}) | 76 | true | true | 1 | 9 | 34 | 52 | 25 | 27 | null | null |
chemist/highlighter | src/Text/Highlighter/Lexers/CommonLisp.hs | bsd-3-clause | lexer :: Lexer
lexer = Lexer
{ lName = "Common Lisp"
, lAliases = ["common-lisp", "cl"]
, lExtensions = [".cl", ".lisp", ".el"]
, lMimetypes = ["text/x-common-lisp"]
, lStart = root'
, lFlags = [caseless, multiline]
} | 245 | lexer :: Lexer
lexer = Lexer
{ lName = "Common Lisp"
, lAliases = ["common-lisp", "cl"]
, lExtensions = [".cl", ".lisp", ".el"]
, lMimetypes = ["text/x-common-lisp"]
, lStart = root'
, lFlags = [caseless, multiline]
} | 245 | lexer = Lexer
{ lName = "Common Lisp"
, lAliases = ["common-lisp", "cl"]
, lExtensions = [".cl", ".lisp", ".el"]
, lMimetypes = ["text/x-common-lisp"]
, lStart = root'
, lFlags = [caseless, multiline]
} | 230 | false | true | 0 | 8 | 63 | 83 | 49 | 34 | null | null |
gridaphobe/target | test/MapTest.hs | mit | intersection_bad :: Ord k => Map k a -> Map k b -> Map k a
intersection_bad Tip _ = Tip | 87 | intersection_bad :: Ord k => Map k a -> Map k b -> Map k a
intersection_bad Tip _ = Tip | 87 | intersection_bad Tip _ = Tip | 28 | false | true | 0 | 8 | 20 | 46 | 21 | 25 | null | null |
cohama/twittermonad | src/TwitterMonad/OAuth.hs | mit | createSignatureBaseString :: Reader AuthParams BS.ByteString
createSignatureBaseString =
BS.intercalate "&" . map urlEncodeBS <$> sequence [BS.pack <$> asks authHttpMethod, BS.pack <$> asks authUrl, createParameter] | 219 | createSignatureBaseString :: Reader AuthParams BS.ByteString
createSignatureBaseString =
BS.intercalate "&" . map urlEncodeBS <$> sequence [BS.pack <$> asks authHttpMethod, BS.pack <$> asks authUrl, createParameter] | 219 | createSignatureBaseString =
BS.intercalate "&" . map urlEncodeBS <$> sequence [BS.pack <$> asks authHttpMethod, BS.pack <$> asks authUrl, createParameter] | 158 | false | true | 0 | 9 | 26 | 64 | 31 | 33 | null | null |
silky/csound-expression | src/Csound/Air/Wave.hs | bsd-3-clause | uramp' a = unipolar' (ramp' a) | 30 | uramp' a = unipolar' (ramp' a) | 30 | uramp' a = unipolar' (ramp' a) | 30 | false | false | 0 | 7 | 5 | 18 | 8 | 10 | null | null |
mmarx/jebediah | src/Jebediah/JACK.hs | gpl-3.0 | connectSources sources client port pns = do
let cns = intersect pns $ unPortName <$> sources
want = not . null $ cns
pn <- portName port
when want $ mapM_ (\tn -> handleExceptions $ connect client tn pn) cns | 219 | connectSources sources client port pns = do
let cns = intersect pns $ unPortName <$> sources
want = not . null $ cns
pn <- portName port
when want $ mapM_ (\tn -> handleExceptions $ connect client tn pn) cns | 219 | connectSources sources client port pns = do
let cns = intersect pns $ unPortName <$> sources
want = not . null $ cns
pn <- portName port
when want $ mapM_ (\tn -> handleExceptions $ connect client tn pn) cns | 219 | false | false | 0 | 12 | 51 | 92 | 43 | 49 | null | null |
michalkonecny/aern | aern-ivp/demos/simple-events-locate-polyint.hs | bsd-3-clause | solveHybridIVPBisect ::
(solvingInfo ~ (CF, Maybe (HybridSystemUncertainState CF), [(HybSysMode, EventInfo Fn)]))
=>
SizeLimits Fn ->
ArithInOut.RoundedRealEffortIndicator CF ->
Int ->
CF ->
Int ->
CF ->
CF ->
CF ->
Var Fn ->
HybridIVP Fn
->
(
Maybe (HybridSystemUncertainState CF)
,
BisectionInfo solvingInfo (solvingInfo, Maybe CF)
)
solveHybridIVPBisect
sizeLimits effCf substSplitSizeLimit
delta m minStepSize maxStepSize splitImprovementThreshold
t0Var
hybivp
=
result
where
result =
solveHybridIVP_UsingPicardAndEventTree_Bisect
sizeLimits effPEval effCompose effEval effInteg effInclFn effAddFn effMultFn effAddFnDom effCf
delta m t0Var minStepSize maxStepSize splitImprovementThreshold
hybivp
effCompose = effIP
effEval = (effIP, ())
effPEval = (effIP, ())
effInteg = (effIP, ())
effAddFn = effIP
effMultFn = effIP
effAddFnDom = effIP
effInclFn = effIP
effIP =
(ipolylimits_effort sizeLimits)
{
ipolyeff_cfRoundedRealEffort = effCf,
ipolyeff_evalMaxSplitSize = substSplitSizeLimit
} | 1,283 | solveHybridIVPBisect ::
(solvingInfo ~ (CF, Maybe (HybridSystemUncertainState CF), [(HybSysMode, EventInfo Fn)]))
=>
SizeLimits Fn ->
ArithInOut.RoundedRealEffortIndicator CF ->
Int ->
CF ->
Int ->
CF ->
CF ->
CF ->
Var Fn ->
HybridIVP Fn
->
(
Maybe (HybridSystemUncertainState CF)
,
BisectionInfo solvingInfo (solvingInfo, Maybe CF)
)
solveHybridIVPBisect
sizeLimits effCf substSplitSizeLimit
delta m minStepSize maxStepSize splitImprovementThreshold
t0Var
hybivp
=
result
where
result =
solveHybridIVP_UsingPicardAndEventTree_Bisect
sizeLimits effPEval effCompose effEval effInteg effInclFn effAddFn effMultFn effAddFnDom effCf
delta m t0Var minStepSize maxStepSize splitImprovementThreshold
hybivp
effCompose = effIP
effEval = (effIP, ())
effPEval = (effIP, ())
effInteg = (effIP, ())
effAddFn = effIP
effMultFn = effIP
effAddFnDom = effIP
effInclFn = effIP
effIP =
(ipolylimits_effort sizeLimits)
{
ipolyeff_cfRoundedRealEffort = effCf,
ipolyeff_evalMaxSplitSize = substSplitSizeLimit
} | 1,283 | solveHybridIVPBisect
sizeLimits effCf substSplitSizeLimit
delta m minStepSize maxStepSize splitImprovementThreshold
t0Var
hybivp
=
result
where
result =
solveHybridIVP_UsingPicardAndEventTree_Bisect
sizeLimits effPEval effCompose effEval effInteg effInclFn effAddFn effMultFn effAddFnDom effCf
delta m t0Var minStepSize maxStepSize splitImprovementThreshold
hybivp
effCompose = effIP
effEval = (effIP, ())
effPEval = (effIP, ())
effInteg = (effIP, ())
effAddFn = effIP
effMultFn = effIP
effAddFnDom = effIP
effInclFn = effIP
effIP =
(ipolylimits_effort sizeLimits)
{
ipolyeff_cfRoundedRealEffort = effCf,
ipolyeff_evalMaxSplitSize = substSplitSizeLimit
} | 870 | false | true | 0 | 19 | 412 | 287 | 154 | 133 | null | null |
WSCU/JSEuterpea | Euterpea Examples/Basics.hs | gpl-3.0 | a1 = arp (pitches bmajI) [2,2,1,0,1,1,2,3,2] [e c0, s c0, s c0]
| 64 | wa1 = arp (pitches bmajI) [2,2,1,0,1,1,2,3,2] [e c0, s c0, s c0] | 64 | wa1 = arp (pitches bmajI) [2,2,1,0,1,1,2,3,2] [e c0, s c0, s c0] | 64 | false | false | 1 | 7 | 12 | 68 | 36 | 32 | null | null |
orbitgray/ProjectEuler | haskell/013.hs | lgpl-3.0 | digits x = digits d ++ [r]
where (d,r) = quotRem x 10 | 57 | digits x = digits d ++ [r]
where (d,r) = quotRem x 10 | 57 | digits x = digits d ++ [r]
where (d,r) = quotRem x 10 | 57 | false | false | 1 | 6 | 16 | 42 | 19 | 23 | null | null |
potatosalad/cis194 | src/Cis194/Week4.hs | bsd-3-clause | avlHeight (Node h _ _ _) = h | 28 | avlHeight (Node h _ _ _) = h | 28 | avlHeight (Node h _ _ _) = h | 28 | false | false | 0 | 7 | 7 | 21 | 10 | 11 | null | null |
ComputationWithBoundedResources/tct-trs | src/Tct/Trs/Data/Symbol.hs | bsd-3-clause | mainFunction :: F
mainFunction = fun "main" | 43 | mainFunction :: F
mainFunction = fun "main" | 43 | mainFunction = fun "main" | 25 | false | true | 0 | 5 | 6 | 14 | 7 | 7 | null | null |
ghcjs/jsaddle-dom | src/JSDOM/Generated/WebKitCSSMatrix.hs | mit | -- | <https://developer.mozilla.org/en-US/docs/Web/API/WebKitCSSMatrix.m24 Mozilla WebKitCSSMatrix.m24 documentation>
setM24 :: (MonadDOM m) => WebKitCSSMatrix -> Double -> m ()
setM24 self val = liftDOM (self ^. jss "m24" (toJSVal val)) | 238 | setM24 :: (MonadDOM m) => WebKitCSSMatrix -> Double -> m ()
setM24 self val = liftDOM (self ^. jss "m24" (toJSVal val)) | 119 | setM24 self val = liftDOM (self ^. jss "m24" (toJSVal val)) | 59 | true | true | 0 | 10 | 28 | 64 | 31 | 33 | null | null |
Peaker/hssophia | Database/Sophia.hs | bsd-2-clause | cOrder LT = S.c'SPLT | 21 | cOrder LT = S.c'SPLT | 21 | cOrder LT = S.c'SPLT | 21 | false | false | 1 | 6 | 4 | 15 | 5 | 10 | null | null |
k32/QFL | tools/Lam2W.hs | unlicense | transform :: String -> IO String
transform = evalRandIO . pprint . ski2iot . lambda2ski . desugar . parseL | 106 | transform :: String -> IO String
transform = evalRandIO . pprint . ski2iot . lambda2ski . desugar . parseL | 106 | transform = evalRandIO . pprint . ski2iot . lambda2ski . desugar . parseL | 73 | false | true | 0 | 9 | 18 | 38 | 19 | 19 | null | null |
capital-match/hdo | src/Network/DO/Droplets/Net.hs | mit | waitForBoxToBeUp :: (Monad m) => Network.REST.Options -> Int -> Droplet -> RESTT m (Result Droplet)
waitForBoxToBeUp _ 0 box = return (Right box) | 149 | waitForBoxToBeUp :: (Monad m) => Network.REST.Options -> Int -> Droplet -> RESTT m (Result Droplet)
waitForBoxToBeUp _ 0 box = return (Right box) | 149 | waitForBoxToBeUp _ 0 box = return (Right box) | 49 | false | true | 0 | 11 | 26 | 62 | 31 | 31 | null | null |
tjakway/ghcjvm | compiler/types/Type.hs | bsd-3-clause | -- | Drops all non-anonymous ForAllTys
dropForAlls :: Type -> Type
dropForAlls ty | Just ty' <- coreView ty = dropForAlls ty'
| otherwise = go ty
where
go (ForAllTy (Named {}) res) = go res
go res = res
-- | Given a tycon and its arguments, filters out any invisible arguments | 324 | dropForAlls :: Type -> Type
dropForAlls ty | Just ty' <- coreView ty = dropForAlls ty'
| otherwise = go ty
where
go (ForAllTy (Named {}) res) = go res
go res = res
-- | Given a tycon and its arguments, filters out any invisible arguments | 285 | dropForAlls ty | Just ty' <- coreView ty = dropForAlls ty'
| otherwise = go ty
where
go (ForAllTy (Named {}) res) = go res
go res = res
-- | Given a tycon and its arguments, filters out any invisible arguments | 257 | true | true | 1 | 9 | 100 | 93 | 42 | 51 | null | null |
jano017/Discord.hs | examples/pingpong.hs | mit | reply :: Message -> Text -> Effect DiscordM ()
reply Message{messageChannel=chan} cont = fetch' $ CreateMessage chan cont Nothing | 129 | reply :: Message -> Text -> Effect DiscordM ()
reply Message{messageChannel=chan} cont = fetch' $ CreateMessage chan cont Nothing | 129 | reply Message{messageChannel=chan} cont = fetch' $ CreateMessage chan cont Nothing | 82 | false | true | 3 | 10 | 18 | 56 | 26 | 30 | null | null |
Southern-Exposure-Seed-Exchange/southernexposure.com | server/src/Emails/PasswordReset.hs | gpl-3.0 | getSuccess :: (String, L.Text)
getSuccess =
( "Your Password was Successfully Reset"
, renderSuccess
) | 114 | getSuccess :: (String, L.Text)
getSuccess =
( "Your Password was Successfully Reset"
, renderSuccess
) | 114 | getSuccess =
( "Your Password was Successfully Reset"
, renderSuccess
) | 83 | false | true | 0 | 6 | 26 | 25 | 15 | 10 | null | null |
fffej/HS-Poker | LookupPatternMatch.hs | bsd-3-clause | getValueFromProduct 3468 = 3160 | 31 | getValueFromProduct 3468 = 3160 | 31 | getValueFromProduct 3468 = 3160 | 31 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
snoyberg/photosorter | fay/Language/Fay/JQuery.hs | bsd-2-clause | jQueryMap :: (Double -> Element -> Fay JQuery) -> JQuery -> Fay JQuery
jQueryMap = ffi "%2['map'](%1)" | 102 | jQueryMap :: (Double -> Element -> Fay JQuery) -> JQuery -> Fay JQuery
jQueryMap = ffi "%2['map'](%1)" | 102 | jQueryMap = ffi "%2['map'](%1)" | 31 | false | true | 0 | 9 | 16 | 39 | 19 | 20 | null | null |
jdavidberger/project-euler | prob104.hs | lgpl-3.0 | isPan x = (sort x) == "123456789" | 33 | isPan x = (sort x) == "123456789" | 33 | isPan x = (sort x) == "123456789" | 33 | false | false | 2 | 6 | 6 | 26 | 10 | 16 | null | null |
kojiromike/Idris-dev | src/Idris/Error.hs | bsd-3-clause | warnDisamb ist (PPair _ _ _ x y) = warnDisamb ist x >> warnDisamb ist y | 71 | warnDisamb ist (PPair _ _ _ x y) = warnDisamb ist x >> warnDisamb ist y | 71 | warnDisamb ist (PPair _ _ _ x y) = warnDisamb ist x >> warnDisamb ist y | 71 | false | false | 0 | 7 | 15 | 40 | 18 | 22 | null | null |
sushantmahajan/programs | haskell/exam.hs | cc0-1.0 | map2 :: (a->b)->[a]->[b]
map2 f = foldr (\x xs -> f x:xs) [] | 60 | map2 :: (a->b)->[a]->[b]
map2 f = foldr (\x xs -> f x:xs) [] | 60 | map2 f = foldr (\x xs -> f x:xs) [] | 35 | false | true | 0 | 9 | 12 | 64 | 32 | 32 | null | null |
olsner/ghc | compiler/main/Plugins.hs | bsd-3-clause | defaultFrontendPlugin :: FrontendPlugin
defaultFrontendPlugin = FrontendPlugin { frontend = \_ _ -> return () } | 111 | defaultFrontendPlugin :: FrontendPlugin
defaultFrontendPlugin = FrontendPlugin { frontend = \_ _ -> return () } | 111 | defaultFrontendPlugin = FrontendPlugin { frontend = \_ _ -> return () } | 71 | false | true | 0 | 9 | 14 | 31 | 17 | 14 | null | null |
jweissman/heroes | src/Geography.hs | mit | genGeography = do
lat <- randomIO :: IO Latitude
hum <- randomIO :: IO Humidity
fs <- replicateM 4 genFeature
return (LocalGeography lat hum fs) | 169 | genGeography = do
lat <- randomIO :: IO Latitude
hum <- randomIO :: IO Humidity
fs <- replicateM 4 genFeature
return (LocalGeography lat hum fs) | 169 | genGeography = do
lat <- randomIO :: IO Latitude
hum <- randomIO :: IO Humidity
fs <- replicateM 4 genFeature
return (LocalGeography lat hum fs) | 169 | false | false | 1 | 10 | 49 | 64 | 27 | 37 | null | null |
phischu/gtk2hs | cairo/Gtk2HsSetup.hs | lgpl-3.0 | installHook :: PackageDescription -> LocalBuildInfo
-> UserHooks -> InstallFlags -> IO ()
installHook pkg_descr localbuildinfo _ flags = do
let copyFlags = defaultCopyFlags {
copyDistPref = installDistPref flags,
copyDest = toFlag NoCopyDest,
copyVerbosity = installVerbosity flags
}
install pkg_descr localbuildinfo copyFlags
let registerFlags = defaultRegisterFlags {
regDistPref = installDistPref flags,
regInPlace = installInPlace flags,
regPackageDB = installPackageDB flags,
regVerbosity = installVerbosity flags
}
when (hasLibs pkg_descr) $ register pkg_descr localbuildinfo registerFlags | 844 | installHook :: PackageDescription -> LocalBuildInfo
-> UserHooks -> InstallFlags -> IO ()
installHook pkg_descr localbuildinfo _ flags = do
let copyFlags = defaultCopyFlags {
copyDistPref = installDistPref flags,
copyDest = toFlag NoCopyDest,
copyVerbosity = installVerbosity flags
}
install pkg_descr localbuildinfo copyFlags
let registerFlags = defaultRegisterFlags {
regDistPref = installDistPref flags,
regInPlace = installInPlace flags,
regPackageDB = installPackageDB flags,
regVerbosity = installVerbosity flags
}
when (hasLibs pkg_descr) $ register pkg_descr localbuildinfo registerFlags | 844 | installHook pkg_descr localbuildinfo _ flags = do
let copyFlags = defaultCopyFlags {
copyDistPref = installDistPref flags,
copyDest = toFlag NoCopyDest,
copyVerbosity = installVerbosity flags
}
install pkg_descr localbuildinfo copyFlags
let registerFlags = defaultRegisterFlags {
regDistPref = installDistPref flags,
regInPlace = installInPlace flags,
regPackageDB = installPackageDB flags,
regVerbosity = installVerbosity flags
}
when (hasLibs pkg_descr) $ register pkg_descr localbuildinfo registerFlags | 735 | false | true | 0 | 12 | 319 | 159 | 79 | 80 | null | null |
kolmodin/cabal | Cabal/Distribution/Simple/Setup.hs | bsd-3-clause | programFlagsDescription :: ProgramConfiguration -> String
programFlagsDescription progConf =
"The flags --with-PROG and --PROG-option(s) can be used with"
++ " the following programs:"
++ (concatMap (\line -> "\n " ++ unwords line) . wrapLine 77 . sort)
[ programName prog | (prog, _) <- knownPrograms progConf ]
++ "\n" | 337 | programFlagsDescription :: ProgramConfiguration -> String
programFlagsDescription progConf =
"The flags --with-PROG and --PROG-option(s) can be used with"
++ " the following programs:"
++ (concatMap (\line -> "\n " ++ unwords line) . wrapLine 77 . sort)
[ programName prog | (prog, _) <- knownPrograms progConf ]
++ "\n" | 337 | programFlagsDescription progConf =
"The flags --with-PROG and --PROG-option(s) can be used with"
++ " the following programs:"
++ (concatMap (\line -> "\n " ++ unwords line) . wrapLine 77 . sort)
[ programName prog | (prog, _) <- knownPrograms progConf ]
++ "\n" | 279 | false | true | 6 | 13 | 64 | 92 | 44 | 48 | null | null |
brow/noise | src/Text/Noise/Compiler.hs | mit | evaluate defs (AST.PrefixOperation (AST.Operator op _) expr) =
fmap F.NumberValue $ operationFn <$> evaluateOperand defs expr
where operationFn = case op of
AST.Sub -> negate
_ -> id | 212 | evaluate defs (AST.PrefixOperation (AST.Operator op _) expr) =
fmap F.NumberValue $ operationFn <$> evaluateOperand defs expr
where operationFn = case op of
AST.Sub -> negate
_ -> id | 212 | evaluate defs (AST.PrefixOperation (AST.Operator op _) expr) =
fmap F.NumberValue $ operationFn <$> evaluateOperand defs expr
where operationFn = case op of
AST.Sub -> negate
_ -> id | 212 | false | false | 0 | 10 | 57 | 75 | 36 | 39 | null | null |
nominolo/scion | src/Scion/Ghc.hs | bsd-3-clause | ghcColToScionCol c=c | 20 | ghcColToScionCol c=c | 20 | ghcColToScionCol c=c | 20 | false | false | 0 | 5 | 1 | 9 | 4 | 5 | null | null |
ComputationWithBoundedResources/ara-inference | doc/tpdb_trs/Haskell/basic_haskell/enumFromTo_2.hs | mit | intToRatio x = CnPc (fromIntMyInt x) (fromIntMyInt (Pos (Succ Zero))) | 69 | intToRatio x = CnPc (fromIntMyInt x) (fromIntMyInt (Pos (Succ Zero))) | 69 | intToRatio x = CnPc (fromIntMyInt x) (fromIntMyInt (Pos (Succ Zero))) | 69 | false | false | 0 | 11 | 9 | 38 | 18 | 20 | null | null |
hguenther/smtlib2 | extras/composite/Language/SMTLib2/Composite/Expression.hs | gpl-3.0 | concretizeExpr arg (CompositeExpr (E.App fun args)) = do
nfun <- E.mapFunction undefined fun
nargs <- List.mapM (concretizeExpr arg) args
embed $ pure $ E.App nfun nargs | 175 | concretizeExpr arg (CompositeExpr (E.App fun args)) = do
nfun <- E.mapFunction undefined fun
nargs <- List.mapM (concretizeExpr arg) args
embed $ pure $ E.App nfun nargs | 175 | concretizeExpr arg (CompositeExpr (E.App fun args)) = do
nfun <- E.mapFunction undefined fun
nargs <- List.mapM (concretizeExpr arg) args
embed $ pure $ E.App nfun nargs | 175 | false | false | 0 | 10 | 31 | 79 | 36 | 43 | null | null |
SamirTalwar/advent-of-code | 2015/AOC_24_2.hs | mit | main = do
weights <- map read <$> lines <$> getContents
let capacity = sum weights `div` compartments
let compartments = filter ((== capacity) . sum) $ distribute weights
let passengerCompartmentPackageCount = minimum $ map length compartments
let passengerCompartments = filter (\pc -> length pc == passengerCompartmentPackageCount) compartments
let quantumEntanglements = map product passengerCompartments
let quantumEntanglement = minimum quantumEntanglements
print quantumEntanglement | 504 | main = do
weights <- map read <$> lines <$> getContents
let capacity = sum weights `div` compartments
let compartments = filter ((== capacity) . sum) $ distribute weights
let passengerCompartmentPackageCount = minimum $ map length compartments
let passengerCompartments = filter (\pc -> length pc == passengerCompartmentPackageCount) compartments
let quantumEntanglements = map product passengerCompartments
let quantumEntanglement = minimum quantumEntanglements
print quantumEntanglement | 504 | main = do
weights <- map read <$> lines <$> getContents
let capacity = sum weights `div` compartments
let compartments = filter ((== capacity) . sum) $ distribute weights
let passengerCompartmentPackageCount = minimum $ map length compartments
let passengerCompartments = filter (\pc -> length pc == passengerCompartmentPackageCount) compartments
let quantumEntanglements = map product passengerCompartments
let quantumEntanglement = minimum quantumEntanglements
print quantumEntanglement | 504 | false | false | 0 | 14 | 76 | 151 | 70 | 81 | null | null |
AndrewRademacher/stack | src/Stack/PrettyPrint.hs | bsd-3-clause | prettyWarn :: Q Exp
prettyWarn = do
loc <- location
[e| monadLoggerLog loc "" LevelWarn <=< displayAnsiIfPossible |] | 124 | prettyWarn :: Q Exp
prettyWarn = do
loc <- location
[e| monadLoggerLog loc "" LevelWarn <=< displayAnsiIfPossible |] | 124 | prettyWarn = do
loc <- location
[e| monadLoggerLog loc "" LevelWarn <=< displayAnsiIfPossible |] | 104 | false | true | 0 | 7 | 25 | 28 | 15 | 13 | null | null |
roberth/uu-helium | test/simple/benchmarks/Main.hs | gpl-3.0 | - ;
eqLex Lequals Lequals = True | 34 | eqLex Lequals Lequals = True | 28 | eqLex Lequals Lequals = True | 28 | true | false | 0 | 5 | 8 | 17 | 8 | 9 | null | null |
robdockins/orlin | src/Orlin/PureTypeSys.hs | bsd-2-clause | checkProdRel :: Pn -> Sort -> Sort -> Sort -> TC CSet
checkProdRel pn s1 s2 s3 =
do unifySort pn s2 s3
join (pure check <*> getSort s1 <*> getSort s2)
where
check s1@(SEVar _) s2@(SEVar _) = return $ Set.singleton (CProdRel pn s1 s2 s2)
check SType s2 = unifySort pn s2 SType
check SUnit s2 = unifySort pn s2 SType
check SKind SType = return $ Set.empty
check SKind SUnit = lift $ errMsg pn $ "units may not depend on types"
check s1 SKind = unifySort pn s1 SKind
check s1 SUnit = unifySort pn s1 SUnit
check s1 s2 = return $ Set.singleton (CProdRel pn s1 s2 s2) | 616 | checkProdRel :: Pn -> Sort -> Sort -> Sort -> TC CSet
checkProdRel pn s1 s2 s3 =
do unifySort pn s2 s3
join (pure check <*> getSort s1 <*> getSort s2)
where
check s1@(SEVar _) s2@(SEVar _) = return $ Set.singleton (CProdRel pn s1 s2 s2)
check SType s2 = unifySort pn s2 SType
check SUnit s2 = unifySort pn s2 SType
check SKind SType = return $ Set.empty
check SKind SUnit = lift $ errMsg pn $ "units may not depend on types"
check s1 SKind = unifySort pn s1 SKind
check s1 SUnit = unifySort pn s1 SUnit
check s1 s2 = return $ Set.singleton (CProdRel pn s1 s2 s2) | 616 | checkProdRel pn s1 s2 s3 =
do unifySort pn s2 s3
join (pure check <*> getSort s1 <*> getSort s2)
where
check s1@(SEVar _) s2@(SEVar _) = return $ Set.singleton (CProdRel pn s1 s2 s2)
check SType s2 = unifySort pn s2 SType
check SUnit s2 = unifySort pn s2 SType
check SKind SType = return $ Set.empty
check SKind SUnit = lift $ errMsg pn $ "units may not depend on types"
check s1 SKind = unifySort pn s1 SKind
check s1 SUnit = unifySort pn s1 SUnit
check s1 s2 = return $ Set.singleton (CProdRel pn s1 s2 s2) | 562 | false | true | 0 | 11 | 166 | 264 | 125 | 139 | null | null |
cbpark/hep-kinematics | src/HEP/Kinematics/TwoBody.hs | bsd-3-clause | mandelstamS :: TwoBodyEvent -> Double
mandelstamS TwoBodyEvent { scale = s } = s * s | 84 | mandelstamS :: TwoBodyEvent -> Double
mandelstamS TwoBodyEvent { scale = s } = s * s | 84 | mandelstamS TwoBodyEvent { scale = s } = s * s | 46 | false | true | 0 | 8 | 15 | 31 | 16 | 15 | null | null |
batterseapower/chsc | Supercompile/Match.hs | bsd-3-clause | matchInAlts :: IdSupply -> In [AnnedAlt] -> In [AnnedAlt] -> Match [(Var, Var)]
matchInAlts ids (rn_l, alts_l) (rn_r, alts_r) = fmap concat $ zipWithEqualM (matchInAlt ids) (map (rn_l,) alts_l) (map (rn_r,) alts_r) | 214 | matchInAlts :: IdSupply -> In [AnnedAlt] -> In [AnnedAlt] -> Match [(Var, Var)]
matchInAlts ids (rn_l, alts_l) (rn_r, alts_r) = fmap concat $ zipWithEqualM (matchInAlt ids) (map (rn_l,) alts_l) (map (rn_r,) alts_r) | 214 | matchInAlts ids (rn_l, alts_l) (rn_r, alts_r) = fmap concat $ zipWithEqualM (matchInAlt ids) (map (rn_l,) alts_l) (map (rn_r,) alts_r) | 134 | false | true | 0 | 10 | 31 | 110 | 59 | 51 | null | null |
robertclancy/tapl | inference/lib/Language/Inference/Pretty.hs | gpl-2.0 | prettyTerm (TmAbs x b) = text "\\" <> text x <> text "." <+> prettyTerm b | 73 | prettyTerm (TmAbs x b) = text "\\" <> text x <> text "." <+> prettyTerm b | 73 | prettyTerm (TmAbs x b) = text "\\" <> text x <> text "." <+> prettyTerm b | 73 | false | false | 0 | 8 | 15 | 41 | 18 | 23 | null | null |
brendanhay/gogol | gogol-vision/gen/Network/Google/Vision/Types/Product.hs | mpl-2.0 | -- | Fraction of importance of this salient region with respect to the
-- original image.
gcvvch1ImportanceFraction :: Lens' GoogleCloudVisionV1p3beta1CropHint (Maybe Double)
gcvvch1ImportanceFraction
= lens _gcvvch1ImportanceFraction
(\ s a -> s{_gcvvch1ImportanceFraction = a})
. mapping _Coerce | 311 | gcvvch1ImportanceFraction :: Lens' GoogleCloudVisionV1p3beta1CropHint (Maybe Double)
gcvvch1ImportanceFraction
= lens _gcvvch1ImportanceFraction
(\ s a -> s{_gcvvch1ImportanceFraction = a})
. mapping _Coerce | 221 | gcvvch1ImportanceFraction
= lens _gcvvch1ImportanceFraction
(\ s a -> s{_gcvvch1ImportanceFraction = a})
. mapping _Coerce | 136 | true | true | 1 | 8 | 49 | 59 | 29 | 30 | null | null |
TimeAttack/time-attack-server | devel.hs | mit | main :: IO ()
main = do
#ifndef mingw32_HOST_OS
_ <- installHandler sigINT (Catch $ return ()) Nothing
#endif
putStrLn "Starting devel application"
(port, app) <- getApplicationDev
forkIO $ runSettings (setPort port defaultSettings) app
loop | 262 | main :: IO ()
main = do
#ifndef mingw32_HOST_OS
_ <- installHandler sigINT (Catch $ return ()) Nothing
#endif
putStrLn "Starting devel application"
(port, app) <- getApplicationDev
forkIO $ runSettings (setPort port defaultSettings) app
loop | 262 | main = do
#ifndef mingw32_HOST_OS
_ <- installHandler sigINT (Catch $ return ()) Nothing
#endif
putStrLn "Starting devel application"
(port, app) <- getApplicationDev
forkIO $ runSettings (setPort port defaultSettings) app
loop | 248 | false | true | 0 | 12 | 55 | 86 | 41 | 45 | null | null |
chwthewke/horbits | src/horbits/Horbits/Body/Data.hs | bsd-3-clause | getAtmosphere Sarnus = mkAtmosphere 303942 1519.87500 22000 | 59 | getAtmosphere Sarnus = mkAtmosphere 303942 1519.87500 22000 | 59 | getAtmosphere Sarnus = mkAtmosphere 303942 1519.87500 22000 | 59 | false | false | 0 | 5 | 6 | 16 | 7 | 9 | null | null |
edsko/hackage-server | Distribution/Client/Mirror/Repo/Secure.hs | bsd-3-clause | downloadIndex :: Sec.Repository down
-> Sec.Cache.Cache
-> [Sec.KeyId]
-> Sec.KeyThreshold
-> MirrorSession [PkgIndexInfo]
downloadIndex rep Sec.Cache.Cache{..} rootKeys threshold =
handleChecked (mirrorError . verificationError) $
handleChecked (mirrorError . remoteError) $ do
_hasUpdates <- liftIO $ do
requiresBootstrap <- Sec.requiresBootstrap rep
when requiresBootstrap $ Sec.bootstrap rep rootKeys threshold
now <- getCurrentTime
Sec.checkForUpdates rep (Just now)
-- TODO: Is this hasUpdates values useful anywhere?
readIndex (show rep) indexPath
where
verificationError = GetEntityError EntityIndex . GetVerificationError
remoteError = GetEntityError EntityIndex . GetRemoteError
indexPath = Sec.toFilePath $
Sec.anchorCachePath cacheRoot (Sec.cacheLayoutIndexTar cacheLayout) | 932 | downloadIndex :: Sec.Repository down
-> Sec.Cache.Cache
-> [Sec.KeyId]
-> Sec.KeyThreshold
-> MirrorSession [PkgIndexInfo]
downloadIndex rep Sec.Cache.Cache{..} rootKeys threshold =
handleChecked (mirrorError . verificationError) $
handleChecked (mirrorError . remoteError) $ do
_hasUpdates <- liftIO $ do
requiresBootstrap <- Sec.requiresBootstrap rep
when requiresBootstrap $ Sec.bootstrap rep rootKeys threshold
now <- getCurrentTime
Sec.checkForUpdates rep (Just now)
-- TODO: Is this hasUpdates values useful anywhere?
readIndex (show rep) indexPath
where
verificationError = GetEntityError EntityIndex . GetVerificationError
remoteError = GetEntityError EntityIndex . GetRemoteError
indexPath = Sec.toFilePath $
Sec.anchorCachePath cacheRoot (Sec.cacheLayoutIndexTar cacheLayout) | 932 | downloadIndex rep Sec.Cache.Cache{..} rootKeys threshold =
handleChecked (mirrorError . verificationError) $
handleChecked (mirrorError . remoteError) $ do
_hasUpdates <- liftIO $ do
requiresBootstrap <- Sec.requiresBootstrap rep
when requiresBootstrap $ Sec.bootstrap rep rootKeys threshold
now <- getCurrentTime
Sec.checkForUpdates rep (Just now)
-- TODO: Is this hasUpdates values useful anywhere?
readIndex (show rep) indexPath
where
verificationError = GetEntityError EntityIndex . GetVerificationError
remoteError = GetEntityError EntityIndex . GetRemoteError
indexPath = Sec.toFilePath $
Sec.anchorCachePath cacheRoot (Sec.cacheLayoutIndexTar cacheLayout) | 753 | false | true | 0 | 14 | 232 | 227 | 109 | 118 | null | null |
samstokes/yesodoro | Model.hs | bsd-2-clause | localEndOfDay :: LocalTime -> LocalTime
localEndOfDay time = time { localTimeOfDay = TimeOfDay 23 59 59 } | 105 | localEndOfDay :: LocalTime -> LocalTime
localEndOfDay time = time { localTimeOfDay = TimeOfDay 23 59 59 } | 105 | localEndOfDay time = time { localTimeOfDay = TimeOfDay 23 59 59 } | 65 | false | true | 0 | 7 | 16 | 33 | 17 | 16 | null | null |
RossMeikleham/Idris-dev | src/IRTS/CodegenC.hs | bsd-3-clause | irts_c FUnit x = x | 18 | irts_c FUnit x = x | 18 | irts_c FUnit x = x | 18 | false | false | 0 | 5 | 4 | 11 | 5 | 6 | null | null |
ksallberg/valuecalc | Tests/QCTests.hs | unlicense | prop_fromMilDol str =
fromMilDol str == (read (beforeDot str)::Integer) * 1000000 | 83 | prop_fromMilDol str =
fromMilDol str == (read (beforeDot str)::Integer) * 1000000 | 83 | prop_fromMilDol str =
fromMilDol str == (read (beforeDot str)::Integer) * 1000000 | 83 | false | false | 2 | 7 | 12 | 37 | 17 | 20 | null | null |
ulyssesp/AoC | src/day8.hs | bsd-3-clause | parse (stripPrefix "rotate column" -> Just com) = Column (getNums com !! 0) (getNums com !! 1) | 94 | parse (stripPrefix "rotate column" -> Just com) = Column (getNums com !! 0) (getNums com !! 1) | 94 | parse (stripPrefix "rotate column" -> Just com) = Column (getNums com !! 0) (getNums com !! 1) | 94 | false | false | 0 | 8 | 16 | 48 | 22 | 26 | null | null |
codingSteve/fp101x | 20151026/lambdas.hs | cc0-1.0 | dropWhile0 :: (a->Bool) -> [a] -> [a]
dropWhile0 p (x:xs) | p x = dropWhile0 p xs
| otherwise = x : xs | 129 | dropWhile0 :: (a->Bool) -> [a] -> [a]
dropWhile0 p (x:xs) | p x = dropWhile0 p xs
| otherwise = x : xs | 128 | dropWhile0 p (x:xs) | p x = dropWhile0 p xs
| otherwise = x : xs | 90 | false | true | 1 | 10 | 49 | 75 | 36 | 39 | null | null |
dudebout/game-theoretic-learning | GTL/Game/TwoPlayer/PrisonersDilemma.hs | isc | u2 C2 C1 = 1 | 12 | u2 C2 C1 = 1 | 12 | u2 C2 C1 = 1 | 12 | false | false | 1 | 5 | 4 | 16 | 5 | 11 | null | null |
pharaun/alldice | src/Dice/PCGen.hs | apache-2.0 | roll :: Parser Dices
roll = liftM read $ option "1" (many1 digit) | 65 | roll :: Parser Dices
roll = liftM read $ option "1" (many1 digit) | 65 | roll = liftM read $ option "1" (many1 digit) | 44 | false | true | 0 | 8 | 12 | 32 | 15 | 17 | null | null |
melted/idris-java | src/IRTS/Java/JTypes.hs | bsd-3-clause | sourceTypes (LIntFloat from) = [intTyToJType from] | 50 | sourceTypes (LIntFloat from) = [intTyToJType from] | 50 | sourceTypes (LIntFloat from) = [intTyToJType from] | 50 | false | false | 0 | 6 | 5 | 22 | 10 | 12 | null | null |
crvs/scythe | src/Math/Graphs.bak.hs | bsd-3-clause | scytheDGAux :: Eq a => Graph a -- d - diagram we are applying scythe to
-> [Vertex a] -- cs - list of critical elements
-> Graph a -- the morse data of d after applying scythe with cs as critical elements
scytheDGAux d cs | length cs == (length . vertices) d = d -- this is true exactly when there are no non-critical elements left
| otherwise = let { mc = minNCritDG d cs -- find a minimal critical element
} in
scytheDGAux (
quePlayDG
d
[mc] -- the queue always starts with the new minimal critical element
(mc:cs) -- we mark mc, the new critical, element as critical
[mc] -- we also mark it so that it can not be requeued in this recursion
)
(mc:cs) | 986 | scytheDGAux :: Eq a => Graph a -- d - diagram we are applying scythe to
-> [Vertex a] -- cs - list of critical elements
-> Graph a
scytheDGAux d cs | length cs == (length . vertices) d = d -- this is true exactly when there are no non-critical elements left
| otherwise = let { mc = minNCritDG d cs -- find a minimal critical element
} in
scytheDGAux (
quePlayDG
d
[mc] -- the queue always starts with the new minimal critical element
(mc:cs) -- we mark mc, the new critical, element as critical
[mc] -- we also mark it so that it can not be requeued in this recursion
)
(mc:cs) | 912 | scytheDGAux d cs | length cs == (length . vertices) d = d -- this is true exactly when there are no non-critical elements left
| otherwise = let { mc = minNCritDG d cs -- find a minimal critical element
} in
scytheDGAux (
quePlayDG
d
[mc] -- the queue always starts with the new minimal critical element
(mc:cs) -- we mark mc, the new critical, element as critical
[mc] -- we also mark it so that it can not be requeued in this recursion
)
(mc:cs) | 736 | true | true | 0 | 12 | 464 | 138 | 71 | 67 | null | null |
ihc/futhark | src/Language/Futhark/Attributes.hs | isc | -- | Create a type name name with no qualifiers from a 'VName'.
typeName :: VName -> TypeName
typeName = typeNameFromQualName . qualName | 136 | typeName :: VName -> TypeName
typeName = typeNameFromQualName . qualName | 72 | typeName = typeNameFromQualName . qualName | 42 | true | true | 0 | 5 | 22 | 20 | 11 | 9 | null | null |
a143753/AOJ | 3125.hs | apache-2.0 | ans (a:[]) = 0 | 14 | ans (a:[]) = 0 | 14 | ans (a:[]) = 0 | 14 | false | false | 0 | 8 | 3 | 18 | 9 | 9 | null | null |
oldmanmike/ghc | compiler/main/GhcMake.hs | bsd-3-clause | unload :: HscEnv -> [Linkable] -> IO ()
unload hsc_env stable_linkables -- Unload everthing *except* 'stable_linkables'
= case ghcLink (hsc_dflags hsc_env) of
#ifdef GHCI
LinkInMemory -> Linker.unload hsc_env stable_linkables
#else
LinkInMemory -> panic "unload: no interpreter"
-- urgh. avoid warnings:
hsc_env stable_linkables
#endif
_other -> return ()
-- -----------------------------------------------------------------------------
{- |
Stability tells us which modules definitely do not need to be recompiled.
There are two main reasons for having stability:
- avoid doing a complete upsweep of the module graph in GHCi when
modules near the bottom of the tree have not changed.
- to tell GHCi when it can load object code: we can only load object code
for a module when we also load object code fo all of the imports of the
module. So we need to know that we will definitely not be recompiling
any of these modules, and we can use the object code.
The stability check is as follows. Both stableObject and
stableBCO are used during the upsweep phase later.
@
stable m = stableObject m || stableBCO m
stableObject m =
all stableObject (imports m)
&& old linkable does not exist, or is == on-disk .o
&& date(on-disk .o) > date(.hs)
stableBCO m =
all stable (imports m)
&& date(BCO) > date(.hs)
@
These properties embody the following ideas:
- if a module is stable, then:
- if it has been compiled in a previous pass (present in HPT)
then it does not need to be compiled or re-linked.
- if it has not been compiled in a previous pass,
then we only need to read its .hi file from disk and
link it to produce a 'ModDetails'.
- if a modules is not stable, we will definitely be at least
re-linking, and possibly re-compiling it during the 'upsweep'.
All non-stable modules can (and should) therefore be unlinked
before the 'upsweep'.
- Note that objects are only considered stable if they only depend
on other objects. We can't link object code against byte code.
-} | 2,240 | unload :: HscEnv -> [Linkable] -> IO ()
unload hsc_env stable_linkables -- Unload everthing *except* 'stable_linkables'
= case ghcLink (hsc_dflags hsc_env) of
#ifdef GHCI
LinkInMemory -> Linker.unload hsc_env stable_linkables
#else
LinkInMemory -> panic "unload: no interpreter"
-- urgh. avoid warnings:
hsc_env stable_linkables
#endif
_other -> return ()
-- -----------------------------------------------------------------------------
{- |
Stability tells us which modules definitely do not need to be recompiled.
There are two main reasons for having stability:
- avoid doing a complete upsweep of the module graph in GHCi when
modules near the bottom of the tree have not changed.
- to tell GHCi when it can load object code: we can only load object code
for a module when we also load object code fo all of the imports of the
module. So we need to know that we will definitely not be recompiling
any of these modules, and we can use the object code.
The stability check is as follows. Both stableObject and
stableBCO are used during the upsweep phase later.
@
stable m = stableObject m || stableBCO m
stableObject m =
all stableObject (imports m)
&& old linkable does not exist, or is == on-disk .o
&& date(on-disk .o) > date(.hs)
stableBCO m =
all stable (imports m)
&& date(BCO) > date(.hs)
@
These properties embody the following ideas:
- if a module is stable, then:
- if it has been compiled in a previous pass (present in HPT)
then it does not need to be compiled or re-linked.
- if it has not been compiled in a previous pass,
then we only need to read its .hi file from disk and
link it to produce a 'ModDetails'.
- if a modules is not stable, we will definitely be at least
re-linking, and possibly re-compiling it during the 'upsweep'.
All non-stable modules can (and should) therefore be unlinked
before the 'upsweep'.
- Note that objects are only considered stable if they only depend
on other objects. We can't link object code against byte code.
-} | 2,240 | unload hsc_env stable_linkables -- Unload everthing *except* 'stable_linkables'
= case ghcLink (hsc_dflags hsc_env) of
#ifdef GHCI
LinkInMemory -> Linker.unload hsc_env stable_linkables
#else
LinkInMemory -> panic "unload: no interpreter"
-- urgh. avoid warnings:
hsc_env stable_linkables
#endif
_other -> return ()
-- -----------------------------------------------------------------------------
{- |
Stability tells us which modules definitely do not need to be recompiled.
There are two main reasons for having stability:
- avoid doing a complete upsweep of the module graph in GHCi when
modules near the bottom of the tree have not changed.
- to tell GHCi when it can load object code: we can only load object code
for a module when we also load object code fo all of the imports of the
module. So we need to know that we will definitely not be recompiling
any of these modules, and we can use the object code.
The stability check is as follows. Both stableObject and
stableBCO are used during the upsweep phase later.
@
stable m = stableObject m || stableBCO m
stableObject m =
all stableObject (imports m)
&& old linkable does not exist, or is == on-disk .o
&& date(on-disk .o) > date(.hs)
stableBCO m =
all stable (imports m)
&& date(BCO) > date(.hs)
@
These properties embody the following ideas:
- if a module is stable, then:
- if it has been compiled in a previous pass (present in HPT)
then it does not need to be compiled or re-linked.
- if it has not been compiled in a previous pass,
then we only need to read its .hi file from disk and
link it to produce a 'ModDetails'.
- if a modules is not stable, we will definitely be at least
re-linking, and possibly re-compiling it during the 'upsweep'.
All non-stable modules can (and should) therefore be unlinked
before the 'upsweep'.
- Note that objects are only considered stable if they only depend
on other objects. We can't link object code against byte code.
-} | 2,200 | false | true | 0 | 9 | 605 | 79 | 40 | 39 | null | null |
mbakke/ganeti | src/Ganeti/Runtime.hs | bsd-2-clause | allGroups :: [GanetiGroup]
allGroups = map DaemonGroup [minBound..maxBound] ++
map ExtraGroup [minBound..maxBound] | 127 | allGroups :: [GanetiGroup]
allGroups = map DaemonGroup [minBound..maxBound] ++
map ExtraGroup [minBound..maxBound] | 127 | allGroups = map DaemonGroup [minBound..maxBound] ++
map ExtraGroup [minBound..maxBound] | 100 | false | true | 0 | 7 | 24 | 38 | 20 | 18 | null | null |
daleooo/barrelfish | hake/RuleDefs.hs | mit | options "x86_32" = X86_32.options | 33 | options "x86_32" = X86_32.options | 33 | options "x86_32" = X86_32.options | 33 | false | false | 0 | 5 | 3 | 11 | 5 | 6 | null | null |
hesselink/stack | src/Stack/Build/Execute.hs | bsd-3-clause | compareTestsComponents :: [Text] -- ^ components
-> [Text] -- ^ all test names
-> [Text] -- ^ tests to be run
compareTestsComponents [] tests = tests | 195 | compareTestsComponents :: [Text] -- ^ components
-> [Text] -- ^ all test names
-> [Text]
compareTestsComponents [] tests = tests | 174 | compareTestsComponents [] tests = tests | 39 | true | true | 0 | 7 | 71 | 38 | 22 | 16 | null | null |
awakenetworks/gRPC-haskell | core/tests/LowLevelTests.hs | apache-2.0 | testClientCompression :: TestTree
testClientCompression =
csTest' "client-only compression: no errors" client server
where
client =
TestClient (ClientConfig
"localhost"
50051
[CompressionAlgArg GrpcCompressDeflate]
Nothing
Nothing) $ \c -> do
rm <- clientRegisterMethodNormal c "/foo"
void $ clientRequest c rm 1 "hello" mempty
server = TestServer (serverConf (["/foo"],[],[],[])) $ \s -> do
let rm = head (normalMethods s)
serverHandleNormalCall s rm mempty $ \c -> do
payload c @?= "hello"
return dummyResp
return () | 681 | testClientCompression :: TestTree
testClientCompression =
csTest' "client-only compression: no errors" client server
where
client =
TestClient (ClientConfig
"localhost"
50051
[CompressionAlgArg GrpcCompressDeflate]
Nothing
Nothing) $ \c -> do
rm <- clientRegisterMethodNormal c "/foo"
void $ clientRequest c rm 1 "hello" mempty
server = TestServer (serverConf (["/foo"],[],[],[])) $ \s -> do
let rm = head (normalMethods s)
serverHandleNormalCall s rm mempty $ \c -> do
payload c @?= "hello"
return dummyResp
return () | 681 | testClientCompression =
csTest' "client-only compression: no errors" client server
where
client =
TestClient (ClientConfig
"localhost"
50051
[CompressionAlgArg GrpcCompressDeflate]
Nothing
Nothing) $ \c -> do
rm <- clientRegisterMethodNormal c "/foo"
void $ clientRequest c rm 1 "hello" mempty
server = TestServer (serverConf (["/foo"],[],[],[])) $ \s -> do
let rm = head (normalMethods s)
serverHandleNormalCall s rm mempty $ \c -> do
payload c @?= "hello"
return dummyResp
return () | 647 | false | true | 1 | 16 | 233 | 194 | 93 | 101 | null | null |
rethab/combinatorrent | src/Process/Console.hs | bsd-2-clause | start :: TMVar () -> St.StatusChannel -> SupervisorChannel -> IO ThreadId
start waitC statusC supC = do
cmdC <- readerP -- We shouldn't be doing this in the long run
wrtC <- writerP
spawnP (CF cmdC wrtC) () ({-# SCC "Console" #-}
catchP eventLoop (defaultStopHandler supC))
where
eventLoop = do
c <- asks cmdCh
o <- asks wrtCh
m <- liftIO . atomically $ readTChan c
case m of
Quit -> liftIO . atomically $ putTMVar waitC ()
Help -> liftIO . atomically $ writeTChan o helpMessage
(Unknown n) -> liftIO . atomically $ writeTChan o $ "Uknown command: " ++ n
Show -> do
v <- liftIO newEmptyTMVarIO
liftIO . atomically $ writeTChan statusC (St.RequestAllTorrents v)
sts <- liftIO . atomically $ takeTMVar v
liftIO . atomically $ writeTChan o (show sts)
eventLoop | 959 | start :: TMVar () -> St.StatusChannel -> SupervisorChannel -> IO ThreadId
start waitC statusC supC = do
cmdC <- readerP -- We shouldn't be doing this in the long run
wrtC <- writerP
spawnP (CF cmdC wrtC) () ({-# SCC "Console" #-}
catchP eventLoop (defaultStopHandler supC))
where
eventLoop = do
c <- asks cmdCh
o <- asks wrtCh
m <- liftIO . atomically $ readTChan c
case m of
Quit -> liftIO . atomically $ putTMVar waitC ()
Help -> liftIO . atomically $ writeTChan o helpMessage
(Unknown n) -> liftIO . atomically $ writeTChan o $ "Uknown command: " ++ n
Show -> do
v <- liftIO newEmptyTMVarIO
liftIO . atomically $ writeTChan statusC (St.RequestAllTorrents v)
sts <- liftIO . atomically $ takeTMVar v
liftIO . atomically $ writeTChan o (show sts)
eventLoop | 959 | start waitC statusC supC = do
cmdC <- readerP -- We shouldn't be doing this in the long run
wrtC <- writerP
spawnP (CF cmdC wrtC) () ({-# SCC "Console" #-}
catchP eventLoop (defaultStopHandler supC))
where
eventLoop = do
c <- asks cmdCh
o <- asks wrtCh
m <- liftIO . atomically $ readTChan c
case m of
Quit -> liftIO . atomically $ putTMVar waitC ()
Help -> liftIO . atomically $ writeTChan o helpMessage
(Unknown n) -> liftIO . atomically $ writeTChan o $ "Uknown command: " ++ n
Show -> do
v <- liftIO newEmptyTMVarIO
liftIO . atomically $ writeTChan statusC (St.RequestAllTorrents v)
sts <- liftIO . atomically $ takeTMVar v
liftIO . atomically $ writeTChan o (show sts)
eventLoop | 885 | false | true | 0 | 16 | 335 | 297 | 137 | 160 | null | null |
beni55/haste-compiler | libraries/ghc-7.10/base/Data/OldList.hs | bsd-3-clause | intersectBy eq xs ys = [x | x <- xs, any (eq x) ys] | 55 | intersectBy eq xs ys = [x | x <- xs, any (eq x) ys] | 55 | intersectBy eq xs ys = [x | x <- xs, any (eq x) ys] | 55 | false | false | 0 | 9 | 17 | 39 | 19 | 20 | null | null |
rzil/honours | LeavittPathAlgebras/Example13.hs | mit | testComposition = map (WLPA.convertToBasisForm weighted_example) (map composition generators)
where generators = [WLPA.AVertex "u",WLPA.AVertex "v",WLPA.AVertex "w",WLPA.AVertex "x",WLPA.AEdge "e" 1,WLPA.AEdge "e" 2,WLPA.AEdge "e" 3,WLPA.AEdge "f" 1,WLPA.AEdge "g" 1] | 268 | testComposition = map (WLPA.convertToBasisForm weighted_example) (map composition generators)
where generators = [WLPA.AVertex "u",WLPA.AVertex "v",WLPA.AVertex "w",WLPA.AVertex "x",WLPA.AEdge "e" 1,WLPA.AEdge "e" 2,WLPA.AEdge "e" 3,WLPA.AEdge "f" 1,WLPA.AEdge "g" 1] | 268 | testComposition = map (WLPA.convertToBasisForm weighted_example) (map composition generators)
where generators = [WLPA.AVertex "u",WLPA.AVertex "v",WLPA.AVertex "w",WLPA.AVertex "x",WLPA.AEdge "e" 1,WLPA.AEdge "e" 2,WLPA.AEdge "e" 3,WLPA.AEdge "f" 1,WLPA.AEdge "g" 1] | 268 | false | false | 2 | 8 | 26 | 124 | 58 | 66 | null | null |
icyfork/shellcheck | ShellCheck/Analytics.hs | gpl-3.0 | prop_getBracedReference9 = getBracedReference "foo:-bar" == "foo" | 65 | prop_getBracedReference9 = getBracedReference "foo:-bar" == "foo" | 65 | prop_getBracedReference9 = getBracedReference "foo:-bar" == "foo" | 65 | false | false | 0 | 6 | 5 | 13 | 6 | 7 | null | null |
igrep/my-text-aid-server | src/Main.hs | bsd-3-clause | createTemporaryFileForEditor :: IO (FilePath, Handle)
createTemporaryFileForEditor = do
name <- getProgName
tempDir <- getTemporaryDirectory
openBinaryTempFile tempDir name | 178 | createTemporaryFileForEditor :: IO (FilePath, Handle)
createTemporaryFileForEditor = do
name <- getProgName
tempDir <- getTemporaryDirectory
openBinaryTempFile tempDir name | 178 | createTemporaryFileForEditor = do
name <- getProgName
tempDir <- getTemporaryDirectory
openBinaryTempFile tempDir name | 124 | false | true | 0 | 7 | 22 | 42 | 20 | 22 | null | null |
mightymoose/liquidhaskell | tests/neg/meas0.hs | bsd-3-clause | prop1 = liquidAssertB (poo xs) | 30 | prop1 = liquidAssertB (poo xs) | 30 | prop1 = liquidAssertB (poo xs) | 30 | false | false | 1 | 7 | 4 | 18 | 7 | 11 | null | null |
k0001/reflex-dom | src/Reflex/Dom/Widget/Basic.hs | bsd-3-clause | getKeyEvent :: EventM UIEvent e Int
getKeyEvent = do
e <- event
liftIO $ do
which <- uiEventGetWhich e
if which /= 0 then return which else do
charCode <- uiEventGetCharCode e
if charCode /= 0 then return charCode else
uiEventGetKeyCode e | 270 | getKeyEvent :: EventM UIEvent e Int
getKeyEvent = do
e <- event
liftIO $ do
which <- uiEventGetWhich e
if which /= 0 then return which else do
charCode <- uiEventGetCharCode e
if charCode /= 0 then return charCode else
uiEventGetKeyCode e | 270 | getKeyEvent = do
e <- event
liftIO $ do
which <- uiEventGetWhich e
if which /= 0 then return which else do
charCode <- uiEventGetCharCode e
if charCode /= 0 then return charCode else
uiEventGetKeyCode e | 234 | false | true | 0 | 14 | 73 | 91 | 42 | 49 | null | null |
sdiehl/ghc | compiler/prelude/TysWiredIn.hs | bsd-3-clause | unitTyConKey :: Unique
unitTyConKey = getUnique unitTyCon | 57 | unitTyConKey :: Unique
unitTyConKey = getUnique unitTyCon | 57 | unitTyConKey = getUnique unitTyCon | 34 | false | true | 0 | 5 | 6 | 14 | 7 | 7 | null | null |
alexbiehl/postie | src/Network/Mail/Postie/Address.hs | bsd-3-clause | crlf :: Parser ()
crlf = cr >> lf >> return () | 46 | crlf :: Parser ()
crlf = cr >> lf >> return () | 46 | crlf = cr >> lf >> return () | 28 | false | true | 1 | 7 | 11 | 32 | 14 | 18 | null | null |
geophf/1HaskellADay | exercises/HAD/Y2021/M04/D28/Exercise.hs | mit | pqr = [Trend (Just 7) (Just 15) (Just 45), Trend (Just 17) (Just 14) (Just 59)] | 79 | pqr = [Trend (Just 7) (Just 15) (Just 45), Trend (Just 17) (Just 14) (Just 59)] | 79 | pqr = [Trend (Just 7) (Just 15) (Just 45), Trend (Just 17) (Just 14) (Just 59)] | 79 | false | false | 1 | 8 | 15 | 65 | 31 | 34 | null | null |
ksaveljev/hake-2 | src/Render/Fast/GLLightMapStateT.hs | bsd-3-clause | dynamicLightWidth :: Int
dynamicLightWidth = 128 | 48 | dynamicLightWidth :: Int
dynamicLightWidth = 128 | 48 | dynamicLightWidth = 128 | 23 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
k16shikano/wikipepub | QNDA/Toc.hs | mit | pSectNum :: [Header] -> S.State (Int,Int,[InTocText]) [InTocText]
chapSectNum [] = do
(_,_,result) <- get
return $ reverse result
ch | 136 | chapSectNum :: [Header] -> S.State (Int,Int,[InTocText]) [InTocText]
chapSectNum [] = do
(_,_,result) <- get
return $ reverse result | 136 | chapSectNum [] = do
(_,_,result) <- get
return $ reverse result | 67 | false | true | 0 | 8 | 22 | 74 | 39 | 35 | null | null |
Cahu/krpc-hs | src/KRPCHS/InfernalRobotics.hs | gpl-3.0 | getServoMaxPositionStreamReq :: KRPCHS.InfernalRobotics.Servo -> KRPCStreamReq (Float)
getServoMaxPositionStreamReq thisArg =
let req = makeRequest "InfernalRobotics" "Servo_get_MaxPosition" [makeArgument 0 thisArg]
in makeStream req | 242 | getServoMaxPositionStreamReq :: KRPCHS.InfernalRobotics.Servo -> KRPCStreamReq (Float)
getServoMaxPositionStreamReq thisArg =
let req = makeRequest "InfernalRobotics" "Servo_get_MaxPosition" [makeArgument 0 thisArg]
in makeStream req | 242 | getServoMaxPositionStreamReq thisArg =
let req = makeRequest "InfernalRobotics" "Servo_get_MaxPosition" [makeArgument 0 thisArg]
in makeStream req | 155 | false | true | 0 | 11 | 29 | 56 | 27 | 29 | null | null |
spechub/Hets | Logic/ExtSign.hs | gpl-2.0 | ext_induced_from_morphism :: Logic lid sublogics
basic_spec sentence symb_items symb_map_items
sign morphism symbol raw_symbol proof_tree
=> lid -> EndoMap raw_symbol -> ExtSign sign symbol
-> Result morphism
ext_induced_from_morphism l rmap (ExtSign sigma _) = do
-- first check: do all source raw symbols match with source signature?
checkRawMap l rmap sigma
mor <- induced_from_morphism l rmap sigma
legal_mor mor
return mor | 476 | ext_induced_from_morphism :: Logic lid sublogics
basic_spec sentence symb_items symb_map_items
sign morphism symbol raw_symbol proof_tree
=> lid -> EndoMap raw_symbol -> ExtSign sign symbol
-> Result morphism
ext_induced_from_morphism l rmap (ExtSign sigma _) = do
-- first check: do all source raw symbols match with source signature?
checkRawMap l rmap sigma
mor <- induced_from_morphism l rmap sigma
legal_mor mor
return mor | 476 | ext_induced_from_morphism l rmap (ExtSign sigma _) = do
-- first check: do all source raw symbols match with source signature?
checkRawMap l rmap sigma
mor <- induced_from_morphism l rmap sigma
legal_mor mor
return mor | 228 | false | true | 0 | 9 | 108 | 113 | 51 | 62 | null | null |
Peaker/lamdu | src/Lamdu/GUI/Expr/TagEdit.hs | gpl-3.0 | makeTagRefEdit :: _ => Sugar.TagRef Name i o -> GuiM env i o (M.TextWidget o)
makeTagRefEdit = makeTagRefEditWith id (const Nothing) Nothing <&> fmap snd | 153 | makeTagRefEdit :: _ => Sugar.TagRef Name i o -> GuiM env i o (M.TextWidget o)
makeTagRefEdit = makeTagRefEditWith id (const Nothing) Nothing <&> fmap snd | 153 | makeTagRefEdit = makeTagRefEditWith id (const Nothing) Nothing <&> fmap snd | 75 | false | true | 0 | 10 | 24 | 66 | 31 | 35 | null | null |
chreekat/yesod | yesod-core/Yesod/Request.hs | bsd-2-clause | lookupPostParam :: Text
-> GHandler s m (Maybe Text)
lookupPostParam = liftM listToMaybe . lookupPostParams | 123 | lookupPostParam :: Text
-> GHandler s m (Maybe Text)
lookupPostParam = liftM listToMaybe . lookupPostParams | 123 | lookupPostParam = liftM listToMaybe . lookupPostParams | 54 | false | true | 0 | 9 | 30 | 41 | 18 | 23 | null | null |
fxmy/haskell-book-exercise | src/Wat.hs | gpl-3.0 | flipMaybe (Nothing:_) = Nothing | 31 | flipMaybe (Nothing:_) = Nothing | 31 | flipMaybe (Nothing:_) = Nothing | 31 | false | false | 0 | 6 | 3 | 17 | 8 | 9 | null | null |
lawrencelomax/ResultWorthy | ResultWorthy/Renderer.hs | bsd-3-clause | condRender _ f False = f | 24 | condRender _ f False = f | 24 | condRender _ f False = f | 24 | false | false | 0 | 5 | 5 | 13 | 6 | 7 | null | null |
mcschroeder/ghc | compiler/main/DynFlags.hs | bsd-3-clause | pgm_P :: DynFlags -> (String,[Option])
pgm_P dflags = sPgm_P (settings dflags) | 94 | pgm_P :: DynFlags -> (String,[Option])
pgm_P dflags = sPgm_P (settings dflags) | 94 | pgm_P dflags = sPgm_P (settings dflags) | 39 | false | true | 0 | 9 | 26 | 38 | 19 | 19 | null | null |
brendanhay/gogol | gogol-containerbuilder/gen/Network/Google/Resource/Cloudbuild/Projects/Locations/Builds/Retry.hs | mpl-2.0 | -- | OAuth access token.
plbrAccessToken :: Lens' ProjectsLocationsBuildsRetry (Maybe Text)
plbrAccessToken
= lens _plbrAccessToken
(\ s a -> s{_plbrAccessToken = a}) | 174 | plbrAccessToken :: Lens' ProjectsLocationsBuildsRetry (Maybe Text)
plbrAccessToken
= lens _plbrAccessToken
(\ s a -> s{_plbrAccessToken = a}) | 149 | plbrAccessToken
= lens _plbrAccessToken
(\ s a -> s{_plbrAccessToken = a}) | 82 | true | true | 0 | 9 | 29 | 48 | 25 | 23 | null | null |
sleepomeno/TForth | src/TF/Parsers/OOP.hs | apache-2.0 | checkFields :: ClassName -> ClassName -> [(Variable, OOFieldSem)] -> ExpressionsM ()
checkFields newClass oldClass fields =
forM_ fields $ \(fieldName, oofieldsem) ->
case oofieldsem of
ByFieldDefinition eff -> do
oldFields <- (toListOf $ traverse._1) <$> getFieldsOfClass oldClass :: ExpressionsM [Variable]
when (fieldName `elem` oldFields) $
throwing _RedefinedField fieldName
InferredByField eff -> return () -- throwing _Impossible "Cannot be InferredByField here!" | 513 | checkFields :: ClassName -> ClassName -> [(Variable, OOFieldSem)] -> ExpressionsM ()
checkFields newClass oldClass fields =
forM_ fields $ \(fieldName, oofieldsem) ->
case oofieldsem of
ByFieldDefinition eff -> do
oldFields <- (toListOf $ traverse._1) <$> getFieldsOfClass oldClass :: ExpressionsM [Variable]
when (fieldName `elem` oldFields) $
throwing _RedefinedField fieldName
InferredByField eff -> return () -- throwing _Impossible "Cannot be InferredByField here!" | 513 | checkFields newClass oldClass fields =
forM_ fields $ \(fieldName, oofieldsem) ->
case oofieldsem of
ByFieldDefinition eff -> do
oldFields <- (toListOf $ traverse._1) <$> getFieldsOfClass oldClass :: ExpressionsM [Variable]
when (fieldName `elem` oldFields) $
throwing _RedefinedField fieldName
InferredByField eff -> return () -- throwing _Impossible "Cannot be InferredByField here!" | 428 | false | true | 0 | 16 | 102 | 146 | 74 | 72 | null | null |
gcampax/ghc | compiler/prelude/PrelNames.hs | bsd-3-clause | zipIdKey = mkPreludeMiscIdUnique 33 | 56 | zipIdKey = mkPreludeMiscIdUnique 33 | 56 | zipIdKey = mkPreludeMiscIdUnique 33 | 56 | false | false | 0 | 5 | 24 | 9 | 4 | 5 | null | null |
kim/amazonka | amazonka-support/gen/Network/AWS/Support/CreateCase.hs | mpl-2.0 | -- | The communication body text when you create an AWS Support case by calling 'CreateCase'.
ccCommunicationBody :: Lens' CreateCase Text
ccCommunicationBody =
lens _ccCommunicationBody (\s a -> s { _ccCommunicationBody = a }) | 231 | ccCommunicationBody :: Lens' CreateCase Text
ccCommunicationBody =
lens _ccCommunicationBody (\s a -> s { _ccCommunicationBody = a }) | 137 | ccCommunicationBody =
lens _ccCommunicationBody (\s a -> s { _ccCommunicationBody = a }) | 92 | true | true | 0 | 9 | 37 | 40 | 22 | 18 | null | null |
rahulmutt/ghcvm | compiler/Eta/Utils/Panic.hs | bsd-3-clause | pgmErrorDoc x doc = throwGhcException (PprProgramError x doc) | 61 | pgmErrorDoc x doc = throwGhcException (PprProgramError x doc) | 61 | pgmErrorDoc x doc = throwGhcException (PprProgramError x doc) | 61 | false | false | 1 | 7 | 7 | 26 | 10 | 16 | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.