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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
alexander-matsievsky/HackerRank | All_Domains/Functional_Programming/Recursion/src/PascalsTriangle.hs | mit | prop_run = run "4" == "1\n\
\1 1\n\
\1 2 1\n\
\1 3 3 1\n" | 57 | prop_run = run "4" == "1\n\
\1 1\n\
\1 2 1\n\
\1 3 3 1\n" | 57 | prop_run = run "4" == "1\n\
\1 1\n\
\1 2 1\n\
\1 3 3 1\n" | 57 | false | false | 2 | 5 | 14 | 20 | 7 | 13 | null | null |
raventid/coursera_learning | haskell/chapter17/worksheet.hs | mit | -- 2.
y :: Maybe Integer
y = lookup 3 $ zip [1,2,3] [4,5,6] | 59 | y :: Maybe Integer
y = lookup 3 $ zip [1,2,3] [4,5,6] | 53 | y = lookup 3 $ zip [1,2,3] [4,5,6] | 34 | true | true | 2 | 6 | 13 | 52 | 26 | 26 | null | null |
diku-dk/futhark | src/Futhark/Analysis/PrimExp.hs | isc | -- | SMax on 64-bit integers.
sMax64 :: TPrimExp Int64 v -> TPrimExp Int64 v -> TPrimExp Int64 v
sMax64 x y = TPrimExp $ BinOpExp (SMax Int64) (untyped x) (untyped y) | 166 | sMax64 :: TPrimExp Int64 v -> TPrimExp Int64 v -> TPrimExp Int64 v
sMax64 x y = TPrimExp $ BinOpExp (SMax Int64) (untyped x) (untyped y) | 136 | sMax64 x y = TPrimExp $ BinOpExp (SMax Int64) (untyped x) (untyped y) | 69 | true | true | 0 | 8 | 31 | 69 | 33 | 36 | null | null |
Lythimus/lptv | sites/all/modules/jgm-pandoc-8be6cc2/src/Text/Pandoc/Writers/MediaWiki.hs | gpl-2.0 | blockToMediaWiki opts (Header level inlines) = do
contents <- inlineListToMediaWiki opts inlines
let eqs = replicate level '='
return $ eqs ++ " " ++ contents ++ " " ++ eqs ++ "\n" | 186 | blockToMediaWiki opts (Header level inlines) = do
contents <- inlineListToMediaWiki opts inlines
let eqs = replicate level '='
return $ eqs ++ " " ++ contents ++ " " ++ eqs ++ "\n" | 186 | blockToMediaWiki opts (Header level inlines) = do
contents <- inlineListToMediaWiki opts inlines
let eqs = replicate level '='
return $ eqs ++ " " ++ contents ++ " " ++ eqs ++ "\n" | 186 | false | false | 0 | 12 | 38 | 72 | 33 | 39 | null | null |
sushantmahajan/programs | haskell/assign2.hs | cc0-1.0 | func (Fun fname argList fdef) codeTillNow = GLOBSTART fname n:(body fdef r n codeTillNow)
where
n = length argList
tupleList = foldr (\x acc -> (x, (length acc)+1):acc) [] argList
r ident = snd$head (filter (\(v,x) -> v==ident) tupleList) | 266 | func (Fun fname argList fdef) codeTillNow = GLOBSTART fname n:(body fdef r n codeTillNow)
where
n = length argList
tupleList = foldr (\x acc -> (x, (length acc)+1):acc) [] argList
r ident = snd$head (filter (\(v,x) -> v==ident) tupleList) | 266 | func (Fun fname argList fdef) codeTillNow = GLOBSTART fname n:(body fdef r n codeTillNow)
where
n = length argList
tupleList = foldr (\x acc -> (x, (length acc)+1):acc) [] argList
r ident = snd$head (filter (\(v,x) -> v==ident) tupleList) | 266 | false | false | 0 | 14 | 66 | 136 | 70 | 66 | null | null |
apyrgio/snf-ganeti | src/Ganeti/Constants.hs | bsd-2-clause | osValidateParameters :: String
osValidateParameters = "parameters" | 66 | osValidateParameters :: String
osValidateParameters = "parameters" | 66 | osValidateParameters = "parameters" | 35 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
anton-dessiatov/stack | src/Stack/Types/Config.hs | bsd-3-clause | configMonoidConcurrentTestsName :: Text
configMonoidConcurrentTestsName = "concurrent-tests" | 92 | configMonoidConcurrentTestsName :: Text
configMonoidConcurrentTestsName = "concurrent-tests" | 92 | configMonoidConcurrentTestsName = "concurrent-tests" | 52 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
pfcuttle/wirelessinfidel | Main.hs | bsd-3-clause | connect :: String -> IO ()
connect network = do
disconnectAll
system $ "wpa_supplicant -B -c /root/" ++ network ++ " -i wlan0 -D wext"
exitCode <- system "dhcpcd wlan0"
case exitCode of
ExitSuccess -> dial "Connection established."
ExitFailure _ -> dial "Connection failed."
return () | 320 | connect :: String -> IO ()
connect network = do
disconnectAll
system $ "wpa_supplicant -B -c /root/" ++ network ++ " -i wlan0 -D wext"
exitCode <- system "dhcpcd wlan0"
case exitCode of
ExitSuccess -> dial "Connection established."
ExitFailure _ -> dial "Connection failed."
return () | 320 | connect network = do
disconnectAll
system $ "wpa_supplicant -B -c /root/" ++ network ++ " -i wlan0 -D wext"
exitCode <- system "dhcpcd wlan0"
case exitCode of
ExitSuccess -> dial "Connection established."
ExitFailure _ -> dial "Connection failed."
return () | 293 | false | true | 0 | 10 | 81 | 87 | 38 | 49 | null | null |
codemac/yi-editor | src/Yi/String.hs | gpl-2.0 | -- | A helper function for creating functions suitable for
-- 'modifySelectionB' and 'modifyRegionB'.
-- To be used when the desired function should map across
-- the lines of a region.
mapLines :: (String -> String) -> String -> String
mapLines transform = onLines (fmap transform) | 282 | mapLines :: (String -> String) -> String -> String
mapLines transform = onLines (fmap transform) | 96 | mapLines transform = onLines (fmap transform) | 45 | true | true | 0 | 8 | 45 | 47 | 24 | 23 | null | null |
glguy/irc-core | src/Client/Commands/Arguments/Parser.hs | isc | argumentString :: ArgumentShape -> Parser String
argumentString TokenArgument = token | 89 | argumentString :: ArgumentShape -> Parser String
argumentString TokenArgument = token | 89 | argumentString TokenArgument = token | 40 | false | true | 0 | 7 | 13 | 26 | 11 | 15 | null | null |
haskell-opengl/OpenGLRaw | src/Graphics/GL/Functions/F23.hs | bsd-3-clause | ptr_glReplacementCodeusSUN :: FunPtr (GLushort -> IO ())
ptr_glReplacementCodeusSUN = unsafePerformIO $ getCommand "glReplacementCodeusSUN" | 139 | ptr_glReplacementCodeusSUN :: FunPtr (GLushort -> IO ())
ptr_glReplacementCodeusSUN = unsafePerformIO $ getCommand "glReplacementCodeusSUN" | 139 | ptr_glReplacementCodeusSUN = unsafePerformIO $ getCommand "glReplacementCodeusSUN" | 82 | false | true | 0 | 9 | 12 | 33 | 16 | 17 | null | null |
oldmanmike/ghc | ghc/GHCi/UI/Monad.hs | bsd-3-clause | prettyLocations locs = vcat $ map (\(i, loc) -> brackets (int i) <+> ppr loc) $ reverse $ locs | 94 | prettyLocations locs = vcat $ map (\(i, loc) -> brackets (int i) <+> ppr loc) $ reverse $ locs | 94 | prettyLocations locs = vcat $ map (\(i, loc) -> brackets (int i) <+> ppr loc) $ reverse $ locs | 94 | false | false | 0 | 14 | 18 | 54 | 27 | 27 | null | null |
haskellGardener/yusic | src/Yusic.hs | mit | toSigPitch G3 = G | 21 | toSigPitch G3 = G | 21 | toSigPitch G3 = G | 21 | false | false | 0 | 5 | 7 | 9 | 4 | 5 | null | null |
sonyandy/unvar | src/Control/Monad/Unify/Atom.hs | bsd-3-clause | semiprune :: MonadVar var m =>
Term var a -> m (Pair (SemiprunedTerm var a) (Term var a))
semiprune t0 = case t0 of
Pure a -> return $! Atom a :* t0
Wrap var0 -> fix (\ rec t var ->
readVar var >>= (return $! UnwrittenVar var :* t) `maybe` \ t' -> case t' of
Wrap var' -> do
s@(_ :* t'') <- rec t' var'
writeVar var t''
return s
Pure a -> return $! WrittenVar var a :* t) t0 var0 | 436 | semiprune :: MonadVar var m =>
Term var a -> m (Pair (SemiprunedTerm var a) (Term var a))
semiprune t0 = case t0 of
Pure a -> return $! Atom a :* t0
Wrap var0 -> fix (\ rec t var ->
readVar var >>= (return $! UnwrittenVar var :* t) `maybe` \ t' -> case t' of
Wrap var' -> do
s@(_ :* t'') <- rec t' var'
writeVar var t''
return s
Pure a -> return $! WrittenVar var a :* t) t0 var0 | 436 | semiprune t0 = case t0 of
Pure a -> return $! Atom a :* t0
Wrap var0 -> fix (\ rec t var ->
readVar var >>= (return $! UnwrittenVar var :* t) `maybe` \ t' -> case t' of
Wrap var' -> do
s@(_ :* t'') <- rec t' var'
writeVar var t''
return s
Pure a -> return $! WrittenVar var a :* t) t0 var0 | 333 | false | true | 0 | 21 | 142 | 214 | 102 | 112 | null | null |
forste/haReFork | tools/base/tests/GhcLibraries/Network.hs | bsd-3-clause | withSocketsDo :: IO a -> IO a
withSocketsDo = id | 48 | withSocketsDo :: IO a -> IO a
withSocketsDo = id | 48 | withSocketsDo = id | 18 | false | true | 0 | 6 | 9 | 21 | 10 | 11 | null | null |
brendanhay/gogol | gogol-shopping-content/gen/Network/Google/ShoppingContent/Types/Product.hs | mpl-2.0 | -- | The unit of the measure.
pupmUnit :: Lens' ProductUnitPricingMeasure (Maybe Text)
pupmUnit = lens _pupmUnit (\ s a -> s{_pupmUnit = a}) | 140 | pupmUnit :: Lens' ProductUnitPricingMeasure (Maybe Text)
pupmUnit = lens _pupmUnit (\ s a -> s{_pupmUnit = a}) | 110 | pupmUnit = lens _pupmUnit (\ s a -> s{_pupmUnit = a}) | 53 | true | true | 0 | 9 | 23 | 46 | 25 | 21 | null | null |
alang9/deque | Data/Deque/NonCat.hs | bsd-3-clause | fixup2' (BigR (XR (B1 a) (B0)) (Y1 (B1 (P s t))) LEmpty) = go3 a s t | 110 | fixup2' (BigR (XR (B1 a) (B0)) (Y1 (B1 (P s t))) LEmpty) = go3 a s t | 110 | fixup2' (BigR (XR (B1 a) (B0)) (Y1 (B1 (P s t))) LEmpty) = go3 a s t | 110 | false | false | 0 | 12 | 58 | 64 | 31 | 33 | null | null |
nicklawls/haskellbook | src/StoppingTheParty.hs | bsd-3-clause | randomException :: IO ()
randomException = do
i <- randomRIO (1, 10::Int)
if i `elem` [1..9]
then throwIO DivideByZero
else throwIO StackOverflow | 169 | randomException :: IO ()
randomException = do
i <- randomRIO (1, 10::Int)
if i `elem` [1..9]
then throwIO DivideByZero
else throwIO StackOverflow | 169 | randomException = do
i <- randomRIO (1, 10::Int)
if i `elem` [1..9]
then throwIO DivideByZero
else throwIO StackOverflow | 144 | false | true | 0 | 10 | 45 | 69 | 34 | 35 | null | null |
m-alvarez/jhc | src/Grin/Show.hs | mit | pVar' v = prettyVals v <+> operator "<- " | 42 | pVar' v = prettyVals v <+> operator "<- " | 42 | pVar' v = prettyVals v <+> operator "<- " | 42 | false | false | 0 | 6 | 9 | 19 | 8 | 11 | null | null |
GaloisInc/halvm-ghc | compiler/deSugar/DsUtils.hs | bsd-3-clause | is_flat_prod_pat (ConPatOut { pat_con = L _ pcon, pat_args = ps})
| RealDataCon con <- pcon
, isProductTyCon (dataConTyCon con)
= all is_triv_lpat (hsConPatArgs ps) | 170 | is_flat_prod_pat (ConPatOut { pat_con = L _ pcon, pat_args = ps})
| RealDataCon con <- pcon
, isProductTyCon (dataConTyCon con)
= all is_triv_lpat (hsConPatArgs ps) | 170 | is_flat_prod_pat (ConPatOut { pat_con = L _ pcon, pat_args = ps})
| RealDataCon con <- pcon
, isProductTyCon (dataConTyCon con)
= all is_triv_lpat (hsConPatArgs ps) | 170 | false | false | 0 | 10 | 30 | 71 | 33 | 38 | null | null |
rrnewton/hgdata_trash | src/Network/Google.hs | mit | toAccessToken ::
String -- ^ The string.
-> AccessToken -- ^ The OAuth 2.0 access token.
toAccessToken = BS8.pack | 127 | toAccessToken ::
String -- ^ The string.
-> AccessToken
toAccessToken = BS8.pack | 93 | toAccessToken = BS8.pack | 24 | true | true | 0 | 7 | 32 | 26 | 12 | 14 | null | null |
sherwoodwang/wxHaskell | wxcore/src/haskell/Graphics/UI/WXCore/Layout.hs | lgpl-2.1 | -- | Make the layout stretchable and align it to the bottom-right of the assigned area.
floatBottomRight :: Layout -> Layout
floatBottomRight
= stretch . alignBottomRight | 172 | floatBottomRight :: Layout -> Layout
floatBottomRight
= stretch . alignBottomRight | 84 | floatBottomRight
= stretch . alignBottomRight | 47 | true | true | 1 | 7 | 27 | 28 | 12 | 16 | null | null |
phischu/fragnix | builtins/ghc-prim/GHC.PrimopWrappers.hs | bsd-3-clause | check# :: (State# (RealWorld) -> (# State# (RealWorld),a #)) -> State# (RealWorld) -> State# (RealWorld)
check# a1 a2 = (GHC.Prim.check#) a1 a2 | 143 | check# :: (State# (RealWorld) -> (# State# (RealWorld),a #)) -> State# (RealWorld) -> State# (RealWorld)
check# a1 a2 = (GHC.Prim.check#) a1 a2 | 143 | check# a1 a2 = (GHC.Prim.check#) a1 a2 | 38 | false | true | 0 | 10 | 21 | 71 | 37 | 34 | null | null |
haskell-compat/base-compat | typediff/src/TypeDiff.hs | mit | alphaNormalize :: Type -> Type
alphaNormalize t = transformBi f t
where
f :: Name -> Name
f name = fromMaybe name $ lookup name mapping
names :: [Name]
names = (List.nub . filter isTyVar . universeBi) t
isTyVar :: Name -> Bool
isTyVar x = case x of
Ident n -> null (takeWhile isUpper n)
_ -> False
mapping :: [(Name, Name)]
mapping = zip names vars
vars :: [Name]
vars = map (Ident . ('t' :) . show) [0 :: Integer ..] | 475 | alphaNormalize :: Type -> Type
alphaNormalize t = transformBi f t
where
f :: Name -> Name
f name = fromMaybe name $ lookup name mapping
names :: [Name]
names = (List.nub . filter isTyVar . universeBi) t
isTyVar :: Name -> Bool
isTyVar x = case x of
Ident n -> null (takeWhile isUpper n)
_ -> False
mapping :: [(Name, Name)]
mapping = zip names vars
vars :: [Name]
vars = map (Ident . ('t' :) . show) [0 :: Integer ..] | 475 | alphaNormalize t = transformBi f t
where
f :: Name -> Name
f name = fromMaybe name $ lookup name mapping
names :: [Name]
names = (List.nub . filter isTyVar . universeBi) t
isTyVar :: Name -> Bool
isTyVar x = case x of
Ident n -> null (takeWhile isUpper n)
_ -> False
mapping :: [(Name, Name)]
mapping = zip names vars
vars :: [Name]
vars = map (Ident . ('t' :) . show) [0 :: Integer ..] | 444 | false | true | 2 | 10 | 141 | 234 | 110 | 124 | null | null |
ndmitchell/shake | src/Test/Ninja.hs | bsd-3-clause | main = testBuildArgs test [opts] $ \opts -> do
let real = "real" `elem` opts
action $ if real || real_ninja
then cmd "ninja" opts
else liftIO $ withArgs ("--lint":"--report=report.html":opts) Run.main | 224 | main = testBuildArgs test [opts] $ \opts -> do
let real = "real" `elem` opts
action $ if real || real_ninja
then cmd "ninja" opts
else liftIO $ withArgs ("--lint":"--report=report.html":opts) Run.main | 224 | main = testBuildArgs test [opts] $ \opts -> do
let real = "real" `elem` opts
action $ if real || real_ninja
then cmd "ninja" opts
else liftIO $ withArgs ("--lint":"--report=report.html":opts) Run.main | 224 | false | false | 0 | 15 | 54 | 84 | 43 | 41 | null | null |
coolhacks/scripts-hacks | examples/shellcheck-master/ShellCheck/Parser.hs | mit | g_Fi = tryWordToken "fi" T_Fi | 29 | g_Fi = tryWordToken "fi" T_Fi | 29 | g_Fi = tryWordToken "fi" T_Fi | 29 | false | false | 0 | 5 | 4 | 11 | 5 | 6 | null | null |
bvdelft/parac2 | src/Language/Java/Paragon/Compile.hs | bsd-3-clause | lockExpsToInit _i es = [InitDecl () True . Block () $
map (BlockStmt () . ExpStmt ()) es] | 113 | lockExpsToInit _i es = [InitDecl () True . Block () $
map (BlockStmt () . ExpStmt ()) es] | 113 | lockExpsToInit _i es = [InitDecl () True . Block () $
map (BlockStmt () . ExpStmt ()) es] | 113 | false | false | 0 | 11 | 41 | 56 | 26 | 30 | null | null |
archhaskell/archlinux-web | scripts/mypackages.hs | bsd-3-clause | main = do
packages <- maintainer me
forM_ packages $ putStrLn . packageName | 83 | main = do
packages <- maintainer me
forM_ packages $ putStrLn . packageName | 83 | main = do
packages <- maintainer me
forM_ packages $ putStrLn . packageName | 83 | false | false | 0 | 9 | 20 | 30 | 13 | 17 | null | null |
kathawala/symdiff | cublas/Foreign/CUDA/Cublas/TH.hs | gpl-3.0 | typeDat (ArbStructC str) = case str of
"cudaStream_t" -> prim [t| F.Ptr () |] [t| FC.Stream |] [| FC.Stream |] [| FC.useStream |]
_ -> let tyName = typeDefTyName str; useName = typeDefUseName str in
prim [t| F.Ptr () |] (conT tyName) (conE tyName) (varE useName) | 273 | typeDat (ArbStructC str) = case str of
"cudaStream_t" -> prim [t| F.Ptr () |] [t| FC.Stream |] [| FC.Stream |] [| FC.useStream |]
_ -> let tyName = typeDefTyName str; useName = typeDefUseName str in
prim [t| F.Ptr () |] (conT tyName) (conE tyName) (varE useName) | 273 | typeDat (ArbStructC str) = case str of
"cudaStream_t" -> prim [t| F.Ptr () |] [t| FC.Stream |] [| FC.Stream |] [| FC.useStream |]
_ -> let tyName = typeDefTyName str; useName = typeDefUseName str in
prim [t| F.Ptr () |] (conT tyName) (conE tyName) (varE useName) | 273 | false | false | 2 | 9 | 56 | 108 | 61 | 47 | null | null |
iblumenfeld/cryptol | src/Cryptol/TypeCheck/Sanity.hs | bsd-3-clause | checkDeclGroup :: DeclGroup -> TcM [(QName, Schema)]
checkDeclGroup dg =
case dg of
NonRecursive d -> do x <- checkDecl True d
return [x]
Recursive ds ->
do xs <- forM ds $ \d ->
do checkSchema (dSignature d)
return (dName d, dSignature d)
withVars xs $ mapM (checkDecl False) ds | 368 | checkDeclGroup :: DeclGroup -> TcM [(QName, Schema)]
checkDeclGroup dg =
case dg of
NonRecursive d -> do x <- checkDecl True d
return [x]
Recursive ds ->
do xs <- forM ds $ \d ->
do checkSchema (dSignature d)
return (dName d, dSignature d)
withVars xs $ mapM (checkDecl False) ds | 368 | checkDeclGroup dg =
case dg of
NonRecursive d -> do x <- checkDecl True d
return [x]
Recursive ds ->
do xs <- forM ds $ \d ->
do checkSchema (dSignature d)
return (dName d, dSignature d)
withVars xs $ mapM (checkDecl False) ds | 315 | false | true | 0 | 17 | 139 | 143 | 66 | 77 | null | null |
beni55/haste-compiler | libraries/ghc-7.10/ghc-prim/GHC/Prim.hs | bsd-3-clause | -- | Write a vector to specified index of mutable array.
writeFloatX8Array# :: MutableByteArray# s -> Int# -> FloatX8# -> State# s -> State# s
writeFloatX8Array# = let x = x in x | 180 | writeFloatX8Array# :: MutableByteArray# s -> Int# -> FloatX8# -> State# s -> State# s
writeFloatX8Array# = let x = x in x | 121 | writeFloatX8Array# = let x = x in x | 35 | true | true | 0 | 10 | 34 | 54 | 24 | 30 | null | null |
fehu/haskell-java-bridge-fork | src/Foreign/Java/Util.hs | mit | trace :: Show a => a -> a
trace a = Debug.trace (show a) a | 58 | trace :: Show a => a -> a
trace a = Debug.trace (show a) a | 58 | trace a = Debug.trace (show a) a | 32 | false | true | 0 | 8 | 14 | 43 | 19 | 24 | null | null |
Fizzixnerd/xmonad-config | xmonad.hs | gpl-3.0 | -- WORKSPACES
myWorkspaces :: [String]
myWorkspaces = ["1:Main", "2:Web", "3:Steam", "4:Media", "5:Terminal", "6", "7", "8", "9"] | 131 | myWorkspaces :: [String]
myWorkspaces = ["1:Main", "2:Web", "3:Steam", "4:Media", "5:Terminal", "6", "7", "8", "9"] | 115 | myWorkspaces = ["1:Main", "2:Web", "3:Steam", "4:Media", "5:Terminal", "6", "7", "8", "9"] | 90 | true | true | 0 | 5 | 17 | 42 | 27 | 15 | null | null |
anton-k/language-css | src/Language/Css/Build/Idents.hs | bsd-3-clause | -- | text-decoration
textDecoration :: Idents a => a
textDecoration = ident "text-decoration" | 93 | textDecoration :: Idents a => a
textDecoration = ident "text-decoration" | 72 | textDecoration = ident "text-decoration" | 40 | true | true | 0 | 6 | 12 | 22 | 11 | 11 | null | null |
ganeti-github-testing/ganeti-test-1 | test/hs/Test/Ganeti/HTools/Container.hs | bsd-2-clause | prop_addTwo :: [Container.Key] -> Int -> Int -> Bool
prop_addTwo cdata i1 i2 =
fn i1 i2 cont == fn i2 i1 cont &&
fn i1 i2 cont == fn i1 i2 (fn i1 i2 cont)
where cont = foldl (\c x -> Container.add x x c) Container.empty cdata
fn x1 x2 = Container.addTwo x1 x1 x2 x2 | 283 | prop_addTwo :: [Container.Key] -> Int -> Int -> Bool
prop_addTwo cdata i1 i2 =
fn i1 i2 cont == fn i2 i1 cont &&
fn i1 i2 cont == fn i1 i2 (fn i1 i2 cont)
where cont = foldl (\c x -> Container.add x x c) Container.empty cdata
fn x1 x2 = Container.addTwo x1 x1 x2 x2 | 283 | prop_addTwo cdata i1 i2 =
fn i1 i2 cont == fn i2 i1 cont &&
fn i1 i2 cont == fn i1 i2 (fn i1 i2 cont)
where cont = foldl (\c x -> Container.add x x c) Container.empty cdata
fn x1 x2 = Container.addTwo x1 x1 x2 x2 | 230 | false | true | 0 | 11 | 75 | 141 | 69 | 72 | null | null |
danr/hipspec | testsuite/prod/zeno_version/PropT09.hs | gpl-3.0 | rotate _ [] = [] | 16 | rotate _ [] = [] | 16 | rotate _ [] = [] | 16 | false | false | 0 | 6 | 4 | 19 | 8 | 11 | null | null |
begriffs/hscope | t/files/Simple.hs | bsd-3-clause | handleCalls :: IORef SrcLoc -> V.Vector B.ByteString -> Exp -> CDBMake
handleCalls ior vec (Var (UnQual (Ident f))) = do
src <- liftIO $ readIORef ior
addInfo vec src Call f | 181 | handleCalls :: IORef SrcLoc -> V.Vector B.ByteString -> Exp -> CDBMake
handleCalls ior vec (Var (UnQual (Ident f))) = do
src <- liftIO $ readIORef ior
addInfo vec src Call f | 181 | handleCalls ior vec (Var (UnQual (Ident f))) = do
src <- liftIO $ readIORef ior
addInfo vec src Call f | 110 | false | true | 0 | 15 | 38 | 90 | 40 | 50 | null | null |
spacekitteh/smcghc | libraries/base/GHC/IO/Encoding/UTF32.hs | bsd-3-clause | utf32_EF :: CodingFailureMode -> IO (TextEncoder Bool)
utf32_EF cfm = do
done_bom <- newIORef False
return (BufferCodec {
encode = utf32_encode done_bom,
recover = recoverEncode cfm,
close = return (),
getState = readIORef done_bom,
setState = writeIORef done_bom
}) | 351 | utf32_EF :: CodingFailureMode -> IO (TextEncoder Bool)
utf32_EF cfm = do
done_bom <- newIORef False
return (BufferCodec {
encode = utf32_encode done_bom,
recover = recoverEncode cfm,
close = return (),
getState = readIORef done_bom,
setState = writeIORef done_bom
}) | 351 | utf32_EF cfm = do
done_bom <- newIORef False
return (BufferCodec {
encode = utf32_encode done_bom,
recover = recoverEncode cfm,
close = return (),
getState = readIORef done_bom,
setState = writeIORef done_bom
}) | 296 | false | true | 0 | 12 | 123 | 95 | 48 | 47 | null | null |
antalsz/hs-to-coq | src/lib/HsToCoq/Coq/Pretty.hs | mit | fromCoqLevel :: Int -> Int
fromCoqLevel cl = 400 - 2 * cl | 57 | fromCoqLevel :: Int -> Int
fromCoqLevel cl = 400 - 2 * cl | 57 | fromCoqLevel cl = 400 - 2 * cl | 30 | false | true | 0 | 6 | 12 | 30 | 14 | 16 | null | null |
chaoxu/haskell-algorithm | Trie.hs | mit | trieFrom :: (a->a->Bool)->[[a]]->Trie a
trieFrom eq strings = Node [] (trieFrom' eq strings) | 92 | trieFrom :: (a->a->Bool)->[[a]]->Trie a
trieFrom eq strings = Node [] (trieFrom' eq strings) | 92 | trieFrom eq strings = Node [] (trieFrom' eq strings) | 52 | false | true | 0 | 8 | 12 | 63 | 31 | 32 | null | null |
haroldcarr/learn-haskell-coq-ml-etc | haskell/book/2007-Programming_in_Haskell-1st_Edition-Graham_Hutton/ch_09_9.hs | unlicense | wait :: Int -> IO ()
wait n = seqn [ return () | _ <- [ 1 .. n ] ] | 66 | wait :: Int -> IO ()
wait n = seqn [ return () | _ <- [ 1 .. n ] ] | 66 | wait n = seqn [ return () | _ <- [ 1 .. n ] ] | 45 | false | true | 0 | 9 | 21 | 53 | 25 | 28 | null | null |
josuf107/H | H/Test.hs | gpl-2.0 | rightOrWrong :: (Show a, Eq b) => Either a b -> b -> Bool
rightOrWrong (Right x) y = x == y | 91 | rightOrWrong :: (Show a, Eq b) => Either a b -> b -> Bool
rightOrWrong (Right x) y = x == y | 91 | rightOrWrong (Right x) y = x == y | 33 | false | true | 0 | 7 | 21 | 54 | 27 | 27 | null | null |
damianfral/clay | src/Clay/Font.hs | bsd-3-clause | oblique = FontStyle "oblique" | 29 | oblique = FontStyle "oblique" | 29 | oblique = FontStyle "oblique" | 29 | false | false | 0 | 5 | 3 | 9 | 4 | 5 | null | null |
pasberth/binal1 | Language/Binal/Verifier.hs | mit | examineNames' (Lit (NumLit _) _) = return [] | 44 | examineNames' (Lit (NumLit _) _) = return [] | 44 | examineNames' (Lit (NumLit _) _) = return [] | 44 | false | false | 0 | 9 | 7 | 28 | 13 | 15 | null | null |
vitalijzad/sakila-yesod | Application.hs | gpl-3.0 | getAppSettings :: IO AppSettings
getAppSettings = loadYamlSettings [configSettingsYml] [] useEnv | 96 | getAppSettings :: IO AppSettings
getAppSettings = loadYamlSettings [configSettingsYml] [] useEnv | 96 | getAppSettings = loadYamlSettings [configSettingsYml] [] useEnv | 63 | false | true | 0 | 6 | 9 | 31 | 14 | 17 | null | null |
kwibus/myLang | src/BruijnTerm.hs | bsd-3-clause | incFreeOfset ofset increase term = go ofset term
where
go :: Int -> BruijnTerm i j -> BruijnTerm i j
go depth (Lambda i n t) = Lambda i n $ go (depth + 1) t
go depth (Appl t1 t2) = Appl (go depth t1) (go depth t2)
go depth (Var i (Bound n))
| n >= depth = Var i $ Bound $ n + increase
| otherwise = Var i (Bound n)
go depth (Let i defs t) = Let i (map (fmap $ go newDepth) defs) $ go newDepth t
where
newDepth = depth + length defs
go _ (Val i v) = Val i v | 512 | incFreeOfset ofset increase term = go ofset term
where
go :: Int -> BruijnTerm i j -> BruijnTerm i j
go depth (Lambda i n t) = Lambda i n $ go (depth + 1) t
go depth (Appl t1 t2) = Appl (go depth t1) (go depth t2)
go depth (Var i (Bound n))
| n >= depth = Var i $ Bound $ n + increase
| otherwise = Var i (Bound n)
go depth (Let i defs t) = Let i (map (fmap $ go newDepth) defs) $ go newDepth t
where
newDepth = depth + length defs
go _ (Val i v) = Val i v | 512 | incFreeOfset ofset increase term = go ofset term
where
go :: Int -> BruijnTerm i j -> BruijnTerm i j
go depth (Lambda i n t) = Lambda i n $ go (depth + 1) t
go depth (Appl t1 t2) = Appl (go depth t1) (go depth t2)
go depth (Var i (Bound n))
| n >= depth = Var i $ Bound $ n + increase
| otherwise = Var i (Bound n)
go depth (Let i defs t) = Let i (map (fmap $ go newDepth) defs) $ go newDepth t
where
newDepth = depth + length defs
go _ (Val i v) = Val i v | 512 | false | false | 0 | 11 | 165 | 282 | 134 | 148 | null | null |
mrmonday/Idris-dev | src/IRTS/CodegenC.hs | bsd-3-clause | doOp v (LIntStr (ITFixed _)) [x] = v ++ "idris_castBitsStr(vm, " ++ creg x ++ ")" | 81 | doOp v (LIntStr (ITFixed _)) [x] = v ++ "idris_castBitsStr(vm, " ++ creg x ++ ")" | 81 | doOp v (LIntStr (ITFixed _)) [x] = v ++ "idris_castBitsStr(vm, " ++ creg x ++ ")" | 81 | false | false | 0 | 9 | 15 | 43 | 21 | 22 | null | null |
nakamuray/htig | htig.hs | bsd-3-clause | main :: IO ()
main = htig defaultConfig | 39 | main :: IO ()
main = htig defaultConfig | 39 | main = htig defaultConfig | 25 | false | true | 0 | 7 | 7 | 25 | 10 | 15 | null | null |
tyoko-dev/rcore-haskell | src/RCore/Eval.hs | agpl-3.0 | eval ev (ATl x) = case lookupEnv x ev of
Cons _ v -> v
Nil -> error "tl nil" | 121 | eval ev (ATl x) = case lookupEnv x ev of
Cons _ v -> v
Nil -> error "tl nil" | 121 | eval ev (ATl x) = case lookupEnv x ev of
Cons _ v -> v
Nil -> error "tl nil" | 121 | false | false | 0 | 8 | 64 | 48 | 21 | 27 | null | null |
OS2World/DEV-UTIL-HUGS | oldlib/MyersStack.hs | bsd-3-clause | mapWithIndex = mapWithIndexUsingLists | 37 | mapWithIndex = mapWithIndexUsingLists | 37 | mapWithIndex = mapWithIndexUsingLists | 37 | false | false | 0 | 4 | 2 | 6 | 3 | 3 | null | null |
DanielWaterworth/Idris-dev | src/Idris/REPL.hs | bsd-3-clause | process h fn (Search t) = iPrintError "Not implemented" | 55 | process h fn (Search t) = iPrintError "Not implemented" | 55 | process h fn (Search t) = iPrintError "Not implemented" | 55 | false | false | 0 | 7 | 8 | 22 | 10 | 12 | null | null |
ghc-android/ghc | testsuite/tests/ghci/should_run/ghcirun004.hs | bsd-3-clause | 2210 = 2209 | 11 | 2210 = 2209 | 11 | 2210 = 2209 | 11 | false | false | 1 | 5 | 2 | 10 | 3 | 7 | null | null |
uduki/hsQt | Qtc/Gui/QStyle.hs | bsd-2-clause | qqStyleVisualRect :: ((LayoutDirection, QRect t2, QRect t3)) -> IO (QRect ())
qqStyleVisualRect (x1, x2, x3)
= withQRectResult $
withObjectPtr x2 $ \cobj_x2 ->
withObjectPtr x3 $ \cobj_x3 ->
qtc_QStyle_visualRect (toCLong $ qEnum_toInt x1) cobj_x2 cobj_x3 | 269 | qqStyleVisualRect :: ((LayoutDirection, QRect t2, QRect t3)) -> IO (QRect ())
qqStyleVisualRect (x1, x2, x3)
= withQRectResult $
withObjectPtr x2 $ \cobj_x2 ->
withObjectPtr x3 $ \cobj_x3 ->
qtc_QStyle_visualRect (toCLong $ qEnum_toInt x1) cobj_x2 cobj_x3 | 269 | qqStyleVisualRect (x1, x2, x3)
= withQRectResult $
withObjectPtr x2 $ \cobj_x2 ->
withObjectPtr x3 $ \cobj_x3 ->
qtc_QStyle_visualRect (toCLong $ qEnum_toInt x1) cobj_x2 cobj_x3 | 191 | false | true | 0 | 12 | 48 | 101 | 52 | 49 | null | null |
fegies/pseudocodeCompiler | src/ToBytecode.hs | bsd-3-clause | toBs (x:xs) = do
toB x
toBs xs | 38 | toBs (x:xs) = do
toB x
toBs xs | 38 | toBs (x:xs) = do
toB x
toBs xs | 38 | false | false | 0 | 7 | 15 | 29 | 12 | 17 | null | null |
philipturnbull/quenelle | src/Quenelle/Match.hs | gpl-2.0 | paramChildExprs path (UnPackTuple _ def _) =
maybeChildExprs (path.param_defaultL) def | 90 | paramChildExprs path (UnPackTuple _ def _) =
maybeChildExprs (path.param_defaultL) def | 90 | paramChildExprs path (UnPackTuple _ def _) =
maybeChildExprs (path.param_defaultL) def | 90 | false | false | 0 | 7 | 13 | 34 | 15 | 19 | null | null |
LukeHoersten/io-streams | test/System/IO/Streams/Tests/Combinators.hs | bsd-3-clause | testFilterM :: Test
testFilterM = testCase "combinators/filterM" $ do
is <- fromList [1..10::Int]
is' <- filterM (return . even) is
read is' >>= assertEqual "read1" (Just 2)
unRead 3 is'
peek is >>= assertEqual "pushback" (Just 3)
toList is' >>= assertEqual "rest" [4,6..10]
unRead 20 is'
peek is >>= assertEqual "pushback2" (Just 20)
toList is' >>= assertEqual "rest2" [20]
toList is' >>= assertEqual "eof" []
------------------------------------------------------------------------------ | 536 | testFilterM :: Test
testFilterM = testCase "combinators/filterM" $ do
is <- fromList [1..10::Int]
is' <- filterM (return . even) is
read is' >>= assertEqual "read1" (Just 2)
unRead 3 is'
peek is >>= assertEqual "pushback" (Just 3)
toList is' >>= assertEqual "rest" [4,6..10]
unRead 20 is'
peek is >>= assertEqual "pushback2" (Just 20)
toList is' >>= assertEqual "rest2" [20]
toList is' >>= assertEqual "eof" []
------------------------------------------------------------------------------ | 536 | testFilterM = testCase "combinators/filterM" $ do
is <- fromList [1..10::Int]
is' <- filterM (return . even) is
read is' >>= assertEqual "read1" (Just 2)
unRead 3 is'
peek is >>= assertEqual "pushback" (Just 3)
toList is' >>= assertEqual "rest" [4,6..10]
unRead 20 is'
peek is >>= assertEqual "pushback2" (Just 20)
toList is' >>= assertEqual "rest2" [20]
toList is' >>= assertEqual "eof" []
------------------------------------------------------------------------------ | 516 | false | true | 0 | 12 | 112 | 200 | 88 | 112 | null | null |
tolysz/keter | Keter/LabelMap.hs | mit | lookupTree [_] (Wildcard w) = getPortEntry $ w | 46 | lookupTree [_] (Wildcard w) = getPortEntry $ w | 46 | lookupTree [_] (Wildcard w) = getPortEntry $ w | 46 | false | false | 0 | 7 | 7 | 24 | 12 | 12 | null | null |
mimi1vx/shellcheck | ShellCheck/Analytics.hs | gpl-3.0 | checkSpacefulness params t =
doVariableFlowAnalysis readF writeF (Map.fromList defaults) (variableFlow params)
where
defaults = zip variablesWithoutSpaces (repeat False)
hasSpaces name = do
map <- get
return $ Map.findWithDefault True name map
setSpaces name bool =
modify $ Map.insert name bool
readF _ token name = do
spaced <- hasSpaces name
return [makeComment InfoC (getId token) 2086 warning |
spaced
&& not (isArrayExpansion token) -- There's another warning for this
&& not (isCounting token)
&& not (isQuoteFree parents token)
&& not (isQuotedAlternative token)
&& not (usedAsCommandName parents token)]
where
warning = "Double quote to prevent globbing and word splitting."
writeF _ _ name (DataString SourceExternal) = setSpaces name True >> return []
writeF _ _ name (DataString SourceInteger) = setSpaces name False >> return []
writeF _ _ name (DataString (SourceFrom vals)) = do
map <- get
setSpaces name
(isSpacefulWord (\x -> Map.findWithDefault True x map) vals)
return []
writeF _ _ _ _ = return []
parents = parentMap params
isCounting (T_DollarBraced id token) =
case concat $ oversimplify token of
'#':_ -> True
_ -> False
isCounting _ = False
-- FIXME: doesn't handle ${a:+$var} vs ${a:+"$var"}
isQuotedAlternative t =
case t of
T_DollarBraced _ _ ->
":+" `isInfixOf` bracedString t
_ -> False
isSpacefulWord :: (String -> Bool) -> [Token] -> Bool
isSpacefulWord f = any (isSpaceful f)
isSpaceful :: (String -> Bool) -> Token -> Bool
isSpaceful spacefulF x =
case x of
T_DollarExpansion _ _ -> True
T_Backticked _ _ -> True
T_Glob _ _ -> True
T_Extglob {} -> True
T_Literal _ s -> s `containsAny` globspace
T_SingleQuoted _ s -> s `containsAny` globspace
T_DollarBraced _ _ -> spacefulF $ getBracedReference $ bracedString x
T_NormalWord _ w -> isSpacefulWord spacefulF w
T_DoubleQuoted _ w -> isSpacefulWord spacefulF w
_ -> False
where
globspace = "*?[] \t\n"
containsAny s = any (`elem` s) | 2,428 | checkSpacefulness params t =
doVariableFlowAnalysis readF writeF (Map.fromList defaults) (variableFlow params)
where
defaults = zip variablesWithoutSpaces (repeat False)
hasSpaces name = do
map <- get
return $ Map.findWithDefault True name map
setSpaces name bool =
modify $ Map.insert name bool
readF _ token name = do
spaced <- hasSpaces name
return [makeComment InfoC (getId token) 2086 warning |
spaced
&& not (isArrayExpansion token) -- There's another warning for this
&& not (isCounting token)
&& not (isQuoteFree parents token)
&& not (isQuotedAlternative token)
&& not (usedAsCommandName parents token)]
where
warning = "Double quote to prevent globbing and word splitting."
writeF _ _ name (DataString SourceExternal) = setSpaces name True >> return []
writeF _ _ name (DataString SourceInteger) = setSpaces name False >> return []
writeF _ _ name (DataString (SourceFrom vals)) = do
map <- get
setSpaces name
(isSpacefulWord (\x -> Map.findWithDefault True x map) vals)
return []
writeF _ _ _ _ = return []
parents = parentMap params
isCounting (T_DollarBraced id token) =
case concat $ oversimplify token of
'#':_ -> True
_ -> False
isCounting _ = False
-- FIXME: doesn't handle ${a:+$var} vs ${a:+"$var"}
isQuotedAlternative t =
case t of
T_DollarBraced _ _ ->
":+" `isInfixOf` bracedString t
_ -> False
isSpacefulWord :: (String -> Bool) -> [Token] -> Bool
isSpacefulWord f = any (isSpaceful f)
isSpaceful :: (String -> Bool) -> Token -> Bool
isSpaceful spacefulF x =
case x of
T_DollarExpansion _ _ -> True
T_Backticked _ _ -> True
T_Glob _ _ -> True
T_Extglob {} -> True
T_Literal _ s -> s `containsAny` globspace
T_SingleQuoted _ s -> s `containsAny` globspace
T_DollarBraced _ _ -> spacefulF $ getBracedReference $ bracedString x
T_NormalWord _ w -> isSpacefulWord spacefulF w
T_DoubleQuoted _ w -> isSpacefulWord spacefulF w
_ -> False
where
globspace = "*?[] \t\n"
containsAny s = any (`elem` s) | 2,428 | checkSpacefulness params t =
doVariableFlowAnalysis readF writeF (Map.fromList defaults) (variableFlow params)
where
defaults = zip variablesWithoutSpaces (repeat False)
hasSpaces name = do
map <- get
return $ Map.findWithDefault True name map
setSpaces name bool =
modify $ Map.insert name bool
readF _ token name = do
spaced <- hasSpaces name
return [makeComment InfoC (getId token) 2086 warning |
spaced
&& not (isArrayExpansion token) -- There's another warning for this
&& not (isCounting token)
&& not (isQuoteFree parents token)
&& not (isQuotedAlternative token)
&& not (usedAsCommandName parents token)]
where
warning = "Double quote to prevent globbing and word splitting."
writeF _ _ name (DataString SourceExternal) = setSpaces name True >> return []
writeF _ _ name (DataString SourceInteger) = setSpaces name False >> return []
writeF _ _ name (DataString (SourceFrom vals)) = do
map <- get
setSpaces name
(isSpacefulWord (\x -> Map.findWithDefault True x map) vals)
return []
writeF _ _ _ _ = return []
parents = parentMap params
isCounting (T_DollarBraced id token) =
case concat $ oversimplify token of
'#':_ -> True
_ -> False
isCounting _ = False
-- FIXME: doesn't handle ${a:+$var} vs ${a:+"$var"}
isQuotedAlternative t =
case t of
T_DollarBraced _ _ ->
":+" `isInfixOf` bracedString t
_ -> False
isSpacefulWord :: (String -> Bool) -> [Token] -> Bool
isSpacefulWord f = any (isSpaceful f)
isSpaceful :: (String -> Bool) -> Token -> Bool
isSpaceful spacefulF x =
case x of
T_DollarExpansion _ _ -> True
T_Backticked _ _ -> True
T_Glob _ _ -> True
T_Extglob {} -> True
T_Literal _ s -> s `containsAny` globspace
T_SingleQuoted _ s -> s `containsAny` globspace
T_DollarBraced _ _ -> spacefulF $ getBracedReference $ bracedString x
T_NormalWord _ w -> isSpacefulWord spacefulF w
T_DoubleQuoted _ w -> isSpacefulWord spacefulF w
_ -> False
where
globspace = "*?[] \t\n"
containsAny s = any (`elem` s) | 2,428 | false | false | 11 | 17 | 819 | 746 | 348 | 398 | null | null |
othercriteria/blaze | RAE.hs | mit | maxE = binaryOp "max" | 26 | maxE = binaryOp "max" | 26 | maxE = binaryOp "max" | 26 | false | false | 0 | 5 | 8 | 9 | 4 | 5 | null | null |
ComputationWithBoundedResources/ara-inference | doc/tpdb_trs/Haskell/basic_haskell/max_5.hs | mit | esEsOrdering GT LT = MyFalse | 28 | esEsOrdering GT LT = MyFalse | 28 | esEsOrdering GT LT = MyFalse | 28 | false | false | 0 | 5 | 4 | 11 | 5 | 6 | null | null |
alexander-at-github/eta | compiler/ETA/Core/TrieMap.hs | bsd-3-clause | xtE env (Let (NonRec b r) e) f m = m { cm_letn = cm_letn m
|> xtE (extendCME env b) e
|>> xtE env r |>> xtBndr env b f } | 218 | xtE env (Let (NonRec b r) e) f m = m { cm_letn = cm_letn m
|> xtE (extendCME env b) e
|>> xtE env r |>> xtBndr env b f } | 218 | xtE env (Let (NonRec b r) e) f m = m { cm_letn = cm_letn m
|> xtE (extendCME env b) e
|>> xtE env r |>> xtBndr env b f } | 218 | false | false | 1 | 13 | 129 | 83 | 38 | 45 | null | null |
Azocan/PA1 | main.hs | mit | -- Recursively find eta-convertable expressions \x.(f y)
eta :: Lexp -> Lexp
eta v@(Atom _) = v | 95 | eta :: Lexp -> Lexp
eta v@(Atom _) = v | 38 | eta v@(Atom _) = v | 18 | true | true | 2 | 7 | 16 | 34 | 16 | 18 | null | null |
DavidAlphaFox/ghc | libraries/Cabal/cabal-install/Distribution/Client/Dependency/Modular/Tree.hs | bsd-3-clause | cataM :: Monad m => (TreeF a b -> m b) -> Tree a -> m b
cataM phi = phi <=< mapM (cataM phi) <=< return . out | 109 | cataM :: Monad m => (TreeF a b -> m b) -> Tree a -> m b
cataM phi = phi <=< mapM (cataM phi) <=< return . out | 109 | cataM phi = phi <=< mapM (cataM phi) <=< return . out | 53 | false | true | 0 | 10 | 28 | 71 | 33 | 38 | null | null |
liyanchang/scheme-in-haskell | src/chp5.hs | mit | eval (List [Atom "quote", val]) = return val | 44 | eval (List [Atom "quote", val]) = return val | 44 | eval (List [Atom "quote", val]) = return val | 44 | false | false | 0 | 8 | 7 | 28 | 13 | 15 | null | null |
flocc-net/flocc | v0.1/Compiler/Types2/TypeInfo.hs | apache-2.0 | typeDefault :: String -> Int -> Maybe TyTerm
typeDefault name idx = lookup (name, idx) typeDefaults | 99 | typeDefault :: String -> Int -> Maybe TyTerm
typeDefault name idx = lookup (name, idx) typeDefaults | 99 | typeDefault name idx = lookup (name, idx) typeDefaults | 54 | false | true | 0 | 7 | 15 | 38 | 19 | 19 | null | null |
FranklinChen/brick | programs/VisibilityDemo.hs | bsd-3-clause | theMap :: AttrMap
theMap = attrMap V.defAttr
[ (selectedAttr, V.black `on` V.yellow)
] | 94 | theMap :: AttrMap
theMap = attrMap V.defAttr
[ (selectedAttr, V.black `on` V.yellow)
] | 94 | theMap = attrMap V.defAttr
[ (selectedAttr, V.black `on` V.yellow)
] | 76 | false | true | 0 | 9 | 20 | 37 | 21 | 16 | null | null |
input-output-hk/pos-haskell-prototype | crypto/test/Test/Pos/Crypto/CryptoSpec2.hs | mit | proxySignVerifyDifferentData
:: (Bi a, Eq a, Bi w, Eq w)
=> Crypto.SecretKey
-> Crypto.SecretKey
-> w
-> a
-> a
-> Property
proxySignVerifyDifferentData issuerSk delegateSk w m m2 = (m /= m2) ==> not
(Crypto.proxyVerify dummyProtocolMagic
Crypto.SignForTestingOnly
signature
(== w)
m2
)
where
proxySk = Crypto.createPsk dummyProtocolMagic
issuerSk
(Crypto.toPublic delegateSk)
w
signature = Crypto.proxySign dummyProtocolMagic
Crypto.SignForTestingOnly
delegateSk
proxySk
m | 840 | proxySignVerifyDifferentData
:: (Bi a, Eq a, Bi w, Eq w)
=> Crypto.SecretKey
-> Crypto.SecretKey
-> w
-> a
-> a
-> Property
proxySignVerifyDifferentData issuerSk delegateSk w m m2 = (m /= m2) ==> not
(Crypto.proxyVerify dummyProtocolMagic
Crypto.SignForTestingOnly
signature
(== w)
m2
)
where
proxySk = Crypto.createPsk dummyProtocolMagic
issuerSk
(Crypto.toPublic delegateSk)
w
signature = Crypto.proxySign dummyProtocolMagic
Crypto.SignForTestingOnly
delegateSk
proxySk
m | 840 | proxySignVerifyDifferentData issuerSk delegateSk w m m2 = (m /= m2) ==> not
(Crypto.proxyVerify dummyProtocolMagic
Crypto.SignForTestingOnly
signature
(== w)
m2
)
where
proxySk = Crypto.createPsk dummyProtocolMagic
issuerSk
(Crypto.toPublic delegateSk)
w
signature = Crypto.proxySign dummyProtocolMagic
Crypto.SignForTestingOnly
delegateSk
proxySk
m | 688 | false | true | 0 | 12 | 425 | 161 | 80 | 81 | null | null |
ekr/tamarin-prover | lib/term/src/Term/Term/Raw.hs | gpl-3.0 | fmapTerm :: (Ord a, Ord b) => (a -> b) -> Term a -> Term b
fmapTerm f = foldTerm (lit . f) fApp | 95 | fmapTerm :: (Ord a, Ord b) => (a -> b) -> Term a -> Term b
fmapTerm f = foldTerm (lit . f) fApp | 95 | fmapTerm f = foldTerm (lit . f) fApp | 36 | false | true | 0 | 8 | 23 | 62 | 31 | 31 | null | null |
jsavatgy/xroads-game | code/blue-atan2.hs | gpl-2.0 | setColor (RGBA r g b a) = setSourceRGBA r g b a | 47 | setColor (RGBA r g b a) = setSourceRGBA r g b a | 47 | setColor (RGBA r g b a) = setSourceRGBA r g b a | 47 | false | false | 0 | 7 | 11 | 30 | 14 | 16 | null | null |
fpinsight/hocilib | src/Database/Ocilib/Collections.hs | bsd-2-clause | -- | Get the previous element in the collection.
ociIterGetPrev :: Ptr OCI_Iter -> IO (Maybe (Ptr OCI_Elem))
ociIterGetPrev i = fmap toMaybePtr [C.exp| OCI_Elem* {OCI_IterGetPrev($(OCI_Iter *i)) } |] | 199 | ociIterGetPrev :: Ptr OCI_Iter -> IO (Maybe (Ptr OCI_Elem))
ociIterGetPrev i = fmap toMaybePtr [C.exp| OCI_Elem* {OCI_IterGetPrev($(OCI_Iter *i)) } |] | 150 | ociIterGetPrev i = fmap toMaybePtr [C.exp| OCI_Elem* {OCI_IterGetPrev($(OCI_Iter *i)) } |] | 90 | true | true | 0 | 10 | 28 | 48 | 25 | 23 | null | null |
elitak/hs-datahand | stm32f10x/hs_src/Data/FlagSet/PackedRecord.hs | gpl-3.0 | leastSigBit :: (Num w, Bits w) => w -> w
leastSigBit m = (-m) .&. m | 67 | leastSigBit :: (Num w, Bits w) => w -> w
leastSigBit m = (-m) .&. m | 67 | leastSigBit m = (-m) .&. m | 26 | false | true | 2 | 8 | 15 | 50 | 24 | 26 | null | null |
gpahal/hgraph | src/HGraph/Edge.hs | bsd-3-clause | createEdgeN :: Label -> Node -> Node -> GS (Edge, Node, Node)
createEdgeN l sn en = createEdgeRE l (nodeId sn) (nodeId en) | 122 | createEdgeN :: Label -> Node -> Node -> GS (Edge, Node, Node)
createEdgeN l sn en = createEdgeRE l (nodeId sn) (nodeId en) | 122 | createEdgeN l sn en = createEdgeRE l (nodeId sn) (nodeId en) | 60 | false | true | 0 | 9 | 22 | 61 | 31 | 30 | null | null |
jdreaver/oanda-rest-api | src/OANDA/Internal/Import.hs | bsd-3-clause | -- | Lower case leading character
unCapitalize :: String -> String
unCapitalize [] = [] | 87 | unCapitalize :: String -> String
unCapitalize [] = [] | 53 | unCapitalize [] = [] | 20 | true | true | 0 | 6 | 14 | 23 | 12 | 11 | null | null |
ashutoshrishi/blogserver | src/Main.hs | bsd-3-clause | getPostBySlugA :: ActionM ()
getPostBySlugA = do
slug <- param "slug"
maybeEnt <- liftIO $ getPostBySlug slug
maybe notFoundA json maybeEnt | 151 | getPostBySlugA :: ActionM ()
getPostBySlugA = do
slug <- param "slug"
maybeEnt <- liftIO $ getPostBySlug slug
maybe notFoundA json maybeEnt | 151 | getPostBySlugA = do
slug <- param "slug"
maybeEnt <- liftIO $ getPostBySlug slug
maybe notFoundA json maybeEnt | 122 | false | true | 1 | 10 | 32 | 54 | 22 | 32 | null | null |
da-x/ghc | compiler/main/DriverPipeline.hs | bsd-3-clause | fixchar :: Char -> Char
fixchar '-' = '_' | 41 | fixchar :: Char -> Char
fixchar '-' = '_' | 41 | fixchar '-' = '_' | 17 | false | true | 0 | 5 | 8 | 18 | 9 | 9 | null | null |
andres-erbsen/baseconvert | haskell/Baseconvert.hs | gpl-3.0 | baseconvert (Base inDigits) (Base outDigits) toConvert = unsafePerformIO $
unsafeUseAsCStringLen inDigits $ \ (in_digits, inRadix) ->
unsafeUseAsCStringLen outDigits $ \ (out_digits, outRadix) ->
unsafeUseAsCStringLen toConvert $ \ (in_chars, inLen) ->
let
out_len_limit = c_baseconvert_targetlen in_max_digit out_max_digit in_len
in_max_digit = fromIntegral $ inRadix - 1
out_max_digit = fromIntegral$ outRadix - 1
in_len = fromIntegral inLen
in
allocaBytes (fromIntegral out_len_limit) $ \ out_chars -> do
let out_len = c_baseconvert in_max_digit in_digits in_chars in_len
out_max_digit out_digits out_chars out_len_limit
packCStringLen (out_chars, fromIntegral out_len) -- TODO: unsafe 'd be faster
-- main = print $ baseconvert (Base "01") (Base "0123456789ABCDEF") "1111" | 860 | baseconvert (Base inDigits) (Base outDigits) toConvert = unsafePerformIO $
unsafeUseAsCStringLen inDigits $ \ (in_digits, inRadix) ->
unsafeUseAsCStringLen outDigits $ \ (out_digits, outRadix) ->
unsafeUseAsCStringLen toConvert $ \ (in_chars, inLen) ->
let
out_len_limit = c_baseconvert_targetlen in_max_digit out_max_digit in_len
in_max_digit = fromIntegral $ inRadix - 1
out_max_digit = fromIntegral$ outRadix - 1
in_len = fromIntegral inLen
in
allocaBytes (fromIntegral out_len_limit) $ \ out_chars -> do
let out_len = c_baseconvert in_max_digit in_digits in_chars in_len
out_max_digit out_digits out_chars out_len_limit
packCStringLen (out_chars, fromIntegral out_len) -- TODO: unsafe 'd be faster
-- main = print $ baseconvert (Base "01") (Base "0123456789ABCDEF") "1111" | 860 | baseconvert (Base inDigits) (Base outDigits) toConvert = unsafePerformIO $
unsafeUseAsCStringLen inDigits $ \ (in_digits, inRadix) ->
unsafeUseAsCStringLen outDigits $ \ (out_digits, outRadix) ->
unsafeUseAsCStringLen toConvert $ \ (in_chars, inLen) ->
let
out_len_limit = c_baseconvert_targetlen in_max_digit out_max_digit in_len
in_max_digit = fromIntegral $ inRadix - 1
out_max_digit = fromIntegral$ outRadix - 1
in_len = fromIntegral inLen
in
allocaBytes (fromIntegral out_len_limit) $ \ out_chars -> do
let out_len = c_baseconvert in_max_digit in_digits in_chars in_len
out_max_digit out_digits out_chars out_len_limit
packCStringLen (out_chars, fromIntegral out_len) -- TODO: unsafe 'd be faster
-- main = print $ baseconvert (Base "01") (Base "0123456789ABCDEF") "1111" | 860 | false | false | 0 | 20 | 179 | 196 | 100 | 96 | null | null |
up9cloud/line-api-server | lib/hs/src/Thrift/Protocol/Compact.hs | mit | parseCompactValue (T_LIST ty) = TList ty <$> parseCompactList | 61 | parseCompactValue (T_LIST ty) = TList ty <$> parseCompactList | 61 | parseCompactValue (T_LIST ty) = TList ty <$> parseCompactList | 61 | false | false | 0 | 7 | 7 | 22 | 10 | 12 | null | null |
joshmcgrath08/turnt-octo-wight | Main.hs | mit | tmpVar :: String
tmpVar = "__smp_tmp" | 37 | tmpVar :: String
tmpVar = "__smp_tmp" | 37 | tmpVar = "__smp_tmp" | 20 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
nfjinjing/miku | src/Network/Miku/Config.hs | bsd-3-clause | mikuCaptures :: ByteString
mikuCaptures = "miku-captures-" | 58 | mikuCaptures :: ByteString
mikuCaptures = "miku-captures-" | 58 | mikuCaptures = "miku-captures-" | 31 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
Balletie/Automata | src/Universe.hs | gpl-2.0 | -- |Return a part of the Universe as a List, using the given bounds.
-- From Dan Piponi's blog post.
toList :: (Universe u) => Int -> Int -> u a -> [a]
toList i j = u_take (j-i) . shift i | 187 | toList :: (Universe u) => Int -> Int -> u a -> [a]
toList i j = u_take (j-i) . shift i | 86 | toList i j = u_take (j-i) . shift i | 35 | true | true | 0 | 9 | 41 | 62 | 32 | 30 | null | null |
ezyang/ghc | compiler/cmm/CmmMachOp.hs | bsd-3-clause | mo_u_16ToWord dflags = MO_UU_Conv W16 (wordWidth dflags) | 58 | mo_u_16ToWord dflags = MO_UU_Conv W16 (wordWidth dflags) | 58 | mo_u_16ToWord dflags = MO_UU_Conv W16 (wordWidth dflags) | 58 | false | false | 0 | 7 | 8 | 20 | 9 | 11 | null | null |
hausdorff/pyli | src/Parser.hs | mit | globalStmt :: Parser String
globalStmt = global <~> id <~> zeroPlusIds ==> emitGlobalStmt
where global = ter "global"
id = ter "ID" | 145 | globalStmt :: Parser String
globalStmt = global <~> id <~> zeroPlusIds ==> emitGlobalStmt
where global = ter "global"
id = ter "ID" | 145 | globalStmt = global <~> id <~> zeroPlusIds ==> emitGlobalStmt
where global = ter "global"
id = ter "ID" | 117 | false | true | 4 | 6 | 35 | 58 | 23 | 35 | null | null |
octomarat/HaskellDebugger | src/DebuggerMonad.hs | bsd-3-clause | turnOffBuffering :: DebuggerMonad ()
turnOffBuffering = do
st <- getDebugState
let (Just stdout_ptr) = mb_stdout_ptr st
let (Just stderr_ptr) = mb_stderr_ptr st
h1 <- liftIO $ getHandle (stdout_ptr)
h2 <- liftIO $ getHandle (stderr_ptr)
liftIO $ hSetBuffering h1 NoBuffering
liftIO $ hSetBuffering h2 NoBuffering | 340 | turnOffBuffering :: DebuggerMonad ()
turnOffBuffering = do
st <- getDebugState
let (Just stdout_ptr) = mb_stdout_ptr st
let (Just stderr_ptr) = mb_stderr_ptr st
h1 <- liftIO $ getHandle (stdout_ptr)
h2 <- liftIO $ getHandle (stderr_ptr)
liftIO $ hSetBuffering h1 NoBuffering
liftIO $ hSetBuffering h2 NoBuffering | 340 | turnOffBuffering = do
st <- getDebugState
let (Just stdout_ptr) = mb_stdout_ptr st
let (Just stderr_ptr) = mb_stderr_ptr st
h1 <- liftIO $ getHandle (stdout_ptr)
h2 <- liftIO $ getHandle (stderr_ptr)
liftIO $ hSetBuffering h1 NoBuffering
liftIO $ hSetBuffering h2 NoBuffering | 303 | false | true | 1 | 12 | 71 | 123 | 53 | 70 | null | null |
fmapfmapfmap/amazonka | amazonka-cognito-sync/gen/Network/AWS/CognitoSync/Types/Product.hs | mpl-2.0 | -- | Date on which the identity pool was last modified.
ipuLastModifiedDate :: Lens' IdentityPoolUsage (Maybe UTCTime)
ipuLastModifiedDate = lens _ipuLastModifiedDate (\ s a -> s{_ipuLastModifiedDate = a}) . mapping _Time | 221 | ipuLastModifiedDate :: Lens' IdentityPoolUsage (Maybe UTCTime)
ipuLastModifiedDate = lens _ipuLastModifiedDate (\ s a -> s{_ipuLastModifiedDate = a}) . mapping _Time | 165 | ipuLastModifiedDate = lens _ipuLastModifiedDate (\ s a -> s{_ipuLastModifiedDate = a}) . mapping _Time | 102 | true | true | 0 | 10 | 30 | 53 | 28 | 25 | null | null |
ksaveljev/hake-2 | src/Constants.hs | bsd-3-clause | uAngle2 = 1 `shiftL` 2 :: Int | 32 | uAngle2 = 1 `shiftL` 2 :: Int | 32 | uAngle2 = 1 `shiftL` 2 :: Int | 32 | false | false | 0 | 5 | 9 | 15 | 9 | 6 | null | null |
jaseemabid/lisper | src/Lisper/Eval.hs | mit | eval val@(List []) = return val | 31 | eval val@(List []) = return val | 31 | eval val@(List []) = return val | 31 | false | false | 0 | 9 | 5 | 23 | 11 | 12 | null | null |
xaverdh/hfish-parser | HFish/Parser/Parser.hs | mit | compStmt :: P m => m (CompStmt T.Text ())
compStmt = do
st <- stmt
option (Simple () st)
( spaces *>
( piped st <|> forked st ) )
where
piped st = Piped ()
<$> ( sym "|" $> Fd1
<|> sym "1>|" $> Fd1
<|> sym "2>|" $> Fd2 )
<*> return st
<*> compStmt
<?> "pipe"
forked st =
sym "&"
$> Forked () st
<?> "fork-symbol" | 403 | compStmt :: P m => m (CompStmt T.Text ())
compStmt = do
st <- stmt
option (Simple () st)
( spaces *>
( piped st <|> forked st ) )
where
piped st = Piped ()
<$> ( sym "|" $> Fd1
<|> sym "1>|" $> Fd1
<|> sym "2>|" $> Fd2 )
<*> return st
<*> compStmt
<?> "pipe"
forked st =
sym "&"
$> Forked () st
<?> "fork-symbol" | 403 | compStmt = do
st <- stmt
option (Simple () st)
( spaces *>
( piped st <|> forked st ) )
where
piped st = Piped ()
<$> ( sym "|" $> Fd1
<|> sym "1>|" $> Fd1
<|> sym "2>|" $> Fd2 )
<*> return st
<*> compStmt
<?> "pipe"
forked st =
sym "&"
$> Forked () st
<?> "fork-symbol" | 361 | false | true | 1 | 17 | 161 | 170 | 80 | 90 | null | null |
ambiata/highlighting-kate | Text/Highlighting/Kate/Syntax/Doxygenlua.hs | gpl-2.0 | parseRules ("DoxygenLua","ML_types1") =
(((lookAhead (pDetect2Chars False '*' '/') >> (popContext) >> currentContext >>= parseRules))
<|>
((pDetectChar False '\'' >>= withAttribute DataTypeTok) >>~ (popContext >> popContext))
<|>
(currentContext >>= \x -> guard (x == ("DoxygenLua","ML_types1")) >> pDefault >>= withAttribute DataTypeTok)) | 353 | parseRules ("DoxygenLua","ML_types1") =
(((lookAhead (pDetect2Chars False '*' '/') >> (popContext) >> currentContext >>= parseRules))
<|>
((pDetectChar False '\'' >>= withAttribute DataTypeTok) >>~ (popContext >> popContext))
<|>
(currentContext >>= \x -> guard (x == ("DoxygenLua","ML_types1")) >> pDefault >>= withAttribute DataTypeTok)) | 353 | parseRules ("DoxygenLua","ML_types1") =
(((lookAhead (pDetect2Chars False '*' '/') >> (popContext) >> currentContext >>= parseRules))
<|>
((pDetectChar False '\'' >>= withAttribute DataTypeTok) >>~ (popContext >> popContext))
<|>
(currentContext >>= \x -> guard (x == ("DoxygenLua","ML_types1")) >> pDefault >>= withAttribute DataTypeTok)) | 353 | false | false | 0 | 15 | 52 | 129 | 68 | 61 | null | null |
bibaijin/cis194 | src/Spring13/Week7/JoinList.hs | bsd-3-clause | tag (Append m _ _) = m | 22 | tag (Append m _ _) = m | 22 | tag (Append m _ _) = m | 22 | false | false | 0 | 6 | 6 | 20 | 9 | 11 | null | null |
GaloisInc/verification-game | web-prover/src/Utils.hs | bsd-3-clause | getFiles :: FilePath -> IO [FilePath]
getFiles dir =
do fs <- getDirectoryContents dir
`X.catch` \X.SomeException {} -> return []
let isFile f | f == ".dummy" = return False
| otherwise = do isDir <- doesDirectoryExist (dir </> f)
return (not isDir)
filterM isFile fs | 352 | getFiles :: FilePath -> IO [FilePath]
getFiles dir =
do fs <- getDirectoryContents dir
`X.catch` \X.SomeException {} -> return []
let isFile f | f == ".dummy" = return False
| otherwise = do isDir <- doesDirectoryExist (dir </> f)
return (not isDir)
filterM isFile fs | 352 | getFiles dir =
do fs <- getDirectoryContents dir
`X.catch` \X.SomeException {} -> return []
let isFile f | f == ".dummy" = return False
| otherwise = do isDir <- doesDirectoryExist (dir </> f)
return (not isDir)
filterM isFile fs | 314 | false | true | 0 | 16 | 130 | 129 | 59 | 70 | null | null |
achirkin/ghcjs-webgl | src/JavaScript/WebGL/Const.hs | mit | gl_FRONT_FACE :: GLenum
gl_FRONT_FACE = 0x0B46 | 46 | gl_FRONT_FACE :: GLenum
gl_FRONT_FACE = 0x0B46 | 46 | gl_FRONT_FACE = 0x0B46 | 22 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
rebennett/figbass | figbass.hs | mit | deriveOffset key = head (elemIndices (map toUpper key) sharps) | 76 | deriveOffset key = head (elemIndices (map toUpper key) sharps) | 76 | deriveOffset key = head (elemIndices (map toUpper key) sharps) | 76 | false | false | 0 | 9 | 22 | 28 | 13 | 15 | null | null |
nymacro/hs-kmip | src/Ttlv/Validator/Objects.hs | bsd-3-clause | keyBlock :: TtlvParser Ttlv
keyBlock = do
tag T.KeyBlock
apply T.KeyFormatType tEnum
optional T.KeyCompressionType tEnum
apply T.KeyValue keyValue
optional T.CryptographicAlgorithm tEnum -- FIXME
optional T.CryptographicLength tInt -- FIXME
optional T.KeyWrappingData tStruct -- FIXME | 312 | keyBlock :: TtlvParser Ttlv
keyBlock = do
tag T.KeyBlock
apply T.KeyFormatType tEnum
optional T.KeyCompressionType tEnum
apply T.KeyValue keyValue
optional T.CryptographicAlgorithm tEnum -- FIXME
optional T.CryptographicLength tInt -- FIXME
optional T.KeyWrappingData tStruct -- FIXME | 312 | keyBlock = do
tag T.KeyBlock
apply T.KeyFormatType tEnum
optional T.KeyCompressionType tEnum
apply T.KeyValue keyValue
optional T.CryptographicAlgorithm tEnum -- FIXME
optional T.CryptographicLength tInt -- FIXME
optional T.KeyWrappingData tStruct -- FIXME | 284 | false | true | 0 | 8 | 60 | 85 | 37 | 48 | null | null |
yliu120/K3 | src/Language/K3/Core/Expression.hs | apache-2.0 | isEUserProperty :: Annotation Expression -> Bool
isEUserProperty (EProperty (Left _)) = True | 92 | isEUserProperty :: Annotation Expression -> Bool
isEUserProperty (EProperty (Left _)) = True | 92 | isEUserProperty (EProperty (Left _)) = True | 43 | false | true | 0 | 9 | 11 | 33 | 16 | 17 | null | null |
TinnedTuna/shannon-entropy-estimator | src/OptionParser.hs | bsd-3-clause | defaultOptions = Options { optInputFile = "passwords-list.csv" } | 64 | defaultOptions = Options { optInputFile = "passwords-list.csv" } | 64 | defaultOptions = Options { optInputFile = "passwords-list.csv" } | 64 | false | false | 0 | 6 | 7 | 14 | 8 | 6 | null | null |
ComputationWithBoundedResources/ara-inference | doc/tpdb_trs/Haskell/basic_haskell/signum_1.hs | mit | esEsOrdering GT GT = MyTrue | 27 | esEsOrdering GT GT = MyTrue | 27 | esEsOrdering GT GT = MyTrue | 27 | false | false | 1 | 5 | 4 | 16 | 5 | 11 | null | null |
Proclivis/wxHaskell | wxcore/src/haskell/Graphics/UI/WXCore/WxcDefs.hs | lgpl-2.1 | wxLANGUAGE_MOLDAVIAN :: Int
wxLANGUAGE_MOLDAVIAN = 138 | 54 | wxLANGUAGE_MOLDAVIAN :: Int
wxLANGUAGE_MOLDAVIAN = 138 | 54 | wxLANGUAGE_MOLDAVIAN = 138 | 26 | false | true | 0 | 4 | 5 | 11 | 6 | 5 | null | null |
travitch/language-python-builder | src/Language/Python/Common/Builder.hs | bsd-3-clause | importRelativeI :: (Monoid annot) => Int -> Maybe (DottedName annot) -> ImportRelativeQ annot
importRelativeI = importRelativeAI mempty | 135 | importRelativeI :: (Monoid annot) => Int -> Maybe (DottedName annot) -> ImportRelativeQ annot
importRelativeI = importRelativeAI mempty | 135 | importRelativeI = importRelativeAI mempty | 41 | false | true | 0 | 10 | 16 | 43 | 21 | 22 | null | null |
brendanhay/gogol | gogol-dfareporting/gen/Network/Google/DFAReporting/Types/Product.hs | mpl-2.0 | -- | ID of the metro region (DMA) to which this city belongs.
ccMetroDmaId :: Lens' City (Maybe Int64)
ccMetroDmaId
= lens _ccMetroDmaId (\ s a -> s{_ccMetroDmaId = a})
. mapping _Coerce | 194 | ccMetroDmaId :: Lens' City (Maybe Int64)
ccMetroDmaId
= lens _ccMetroDmaId (\ s a -> s{_ccMetroDmaId = a})
. mapping _Coerce | 132 | ccMetroDmaId
= lens _ccMetroDmaId (\ s a -> s{_ccMetroDmaId = a})
. mapping _Coerce | 91 | true | true | 2 | 8 | 40 | 60 | 28 | 32 | null | null |
darcykimball/lambda | src/Imperative.hs | bsd-3-clause | -- Translate a BoBeep program
translate :: B.Program -> Program
translate = fmap translateBoBeep | 96 | translate :: B.Program -> Program
translate = fmap translateBoBeep | 66 | translate = fmap translateBoBeep | 32 | true | true | 0 | 6 | 13 | 21 | 11 | 10 | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.