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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
-- E1.hs
{-# OPTIONS_GHC -Wall #-}
module Euler.E001( e001 ) where
e001 :: Integer
e001 = sum $ filter (\x -> divisible x 5 || divisible x 3) [1..999]
where
divisible :: (Integral a) => a -> a -> Bool
divisible a b = if mod a b == 0 then True else False
| ghorn/euler | Euler/E001.hs | bsd-3-clause | 267 | 0 | 10 | 67 | 110 | 60 | 50 | 6 | 2 |
{-# LANGUAGE TemplateHaskell #-}
-- check properties using QuickCheck
module QuickSpec where
import BooleanFormula (eval)
import Test.QuickCheck
-- two properties toDigits that should hold for any vaid input n >= 0
-- eval (toDigits n) == n
-- all (\d -> d >= 0 && d < 10) (toDigits n)
prop_toDigits n = ... | ltfschoen/HelloHaskell | src/Chapter2/Section2/QuickSpec.hs | mit | 590 | 0 | 11 | 136 | 134 | 74 | 60 | -1 | -1 |
-- (c) 2000-2005 by Martin Erwig [see file COPYRIGHT]
-- | Inward directed trees as lists of paths.
module Data.Graph.Inductive.Internal.RootPath (
-- * Types
RTree,LRTree,
-- * Operations
getPath,getLPath,
getDistance,
getLPathNodes
) where
import Data.Graph.Inductive.Graph
type LRTree a = [L... | antalsz/hs-to-coq | examples/graph/graph/Data/Graph/Inductive/Internal/RootPath.hs | mit | 1,340 | 0 | 13 | 403 | 465 | 250 | 215 | 27 | 2 |
{-- snippet all --}
import System.IO
import Data.Char(toUpper)
main :: IO ()
main = do
inh <- openFile "input.txt" ReadMode
outh <- openFile "output.txt" WriteMode
inpStr <- hGetContents inh
let result = processData inpStr
hPutStr outh result
hClose inh
hClose outh
pr... | binesiyu/ifl | examples/ch07/toupper-lazy1.hs | mit | 398 | 0 | 10 | 107 | 116 | 54 | 62 | 13 | 1 |
{- |
Module : ./HasCASL/AsToLe.hs
Description : final static analysis
Copyright : (c) Christian Maeder and Uni Bremen 2003-2005
License : GPLv2 or higher, see LICENSE.txt
Maintainer : Christian.Maeder@dfki.de
Stability : experimental
Portability : portable
conversion from As to Le
-}
module HasC... | spechub/Hets | HasCASL/AsToLe.hs | gpl-2.0 | 7,195 | 0 | 23 | 2,144 | 2,461 | 1,215 | 1,246 | 174 | 8 |
module Lamdu.Editor.Exports (exportActions) where
import GUI.Momentu.ModKey (ModKey)
import Lamdu.Config (Config)
import qualified Lamdu.Config as Config
import Lamdu.Data.Db.Layout (ViewM)
import Lamdu.Data.Export.JS (exportFancy)
import qualified Lamdu.Data.Export.JSON as Expo... | lamdu/lamdu | src/Lamdu/Editor/Exports.hs | gpl-3.0 | 1,430 | 0 | 10 | 295 | 327 | 190 | 137 | -1 | -1 |
module Recovery where
test = (test "text"
-- Must recover here
main = putStrLn "Hello world!!!"
| Atsky/haskell-idea-plugin | data/recoveryTests/Recovery.hs | apache-2.0 | 98 | 1 | 6 | 18 | 23 | 13 | 10 | -1 | -1 |
module Main where
import Options.Applicative
import System.FilePath (replaceExtension)
import Haskus.Utils.List (isSuffixOf)
import Haskus.Utils.Flow (forM_,when)
import qualified Haskus.Format.Compression.GZip as GZip
import Haskus.Format.Binary.Buffer
import qualified Haskus.Format.Text as Text
main :: IO ()
main ... | hsyl20/ViperVM | haskus-system-tools/src/gunzip/Main.hs | bsd-3-clause | 1,156 | 0 | 20 | 324 | 359 | 190 | 169 | 33 | 2 |
{-|
Module : IRTS.Compiler
Description : Coordinates the compilation process.
Copyright :
License : BSD3
Maintainer : The Idris Community.
-}
{-# LANGUAGE PatternGuards, TypeSynonymInstances, CPP #-}
module IRTS.Compiler(compile, generate) where
import IRTS.Lang
import IRTS.LangOpts
import IRTS.Defunction... | tpsinnem/Idris-dev | src/IRTS/Compiler.hs | bsd-3-clause | 25,102 | 0 | 27 | 8,567 | 8,413 | 4,163 | 4,250 | 462 | 33 |
{-# LANGUAGE OverloadedStrings #-}
module GitHub.CommitsSpec where
import GitHub.Auth (Auth (..))
import GitHub.Endpoints.Repos.Commits (commitSha, commitsForR, diffR, mkCommitName, FetchCount (..))
import GitHub.Request (github)
import Control.Monad (forM_)
import Data.Either.... | jwiegley/github | spec/GitHub/CommitsSpec.hs | bsd-3-clause | 2,462 | 0 | 21 | 598 | 778 | 398 | 380 | 51 | 2 |
{- | Module : $Header$
- Description : Implementation of logic instance Graded Modal Logic
- Copyright : (c) Daniel Hausmann & Georgel Calin & Lutz Schroeder, DFKI Lab Bremen,
- Rob Myers & Dirk Pattinson, Department of Computing, ICL
- License : GPLv2 or higher, see LICENSE.txt
- Main... | mariefarrell/Hets | GMP/GMP-CoLoSS/GMP/Logics/G.hs | gpl-2.0 | 4,750 | 0 | 24 | 1,224 | 1,650 | 876 | 774 | 69 | 1 |
{-# LANGUAGE RankNTypes #-}
module T11514 where
foo :: forall a. (Show a => a -> a) -> ()
foo = undefined
| sdiehl/ghc | testsuite/tests/typecheck/should_fail/T11514.hs | bsd-3-clause | 108 | 0 | 9 | 24 | 40 | 23 | 17 | 4 | 1 |
{-# LANGUAGE Rank2Types #-}
module LiftToTopLevel.Signature2 where
{- Lifting baz to the top level should bring in xx and a as parameters,
and update the signature to include these.
The refactoring can be completed as the Rank2Types extension is enabled
-}
foo a = (baz xx a)
where
xx :: (Num t) => t -> t ... | RefactoringTools/HaRe | test/testdata/LiftToToplevel/Signature2r.expected.hs | bsd-3-clause | 422 | 0 | 10 | 108 | 113 | 60 | 53 | 7 | 1 |
{-# LANGUAGE NoImplicitPrelude, OverloadedStrings #-}
module IHaskell.Eval.Parser (
parseString,
CodeBlock(..),
StringLoc(..),
DirectiveType(..),
LineNumber,
ColumnNumber,
ErrMsg,
layoutChunks,
parseDirective,
getModuleName,
Located(..),
PragmaType(..),
) where
impo... | artuuge/IHaskell | src/IHaskell/Eval/Parser.hs | mit | 12,547 | 0 | 16 | 3,617 | 2,744 | 1,442 | 1,302 | 218 | 13 |
--------------------------------------------------------------------------------
-- | The LLVM abstract syntax.
--
module Llvm.AbsSyn where
import Llvm.MetaData
import Llvm.Types
import Unique
-- | Block labels
type LlvmBlockId = Unique
-- | A block of LLVM code.
data LlvmBlock = LlvmBlock {
-- | The code labe... | urbanslug/ghc | compiler/llvmGen/Llvm/AbsSyn.hs | bsd-3-clause | 8,875 | 0 | 9 | 2,499 | 566 | 366 | 200 | 66 | 0 |
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE FlexibleContexts #-}
module Yesod.Routes.Class
( RenderRoute (..)
, ParseRoute (..)
, RouteAttrs (..)
) where
import Data.Text (Text)
import Data.Set (Set)
class Eq (Route a) => RenderRoute a where
-- | The <http://www.yesodweb.com/book/routing-and-handle... | geraldus/yesod | yesod-core/src/Yesod/Routes/Class.hs | mit | 998 | 0 | 10 | 226 | 195 | 112 | 83 | 18 | 0 |
{-# OPTIONS_GHC -fwarn-unsafe #-}
{-# LANGUAGE FlexibleInstances #-}
module SH_Overlap6_A (
C(..)
) where
import SH_Overlap6_B
instance
{-# OVERLAPS #-}
C [Int] where
f _ = "[Int]"
| urbanslug/ghc | testsuite/tests/safeHaskell/overlapping/SH_Overlap6_A.hs | bsd-3-clause | 198 | 0 | 6 | 44 | 38 | 24 | 14 | 9 | 0 |
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE TypeFamilies #-}
-- | An unstructured grab-bag of various tools and inspection
-- functions that didn't really fit anywhere else.
module Futhark.Tools
( module Futhark.Construct,
redomapToMapAndReduce,
dissectScrema,
sequentialStreamWholeArray,
partition... | diku-dk/futhark | src/Futhark/Tools.hs | isc | 5,418 | 0 | 18 | 1,135 | 1,432 | 730 | 702 | 107 | 2 |
module CardGame where
import Prelude
-- 6.53
data Suit = Spades | Hearts |
Diamonds | Clubs
deriving (Eq, Show)
-- 2..9,j,q,k,* (Ace)
type Value = Char
type Card = (Suit,Value)
type Deck = [Card]
-- 6.55
data Player = North | South |
East | West
deriving (Eq,Show... | CarmineM74/haskell_craft3e | cardgame.hs | mit | 3,605 | 0 | 12 | 802 | 1,488 | 870 | 618 | 72 | 1 |
{-# LANGUAGE TupleSections, ViewPatterns, MultiWayIf, OverloadedLists #-}
{-# LANGUAGE ScopedTypeVariables, OverloadedStrings, PatternGuards, QuasiQuotes #-}
module Control.OperationalTransformation.JSON.Transform where
import qualified Control.OperationalTransformation as C
import Control.OperationalTransformation.... | thomasjm/ot.hs | src/Control/OperationalTransformation/JSON/Transform.hs | mit | 14,053 | 24 | 19 | 2,461 | 3,825 | 2,010 | 1,815 | 133 | 17 |
module HMenu.Select (
select
) where
import Data.List (sort)
select :: (String -> String -> Integer) -> String -> [String] -> [String]
select metric input xs = map snd $ sort scoreAndElem
where d = metric input
scores = map d xs
scoreAndElem = zip scores xs
| thelastnode/hmenu | HMenu/Select.hs | mit | 280 | 0 | 8 | 69 | 107 | 57 | 50 | 8 | 1 |
{-# LANGUAGE GADTs #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE RecursiveDo #-}
{-# LANGUAGE TypeSynonymInstances #-}
{-# LANGUAGE FlexibleInstances ... | mfpi/boom | src/CleanFRP.hs | mit | 12,964 | 0 | 25 | 3,009 | 4,277 | 2,278 | 1,999 | -1 | -1 |
module Main where
import Hunch.Options.Data
import Hunch.Options.CommandLine
import Hunch.Runner
import Data.Maybe (isNothing)
import Control.Monad (when)
main :: IO ()
main = withOptions $ \opts -> do
let versionOpt = version opts
simulateOpt = simulate opts
noInput = isNothing . input $ opts
... | loganbraga/hunch | app/Main.hs | mit | 612 | 0 | 13 | 133 | 141 | 73 | 68 | 15 | 1 |
{-# LANGUAGE GeneralizedNewtypeDeriving #-} -- haskell-mode wants this
{-# LANGUAGE LambdaCase #-}
module PPL2.CodeGen.Builder where
import PPL2.Prelude
import PPL2.VM.Types
-- ----------------------------------------
newtype Builder a = BU {unBU :: ([a] -> [a])}
instance Semigroup (Builder a) where
BU x <> BU ... | UweSchmidt/ppl2 | src/PPL2/CodeGen/Builder.hs | mit | 1,542 | 0 | 9 | 313 | 477 | 266 | 211 | 51 | 1 |
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE ExistentialQuantification #-}
module MemoryManager.Types where
import SoOSiM
data MemorySource
= MemorySource
{ baseAddress :: Int
, scope :: Int
, sourceId :: Maybe ComponentId
}
data MemState =
MemState { addressLookup :: [MemorySource]
... | christiaanb/SoOSiM | examples/MemoryManager/Types.hs | mit | 515 | 0 | 9 | 146 | 102 | 61 | 41 | 16 | 0 |
map :: (a -> b) -> [a] -> [b]
map _ [] = []
map f (x:xs) = f x : map f xs | iharh/fp-by-example | tex/src/map_hof.hs | mit | 77 | 0 | 7 | 27 | 70 | 36 | 34 | 3 | 1 |
--set difference on ordered lists
minus :: (Ord a) => [a] -> [a] -> [a]
minus (x:xs) (y:ys) = case (compare x y) of
LT -> x : minus xs (y:ys)
EQ -> minus xs ys
GT -> minus (x:xs) ys
minus xs _ = xs
primesToM :: Integer -> [Integer]
primesToM m = 2 : sieve [3,... | DylanSp/Project-Euler-in-Haskell | prob3/solution.hs | mit | 596 | 0 | 15 | 188 | 314 | 165 | 149 | 13 | 3 |
listToNumber :: [Int] -> Int
listToNumber [] = 0
listToNumber (x:xs) = x*(10^(length xs)) + (listToNumber xs) | mbyankova/fp2015 | week11/listToNumber.hs | mit | 109 | 0 | 10 | 16 | 65 | 34 | 31 | 3 | 1 |
{-# LANGUAGE TypeFamilies, KindSignatures, DataKinds, TypeOperators #-}
{-# LANGUAGE ScopedTypeVariables, FlexibleContexts #-}
{-# LANGUAGE BangPatterns #-}
import Prelude hiding (id, (.))
import Control.Applicative
import Control.Category
import Control.Monad
import ... | nshepperd/funn | mhug-talk-15/demo.hs | mit | 3,023 | 0 | 16 | 953 | 961 | 521 | 440 | 68 | 1 |
--
-- The following iterative sequence is defined for the set of positive integers:
-- n -> n/2 (n is even)
-- n -> 3n + 1 (n is odd)
-- Using the rule above and starting with 13, we generate the following sequence:
-- 13 -> 40 -> 20 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1
--
-- It can be seen that this sequence (starting... | stu-smith/project-euler-haskell | Euler-014b.hs | mit | 1,056 | 0 | 10 | 233 | 200 | 109 | 91 | 13 | 1 |
-- | Provides API for managing values that may be extracter from or injected to
-- sass source file.
module Text.Sass.Values
(
SassMapEntry
, SassValue (..)
, Lib.SassSeparator (..)
) where
import qualified Bindings.Libsass as Lib
-- | Entry of 'SassMap'.
type SassMapEntry = (SassValue, SassValue)
-- | R... | jakubfijalkowski/hsass | Text/Sass/Values.hs | mit | 1,113 | 0 | 8 | 410 | 155 | 103 | 52 | 21 | 0 |
-- Functions from http://learnyouahaskell.com/syntax-in-functions
lucky :: (Integral a) => a -> String
lucky x = if x ==7
then "LUCKY NUMBER SEVEN!"
else "Sorry, out of luck"
-- Using pattern matching
lucky' :: (Integral a) => a -> String
lucky' 7 = "LUCKY NUMBER SEVEN"
lucky' x = "Sorry, out of luck"
-- Defin... | jeiros/Haskell-Tutorial | functions_page3.hs | mit | 4,055 | 0 | 11 | 1,050 | 1,331 | 717 | 614 | 80 | 3 |
module Rules (applyRules) where
import Lex
applyRules :: Cmplx -> Cmplx -> [Cmplx]
applyRules a b = forwardApplication a b ++
backwardApplication a b ++
forwardComposition a b ++
forwardCrossingComposition a b ++
backwa... | agrasley/HaskellCCG | Rules.hs | mit | 2,887 | 0 | 14 | 823 | 892 | 455 | 437 | 43 | 11 |
module ZoomHub.Types.Content
( Content,
contentId,
contentType,
contentURL,
contentState,
contentInitializedAt,
contentActiveAt,
contentCompletedAt,
contentMIME,
contentSize,
contentProgress,
contentNumViews,
contentError,
contentDZI,
contentSubmitterEmail,
... | zoomhub/zoomhub | src/ZoomHub/Types/Content.hs | mit | 1,128 | 0 | 5 | 250 | 157 | 108 | 49 | 40 | 1 |
module Parser where
import Control.Applicative((<*))
import Text.Parsec
import Text.Parsec.String
import Text.Parsec.Expr
import Text.Parsec.Token
import Text.Parsec.Language
import CTLModelChecker
def :: LanguageDef st
def = emptyDef{ commentStart = "{*"
, commentEnd = "*}"
, identStart ... | goodlyrottenapple/CTLModelChecker | Parser.hs | mit | 2,116 | 0 | 10 | 539 | 725 | 389 | 336 | 53 | 2 |
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
module Yesod.Core.Dispatch
( -- * Quasi-quoted routing
parseRoutes
, parseRoutesNoCheck
, parseRoutesFile
, parseRoutesFileNoC... | yesodweb/yesod | yesod-core/src/Yesod/Core/Dispatch.hs | mit | 9,333 | 0 | 18 | 2,188 | 1,652 | 946 | 706 | 175 | 3 |
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE DeriveGeneric #-}
module Bot.NetHack.Config
( BotConfig(..) )
where
import Control.Monad
import Data.Data
import qualified Data.Text as T
import Data.Word
import Data.Yaml
import GHC.Generics
data BotConfig = BotConfig
{ player... | Noeda/adeonbot | bot/src/Bot/NetHack/Config.hs | mit | 1,205 | 0 | 12 | 322 | 312 | 170 | 142 | 45 | 0 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE StrictData #-}
{-# LANGUAGE TupleSections #-}
-- | http://docs.aws.amazon.com/AWSCloudFormation/latest/UserGuide/aws-resource-elasticmapreduce-cluster.html
module Stratosphere.Resources.EMRCluster where
import Stratosphere.ResourceImpor... | frontrowed/stratosphere | library-gen/Stratosphere/Resources/EMRCluster.hs | mit | 10,375 | 0 | 15 | 1,152 | 1,801 | 1,027 | 774 | 125 | 1 |
{-# LANGUAGE TemplateHaskell #-}
{-| The Ganeti WConfd core functions.
As TemplateHaskell require that splices be defined in a separate
module, we combine all the TemplateHaskell functionality that HTools
needs in this module (except the one for unittests).
-}
{-
Copyright (C) 2013 Google Inc.
This program is fre... | ribag/ganeti-experiments | src/Ganeti/WConfd/Core.hs | gpl-2.0 | 13,344 | 0 | 14 | 3,096 | 2,093 | 1,181 | 912 | 178 | 3 |
module Data.DMARCAggregateReport.Parser (
parseReport,
ExtractFailure(..)
) where
import qualified Data.ByteString.Lazy as LazyByteString (fromStrict, ByteString)
import Data.String.Utils (strip)
import Text.XML.Light.Input (parseXMLDoc)
import Text.XML.Light.Types (QName(..))
import qualified Text.XML.Light.Pr... | splondike/dmarc-check | src/Data/DMARCAggregateReport/Parser.hs | gpl-2.0 | 2,847 | 0 | 12 | 849 | 684 | 361 | 323 | 54 | 2 |
{- |
Module : $Header$
Description : Interface to the Leo-II theorem prover.
Copyright : (c) A. Tsogias, DFKI Bremen 2011
License : GPLv2 or higher, see LICENSE.txt
Maintainer : Alexis.Tsogias@dfki.de
Stability : provisional
Portability : non-portable (imports Prover)
LEO-II theorem prover for TH... | nevrenato/Hets_Fork | THF/ProveLeoII.hs | gpl-2.0 | 8,402 | 0 | 22 | 2,384 | 1,621 | 877 | 744 | 149 | 6 |
-- |
-- TODO(kerckhove) big example here!
--
{-# LANGUAGE OverloadedStrings #-}
module Text.LaTeX.LambdaTeX
( module Text.LaTeX.LambdaTeX
-- ** Selections
, module Text.LaTeX.LambdaTeX.Selection
-- ** References
, module Text.LaTeX.LambdaTeX.Reference
-- ** Packages dependencies
, module Te... | NorfairKing/LambdaTeX | src/Text/LaTeX/LambdaTeX.hs | gpl-2.0 | 5,295 | 0 | 16 | 1,183 | 975 | 559 | 416 | 89 | 2 |
module H17 where
split :: (Integral i) => [a] -> i -> ([a], [a])
split xs 0 = ([], xs)
split xs n = (as ++ [head bs], tail bs)
where
(as, bs) = split xs (n - 1)
| hsinhuang/codebase | h99/H17.hs | gpl-2.0 | 175 | 0 | 9 | 53 | 114 | 64 | 50 | 5 | 1 |
module Hob.Command.NewTabSpec (main, spec) where
import Test.Hspec
import Graphics.UI.Gtk
import qualified Hob.Context as HC
import qualified Hob.Context.UiContext as HC
import HobTest.Context.Stubbed
import HobTest.Editor
main :: IO ()
main = hspec spec
spec :: Spec
spec =
describe "new tab command" ... | svalaskevicius/hob | test/Hob/Command/NewTabSpec.hs | gpl-3.0 | 1,269 | 0 | 16 | 231 | 245 | 123 | 122 | 28 | 1 |
module Time where
import Data.List
data Time = Time { hour :: Integer
, minute :: Integer
, second :: Integer
} deriving (Eq)
instance Show Time where
show = showTime . process
instance Num Time where
Time h m s + Time h1 m1 s1 = Time (h+h1) (m+m1) (s+s1)
... | Jiggins/Utils | Time.hs | gpl-3.0 | 1,420 | 0 | 12 | 451 | 785 | 416 | 369 | 40 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module Database.Hedsql.Tests.Select
( tests
) where
--------------------------------------------------------------------------------
-- Imports
--------------------------------------------------------------------------------
import Data.Monoid
import Database.Hedsql.Stateme... | momomimachli/Hedsql | tests/Database/Hedsql/Tests/Select.hs | gpl-3.0 | 29,846 | 0 | 13 | 8,757 | 3,671 | 1,998 | 1,673 | 638 | 1 |
-- 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 3 of the License, or (at your option) any later
-- version.
--
-- This program is distributed in the hope that it will be usefu... | pharpend/comarkdown | tests/ExamplesSpec.hs | gpl-3.0 | 2,104 | 0 | 16 | 428 | 380 | 199 | 181 | 30 | 1 |
-- | module Category
-- Category接收两个对象类型a, b，具体化的Category实际是a -> b的态射。
--
-- Q: 为什么不用一个类型x封装所有的对象，如：
-- class Category cat where
-- type Object cat
-- type Morphism cat :: Object cat -> Object cat -> *
-- A: 目前发现有两个原因：
-- 其一：上面定义GHC不支持，会报defined and used in the same recursive group错。
-- 其二：这样失去了GHC的类型推断... | KenetJervet/mapensee | books/category-theory-for-programmers/src/Category.hs | gpl-3.0 | 635 | 0 | 9 | 99 | 74 | 42 | 32 | -1 | -1 |
module NoLit
where
import Text.Regex.Posix
import Data.Maybe
import qualified Data.Map as M
import Control.Exception as CE
import Debug.Trace
type Chunk = [String]
type FileContent = String
data TangledFile = TangledFile {
file :: FilePath,
contents :: String
} deriving (Eq,Show)
generateSourceFiles ... | tonicebrian/nolit | src/NoLit.hs | gpl-3.0 | 2,313 | 1 | 15 | 556 | 806 | 441 | 365 | 48 | 2 |
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE RankNTypes #-}
--------------------------------------------------------------------------------
-- |
-- Module : Dhek.Engine.Type
--
-- Engine type declarations
------------------------------------------------------------------------... | cchantep/dhek | Dhek/Engine/Type.hs | gpl-3.0 | 9,319 | 0 | 15 | 1,620 | 1,684 | 909 | 775 | -1 | -1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-monitoring/gen/Network/Google/Resource/Monitoring/Projects/NotificationChannels/GetVerificationCode.hs | mpl-2.0 | 9,265 | 0 | 16 | 1,814 | 821 | 496 | 325 | 127 | 1 |
module Sound.Analysis.Vamp.OutputDescriptor (
OutputDescriptor(..)
, Bins(..)
, Extents(..)
, Quantization(..)
, SampleType(..)
, peekOutputDescriptor
) where
import Bindings.Sound.Analysis.Vamp
import qualified Bindings.Sound.Analysis.Vamp.Version2 as Version2
import Foreign
import ... | kaoskorobase/hvamp | Sound/Analysis/Vamp/OutputDescriptor.hs | lgpl-3.0 | 2,643 | 0 | 18 | 766 | 622 | 331 | 291 | 58 | 8 |
module Propellor.Ssh where
import Propellor.Base
import Utility.UserInfo
import Utility.FileSystemEncoding
import System.PosixCompat
import Data.Time.Clock.POSIX
import qualified Data.Hash.MD5 as MD5
-- Parameters can be passed to both ssh and scp, to enable a ssh connection
-- caching socket.
--
-- If the socket al... | ArchiveTeam/glowing-computing-machine | src/Propellor/Ssh.hs | bsd-2-clause | 2,419 | 21 | 16 | 467 | 585 | 303 | 282 | 49 | 2 |
{-# OPTIONS -fglasgow-exts #-}
-----------------------------------------------------------------------------
{-| Module : Opengl.hs
Copyright : (c) David Harley 2010
Project : qtHaskell
Version : 1.1.4
Modified : 2010-09-02 17:02:32
Warning : this file is machine generated - do not mo... | uduki/hsQt | Qtc/Classes/Opengl.hs | bsd-2-clause | 1,165 | 0 | 10 | 231 | 298 | 168 | 130 | -1 | -1 |
module Main where
import System.ZMQ
import Control.Concurrent (forkIO, threadDelay)
import Data.ByteString.Char8 (pack, unpack)
import Control.Monad (forM_, forever, when)
nbrClients :: Int
nbrClients = 10
nbrWorkers :: Int
nbrWorkers = 3
workerThread :: Show a => String -> Context -> a -> IO ()
workerThread url c... | krattai/noo-ebs | docs/zeroMQ-guide2/examples/Haskell/lruqueue.hs | bsd-2-clause | 4,201 | 0 | 23 | 1,162 | 1,526 | 733 | 793 | 87 | 2 |
{-# LANGUAGE OverloadedStrings, ScopedTypeVariables #-}
module ShopData.OrderAddress where
import Database.PostgreSQL.Simple
import qualified Data.Text as DT
import qualified Snap.Snaplet.PostgresqlSimple as PS
import Database.PostgreSQL.Simple.ToField
import Database.PostgreSQL.Simple.FromField
( FromField (... | rjohnsondev/haskellshop | src/ShopData/OrderAddress.hs | bsd-2-clause | 3,557 | 0 | 16 | 1,677 | 642 | 351 | 291 | 52 | 1 |
module Dixi.Hamlet where
import Text.Hamlet
import Language.Haskell.TH.Quote
hml :: QuasiQuoter
hml = hamletWithSettings htmlRules (defaultHamletSettings { hamletNewlines = NoNewlines})
| liamoc/dixi | Dixi/Hamlet.hs | bsd-3-clause | 188 | 0 | 8 | 21 | 44 | 27 | 17 | 5 | 1 |
module Control.Monad.Trans.Coroutine
( Coroutine, runCoroutine
, Yield (..), yield
, Await (..), await
, Request (..), request
)where
import Control.Monad.Trans.Class
import Control.Monad.IO.Class
-- | coroutine monad. Here, @m@ is underling monad and @f@ is suspension functor.
-- suspension functor is a type construc... | permeakra/yamtl | Control/Monad/Trans/Coroutine.hs | bsd-3-clause | 3,329 | 4 | 15 | 616 | 838 | 451 | 387 | 37 | 1 |
{-|
Module : Git.Details
Description : Functions and data types for getting the details of git projects
Copyright : (c) Michael Klein, 2016
License : BSD3
Maintainer : lambdamichael(at)gmail.com
-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ImpredicativeTypes #-}
{-# LANGUAGE OverloadedStrings #-}
module Gi... | michaeljklein/git-details | src/Git/Details.hs | bsd-3-clause | 6,265 | 0 | 6 | 1,202 | 306 | 212 | 94 | 28 | 1 |
module Main (main) where
import Control.Monad
import Data.List
import Data.List.Split
import System.Directory
import System.FilePath
main :: IO ()
main = forM_ modules $ \m -> do
let segs = splitOn "." m :: [String]
let dir = ("src" </>) . intercalate "/" . reverse . drop 1 . reverse $ segs
let modName = head .... | silkapp/base-noprelude | Generate.hs | bsd-3-clause | 4,502 | 0 | 17 | 860 | 768 | 476 | 292 | 200 | 1 |
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE OverloadedStrings #-}
module WithTiming.Program
( Command(..)
, InterpretedCommand(..)
, Key
, interpretPure
, Program
, readPrevious
, predict
, beginTimer
, execute
, secondsSince
, inform
, writeResult
) where
import Control.Monad.... | holguinj/with-timing | src/WithTiming/Program.hs | bsd-3-clause | 4,610 | 0 | 12 | 968 | 867 | 468 | 399 | 68 | 8 |
{-# OPTIONS_GHC -Wall #-}
{-# OPTIONS_GHC -fno-warn-name-shadowing #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE TemplateHaskell #-}
----------------------------------------------------... | kuribas/diagrams-contrib | src/Diagrams/TwoD/Grid.hs | bsd-3-clause | 8,557 | 0 | 16 | 2,836 | 1,903 | 1,045 | 858 | 119 | 1 |
{-# LANGUAGE TypeFamilies #-}
-- | See "Control.Ether.Abbr".
module Control.Ether.Implicit.Abbr (R, W, S, E) where
import Control.Ether.Abbr (ReifyAbbr)
import Control.Monad.Ether.Implicit
-- | Denotes 'MonadReader'.
data R r
type instance ReifyAbbr (R r) m = MonadReader r m
-- | Denotes 'MonadWriter'.
data W w
ty... | bitemyapp/ether | src/Control/Ether/Implicit/Abbr.hs | bsd-3-clause | 543 | 0 | 6 | 96 | 154 | 93 | 61 | -1 | -1 |
module Lib
(serveRandomVimGif) where
import VimGif (serveRandomVimGif)
| clarkenciel/slackers | src/Lib.hs | bsd-3-clause | 75 | 0 | 5 | 11 | 17 | 11 | 6 | 3 | 0 |
{-# LANGUAGE GeneralizedNewtypeDeriving, MultiParamTypeClasses,
FlexibleInstances #-}
module Main where
import Control.Monad.State
import Control.Monad.Trans
import HarkerIRC.Client
import HarkerIRC.Types
newtype EchoMonadT m a = EchoMonad (StateT Bool (HarkerClientT m) a)
deriving (Monad, MonadIO, ... | mikeyhc/harkerbot | src/Plugins/EchoPlugin.hs | bsd-3-clause | 1,336 | 0 | 12 | 348 | 396 | 208 | 188 | 33 | 4 |
{-# LANGUAGE TemplateHaskell #-}
--------------------------------------------------------------------------------
module Application where
--------------------------------------------------------------------------------
import Control.Lens
import Snap.Snaplet
import Snap.Snaplet.Heist
-----------------------------... | stesta/GameOfLife | src/Application.hs | bsd-3-clause | 545 | 0 | 11 | 64 | 83 | 47 | 36 | 11 | 0 |
{-# LANGUAGE OverloadedStrings #-}
-- |
-- Module : HaskDeep.Computation
-- Copyright : Mauro Taraborelli 2012
-- License : BSD3
--
-- Maintainer : maurotaraborelli@gmail.com
-- Stability : experimental
-- Portability : unknown
--
-- Computes hashes traversing recursively through a directory structu... | maurotrb/haskdeep | src/HaskDeep/ComputationMode.hs | bsd-3-clause | 1,518 | 0 | 9 | 304 | 248 | 155 | 93 | 24 | 1 |
-----------------------------------------------------------------------------
-- |
-- Module : Data.Curve.Const
-- Copyright : (c) 2011 Michael Sloan
-- License : BSD-style (see the LICENSE file)
--
-- Maintainer : Michael Sloan <mgsloan@gmail.com>
-- Stability : experimental
-- Portability : GHC o... | mgsloan/curve | Data/Curve/Const.hs | bsd-3-clause | 2,060 | 0 | 8 | 445 | 676 | 366 | 310 | -1 | -1 |
module QueryArrow.Gen where
configFilePath :: String
configFilePath = "../QueryArrow-gen/tdb-plugin-gen-config.yaml"
| xu-hao/QueryArrow | QueryArrow-gen/src/QueryArrow/Gen.hs | bsd-3-clause | 118 | 0 | 4 | 10 | 16 | 10 | 6 | 3 | 1 |
import qualified Data.ByteString as B
import qualified Data.ByteString.Lazy as L
import Data.List
import Data.Text.Lazy (unpack)
import Data.Text.Lazy.Encoding (decodeUtf8With)
import Data.Text.Encoding.Error (lenientDecode)
import Distribution.Package
import Distribution.PackageDescription
import Distribution.P... | Shimuuar/lackage | lackage.hs | bsd-3-clause | 4,029 | 0 | 16 | 959 | 1,074 | 555 | 519 | 83 | 4 |
{-# OPTIONS -fno-warn-type-defaults #-}
--------------------------------------------------------------------------------
-- |
-- Module : Read
-- Copyright : (c) 2009 Sean Leather
-- License : BSD3
--
-- Maintainer : leather@cs.uu.nl
--
-- Tests for Text.XFormat.Read.
----------------------------------... | spl/xformat | test/Read.hs | bsd-3-clause | 3,744 | 0 | 20 | 739 | 1,499 | 879 | 620 | 49 | 1 |
module Data.Digest.WebMoney.Algebra where
import Data.Bits (Bits, bitSize, shiftL, shiftR, testBit, (.&.),
(.|.))
import Data.Int (Int32, Int64)
import Data.Word (Word32, Word64)
import Control.Lens (ix, (&), (.~))
import Data.... | superduper/wmsigner | src/Data/Digest/WebMoney/Algebra.hs | mit | 6,933 | 0 | 17 | 2,115 | 2,577 | 1,363 | 1,214 | 134 | 5 |
-- so the amount of memory deallocated should be easy enough to do
-- INPUT
import Control.Monad
import Data.List
b2ints :: B.ByteString -> [Int]
b2ints = unfoldr (B.readInt . B.dropWhile (== ' '))
main :: IO ()
main = readLn >>= flip replicateM_ secondIO
secondIO :: IO ()
secondIO = do
B.getLine
... | paramsingh/codechef-solutions | src/long/jun15/cbarg.hs | mit | 534 | 0 | 13 | 153 | 217 | 114 | 103 | 13 | 2 |
module Lamdu.Data.Export.JSON.Migration.ToVersion8 (migrate) where
import qualified Control.Lens as Lens
import Control.Lens.Extended ((~~>))
import qualified Data.Aeson as Aeson
import Data.Aeson.Lens (_Object)
import qualified Data.UUID.Utils as UUIDUtils
import Lamdu.Data.Export.JSON.M... | lamdu/lamdu | src/Lamdu/Data/Export/JSON/Migration/ToVersion8.hs | gpl-3.0 | 1,344 | 0 | 20 | 318 | 419 | 225 | 194 | 31 | 3 |
-----------------------------------------------------------------------------
-- |
-- Module : Control.Monad.MC.GSL
-- Copyright : Copyright (c) 2010, Patrick Perry <patperry@gmail.com>
-- License : BSD3
-- Maintainer : Patrick Perry <patperry@gmail.com>
-- Stability : experimental
--
-- A monad and monad tran... | beni55/hs-monte-carlo | lib/Control/Monad/MC/GSL.hs | bsd-3-clause | 668 | 0 | 5 | 97 | 66 | 51 | 15 | 7 | 0 |
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE InstanceSigs #-}
{-# LANGUAGE PatternGuards #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE TypeFamilie... | flowbox-public/accelerate-cuda | Data/Array/Accelerate/CUDA/Array/Table.hs | bsd-3-clause | 7,864 | 0 | 17 | 2,047 | 1,923 | 1,016 | 907 | 117 | 3 |
-- | A light-weight wrapper around @Network.Wai@ to provide easy conduit support.
module Network.Wai.Conduit
( -- * Request body
sourceRequestBody
-- * Response body
, responseSource
, responseRawSource
-- * Re-export
, module Network.Wai
) where
import Network.Wai
import Data.Con... | sordina/wai | wai-conduit/Network/Wai/Conduit.hs | bsd-2-clause | 2,146 | 0 | 15 | 591 | 478 | 259 | 219 | 44 | 2 |
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TemplateHaskell #-}
module Stack.Init
( findCabalFiles
, initProject
, InitOpts (..)
, SnapPref (..)
, Method (..)
, makeConcreteResolver
, tryDeprecatedPat... | meiersi-11ce/stack | src/Stack/Init.hs | bsd-3-clause | 14,947 | 0 | 21 | 4,935 | 3,200 | 1,628 | 1,572 | 280 | 8 |
-- Example for building a fabric and generating VHDL/Dot output of a circuit.
-- You are highly encouraged to run both main and main2 and view the VHDL output.
import Language.KansasLava
-- for dut2
import Data.Sized.Unsigned
-- define a circuit
halfAdder a b = (sum,carry)
where sum = xor2 a b
carry = and2 ... | andygill/kansas-lava | examples/VHDL.hs | bsd-3-clause | 3,425 | 0 | 11 | 922 | 318 | 163 | 155 | 28 | 1 |
{-# LANGUAGE DeriveDataTypeable, FlexibleInstances #-}
module Graphics.QML.Test.SimpleTest where
import Graphics.QML.Objects
import Graphics.QML.Test.Framework
import Graphics.QML.Test.MayGen
import Graphics.QML.Test.TestObject
import Graphics.QML.Test.ScriptDSL (Expr, Prog)
import qualified Graphics.QML.Test.ScriptD... | johntyree/HsQML | test/Graphics/QML/Test/SimpleTest.hs | bsd-3-clause | 8,519 | 0 | 17 | 2,496 | 2,938 | 1,492 | 1,446 | 176 | 2 |
{-# LANGUAGE RebindableSyntax #-}
-- | Bindings to make the popular containers library compatible with subhask
module SubHask.Compatibility.Containers
where
import qualified Data.Foldable as F
import qualified Data.Map as M
import qualified Data.IntMap as IM
import qualified Data.Map.Strict as MS
import qualified ... | abailly/subhask | src/SubHask/Compatibility/Containers.hs | bsd-3-clause | 18,261 | 0 | 14 | 4,526 | 6,910 | 3,569 | 3,341 | -1 | -1 |
{-# LANGUAGE Trustworthy #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE NoImplicitPrelude #-}
-----------------------------------------------------------------------------
-- |
-- Module : Control.Applicative
-- Copyright : Conor McBride and Ross Paterson 2005
-- L... | tolysz/prepare-ghcjs | spec-lts8/base/Control/Applicative.hs | bsd-3-clause | 3,760 | 0 | 11 | 772 | 836 | 474 | 362 | 53 | 1 |
{-# LANGUAGE GeneralizedNewtypeDeriving, TemplateHaskell, PolymorphicComponents, ConstraintKinds, RecordWildCards #-}
module Lamdu.Sugar.Convert.Monad
( Context(..), TagParamInfo(..), RecordParamsInfo(..)
, scHoleInferContext, scStructureInferContext, scWithVarsInferContext
, scCodeAnchors, scSpecialFunctions, sc... | schell/lamdu | Lamdu/Sugar/Convert/Monad.hs | gpl-3.0 | 3,378 | 0 | 14 | 534 | 987 | 549 | 438 | 74 | 1 |
{-# LANGUAGE MagicHash, UnboxedTuples #-}
--module Foo where
import GHC.Exts
--you can use this if you want to test running it...
main = print (I# (
f1pat 1# +# f1prepat 1#
+# f2pat 1# +# f2prepat 1#
+# f3pat 1# +# f3prepat 1#
))
--unboxed tuples are of sizes 1,2,3...
--(normal tuples are 0,2,3...)
-... | urbanslug/ghc | testsuite/tests/parser/should_compile/read063.hs | bsd-3-clause | 1,488 | 14 | 14 | 348 | 430 | 231 | 199 | 24 | 1 |
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE Strict #-}
-- | Internalising bindings.
module Futhark.Internalise.Bindings
( internaliseAttrs,
internaliseAttr,
bindingFParams,
bindingLoopParams,
bindingLambdaParams,
stmPat,
)
where
import Control.Monad.Reader hiding (mapM)
import Data.Bifuncto... | diku-dk/futhark | src/Futhark/Internalise/Bindings.hs | isc | 6,028 | 0 | 19 | 1,284 | 2,322 | 1,165 | 1,157 | 144 | 11 |
{-|
Module : Parser
Copyright : (c) Jakub Šoustar, 2016
License : MIT
Maintainer : Jakub Šoustar <jakub.soustar@gmail.com>, xsoust02 <xsoust02@stud.fit.vutbr.cz>
Part of the rv-2-rka (re-2-efa) project.
This module provides lexical and syntactic parsing capabilities.
The scanner converts an input string into l... | J4kubS/FLP | rv-2-rka/Parser.hs | mit | 4,078 | 16 | 12 | 892 | 805 | 423 | 382 | 64 | 6 |
-----------------------------------------------------------------------------
--
-- Module : Topology
-- Copyright :
-- License : AllRightsReserved
--
-- Maintainer :
-- Stability :
-- Portability :
--
-- |
--
-----------------------------------------------------------------------------
module Topology... | uvNikita/TopologyCalc | src/Topology.hs | mit | 1,326 | 0 | 12 | 292 | 324 | 184 | 140 | 26 | 1 |
{-# LANGUAGE QuasiQuotes #-}
module ElasticSearch.Document where
import Control.Lens ((^.))
import Data.Aeson (ToJSON, FromJSON)
import Data.Default
import Data.Text (unpack)
import ElasticSearch.Internal
import ElasticSearch.Types
import ElasticSearch.Document.Types
import URI.TH
import URI.Types
putDocument :: ToJSO... | SaneApp/elastic-search-api | src/ElasticSearch/Document.hs | mit | 1,443 | 0 | 12 | 245 | 394 | 215 | 179 | 30 | 2 |
{-# LANGUAGE CPP, ExistentialQuantification, FlexibleInstances, OverloadedStrings, RecordWildCards, TemplateHaskell, TypeSynonymInstances #-}
module Model where
import Data.Aeson
import qualified Data.Aeson as A
import qualified Data.ByteString as B
import Data.List
import ... | pkamenarsky/usercfg | server/src/Model.hs | mit | 4,973 | 0 | 12 | 1,477 | 1,085 | 573 | 512 | 88 | 5 |
module Rebase.Data.Vector.Fusion.Stream.Monadic
(
module Data.Vector.Fusion.Stream.Monadic
)
where
import Data.Vector.Fusion.Stream.Monadic
| nikita-volkov/rebase | library/Rebase/Data/Vector/Fusion/Stream/Monadic.hs | mit | 143 | 0 | 5 | 12 | 29 | 22 | 7 | 4 | 0 |
{-# LANGUAGE OverloadedStrings #-}
module Main where
import Control.Concurrent
import Control.Invariant
import Control.Lens
import Control.Monad
import Data.Functor.Compose
import Data.List
import Data.Monoid ((<>))
import Document.Document hiding (system)
import Document.Tests.SmallMachine as SM
import qualified U... | literate-unitb/literate-unitb | suite/test.hs | mit | 3,849 | 0 | 15 | 1,009 | 870 | 455 | 415 | -1 | -1 |
module Y2017.M10.D13.Solution where
{--
Today, for something COMPLETELY different, ... yet UTTERLY the same ...
We're going to build and then deploy an application.
Take the ETL process you've built over the ... is it a month now? IT'S A MONTH!
... last month and create an application. Run it on the 'command line' o... | geophf/1HaskellADay | exercises/HAD/Y2017/M10/D13/Solution.hs | mit | 3,996 | 0 | 27 | 802 | 810 | 449 | 361 | 61 | 1 |
-----------------------------------------------------------------------
--
-- Haskell: The Craft of Functional Programming
-- Simon Thompson
-- (c) Addison-Wesley, 1996-2011.
--
-- CalcParseLib.hs
--
-- Library functions for parsing
-- Note that this is not a monadic approach to parsing.
--
---------... | fboyer/craft3e | Calculator/CalcParseLib.hs | mit | 2,983 | 0 | 13 | 881 | 1,042 | 585 | 457 | 53 | 1 |
{-# LANGUAGE NoMonomorphismRestriction
#-}
module Plugins.Gallery.Gallery.Manual44 where
import Diagrams.Prelude
circles = (c ||| c) === (c ||| c) where c = circle 1 # fc fuchsia
example = circles # centerXY # view (p2 (-1,-1)) (r2 (1.3, 0.7))
| andrey013/pluginstest | Plugins/Gallery/Gallery/Manual44.hs | mit | 256 | 0 | 10 | 50 | 100 | 56 | 44 | 5 | 1 |
import qualified Data.Map as M
import Helpers (stringToIntList)
digitFactorials :: Integer -> Integer
digitFactorials y = sum [ x | x <- [3..y], isFactorialSum x ]
factorialMap :: Integer -> Maybe Integer
factorialMap x = M.lookup (fromInteger x) m
where m = M.fromList $ (0, 1) : [ (x, product [1..x]) | x <- [1..... | samidarko/euler | problem034.hs | mit | 606 | 0 | 12 | 170 | 235 | 124 | 111 | 12 | 2 |
{-# htermination compare :: (Ratio Int) -> (Ratio Int) -> Ordering #-}
| ComputationWithBoundedResources/ara-inference | doc/tpdb_trs/Haskell/full_haskell/Prelude_compare_7.hs | mit | 71 | 0 | 2 | 12 | 3 | 2 | 1 | 1 | 0 |
module Brainfuck.Interpreter (eval_naive,InterpreterResult(..)) where
import Control.Monad.Trans.State
import Brainfuck.Types
import Data.Word
import Data.Int
data InterpreterResult = InterpreterResult {
ir_stdout :: [Word8]
,ir_tape :: ([Word8], Word8... | EXio4/brixy | src/Brainfuck/Interpreter.hs | mit | 2,200 | 0 | 13 | 781 | 846 | 469 | 377 | 43 | 3 |
module CR.Util.Aeson
( aesonOpts
)
where
import Data.Aeson.Types
import Data.Char
aesonOpts :: Int -> Options
aesonOpts dropCount =
defaultOptions
{ fieldLabelModifier = drop dropCount
, constructorTagModifier = camelTo2 '_'
, allNullaryToStringTag = True
, omitNothingFields = False
, ... | agrafix/compile-registry | src/CR/Util/Aeson.hs | mit | 362 | 0 | 7 | 80 | 78 | 47 | 31 | 12 | 1 |
{-# LANGUAGE PatternSynonyms #-}
-- For HasCallStack compatibility
{-# LANGUAGE ImplicitParams, ConstraintKinds, KindSignatures #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
module JSDOM.Generated.MimeTypeArray
(item, item_, itemUnsafe, itemUnchecked, namedItem, namedItem_,
namedItemUnsafe, namedItemU... | ghcjs/jsaddle-dom | src/JSDOM/Generated/MimeTypeArray.hs | mit | 3,886 | 0 | 14 | 619 | 930 | 530 | 400 | -1 | -1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE ScopedTypeVariables #-}
module Codec.Xlsx.Types.Common
( CellRef(..)
, singleCellRef
, fromSingleCellRef
, fromSingleCellRefNoting
, Range
, mkRange
, fromRange
, SqRef(..)
, XlsxText(..)
, xlsxTextToCellValue
, Formula... | qrilka/xlsx | src/Codec/Xlsx/Types/Common.hs | mit | 14,997 | 0 | 18 | 3,057 | 2,718 | 1,485 | 1,233 | 221 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.