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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
{-# LANGUAGE NoImplicitPrelude, GeneralizedNewtypeDeriving, TemplateHaskell, PolymorphicComponents, ConstraintKinds, RecordWildCards #-}
module Lamdu.Sugar.Convert.Monad
( TagParamInfo(..)
, TagFieldParam(..), _TagFieldParam, _CollidingFieldParam
, OuterScopeInfo(..), osiPos, osiVarsUnderPos
, ScopeInfo... | da-x/lamdu | Lamdu/Sugar/Convert/Monad.hs | gpl-3.0 | 5,886 | 0 | 22 | 1,539 | 1,449 | 795 | 654 | 123 | 2 |
module MonadTrans where
import Control.Monad.Trans
import IdentityT
import MaybeT
import ReaderT
import EitherT
import StateT
-- 1. IdentityT
instance MonadTrans IdentityT where
lift = IdentityT
-- 2. MaybeT
instance MonadTrans MaybeT where
lift = MaybeT . (fmap Just)
-- 3. ReaderT
instance MonadTrans (Read... | nirvinm/Solving-Exercises-in-Haskell-Programming-From-First-Principles | MonadTransformers/src/MonadTrans.hs | gpl-3.0 | 783 | 0 | 11 | 169 | 171 | 96 | 75 | 19 | 0 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-youtube/gen/Network/Google/Resource/YouTube/MembershipsLevels/List.hs | mpl-2.0 | 4,903 | 0 | 17 | 1,148 | 720 | 420 | 300 | 105 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | rueshyna/gogol | gogol-gmail/gen/Network/Google/Resource/Gmail/Users/Threads/Trash.hs | mpl-2.0 | 3,096 | 0 | 15 | 757 | 383 | 231 | 152 | 61 | 1 |
{-# LANGUAGE OverloadedStrings, ScopedTypeVariables #-}
module Model.Stats.TypesTest where
import qualified Data.Map as Map
import qualified Data.Array.Unboxed as ArrayU
import Test.Tasty
import Model.Stats.Types
import Model.Id.Types
siteStats1 :: SiteStats
siteStats1 =
SiteStats {
statsAuthorizedSite... | databrary/databrary | test/Model/Stats/TypesTest.hs | agpl-3.0 | 881 | 0 | 10 | 314 | 232 | 145 | 87 | 28 | 1 |
{-# LANGUAGE RecordWildCards, DeriveDataTypeable #-}
module Main where
import Control.Applicative
import Control.Monad
import Graphics.OpenGLES
import qualified Data.ByteString.Char8 as B
import qualified Graphics.UI.GLFW as GLFW
import Control.Concurrent
-- ghc examples/billboard.hs -lEGL -lGLESv2 -threaded && exampl... | capsjac/opengles | examples/billboard.hs | lgpl-3.0 | 2,898 | 164 | 15 | 553 | 886 | 481 | 405 | 85 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module Network.Haskoin.Crypto.Mnemonic.Tests (tests) where
import Test.QuickCheck (Arbitrary, Property, arbitrary, choose, (==>))
import Test.Framework (Test, testGroup)
import Test.Framework.Providers.QuickCheck2 (testProperty)
import Data.Bits ((.&.), shiftR)
import Data.Binary (B... | tphyahoo/haskoin | haskoin-core/tests/Network/Haskoin/Crypto/Mnemonic/Tests.hs | unlicense | 6,475 | 0 | 13 | 1,517 | 2,251 | 1,233 | 1,018 | 139 | 2 |
-- This module is a compatibility layer that emulates the behaviour of Python's format strings.
-- It is needed because several Powerline segments take a format argument that uses this notation.
-- Interpolation sections have the grammar {[name][:fmt]}, and may also contain arbitrary text.
--
-- See: https://docs.pytho... | rdnetto/powerline-hs | src/Format.hs | apache-2.0 | 6,131 | 0 | 13 | 2,111 | 1,331 | 720 | 611 | -1 | -1 |
module PowerDivisibility.A072905 (a072905) where
import HelperSequences.A000188 (a000188)
import HelperSequences.A007913 (a007913)
a072905 :: Integer -> Integer
a072905 n = a007913 n * (a000188 n + 1)^2
| peterokagey/haskellOEIS | src/PowerDivisibility/A072905.hs | apache-2.0 | 204 | 0 | 9 | 26 | 69 | 38 | 31 | 5 | 1 |
main = print (solveIt 1000)
solveIt :: Int -> Int
solveIt n = foldl1 (+) (filter matches (takeWhile (< n) (enumFrom 1)))
matches :: Int -> Bool
matches n = ((mod n 3) == 0) || ((mod n 5) == 0) | pdbartlett/misc-stuff | euler/haskell/euler1.hs | apache-2.0 | 200 | 0 | 11 | 48 | 116 | 61 | 55 | 5 | 1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TemplateHaskell #-}
{-
Copyright 2020 The CodeWorld Authors. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http... | google/codeworld | codeworld-api/src/Util/EmbedAsUrl.hs | apache-2.0 | 1,415 | 0 | 14 | 263 | 159 | 96 | 63 | 21 | 1 |
{-# OPTIONS -fglasgow-exts #-}
-----------------------------------------------------------------------------
{-| Module : Network.hs
Copyright : (c) David Harley 2010
Project : qtHaskell
Version : 1.1.4
Modified : 2010-09-02 17:02:14
Warning : this file is machine generated - do not m... | uduki/hsQt | Qtc/Network.hs | bsd-2-clause | 3,039 | 0 | 5 | 343 | 511 | 360 | 151 | 76 | 0 |
{-# LANGUAGE TupleSections, OverloadedStrings #-}
module Handler.Blog
( getEntryR
, getEditEntryR
, getBlogPageR
, getBlogR
, getNewEntryR
, postNewEntryR
, getDeleteEntryR
) where
import Helpers.Messages
import Helpers.Posts
import Import
import Yesod.Markdown
getEntryR :: Text -> Han... | ModernSteward/blog | Handler/Blog.hs | bsd-2-clause | 4,349 | 0 | 24 | 1,571 | 984 | 471 | 513 | 96 | 3 |
{-# LANGUAGE LambdaCase, NamedFieldPuns, RecordWildCards, TupleSections #-}
module Mote.Case where
import Bag (bagToList)
import BasicTypes (Boxity (..))
import Control.Applicative ((<$), (<$>), (<*>), (<|>))
import Control.Arrow (second)
import ... | imeckler/mote | Mote/Case.hs | bsd-3-clause | 13,461 | 137 | 24 | 4,095 | 4,063 | 2,175 | 1,888 | 253 | 28 |
-- | Skein 256 as a PRNG.
module Crypto.Threefish.Random (
SkeinGen, Block256, Random (..), RandomGen (..),
newSkeinGen, mkSkeinGen, mkSkeinGenEx, randomBytes, reseedSkeinGen,
toBlock, fromBlock
) where
import Crypto.Threefish.Skein
import Crypto.Threefish.Threefish256
import System.Random
import System.E... | valderman/threefish | Crypto/Threefish/Random.hs | bsd-3-clause | 3,590 | 0 | 15 | 765 | 1,034 | 560 | 474 | 78 | 1 |
{-# LANGUAGE CPP, RecordWildCards, NamedFieldPuns, RankNTypes #-}
{-# LANGUAGE ViewPatterns #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE NoMonoLocalBinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
-- | Planning how to build everything in a project.
--
module Distribution.Client.ProjectPlanning (
-- * elaborated ins... | sopvop/cabal | cabal-install/Distribution/Client/ProjectPlanning.hs | bsd-3-clause | 123,142 | 948 | 22 | 36,515 | 10,032 | 7,360 | 2,672 | 1,691 | 24 |
main = (readFile "input/p013_input.txt") >>= (putStrLn . take 10 . show . sum . (map (\x -> read x :: Integer)) . lines)
| foreverbell/project-euler-solutions | src/13.hs | bsd-3-clause | 122 | 1 | 13 | 24 | 65 | 32 | 33 | 1 | 1 |
import Test.QuickCheck
import Test.QuickCheck.Function
-- Functor law
-- fmap id = id
-- fmap (f . g) = (fmap f) . (fmap g)
-- quickcheck helper function
functorIdentity :: (Functor f, Eq (f a)) => f a -> Bool
functorIdentity f = fmap id f == id f
functorCompose :: (Functor f, Eq (f c)) =>
(a -> ... | chengzh2008/hpffp | src/ch16-Functor/quickCheckFunctorLaw.hs | bsd-3-clause | 1,150 | 1 | 11 | 376 | 433 | 227 | 206 | 25 | 1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE ScopedTypeVariables #-}
module Snap.Snaplet.PostgresqlSimple.Internal where
import Control.Monad.IO.Class
import Control.Monad.Trans
import Control.Monad.Trans.Cont... | sopvop/snaplet-postgresql-simple | src/Snap/Snaplet/PostgresqlSimple/Internal.hs | bsd-3-clause | 7,117 | 59 | 23 | 1,389 | 1,474 | 836 | 638 | 94 | 2 |
-- Copyright (c) 2016-present, Facebook, Inc.
-- All rights reserved.
--
-- This source code is licensed under the BSD-style license found in the
-- LICENSE file in the root directory of this source tree.
module Duckling.Ordinal.PL.Tests
( tests ) where
import Prelude
import Data.String
import Test.Tasty
import D... | facebookincubator/duckling | tests/Duckling/Ordinal/PL/Tests.hs | bsd-3-clause | 504 | 0 | 9 | 78 | 79 | 50 | 29 | 11 | 1 |
{-# LANGUAGE OverloadedStrings #-}
import Network
import System.IO
import Control.Monad.IO.Class
import Control.Monad
import Data.Conduit
import Data.Conduit.List
import Data.Conduit.Binary
import Text.XML.Stream.Parse
import qualified Data.ByteString as BS
import qualified Data.ByteString.Char8 as BSC
import Cli... | YoshikuniJujo/forest | subprojects/xmpp-tls-analysis/client.hs | bsd-3-clause | 1,471 | 4 | 13 | 256 | 478 | 242 | 236 | 47 | 2 |
{-# LANGUAGE CPP #-}
module TcSimplify(
simplifyInfer,
pickQuantifiablePreds, growThetaTyVars,
simplifyAmbiguityCheck,
simplifyDefault,
simplifyTop, simplifyInteractive,
solveWantedsTcM,
-- For Rules we need these twoo
solveWanteds, runTcS
) where
#include "H... | christiaanb/ghc | compiler/typecheck/TcSimplify.hs | bsd-3-clause | 70,406 | 0 | 19 | 20,063 | 7,110 | 3,759 | 3,351 | 569 | 6 |
module Data.Text.Lazy.AsLt
( module Data.Text.Lazy.AsLt
) where
-- generated by https://github.com/rvion/ride/tree/master/jetpack-gen
import qualified Data.Text.Lazy as I
-- lt_empty :: Text
lt_empty = I.empty
-- lt_foldlChunks :: forall a. (a -> Text -> a) -> a -> Text -> a
lt_foldlChunks = I.foldlChunks
-- l... | rvion/ride | jetpack/src/Data/Text/Lazy/AsLt.hs | bsd-3-clause | 6,863 | 0 | 5 | 1,312 | 828 | 521 | 307 | 103 | 1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
module Lib (
generate,
DeltaParams,
defaultDeltaParams,
setDeltaParamsAuth,
setDeltaParamsOwner,
setDeltaParamsRepo,
setDeltaParamsSince,
setDeltaParamsUntil,
setDeltaParamsLabel,
) where
import Dat... | iconnect/gh-delta | src/Lib.hs | bsd-3-clause | 7,090 | 0 | 21 | 1,837 | 1,674 | 881 | 793 | 135 | 4 |
module Data.Vector.Strategies
( parVector
-- * Re-exported for convenience
, NFData, using
) where
import Control.DeepSeq (NFData(..))
import Control.Parallel.Strategies
import Control.Monad
import qualified Data.Vector.Generic as V
import qualified Data.Vector as VB
-- |Evaluate the elements of a boxed vector i... | TomMD/vector-strategies | Data/Vector/Strategies.hs | bsd-3-clause | 873 | 4 | 10 | 148 | 142 | 87 | 55 | -1 | -1 |
module Main where
import Control.Concurrent
import Control.Monad
import Control.Monad.Trans
import qualified Data.ByteString.Char8 as S8
import Data.IterIO.Iter
import Data.IterIO.ListLike
import Data.IterIO.Inum
import Data.IterIO.Extra
minusOne :: Int -> Iter [Int] IO () -> Iter [Int] IO ()
minusOne expect iout = ... | scslab/iterIO | tests/pingpong.hs | bsd-3-clause | 1,320 | 0 | 19 | 357 | 529 | 268 | 261 | 41 | 2 |
module Main where
import Distribution.Simple
import Distribution.Simple.UUAGC
main = defaultMainWithHooks uuagcUserHook
| norm2782/uuagc | doc/ag-tutorial/gen/Setup.hs | bsd-3-clause | 123 | 0 | 5 | 14 | 23 | 14 | 9 | 4 | 1 |
module Haskmon.Types.Move(
module Haskmon.Types.Move,
I.Move, I.MetaMove
) where
import Haskmon.Types.Internals(MetaData, MetaMove, Move, MetaMoveLearnType)
import qualified Haskmon.Types.Internals as I
mMoveName :: MetaMove -> String
mMoveName = I.mMoveName
mMoveLearnType :: MetaMove -> MetaMoveLearnType
mM... | bitemyapp/Haskmon | src/Haskmon/Types/Move.hs | mit | 673 | 0 | 6 | 102 | 186 | 110 | 76 | 21 | 1 |
{-# LANGUAGE RecordWildCards #-}
-- | The module implements /directed acyclic word graphs/ (DAWGs) internaly
-- represented as /minimal acyclic deterministic finite-state automata/.
--
-- In comparison to "Data.DAWG.Dynamic" module the automaton implemented here:
--
-- * Keeps all nodes in one array and therefore u... | kawu/dawg | src/Data/DAWG/Static.hs | bsd-2-clause | 11,576 | 0 | 15 | 2,928 | 3,163 | 1,693 | 1,470 | 181 | 3 |
module Main where
import Text.RegexPR
import System.Directory
import Data.List
import Data.Tree
import System.Environment
main :: IO ()
main = do
[ dir ] <- getArgs
files <- fmap filterSource $ getDirectoryContents dir
dependList <- mapM ( depend dir files ) files
mapM_ ( putStr . showTree [ ] . nubTree ) $
let... | YoshikuniJujo/zot_haskell | tools/putModTree.hs | bsd-3-clause | 2,464 | 20 | 13 | 657 | 1,238 | 630 | 608 | 63 | 8 |
-----------------------------------------------------------------------------
-- |
-- Module : Language.Haskell.Extension
-- Copyright : Isaac Jones 2003-2004
--
-- Maintainer : Isaac Jones <ijones@syntaxpolice.org>
-- Stability : alpha
-- Portability : portable
--
-- Haskell language extensions
{- All... | alekar/hugs | packages/Cabal/Language/Haskell/Extension.hs | bsd-3-clause | 3,050 | 2 | 6 | 536 | 156 | 108 | 48 | 37 | 0 |
-- | A collection of utility functions to mediate between 'Maybe', 'Either',
-- other 'Monad's, and exceptions.
module Control.MaybeEitherMonad
where
import Control.Exception
import Data.Maybe (fromMaybe)
-- | Return the 'Just' value, or fail on 'Nothing'
maybeFail :: MonadFail m => Maybe a -> m a
maybeFail = maybe (... | tdammers/templar | src/Control/MaybeEitherMonad.hs | bsd-3-clause | 1,714 | 0 | 10 | 310 | 396 | 206 | 190 | 25 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# L... | romanb/amazonka | amazonka-ec2/gen/Network/AWS/EC2/CreateVpnConnectionRoute.hs | mpl-2.0 | 4,196 | 0 | 9 | 825 | 398 | 245 | 153 | 55 | 1 |
{-
(c) The University of Glasgow 2006
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998
Utilities for desugaring
This module exports some utility functions of no great interest.
-}
{-# LANGUAGE CPP #-}
-- | Utility functions for constructing Core syntax, principally for desugaring
module Language.Haskell.L... | abakst/liquidhaskell | src/Language/Haskell/Liquid/Desugar710/DsUtils.hs | bsd-3-clause | 32,488 | 0 | 19 | 8,993 | 5,114 | 2,672 | 2,442 | 357 | 10 |
{- |
Module : $Header$
Description : lattice classes
Copyright : (c) Christian Maeder, DFKI GmbH 2011
License : GPLv2 or higher, see LICENSE.txt
Maintainer : Christian.Maeder@dfki.de
Stability : provisional
Portability : portable
-}
module Common.Lattice where
class (Ord l, Show l) => Lattice l ... | mariefarrell/Hets | Common/Lattice.hs | gpl-2.0 | 656 | 0 | 8 | 168 | 204 | 115 | 89 | 17 | 0 |
yes x = case x of {False -> a ; _ -> b} | mpickering/hlint-refactor | tests/examples/Default48.hs | bsd-3-clause | 39 | 0 | 7 | 12 | 28 | 15 | 13 | 1 | 2 |
--
-- Copyright (c) 2014 Citrix Systems, Inc.
--
-- 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 progra... | jean-edouard/manager | upgrade-db/Migrations/M_21.hs | gpl-2.0 | 1,498 | 0 | 14 | 318 | 202 | 115 | 87 | 21 | 2 |
{-# LANGUAGE UnliftedNewtypes #-}
{-# LANGUAGE ExplicitForAll #-}
{-# LANGUAGE PolyKinds #-}
module T17360 where
import GHC.Exts
newtype Id (a :: TYPE r) = Id a
foo :: forall r (a :: TYPE r). Id a -> Id a
foo x = x
| sdiehl/ghc | testsuite/tests/typecheck/should_fail/T17360.hs | bsd-3-clause | 218 | 0 | 8 | 46 | 68 | 40 | 28 | -1 | -1 |
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE ViewPatterns #-}
-- | Build-specific types.
module Stack.Types.B... | akhileshs/stack | src/Stack/Types/Build.hs | bsd-3-clause | 28,694 | 0 | 21 | 9,047 | 5,494 | 3,007 | 2,487 | 661 | 5 |
{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveFunctor #-}
{-# OPTIONS_HADDOCK show-extensions #-}
-- |
-- Module : Yi.Syntax.Paren
-- License : GPL-2
-- Maintainer : yi-devel@googlegroups.com
-- Stability : experimental
-- Portability : portable
--
-- Parser for Haskell that only cares about par... | siddhanathan/yi | yi-mode-haskell/src/Yi/Syntax/Paren.hs | gpl-2.0 | 6,832 | 0 | 16 | 1,969 | 1,845 | 989 | 856 | 100 | 5 |
{- arch-tag: Tests main file
Copyright (C) 2004-2005 John Goerzen <jgoerzen@complete.org>
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 late... | abuiles/turbinado-blog | tmp/dependencies/hdbc-postgresql-1.1.4.1/testsrc/Tests.hs | bsd-3-clause | 1,255 | 0 | 8 | 250 | 102 | 58 | 44 | 12 | 1 |
-----------------------------------------------------------------------------
-- |
-- Module : XMonad.Actions.MessageFeedback
-- Copyright : (c) Quentin Moser <moserq@gmail.com>
-- License : BSD3
--
-- Maintainer : orphaned
-- Stability : unstable
-- Portability : unportable
--
-- Alternative to 'XM... | pjones/xmonad-test | vendor/xmonad-contrib/XMonad/Actions/MessageFeedback.hs | bsd-2-clause | 3,665 | 0 | 11 | 1,052 | 579 | 324 | 255 | 37 | 2 |
module Main where
main :: IO ()
main = putStrLn "This is foo from also-has-exe-foo"
| rubik/stack | test/integration/tests/1198-multiple-exes-with-same-name/files/also-has-exe-foo/app/Main.hs | bsd-3-clause | 85 | 0 | 6 | 16 | 22 | 12 | 10 | 3 | 1 |
-- showing/reading floats
--
module Main(main) where
import Numeric
main = do
let dbls = map (shEFloat (Just 7)) doubles
++ map (shEFloat (Just 0)) doubles
++ map (shEFloat Nothing) doubles
++ map (shFFloat (Just 7)) doubles
++ map (shFFloat (Just 0)) doubles
... | wxwxwwxxx/ghc | libraries/base/tests/Numeric/num008.hs | bsd-3-clause | 1,672 | 0 | 22 | 624 | 556 | 280 | 276 | 46 | 1 |
module Main where
main :: IO ()
main = print "Hello, World!"
| fredmorcos/attic | projects/pet/archive/pet_haskell_old_parsers/Main.hs | isc | 62 | 0 | 6 | 13 | 22 | 12 | 10 | 3 | 1 |
{-# LANGUAGE DeriveFunctor
, DeriveFoldable
, DeriveTraversable
, TypeSynonymInstances
, FlexibleInstances
, FlexibleContexts
, UndecidableInstances #-}
module Abstract where
import Prelude hiding (foldr)
import Control.Monad.Reader
import Data.Set (Set)
import qualified Data.Set as Set
import qualifie... | andreasabel/helf | src/Abstract.hs | mit | 6,091 | 0 | 16 | 1,725 | 2,260 | 1,181 | 1,079 | 147 | 3 |
{-# OPTIONS_GHC -fno-warn-type-defaults #-}
{-# LANGUAGE RecordWildCards #-}
import Data.Foldable (for_)
import Test.Hspec (Spec, describe, it, shouldBe)
import Test.Hspec.Runner (configFastFail, defaultConfig, hspecWith)
import Binary (toDecimal)
main :: IO ()
main = hspecWith defaultConfig {configFastFa... | exercism/xhaskell | exercises/practice/binary/test/Tests.hs | mit | 3,073 | 0 | 8 | 1,411 | 534 | 333 | 201 | 61 | 1 |
{-# LANGUAGE PatternSynonyms, ForeignFunctionInterface, JavaScriptFFI #-}
module GHCJS.DOM.JSFFI.Generated.Event
(js_stopPropagation, stopPropagation, js_preventDefault,
preventDefault, js_initEvent, initEvent,
js_stopImmediatePropagation, stopImmediatePropagation,
pattern NONE, pattern C... | manyoo/ghcjs-dom | ghcjs-dom-jsffi/src/GHCJS/DOM/JSFFI/Generated/Event.hs | mit | 9,370 | 118 | 11 | 1,488 | 2,141 | 1,157 | 984 | 148 | 1 |
{-# LANGUAGE OverloadedStrings, CPP #-}
module Main (main) where
import Control.Exception(try, IOException)
import Control.Monad (when)
import System.Console.GetOpt
import Utils.Executable
import Utils.Text
import Madl.Network
import qualified Parser.MadlAST as AST (Network)
import Parser.MadlParser (madlParser)
i... | julienschmaltz/madl | app/Parser/parser-main.hs | mit | 4,575 | 0 | 26 | 1,133 | 1,169 | 616 | 553 | 93 | 6 |
module Feature.QueryLimitedSpec where
import Test.Hspec hiding (pendingWith)
import Test.Hspec.Wai
import Test.Hspec.Wai.JSON
import Network.HTTP.Types
import Network.Wai.Test (SResponse(simpleHeaders, simpleStatus))
import Text.Heredoc
import SpecHelper
import Network.Wai (Application)
import Protolude hiding (get)
... | Skyfold/postgrest | test/Feature/QueryLimitedSpec.hs | mit | 1,514 | 0 | 15 | 341 | 306 | 175 | 131 | -1 | -1 |
module Control.Concurrent.Extensions where
import Control.Concurrent as Concurrent
import Control.Concurrent.MVar as MVar
import Control.DeepSeq as DeepSeq
import Control.Exception.Base
import Data.Either as Either
import Data.Either.Extensions as EitherExt
import Prelude.Extensions as PreludeExt
forkFuture :: IO a ->... | stevedonnelly/haskell | code/Control/Concurrent/Extensions.hs | mit | 1,282 | 2 | 22 | 226 | 421 | 222 | 199 | 29 | 1 |
{-# LANGUAGE PatternSynonyms #-}
-- For HasCallStack compatibility
{-# LANGUAGE ImplicitParams, ConstraintKinds, KindSignatures #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
module JSDOM.Generated.Geolocation
(getCurrentPosition, watchPosition, watchPosition_, clearWatch,
Geolocation(..), gTypeGeoloca... | ghcjs/jsaddle-dom | src/JSDOM/Generated/Geolocation.hs | mit | 3,019 | 0 | 14 | 620 | 660 | 382 | 278 | 53 | 1 |
module Language.Haskell.Names (
isName,
name,
qName,
declName) where
import Language.Haskell.Syntax
isName :: String -> HsName -> Bool
isName n hsName = name hsName == n
name :: HsName -> String
name (HsSymbol n) = n
name (HsIdent n) = n
qName :: HsQName -> Maybe String
qName (Qual _ hsName) = Just (name... | flbulgarelli/hs-inspector | src/Language/Haskell/Names.hs | mit | 667 | 0 | 10 | 168 | 301 | 152 | 149 | 21 | 1 |
{-# LANGUAGE BangPatterns #-}
module Tools.Mill.Query
( Query
, parseQuery
, passTest
, Test (..)
) where
import Data.Either
import Tools.Mill.Table
import Text.Parsec.Prim
import Text.Parsec.Error
import Text.Parsec.Char
import Text.Parsec.Combinator
import Text.Parsec.ByteString (GenParser)
imp... | lucasdicioccio/mill | Tools/Mill/Query.hs | mit | 2,924 | 0 | 13 | 678 | 981 | 529 | 452 | 75 | 2 |
{-# LANGUAGE CPP, RankNTypes #-}
-- | Functions for interacting with bytes.
module Data.Conduit.Binary
( -- * Files and @Handle@s
-- | Note that most of these functions live in the @MonadResource@ monad
-- to ensure resource finalization even in the presence of exceptions. In
-- order to run such... | moonKimura/conduit-1.0.8 | Data/Conduit/Binary.hs | mit | 11,171 | 0 | 23 | 3,433 | 2,768 | 1,420 | 1,348 | 217 | 5 |
{-
Fibonacci sequence
-}
module Fib where
import Data.List
import Data.Bits
fibs :: [Integer]
fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
zipWith' f (a:as) (b:bs) = x `seq` x : zipWith' f as bs
where
x = f a b
zipWith' _ _ _ = []
fibs' :: [Integer]
fibs' = 0 : 1 : zip... | kittttttan/pe | haskell/Fib.hs | mit | 1,164 | 0 | 13 | 504 | 590 | 311 | 279 | 27 | 3 |
{--
Problem 40
An irrational decimal fraction is created by concatenating the positive integers:
0.123456789101112131415161718192021...
It can be seen that the 12th digit of the fractional part is 1.
If dn represents the nth digit of the fractional part, find the value of the following expression.
d1 × d10 × d100 ... | RossMeikleham/Project-Euler-Haskell | 40.hs | mit | 530 | 1 | 11 | 110 | 87 | 46 | 41 | 4 | 1 |
{-# LANGUAGE NoImplicitPrelude #-}
module Cipher where
import Control.Monad (return)
import Data.Bool (otherwise)
import Data.Char (Char)
import Data.Int (Int)
import Data.List (map)
import Data.Ord ((>), (<))
import Data.String (String)
import Prelude (($), (-), pred, succ)
import System.IO (IO, getLine, putStrLn)
i... | Numberartificial/workflow | haskell-first-principles/haskell-programming-from-first-principles-master/src/Cipher.hs | mit | 1,003 | 0 | 9 | 279 | 432 | 229 | 203 | 32 | 1 |
import XMonad
import XMonad.Hooks.DynamicLog
import XMonad.Hooks.ManageDocks
import XMonad.Util.Run(spawnPipe)
import XMonad.Util.EZConfig(additionalKeys)
import System.IO
myManageHook = composeAll
[ title =? "File Operation Progress" --> doFloat
]
main = do
xmproc <- spawnPipe "/usr/bin/xmobar"
xmon... | kittehoverlord/dotfiles | .xmonad/xmonad.hs | gpl-2.0 | 2,443 | 0 | 18 | 863 | 598 | 349 | 249 | 50 | 3 |
module Main where
import Data.Ix
import Data.SuffixArray
import Data.CountingSort
import qualified Data.Vector as V
main = interact doSuffixArr
--dumb s = s
doSuffixArr s = let SuffixArray a _ = suffixArray $ V.fromList s
in (show (V.head a)) ++ "\n"
| VictorDenisov/suffixarray | Tests/Benchmark.hs | gpl-2.0 | 269 | 0 | 12 | 58 | 88 | 47 | 41 | 8 | 1 |
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
module Buildsome.ClangCommands
( make
) where
import Prelude.Compat hiding (FilePath)
import Buildsome.BuildMaps (TargetRep)
import Buildsome.Stats (Stats)
import Data.Aeson ((.=))
import Data.Aeson.Encode.Pretty (encodePretty)
import Data.Func... | sinelaw/buildsome | src/Buildsome/ClangCommands.hs | gpl-2.0 | 2,210 | 0 | 17 | 435 | 622 | 340 | 282 | 49 | 3 |
module Tests.ADTUntypedDebruijn where
import QHaskell.MyPrelude
import QHaskell.Expression.ADTUntypedDebruijn
import QHaskell.Variable.Plain
import qualified QHaskell.Expression.ADTValue as V
import QHaskell.Conversion
import QHaskell.Expression.Conversions.Evaluation.ADTUntypedDebruijn ()
dbl :: Exp
dbl = Abs (Fun ... | shayan-najd/QHaskell | Tests/ADTUntypedDebruijn.hs | gpl-3.0 | 852 | 0 | 23 | 259 | 325 | 179 | 146 | -1 | -1 |
module Main where
import Assembler.Assembler
import Assembler.Instruction
import Assembler.Parser
import Assembler.SymbolTable
import System.Environment
import System.IO
main = do
[inPath, outPath] <- getArgs
contents <- readFile inPath
{-
let Right voss = parseLines $ lines contents
Right tab... | rifung/nand2tetris | projects/compiler/app/Assembler.hs | gpl-3.0 | 531 | 0 | 10 | 115 | 90 | 48 | 42 | 11 | 1 |
module View.Panel
( drawPanel
) where
import Control.Lens hiding (index)
import View.ViewState
import View.Convert
import GameLogic
import Middleware.FreeGame.Facade
--TODO: Pause checkbox
--TODO: Collapsible panel
drawPanel :: ViewState ()
drawPanel = do
state <- get
let (_width, height) = state ^. w... | EPashkin/gamenumber-freegame | src/View/Panel.hs | gpl-3.0 | 5,492 | 0 | 16 | 1,563 | 1,847 | 919 | 928 | -1 | -1 |
import Test.HUnit
import qualified Test.RoutingTest as Routing
import qualified Test.HelperTest as Helper
allTests = TestList [
Routing.tests
,Helper.tests
]
main :: IO ()
main = runTestTT allTests >>= print
| shinjiro-itagaki/shinjirecs | shinjirecs-api/test/Test.hs | gpl-3.0 | 216 | 0 | 7 | 37 | 62 | 36 | 26 | 8 | 1 |
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
{-# OPTIONS_GHC -fno-warn-unused-binds #-}
{-# OPTIONS_GHC -fno-warn-unused-matches #-}
-- ... | olorin/amazonka | amazonka-ec2/gen/Network/AWS/EC2/DeleteSpotDatafeedSubscription.hs | mpl-2.0 | 3,801 | 0 | 9 | 688 | 369 | 227 | 142 | 54 | 1 |
module Matrix
( Matrix
, cols
, column
, flatten
, fromList
, fromString
, reshape
, row
, rows
, shape
, transpose
) where
import qualified Data.Vector as V
data Matrix a = Matrix (V.Vector a) Int Int deriving (Eq, Show)
cols :: Matrix a -> Int
cols (Matrix _ _ c) = c
cells :: Matrix a -> V.Vector a
cells (Matrix ... | daewon/til | exercism/haskell/matrix/src/Matrix.hs | mpl-2.0 | 1,426 | 0 | 11 | 392 | 693 | 360 | 333 | 49 | 2 |
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
-- |
-- Module : Network.Google.FirebaseDynamicLinks.Types
-- Copyright : (c) 2015-201... | brendanhay/gogol | gogol-firebase-dynamiclinks/gen/Network/Google/FirebaseDynamicLinks/Types.hs | mpl-2.0 | 6,855 | 0 | 7 | 1,502 | 674 | 467 | 207 | 187 | 1 |
{-# OPTIONS_GHC -F -pgmF ./dist/build/htfpp/htfpp #-}
module Foo.B (htf_thisModulesTests) where
import qualified Test.Framework as HTF
test_b_OK = assertEqual 1 1
| ekarayel/HTF | tests/Foo/B.hs | lgpl-2.1 | 166 | 0 | 5 | 23 | 30 | 19 | 11 | 4 | 1 |
module GCrypt.AsymmetricCrypto.IO (
initReadableString,
initWritableString,
initReadableByteString,
ACIOPtr,
ACIO(..),
mkACIO,
) where
import Foreign.Ptr
import Foreign.C.Types
import Foreign.ForeignPtr
import Data.ByteString (ByteString)
import Data.ByteString.Unsafe
import GCrypt.Base
-- | ... | sw17ch/hsgcrypt | src/GCrypt/AsymmetricCrypto/IO.hs | lgpl-3.0 | 1,366 | 0 | 15 | 348 | 381 | 200 | 181 | 35 | 1 |
module MaybeMonoid where
import Data.Monoid
import Test.QuickCheck
monoidAssoc :: (Eq m, Monoid m) => m -> m -> m -> Bool
monoidAssoc a b c = (a <> (b <> c)) == ((a <> b) <> c)
monoidLeftIdentity :: (Eq m, Monoid m) => m -> Bool
monoidLeftIdentity m = (mempty <> m) == m
monoidRightIdentity :: (Eq m, Mo... | thewoolleyman/haskellbook | 15/12/maor/MaybeMonoid.hs | unlicense | 1,474 | 0 | 15 | 394 | 621 | 321 | 300 | 42 | 1 |
{-# LANGUAGE DeriveGeneric #-}
module Model.JsonTypes.Invitation
( Invitation(..)
, jsonInvitation
)
where
import Data.Aeson (ToJSON)
import Data.Text (Text)
import Database.Persist.Sql (Entity(..))
import GHC.Generics (Generic)
import ... | flatrapp/core | app/Model/JsonTypes/Invitation.hs | apache-2.0 | 988 | 0 | 8 | 367 | 200 | 119 | 81 | 22 | 1 |
{-# LANGUAGE TupleSections #-}
{-# OPTIONS_GHC -Wall #-}
{-# OPTIONS_GHC -fno-warn-unused-matches #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GADTs ... | dorchard/camfort | src/Language/Fortran/Model/Translate.hs | apache-2.0 | 23,809 | 0 | 21 | 5,628 | 5,120 | 2,653 | 2,467 | 422 | 15 |
{-# OPTIONS -fglasgow-exts #-}
-----------------------------------------------------------------------------
{-| Module : QGraphicsScene_h.hs
Copyright : (c) David Harley 2010
Project : qtHaskell
Version : 1.1.4
Modified : 2010-09-02 17:02:26
Warning : this file is machine generated -... | keera-studios/hsQt | Qtc/Gui/QGraphicsScene_h.hs | bsd-2-clause | 52,510 | 0 | 22 | 10,774 | 16,951 | 8,155 | 8,796 | -1 | -1 |
{-# OPTIONS -fglasgow-exts #-}
-----------------------------------------------------------------------------
{-| Module : QColormap.hs
Copyright : (c) David Harley 2010
Project : qtHaskell
Version : 1.1.4
Modified : 2010-09-02 17:02:25
Warning : this file is machine generated - do not... | keera-studios/hsQt | Qtc/Gui/QColormap.hs | bsd-2-clause | 3,432 | 0 | 12 | 556 | 959 | 503 | 456 | -1 | -1 |
{-# LANGUAGE FlexibleContexts #-}
module Propellor.Property.Postfix where
import Propellor.Base
import qualified Propellor.Property.Apt as Apt
import qualified Propellor.Property.File as File
import qualified Propellor.Property.Service as Service
import qualified Propellor.Property.User as User
import qualified Data... | np/propellor | src/Propellor/Property/Postfix.hs | bsd-2-clause | 5,157 | 74 | 16 | 936 | 1,390 | 765 | 625 | 97 | 4 |
{-| Implementation of the Ganeti Query2 node group queries.
-}
{-
Copyright (C) 2012, 2013 Google Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain t... | apyrgio/snf-ganeti | src/Ganeti/Query/Network.hs | bsd-2-clause | 7,913 | 0 | 16 | 1,525 | 1,412 | 767 | 645 | 114 | 3 |
-- |
-- Module : Language.C.Quote.CUDA
-- Copyright : (c) 2006-2011 Harvard University
-- (c) 2011-2013 Geoffrey Mainland
-- : (c) 2013-2015 Drexel University
-- License : BSD-style
-- Maintainer : mainland@cs.drexel.edu
-- The quasiquoters exposed by this module support the ... | flowbox-public/language-c-quote | Language/C/Quote/CUDA.hs | bsd-3-clause | 2,779 | 0 | 8 | 606 | 565 | 349 | 216 | 53 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module Checks where
import Check.Http
import Check.Snmp
import Check.Snmp.Snmp
import Data.Yaml
import System.Cron
import Types
import Data.Map.Strict (unions)
checkRoutes :: Rules -> RouteCheck
checkRoutes rs =... | chemist/fixmon | src/Checks.hs | bsd-3-clause | 1,440 | 0 | 11 | 329 | 402 | 216 | 186 | 25 | 1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
module Yahoo.HistoricalData (
requestData,
) where
import Control.Lens
import Control.Monad (join, (>>=))
import Data.Aeson
import Data.Aeson.Lens (key, _Array)
import qualified Data.Aeson.Types as AT
import qualified Data.ByteString.Lazy as ... | tetigi/raider | src/Yahoo/HistoricalData.hs | bsd-3-clause | 2,117 | 0 | 13 | 477 | 685 | 356 | 329 | -1 | -1 |
{-# LANGUAGE QuasiQuotes #-}
import LiquidHaskell
import Language.Haskell.Liquid.Prelude (isEven)
[lq| takeEvens :: [Int] -> [{v: Int | v mod 2 = 0}] |]
takeEvens :: [Int] -> [Int]
takeEvens [] = []
takeEvens (x:xs) = if isEven x
then x : takeEvens xs
else takeEvens ... | spinda/liquidhaskell | tests/gsoc15/unknown/pos/modTest.hs | bsd-3-clause | 324 | 0 | 7 | 100 | 87 | 49 | 38 | 9 | 2 |
module Part1.Problem24 where
import Data.List (permutations)
--
-- Problem 24: Lexicographic permutations
--
-- A permutation is an ordered arrangement of objects. For example, 3124 is one
-- possible permutation of the digits 1, 2, 3 and 4. If all of the permutations
-- are listed numerically or alph... | c0deaddict/project-euler | src/Part1/Problem24.hs | bsd-3-clause | 1,109 | 0 | 11 | 247 | 286 | 163 | 123 | 15 | 3 |
{-# LANGUAGE DeriveDataTypeable #-}
module Reactor.Moore
( Moore(..)
) where
import Control.Applicative
import Control.Comonad
import Data.Functor.Apply
import Data.Typeable
data Moore i o = Moore { step :: i -> Moore i o, current :: o }
deriving Typeable
instance Functor (Moore i) where
fmap g (Moore f o) =... | ekmett/reactor | Reactor/Moore.hs | bsd-3-clause | 800 | 0 | 10 | 200 | 393 | 207 | 186 | 26 | 0 |
module Commi.Plot where
import Haste.Graphics.Canvas
import Haste.Perch hiding (head)
import Haste.HPlay.View hiding (head)
import Prelude hiding (id, div)
import Text.Printf
import Data.Function hiding (id)
import Data.List
import Control.Monad.IO.Class (liftIO)
import Control.Arrow
import Control.Applicative
import ... | Teaspot-Studio/bmstu-commi-genetics-haste | Commi/Plot.hs | bsd-3-clause | 4,891 | 0 | 19 | 1,293 | 2,297 | 1,212 | 1,085 | 96 | 4 |
{-# LANGUAGE CPP #-}
-- #define DEBUG
{-|
Module : AERN2.RealFun.UnaryBallFun.Integration
Description : unary function integration
Copyright : (c) Michal Konecny
License : BSD3
Maintainer : mikkonecny@gmail.com
Stability : experimental
Portability : portable
Unary ... | michalkonecny/aern2 | aern2-fun-univariate/src/AERN2/RealFun/UnaryBallFun/Integration.hs | bsd-3-clause | 3,961 | 0 | 20 | 1,026 | 874 | 458 | 416 | -1 | -1 |
{-# LANGUAGE BangPatterns #-}
module Sound.Amplitude
(
-- ** Decibel amplitude
Amplitude
, db
, dbn
-- ** Limiting amplitude
, limit
, flimit
, clamp
, fclamp
-- ** Ramp streams
, lgeos
-- ** Contours/envelopes
, rlexp
)
where
import Sound.InfList
import Sound.Time
... | edom/sound | src/Sound/Amplitude.hs | bsd-3-clause | 1,837 | 0 | 12 | 554 | 523 | 265 | 258 | 43 | 3 |
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE OverloadedStrings #-}
module Heed.DbEnums
( ItemsDate(Missing, Present)
, PGItemsDate
) where
import qualified Data.ByteString.Char8 as B8
import Data.M... | Arguggi/heed | heed-lib/src/Heed/DbEnums.hs | bsd-3-clause | 2,810 | 0 | 13 | 536 | 590 | 324 | 266 | -1 | -1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ScopedTypeVariables #-}
module Main where
import Control.Monad.Trans.Reader
import Control.Monad.Trans.State
import Control.Monad.Trans.Class
import Control.Monad.Loops
import Control.Monad
import System.Random
import System.IO
import qualified Data.Map as M
import Dat... | jo-taro/hpffp-ch26-monad-transformers | src/Morra.hs | bsd-3-clause | 5,427 | 0 | 15 | 1,455 | 1,706 | 869 | 837 | 140 | 2 |
module Control.ConstraintClasses.Lookup
(
-- * Constraint Lookup
CLookup (..)
, (!?)
) where
import Control.ConstraintClasses.Domain
import Control.ConstraintClasses.Key
import Control.ConstraintClasses.Functor
import Data.Key
-- base
import Data.Functor.Product
import Data.Functor.Sum
import Data.Functo... | guaraqe/constraint-classes | src/Control/ConstraintClasses/Lookup.hs | bsd-3-clause | 1,512 | 0 | 10 | 213 | 333 | 195 | 138 | 31 | 1 |
module Sexy.Instances.Apply.Function () where
import Sexy.Classes (Apply(..))
instance Apply (a -> b) where
type In (a -> b) = a
type Out (a -> b) = b
f $ x = f x
| DanBurton/sexy | src/Sexy/Instances/Apply/Function.hs | bsd-3-clause | 171 | 0 | 7 | 41 | 86 | 49 | 37 | -1 | -1 |
module Data.Array.Repa.Repr.Unboxed
( U, U.Unbox, Array (..)
, computeUnboxedS, computeUnboxedP
, fromListUnboxed
, fromUnboxed, toUnboxed
, zip, zip3, zip4, zip5, zip6
, unzip, unzip3, unzip4, unzip5, unzip6)
where
import Data.Array.Repa.Shape ... | kairne/repa-lts | Data/Array/Repa/Repr/Unboxed.hs | bsd-3-clause | 8,216 | 0 | 16 | 2,127 | 2,839 | 1,490 | 1,349 | -1 | -1 |
module Sets where
import Data.List hiding (union)
newtype Set a = SetI [a]
mapSet :: Ord b => (a -> b) -> Set a -> Set b
mapSet f (SetI xs) = makeSet (map f xs)
makeSet :: Ord a => [a] -> Set a
makeSet = SetI . remDups . sort
where
remDups [] = []
remDups [x] = [x]
remDups (x:y:xs)
| x... | arthurmgo/regex-ftc | src/Sets.hs | bsd-3-clause | 1,770 | 0 | 11 | 596 | 1,094 | 542 | 552 | 58 | 3 |
module Gidl.Types.Base
( uint8_t
, uint16_t
, uint32_t
, uint64_t
, sint8_t
, sint16_t
, sint32_t
, sint64_t
, bool_t
, float_t
, double_t
, sequence_num_t
, baseTypeEnv
) where
import Gidl.Types.AST
uint8_t :: Type
uint8_t = PrimType (AtomType (AtomWord Bits8))
uint16_t :: Type
uint16_... | GaloisInc/gidl | src/Gidl/Types/Base.hs | bsd-3-clause | 1,463 | 0 | 11 | 276 | 487 | 280 | 207 | 53 | 1 |
{-# LANGUAGE CPP #-}
-----------------------------------------------------------------------------
-- |
-- Module : Distribution.Client.Install
-- Copyright : (c) 2005 David Himmelstrup
-- 2007 Bjorn Bringert
-- 2007-2010 Duncan Coutts
-- License : BSD-like
--
-- Mai... | ian-ross/cabal | cabal-install/Distribution/Client/Install.hs | bsd-3-clause | 65,207 | 0 | 31 | 18,175 | 12,402 | 6,429 | 5,973 | 1,152 | 12 |
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE UndecidableInstances #-}
module Shed.Types where
import Control.Monad.Base (MonadBase(..), liftBaseDefault)
import Control.Monad.Trans.Control
( MonadBaseCo... | wayofthepie/shed | src/Shed/Types.hs | bsd-3-clause | 1,377 | 0 | 13 | 280 | 355 | 200 | 155 | 40 | 0 |
{-# LANGUAGE TemplateHaskell #-}
module Cauterize.JavaScript.Files
( allFiles
) where
import qualified Data.ByteString as B
import Data.FileEmbed
allFiles :: [(FilePath, B.ByteString)]
allFiles = $(embedDir "data/support")
| cauterize-tools/caut-javascript-ref | src/Cauterize/JavaScript/Files.hs | bsd-3-clause | 229 | 0 | 7 | 31 | 54 | 34 | 20 | 7 | 1 |
{-
Copyright (C) 2012-2017 Jimmy Liang, Kacper Bak, Michał Antkiewicz <http://gsd.uwaterloo.ca>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitatio... | juodaspaulius/clafer | src/Language/Clafer/Intermediate/SimpleScopeAnalyzer.hs | mit | 12,635 | 0 | 17 | 3,264 | 2,657 | 1,402 | 1,255 | -1 | -1 |
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE RoleAnnotations #-}
{-# LANGUAGE DataKinds #... | xcv-/hfind | src/System/HFind/Path.hs | mit | 4,732 | 0 | 14 | 1,146 | 1,661 | 855 | 806 | 128 | 4 |
{-# LANGUAGE TupleSections,FlexibleContexts #-}
module LabelConnections where
import Data.Functor
import qualified Data.Map as M
import Data.Map ((!))
--import Debug.Trace
import Data.Function
import Data.List (sortBy)
import Types
import Unification
import Propositions
import Scopes
import Unbound.LocallyNameless
... | psibi/incredible | logic/LabelConnections.hs | mit | 4,433 | 0 | 17 | 1,267 | 1,258 | 661 | 597 | 70 | 9 |
{-| (re-exports)
re-export everything, for convenient importing, and for `ghci`:
@
:m +Commands.Plugins.Spiros
@
-}
module Commands.Plugins.Spiros
( module Commands.Plugins.Spiros.Extra
, module Commands.Plugins.Spiros.Types
, module Commands.Plugins.Spiros.TypeLevel
, module Commands.Plugins.Spiros.Main
, modu... | sboosali/commands-spiros | config/Commands/Plugins/Spiros.hs | gpl-2.0 | 1,960 | 0 | 5 | 168 | 278 | 207 | 71 | 35 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.