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 Import.File where
import Prelude
import Yesod
import Data.Text (Text, unpack, pack)
import qualified Data.Text as T
import System.FilePath ((</>))
import Data.Char (isPrint, toLower)
import ModelTypes
-- | List of files types which have thumbnails
thumbFileTypes :: [Fi... | ahushh/Monaba | monaba/src/Import/File.hs | mit | 2,415 | 0 | 12 | 444 | 627 | 340 | 287 | 39 | 5 |
module CFDI.Types.ConceptTaxes where
import CFDI.Chainable
import CFDI.Types.ConceptRetainedTaxes
import CFDI.Types.ConceptTransferedTaxes
import CFDI.XmlNode
import Data.Maybe (catMaybes)
data ConceptTaxes = ConceptTaxes
{ conceptRetainedTaxes :: Maybe ConceptRetainedTaxes
, conceptTrans... | yusent/cfdis | src/CFDI/Types/ConceptTaxes.hs | mit | 802 | 0 | 9 | 161 | 180 | 97 | 83 | 22 | 0 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE Strict #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
-- | Geometry Scenario
--
-- The main structure in qua-view!
--
module Model.Scenario
... | achirkin/qua-view | src/Model/Scenario.hs | mit | 14,362 | 0 | 13 | 3,750 | 4,518 | 2,339 | 2,179 | -1 | -1 |
module GraphDB.Util.TH.Q where
import GraphDB.Util.Prelude
import Language.Haskell.TH
import qualified GraphDB.Util.TH.Type as Type
import qualified Data.Attoparsec.Text as AP
import qualified Data.Text.IO as Text
import qualified Data.Text as Text
import qualified Data.Char as Char
import qualified Language.Haskell.T... | nikita-volkov/graph-db | library/GraphDB/Util/TH/Q.hs | mit | 3,383 | 0 | 24 | 873 | 1,041 | 538 | 503 | -1 | -1 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE QuasiQuotes #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE RecursiveDo #-}
module Widgets.Modal.ServicePlugin
( popupServicePlugin
) where
import Reflex.Dom
import Text.Julius (julius, rawJS)
import La... | achirkin/qua-view | src/Widgets/Modal/ServicePlugin.hs | mit | 4,587 | 9 | 16 | 1,474 | 822 | 432 | 390 | 92 | 6 |
{-# LANGUAGE QuasiQuotes #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE EmptyDataDecls #-}
{-# LANGUAGE MultiParamTypeClasses #-... | cuklev/huseless-pastebin | src/Model.hs | mit | 650 | 0 | 8 | 165 | 85 | 52 | 33 | 16 | 0 |
/*Owner & Copyrights: Vance King Saxbe. A.*//* Copyright (c) <2014> Author Vance King Saxbe. A, and contributors Power Dominion Enterprise, Precieux Consulting and other contributors. Modelled, Architected and designed by Vance King Saxbe. A. with the geeks from GoldSax Consulting and GoldSax Technologies email @vsaxbe... | VanceKingSaxbeA/GoldSaxMachineStore | GoldSaxMachineModule6/src/Chapter6/CombinatorsState.hs | mit | 4,327 | 23 | 29 | 1,233 | 1,532 | 843 | 689 | 51 | 2 |
{-# LANGUAGE OverloadedStrings #-}
module Component where
import Book
import Reflex.Dom
import Data.Map (Map)
import qualified Data.Map as Map
import Data.Text (Text)
type AttrMap = Map Text Text
searchInput :: MonadWidget t m => m (TextInput t)
searchInput = do
textInput $
def & attributes ... | tippenein/bookshelf | src/Component.hs | mit | 2,356 | 0 | 18 | 570 | 769 | 375 | 394 | 55 | 1 |
module SrcTemplateLexer
(
stringLit,
intLit,
identifier,
symbol,
reserved,
whiteSpace,
reservedOp,
parens,
squares
)
where
import Text.ParserCombinators.Parsec
import qualified Text.ParserCombinators.Parsec.Token as P
import Text.ParserCombinators.Parsec.Language(javaStyle)
srcTemplateLex... | thomkoehler/SrcGen | src/SrcTemplateLexer.hs | gpl-2.0 | 1,162 | 0 | 9 | 226 | 294 | 175 | 119 | 33 | 1 |
import System.Environment (getArgs)
import System.Exit (exitFailure)
import AbsMini
import LexMini
import ParMini
import ErrM
import AnnotatingTypeChecker
import Compiler
-- driver
comp :: String -> String -> IO ()
comp name s = case pProgram (myLexer s) of
Bad err -> do putStrLn "SYNTAX ERROR"
... | izimbra/PLT2014 | mini/haskell/compmini.hs | gpl-2.0 | 1,023 | 0 | 16 | 457 | 266 | 127 | 139 | 26 | 3 |
{-
(
save,
UrlSchemes
)
-}
{-# LANGUAGE UnicodeSyntax #-}
{-# LANGUAGE GADTs, TypeFamilies, TemplateHaskell, QuasiQuotes, FlexibleInstances, StandaloneDeriving #-}
module Database.Categories
where
import URL
-- import Database.Groundhog.TH
-- import Database.Groundhog.MySQL
data Categories =... | xruzzz/axt-links-saver-haskell | src/Categories.hs | gpl-2.0 | 747 | 0 | 8 | 208 | 39 | 27 | 12 | 8 | 0 |
{-# LANGUAGE ForeignFunctionInterface #-}
import Data.ByteString.Char8 (pack, unpack)
import Network hiding (accept, sClose)
import Network.Socket hiding (recv)
import Network.Socket.ByteString (sendAll, recv)
import Control.Concurrent
import Foreign.C
import Foreign.Marshal.Alloc()
foreign import ccall start_findi... | PeterPiggyDevelopment/Labyrinth | src/server/server.hs | gpl-2.0 | 748 | 0 | 15 | 179 | 242 | 127 | 115 | 21 | 1 |
{-# LANGUAGE CPP #-}
{- |
Module : ./Common/Utils.hs
Description : utility functions that can't be found in the libraries
Copyright : (c) Klaus Luettich, Uni Bremen 2002-2006
License : GPLv2 or higher, see LICENSE.txt
Maintainer : Christian.Maeder@dfki.de
Stability : provisional
Portability : port... | gnn/Hets | Common/Utils.hs | gpl-2.0 | 17,063 | 0 | 20 | 4,715 | 4,663 | 2,442 | 2,221 | 310 | 6 |
module Parse (parseScript) where
import Text.Parsec hiding (Line, sourceLine)
import Text.Parsec.String
import Text.Printf
------------------------------------------------------------
-- public api
------------------------------------------------------------
parseScript :: String -> String -> Maybe ScriptData
parseS... | steventlamb/kj | src/Parse.hs | gpl-3.0 | 3,118 | 0 | 15 | 667 | 840 | 420 | 420 | 70 | 3 |
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE Rank2Types #-}
{-# OPTIONS_GHC -F -pgmF htfpp #-}
-- # Standard Library
import qualified Data.Map as M
-- # Site Packages
import Crypto.Random (SystemRandom, newGenIO)
import Control.Monad.CryptoRandom (CRandom(..))
-- # Local
impor... | weissi/diplomarbeit | test/TestRAE.hs | gpl-3.0 | 10,765 | 0 | 36 | 3,968 | 3,193 | 1,638 | 1,555 | 231 | 4 |
{-|
Module : Primeri
Description : Primeri tipov
Copyright : (c) Domen Močnik, 2015
Matej Aleksandorv 2015
License : GPL-3
Maintainer : domen.monik@gmail.com, matej.aleksandrov@gmail.com
Stability : experimental
Portability : POSIX
Nekaj primerov tipov, ki se jih lahko uporabi v program... | Trdonja/Zastonjski-izreki | Primeri.hs | gpl-3.0 | 1,236 | 0 | 5 | 254 | 190 | 125 | 65 | 17 | 1 |
module Interp(apply,arity) where
import Data.List((!!))
import Data.Map(Map,(!))
import SyntaxTree(Bits,Pattern(Literal,Binding,Wildcard),Expr(LiteralBits,Concat,Bound,Call),Definition(Def))
apply :: Map String [Definition] -> String -> [Bits] -> Bits
arity :: Map String [Definition] -> String -> Int
arity defs fn ... | qpliu/esolang | 01_/hs/interp/Interp.hs | gpl-3.0 | 1,870 | 0 | 14 | 569 | 738 | 379 | 359 | 44 | 6 |
module Command
( Command(..)
, readCommand
)
where
import Data.Char (isDigit)
import Data.Maybe
import Text.ParserCombinators.ReadP as P
import Types (Color(..))
data Command
= CmdColor Color
| CmdBlock Int Int Int
| CmdBrick Int Int
| CmdPlate Int Int
| CmdClone
| CmdDelete
| CmdMove
... | holmisen/glbrix | src/Command.hs | gpl-3.0 | 1,676 | 0 | 12 | 498 | 585 | 298 | 287 | 68 | 14 |
-- | This module contains functions for generating & manipulating Widgets.
module Util.Widgets where
import Data.Maybe (fromJust)
import Import
-- | The GET value for a Sorting Option.
type SortValue = Text
-- | The display name for a Sorting Option.
type SortName = Text
-- | A list of... | prikhi/MyBookList | Util/Widgets.hs | gpl-3.0 | 1,285 | 0 | 12 | 302 | 275 | 155 | 120 | -1 | -1 |
module Problems61thru69Spec where
import Problems61thru69
import ADT.Tree
import Test.Hspec
tree :: Tree Int
tree = Node (Node Nil 2 (leaf 4)) 1 (leaf 2)
spec :: Spec
spec = do
describe "countLeaves" $ do
it "can count leaves of a binary tree" $ do
countLeaves tree `shouldBe` 2
describe "leaves" $ do
... | zcesur/h99 | tests/Problems61thru69Spec.hs | gpl-3.0 | 686 | 0 | 14 | 170 | 217 | 107 | 110 | 20 | 1 |
{-# LANGUAGE TypeOperators #-}
module Pearl.SWB.Section07 where
import Pearl.SWB.Section03 (
K(..)
, Gf(..)
, Lf(..)
, KList(..)
, SList(..)
, fold
, unfold
)
import... | technogeeky/pearl-sorting-with-bialgebras | src/Pearl/SWB/Section07.hs | gpl-3.0 | 6,233 | 0 | 12 | 2,989 | 2,049 | 1,071 | 978 | -1 | -1 |
module TaskTree.Cli.Run
( runCmd
, load
)
where
import TaskTree.Cli.Cmd
import TaskTree.Cli.Draw (draw)
import TaskTree.Lib (Forest, Task, loadForest)
runCmd :: Forest Task -> Cmd -> IO (Forest Task)
runCmd ts (Load f) = load ts f
runCmd ts (Save f) = save ts f
runCmd ts (Edit s) = edit ts s
runCmd ts ... | jefdaj/todotree | old/TaskTree/Cli/Run.hs | gpl-3.0 | 856 | 0 | 13 | 216 | 388 | 190 | 198 | 27 | 2 |
-- ProjectEuler assignment 9
-- find the special Pythagorean triples for which a + b + c = 1000
-- Since the sum of the triplets is 1000, the maximum value of c can also be 1000.
-- Since it's a natural number, a^2 + b^2 should be in the list of squared values from 0 .. 1000
-- Takes some time, but resolves to 3187500... | vdweegen/UvA-Software_Testing | Lab1/Bauke/ProjectEuler9.hs | gpl-3.0 | 1,235 | 0 | 10 | 316 | 466 | 238 | 228 | 24 | 1 |
module Main where
import Control.Arrow
import System.IO (hPutStrLn, stderr)
import Text.XML.HXT.Core
import Text.ParserCombinators.Parsec
import Data.List (intercalate)
import Text.Parse.SvgPath.PathParser
( Path
, PathInstruction
, parsePath
, convertToAbsolute
, pathBounds
, scaleToFit
, dumbGcode
)... | r24y/svg2gcode | Svg2Gcode.hs | gpl-3.0 | 1,127 | 0 | 13 | 321 | 339 | 178 | 161 | 34 | 3 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-compute/gen/Network/Google/Resource/Compute/MachineTypes/AggregatedList.hs | mpl-2.0 | 8,333 | 0 | 20 | 1,772 | 842 | 503 | 339 | 123 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | rueshyna/gogol | gogol-logging/gen/Network/Google/Resource/Logging/Folders/Sinks/Delete.hs | mpl-2.0 | 5,699 | 0 | 17 | 1,351 | 860 | 503 | 357 | 121 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-compute/gen/Network/Google/Resource/Compute/Routers/Get.hs | mpl-2.0 | 3,536 | 0 | 16 | 860 | 468 | 280 | 188 | 75 | 1 |
-- | This module contains the definitions for a generic parser, without
-- running state. These are the parts that are shared between the Plain
-- and Lazy variations. Do not import this module directly, but only
-- via T.P.Poly.Plain or T.P.Poly.Lazy.
module Text.ParserCombinators.Poly.Parser
( -- * The Pars... | Kludgy/polyparse-fork | src/Text/ParserCombinators/Poly/Parser.hs | lgpl-2.1 | 5,311 | 0 | 21 | 1,692 | 1,295 | 683 | 612 | 76 | 2 |
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE ExistentialQuantification #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ApplicativeDo #-}
module Main where
import Control.Applicative
import Control.Concurrent.STM
import KVOperation
import Action
import Backen... | kdkeyser/kvstore-batch | app/Main.hs | lgpl-3.0 | 7,281 | 0 | 14 | 1,560 | 2,074 | 1,004 | 1,070 | 168 | 6 |
import Test.HUnit
import P9x.P70.P70
import P9x.Util
p70 = testList "P70" [
expectEqual_ 2 (nodeCount (MNode 'a' [(MNode 'b' [])])),
expectEqual_ (MNode 'a' []) (stringToMTree "a^"),
expectEqual_ (MNode 'a' [(MNode 'b' [(MNode 'c' [])])]) (stringToMTree "abc^^^"),
expectEqual_ (MNode 'a' [(MNode 'b' [... | dkandalov/katas | haskell/p99/src/p9x/p70/P70_Test.hs | unlicense | 2,588 | 0 | 18 | 751 | 919 | 475 | 444 | 55 | 1 |
import Data.List
import Data.Char
import Unsafe.Coerce
import Test.HUnit
data Nat = Zero
| Succ Nat
deriving Show
-- natToInteger Zero = 0
-- natToInteger (Succ n) = natToInteger n + 1
-- natToInteger = head . m
-- where m Zero = [0]
-- m (Succ n) = [sum ... | prt2121/fp101x | natToInt.hs | apache-2.0 | 650 | 0 | 13 | 208 | 153 | 83 | 70 | 13 | 1 |
{-
Copyright 2015 Tristan Aubrey-Jones
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://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, sof... | flocc-net/flocc | v0.1/Compiler/Types/TermBuilder.hs | apache-2.0 | 18,982 | 0 | 28 | 4,393 | 5,535 | 2,826 | 2,709 | 311 | 12 |
-- searchable spaces, based on code by Martin Escardo
module Searchable where
data Searchable a = Finder ((a -> Bool) -> a)
find :: Searchable a -> (a -> Bool) -> a
find (Finder epsilon) p = epsilon p
-- auxiliary function search
search :: Searchable a -> (a -> Bool) -> Maybe a
search s p =
let x = find s p
... | andrejbauer/marshall | etc/haskell/Searchable.hs | bsd-2-clause | 1,957 | 0 | 16 | 609 | 748 | 383 | 365 | 38 | 4 |
{-# LANGUAGE TypeFamilies, FlexibleInstances, FlexibleContexts,
DeriveDataTypeable, StandaloneDeriving #-}
module HEP.Automation.MadGraph.Model.C1SLowSimple where
import Data.Typeable
import Data.Data
import Text.Printf
import Text.Parsec
import Control.Monad.Identity
import Text.StringTemplate
impor... | wavewave/madgraph-auto-model | src/HEP/Automation/MadGraph/Model/C1SLowSimple.hs | bsd-2-clause | 3,319 | 0 | 17 | 991 | 994 | 521 | 473 | 72 | 2 |
module Language.Drasil.Code.Imperative.Build.AST where
import Build.Drasil (makeS, MakeString, mkImplicitVar, mkWindowsVar)
type CommandFragment = MakeString
data BuildName = BMain
| BPackName
| BPack BuildName
| BWithExt BuildName Ext
data Ext = CodeExt
| OtherE... | JacquesCarette/literate-scientific-software | code/drasil-code/Language/Drasil/Code/Imperative/Build/AST.hs | bsd-2-clause | 2,075 | 0 | 9 | 383 | 518 | 288 | 230 | 51 | 1 |
{-# LANGUAGE OverloadedLists #-}
{-# LANGUAGE TemplateHaskell #-}
module Test.Examples.ExpSpec
( spec
) where
import Control.Category (id, (.))
import Control.Lens ((&))
import Data.Bits (xor, (.&.), (.|.))
import Data.Monoid ((<>))
import Prel... | Martoon-00/toy-compiler | test/Test/Examples/ExpSpec.hs | bsd-3-clause | 3,730 | 0 | 20 | 1,534 | 1,242 | 655 | 587 | 101 | 2 |
{-# LANGUAGE GADTs #-}
{-# LANGUAGE TypeFamilies #-}
module Data.Array.Accelerate.BLAS.Internal.Common
( devVF
, devVD
, devSF
, devSD
, allocScalar
, allocVector ) where
import Data.Array.Accelerate
import Data.Array.Accelerate.CUDA.Foreign
import Foreign.CUDA.Ptr
import Prelude hiding (zipWith)
impor... | alpmestan/accelerate-blas | src/Data/Array/Accelerate/BLAS/Common.hs | bsd-3-clause | 1,088 | 0 | 9 | 190 | 365 | 200 | 165 | 33 | 1 |
module ProjectEuler.Problem071 (solution071) where
import Data.Ratio
genericSolution :: Integral a => Ratio a -> a -> a
genericSolution target maxDen = loop initNum initDen 0
where initNum = numerator target
initDen = 1 + denominator target
loop num den closest
| den == maxDen = ... | guillaume-nargeot/project-euler-haskell | src/ProjectEuler/Problem071.hs | bsd-3-clause | 577 | 0 | 12 | 172 | 193 | 97 | 96 | 13 | 1 |
module HVX.DcpTests.OkXAffine where
import Numeric.LinearAlgebra
import HVX
main :: IO ()
main = do
let zero = EConst $ konst 0.0 (2, 1)
x = EVar "x"
e = hexp $ x
_ = zero >=~ e
_ = e <=~ zero
return ()
| chrisnc/hvx | test/DcpTests/OkConstraints.hs | bsd-3-clause | 234 | 0 | 12 | 75 | 99 | 52 | 47 | 11 | 1 |
module DnoList.Wrapper where
import System.Environment
import Data.Yaml
import DnoList.Types
wrapMain :: (Settings -> IO ()) -> IO ()
wrapMain run = do
Just file <- lookupEnv "DNOLIST_SETTINGS"
Just settings <- decodeFile file
run settings
| abbradar/dnolist | src/DnoList/Wrapper.hs | bsd-3-clause | 249 | 0 | 9 | 43 | 87 | 42 | 45 | 9 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module Hasmin.Types.BasicShapeSpec where
import Data.Text (Text)
import Data.Foldable (traverse_)
import Data.Attoparsec.Text (Parser)
import Test.Hspec.QuickCheck (modifyMaxSuccess)
import Hasmin.Parser.Value
import Hasmin.Types.Value
import Hasmin.Types.BasicShape
import Hasmin.T... | contivero/hasmin | tests/Hasmin/Types/BasicShapeSpec.hs | bsd-3-clause | 1,648 | 0 | 12 | 298 | 323 | 194 | 129 | 37 | 1 |
module Problem2 where
import Data.Char
import Data.List
import Control.Applicative
import System.IO
import Text.Printf
-- The goal of this code problem is to implement an algorithm for the fractional knapsack problem.
main :: IO ()
main =
hSetBuffering stdin NoBuffering >>= \_ ->
nextNum >>= \n ->
nextNum >>= ... | msosnicki/algorithms | app/week3/Problem2.hs | bsd-3-clause | 1,278 | 0 | 14 | 277 | 544 | 279 | 265 | 37 | 3 |
import qualified Fold as TF
import qualified Prisms as TP
import Test.Hspec
main :: IO ()
main = do
hspec TP.suite
hspec TF.suite
| anchor/ceilometer-common | tests/Main.hs | bsd-3-clause | 155 | 0 | 8 | 48 | 49 | 27 | 22 | 7 | 1 |
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
module Weather where
import Numeric (showFFloat)
import City
data Condition = Sunny
| Cloudy
| Rain
| Thunderstorm
| Snow
deriving (Show, Eq, Read)
newtype Temperature = Celsius {temp :: Double} der... | Michaelt293/TheWeather | src/Weather.hs | bsd-3-clause | 1,003 | 0 | 10 | 273 | 311 | 168 | 143 | 24 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module Siberia.Web where
import Control.Applicative
import Control.Monad
import Control.Monad.IO.Class
import Control.Monad.RWS.Lazy (liftIO)
import Data.Aeson
import Data.ByteString (ByteString)
import Data.ByteStrin... | chemist/siberia | src/Siberia/Web.hs | bsd-3-clause | 11,422 | 0 | 22 | 3,688 | 3,215 | 1,617 | 1,598 | 222 | 5 |
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
-- | Server types and operations for items that don't involve server state
-- nor our custom monads.
module Game.LambdaHack.Server.ItemRev
( ItemRev, buildItem, newItem, UniqueSet
-- * Item discovery types
, DiscoveryKindRev, serverDiscos, ItemSeedDict
-- * The @F... | Concomitant/LambdaHack | Game/LambdaHack/Server/ItemRev.hs | bsd-3-clause | 7,164 | 0 | 18 | 1,802 | 2,012 | 1,086 | 926 | -1 | -1 |
import System.Environment (getArgs)
import System.Posix.Files (fileSize, getFileStatus)
main :: IO ()
main = do
[inpFile] <- getArgs
status <- getFileStatus inpFile
print . toInteger . fileSize $ status
| nikai3d/ce-challenges | easy/filesize.hs | bsd-3-clause | 216 | 0 | 9 | 41 | 75 | 39 | 36 | 7 | 1 |
module AnimationSpec (main, spec) where
import Test.Hspec
import Animation
import Data.Aeson (decode)
import qualified Data.ByteString.Lazy.Char8 as C
main :: IO ()
main = hspec spec
spec :: Spec
spec = do
describe "iterate" $ do
it "should iterate between zero and 2" $
interpolate 3 0 2 `shouldBe` [0, ... | matt-keibler/svg-playground | test/AnimationSpec.hs | bsd-3-clause | 3,902 | 0 | 16 | 1,385 | 1,436 | 727 | 709 | 60 | 1 |
{-# LANGUAGE ScopedTypeVariables #-}
module Main (main) where
import Control.Exception
import Control.Applicative
import Network.Socket hiding (send, recv)
import Network.Socket.ByteString.Lazy
import Control.Concurrent.Async
import Data.Time
import System.IO
import Control.Monad
import System.Random
import Codec.Cryp... | Ilydocus/frp-prototype | src/ue.hs | bsd-3-clause | 7,184 | 0 | 20 | 1,813 | 2,028 | 1,044 | 984 | 147 | 9 |
module ProjectEuler.Problem024 (solution024) where
import Data.Digits
import Util
solution024 :: Integer
solution024 = unDigits 10 $ sortedPermutations [0..9] !! (1e6 - 1)
| guillaume-nargeot/project-euler-haskell | src/ProjectEuler/Problem024.hs | bsd-3-clause | 174 | 0 | 8 | 24 | 55 | 31 | 24 | 5 | 1 |
module PocStrategy where
import PocParser
import Control.Monad
import Data.Monoid
import qualified Data.Map.Lazy as Map
import Data.List (nub, sort, minimumBy)
import Data.Maybe
type Var = String
type In a = Maybe a
type Out a = [a]
type Tr = In Int
type ArrMap = Map.Map Var Tr
data Access = Access { interIn :: I... | NicolaiNebel/Bachelor-Poc | src/PocStrategy.hs | bsd-3-clause | 4,139 | 0 | 15 | 1,283 | 1,397 | 722 | 675 | 75 | 3 |
module Intel.ArBB.Variable where
data Variable = Variable String
deriving (Eq, Ord, Show) | svenssonjoel/EmbArBB | Intel/ArBB/Variable.hs | bsd-3-clause | 106 | 0 | 6 | 28 | 31 | 18 | 13 | 3 | 0 |
{-# LANGUAGE CPP, ForeignFunctionInterface #-}
#ifdef STRAIGHT
import StraightForwardSTM
#elif defined(DISSECTED)
import DissectedSTM
#elif defined(LOCKCOUPLING)
import LockCoupling
#elif defined(CAS)
import CASLL
#else
#error Undefined Implementation
#endif
import System.Random(randomRs, mkStdGen)
import Control.M... | ml9951/ghc | libraries/pastm/examples/damp-comparing-linked-lists/Main.hs | bsd-3-clause | 1,833 | 0 | 16 | 473 | 605 | 308 | 297 | -1 | -1 |
{-
(c) The University of Glasgow 2006
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998
Arity and eta expansion
-}
{-# LANGUAGE CPP #-}
-- | Arity and eta expansion
module CoreArity (
manifestArity, exprArity, typeArity, exprBotStrictness_maybe,
exprEtaExpandArity, findRhsArity, Chea... | tjakway/ghcjvm | compiler/coreSyn/CoreArity.hs | bsd-3-clause | 36,402 | 0 | 17 | 10,086 | 4,457 | 2,292 | 2,165 | 271 | 7 |
import Data.List
type Edge = (String, STree)
data STree = Node [Edge]
| Leaf
deriving (Show)
type EdgeFunction = [String] -> (Int, [String])
construct :: String -> STree
construct = suf . suffixes
where suf [[]] = Leaf
suf ss = Node [([a], suf n)
| a <-... | binesiyu/ifl | examples/ch04/SuffixTree.hs | mit | 1,827 | 0 | 13 | 548 | 768 | 423 | 345 | 41 | 2 |
module Settings.Builders.GhcPkg (ghcPkgBuilderArgs) where
import Settings.Builders.Common
ghcPkgBuilderArgs :: Args
ghcPkgBuilderArgs = mconcat
[ builder (GhcPkg Init) ? mconcat [ arg "init", arg =<< getOutput ]
, builder (GhcPkg Update) ? do
verbosity <- expr getVerbosity
context <- getCon... | izgzhen/hadrian | src/Settings/Builders/GhcPkg.hs | mit | 565 | 0 | 13 | 177 | 151 | 76 | 75 | 14 | 1 |
module SampleSpec where
import Test.Hspec
import Sample
spec :: Spec
spec = do
describe "helloWorld" $ do
it "hello world string" $
helloWorld `shouldBe` "hello world"
| joker1007/haskell-unittest-sample | test/SampleSpec.hs | mit | 188 | 0 | 12 | 46 | 48 | 26 | 22 | 8 | 1 |
-----------------------------------------------------------------------------
--
-- Object-file symbols (called CLabel for histerical raisins).
--
-- (c) The University of Glasgow 2004-2006
--
-----------------------------------------------------------------------------
{-# LANGUAGE CPP #-}
module CLabel (
CL... | ezyang/ghc | compiler/cmm/CLabel.hs | bsd-3-clause | 54,483 | 0 | 16 | 15,175 | 10,771 | 5,643 | 5,128 | 838 | 23 |
{-
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998
\section[RnSource]{Main pass of renamer}
-}
{-# LANGUAGE CPP, ScopedTypeVariables #-}
module RnSource (
rnSrcDecls, addTcgDUs, findSplice
) where
#include "HsVersions.h"
import {-# SOURCE #-} RnExpr( rnLExpr )
import {-# SOURCE #-} RnSplice (... | sgillespie/ghc | compiler/rename/RnSource.hs | bsd-3-clause | 96,564 | 1 | 25 | 30,032 | 17,518 | 9,256 | 8,262 | 1,099 | 8 |
{-# LANGUAGE TemplateHaskell, OverloadedStrings, GeneralizedNewtypeDeriving #-}
module SecondTransfer.Socks5.Types (
-- ** Types to be serialized and de-serialized
ClientAuthMethods_Packet (..)
, ServerSelectsMethod_Packet ... | shimmercat/second-transfer | hs-src/SecondTransfer/Socks5/Types.hs | bsd-3-clause | 6,294 | 0 | 12 | 2,183 | 728 | 448 | 280 | 97 | 1 |
{-# LANGUAGE CPP #-}
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE UndecidableInstances #-}
#if __GLASGOW_HASKELL__ >= 711
{-# OPTIONS_GHC -fno-warn-redundant-constraints #-}
#endif
-----------------------------------------------------------------------------
-- |
-- Module : Control... | omefire/lens | src/Control/Lens/Internal/Fold.hs | bsd-3-clause | 6,882 | 0 | 16 | 1,301 | 1,472 | 797 | 675 | 119 | 1 |
{-# LANGUAGE TupleSections, ViewPatterns #-}
-- | Lookup the documentation of a name in a module (and in a specific
-- package in the case of ambiguity).
module Haskell.Docs
(module Haskell.Docs
,Identifier(..)
,PackageName(..))
where
import Haskell.Docs.Cabal
import Haskell.Docs.Formatting
import Haskell.Do... | chrisdone/haskell-docs | src/Haskell/Docs.hs | bsd-3-clause | 2,828 | 0 | 19 | 1,006 | 661 | 350 | 311 | 67 | 5 |
module Translate(translate) where
import Control.Monad
import Data.List
import Data.Generics.PlateData
import HSE
import Type
import Convert
import qualified Desugar
import Supercompile
translate :: IO ()
translate = do
let parse x = fmap fromParseResult $ parseFileWithMode mode x
mode = defaultParseMo... | ndmitchell/tagsoup | test/TagSoup/Generate/Translate.hs | bsd-3-clause | 6,340 | 0 | 15 | 1,638 | 1,341 | 685 | 656 | 93 | 11 |
{-|
Module : Idris.Core.CaseTree
Description : Module to define and interact with case trees.
Copyright :
License : BSD3
Maintainer : The Idris Community.
Note: The case-tree elaborator only produces (Case n alts)-cases;
in other words, it never inspects anything else than variables.
ProjCase is a special... | Heather/Idris-dev | src/Idris/Core/CaseTree.hs | bsd-3-clause | 34,193 | 0 | 21 | 11,246 | 13,016 | 6,632 | 6,384 | 624 | 21 |
{-# LANGUAGE NondecreasingIndentation #-}
module PlaySound (playSound) where
import System.Process
import System.Exit
import Control.Monad
import Control.Exception
import System.IO.Error
import System.IO
import System.Directory
import System.FilePath
import qualified Data.ByteString.Lazy as B
import System.Environmen... | colinba/tip-toi-reveng | src/PlaySound.hs | mit | 1,525 | 0 | 19 | 391 | 441 | 228 | 213 | 40 | 4 |
yes = concat . map f | mpickering/hlint-refactor | tests/examples/Default0.hs | bsd-3-clause | 20 | 0 | 6 | 5 | 13 | 6 | 7 | 1 | 1 |
{-# LANGUAGE FlexibleContexts #-}
--------------------------------------------------------------------------------
-- | Miscellaneous string manipulation functions.
module Hakyll.Core.Util.String
( trim
, replaceAll
, splitAll
, needlePrefix
) where
------------------------------------------------... | oldmanmike/hakyll | src/Hakyll/Core/Util/String.hs | bsd-3-clause | 2,610 | 0 | 15 | 640 | 501 | 277 | 224 | 39 | 2 |
{-# LANGUAGE CPP #-}
-- to suppress WARNING in "Distribution.Compat.Prelude.Internal"
{-# OPTIONS_GHC -fno-warn-deprecations #-}
-- | This module does two things:
--
-- * Acts as a compatiblity layer, like @base-compat@.
--
-- * Provides commonly used imports.
--
-- This module is a superset of "Distribution.Compat.P... | mydaum/cabal | cabal-install/Distribution/Client/Compat/Prelude.hs | bsd-3-clause | 907 | 0 | 9 | 178 | 132 | 84 | 48 | 12 | 2 |
module Test19 where
f y = y
| kmate/HaRe | old/testing/refacSlicing/Test19_TokOut.hs | bsd-3-clause | 30 | 0 | 5 | 9 | 12 | 7 | 5 | 2 | 1 |
module Dependent where
import Dependency
dependent :: Int
dependent = dependency
| janicduplessis/buck | test/com/facebook/buck/haskell/testdata/library_test/Dependent.hs | apache-2.0 | 83 | 0 | 4 | 13 | 17 | 11 | 6 | 4 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module Main where
import Data.Aeson (toJSON, eitherDecodeStrict, encode, withObject, withArray)
import Control.Monad as CM (join)
import Data.Aeson.Types (Value (String), Parser, parseMaybe, (.:))
import Control.Monad.Catch (throwM)
import Data.ByteString (ByteString)
import GHC.Ext... | difley/modern-sawhorse | app/Main.hs | mit | 2,227 | 0 | 14 | 396 | 856 | 468 | 388 | 46 | 2 |
module MppAST where
import PrettyPrint
import ParserPos
{- AST for the M++ language. From M++ language spec. -}
data M_prog = M_prog ([M_decl],[M_stmt]) deriving (Eq)
data M_decl = M_var (String,[M_expr],M_type) Pos
| M_fun (String,[(String,Int,M_type)],M_type,[M_decl],[M_stmt]) Pos
| M_data (String,[(String... | JamesSullivan1/Mpp | src/MppAST.hs | mit | 3,513 | 0 | 17 | 943 | 1,629 | 878 | 751 | 76 | 1 |
module Main where
import Data.Trie.Test (trieTest)
import Spell.Test (spellTest)
import Test.Hspec (hspec, parallel)
main :: IO ()
main = hspec $ parallel (trieTest >> spellTest)
| fgrsnau/spell | test/Main.hs | mit | 181 | 0 | 8 | 27 | 67 | 39 | 28 | 6 | 1 |
module Rebase.Data.Time.LocalTime
(
module Data.Time.LocalTime
)
where
import Data.Time.LocalTime
| nikita-volkov/rebase | library/Rebase/Data/Time/LocalTime.hs | mit | 101 | 0 | 5 | 12 | 23 | 16 | 7 | 4 | 0 |
import Data.List
import Data.List.Extra
type Box = (Int, Int, Int)
readBox :: String -> Box
readBox s =
let [a, b, c] = map read $ wordsBy (=='x') s
in (a, b, c)
calcBox :: Box -> Int
calcBox (l, w, h) =
let sides = sort [l*w, l*h, w*h]
in 2*sum sides + head sides
answer f = interact $ (++"\n") . show . f
m... | msullivan/advent-of-code | 2015/A2a.hs | mit | 373 | 0 | 11 | 90 | 216 | 117 | 99 | 13 | 1 |
------------------------------------------------------------------------------
-- | This module defines our application's state type and an alias for its
-- handler monad.
module Application where
------------------------------------------------------------------------------
import Snap
import Control.Lens
imp... | lkania/Haskitter | src/Application.hs | mit | 808 | 0 | 9 | 105 | 68 | 42 | 26 | -1 | -1 |
{-# LANGUAGE ScopedTypeVariables #-}
module Hasgel.GL.Buffer (
Buffer, BufferData(..), BufferTarget(..), BufferUsage(..), BoundBuffer,
bindBuffer, bufferData,
clearBufferfv, clearDepthBuffer
) where
import Control.Monad.IO.Class (MonadIO (..))
import Foreign (Ptr, Storable (..), castPtr, with, withArray)
impor... | Th30n/hasgel | src/Hasgel/GL/Buffer.hs | mit | 2,202 | 0 | 13 | 355 | 699 | 369 | 330 | 51 | 1 |
module Main where
import Prolog
main :: IO ()
main = prolog
| sdemos/prolog | app/Main.hs | mit | 62 | 0 | 6 | 14 | 22 | 13 | 9 | 4 | 1 |
{-# LANGUAGE OverloadedStrings #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
module ActionSpec (main, spec) where
import Test.Hspec
import Test.QuickCheck
import qualified Test.QuickCheck.Monadic as QC
import Control.Monad.IO.Class
import Data.String.Builder
import Data.Li... | sol/pwsafe | test/ActionSpec.hs | mit | 5,938 | 0 | 22 | 1,684 | 1,592 | 767 | 825 | 164 | 2 |
{-# LANGUAGE NoImplicitPrelude, OverloadedStrings, RecordWildCards #-}
module Eyeshadow.Data.Token
(TokenType(..),
Token(..))
where
import qualified Data.Text as Text
import Data.Char
import Data.Maybe
import Eyeshadow.Data.Span
import Eyeshadow.Prelude
data TokenType
= WordTokenType
| NumberTokenType
... | IreneKnapp/Eyeshadow | Haskell/Eyeshadow/Data/Token.hs | mit | 1,780 | 0 | 10 | 386 | 341 | 195 | 146 | 62 | 0 |
import Data.Char (ord)
import Data.List
main = do
str <- readFile "Problem0022.txt"
print $ problem22Value str
problem22Value :: String -> Int
problem22Value str = sum $ getNameScores $ sort $ lines str
getNameScores :: [String] -> [Int]
getNameScores names = getNameScores' 1 names
where getNameScores' _... | jchitel/ProjectEuler.hs | Problems/Problem0022.hs | mit | 573 | 0 | 11 | 113 | 230 | 119 | 111 | 15 | 2 |
module Cube
( draw
) where
import qualified Graphics.Rendering.OpenGL as GL
draw :: GL.GLfloat -> IO ()
draw s = do
GL.scale s s s
GL.renderPrimitive GL.Quads $ do
-- front
GL.color red
GL.normal (GL.Normal3 z z p1)
GL.vertex (GL.Vertex3 n1 n1 p1)
GL.vertex (GL.Ve... | spetz911/progames | GLFW/src1/Cube.hs | mit | 1,778 | 0 | 13 | 614 | 814 | 382 | 432 | 51 | 1 |
-- This module was formerly called "HugsUtils" - but it was
-- too messy to make it a "standard Hugs library" so we moved it
-- over here.
module Haskore.Utils(
assert,
unlinesS, concatS, rightS, leftS, centreS,
right, left, centre, spaces,
andOnError, butOnError,
zeroOrMore, oneOrMore,
) where
import C... | yav/haskore-vintage | src/Haskore/Utils.hs | mit | 3,119 | 10 | 10 | 754 | 712 | 404 | 308 | 35 | 1 |
import System.Random as Random
removeAt :: Int -> [a] -> [a]
removeAt _ [] = []
removeAt 0 (h:t) = t
removeAt x list | x > length list - 1 = error ("list doesnt have index " ++ show x)
| x < 0 = error "X cannot be negative"
| x > 0 = l1 ++ t2
... | andrewaguiar/s99-haskell | p25.hs | mit | 674 | 0 | 11 | 249 | 257 | 128 | 129 | 14 | 1 |
module Stackage.CLI.Setup (
-- TODO
) where
-- TODO: move functionality from main/StackageSetup.hs
| fpco/stackage-setup | src/Stackage/CLI/Setup.hs | mit | 104 | 0 | 3 | 18 | 12 | 9 | 3 | 1 | 0 |
{-# LANGUAGE PartialTypeSignatures #-}
module Ohua.Feature.TailRec.Passes.DFLang where
import Ohua.Prelude
import Ohua.DFLang.Lang
import Ohua.DFLang.Refs as Refs
import Ohua.DFLang.Util
import qualified Ohua.Feature.TailRec.Passes.ALang as ALangPass
import Data.Sequence as DS (fromList)
recurLowering :: DFExpr ->... | ohua-dev/ohua-core | core/src/Ohua/Feature/TailRec/Passes/DFLang.hs | epl-1.0 | 2,384 | 0 | 18 | 896 | 430 | 233 | 197 | 36 | 5 |
{- Copyright (c) 2005 John Goerzen
<jgoerzen@complete.org>
Please see the COPYRIGHT file
-}
module Config where
import System.Posix.User
import System.Directory
import Data.ConfigFile
import Data.Either.Utils
import Control.Monad
import Data.String.Utils
import Text.Regex
getHomeDir = do uid <- getEffectiveUserID
... | jgoerzen/darcs-buildpackage | Config.hs | gpl-2.0 | 1,697 | 0 | 13 | 485 | 431 | 209 | 222 | 37 | 2 |
module Matrizer.MTypes where
import qualified Data.Map as Map
import Text.Parsec
import Control.Monad.Error
----------------------------------------------------------------------
-- AST Definition
-----------------------------------------------------------------------
type VarName = String
data Expr = Leaf VarName... | davmre/matrizer | src/Matrizer/MTypes.hs | gpl-2.0 | 8,206 | 0 | 15 | 2,095 | 2,019 | 1,045 | 974 | 159 | 2 |
{- Copyright (c) 2006 John Goerzen
<jgoerzen@complete.org>
Please see the COPYRIGHT file
-}
module Config where
import MissingH.ConfigParser
import Database.HDBC.PostgreSQL
import Database.HDBC.ODBC
import Database.HDBC
import System.IO
import Monad
import MissingH.Either
import System.Directory
loadCP :: IO ConfigPa... | jgoerzen/blogcvt | Config.hs | gpl-2.0 | 848 | 0 | 11 | 182 | 208 | 105 | 103 | 23 | 3 |
--
-- Copyright (c) 2011 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... | OpenXT/manager | upgrade-db/UpgradeEngine.hs | gpl-2.0 | 4,126 | 0 | 15 | 964 | 757 | 397 | 360 | 75 | 2 |
process s = do
upStr <- upCase s
tell "toWords "
return (words upStr) | hmemcpy/milewski-ctfp-pdf | src/content/3.4/code/haskell/snippet22.hs | gpl-3.0 | 81 | 0 | 9 | 25 | 37 | 15 | 22 | 4 | 1 |
module Test
where
import System.Random (randomRIO)
import Data.Array.IO
import Control.Monad
updateWeights :: Double -> Double -> [Double] -> [Double] -> [Double]
updateWeights learnRate error inputs weights =
zipWith (\x y -> x * y * learnRate * error) inputs weights
step :: Double -> Bool
step n = if ... | bernilsson/Perceptron | src/Test.hs | gpl-3.0 | 3,678 | 0 | 13 | 935 | 1,041 | 567 | 474 | -1 | -1 |
module Main where
boombang xs = [if (x < 10) then "BOOM!" else "BANG!" | x <- xs, odd x] | yumerov/haskell-study | learnyouahaskell/00-starting-out/boom-bang.hs | gpl-3.0 | 89 | 0 | 8 | 20 | 45 | 25 | 20 | 2 | 2 |
module KRPCHS.SpaceCenter
( AntennaState(..)
, CameraMode(..)
, CargoBayState(..)
, CommLinkType(..)
, ContractState(..)
, ControlSource(..)
, ControlState(..)
, DockingPortState(..)
, LegState(..)
, MotorState(..)
, ParachuteState(..)
, RadiatorState(..)
, ResourceConverterState(..)
, ResourceFlowMode(..)
, ResourceHa... | Cahu/krpc-hs | src/KRPCHS/SpaceCenter.hs | gpl-3.0 | 737,499 | 0 | 14 | 97,100 | 144,303 | 73,302 | 71,001 | 11,145 | 1 |
module System.Log where
import qualified Control.Concurrent as Concurrent
import qualified Control.Concurrent.Async as Async
import qualified Control.Concurrent.STM as STM
import qualified Control.Concurrent.STM.TChan as TChan
import qualified Control.Concurrent.STM.TVar as TVar
import qualified Control.Monad as Monad... | abayley/netpoll | src/System/Log.hs | gpl-3.0 | 5,593 | 0 | 17 | 1,225 | 1,694 | 856 | 838 | 117 | 3 |
module Handler.ProductList where
import Import
getProductListR :: Handler Value
getProductListR = do
prods <- runDB $ selectList [] [Asc ProductName]
variants <- runDB $ selectList [] [Asc ProductVariantSku]
returnJson $ object ["product" .= prods, "productVariant" .= variants]
postProductLis... | Southern-Exposure-Seed-Exchange/Order-Manager-Prototypes | yesod/Handler/ProductList.hs | gpl-3.0 | 751 | 0 | 11 | 191 | 215 | 105 | 110 | 19 | 1 |
{- |
Module : Web.Handler
Description : Application-specific handler functions.
Copyright : (c) 2011 Cedric Staub, 2012 Benedikt Schmidt
License : GPL-3
Maintainer : Cedric Staub <cstaub@ethz.ch>
Stability : experimental
Portability : non-portable
-}
{-# LANGUAGE
OverloadedStrings, QuasiQuote... | ekr/tamarin-prover | src/Web/Handler.hs | gpl-3.0 | 44,176 | 520 | 24 | 12,734 | 8,245 | 4,349 | 3,896 | 674 | 8 |
{-# 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/Orders/CanceltestOrderbycustomer.hs | mpl-2.0 | 6,340 | 0 | 20 | 1,539 | 882 | 511 | 371 | 135 | 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-efs/gen/Network/AWS/EFS/DeleteMountTarget.hs | mpl-2.0 | 4,140 | 0 | 9 | 746 | 364 | 232 | 132 | 49 | 1 |
module Main (Test()) where
| lspitzner/brittany | data/Test139.hs | agpl-3.0 | 27 | 0 | 5 | 4 | 12 | 8 | 4 | 3 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.