code stringlengths 5 1.03M | repo_name stringlengths 5 90 | path stringlengths 4 158 | license stringclasses 15
values | size int64 5 1.03M | n_ast_errors int64 0 53.9k | ast_max_depth int64 2 4.17k | n_whitespaces int64 0 365k | n_ast_nodes int64 3 317k | n_ast_terminals int64 1 171k | n_ast_nonterminals int64 1 146k | loc int64 -1 37.3k | cycloplexity int64 -1 1.31k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
module Deriving.Traverse(deriveFunctor,deriveFoldable,deriveTraversable) where
import Deriving.Type
import Deriving.Util
import FrontEnd.HsSyn
import FrontEnd.Syn.Q
import FrontEnd.Syn.Traverse()
import FrontEnd.Warning
import Name.Names
import Support.FreeVars
import Util.Std
import qualified Data.Set as Set
isRight... | hvr/jhc | src/Deriving/Traverse.hs | mit | 7,650 | 8 | 21 | 2,675 | 2,865 | 1,442 | 1,423 | -1 | -1 |
{-# OPTIONS_GHC -fexcess-precision #-}
--
-- The Computer Language Shootout
-- http://shootout.alioth.debian.org/
--
-- Contributed by Olof Kraigher, with help from Don Stewart.
--
-- Compile with:
--
-- -funbox-strict-fields -fglasgow-exts -fbang-patterns -O3
-- -optc-O3 -optc-mfpmath=sse -optc-msse2 -optc-march... | hvr/jhc | regress/tests/8_shootout/nbody.hs | mit | 5,545 | 0 | 19 | 1,583 | 2,034 | 1,025 | 1,009 | 141 | 1 |
module Util.Happstack
(createJSONResponse) where
import qualified Data.ByteString.Char8 as BS
import qualified Data.ByteString.Lazy.Char8 as BSL
import Happstack.Server
import Data.Aeson (ToJSON, encode)
-- | Creates a JSON response.
createJSONResponse :: ToJSON a => a -> Response
createJSONResponse x = toRespons... | tamaralipowski/courseography | hs/Util/Happstack.hs | gpl-3.0 | 483 | 0 | 9 | 84 | 130 | 75 | 55 | 10 | 1 |
module SortingSpec
( main
, spec
) where
import qualified Data.Vector.Unboxed as VU
import MLUtil
import Test.Hspec
spec :: Spec
spec = do
describe "argSort" $ do
it "should return ordered indices" $
argSort (vector [40.0, 30.0, 10.0, 11.0]) `shouldBe` VU.fromLi... | rcook/mlutil | mlutil/spec/SortingSpec.hs | mit | 369 | 0 | 15 | 112 | 121 | 69 | 52 | 13 | 1 |
{-# LANGUAGE TemplateHaskell #-}
-- | Test data.
module Test.Orchid.Data
( factorial_ioSource
, classSource
, errorSource
, global_varSource
, type_errorSource
, rectangleSource
, private_var_insideSource
, private_var_outsideSource
, class_method_insideS... | gromakovsky/Orchid | test/Test/Orchid/Data.hs | mit | 3,215 | 0 | 8 | 699 | 693 | 363 | 330 | 110 | 1 |
module Y2018.M12.D18.Solution where
{--
Read in 'diffs.txt' in this directory, then compute the final value after
applying all these values from a starting value of 0.
--}
exDir, diffs :: FilePath
exDir = "Y2018/M12/D18/"
diffs = "diffs.txt"
result :: FilePath -> IO Integer
result = fmap (sum . map readNum . words)... | geophf/1HaskellADay | exercises/HAD/Y2018/M12/D18/Solution.hs | mit | 421 | 0 | 10 | 77 | 112 | 63 | 49 | 8 | 2 |
-- Ref
-- Terms: ref(ref create) / !(deref) / :=(assignment) / l(ref pos) (13.2)
-- Types: Ref type / Storage type
-- Change storage ===> Change environment (13.3)
-- Exception
-- Terms: Γ⊢undefined : T / try .. with ... / raise t
-- Subtyping (λc)
-- Types: Top (T <: Top) / Bottom (Bot <: T)
-- R... | Airtnp/Freshman_Simple_Haskell_Lib | Intro/TAPL/miscs.hs | mit | 4,605 | 0 | 2 | 1,197 | 86 | 85 | 1 | 1 | 0 |
{-|
- Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
-
- 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
-
- By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even... | MakerBar/haskell-euler | 2/2.hs | mit | 562 | 2 | 9 | 127 | 77 | 39 | 38 | 4 | 1 |
#!/usr/local/bin/runghc -i/home/martyn/bin/hlib
-- base --------------------------------
import qualified System.Environment as SysEnv
import Control.Exception ( tryJust )
import Control.Monad ( guard )
import System.Exit ( ExitCode( ExitFailure )
, exitSuccess, exitWith
... | sixears/test-tap | t/Test.hs | mit | 2,322 | 0 | 14 | 690 | 558 | 309 | 249 | 39 | 3 |
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE UndecidableInstances #-}
module Bio.Data.Fasta
( FastaLike(..)
, fastaReader
) where
import Bio.Motif
import Bio.Seq
import qualified Data.ByteString.Char8 as B
import Conduit
class FastaLike f where
-- | Convert a FASTA record, consisting of a record h... | kaizhang/bioinformatics-toolkit | bioinformatics-toolkit/src/Bio/Data/Fasta.hs | mit | 1,661 | 0 | 20 | 451 | 503 | 258 | 245 | 38 | 3 |
-- mktwit.hs: Cuts a set of text down to chunks of no more than 140 characters suitable for tweeting.
{-# LANGUAGE DeriveDataTypeable, OverloadedStrings, BangPatterns #-}
import qualified Data.ByteString.Lazy.Char8 as L
import Data.Int(Int64)
import Control.Monad
import System.Console.CmdLib
data Main = Main { infile ... | Hrothen/scripts | src/mktwit/mktwit.hs | mit | 1,888 | 0 | 11 | 583 | 587 | 307 | 280 | 39 | 4 |
module SendMoreMoney (sendMoreMoney) where
import Control.Monad (guard)
import FD
sendMoreMoney = runFD $ do
vars@[s, e, n, d, m, o, r, y] <- news 8 (0, 9)
s #\= 0
m #\= 0
allDifferent vars
1000 * s + 100 * e + 10 * n + d
+ 1000 * m + 100 * o + 10 * r + e
#== 10000 * m + 1000 * o + ... | dmoverton/finite-domain | src/SendMoreMoney.hs | mit | 1,200 | 0 | 30 | 456 | 793 | 391 | 402 | 53 | 1 |
-- ~~~~~~~~~~ Monadic FRW, lazy non path-tracking
module Main where
import Nilsson
import Data.Array
import System.Environment
import Control.Monad.ST
import Data.Array.ST
type MyA s = STArray s (Int,Int) [(Capacity,Length)]
frw n xs = runST $
do {
xa <- nLA ((1,1),(n,n)) xs;
xb <- nLA ((1,1),(n,n))... | jcsaenzcarrasco/MPhil-thesis | frwM.hs | mit | 1,546 | 0 | 19 | 609 | 745 | 392 | 353 | 48 | 4 |
module LLVM.Codegen.GC (
sizeof,
gcinit,
gcmalloc,
gccollect,
gcdisable,
gcdiagnostic,
) where
import LLVM.General.AST
import LLVM.Codegen.Types
import LLVM.Codegen.Utils
import LLVM.Codegen.Instructions
import LLVM.Codegen.Builder
import qualified LLVM.General.AST.Constant as C
-- | Return the constant ... | sdiehl/llvm-codegen | src/LLVM/Codegen/GC.hs | mit | 1,099 | 0 | 9 | 209 | 310 | 167 | 143 | 33 | 1 |
{-------------------------------------------------------------------------------
Let (a, b, c) represent the three sides of a right angle triangle with integral
length sides. It is possible to place four such triangles together to form a
square with length c.
For example, (3, 4, 5) triangles can be placed together to... | dpieroux/euler | 0139.hs | mit | 2,493 | 16 | 18 | 684 | 305 | 160 | 145 | 16 | 1 |
module Y2018.M04.D05.Solution where
{--
We're basically rewriting Store.SQL.Connection. Good module, if you only have
one database to manage, but now I have multiple SQL databases, so I have to
make all these functions confirgurable.
--}
import Database.PostgreSQL.Simple
import System.Environment
-- let's codify whi... | geophf/1HaskellADay | exercises/HAD/Y2018/M04/D05/Solution.hs | mit | 1,526 | 0 | 11 | 328 | 302 | 160 | 142 | 22 | 1 |
module P006 where
import Euler
solution :: EulerType
solution = Left $ (sumN1 100) ^ 2 - sumN2 100
main = printEuler solution
| Undeterminant/euler-haskell | P006.hs | cc0-1.0 | 126 | 0 | 9 | 23 | 46 | 25 | 21 | 5 | 1 |
-- An artificial bee colony algorithm for the maximally diverse grouping problem
-- Francisco J. Rodriguez, M. Lozano, C. Garcia-martinez,
-- Jonathan D. Gonzalez-Barrera
-- January 2013
import System.Random
import System.Environment
import Data.Ord
import Data.List
import qualified Data.Map as Map
import qualified Da... | jorenverspeurt/portfolio | Haskell/abc.hs | gpl-2.0 | 20,928 | 0 | 23 | 6,328 | 6,917 | 3,626 | 3,291 | 389 | 2 |
module HLinear.Test.Matrix.Basic
where
import HLinear.Utility.Prelude
import Control.Applicative ( (<$>), (<*>), (<|>) )
import Math.Structure.Tasty
import Test.Tasty
import qualified Data.Vector as V
import HLinear.Utility.NmbRowColumn
import HLinear.Matrix ( Matrix )
import qualified HLinear.Matrix as M
import HLi... | martinra/hlinear | test/HLinear/Test/Matrix/Basic.hs | gpl-3.0 | 1,404 | 0 | 17 | 472 | 449 | 245 | 204 | -1 | -1 |
{- Math.Geom.Delaunay - Delaunay algorithm implementation.
Copyright 2013 Alan Manuel K. Gloria
This file is part of Merchant's Race.
Merchant's Race is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either versi... | AmkG/merchants-race | Math/Geom/Delaunay.hs | gpl-3.0 | 9,656 | 0 | 28 | 3,651 | 2,783 | 1,439 | 1,344 | 185 | 11 |
-- |
-- Copyright : © 2009 CNRS - École Polytechnique - INRIA
-- License : GPL
--
-- Interface for all code generators.
module Dedukti.CodeGen where
import Dedukti.Core
import Dedukti.Module
import Data.ByteString.Lazy.Char8 (ByteString)
class CodeGen o where
data Bundle o
-- | Emit code corresponding to... | mboes/dedukti | Dedukti/CodeGen.hs | gpl-3.0 | 772 | 0 | 10 | 214 | 118 | 71 | 47 | -1 | -1 |
(++) <$> ["ha","heh","hmm"] <*> ["?","!","."]
newtype CharList = CharList { getCharList :: [Char] } deriving (Eq, Show)
<> <$> <+> <*> <|> >>=
--
infixl 4 <$>
(<$>) :: Functor f => (a -> b) -> f a -> f b
--
infixl 4 <*>
(<*>) :: Applicative f => f (a -> b) -> f a -> f b
--
infixl 1 >>=
(>>=) :: Monad m => m a -> (... | YPBlib/NaiveFunGame_hs | draftmd.hs | gpl-3.0 | 391 | 4 | 10 | 101 | 233 | 130 | 103 | -1 | -1 |
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE KindSignatures #-}
-- | This module defines types for describing formats
module Format.Base where
import Data.Proxy
import GHC.TypeLits
-- Sequence
data a :*: b = a :*: b
-- Alternative
data a :+: b = L a
| R b
-- Zero or more
dat... | marco-vassena/svc | src/Format/Base.hs | gpl-3.0 | 884 | 0 | 8 | 213 | 131 | 85 | 46 | 13 | 0 |
module BarTender.Process
( forkChild
, forkChildFinally
, killChildren
, waitForChildren
) where
import Control.Applicative
import Control.Concurrent
import Control.Concurrent.STM.TMVar
import Control.Exception.Base
import Control.Monad
import Control.Monad.STM
import Data.Maybe
import System.IO.... | chrisbouchard/bartender | src/BarTender/Process.hs | gpl-3.0 | 2,009 | 0 | 14 | 472 | 437 | 223 | 214 | 41 | 1 |
-- | Nonderministic Finite Automata
module NFA
(
matches
) where
import Control.Monad.State (State, evalState, get, put)
import Data.List (foldl')
import Data.Maybe (isNothing)
import Regx
type SID = Int
data NFA = NFA { rules :: [Rule]
, currentStates :: [SID]
, acceptStates ... | bixuanzju/Simple-Regex | src/NFA.hs | gpl-3.0 | 3,680 | 0 | 17 | 1,470 | 1,245 | 637 | 608 | 84 | 7 |
module Experiment.Battlefield.Soldier
( soldierWire
, swordsmanClass
, archerClass
, axemanClass
, longbowmanClass
, horsemanClass
, horsearcherClass
, allClasses
, classStats
, classWorth
, normedClassWorths
) where
-- import Control.Wire.Unsafe.Event
-- import Data.Fixed (mod'... | mstksg/netwire-experiments | src/Experiment/Battlefield/Soldier.hs | gpl-3.0 | 8,797 | 3 | 23 | 2,796 | 2,531 | 1,350 | 1,181 | -1 | -1 |
{-# LANGUAGE DeriveGeneric #-}
module System.DevUtils.Redis.Helpers.CommandStats.Include (
CommandStat(..),
CommandStats(..)
) where
import GHC.Generics (Generic)
--data CommandStats = CommandStats [CommandStat] deriving (Show, Read, Eq, Generic)
type CommandStats = [CommandStat]
data CommandStat = CommandStat {
... | adarqui/DevUtils-Redis | src/System/DevUtils/Redis/Helpers/CommandStats/Include.hs | gpl-3.0 | 439 | 0 | 8 | 60 | 99 | 64 | 35 | 12 | 0 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ExtendedDefaultRules #-}
{-# OPTIONS_GHC -fno-warn-type-defaults #-}
import Shelly
import Data.Text as T
import System.Directory (removeFile)
import System.Environment (getArgs)
import System.IO.Error
default (T.Text)
cleanTmp :: IO ()
cleanTmp = do
r <- tryIOError $ r... | zackp30/dotfiles | home/bin/scrot2.hs | gpl-3.0 | 1,028 | 0 | 11 | 189 | 322 | 165 | 157 | 27 | 2 |
module Hadolint.Rule.DL3059 (rule) where
import Hadolint.Rule
import Language.Docker.Syntax
data Acc
= Acc RunFlags
| Empty
deriving (Eq, Show)
rule :: Rule args
rule = customRule check (emptyState Empty)
where
code = "DL3059"
severity = DLInfoC
message = "Multiple consecutive `RUN` instructions... | lukasmartinelli/hadolint | src/Hadolint/Rule/DL3059.hs | gpl-3.0 | 668 | 0 | 11 | 152 | 226 | 117 | 109 | -1 | -1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | rueshyna/gogol | gogol-android-enterprise/gen/Network/Google/Resource/AndroidEnterprise/ServiceAccountkeys/Delete.hs | mpl-2.0 | 3,943 | 0 | 14 | 811 | 393 | 239 | 154 | 62 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-healthcare/gen/Network/Google/Resource/Healthcare/Projects/Locations/DataSets/ConsentStores/Consents/Activate.hs | mpl-2.0 | 7,401 | 0 | 16 | 1,443 | 793 | 469 | 324 | 125 | 1 |
module GameTree ( GameTree(..)
, isGameTreePuttingAllowed
, selectGameTreeFields
, emptyGameTree
, buildGameTree
, putGameTreePlayersPoint
, putGameTreePoint
, gameTreeBack
, gameTreeIsEmpty
... | kurnevsky/missile | src/GameTree.hs | agpl-3.0 | 3,541 | 0 | 15 | 944 | 1,052 | 558 | 494 | 76 | 2 |
{-# LANGUAGE OverloadedStrings #-}
module Misc.MarkdownSpec where
import Misc.Markdown
import SpecHelper
spec :: Spec
spec =
describe "Core.MarkdownSpec" $ do
context "Simple Text" $ do
it "parses simple string" $ do
parse "#### Hello\r\n\r\n" `shouldBe`
Just (Markdown [H4 "Hello"])
... | inq/manicure | spec/Misc/MarkdownSpec.hs | agpl-3.0 | 1,189 | 0 | 19 | 293 | 315 | 154 | 161 | 30 | 1 |
module Arith3Broken where
main :: IO ()
main = do
print (1 + 2)
putStrLn (show 10)
print (negate (-1))
let blah = negate 1 in print ((+) 0 blah)
| thewoolleyman/haskellbook | 05/09/maor/arith3broken.hs | unlicense | 162 | 0 | 11 | 47 | 91 | 44 | 47 | 7 | 1 |
import System.Random
-- Sieve implementations
------------------------
-- This sieve uses mod. It's not the sieve of eratosthenes.
sievem :: Integral a => [a] -> [a]
sievem [] = []
sievem (p:z) = p : sievem [x | x <- z, mod x p > 0]
-- The real sieve of eratosthenes only uses the plus (+) operation :-)
-- assumes th... | maltindal/algorithms | basics/eratos.hs | apache-2.0 | 1,889 | 0 | 14 | 445 | 765 | 403 | 362 | 30 | 2 |
module AST where
type AST = [TopDef]
data TopDef = Def Def
| Struct Symbol Tsyms
data Def = FuncDef Symbol Tsyms Type Expr
| VarDef Tsym Expr
deriving (Show)
data Symbol = Symbol String
deriving (Show, Eq)
instance Ord Symbol whe... | rbtying/parsel | src/AST.hs | apache-2.0 | 1,906 | 0 | 8 | 913 | 577 | 316 | 261 | 60 | 0 |
{-# LANGUAGE OverloadedStrings #-}
import Control.Monad
import Control.Concurrent
import Data.List
import Control.Exception (finally)
import Data.Maybe (fromJust)
import qualified Network.WebSockets as WS
import qualified Data.Text as T
import qualified Data.ByteString as BS
import qualified Data.Map ... | gavinwahl/websocket-channel-server | Main.hs | bsd-2-clause | 4,411 | 0 | 20 | 923 | 1,280 | 665 | 615 | 99 | 2 |
{-# LANGUAGE TypeFamilies #-}
module Control.Monad.Trans.Abort.Instances.MonadsTF where
import Control.Monad.Cont.Class (MonadCont(..))
import Control.Monad.Error.Class (MonadError(..))
import Control.Monad.RWS.Class (MonadRWS(..))
import Control.Monad.Reader.Class (MonadReader(..))
import Control.Monad.Trans (lift)
... | gcross/AbortT-monadstf | Control/Monad/Trans/Abort/Instances/MonadsTF.hs | bsd-2-clause | 1,259 | 0 | 8 | 233 | 436 | 240 | 196 | 30 | 0 |
{-# OPTIONS -Wall -fwarn-tabs -fno-warn-type-defaults #-}
module GameLogic where
import qualified Data.Set as Set
import Data.Map (Map)
import qualified Data.Map as Map
import Data.List
import Data.Maybe
import Control.Monad
import Text.ParserCombinators.Parsec hiding (Line)
type Point = (Int, Int)
data Line = VL -... | siyusong/Morphy | GameLogic.hs | bsd-3-clause | 8,227 | 1 | 16 | 2,242 | 3,272 | 1,717 | 1,555 | 223 | 5 |
module Tct.Hoca.Config where
import Tct.Core
import Tct.Core.Common.Error (catchError)
import Tct.Trs (TrsStrategy, runtime)
import qualified Tct.Hoca.Strategies as S
import Tct.Hoca.Types
hocaDeclarations :: Declared TrsProblem TrsProblem => [StrategyDeclarat... | ComputationWithBoundedResources/tct-hoca | src/Tct/Hoca/Config.hs | bsd-3-clause | 1,363 | 0 | 11 | 251 | 375 | 203 | 172 | -1 | -1 |
module BowlingKata.Day11Spec (spec) where
import Test.Hspec
import BowlingKata.Day11 (score)
spec :: Spec
spec = do
it "is a gutter game"
((score . rollMany 20 $ 0) == 0)
it "rolls all ones"
((score . rollMany 20 $ 1) == 20)
it "rolls one spare"
... | Alex-Diez/haskell-tdd-kata | old-katas/test/BowlingKata/Day11Spec.hs | bsd-3-clause | 742 | 0 | 16 | 256 | 299 | 154 | 145 | 21 | 1 |
module Main where
import Control.Applicative ((<$>))
import Control.Monad (liftM2)
import Data.List (subsequences)
import Data.Monoid ((<>))
import System.Exit (exitFailure, exitSuccess)
import System.Directory (getDirectoryContents)
import System.I... | davnils/katt | katt-tests/src/TestSourceHandler.hs | bsd-3-clause | 2,204 | 0 | 15 | 479 | 575 | 312 | 263 | 40 | 4 |
{-# OPTIONS -cpp #-}
module Main where
import Control.Concurrent (forkIO, threadDelay)
import Control.Concurrent.MVar (putMVar, takeMVar, newEmptyMVar)
import Control.Monad
import Control.Exception
import Data.Maybe (isNothing)
import System.Environment (getArgs)
import System.Exit
import System.IO (hPutStrLn, stderr)... | mettekou/ghc | testsuite/timeout/timeout.hs | bsd-3-clause | 5,252 | 1 | 19 | 1,913 | 865 | 427 | 438 | -1 | -1 |
{-# LANGUAGE ViewPatterns #-}
import Data.Profunctor
foo :: Int -> Int
foo@(lmap foo -> bar) = (+1)
| sleexyz/haskell-fun | MultiBind.hs | bsd-3-clause | 103 | 0 | 8 | 20 | 39 | 22 | 17 | 4 | 1 |
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE FlexibleInstances #-}
-- *** TODO ***
--
-- GHC 8.0.1 complains about the definition of atomic:
--
-- • Cannot instantiate unification variable ‘a0’
-- with a type involving foralls: (forall c. Atomic c a) -> AUTOSAR a
-- GHC doesn't yet su... | josefs/autosar | ARSim/arsim/Speculation3.hs | bsd-3-clause | 3,074 | 0 | 11 | 870 | 678 | 377 | 301 | -1 | -1 |
module Main where
import Data.GraphQL.XXX.Schema
import System.Environment
import Text.ParserCombinators.Parsec
main :: IO ()
main = do
(expr:_) <- getArgs
putStrLn (readSchema expr)
readSchema :: String -> String
readSchema input = case parse graphQLStatements "GraphQL Schema" inpu... | uebayasi/haskell-graphql-schema | app/Main.hs | bsd-3-clause | 395 | 0 | 9 | 92 | 119 | 61 | 58 | 12 | 2 |
module ElmFormat.Filesystem where
import System.FilePath.Find (find, fileName, (/=?), (==?), extension)
findAllElmFiles :: FilePath -> IO [FilePath]
findAllElmFiles inputFile =
find
(fileName /=? "elm-stuff") -- TODO: not tested
(extension ==? ".elm")
inputFile
| fredcy/elm-format | src/ElmFormat/Filesystem.hs | bsd-3-clause | 293 | 0 | 7 | 62 | 78 | 47 | 31 | 8 | 1 |
{-# LANGUAGE DeriveGeneric #-}
module ZM.Type.Tuples (
Tuple2(..),
Tuple3(..),
Tuple4(..),
Tuple5(..),
Tuple6(..),
Tuple7(..),
Tuple8(..),
Tuple9(..)
) where
import Data.Model
data Tuple2 a b = Tuple2 a b deriving (Eq, Ord, Show, Generic)
instance (Model a,Model b) =>... | tittoassini/typed | src/ZM/Type/Tuples.hs | bsd-3-clause | 1,662 | 0 | 7 | 365 | 875 | 482 | 393 | 27 | 0 |
{-# LANGUAGE ExistentialQuantification, FlexibleInstances, GeneralizedNewtypeDeriving,
MultiParamTypeClasses, TypeSynonymInstances, DeriveDataTypeable,
LambdaCase, NamedFieldPuns, DeriveTraversable #-}
-----------------------------------------------------------------------------
-- |
-- Modul... | xmonad/xmonad | src/XMonad/Core.hs | bsd-3-clause | 33,424 | 2 | 18 | 8,169 | 6,268 | 3,394 | 2,874 | -1 | -1 |
{-# LANGUAGE OverloadedStrings, Rank2Types #-}
module MOO.Builtins.Values (builtins) where
import Control.Applicative ((<$>), (<*>), (<|>))
import Control.Monad (unless, (<=<))
import Data.ByteString (ByteString)
import Data.Char (isDigit, digitToInt)
import Data.Monoid ((<>), mconcat)
import Data.Text (Text)
import... | verement/etamoo | src/MOO/Builtins/Values.hs | bsd-3-clause | 17,268 | 178 | 21 | 4,962 | 6,294 | 3,280 | 3,014 | 372 | 6 |
-- Copyright : (C) 2009 Corey O'Connor
-- License : BSD-style (see the file LICENSE)
module Bind.Marshal.Prelude ( module Bind.Marshal.Prelude
, module Bind.Marshal.TypePrelude
, module Prelude
, module Bind.Marshal.Control.Mon... | coreyoconnor/bind-marshal | src/Bind/Marshal/Prelude.hs | bsd-3-clause | 2,049 | 0 | 6 | 849 | 307 | 204 | 103 | 46 | 1 |
{-# LANGUAGE TypeSynonymInstances, FlexibleInstances #-}
module Wigner.ExpressionHelpers(
makeExpr, mapTerms,
mapOpFactors, mapFuncGroups, mapFuncFactors
) where
import Wigner.Expression
import Wigner.Complex
mapTerms :: (Term -> Expr) -> Expr -> Expr
mapTerms f (Expr s) = sum (map (\(c, t) -> makeExpr ... | fjarri/wigner | src/Wigner/ExpressionHelpers.hs | bsd-3-clause | 2,749 | 1 | 14 | 526 | 934 | 470 | 464 | 57 | 2 |
module Data.Phonology.Representations ( FValue(..)
, FMatrix(..)
, Segment
, RuleState
, (|>|)
, (|?|)
... | dmort27/HsSPE | Data/Phonology/Representations.hs | bsd-3-clause | 20,312 | 0 | 19 | 4,096 | 3,405 | 1,985 | 1,420 | 239 | 2 |
module Data.Vector.Split
( chunksOf
, splitPlaces
, splitPlacesBlanks
, chop
, divvy
, module Data.Vector.Split.Internal
) where
import Data.Vector.Generic (Vector)
import qualified Data.Vector.Generic as V
import Data.List (unfoldr)
import Data.Vector.Split.Internal
... | fhaust/vector-split | src/Data/Vector/Split.hs | bsd-3-clause | 4,721 | 0 | 13 | 1,100 | 742 | 418 | 324 | 33 | 2 |
{-# OPTIONS_GHC -W #-}
module Parse.Helpers where
import Prelude hiding (until)
import Control.Applicative ((<$>),(<*>))
import Control.Monad
import Control.Monad.State
import Data.Char (isUpper)
import qualified Data.Set as Set
import qualified Data.Map as Map
import Text.Parsec hiding (newline,spaces,State)
import T... | deadfoxygrandpa/Elm | compiler/Parse/Helpers.hs | bsd-3-clause | 12,328 | 0 | 22 | 3,392 | 4,234 | 2,192 | 2,042 | 295 | 3 |
{-# OPTIONS_GHC -Wall #-}
{-# LANGUAGE OverloadedStrings #-}
module Develop.StaticFiles.Build
( readAsset
, compile
)
where
import Control.Monad (void)
import qualified Data.ByteString as BS
import qualified System.Directory as Dir
import System.FilePath ((</>))
import qualified Elm.Project as Project
import... | evancz/cli | src/Develop/StaticFiles/Build.hs | bsd-3-clause | 1,089 | 0 | 8 | 231 | 180 | 112 | 68 | 24 | 1 |
{-# LANGUAGE CPP,TemplateHaskell,DeriveDataTypeable #-}
module Data.Encoding.ISO885914
(ISO885914(..)) where
import Data.Array ((!),Array)
import Data.Word (Word8)
import Data.Map (Map,lookup,member)
import Data.Encoding.Base
import Prelude hiding (lookup)
import Control.OldException (throwDyn)
import Data.Typeable
... | abuiles/turbinado-blog | tmp/dependencies/encoding-0.4.1/Data/Encoding/ISO885914.hs | bsd-3-clause | 876 | 2 | 10 | 120 | 270 | 149 | 121 | 24 | 2 |
module Network.DNS.Cache.Types (
Key
, Prio
, Value(..)
, Entry
, Result(..)
, HostAddress
, Domain
, DNSError(..)
) where
import Data.Array.Unboxed (UArray)
import Data.ByteString.Short (ShortByteString)
import Data.IORef (IORef)
import Data.Time (UTCTime)
import Network.DNS (Domain, DNSError(..))... | kazu-yamamoto/concurrent-dns-cache | Network/DNS/Cache/Types.hs | bsd-3-clause | 1,001 | 0 | 8 | 195 | 227 | 139 | 88 | 26 | 0 |
{-# LANGUAGE QuasiQuotes #-}
module Widgets where
import Graphics.UI.Threepenny.Core
import qualified Graphics.UI.Threepenny as UI
import Control.Monad (mapM, zipWithM_)
import qualified NeatInterpolation as N
import qualified Data.Text as T
collapsiblePanel :: String -> UI Element -> String -> [UI Element] -> UI ... | Chaddai/CurveProject | high-school-plotting/uiSrc/Widgets.hs | bsd-3-clause | 3,271 | 0 | 20 | 926 | 1,087 | 544 | 543 | 65 | 2 |
module Transf.AntiPattern where
-- todo:
-- - for assignables-go-right
-- - support more BinOp's with "<=" -> ">=" etc
-- - support joined conditionals on "&&", "||", etc
-- - more anti-pattern correctors
import Lang.Php
import TransfUtil
import Util
import qualified Data.Intercal as IC
transfs :: [Transf]
trans... | facebookarchive/lex-pass | src/Transf/AntiPattern.hs | bsd-3-clause | 3,940 | 0 | 20 | 1,080 | 1,276 | 669 | 607 | 85 | 8 |
-- |
-- Module: Math.NumberTheory.Logarithms.Internal
-- Copyright: (c) 2011 Daniel Fischer
-- Licence: MIT
-- Maintainer: Daniel Fischer <daniel.is.fischer@googlemail.com>
-- Stability: Provisional
-- Portability: Non-portable (GHC extensions)
--
-- Low level stuff for integer logarithms.
{-# LANGUAGE CP... | shlevy/arithmoi | Math/NumberTheory/Logarithms/Internal.hs | mit | 4,592 | 1 | 40 | 1,820 | 713 | 378 | 335 | -1 | -1 |
{-# OPTIONS_GHC -fglasgow-exts #-}
-----------------------------------------------------------------------------
-- |
-- Module : Control.Morphism.Synchro
-- Copyright : (C) 2008 Edward Kmett
-- License : BSD-style (see the file LICENSE)
--
-- Maintainer : Edward Kmett <ekmett@gmail.com>
-- Stability ... | urska19/MFP---Samodejno-racunanje-dvosmernih-preslikav | Control/Morphism/Synchro.hs | apache-2.0 | 1,645 | 16 | 17 | 394 | 372 | 205 | 167 | -1 | -1 |
module Yesod.Helpers.Acid
( module Yesod.Helpers.Acid
, AcidState
, skipAuthenticationCheck, skipAuthenticationPerform
, sharedSecretCheck, sharedSecretPerform
) where
import Prelude
import Data.Acid
import Data.Acid.Remote
import Data.Acid.Memory (openMemoryState)
import Data.S... | yoo-e/yesod-helpers | Yesod/Helpers/Acid.hs | bsd-3-clause | 8,353 | 0 | 22 | 3,009 | 2,160 | 1,098 | 1,062 | -1 | -1 |
#!/usr/bin/env runhaskell
module Main where
import Control.Monad.Reader
import qualified Control.Monad.State as State
import Control.Monad.Trans(liftIO)
import Data.ByteString.Char8 as ByteString(ByteString, empty, hGet, pack, unpack)
import Data.List(intersperse)
import Graphics.UI.Gtk
import Graphics.UI.Gtk.Glade
i... | dankamongmen/raptitude | tools/resolver-visualize/Main.hs | gpl-2.0 | 63,363 | 55 | 28 | 23,006 | 13,360 | 6,845 | 6,515 | 1,041 | 6 |
{-|
Module : Idris.Elab.RunElab
Description : Code to run the elaborator process.
Copyright :
License : BSD3
Maintainer : The Idris Community.
-}
module Idris.Elab.RunElab (elabRunElab) where
import Idris.Elab.Term
import Idris.Elab.Value (elabVal)
import Idris.AbsSyntax
import Idris.Error
import Idris.C... | ozgurakgun/Idris-dev | src/Idris/Elab/RunElab.hs | bsd-3-clause | 2,034 | 0 | 21 | 598 | 557 | 285 | 272 | 41 | 2 |
module TestLib where
| sdiehl/ghc | testsuite/tests/cabal/cabal10/src/TestLib.hs | bsd-3-clause | 21 | 0 | 2 | 3 | 4 | 3 | 1 | 1 | 0 |
{-# LANGUAGE CPP #-}
{-# LANGUAGE ScopedTypeVariables #-}
import qualified PersistentTest
import qualified RenameTest
import qualified DataTypeTest
import qualified EmptyEntityTest
import qualified HtmlTest
import qualified EmbedTest
import qualified EmbedOrderTest
import qualified LargeNumberTest
import qualified Max... | nakaji-dayo/persistent | persistent-test/test/main.hs | mit | 2,534 | 0 | 13 | 417 | 449 | 255 | 194 | 79 | 1 |
module Foo () where
{-@ choo :: [a] -> {v: Int | v > 0 } @-}
choo = poo
poo :: [a] -> Int
poo (x:xs) = poo xs
poo [] = 0
| ssaavedra/liquidhaskell | tests/neg/grty3.hs | bsd-3-clause | 130 | 0 | 7 | 43 | 53 | 30 | 23 | 5 | 1 |
{-# LANGUAGE TypeFamilies #-}
module T8002 where
import T8002a
| urbanslug/ghc | testsuite/tests/indexed-types/should_compile/T8002.hs | bsd-3-clause | 64 | 0 | 3 | 10 | 8 | 6 | 2 | 3 | 0 |
{-# LANGUAGE OverloadedStrings #-} -- Whatever, it's just an example
module Application where
import Network.Wai
import Network.HTTP.Types (ok200, notFound404)
import Data.Text (Text)
import qualified Data.Text as T
import qualified Data.Text.Encoding as T
import qualified Data.ByteString.Lazy as LZ
import Data.Mon... | singpolyma/route-generator | example/Application.hs | isc | 1,161 | 0 | 14 | 167 | 387 | 219 | 168 | 19 | 1 |
{-# LANGUAGE GADTs #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE FlexibleContexts #-}
data Nat = Z | S Nat deriving (Eq, Show)
type Zero = Z
type One = S Zero
type Two = S One
type Three = S Two
type Four = S Three
type Five = S Four
data Vec ::... | Airtnp/Freshman_Simple_Haskell_Lib | Intro/WIW/Promoted/SizedVec.hs | mit | 2,246 | 0 | 10 | 514 | 679 | 365 | 314 | -1 | -1 |
{-# LANGUAGE FlexibleContexts, FlexibleInstances, UndecidableInstances #-}
{-# LANGUAGE RankNTypes, ScopedTypeVariables #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
module Utils where
import Data.Vinyl hiding (Dict (..))
import Generi... | vladfi1/hs-misc | Utils.hs | mit | 7,460 | 0 | 15 | 1,688 | 3,692 | 1,871 | 1,821 | 130 | 1 |
module InstCtx where
class C a where
f :: a
data T = K
instance C T where
f = K
instance C a => C [a] where
f = [ f ]
| antalsz/hs-to-coq | examples/tests/InstCtx.hs | mit | 128 | 0 | 6 | 43 | 64 | 35 | 29 | 8 | 0 |
module Platform (initPlatform) where
import GHC.IO.Encoding
import System.Win32.Console
initPlatform :: IO ()
initPlatform = do
setLocaleEncoding utf8
setConsoleOutputCP 65001
| HairyDude/pdxparse | os/win32/Platform.hs | mit | 186 | 0 | 7 | 29 | 48 | 26 | 22 | 7 | 1 |
module Hexadecimal
( hexToInt
) where
import Data.Char (isHexDigit, toLower)
import Data.List (foldl')
hexToInt :: String -> Int
hexToInt string
| any (not . isHexDigit) string = 0
| otherwise = convert fromHex 16 string' where
fromHex digit = fromEnum digit - offset digit
offset digit =
... | tfausak/exercism-solutions | haskell/hexadecimal/Hexadecimal.hs | mit | 640 | 0 | 10 | 172 | 216 | 110 | 106 | 18 | 2 |
module Main (main) where
import Criterion.Main (bench, bgroup, defaultMain)
import qualified Y2015.Bench
import qualified Y2016.Bench
main :: IO ()
main = defaultMain
[ Y2015.Bench.benchmarks
, Y2016.Bench.benchmarks
]
| tylerjl/adventofcode | benchmark/Bench.hs | mit | 243 | 0 | 7 | 51 | 67 | 41 | 26 | 8 | 1 |
{-
Copyright (c) 2010-2012, Benedict R. Gaster
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this ... | bgaster/hlinda | Linda.hs | mit | 6,067 | 0 | 15 | 1,666 | 891 | 448 | 443 | 78 | 3 |
module Bindings.Pkcs11.Attribs where
import Bindings.Pkcs11
import Bindings.Pkcs11.Shared
import Data.Bits
import qualified Data.ByteString as BS
import qualified Data.ByteString.UTF8 as BU8
import Data.ByteString.Unsafe
import Data.List
import Data.Word
import Foreign.C.Types
import Foreign.Marshal.Alloc
import Foreig... | denisenkom/hspkcs11 | src/Bindings/Pkcs11/Attribs.hs | mit | 13,312 | 0 | 17 | 2,278 | 3,887 | 1,950 | 1,937 | 239 | 2 |
module Game.Text where
import Control.Monad.Trans
import Control.Monad.Trans.State
import Data.Char
import Game.Graphics
import Game.State
import Settings
-- |Sets font and background color
--
setFontColor :: (GameColor, GameColor) -> StateT GameState IO ()
setFontColor (fc, bc) = do
gameState <- get
put $... | vTurbine/w3dhs | src/Game/Text.hs | mit | 2,026 | 0 | 17 | 595 | 650 | 333 | 317 | 48 | 2 |
{-# LANGUAGE RankNTypes, GADTs, ScopedTypeVariables #-}
-- This module defines a compilers for converting between dynamic
-- programs to static programs omitting as many dynamic checks as possible.
module Compiler where
import Data.Map as Map
import qualified Common as C
import StaticLang
import PrettyPrint
import qu... | plclub/cis670-16fa | projects/DynamicLang/src/Compiler.hs | mit | 6,116 | 0 | 17 | 1,276 | 1,345 | 689 | 656 | 91 | 7 |
import Data.Numbers.Primes
main = print( sum( takeWhile(<=2000000) primes ) ) | emilkloeden/21-days-of-Euler | Haskell/10.hs | mit | 77 | 1 | 10 | 9 | 36 | 18 | 18 | 2 | 1 |
{-# LANGUAGE CPP #-}
{-# LANGUAGE PatternGuards #-}
-- | Manage GHC package databases
module PackageDBs
( PackageDBs (..)
, ArgStyle (..)
, dbArgs
, buildArgStyle
, getPackageDBsFromEnv
, getPackageDBArgs
) where
import System.Environment (getEnvironment)
import System.FilePath (splitSearch... | sol/doctest | src/PackageDBs.hs | mit | 2,537 | 0 | 15 | 612 | 531 | 301 | 230 | 51 | 4 |
import Data.Maybe (fromJust)
import qualified Data.Vector as V
import Algorithms.MDP.Examples.Ex_3_1 hiding (mdp, cost)
import Algorithms.MDP.Examples.Ex_3_2
import Algorithms.MDP
import Algorithms.MDP.ValueIteration
iterations = undiscountedRelativeValueIteration mdp
pairs = zip iterations (tail iterations)
-- | Ta... | prsteele/mdp | src/run-ex-3-2.hs | mit | 697 | 2 | 10 | 113 | 243 | 128 | 115 | 15 | 1 |
{-# htermination show :: (Show a, Show k) => (a,k) -> String #-}
| ComputationWithBoundedResources/ara-inference | doc/tpdb_trs/Haskell/full_haskell/Prelude_show_9.hs | mit | 65 | 0 | 2 | 13 | 3 | 2 | 1 | 1 | 0 |
-- | Commands for the Ultrasonic I2C distance sensor
module NXT.Ultrasonic where
import NXT.Codes
import NXT.Commands
import NXT.Comm
import Data.Word
import qualified Data.ByteString as B
-- I2C device ID of the sensor
i2c_dev = 0x02::Word8
---------------------------------------------------------------------------... | janv/haskell-nxt | src/NXT/Ultrasonic.hs | mit | 2,975 | 4 | 9 | 714 | 690 | 365 | 325 | 41 | 1 |
module Drync.Sync
( sync
, syncFile
, syncDirectory
) where
import Drync.Missing
import Drync.Options
import Drync.System
import Drync.Transfer
import Control.Monad (forM_, when)
import Data.List (partition)
import Data.Time (UTCTime, diffUTCTime)
import Network.Google.Drive
import System.Directory (g... | pbrisbin/drync | src/Drync/Sync.hs | mit | 2,208 | 0 | 12 | 485 | 720 | 382 | 338 | 47 | 2 |
{- |
Module : Text.Highlighting.Kate.Format.Blaze
Copyright : Copyright (C) 2008 John MacFarlane, 2011 Antoine Latter
License : GNU GPL, version 2 or above
Maintainer : Antoine Latter <aslatter@gmail.com>
Stability : alpha
Portability : portable
Formatters that convert a list of anno... | aslatter/kate-blaze | src/Text/Highlighting/Kate/Format/Blaze.hs | gpl-2.0 | 3,591 | 0 | 21 | 1,214 | 877 | 477 | 400 | 62 | 4 |
{-
Copyright (C) 2017 WATANABE Yuki <magicant@wonderwand.net>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is ... | magicant/flesh | hspec-src/Flesh/Language/Parser/BufferSpec.hs | gpl-2.0 | 2,622 | 0 | 32 | 680 | 526 | 266 | 260 | 44 | 1 |
-- Aufgabe 12.17
data Person = PER Name Geschlecht Kinder deriving Show
type Name = String
type Kinder = [Person]
-- a)
benenne_um :: Person -> Name -> Person
benenne_um (PER _ geschlecht kinder) name = (PER name geschlecht kinder)
-- b)
data Geschlecht = Weiblich | Maennlich deriving Show
weiblich :: Person -> Boo... | KaliszAd/programmierung2012 | aufgabe12_17.hs | gpl-2.0 | 1,003 | 0 | 9 | 199 | 358 | 191 | 167 | 21 | 1 |
module Main where
import Primes (primeSequence, prime)
import Util (concatInts, asList, removeDuplicates)
import Data.List (elem, sort, groupBy)
primePair a b = prime x && prime y
where
x = concatInts [a,b]
y = concatInts [b,a]
primesUntil step = takeWhile (\x -> x <= step) primeSequence
getPair... | liefswanson/projectEuler | app/p2/q60/Main.hs | gpl-2.0 | 1,323 | 1 | 12 | 445 | 482 | 255 | 227 | 32 | 1 |
import Data.Char (chr, ord)
import System.IO
import Debug.Trace
import System.Environment
import Control.Monad
data BFCommand = GoRight | GoLeft | Increment | Decrement | Print | Read | While | Wend
| Loop BFSource | IncrementN Int | GoRightN Int | GoLeftN Int | SetZero
deriving (Eq, Show)
type BFSource = [BFComman... | dforgeas/lazyk | bf/bf.hs | gpl-2.0 | 6,380 | 26 | 16 | 1,327 | 2,952 | 1,484 | 1,468 | 163 | 14 |
module Language.Erlang.BEAM.Opcodes where
opcodeInfo :: Int -> (String, Int)
opcodeInfo 1 = ("label", 1)
opcodeInfo 2 = ("func_info", 3)
opcodeInfo 3 = ("int_code_end", 0)
opcodeInfo 4 = ("call", 2)
opcodeInfo 5 = ("call_last", 3)
opcodeInfo 6 = ("call_only", 2)
opcodeInfo 7 = ("call_ext", 2)
opcodeInfo 8 = ("call_ext... | mbrock/HBEAM | src/Language/Erlang/BEAM/Opcodes.hs | gpl-3.0 | 5,287 | 0 | 6 | 789 | 2,180 | 1,246 | 934 | 157 | 1 |
{-# language
StandaloneDeriving
, UndecidableInstances #-}
{-|
Copyright : (c) Quivade, 2017
License : GPL-3
Maintainer : Jakub Kopański <jakub@quivade.com>
Stability : experimental
Portability : POSIX
This module provides basic recursion schemes.
Written for exercise, could possibly be replaced by
... | quivade/screwdriver | src/Language/FIRRTL/Recursion.hs | gpl-3.0 | 1,920 | 0 | 12 | 490 | 793 | 410 | 383 | -1 | -1 |
module Server where
import Control.Concurrent
import Control.Concurrent.Chan
import qualified Data.ByteString as BStr
import System.IO
import Network.Socket
import Config
data ProcStream = ProcStream {
procThread :: ThreadId,
procResult :: Chan BStr.ByteString
}
forkStream :: (Chan BStr.ByteString -> IO ()... | Jon0/status | src/Server.hs | gpl-3.0 | 1,508 | 0 | 10 | 326 | 497 | 244 | 253 | 43 | 1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE ... | wavewave/lhc-analysis-collection | analysis/ATLAS0L2to6JMET8TeV.hs | gpl-3.0 | 15,799 | 0 | 19 | 3,856 | 4,971 | 2,610 | 2,361 | 305 | 3 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-dataproc/gen/Network/Google/Resource/Dataproc/Projects/Regions/AutoscalingPolicies/TestIAMPermissions.hs | mpl-2.0 | 7,208 | 0 | 16 | 1,436 | 790 | 466 | 324 | 125 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-shopping-content/gen/Network/Google/Resource/Content/Buyongoogleprograms/Get.hs | mpl-2.0 | 5,356 | 0 | 18 | 1,248 | 799 | 464 | 335 | 116 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-servicemanagement/gen/Network/Google/Resource/ServiceManagement/Services/Consumers/GetIAMPolicy.hs | mpl-2.0 | 6,023 | 0 | 16 | 1,298 | 789 | 462 | 327 | 120 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-cloudkms/gen/Network/Google/Resource/CloudKMS/Projects/Locations/KeyRings/CryptoKeys/UpdatePrimaryVersion.hs | mpl-2.0 | 6,949 | 0 | 16 | 1,395 | 784 | 459 | 325 | 127 | 1 |
{-|
Module : Codec.Picture.Png.Streaming.Info
Copyright : (c) Bradley Hardy 2016
License: LGPL3
Maintainer: bradleyhardy@live.com
Stability: experimental
Portability: non-portable
-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE OverloadedStrings #-}
module Codec.Picture.Png.Streaming.Info where
import qualified D... | bch29/streaming-png | src/Codec/Picture/Png/Streaming/Info.hs | lgpl-3.0 | 4,268 | 0 | 13 | 974 | 811 | 460 | 351 | 56 | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.